Problem solving with genetic algorithms and Splicer
NASA Technical Reports Server (NTRS)
Bayer, Steven E.; Wang, Lui
1991-01-01
Genetic algorithms are highly parallel, adaptive search procedures (i.e., problem-solving methods) loosely based on the processes of population genetics and Darwinian survival of the fittest. Genetic algorithms have proven useful in domains where other optimization techniques perform poorly. The main purpose of the paper is to discuss a NASA-sponsored software development project to develop a general-purpose tool for using genetic algorithms. The tool, called Splicer, can be used to solve a wide variety of optimization problems and is currently available from NASA and COSMIC. This discussion is preceded by an introduction to basic genetic algorithm concepts and a discussion of genetic algorithm applications.
Problem Solving with Generic Algorithms and Computers.
ERIC Educational Resources Information Center
Larson, Jay
Success in using a computer in education as a problem-solving tool requires a change in the way of thinking or of approaching a problem. An algorithm, i.e., a finite step-by-step solution to a problem, can be designed around the data processing concepts of input, processing, and output to provide a basis for classifying problems. If educators…
Solving Maximal Clique Problem through Genetic Algorithm
NASA Astrophysics Data System (ADS)
Rajawat, Shalini; Hemrajani, Naveen; Menghani, Ekta
2010-11-01
Genetic algorithm is one of the most interesting heuristic search techniques. It depends basically on three operations; selection, crossover and mutation. The outcome of the three operations is a new population for the next generation. Repeating these operations until the termination condition is reached. All the operations in the algorithm are accessible with today's molecular biotechnology. The simulations show that with this new computing algorithm, it is possible to get a solution from a very small initial data pool, avoiding enumerating all candidate solutions. For randomly generated problems, genetic algorithm can give correct solution within a few cycles at high probability.
Fourth Order Algorithms for Solving Diverse Many-Body Problems
NASA Astrophysics Data System (ADS)
Chin, Siu A.; Forbert, Harald A.; Chen, Chia-Rong; Kidwell, Donald W.; Ciftja, Orion
2001-03-01
We show that the method of factorizing an evolution operator of the form e^ɛ(A+B) to fourth order with purely positive coefficient yields new classes of symplectic algorithms for solving classical dynamical problems, unitary algorithms for solving the time-dependent Schrödinger equation, norm preserving algorithms for solving the Langevin equation and large time step convergent Diffusion Monte Carlo algorithms. Results for each class of problems will be presented and disucss
Problem Solving Techniques for the Design of Algorithms.
ERIC Educational Resources Information Center
Kant, Elaine; Newell, Allen
1984-01-01
Presents model of algorithm design (activity in software development) based on analysis of protocols of two subjects designing three convex hull algorithms. Automation methods, methods for studying algorithm design, role of discovery in problem solving, and comparison of different designs of case study according to model are highlighted.…
A domain decomposition algorithm for solving large elliptic problems
Nolan, M.P.
1991-01-01
AN algorithm which efficiently solves large systems of equations arising from the discretization of a single second-order elliptic partial differential equation is discussed. The global domain is partitioned into not necessarily disjoint subdomains which are traversed using the Schwarz Alternating Procedure. On each subdomain the multigrid method is used to advance the solution. The algorithm has the potential to decrease solution time when data is stored across multiple levels of a memory hierarchy. Results are presented for a virtual memory, vector multiprocessor architecture. A study of choice of inner iteration procedure and subdomain overlap is presented for a model problem, solved with two and four subdomains, sequentially and in parallel. Microtasking multiprocessing results are reported for multigrid on the Alliant FX-8 vector-multiprocessor. A convergence proof for a class of matrix splittings for the two-dimensional Helmholtz equation is given. 70 refs., 3 figs., 20 tabs.
ERIC Educational Resources Information Center
Kinsella, John J.
1970-01-01
Discussed are the nature of a mathematical problem, problem solving in the traditional and modern mathematics programs, problem solving and psychology, research related to problem solving, and teaching problem solving in algebra and geometry. (CT)
General heuristics algorithms for solving capacitated arc routing problem
NASA Astrophysics Data System (ADS)
Fadzli, Mohammad; Najwa, Nurul; Masran, Hafiz
2015-05-01
In this paper, we try to determine the near-optimum solution for the capacitated arc routing problem (CARP). In general, NP-hard CARP is a special graph theory specifically arises from street services such as residential waste collection and road maintenance. By purpose, the design of the CARP model and its solution techniques is to find optimum (or near-optimum) routing cost for a fleet of vehicles involved in operation. In other words, finding minimum-cost routing is compulsory in order to reduce overall operation cost that related with vehicles. In this article, we provide a combination of various heuristics algorithm to solve a real case of CARP in waste collection and benchmark instances. These heuristics work as a central engine in finding initial solutions or near-optimum in search space without violating the pre-setting constraints. The results clearly show that these heuristics algorithms could provide good initial solutions in both real-life and benchmark instances.
Solving the time dependent vehicle routing problem by metaheuristic algorithms
NASA Astrophysics Data System (ADS)
Johar, Farhana; Potts, Chris; Bennell, Julia
2015-02-01
The problem we consider in this study is Time Dependent Vehicle Routing Problem (TDVRP) which has been categorized as non-classical VRP. It is motivated by the fact that multinational companies are currently not only manufacturing the demanded products but also distributing them to the customer location. This implies an efficient synchronization of production and distribution activities. Hence, this study will look into the routing of vehicles which departs from the depot at varies time due to the variation in manufacturing process. We consider a single production line where demanded products are being process one at a time once orders have been received from the customers. It is assumed that order released from the production line will be loaded into scheduled vehicle which ready to be delivered. However, the delivery could only be done once all orders scheduled in the vehicle have been released from the production line. Therefore, there could be lateness on the delivery process from awaiting all customers' order of the route to be released. Our objective is to determine a schedule for vehicle routing that minimizes the solution cost including the travelling and tardiness cost. A mathematical formulation is developed to represent the problem and will be solved by two metaheuristics; Variable Neighborhood Search (VNS) and Tabu Search (TS). These algorithms will be coded in C ++ programming and run using 56's Solomon instances with some modification. The outcome of this experiment can be interpreted as the quality criteria of the different approximation methods. The comparison done shown that VNS gave the better results while consuming reasonable computational efforts.
In this paper we develop and computationally test three implicit enumeration algorithms for solving the asymmetric traveling salesman problem. All...three algorithms use the assignment problem relaxation of the traveling salesman problem with subtour elimination similar to the previous approaches by...previous subtour elimination algorithms and (2) the 1-arborescence approach of Held and Karp for the asymmetric traveling salesman problem.
Duan, Qian-Qian; Yang, Gen-Ke; Pan, Chang-Chun
2014-01-01
A hybrid optimization algorithm combining finite state method (FSM) and genetic algorithm (GA) is proposed to solve the crude oil scheduling problem. The FSM and GA are combined to take the advantage of each method and compensate deficiencies of individual methods. In the proposed algorithm, the finite state method makes up for the weakness of GA which is poor at local searching ability. The heuristic returned by the FSM can guide the GA algorithm towards good solutions. The idea behind this is that we can generate promising substructure or partial solution by using FSM. Furthermore, the FSM can guarantee that the entire solution space is uniformly covered. Therefore, the combination of the two algorithms has better global performance than the existing GA or FSM which is operated individually. Finally, a real-life crude oil scheduling problem from the literature is used for conducting simulation. The experimental results validate that the proposed method outperforms the state-of-art GA method. PMID:24772031
Duan, Qian-Qian; Yang, Gen-Ke; Pan, Chang-Chun
2014-01-01
A hybrid optimization algorithm combining finite state method (FSM) and genetic algorithm (GA) is proposed to solve the crude oil scheduling problem. The FSM and GA are combined to take the advantage of each method and compensate deficiencies of individual methods. In the proposed algorithm, the finite state method makes up for the weakness of GA which is poor at local searching ability. The heuristic returned by the FSM can guide the GA algorithm towards good solutions. The idea behind this is that we can generate promising substructure or partial solution by using FSM. Furthermore, the FSM can guarantee that the entire solution space is uniformly covered. Therefore, the combination of the two algorithms has better global performance than the existing GA or FSM which is operated individually. Finally, a real-life crude oil scheduling problem from the literature is used for conducting simulation. The experimental results validate that the proposed method outperforms the state-of-art GA method.
A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems.
Ali, Ahmed F; Tawhid, Mohamed A
2016-01-01
Cuckoo search algorithm is a promising metaheuristic population based method. It has been applied to solve many real life problems. In this paper, we propose a new cuckoo search algorithm by combining the cuckoo search algorithm with the Nelder-Mead method in order to solve the integer and minimax optimization problems. We call the proposed algorithm by hybrid cuckoo search and Nelder-Mead method (HCSNM). HCSNM starts the search by applying the standard cuckoo search for number of iterations then the best obtained solution is passing to the Nelder-Mead algorithm as an intensification process in order to accelerate the search and overcome the slow convergence of the standard cuckoo search algorithm. The proposed algorithm is balancing between the global exploration of the Cuckoo search algorithm and the deep exploitation of the Nelder-Mead method. We test HCSNM algorithm on seven integer programming problems and ten minimax problems and compare against eight algorithms for solving integer programming problems and seven algorithms for solving minimax problems. The experiments results show the efficiency of the proposed algorithm and its ability to solve integer and minimax optimization problems in reasonable time.
An Algorithm for Solving Interval Linear Programming Problems
1974-11-01
34regularized" a lä Chames -Cooper so that infeasibility is determined at optimal solution if that is the case. If I(x*(v)) - 0 then x*(v) is an... Chames and Cooper J3]) may be used to compute the new inverse. Theorem 2 The algorithm described above terminates in a finite number of steps...I J 19- REFERENCES 1) A. Ben-Israel and A. Chames , "An Explicit Solution of A Special Class of Linear Programming Problems", Operations
An efficient algorithm for solving the gravity problem of finding a density in a horizontal layer
NASA Astrophysics Data System (ADS)
Akimova, Elena N.; Martyshko, Peter S.; Misilov, Vladimir E.; Kosivets, Rostislav A.
2016-06-01
An efficient algorithm for solving the inverse gravity problem of finding a variable density in a horizontal layer using gravitational data is constructed. After the discretization and approximation, the problem reduces to solving a system of linear algebraic equations. The idea of this algorithm is based on exploiting the block-Toeplitz structure of coefficients matrix. Utilizing this algorithm drastically reduces the memory usage, as well as the computation time. The algorithm was parallelized and implemented using the Uran supercomputer. A model problem with synthetic gravitational data was solved.
Assessment Guidelines for Ant Colony Algorithms when Solving Quadratic Assignment Problems
NASA Astrophysics Data System (ADS)
See, Phen Chiak; Yew Wong, Kuan; Komarudin, Komarudin
2009-08-01
To date, no consensus exists on how to evaluate the performance of a new Ant Colony Optimization (ACO) algorithm when solving Quadratic Assignment Problems (QAPs). Different performance measures and problems sets are used by researchers to evaluate their algorithms. This paper is aimed to provide a recapitulation of the relevant issues and suggest some guidelines for assessing the performance of new ACO algorithms.
Combination of Chaotic Neurodynamics with the 2-opt Algorithm to Solve Traveling Salesman Problems
NASA Astrophysics Data System (ADS)
Hasegawa, M.; Ikeguchi, T.; Aihara, K.
1997-09-01
We propose a novel approach for combinatorial optimization problems. For solving the traveling salesman problems, we combine chaotic neurodynamics with heuristic algorithm. We select the heuristic algorithm of 2-opt as a basic part, because it is well understood that this simple algorithm is very effective for the traveling salesman problems. Although the conventional approaches with chaotic neurodynamics were only applied to such very small problems as 10 cities, our method exhibits higher performance for larger size problems with the order of 102.
2015-01-01
Optimization and 2) hybrid metaheuristics algorithm comprising a combination of ACO, Genetic Algorithm (GA) and heuristics are proposed and tested on...Optimization, Split Delivery Vehicle Routing Problem, Genetic Algorithm 1. Introduction The Vehicle Routing Problem (VRP) is a prominent problem in the areas...several heuristic methods have been applied to solve the SDVRP, such as a construction heuristic (Wilck and Cavalier, 2012a), a genetic algorithm (Wilck
ERIC Educational Resources Information Center
Dershem, Herbert L.
These modules view aspects of computer use in the problem-solving process, and introduce techniques and ideas that are applicable to other modes of problem solving. The first unit looks at algorithms, flowchart language, and problem-solving steps that apply this knowledge. The second unit describes ways in which computer iteration may be used…
Greedy heuristic algorithm for solving series of eee components classification problems*
NASA Astrophysics Data System (ADS)
Kazakovtsev, A. L.; Antamoshkin, A. N.; Fedosov, V. V.
2016-04-01
Algorithms based on using the agglomerative greedy heuristics demonstrate precise and stable results for clustering problems based on k- means and p-median models. Such algorithms are successfully implemented in the processes of production of specialized EEE components for using in space systems which include testing each EEE device and detection of homogeneous production batches of the EEE components based on results of the tests using p-median models. In this paper, authors propose a new version of the genetic algorithm with the greedy agglomerative heuristic which allows solving series of problems. Such algorithm is useful for solving the k-means and p-median clustering problems when the number of clusters is unknown. Computational experiments on real data show that the preciseness of the result decreases insignificantly in comparison with the initial genetic algorithm for solving a single problem.
Qualls, Joseph; Russomanno, David J.
2011-01-01
The lack of knowledge models to represent sensor systems, algorithms, and missions makes opportunistically discovering a synthesis of systems and algorithms that can satisfy high-level mission specifications impractical. A novel ontological problem-solving framework has been designed that leverages knowledge models describing sensors, algorithms, and high-level missions to facilitate automated inference of assigning systems to subtasks that may satisfy a given mission specification. To demonstrate the efficacy of the ontological problem-solving architecture, a family of persistence surveillance sensor systems and algorithms has been instantiated in a prototype environment to demonstrate the assignment of systems to subtasks of high-level missions. PMID:22164081
The backtracking survey propagation algorithm for solving random K-SAT problems
Marino, Raffaele; Parisi, Giorgio; Ricci-Tersenghi, Federico
2016-01-01
Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances. Moreover, it is still unclear what are the key features that make a discrete combinatorial optimization problem hard to solve. Here we study random K-satisfiability problems with K=3,4, which are known to be very hard close to the SAT-UNSAT threshold, where problems stop having solutions. We show that the backtracking survey propagation algorithm, in a time practically linear in the problem size, is able to find solutions very close to the threshold, in a region unreachable by any other algorithm. All solutions found have no frozen variables, thus supporting the conjecture that only unfrozen solutions can be found in linear time, and that a problem becomes impossible to solve in linear time when all solutions contain frozen variables. PMID:27694952
The backtracking survey propagation algorithm for solving random K-SAT problems
NASA Astrophysics Data System (ADS)
Marino, Raffaele; Parisi, Giorgio; Ricci-Tersenghi, Federico
2016-10-01
Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances. Moreover, it is still unclear what are the key features that make a discrete combinatorial optimization problem hard to solve. Here we study random K-satisfiability problems with K=3,4, which are known to be very hard close to the SAT-UNSAT threshold, where problems stop having solutions. We show that the backtracking survey propagation algorithm, in a time practically linear in the problem size, is able to find solutions very close to the threshold, in a region unreachable by any other algorithm. All solutions found have no frozen variables, thus supporting the conjecture that only unfrozen solutions can be found in linear time, and that a problem becomes impossible to solve in linear time when all solutions contain frozen variables.
Salcedo-Sanz, S; Del Ser, J; Landa-Torres, I; Gil-López, S; Portilla-Figueras, J A
2014-01-01
This paper presents a novel bioinspired algorithm to tackle complex optimization problems: the coral reefs optimization (CRO) algorithm. The CRO algorithm artificially simulates a coral reef, where different corals (namely, solutions to the optimization problem considered) grow and reproduce in coral colonies, fighting by choking out other corals for space in the reef. This fight for space, along with the specific characteristics of the corals' reproduction, produces a robust metaheuristic algorithm shown to be powerful for solving hard optimization problems. In this research the CRO algorithm is tested in several continuous and discrete benchmark problems, as well as in practical application scenarios (i.e., optimum mobile network deployment and off-shore wind farm design). The obtained results confirm the excellent performance of the proposed algorithm and open line of research for further application of the algorithm to real-world problems.
Salcedo-Sanz, S.; Del Ser, J.; Landa-Torres, I.; Gil-López, S.; Portilla-Figueras, J. A.
2014-01-01
This paper presents a novel bioinspired algorithm to tackle complex optimization problems: the coral reefs optimization (CRO) algorithm. The CRO algorithm artificially simulates a coral reef, where different corals (namely, solutions to the optimization problem considered) grow and reproduce in coral colonies, fighting by choking out other corals for space in the reef. This fight for space, along with the specific characteristics of the corals' reproduction, produces a robust metaheuristic algorithm shown to be powerful for solving hard optimization problems. In this research the CRO algorithm is tested in several continuous and discrete benchmark problems, as well as in practical application scenarios (i.e., optimum mobile network deployment and off-shore wind farm design). The obtained results confirm the excellent performance of the proposed algorithm and open line of research for further application of the algorithm to real-world problems. PMID:25147860
Application of the artificial bee colony algorithm for solving the set covering problem.
Crawford, Broderick; Soto, Ricardo; Cuesta, Rodrigo; Paredes, Fernando
2014-01-01
The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our artificial bee colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches for the set covering problem.
Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem
Crawford, Broderick; Soto, Ricardo; Cuesta, Rodrigo; Paredes, Fernando
2014-01-01
The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our artificial bee colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches for the set covering problem. PMID:24883356
NASA Astrophysics Data System (ADS)
Marwati, Rini; Yulianti, Kartika; Pangestu, Herny Wulandari
2016-02-01
A fuzzy evolutionary algorithm is an integration of an evolutionary algorithm and a fuzzy system. In this paper, we present an application of a genetic algorithm to a fuzzy evolutionary algorithm to detect and to solve chromosomes conflict. A chromosome conflict is identified by existence of any two genes in a chromosome that has the same values as two genes in another chromosome. Based on this approach, we construct an algorithm to solve a lecture scheduling problem. Time codes, lecture codes, lecturer codes, and room codes are defined as genes. They are collected to become chromosomes. As a result, the conflicted schedule turns into chromosomes conflict. Built in the Delphi program, results show that the conflicted lecture schedule problem is solvable by this algorithm.
Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem.
Al-Mulhem, M; Al-Maghrabi, T
1998-01-01
This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). It begins with a brief introduction to the TSP and the E-TSP. Then, it presents the proposed algorithm with its two major components: the convex-elastic net (CEN) algorithm and the nondeterministic iterative improvement (NII) algorithm. These two algorithms are combined into the efficient convex-elastic net (ECEN) algorithm. The CEN algorithm integrates the convex-hull property and elastic net algorithm to generate an initial tour for the E-TSP. The NII algorithm uses two rearrangement operators to improve the initial tour given by the CEN algorithm. The paper presents simulation results for two instances of E-TSP: randomly generated tours and tours for well-known problems in the literature. Experimental results are given to show that the proposed algorithm ran find the nearly optimal solution for the E-TSP that outperform many similar algorithms reported in the literature. The paper concludes with the advantages of the new algorithm and possible extensions.
Using Grey Wolf Algorithm to Solve the Capacitated Vehicle Routing Problem
NASA Astrophysics Data System (ADS)
Korayem, L.; Khorsid, M.; Kassem, S. S.
2015-05-01
The capacitated vehicle routing problem (CVRP) is a class of the vehicle routing problems (VRPs). In CVRP a set of identical vehicles having fixed capacities are required to fulfill customers' demands for a single commodity. The main objective is to minimize the total cost or distance traveled by the vehicles while satisfying a number of constraints, such as: the capacity constraint of each vehicle, logical flow constraints, etc. One of the methods employed in solving the CVRP is the cluster-first route-second method. It is a technique based on grouping of customers into a number of clusters, where each cluster is served by one vehicle. Once clusters are formed, a route determining the best sequence to visit customers is established within each cluster. The recently bio-inspired grey wolf optimizer (GWO), introduced in 2014, has proven to be efficient in solving unconstrained, as well as, constrained optimization problems. In the current research, our main contributions are: combining GWO with the traditional K-means clustering algorithm to generate the ‘K-GWO’ algorithm, deriving a capacitated version of the K-GWO algorithm by incorporating a capacity constraint into the aforementioned algorithm, and finally, developing 2 new clustering heuristics. The resulting algorithm is used in the clustering phase of the cluster-first route-second method to solve the CVR problem. The algorithm is tested on a number of benchmark problems with encouraging results.
Simulated annealing algorithm for solving chambering student-case assignment problem
NASA Astrophysics Data System (ADS)
Ghazali, Saadiah; Abdul-Rahman, Syariza
2015-12-01
The problem related to project assignment problem is one of popular practical problem that appear nowadays. The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased. This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem. The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. The problem of assigning chambering students to cases has never been addressed in the literature before. For the proposed problem, it is essential for law graduates to peruse in chambers before they are qualified to become legal counselor. Thus, assigning the chambering students to cases is a critically needed especially when involving many preferences. Hence, this study presents a preliminary study of the proposed project assignment problem. The objective of the study is to minimize the total completion time for all students in solving the given cases. This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution. The search then is preceded with a simulated annealing algorithm for further improvement of solution quality. The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. Hence, this research has demonstrated the advantages of solving project assignment problem by using metaheuristic techniques.
Heuristic algorithms for solving of the tool routing problem for CNC cutting machines
NASA Astrophysics Data System (ADS)
Chentsov, P. A.; Petunin, A. A.; Sesekin, A. N.; Shipacheva, E. N.; Sholohov, A. E.
2015-11-01
The article is devoted to the problem of minimizing the path of the cutting tool to shape cutting machines began. This problem can be interpreted as a generalized traveling salesman problem. Earlier version of the dynamic programming method to solve this problem was developed. Unfortunately, this method allows to process an amount not exceeding thirty circuits. In this regard, the task of constructing quasi-optimal route becomes relevant. In this paper we propose options for quasi-optimal greedy algorithms. Comparison of the results of exact and approximate algorithms is given.
A parallel algorithm for solving the n-queens problem based on inspired computational model.
Wang, Zhaocai; Huang, Dongmei; Tan, Jian; Liu, Taigang; Zhao, Kai; Li, Lei
2015-05-01
DNA computing provides a promising method to solve the computationally intractable problems. The n-queens problem is a well-known NP-hard problem, which arranges n queens on an n × n board in different rows, columns and diagonals in order to avoid queens attack each other. In this paper, we present a novel parallel DNA algorithm for solving the n-queens problem using DNA molecular operations based on a biologically inspired computational model. For the n-queens problem, we reasonably design flexible length DNA strands representing elements of the allocation matrix, take appropriate biologic manipulations and get the solutions of the n-queens problem in proper length and O(n(2)) time complexity. We extend the application of DNA molecular operations, simultaneity simplify the complexity of the computation and simulate to verify the feasibility of the DNA algorithm.
Liu, Haorui; Yi, Fengyan; Yang, Heli
2016-01-01
The shuffled frog leaping algorithm (SFLA) easily falls into local optimum when it solves multioptimum function optimization problem, which impacts the accuracy and convergence speed. Therefore this paper presents grouped SFLA for solving continuous optimization problems combined with the excellent characteristics of cloud model transformation between qualitative and quantitative research. The algorithm divides the definition domain into several groups and gives each group a set of frogs. Frogs of each region search in their memeplex, and in the search process the algorithm uses the “elite strategy” to update the location information of existing elite frogs through cloud model algorithm. This method narrows the searching space and it can effectively improve the situation of a local optimum; thus convergence speed and accuracy can be significantly improved. The results of computer simulation confirm this conclusion. PMID:26819584
Liu, Haorui; Yi, Fengyan; Yang, Heli
2016-01-01
The shuffled frog leaping algorithm (SFLA) easily falls into local optimum when it solves multioptimum function optimization problem, which impacts the accuracy and convergence speed. Therefore this paper presents grouped SFLA for solving continuous optimization problems combined with the excellent characteristics of cloud model transformation between qualitative and quantitative research. The algorithm divides the definition domain into several groups and gives each group a set of frogs. Frogs of each region search in their memeplex, and in the search process the algorithm uses the "elite strategy" to update the location information of existing elite frogs through cloud model algorithm. This method narrows the searching space and it can effectively improve the situation of a local optimum; thus convergence speed and accuracy can be significantly improved. The results of computer simulation confirm this conclusion.
The delayed coupling method: An algorithm for solving banded diagonal matrix problems in parallel
Mattor, N.; Williams, T.J.; Hewett, D.W.; Dimits, A.M.
1997-09-01
We present a new algorithm for solving banded diagonal matrix problems efficiently on distributed-memory parallel computers, designed originally for use in dynamic alternating-direction implicit partial differential equation solvers. The algorithm optimizes efficiency with respect to the number of numerical operations and to the amount of interprocessor communication. This is called the ``delayed coupling method`` because the communication is deferred until needed. We focus here on tridiagonal and periodic tridiagonal systems.
Tracking Problem Solving by Multivariate Pattern Analysis and Hidden Markov Model Algorithms
ERIC Educational Resources Information Center
Anderson, John R.
2012-01-01
Multivariate pattern analysis can be combined with Hidden Markov Model algorithms to track the second-by-second thinking as people solve complex problems. Two applications of this methodology are illustrated with a data set taken from children as they interacted with an intelligent tutoring system for algebra. The first "mind reading" application…
One algorithm for branch and bound method for solving concave optimization problem
NASA Astrophysics Data System (ADS)
Andrianova, A. A.; Korepanova, A. A.; Halilova, I. F.
2016-11-01
The article describes the algorithm for branch and bound method for solving the concave programming problem, which is based on the idea of similarity the necessary and sufficient conditions of optimum for the original problem and for a convex programming problem with another feasible set and reverse the sign of the objective function. To find the feasible set of the equivalent convex programming problem we construct an algorithm using the idea of the branch and bound method. We formulate various branching techniques and discusses the construction of the lower objective function evaluations for the node of the decision tree. The article discusses the results of experiments of this algorithm for some famous test problems of a particular form.
A cuckoo search algorithm by Lévy flights for solving reliability redundancy allocation problems
NASA Astrophysics Data System (ADS)
Valian, Ehsan; Valian, Elham
2013-11-01
A new metaheuristic optimization algorithm, called cuckoo search (CS), was recently developed by Yang and Deb (2009, 2010). This article uses CS and Lévy flights to solve the reliability redundancy allocation problem. The redundancy allocation problem involves setting reliability objectives for components or subsystems in order to meet the resource consumption constraint, e.g. the total cost. The difficulties facing the redundancy allocation problem are to maintain feasibility with respect to three nonlinear constraints, namely, cost, weight and volume-related constraints. The redundancy allocation problems have been studied in the literature for decades, usually using mathematical programming or metaheuristic optimization algorithms. The performance of the algorithm is tested on five well-known reliability redundancy allocation problems and is compared with several well-known methods. Simulation results demonstrate that the optimal solutions obtained by CS are better than the best solutions obtained by other methods.
The minimal residual QR-factorization algorithm for reliably solving subset regression problems
NASA Technical Reports Server (NTRS)
Verhaegen, M. H.
1987-01-01
A new algorithm to solve test subset regression problems is described, called the minimal residual QR factorization algorithm (MRQR). This scheme performs a QR factorization with a new column pivoting strategy. Basically, this strategy is based on the change in the residual of the least squares problem. Furthermore, it is demonstrated that this basic scheme might be extended in a numerically efficient way to combine the advantages of existing numerical procedures, such as the singular value decomposition, with those of more classical statistical procedures, such as stepwise regression. This extension is presented as an advisory expert system that guides the user in solving the subset regression problem. The advantages of the new procedure are highlighted by a numerical example.
Liu, Derong; Li, Hongliang; Wang, Ding
2015-06-01
In this paper, we establish error bounds of adaptive dynamic programming algorithms for solving undiscounted infinite-horizon optimal control problems of discrete-time deterministic nonlinear systems. We consider approximation errors in the update equations of both value function and control policy. We utilize a new assumption instead of the contraction assumption in discounted optimal control problems. We establish the error bounds for approximate value iteration based on a new error condition. Furthermore, we also establish the error bounds for approximate policy iteration and approximate optimistic policy iteration algorithms. It is shown that the iterative approximate value function can converge to a finite neighborhood of the optimal value function under some conditions. To implement the developed algorithms, critic and action neural networks are used to approximate the value function and control policy, respectively. Finally, a simulation example is given to demonstrate the effectiveness of the developed algorithms.
Experimental realization of a one-way quantum computer algorithm solving Simon's problem.
Tame, M S; Bell, B A; Di Franco, C; Wadsworth, W J; Rarity, J G
2014-11-14
We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's problem-a black-box period-finding problem that has an exponential gap between the classical and quantum runtime. Using an all-optical setup and modifying the bases of single-qubit measurements on a five-qubit cluster state, key representative functions of the logical two-qubit version's black box can be queried and solved. To the best of our knowledge, this work represents the first experimental realization of the quantum algorithm solving Simon's problem. The experimental results are in excellent agreement with the theoretical model, demonstrating the successful performance of the algorithm. With a view to scaling up to larger numbers of qubits, we analyze the resource requirements for an n-qubit version. This work helps highlight how one-way quantum computing provides a practical route to experimentally investigating the quantum-classical gap in the query complexity model.
A firefly algorithm for solving competitive location-design problem: a case study
NASA Astrophysics Data System (ADS)
Sadjadi, Seyed Jafar; Ashtiani, Milad Gorji; Ramezanian, Reza; Makui, Ahmad
2016-07-01
This paper aims at determining the optimal number of new facilities besides specifying both the optimal location and design level of them under the budget constraint in a competitive environment by a novel hybrid continuous and discrete firefly algorithm. A real-world application of locating new chain stores in the city of Tehran, Iran, is used and the results are analyzed. In addition, several examples have been solved to evaluate the efficiency of the proposed model and algorithm. The results demonstrate that the performed method provides good-quality results for the test problems.
A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
NASA Astrophysics Data System (ADS)
Tamascelli, Dario; Zanetti, Luca
2014-08-01
We present a quantum algorithm for solving graph isomorphism problems that is based on an adiabatic protocol. We use a collection of continuous time quantum walks, each one generated by an XY Hamiltonian, to visit the configuration space. In this way we avoid a diffusion over all the possible configurations and significantly reduce the dimensionality of the accessible Hilbert space. Within this restricted space, the graph isomorphism problem can be translated into searching for a satisfying assignment to a 2-SAT (satisfiable) formula and mapped onto a 2-local Hamiltonian without resorting to perturbation gadgets or projective techniques. We present an analysis of the time for execution of the algorithm on small graph isomorphism problem instances and discuss the issue of an implementation of the proposed adiabatic scheme on current quantum computing hardware.
Solving the vehicle routing problem by a hybrid meta-heuristic algorithm
NASA Astrophysics Data System (ADS)
Yousefikhoshbakht, Majid; Khorram, Esmaile
2012-08-01
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the total distance traveled by all the vehicles. This paper presents a hybrid two-phase algorithm called sweep algorithm (SW) + ant colony system (ACS) for the classical VRP. At the first stage, the VRP is solved by the SW, and at the second stage, the ACS and 3-opt local search are used for improving the solutions. Extensive computational tests on standard instances from the literature confirm the effectiveness of the presented approach.
Efficiency Improvements in Meta-Heuristic Algorithms to Solve the Optimal Power Flow Problem
NASA Astrophysics Data System (ADS)
Reddy, S. Surender; Bijwe, P. R.
2016-12-01
This paper proposes the efficient approaches for solving the Optimal Power Flow (OPF) problem using the meta-heuristic algorithms. Mathematically, OPF is formulated as non-linear equality and inequality constrained optimization problem. The main drawback of meta-heuristic algorithm based OPF is the excessive execution time required due to the large number of power flows needed in the solution process. The proposed efficient approaches uses the lower and upper bounds of objective function values. By using this approach, the number of power flows to be performed are reduced substantially, resulting in the solution speed up. The efficiently generated objective function bounds can result in the faster solutions of meta-heuristic algorithms. The original advantages of meta-heuristic algorithms, such as ability to handle complex non-linearities, discontinuities in the objective function, discrete variables handling, and multi-objective optimization, etc., are still available in the proposed efficient approaches. The proposed OPF formulation includes the active and reactive power generation limits, Valve Point Loading (VPL) and Prohibited Operating Zones (POZs) effects of generating units. The effectiveness of proposed approach is examined on IEEE 30, 118 and 300 bus test systems, and the simulation results confirm the efficiency and superiority of the proposed approaches over the other meta-heuristic algorithms. The proposed efficient approach is generic enough to use with any type of meta-heuristic algorithm based OPF.
Solving multi-objective job shop scheduling problems using a non-dominated sorting genetic algorithm
NASA Astrophysics Data System (ADS)
Piroozfard, Hamed; Wong, Kuan Yew
2015-05-01
The efforts of finding optimal schedules for the job shop scheduling problems are highly important for many real-world industrial applications. In this paper, a multi-objective based job shop scheduling problem by simultaneously minimizing makespan and tardiness is taken into account. The problem is considered to be more complex due to the multiple business criteria that must be satisfied. To solve the problem more efficiently and to obtain a set of non-dominated solutions, a meta-heuristic based non-dominated sorting genetic algorithm is presented. In addition, task based representation is used for solution encoding, and tournament selection that is based on rank and crowding distance is applied for offspring selection. Swapping and insertion mutations are employed to increase diversity of population and to perform intensive search. To evaluate the modified non-dominated sorting genetic algorithm, a set of modified benchmarking job shop problems obtained from the OR-Library is used, and the results are considered based on the number of non-dominated solutions and quality of schedules obtained by the algorithm.
Wang, Zhaocai; Pu, Jun; Cao, Liling; Tan, Jian
2015-10-23
The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m < n), such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP) complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.
Wang, Zhaocai; Pu, Jun; Cao, Liling; Tan, Jian
2015-01-01
The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m < n), such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP) complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation. PMID:26512650
NASA Astrophysics Data System (ADS)
Ryzhikov, I. S.; Semenkin, E. S.
2017-02-01
This study is focused on solving an inverse mathematical modelling problem for dynamical systems based on observation data and control inputs. The mathematical model is being searched in the form of a linear differential equation, which determines the system with multiple inputs and a single output, and a vector of the initial point coordinates. The described problem is complex and multimodal and for this reason the proposed evolutionary-based optimization technique, which is oriented on a dynamical system identification problem, was applied. To improve its performance an algorithm restart operator was implemented.
Solving the container pre-marshalling problem using variable length genetic algorithms
NASA Astrophysics Data System (ADS)
Gheith, Mohamed; Eltawil, Amr B.; Harraz, Nermine A.
2016-04-01
In container terminals, the yard area consists of a set of blocks, which consists of a set of bays. Each bay consists of a set of stacks, which consists of a set of tiers. In the container pre-marshalling problem, an initial layout of a bay is converted to a final desired layout. The final layout follows the given loading schedule of this bay. This has a direct impact on the most important container terminal performance measure: the vessel loading time. The deviation between the current layout and the desired layout is expressed by the value of the mis-overlays. The objective of the pre-marshalling problem is to eliminate the mis-overlays with the minimum number of container movements. In this article, a variable chromosome length genetic algorithm was applied to solve the problem. The results of the new solution approach were compared against benchmark instances and the results were remarkably better.
A hybrid algorithm for solving the EEG inverse problem from spatio-temporal EEG data.
Crevecoeur, Guillaume; Hallez, Hans; Van Hese, Peter; D'Asseler, Yves; Dupré, Luc; Van de Walle, Rik
2008-08-01
Epilepsy is a neurological disorder caused by intense electrical activity in the brain. The electrical activity, which can be modelled through the superposition of several electrical dipoles, can be determined in a non-invasive way by analysing the electro-encephalogram. This source localization requires the solution of an inverse problem. Locally convergent optimization algorithms may be trapped in local solutions and when using global optimization techniques, the computational effort can become expensive. Fast recovery of the electrical sources becomes difficult that way. Therefore, there is a need to solve the inverse problem in an accurate and fast way. This paper performs the localization of multiple dipoles using a global-local hybrid algorithm. Global convergence is guaranteed by using space mapping techniques and independent component analysis in a computationally efficient way. The accuracy is locally obtained by using the Recursively Applied and Projected-MUltiple Signal Classification (RAP-MUSIC) algorithm. When using this hybrid algorithm, a four times faster solution is obtained.
An extension of the QZ algorithm for solving the generalized matrix eigenvalue problem
NASA Technical Reports Server (NTRS)
Ward, R. C.
1973-01-01
This algorithm is an extension of Moler and Stewart's QZ algorithm with some added features for saving time and operations. Also, some additional properties of the QR algorithm which were not practical to implement in the QZ algorithm can be generalized with the combination shift QZ algorithm. Numerous test cases are presented to give practical application tests for algorithm. Based on results, this algorithm should be preferred over existing algorithms which attempt to solve the class of generalized eigenproblems where both matrices are singular or nearly singular.
NASA Astrophysics Data System (ADS)
Al-Ma'shumah, Fathimah; Permana, Dony; Sidarto, Kuntjoro Adji
2015-12-01
Customer Lifetime Value is an important and useful concept in marketing. One of its benefits is to help a company for budgeting marketing expenditure for customer acquisition and customer retention. Many mathematical models have been introduced to calculate CLV considering the customer retention/migration classification scheme. A fairly new class of these models which will be described in this paper uses Markov Chain Models (MCM). This class of models has the major advantage for its flexibility to be modified to several different cases/classification schemes. In this model, the probabilities of customer retention and acquisition play an important role. From Pfeifer and Carraway, 2000, the final formula of CLV obtained from MCM usually contains nonlinear form of the transition probability matrix. This nonlinearity makes the inverse problem of CLV difficult to solve. This paper aims to solve this inverse problem, yielding the approximate transition probabilities for the customers, by applying metaheuristic optimization algorithm developed by Yang, 2013, Flower Pollination Algorithm. The major interpretation of obtaining the transition probabilities are to set goals for marketing teams in keeping the relative frequencies of customer acquisition and customer retention.
Solving optimum operation of single pump unit problem with ant colony optimization (ACO) algorithm
NASA Astrophysics Data System (ADS)
Yuan, Y.; Liu, C.
2012-11-01
For pumping stations, the effective scheduling of daily pump operations from solutions to the optimum design operation problem is one of the greatest potential areas for energy cost-savings, there are some difficulties in solving this problem with traditional optimization methods due to the multimodality of the solution region. In this case, an ACO model for optimum operation of pumping unit is proposed and the solution method by ants searching is presented by rationally setting the object function and constrained conditions. A weighted directed graph was constructed and feasible solutions may be found by iteratively searching of artificial ants, and then the optimal solution can be obtained by applying the rule of state transition and the pheromone updating. An example calculation was conducted and the minimum cost was found as 4.9979. The result of ant colony algorithm was compared with the result from dynamic programming or evolutionary solving method in commercial software under the same discrete condition. The result of ACO is better and the computing time is shorter which indicates that ACO algorithm can provide a high application value to the field of optimal operation of pumping stations and related fields.
Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem
2015-01-01
Genetic algorithms are powerful search methods inspired by Darwinian evolution. To date, they have been applied to the solution of many optimization problems because of the easy use of their properties and their robustness in finding good solutions to difficult problems. The good operation of genetic algorithms is due in part to its two main variation operators, namely, crossover and mutation operators. Typically, in the literature, we find the use of a single crossover and mutation operator. However, there are studies that have shown that using multi-operators produces synergy and that the operators are mutually complementary. Using multi-operators is not a simple task because which operators to use and how to combine them must be determined, which in itself is an optimization problem. In this paper, it is proposed that the task of exploring the different combinations of the crossover and mutation operators can be carried out by evolutionary computing. The crossover and mutation operators used are those typically used for solving the traveling salesman problem. The process of searching for good combinations was effective, yielding appropriate and synergic combinations of the crossover and mutation operators. The numerical results show that the use of the combination of operators obtained by evolutionary computing is better than the use of a single operator and the use of multi-operators combined in the standard way. The results were also better than those of the last operators reported in the literature. PMID:26367182
Asymptotic behavior of two algorithms for solving common fixed point problems
NASA Astrophysics Data System (ADS)
Zaslavski, Alexander J.
2017-04-01
The common fixed point problem is to find a common fixed point of a finite family of mappings. In the present paper our goal is to obtain its approximate solution using two perturbed algorithms. The first algorithm is an iterative method for problems in a metric space while the second one is a dynamic string-averaging algorithms for problems in a Hilbert space.
He, Qiang; Hu, Xiangtao; Ren, Hong; Zhang, Hongqi
2015-11-01
A novel artificial fish swarm algorithm (NAFSA) is proposed for solving large-scale reliability-redundancy allocation problem (RAP). In NAFSA, the social behaviors of fish swarm are classified in three ways: foraging behavior, reproductive behavior, and random behavior. The foraging behavior designs two position-updating strategies. And, the selection and crossover operators are applied to define the reproductive ability of an artificial fish. For the random behavior, which is essentially a mutation strategy, the basic cloud generator is used as the mutation operator. Finally, numerical results of four benchmark problems and a large-scale RAP are reported and compared. NAFSA shows good performance in terms of computational accuracy and computational efficiency for large scale RAP.
Martín H., José Antonio
2013-01-01
Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular biology, e.g., genome sequencing; global alignment of multiple genomes; identifying siblings or discovery of dysregulated pathways. In almost all of these problems, there is the need for proving a hypothesis about certain property of an object that can be present if and only if it adopts some particular admissible structure (an NP-certificate) or be absent (no admissible structure), however, none of the standard approaches can discard the hypothesis when no solution can be found, since none can provide a proof that there is no admissible structure. This article presents an algorithm that introduces a novel type of solution method to “efficiently” solve the graph 3-coloring problem; an NP-complete problem. The proposed method provides certificates (proofs) in both cases: present or absent, so it is possible to accept or reject the hypothesis on the basis of a rigorous proof. It provides exact solutions and is polynomial-time (i.e., efficient) however parametric. The only requirement is sufficient computational power, which is controlled by the parameter . Nevertheless, here it is proved that the probability of requiring a value of to obtain a solution for a random graph decreases exponentially: , making tractable almost all problem instances. Thorough experimental analyses were performed. The algorithm was tested on random graphs, planar graphs and 4-regular planar graphs. The obtained experimental results are in accordance with the theoretical expected results. PMID:23349711
Martín H, José Antonio
2013-01-01
Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular biology, e.g., genome sequencing; global alignment of multiple genomes; identifying siblings or discovery of dysregulated pathways. In almost all of these problems, there is the need for proving a hypothesis about certain property of an object that can be present if and only if it adopts some particular admissible structure (an NP-certificate) or be absent (no admissible structure), however, none of the standard approaches can discard the hypothesis when no solution can be found, since none can provide a proof that there is no admissible structure. This article presents an algorithm that introduces a novel type of solution method to "efficiently" solve the graph 3-coloring problem; an NP-complete problem. The proposed method provides certificates (proofs) in both cases: present or absent, so it is possible to accept or reject the hypothesis on the basis of a rigorous proof. It provides exact solutions and is polynomial-time (i.e., efficient) however parametric. The only requirement is sufficient computational power, which is controlled by the parameter α∈N. Nevertheless, here it is proved that the probability of requiring a value of α>k to obtain a solution for a random graph decreases exponentially: P(α>k)≤2(-(k+1)), making tractable almost all problem instances. Thorough experimental analyses were performed. The algorithm was tested on random graphs, planar graphs and 4-regular planar graphs. The obtained experimental results are in accordance with the theoretical expected results.
Meta-heuristic algorithm to solve two-sided assembly line balancing problems
NASA Astrophysics Data System (ADS)
Wirawan, A. D.; Maruf, A.
2016-02-01
Two-sided assembly line is a set of sequential workstations where task operations can be performed at two sides of the line. This type of line is commonly used for the assembly of large-sized products: cars, buses, and trucks. This paper propose a Decoding Algorithm with Teaching-Learning Based Optimization (TLBO), a recently developed nature-inspired search method to solve the two-sided assembly line balancing problem (TALBP). The algorithm aims to minimize the number of mated-workstations for the given cycle time without violating the synchronization constraints. The correlation between the input parameters and the emergence point of objective function value is tested using scenarios generated by design of experiments. A two-sided assembly line operated in an Indonesia's multinational manufacturing company is considered as the object of this paper. The result of the proposed algorithm shows reduction of workstations and indicates that there is negative correlation between the emergence point of objective function value and the size of population used.
NASA Astrophysics Data System (ADS)
Xu, Ye; Wang, Ling; Wang, Shengyao; Liu, Min
2014-09-01
In this article, an effective hybrid immune algorithm (HIA) is presented to solve the distributed permutation flow-shop scheduling problem (DPFSP). First, a decoding method is proposed to transfer a job permutation sequence to a feasible schedule considering both factory dispatching and job sequencing. Secondly, a local search with four search operators is presented based on the characteristics of the problem. Thirdly, a special crossover operator is designed for the DPFSP, and mutation and vaccination operators are also applied within the framework of the HIA to perform an immune search. The influence of parameter setting on the HIA is investigated based on the Taguchi method of design of experiment. Extensive numerical testing results based on 420 small-sized instances and 720 large-sized instances are provided. The effectiveness of the HIA is demonstrated by comparison with some existing heuristic algorithms and the variable neighbourhood descent methods. New best known solutions are obtained by the HIA for 17 out of 420 small-sized instances and 585 out of 720 large-sized instances.
NASA Astrophysics Data System (ADS)
Moryakov, A. V.
2016-12-01
An algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations is presented. The algorithm for systems of first-order differential equations is implemented in the EDELWEISS code with the possibility of parallel computations on supercomputers employing the MPI (Message Passing Interface) standard for the data exchange between parallel processes. The solution is represented by a series of orthogonal polynomials on the interval [0, 1]. The algorithm is characterized by simplicity and the possibility to solve nonlinear problems with a correction of the operator in accordance with the solution obtained in the previous iterative process.
ERIC Educational Resources Information Center
Kiesmuller, Ulrich
2009-01-01
At schools special learning and programming environments are often used in the field of algorithms. Particularly with regard to computer science lessons in secondary education, they are supposed to help novices to learn the basics of programming. In several parts of Germany (e.g., Bavaria) these fundamentals are taught as early as in the seventh…
NASA Astrophysics Data System (ADS)
Bao, Xingxian; Cao, Aixia; Zhang, Jing
2016-07-01
Modal parameters estimation plays an important role for structural health monitoring. Accurately estimating the modal parameters of structures is more challenging as the measured vibration response signals are contaminated with noise. This study develops a mathematical algorithm of solving the partially described inverse singular value problem (PDISVP) combined with the complex exponential (CE) method to estimate the modal parameters. The PDISVP solving method is to reconstruct an L2-norm optimized (filtered) data matrix from the measured (noisy) data matrix, when the prescribed data constraints are one or several sets of singular triplets of the matrix. The measured data matrix is Hankel structured, which is constructed based on the measured impulse response function (IRF). The reconstructed matrix must maintain the Hankel structure, and be lowered in rank as well. Once the filtered IRF is obtained, the CE method can be applied to extract the modal parameters. Two physical experiments, including a steel cantilever beam with 10 accelerometers mounted, and a steel plate with 30 accelerometers mounted, excited by an impulsive load, respectively, are investigated to test the applicability of the proposed scheme. In addition, the consistency diagram is proposed to exam the agreement among the modal parameters estimated from those different accelerometers. Results indicate that the PDISVP-CE method can significantly remove noise from measured signals and accurately estimate the modal frequencies and damping ratios.
ERIC Educational Resources Information Center
Salta, Katerina; Tzougraki, Chryssa
2011-01-01
The students' performance in various types of problems dealing with the conservation of matter during chemical reactions has been investigated at different levels of schooling. The participants were 499 ninth grade (ages 14, 15 years) and 624 eleventh grade (ages 16, 17 years) Greek students. Data was collected using a written questionnaire…
Solving mixed integer nonlinear programming problems using spiral dynamics optimization algorithm
NASA Astrophysics Data System (ADS)
Kania, Adhe; Sidarto, Kuntjoro Adji
2016-02-01
Many engineering and practical problem can be modeled by mixed integer nonlinear programming. This paper proposes to solve the problem with modified spiral dynamics inspired optimization method of Tamura and Yasuda. Four test cases have been examined, including problem in engineering and sport. This method succeeds in obtaining the optimal result in all test cases.
NASA Astrophysics Data System (ADS)
Wang, J.; Cai, X.
2007-12-01
A water resources system can be defined as a large-scale spatial system, within which distributed ecological system interacts with the stream network and ground water system. Water resources management, the causative factors and hence the solutions to be developed have a significant spatial dimension. This motivates a modeling analysis of water resources management within a spatial analytical framework, where data is usually geo- referenced and in the form of a map. One of the important functions of Geographic information systems (GIS) is to identify spatial patterns of environmental variables. The role of spatial patterns in water resources management has been well established in the literature particularly regarding how to design better spatial patterns for satisfying the designated objectives of water resources management. Evolutionary algorithms (EA) have been demonstrated to be successful in solving complex optimization models for water resources management due to its flexibility to incorporate complex simulation models in the optimal search procedure. The idea of combining GIS and EA motivates the development and application of spatial evolutionary algorithms (SEA). SEA assimilates spatial information into EA, and even changes the representation and operators of EA. In an EA used for water resources management, the mathematical optimization model should be modified to account the spatial patterns; however, spatial patterns are usually implicit, and it is difficult to impose appropriate patterns to spatial data. Also it is difficult to express complex spatial patterns by explicit constraints included in the EA. The GIS can help identify the spatial linkages and correlations based on the spatial knowledge of the problem. These linkages are incorporated in the fitness function for the preference of the compatible vegetation distribution. Unlike a regular GA for spatial models, the SEA employs a special hierarchical hyper-population and spatial genetic operators
A hybrid symbolic/finite-element algorithm for solving nonlinear optimal control problems
NASA Technical Reports Server (NTRS)
Bless, Robert R.; Hodges, Dewey H.
1991-01-01
The general code described is capable of solving difficult nonlinear optimal control problems by using finite elements and a symbolic manipulator. Quick and accurate solutions are obtained with a minimum for user interaction. Since no user programming is required for most problems, there are tremendous savings to be gained in terms of time and money.
2015-09-24
ABSTRACT Supported by this grant, the PI and his group have successfully solved a series of challenging problems in computer science, global...Taiwan. Accomplishments/New Findings: Research and Education Activities Supported by this AFOSR grant, the PI and his students, post-doctor and co...polynomial time in the worst cases). 3) Canonical duality theory for solving chaotic dynamical systems. It was realized by the PI in his review
NASA Astrophysics Data System (ADS)
Hetmaniok, Edyta
2016-07-01
In this paper the procedure for solving the inverse problem for the binary alloy solidification in the casting mould is presented. Proposed approach is based on the mathematical model suitable for describing the investigated solidification process, the lever arm model describing the macrosegregation process, the finite element method for solving the direct problem and the artificial bee colony algorithm for minimizing the functional expressing the error of approximate solution. Goal of the discussed inverse problem is the reconstruction of heat transfer coefficient and distribution of temperature in investigated region on the basis of known measurements of temperature.
NASA Astrophysics Data System (ADS)
Schütze, Niels; Wöhling, Thomas; de Play, Michael
2010-05-01
Some real-world optimization problems in water resources have a high-dimensional space of decision variables and more than one objective function. In this work, we compare three general-purpose, multi-objective simulation optimization algorithms, namely NSGA-II, AMALGAM, and CMA-ES-MO when solving three real case Multi-objective Optimization Problems (MOPs): (i) a high-dimensional soil hydraulic parameter estimation problem; (ii) a multipurpose multi-reservoir operation problem; and (iii) a scheduling problem in deficit irrigation. We analyze the behaviour of the three algorithms on these test problems considering their formulations ranging from 40 up to 120 decision variables and 2 to 4 objectives. The computational effort required by each algorithm in order to reach the true Pareto front is also analyzed.
ERIC Educational Resources Information Center
Gultepe, Nejla; Yalcin Celik, Ayse; Kilic, Ziya
2013-01-01
The purpose of the study was to examine the effects of students' conceptual understanding of chemical concepts and mathematical processing skills on algorithmic problem-solving skills. The sample (N = 554) included grades 9, 10, and 11 students in Turkey. Data were collected using the instrument "MPC Test" and with interviews. The MPC…
Application of a Chimera Full Potential Algorithm for Solving Aerodynamic Problems
NASA Technical Reports Server (NTRS)
Holst, Terry L.; Kwak, Dochan (Technical Monitor)
1997-01-01
A numerical scheme utilizing a chimera zonal grid approach for solving the three dimensional full potential equation is described. Special emphasis is placed on describing the spatial differencing algorithm around the chimera interface. Results from two spatial discretization variations are presented; one using a hybrid first-order/second-order-accurate scheme and the second using a fully second-order-accurate scheme. The presentation is highlighted with a number of transonic wing flow field computations.
A prefiltered cuckoo search algorithm with geometric operators for solving Sudoku problems.
Soto, Ricardo; Crawford, Broderick; Galleguillos, Cristian; Monfroy, Eric; Paredes, Fernando
2014-01-01
The Sudoku is a famous logic-placement game, originally popularized in Japan and today widely employed as pastime and as testbed for search algorithms. The classic Sudoku consists in filling a 9 × 9 grid, divided into nine 3 × 3 regions, so that each column, row, and region contains different digits from 1 to 9. This game is known to be NP-complete, with existing various complete and incomplete search algorithms able to solve different instances of it. In this paper, we present a new cuckoo search algorithm for solving Sudoku puzzles combining prefiltering phases and geometric operations. The geometric operators allow one to correctly move toward promising regions of the combinatorial space, while the prefiltering phases are able to previously delete from domains the values that do not conduct to any feasible solution. This integration leads to a more efficient domain filtering and as a consequence to a faster solving process. We illustrate encouraging experimental results where our approach noticeably competes with the best approximate methods reported in the literature.
A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems
Crawford, Broderick; Galleguillos, Cristian; Paredes, Fernando
2014-01-01
The Sudoku is a famous logic-placement game, originally popularized in Japan and today widely employed as pastime and as testbed for search algorithms. The classic Sudoku consists in filling a 9 × 9 grid, divided into nine 3 × 3 regions, so that each column, row, and region contains different digits from 1 to 9. This game is known to be NP-complete, with existing various complete and incomplete search algorithms able to solve different instances of it. In this paper, we present a new cuckoo search algorithm for solving Sudoku puzzles combining prefiltering phases and geometric operations. The geometric operators allow one to correctly move toward promising regions of the combinatorial space, while the prefiltering phases are able to previously delete from domains the values that do not conduct to any feasible solution. This integration leads to a more efficient domain filtering and as a consequence to a faster solving process. We illustrate encouraging experimental results where our approach noticeably competes with the best approximate methods reported in the literature. PMID:24707205
Mental Capacity and Working Memory in Chemistry: Algorithmic "versus" Open-Ended Problem Solving
ERIC Educational Resources Information Center
St Clair-Thompson, Helen; Overton, Tina; Bugler, Myfanwy
2012-01-01
Previous research has revealed that problem solving and attainment in chemistry are constrained by mental capacity and working memory. However, the terms mental capacity and working memory come from different theories of cognitive resources, and are assessed using different tasks. The current study examined the relationships between mental…
The Problems of Problem Solving
ERIC Educational Resources Information Center
Watson, Charles E.
1976-01-01
Discusses some common pitfalls in problem-solving and outlines three basic approaches to successfully identifying problems and their causes. (Available from Business Horizons, School of Business, Indiana University, Bloomington, Indiana 47401; $2.50, single copy) (Author/JG)
Techniques of Problem Solving.
ERIC Educational Resources Information Center
Krantz, Steven G.
The purpose of this book is to teach the basic principles of problem solving in both mathematical and non-mathematical problems. The major components of the book consist of learning to translate verbal discussion into analytical data, learning problem solving methods for attacking collections of analytical questions or data, and building a…
Software and Algorithms for Solving Computational Geodynamic Problems using Next Generation Hardware
NASA Astrophysics Data System (ADS)
Zheng, Liang; Gerya, Taras
2014-05-01
Numerical geodynamic modeling is typically based on solving a series of partial differential equations which describe the long-term behavior of the solid visco-elasto-brittle/plastic Earth as a highly viscous incompressible fluid with strongly variable non-Newtonian viscosity. Coding for solving geodynamic equations is catching up with the advance of modern high performance computing. In the past five years, newly developed many-core computing technology, including GPU (Graphics Processing Unit) and MIC (Many Integrated Core), has also been utilized for geodynamic modeling. However, the lack of easy-to-expand or easy-to-use geo-computing toolkits limits the high performance software catching up with the endless updating of high performance hardware. In this presentation, we will firstly show two examples of the implementation of solving geodynamic problems based on Stokes and continuity equations with strongly variable viscosity using many-core hardware, with a specific focus on the GPU. The first example is a geometric multi-grid (GMG) solver, which solves a synthetic sinking cube problem using a staggered grid finite difference discretization. The second example is a preconditioned minimal residual (MINRES) solver for incompressible Stokes flow problem with many viscous inclusions which is discretized using the finite element method. Through these two implementation examples, we will analyze the cost of coding and running advantages and disadvantages of the two kinds of coding methodologies, and in a hope to discuss a potential general coding flowchart for solving geodynamic equations using many-core devices. Finally, a software stack based many-core computing framework oriented to geodynamic modeling is proposed for the future.
GFS algorithm based on batch Monte Carlo trials for solving global optimization problems
NASA Astrophysics Data System (ADS)
Popkov, Yuri S.; Darkhovskiy, Boris S.; Popkov, Alexey Y.
2016-10-01
A new method for global optimization of Hölder goal functions under compact sets given by inequalities is proposed. All functions are defined only algorithmically. The method is based on performing simple Monte Carlo trials and constructing the sequences of records and the sequence of their decrements. An estimating procedure of Hölder constants is proposed. Probability estimation of exact global minimum neighborhood using Hölder constants estimates is presented. Results on some analytical and algorithmic test problems illustrate the method's performance.
Iterated local search algorithm for solving the orienteering problem with soft time windows.
Aghezzaf, Brahim; Fahim, Hassan El
2016-01-01
In this paper we study the orienteering problem with time windows (OPTW) and the impact of relaxing the time windows on the profit collected by the vehicle. The way of relaxing time windows adopted in the orienteering problem with soft time windows (OPSTW) that we study in this research is a late service relaxation that allows linearly penalized late services to customers. We solve this problem heuristically by considering a hybrid iterated local search. The results of the computational study show that the proposed approach is able to achieve promising solutions on the OPTW test instances available in the literature, one new best solution is found. On the newly generated test instances of the OPSTW, the results show that the profit collected by the OPSTW is better than the profit collected by the OPTW.
Teaching through Problem Solving
ERIC Educational Resources Information Center
Fi, Cos D.; Degner, Katherine M.
2012-01-01
Teaching through Problem Solving (TtPS) is an effective way to teach mathematics "for" understanding. It also provides students with a way to learn mathematics "with" understanding. In this article, the authors present a definition of what it means to teach through problem solving. They also describe a professional development vignette that…
Strategies for Problem Solving.
ERIC Educational Resources Information Center
Karmos, Joseph S.; Karmos, Ann H.
Problem-solving skills are becoming increasingly important in the workplace, and more schools are including them in the curriculum. Knowledge of problem solving will be critical to a work force that is dealing with advanced technology, yet many students have yet to master these skills. Based on this premise, this guide attempts to show how…
Schumacher, Kathryn M.; Chen, Richard Li-Yang; Cohn, Amy E. M.; ...
2016-04-15
Here, we consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real-world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum-cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as amore » foundation, our primary focus is on a chance-constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user-defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut-sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches.« less
Schumacher, Kathryn M.; Chen, Richard Li-Yang; Cohn, Amy E. M.; Castaing, Jeremy
2016-04-15
Here, we consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real-world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum-cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance-constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user-defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut-sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches.
García-Arnau, Marc; Manrique, Daniel; Rodríguez-Patón, Alfonso; Sosík, Petr
2007-01-01
We present a P system with replicated rewriting to solve the Maximum Clique Problem for a graph. Strings representing cliques are built gradually. This involves the use of inhibitors that control the space of all generated solutions to the problem. Calculating the maximum clique for a graph is a highly relevant issue not only on purely computational grounds, but also because of its relationship to fundamental problems in genomics. We propose to implement the designed P system by means of a DNA algorithm. This algorithm is then compared with two standard papers that addressed the same problem and its DNA implementation in the past. This comparison is carried out on the basis of a series of computational and physical parameters. Our solution features a significantly lower cost in terms of time, the number and size of strands, as well as the simplicity of the biological implementation.
NASA Astrophysics Data System (ADS)
Xu, Ye; Wang, Ling; Wang, Shengyao; Liu, Min
2013-12-01
In this article, an effective shuffled frog-leaping algorithm (SFLA) is proposed to solve the hybrid flow-shop scheduling problem with identical parallel machines (HFSP-IPM). First, some novel heuristic decoding rules for both job order decision and machine assignment are proposed. Then, three hybrid decoding schemes are designed to decode job order sequences to schedules. A special bi-level crossover and multiple local search operators are incorporated in the searching framework of the SFLA to enrich the memetic searching behaviour and to balance the exploration and exploitation capabilities. Meanwhile, some theoretical analysis for the local search operators is provided for guiding the local search. The parameter setting of the algorithm is also investigated based on the Taguchi method of design of experiments. Finally, numerical testing based on well-known benchmarks and comparisons with some existing algorithms are carried out to demonstrate the effectiveness of the proposed algorithm.
Xiao, Yunhai; Wang, Qiuyu; Liu, Lihong
2016-01-01
The main purpose of this study is to propose, then analyze, and later test a spectral gradient algorithm for solving a convex minimization problem. The considered problem covers the matrix ℓ2,1-norm regularized least squares which is widely used in multi-task learning for capturing the joint feature among each task. To solve the problem, we firstly minimize a quadratic approximated model of the objective function to derive a search direction at current iteration. We show that this direction descends automatically and reduces to the original spectral gradient direction if the regularized term is removed. Secondly, we incorporate a nonmonotone line search along this direction to improve the algorithm’s numerical performance. Furthermore, we show that the proposed algorithm converges to a critical point under some mild conditions. The attractive feature of the proposed algorithm is that it is easily performable and only requires the gradient of the smooth function and the objective function’s values at each and every step. Finally, we operate some experiments on synthetic data, which verifies that the proposed algorithm works quite well and performs better than the compared ones. PMID:27861526
NASA Astrophysics Data System (ADS)
Singh, Chandralekha
2009-07-01
One finding of cognitive research is that people do not automatically acquire usable knowledge by spending lots of time on task. Because students' knowledge hierarchy is more fragmented, "knowledge chunks" are smaller than those of experts. The limited capacity of short term memory makes the cognitive load high during problem solving tasks, leaving few cognitive resources available for meta-cognition. The abstract nature of the laws of physics and the chain of reasoning required to draw meaningful inferences makes these issues critical. In order to help students, it is crucial to consider the difficulty of a problem from the perspective of students. We are developing and evaluating interactive problem-solving tutorials to help students in the introductory physics courses learn effective problem-solving strategies while solidifying physics concepts. The self-paced tutorials can provide guidance and support for a variety of problem solving techniques, and opportunity for knowledge and skill acquisition.
ERIC Educational Resources Information Center
Capobianco, Brenda M.; Tyrie, Nancy
2009-01-01
In a unique school-university partnership, methods students collaborated with fifth graders to use the engineering design process to build their problem-solving skills. By placing the problem in the context of a client having particular needs, the problem took on a real-world appeal that students found intriguing and inviting. In this article, the…
Chemical Reaction Problem Solving.
ERIC Educational Resources Information Center
Veal, William
1999-01-01
Discusses the role of chemical-equation problem solving in helping students predict reaction products. Methods for helping students learn this process must be taught to students and future teachers by using pedagogical skills within the content of chemistry. Emphasizes that solving chemical reactions should involve creative cognition where…
NASA Astrophysics Data System (ADS)
Lee, Janghee; Yoo, Suk I.
2012-07-01
We present a new formulation to solve a defect detection problem on images using multiple reference images. The reference images are defect-free images obtained from the same position of other products. The defect detection problem is reformulated as a binary labeling problem, where each pixel is labeled with "one" if it contains a defect and with "zero" otherwise. The formulation of the energy function used for the labeling problem is defined. Then, the graph-cuts algorithm is used to obtain the optimal label set minimizing the energy function that becomes the defect detection result. The presented approaches are robust to noises taken from several sources, including image-taking, transmission process, environmental lighting, and pattern variation. It does not suffer from the alignment problem for the conventional comparison methods using references. These approaches are illustrated with real data sets, semiconductor wafer images collected by scanning electron microscope equipment, and compared to other defect detection approach.
Problem Solving Techniques Seminar.
ERIC Educational Resources Information Center
Massachusetts Career Development Inst., Springfield.
This booklet is one of six texts from a workplace literacy curriculum designed to assist learners in facing the increased demands of the workplace. Six problem-solving techniques are developed in the booklet to assist individuals and groups in making better decisions: problem identification, data gathering, data analysis, solution analysis,…
ERIC Educational Resources Information Center
Thorson, Annette, Ed.
1999-01-01
This issue of ENC Focus focuses on the topic of inquiry and problem solving. Featured articles include: (1) "Inquiry in the Everyday World of Schools" (Ronald D. Anderson); (2) "In the Cascade Reservoir Restoration Project Students Tackle Real-World Problems" (Clint Kennedy with Advanced Biology Students from Cascade High…
Problem Solving in Electricity.
ERIC Educational Resources Information Center
Caillot, Michel; Chalouhi, Elias
Two studies were conducted to describe how students perform direct current (D-C) circuit problems. It was hypothesized that problem solving in the electricity domain depends largely on good visual processing of the circuit diagram and that this processing depends on the ability to recognize when two or more electrical components are in series or…
NASA Technical Reports Server (NTRS)
1992-01-01
CBR Express software solves problems by adapting sorted solutions to new problems specified by a user. It is applicable to a wide range of situations. The technology was originally developed by Inference Corporation for Johnson Space Center's Advanced Software Development Workstation. The project focused on the reuse of software designs, and Inference used CBR as part of the ACCESS prototype software. The commercial CBR Express is used as a "help desk" for customer support, enabling reuse of existing information when necessary. It has been adopted by several companies, among them American Airlines, which uses it to solve reservation system software problems.
Solving Problems through Circles
ERIC Educational Resources Information Center
Grahamslaw, Laura; Henson, Lisa H.
2015-01-01
Several problem-solving interventions that utilise a "circle" approach have been applied within the field of educational psychology, for example, Circle Time, Circle of Friends, Sharing Circles, Circle of Adults and Solution Circles. This research explored two interventions, Solution Circles and Circle of Adults, and used thematic…
ERIC Educational Resources Information Center
Wisconsin Univ. - Stout, Menomonie. Center for Vocational, Technical and Adult Education.
The teacher directed problem solving activities package contains 17 units: Future Community Design, Let's Build an Elevator, Let's Construct a Catapult, Let's Design a Recreational Game, Let's Make a Hand Fishing Reel, Let's Make a Wall Hanging, Let's Make a Yo-Yo, Marooned in the Past, Metrication, Mousetrap Vehicles, The Multi System…
ERIC Educational Resources Information Center
Aznar, Mercedes Martinez; Orcajo, Teresa Ibanez
2005-01-01
A teaching unit on genetics and human inheritance using problem-solving methodology was undertaken with fourth-level Spanish Secondary Education students (15 year olds). The goal was to study certain aspects of the students' learning process (concepts, procedures and attitude) when using this methodology in the school environment. The change…
Circumference and Problem Solving.
ERIC Educational Resources Information Center
Blackburn, Katie; White, David
The concept of pi is one of great importance to all developed civilization and one that can be explored and mastered by elementary students through an inductive and problem-solving approach. Such an approach is outlined and discussed. The approach involves the following biblical quotation: "And he made a moltin sea ten cubits from one brim to…
Solving Common Mathematical Problems
NASA Technical Reports Server (NTRS)
Luz, Paul L.
2005-01-01
Mathematical Solutions Toolset is a collection of five software programs that rapidly solve some common mathematical problems. The programs consist of a set of Microsoft Excel worksheets. The programs provide for entry of input data and display of output data in a user-friendly, menu-driven format, and for automatic execution once the input data has been entered.
ERIC Educational Resources Information Center
Armoni, Michal; Gal-Ezer, Judith; Tirosh, Dina
2005-01-01
Solving problems by reduction is an important issue in mathematics and science education in general (both in high school and in college or university) and particularly in computer science education. Developing reductive thinking patterns is an important goal in any scientific discipline, yet reduction is not an easy subject to cope with. Still,…
Achievement in Problem Solving
ERIC Educational Resources Information Center
Friebele, David
2010-01-01
This Action Research Project is meant to investigate the effects of incorporating research-based instructional strategies into instruction and their subsequent effect on student achievement in the area of problem-solving. The two specific strategies utilized are the integration of manipulatives and increased social interaction on a regular basis.…
Introspection in Problem Solving
ERIC Educational Resources Information Center
Jäkel, Frank; Schreiber, Cornell
2013-01-01
Problem solving research has encountered an impasse. Since the seminal work of Newell und Simon (1972) researchers do not seem to have made much theoretical progress (Batchelder and Alexander, 2012; Ohlsson, 2012). In this paper we argue that one factor that is holding back the field is the widespread rejection of introspection among cognitive…
Universal Design Problem Solving
ERIC Educational Resources Information Center
Sterling, Mary C.
2004-01-01
Universal design is made up of four elements: accessibility, adaptability, aesthetics, and affordability. This article addresses the concept of universal design problem solving through experiential learning for an interior design studio course in postsecondary education. Students' experiences with clients over age 55 promoted an understanding of…
Toward Solving the Problem of Problem Solving: An Analysis Framework
ERIC Educational Resources Information Center
Roesler, Rebecca A.
2016-01-01
Teaching is replete with problem solving. Problem solving as a skill, however, is seldom addressed directly within music teacher education curricula, and research in music education has not examined problem solving systematically. A framework detailing problem-solving component skills would provide a needed foundation. I observed problem solving…
The Algorithm Selection Problem
NASA Technical Reports Server (NTRS)
Minton, Steve; Allen, John; Deiss, Ron (Technical Monitor)
1994-01-01
Work on NP-hard problems has shown that many instances of these theoretically computationally difficult problems are quite easy. The field has also shown that choosing the right algorithm for the problem can have a profound effect on the time needed to find a solution. However, to date there has been little work showing how to select the right algorithm for solving any particular problem. The paper refers to this as the algorithm selection problem. It describes some of the aspects that make this problem difficult, as well as proposes a technique for addressing it.
Molokanov, A; Chojnacki, E; Blanchardon, E
2010-01-01
The individual monitoring of internal exposure of workers comprises two steps: measurement and measurement interpretation. The latter consists in reconstructing the intake of a radionuclide from the activity measurement and calculating the dose using a biokinetic model of the radionuclide behavior in the human body. Mathematically, reconstructing the intake is solving an inverse problem described by a measurement-model equation. The aim of this paper is to propose a solution to this inverse problem when the measurement-model parameters are considered as uncertain. For that, an analysis of the uncertainty on the intake calculation is performed taking into account the dispersion of the measured quantity and the uncertainties of the measurement-model parameters. It is shown that both frequentist and Bayesian approaches can be used to solve the problem according to the measurement-model formulation. A common calculation algorithm is proposed to support both approaches and applied to the examples of tritiated water intake and plutonium inhalation by a worker.
Using an Algorithm When Solving Hardy-Weinberg Problems in Biology.
ERIC Educational Resources Information Center
Stencel, John E.
1991-01-01
A real world sample of actual data that students can use to see the application of the Hardy-Weinberg law to a real population is provided. The directions for using a six-step algorithmic procedure to determine Hardy-Weinberg percentages on the data given are described. (KR)
Miller, A.
1999-06-01
Human influences create both environmental problems and barriers to effective policy aimed at addressing those problems. In effect, environmental managers manage people as much as they manage the environment. Therefore, they must gain an understanding of the psychological and sociopolitical dimensions of environmental problems that they are attempting to resolve. The author reappraises conventional analyses of environmental problems using lessons from the psychosocial disciplines. The author combines the disciplines of ecology, political sociology and psychology to produce a more adaptive approach to problem-solving that is specifically geared toward the environmental field. Numerous case studies demonstrate the practical application of theory in a way that is useful to technical and scientific professionals as well as to policymakers and planners.
An algorithm for solving the system-level problem in multilevel optimization
NASA Technical Reports Server (NTRS)
Balling, R. J.; Sobieszczanski-Sobieski, J.
1994-01-01
A multilevel optimization approach which is applicable to nonhierarchic coupled systems is presented. The approach includes a general treatment of design (or behavior) constraints and coupling constraints at the discipline level through the use of norms. Three different types of norms are examined: the max norm, the Kreisselmeier-Steinhauser (KS) norm, and the 1(sub p) norm. The max norm is recommended. The approach is demonstrated on a class of hub frame structures which simulate multidisciplinary systems. The max norm is shown to produce system-level constraint functions which are non-smooth. A cutting-plane algorithm is presented which adequately deals with the resulting corners in the constraint functions. The algorithm is tested on hub frames with increasing number of members (which simulate disciplines), and the results are summarized.
Using Online Algorithms to Solve NP-Hard Problems More Efficiently in Practice
2007-12-01
Acknowledgments I would like to thank my advisor Stephen Smith, my co-author Daniel Golovin , my com- mittee members Avrim Blum, Carla Gomes, John Hooker, and...of the 13th European Conference on Artificial Intelligence (ECAI-98), pages 244–248, 1998. 4.2.2 [76] Matthew Streeter and Daniel Golovin . Online...algorithms for maximizing submodu- lar functions. Working paper, 2007. 1.1, 2.1.3 [77] Matthew Streeter, Daniel Golovin , and Stephen F. Smith. Combining
Problem Solving and Reasoning.
1984-02-01
Sloan Foundation (HAS). This paper is a draft of a chapter to appear in R. C. Atkinson, R. Herrnstein, G. Lindzey, and R. D. Luce (Eds.), Stevens ...D. Luce (Eds.), Stevens ’ Handbook of Experimental Psychology, (Revised Edition). New York: John Wiley & Sons. PROBLEM SOLVING AND REASONING James G... LaBerge & S. J. Samuels (Eds.), Perception and comprehension. Hillsdale, NJ: Erlbaum. Anderson, J. R. (1982). Acquisition of cognitive skill
NASA Astrophysics Data System (ADS)
Rajan, C. Christober Asir
2010-10-01
The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for the next H hours. Genetic Algorithms (GA's) are general-purpose optimization techniques based on principles inspired from the biological evolution using metaphors of mechanisms such as neural section, genetic recombination and survival of the fittest. In this, the unit commitment schedule is coded as a string of symbols. An initial population of parent solutions is generated at random. Here, each schedule is formed by committing all the units according to their initial status ("flat start"). Here the parents are obtained from a pre-defined set of solution's i.e. each and every solution is adjusted to meet the requirements. Then, a random recommitment is carried out with respect to the unit's minimum down times. And SA improves the status. A 66-bus utility power system with twelve generating units in India demonstrates the effectiveness of the proposed approach. Numerical results are shown comparing the cost solutions and computation time obtained by using the Genetic Algorithm method and other conventional methods.
Dhodiya, Jayesh M; Tailor, Anita Ravi
2016-01-01
This paper presents a genetic algorithm based hybrid approach for solving a fuzzy multi-objective assignment problem (FMOAP) by using an exponential membership function in which the coefficient of the objective function is described by a triangular possibility distribution. Moreover, in this study, fuzzy judgment was classified using α-level sets for the decision maker (DM) to simultaneously optimize the optimistic, most likely, and pessimistic scenarios of fuzzy objective functions. To demonstrate the effectiveness of the proposed approach, a numerical example is provided with a data set from a realistic situation. This paper concludes that the developed hybrid approach can manage FMOAP efficiently and effectively with an effective output to enable the DM to take a decision.
NASA Astrophysics Data System (ADS)
Cram, Ana Catalina
As worldwide environmental awareness grow, alternative sources of energy have become important to mitigate climate change. Biogas in particular reduces greenhouse gas emissions that contribute to global warming and has the potential of providing 25% of the annual demand for natural gas in the U.S. In 2011, 55,000 metric tons of methane emissions were reduced and 301 metric tons of carbon dioxide emissions were avoided through the use of biogas alone. Biogas is produced by anaerobic digestion through the fermentation of organic material. It is mainly composed of methane with a rage of 50 to 80% in its concentration. Carbon dioxide covers 20 to 50% and small amounts of hydrogen, carbon monoxide and nitrogen. The biogas production systems are anaerobic digestion facilities and the optimal operation of an anaerobic digester requires the scheduling of all batches from multiple feedstocks during a specific time horizon. The availability times, biomass quantities, biogas production rates and storage decay rates must all be taken into account for maximal biogas production to be achieved during the planning horizon. Little work has been done to optimize the scheduling of different types of feedstock in anaerobic digestion facilities to maximize the total biogas produced by these systems. Therefore, in the present thesis, a new genetic algorithm is developed with the main objective of obtaining the optimal sequence in which different feedstocks will be processed and the optimal time to allocate to each feedstock in the digester with the main objective of maximizing the production of biogas considering different types of feedstocks, arrival times and decay rates. Moreover, all batches need to be processed in the digester in a specified time with the restriction that only one batch can be processed at a time. The developed algorithm is applied to 3 different examples and a comparison with results obtained in previous studies is presented.
1982-10-01
Artificial Intelig ~ence (Vol. III, edited by Paul R. Cohen and’ Edward A.. Feigenbaum)’, The chapter was written B’ Paul Cohen, with contributions... Artificial Intelligence (Vol. III, edited by Paul R. Cohen and EdWard A. Feigenbaum). The chapter was written by Paul R. Cohen, with contributions by Stephen...Wheevoats"EntermdI’ Planning and Problem ’Solving by Paul R. Cohen Chaptb-rXV-of Volumec III’of the Handbook of Artificial Intelligence edited by Paul R
Computer Problem-Solving Coaches
NASA Astrophysics Data System (ADS)
Hsu, Leon; Heller, Kenneth
2005-09-01
Computers might be able to play an important role in physics instruction by coaching students to develop good problem-solving skills. Building on previous research on student problem solving and on designing computer programs to teach cognitive skills, we are developing a prototype computer coach to provide students with guided practice in solving problems. In addition to helping students become better problem solvers, such programs can be useful in studying how students learn to solve problems and how and if problem-solving skills can be transferred from a computer to a pencil-and-paper environment.
The Identity of Problem Solving
ERIC Educational Resources Information Center
Mamona-Downs, Joanna; Downs, Martin
2005-01-01
This paper raises issues motivated by considering the "identity" of problem solving. This means that we are concerned with how other mathematics education topics impinge on problem solving, and with themes that naturally arise within the problem-solving agenda. We claim that some of these issues need more attention by educational research, while…
Problem Solving and Beginning Programming.
ERIC Educational Resources Information Center
McAllister, Alan
Based on current models of problem solving within cognitive psychology, this study focused on the spontaneous problem solving strategies used by children as they first learned LOGO computer programming, and on strategy transformations that took place during the problem solving process. The research consisted of a six weeks programming training…
Cristofolini, Andrea; Latini, Chiara; Borghi, Carlo A.
2011-02-01
This paper presents a technique for improving the convergence rate of a generalized minimum residual (GMRES) algorithm applied for the solution of a algebraic system produced by the discretization of an electrodynamic problem with a tensorial electrical conductivity. The electrodynamic solver considered in this work is a part of a magnetohydrodynamic (MHD) code in the low magnetic Reynolds number approximation. The code has been developed for the analysis of MHD interaction during the re-entry phase of a space vehicle. This application is a promising technique intensively investigated for the shock mitigation and the vehicle control in the higher layers of a planetary atmosphere. The medium in the considered application is a low density plasma, characterized by a tensorial conductivity. This is a result of the behavior of the free electric charges, which tend to drift in a direction perpendicular both to the electric field and to the magnetic field. In the given approximation, the electrodynamics is described by an elliptical partial differential equation, which is solved by means of a finite element approach. The linear system obtained by discretizing the problem is solved by means of a GMRES iterative method with an incomplete LU factorization threshold preconditioning. The convergence of the solver appears to be strongly affected by the tensorial characteristic of the conductivity. In order to deal with this feature, the bandwidth reduction in the coefficient matrix is considered and a novel technique is proposed and discussed. First, the standard reverse Cuthill-McKee (RCM) procedure has been applied to the problem. Then a modification of the RCM procedure (the weighted RCM procedure, WRCM) has been developed. In the last approach, the reordering is performed taking into account the relation between the mesh geometry and the magnetic field direction. In order to investigate the effectiveness of the methods, two cases are considered. The RCM and WRCM procedures
Measuring Family Problem Solving: The Family Problem Solving Diary.
ERIC Educational Resources Information Center
Kieren, Dianne K.
The development and use of the family problem-solving diary are described. The diary is one of several indicators and measures of family problem-solving behavior. It provides a record of each person's perception of day-to-day family problems (what the problem concerns, what happened, who got involved, what those involved did, how the problem…
Problem Solving: Tips for Teachers.
ERIC Educational Resources Information Center
O'Daffer, Phares G., Ed.; Schaaf, Oscar
1986-01-01
Describes: (1) a computation-oriented problem with procedures and some questions that might be asked of students; (2) four ways to help students develop positive problem-solving attitudes; (3) a strategy game; (4) a multiplication problem; and (5) several questions that will help students develop problem-solving skills. (JN)
Resource Scarcity: Problems Technology Cannot Solve; Problems Technology Can Solve.
ERIC Educational Resources Information Center
Meadows, Dennis; Castle, Emery N.
1979-01-01
Lists resource problems technology can and cannot solve, and emphasizes the need for considering and restructuring the social environments and institutions as well as developing new technologies. (CK)
ERIC Educational Resources Information Center
Niaz, Mansoor
The main objective of this study is to construct models based on strategies students use to solve chemistry problems and to show that these models form sequences of progressive transitions similar to what Lakatos (1970) in the history of science refers to as progressive 'problemshifts' that increase the explanatory' heuristic power of the models.…
Technological Problem Solving: A Proposal.
ERIC Educational Resources Information Center
Waetjen, Walter B.
Examination of newer technology education materials reveals two recurring themes: one relates to curriculum content, familiarizing students with technology, and another to a technique of classroom instruction, i.e., problem solving. A problem-solving framework for technical education has the following components: (1) define the problem; (2)…
Problem Solving Style, Creative Thinking, and Problem Solving Confidence
ERIC Educational Resources Information Center
Houtz, John C.; Selby, Edwin C.
2009-01-01
Forty-two undergraduate and graduate students completed VIEW: An Assessment of Problem Solving Style, the non-verbal Torrance Test Thinking Creatively with Pictures, and the Problem Solving Inventory (PSI). VIEW assesses individuals' orientation to change, manner of processing, and ways of deciding, while the Torrance test measures several…
Herman, Gabor T; Chen, Wei
2008-03-01
The goal of Intensity-Modulated Radiation Therapy (IMRT) is to deliver sufficient doses to tumors to kill them, but without causing irreparable damage to critical organs. This requirement can be formulated as a linear feasibility problem. The sequential (i.e., iteratively treating the constraints one after another in a cyclic fashion) algorithm ART3 is known to find a solution to such problems in a finite number of steps, provided that the feasible region is full dimensional. We present a faster algorithm called ART3+. The idea of ART3+ is to avoid unnecessary checks on constraints that are likely to be satisfied. The superior performance of the new algorithm is demonstrated by mathematical experiments inspired by the IMRT application.
Zhang, Weizhe; Bai, Enci; He, Hui; Cheng, Albert M.K.
2015-01-01
Reducing energy consumption is becoming very important in order to keep battery life and lower overall operational costs for heterogeneous real-time multiprocessor systems. In this paper, we first formulate this as a combinatorial optimization problem. Then, a successful meta-heuristic, called Shuffled Frog Leaping Algorithm (SFLA) is proposed to reduce the energy consumption. Precocity remission and local optimal avoidance techniques are proposed to avoid the precocity and improve the solution quality. Convergence acceleration significantly reduces the search time. Experimental results show that the SFLA-based energy-aware meta-heuristic uses 30% less energy than the Ant Colony Optimization (ACO) algorithm, and 60% less energy than the Genetic Algorithm (GA) algorithm. Remarkably, the running time of the SFLA-based meta-heuristic is 20 and 200 times less than ACO and GA, respectively, for finding the optimal solution. PMID:26110406
Zhang, Weizhe; Bai, Enci; He, Hui; Cheng, Albert M K
2015-06-11
Reducing energy consumption is becoming very important in order to keep battery life and lower overall operational costs for heterogeneous real-time multiprocessor systems. In this paper, we first formulate this as a combinatorial optimization problem. Then, a successful meta-heuristic, called Shuffled Frog Leaping Algorithm (SFLA) is proposed to reduce the energy consumption. Precocity remission and local optimal avoidance techniques are proposed to avoid the precocity and improve the solution quality. Convergence acceleration significantly reduces the search time. Experimental results show that the SFLA-based energy-aware meta-heuristic uses 30% less energy than the Ant Colony Optimization (ACO) algorithm, and 60% less energy than the Genetic Algorithm (GA) algorithm. Remarkably, the running time of the SFLA-based meta-heuristic is 20 and 200 times less than ACO and GA, respectively, for finding the optimal solution.
Robot computer problem solving system
NASA Technical Reports Server (NTRS)
Merriam, E. W.; Becker, J. D.
1973-01-01
A robot computer problem solving system which represents a robot exploration vehicle in a simulated Mars environment is described. The model exhibits changes and improvements made on a previously designed robot in a city environment. The Martian environment is modeled in Cartesian coordinates; objects are scattered about a plane; arbitrary restrictions on the robot's vision have been removed; and the robot's path contains arbitrary curves. New environmental features, particularly the visual occlusion of objects by other objects, were added to the model. Two different algorithms were developed for computing occlusion. Movement and vision capabilities of the robot were established in the Mars environment, using LISP/FORTRAN interface for computational efficiency. The graphical display program was redesigned to reflect the change to the Mars-like environment.
1988-01-01
behavior theory by investigators such as Thorndike (1923), Tolman Now at Stanford University. (1928); Skinner (1938), and Hull (1943). The h*902tion of...were developed by Gestalt psychologists Coti1ct Number N00014-79-C-0215, Contract Identification such as Khler (IM), Duncker (1935/1%5), Nuat NR 667...are necessary components goals and adopting general plans or methods in of a theory of human thought. working on a problem. Models of general problem
The Future Problem Solving Program.
ERIC Educational Resources Information Center
Crabbe, Anne B.
1989-01-01
Describes the Future Problem Solving Program, in which students from the U.S. and around the world are tackling some complex challenges facing society, ranging from acid rain to terrorism. The program uses a creative problem solving process developed for business and industry. A sixth-grade toxic waste cleanup project illustrates the process.…
Creative Thinking and Problem Solving.
ERIC Educational Resources Information Center
Lacy, Grace
The booklet considers the nature of creativity in children and examines classroom implications. Among the topics addressed are the following: theories about creativity; research; developments in brain research; the creative process; creative problem solving; the Structure of Intellect Problem Solving (SIPS) model; a rationale for creativity in the…
Difficulties in Genetics Problem Solving.
ERIC Educational Resources Information Center
Tolman, Richard R.
1982-01-01
Examined problem-solving strategies of 30 high school students as they solved genetics problems. Proposes a new sequence of teaching genetics based on results: meiosis, sex chromosomes, sex determination, sex-linked traits, monohybrid and dihybrid crosses (humans), codominance (humans), and Mendel's pea experiments. (JN)
Problem Solving, Scaffolding and Learning
ERIC Educational Resources Information Center
Lin, Shih-Yin
2012-01-01
Helping students to construct robust understanding of physics concepts and develop good solving skills is a central goal in many physics classrooms. This thesis examine students' problem solving abilities from different perspectives and explores strategies to scaffold students' learning. In studies involving analogical problem solving…
Learning Impasses in Problem Solving
NASA Technical Reports Server (NTRS)
Hodgson, J. P. E.
1992-01-01
Problem Solving systems customarily use backtracking to deal with obstacles that they encounter in the course of trying to solve a problem. This paper outlines an approach in which the possible obstacles are investigated prior to the search for a solution. This provides a solution strategy that avoids backtracking.
1981-05-18
obstacles that were not encountered previously in puzzle-like problems. Basically, the exact operators to be used are usually not given, the goal state...same height on other side 5. IF something goes down frictionless surface THEN can find acceleration of gravity on the incline using trigonometry 6
ERIC Educational Resources Information Center
De Bono, Edward
A group of children were presented with several tasks, including the invention of a sleep machine and a machine to weigh elephants. The tasks were chosen to involve the children in coping with problems of a distinct character. A study of the children's drawings and interpretations shows that children's thinking ability is not very different from…
NASA Technical Reports Server (NTRS)
1979-01-01
The corrosion problem, it turned out, stemmed from the process called electrolysis. When two different metals are in contact, an electrical potential is set up between them; when the metals are surrounded by an electrolyte, or a conducting medium, the resulting reaction causes corrosion, often very rapid corrosion. In this case the different metals were the copper grounding system and the ferry's aluminum hull; the dockside salt water in which the hull was resting served as the electrolyte. After identifying the source of the trouble, the Ames engineer provided a solution: a new wire-and-rod grounding system made of aluminum like the ferry's hull so there would no longer be dissimilar metals in contact. Ames research on the matter disclosed that the problem was not unique to the Golden Gate ferries. It is being experienced by many pleasure boat operators who are probably as puzzled about it as was the Golden Gate Transit Authority.
Solving bearing overheating problems
Jendzurski, T.
1995-05-08
Overheating is a major indicator, along with vibration and noise, of an underlying problem affecting a bearing or related components. Because normal operating temperatures vary widely from one application to another, no single temperature is a reliable sign of overheating in every situation. By observing an application when it is running smoothly, a technician can establish a benchmark temperature for a particular bearing arrangement. Wide deviations from this accepted norm generally indicate troublesome overheating. The list of possible causes of over-heating ranges from out-of-round housings and oversize shaft diameters to excessive lubrication and bearing preloading. These causes fall into two major categories: improper or faulty lubrication and mechanical problems, such as incorrect fits and tolerances. These are discussed along with solutions.
Modeling Applied to Problem Solving
NASA Astrophysics Data System (ADS)
Pawl, Andrew; Barrantes, Analia; Pritchard, David E.
2009-10-01
Modeling Applied to Problem Solving (MAPS) is a pedagogy that helps students transfer instruction to problem solving in an expert-like manner. Declarative and Procedural syllabus content is organized and learned (not discovered) as a hierarchy of General Models. Students solve problems using an explicit Problem Modeling Rubric that begins with System, Interactions and Model (S.I.M.). System and Interactions are emphasized as the key to a strategic description of the system and the identification of the appropriate General Model to apply to the problem. We have employed the pedagogy in a three-week review course for students who received a D in mechanics. The course was assessed by a final exam retest as well as pre and post C-LASS surveys, yielding a one standard deviation improvement in the students' ability to solve final exam problems and a statistically significant positive shift in 7 of the 9 categories in the C-LASS.
Irrelevance in Problem Solving
NASA Technical Reports Server (NTRS)
Levy, Alon Y.
1992-01-01
The notion of irrelevance underlies many different works in AI, such as detecting redundant facts, creating abstraction hierarchies and reformulation and modeling physical devices. However, in order to design problem solvers that exploit the notion of irrelevance, either by automatically detecting irrelevance or by being given knowledge about irrelevance, a formal treatment of the notion is required. In this paper we present a general framework for analyzing irrelevance. We discuss several properties of irrelevance and show how they vary in a space of definitions outlined by the framework. We show how irrelevance claims can be used to justify the creation of abstractions thereby suggesting a new view on the work on abstraction.
Supporting Problem Solving in PBL
ERIC Educational Resources Information Center
Jonassen, David
2011-01-01
Although the characteristics of PBL (problem focused, student centered, self-directed, etc.) are well known, the components of a problem-based learning environment (PBLE) and the cognitive scaffolds necessary to support learning to solve different kinds of problems with different learners is less clear. This paper identifies the different…
Problem Solving with General Semantics.
ERIC Educational Resources Information Center
Hewson, David
1996-01-01
Discusses how to use general semantics formulations to improve problem solving at home or at work--methods come from the areas of artificial intelligence/computer science, engineering, operations research, and psychology. (PA)
Student Problem-Solving Behaviors
NASA Astrophysics Data System (ADS)
Harper, Kathleen A.
2006-04-01
Kathy Harper is director of undergraduate curriculum development in the physics department at The Ohio State University. She has been involved in local and national workshops for in-service teachers and conducts research in student problem solving.
AI tools in computer based problem solving
NASA Technical Reports Server (NTRS)
Beane, Arthur J.
1988-01-01
The use of computers to solve value oriented, deterministic, algorithmic problems, has evolved a structured life cycle model of the software process. The symbolic processing techniques used, primarily in research, for solving nondeterministic problems, and those for which an algorithmic solution is unknown, have evolved a different model, much less structured. Traditionally, the two approaches have been used completely independently. With the advent of low cost, high performance 32 bit workstations executing identical software with large minicomputers and mainframes, it became possible to begin to merge both models into a single extended model of computer problem solving. The implementation of such an extended model on a VAX family of micro/mini/mainframe systems is described. Examples in both development and deployment of applications involving a blending of AI and traditional techniques are given.
On an algorithm for solving parabolic and elliptic equations
NASA Astrophysics Data System (ADS)
D'Ascenzo, N.; Saveliev, V. I.; Chetverushkin, B. N.
2015-08-01
The present-day rapid growth of computer power, in particular, parallel computing systems of ultrahigh performance requires a new approach to the creation of models and solution algorithms for major problems. An algorithm for solving parabolic and elliptic equations is proposed. The capabilities of the method are demonstrated by solving astrophysical problems on high-performance computer systems with massive parallelism.
Problem Solving through Paper Folding
ERIC Educational Resources Information Center
Wares, Arsalan
2014-01-01
The purpose of this article is to describe a couple of challenging mathematical problems that involve paper folding. These problem-solving tasks can be used to foster geometric and algebraic thinking among students. The context of paper folding makes some of the abstract mathematical ideas involved relatively concrete. When implemented…
Students' Problem Solving and Justification
ERIC Educational Resources Information Center
Glass, Barbara; Maher, Carolyn A.
2004-01-01
This paper reports on methods of students' justifications of their solution to a problem in the area of combinatorics. From the analysis of the problem solving of 150 students in a variety of settings from high-school to graduate study, four major forms of reasoning evolved: (1) Justification by Cases, (2) Inductive Argument, (3) Elimination…
Robot, computer problem solving system
NASA Technical Reports Server (NTRS)
Becker, J. D.
1972-01-01
The development of a computer problem solving system is reported that considers physical problems faced by an artificial robot moving around in a complex environment. Fundamental interaction constraints with a real environment are simulated for the robot by visual scan and creation of an internal environmental model. The programming system used in constructing the problem solving system for the simulated robot and its simulated world environment is outlined together with the task that the system is capable of performing. A very general framework for understanding the relationship between an observed behavior and an adequate description of that behavior is included.
Customer-centered problem solving.
Samelson, Q B
1999-11-01
If there is no single best way to attract new customers and retain current customers, there is surely an easy way to lose them: fail to solve the problems that arise in nearly every buyer-supplier relationship, or solve them in an unsatisfactory manner. Yet, all too frequently, companies do just that. Either we deny that a problem exists, we exert all our efforts to pin the blame elsewhere, or we "Band-Aid" the problem instead of fixing it, almost guaranteeing that we will face it again and again.
Mathematical problem solving by analogy.
Novick, L R; Holyoak, K J
1991-05-01
We report the results of 2 experiments and a verbal protocol study examining the component processes of solving mathematical word problems by analogy. College students first studied a problem and its solution, which provided a potential source for analogical transfer. Then they attempted to solve several analogous problems. For some problems, subjects received one of a variety of hints designed to reduce or eliminate the difficulty of some of the major processes hypothesized to be involved in analogical transfer. Our studies yielded 4 major findings. First, the process of mapping the features of the source and target problems and the process of adapting the source solution procedure for use in solving the target problem were clearly distinguished: (a) Successful mapping was found to be insufficient for successful transfer and (b) adaptation was found to be a major source of transfer difficulty. Second, we obtained direct evidence that schema induction is a natural consequence of analogical transfer. The schema was found to co-exist with the problems from which it was induced, and both the schema and the individual problems facilitated later transfer. Third, for our multiple-solution problems, the relation between analogical transfer and solution accuracy was mediated by the degree of time pressure exerted for the test problems. Finally, mathematical expertise was a significant predictor of analogical transfer, but general analogical reasoning ability was not. The implications of the results for models of analogical transfer and for instruction were considered.
Problem? "No Problem!" Solving Technical Contradictions
ERIC Educational Resources Information Center
Kutz, K. Scott; Stefan, Victor
2007-01-01
TRIZ (pronounced TREES), the Russian acronym for the theory of inventive problem solving, enables a person to focus his attention on finding genuine, potential solutions in contrast to searching for ideas that "may" work through a happenstance way. It is a patent database-backed methodology that helps to reduce time spent on the problem,…
Quantum Computing: Solving Complex Problems
DiVincenzo, David [IBM Watson Research Center
2016-07-12
One of the motivating ideas of quantum computation was that there could be a new kind of machine that would solve hard problems in quantum mechanics. There has been significant progress towards the experimental realization of these machines (which I will review), but there are still many questions about how such a machine could solve computational problems of interest in quantum physics. New categorizations of the complexity of computational problems have now been invented to describe quantum simulation. The bad news is that some of these problems are believed to be intractable even on a quantum computer, falling into a quantum analog of the NP class. The good news is that there are many other new classifications of tractability that may apply to several situations of physical interest.
NASA Astrophysics Data System (ADS)
Shorikov, A. F.
2016-12-01
This article discusses the discrete-time dynamical system consisting from two controlled objects and described by a linear recurrent vector equations in the presence of uncertain perturbations. This dynamical system has two levels of a control: dominant level (the first level or the level I) and subordinate level (the second level or the level II) and both have different linear terminal criterions of functioning and united a priori by determined information and control connections. It is assumed that the sets constraining all a priori undefined parameters are known and they are a finite sets or convex, closed and bounded polyhedrons in the corresponding finite-dimensional vector spaces. For the dynamical system in question, we propose a mathematical formalization in the form of solving two-level hierarchical minimax program control problem with incomplete information. In this article for solving of the investigated problem is proposed the algorithm that has a form of a recurrent procedure of solving a linear programming and a finite optimization problems. The results obtained in this article can be used for computer simulation of an actual dynamical processes and for designing controlling and navigation systems.
Teaching through Collaborative Problem Solving.
ERIC Educational Resources Information Center
Blandford, A. E.
1994-01-01
Discussion of a prototype intelligent education system called WOMBAT (Weighted Objectives Method by Arguing with the Tutor) focuses on dialogue and negotiation in collaborative problem solving. The results of a formative evaluation, in which the system was used by 10 subjects who commented on various aspects of the design, are presented. (Contains…
Robot computer problem solving system
NASA Technical Reports Server (NTRS)
Becker, J. D.; Merriam, E. W.
1974-01-01
The conceptual, experimental, and practical aspects of the development of a robot computer problem solving system were investigated. The distinctive characteristics were formulated of the approach taken in relation to various studies of cognition and robotics. Vehicle and eye control systems were structured, and the information to be generated by the visual system is defined.
ERIC Educational Resources Information Center
Pizlo, Zygmunt
2008-01-01
This paper presents a bibliography of more than 200 references related to human problem solving, arranged by subject matter. The references were taken from PsycInfo database. Journal papers, book chapters, books and dissertations are included. The topics include human development, education, neuroscience, research in applied settings, as well as…
Error Patterns in Problem Solving.
ERIC Educational Resources Information Center
Babbitt, Beatrice C.
Although many common problem-solving errors within the realm of school mathematics have been previously identified, a compilation of such errors is not readily available within learning disabilities textbooks, mathematics education texts, or teacher's manuals for school mathematics texts. Using data on error frequencies drawn from both the Fourth…
Gender and Mathematical Problem Solving.
ERIC Educational Resources Information Center
Duffy, Jim; Gunther, Georg; Walters, Lloyd
1997-01-01
Studied the relationship between gender and mathematical problem solving in 83 male and 76 female high achieving Canadian 12-year-olds. Gender differences were found on the Canadian Test of Basic Skills but not on the GAUSS assessment. Implications for the discussion of the origin of gender differences in mathematics are discussed. (SLD)
ERIC Educational Resources Information Center
Pizlo, Zygmunt
2007-01-01
This paper presents a bibliography of a little more than 100 references related to human problem solving, arranged by subject matter. The references were taken from PsycInfo and Compendex databases. Only journal papers, books and dissertations are included. The topics include human development, education, neuroscience, research in applied…
Customer Service & Team Problem Solving.
ERIC Educational Resources Information Center
Martin, Sabrina Budasi
This curriculum guide provides materials for a six-session, site-specific training course in customer service and team problem solving for the Claretian Medical Center. The course outline is followed the six lesson plans. Components of each lesson plan include a list of objectives, an outline of activities and discussion topics for the lesson,…
Robot computer problem solving system
NASA Technical Reports Server (NTRS)
Becker, J. D.; Merriam, E. W.
1974-01-01
The conceptual, experimental, and practical phases of developing a robot computer problem solving system are outlined. Robot intelligence, conversion of the programming language SAIL to run under the THNEX monitor, and the use of the network to run several cooperating jobs at different sites are discussed.
ERIC Educational Resources Information Center
Funke, Joachim
2013-01-01
This paper presents a bibliography of 263 references related to human problem solving, arranged by subject matter. The references were taken from PsycInfo and Academic Premier data-base. Journal papers, book chapters, and dissertations are included. The topics include human development, education, neuroscience, and research in applied settings. It…
ERIC Educational Resources Information Center
Champagne, Audrey B.; And Others
Teachers in elementary schools, supervisors of instruction, and other educational practitioners are the primary audience for this publication. The paper presents philosophical, psychological, and practical reasons for including a problem-solving approach in elementary school instruction. It draws on the writings of John Dewey, Jean Piaget, James…
NASA Astrophysics Data System (ADS)
Marinin, I. V.; Kabanikhin, S. I.; Krivorotko, O. I.; Karas, A.; Khidasheli, D. G.
2012-04-01
We consider new techniques and methods for earthquake and tsunami related problems, particularly - inverse problems for the determination of tsunami source parameters, numerical simulation of long wave propagation in soil and water and tsunami risk estimations. In addition, we will touch upon the issue of database management and destruction scenario visualization. New approaches and strategies, as well as mathematical tools and software are to be shown. The long joint investigations by researchers of the Institute of Mathematical Geophysics and Computational Mathematics SB RAS and specialists from WAPMERR and Informap have produced special theoretical approaches, numerical methods, and software tsunami and earthquake modeling (modeling of propagation and run-up of tsunami waves on coastal areas), visualization, risk estimation of tsunami, and earthquakes. Algorithms are developed for the operational definition of the origin and forms of the tsunami source. The system TSS numerically simulates the source of tsunami and/or earthquakes and includes the possibility to solve the direct and the inverse problem. It becomes possible to involve advanced mathematical results to improve models and to increase the resolution of inverse problems. Via TSS one can construct maps of risks, the online scenario of disasters, estimation of potential damage to buildings and roads. One of the main tools for the numerical modeling is the finite volume method (FVM), which allows us to achieve stability with respect to possible input errors, as well as to achieve optimum computing speed. Our approach to the inverse problem of tsunami and earthquake determination is based on recent theoretical results concerning the Dirichlet problem for the wave equation. This problem is intrinsically ill-posed. We use the optimization approach to solve this problem and SVD-analysis to estimate the degree of ill-posedness and to find the quasi-solution. The software system we developed is intended to
Al Nasr, Kamal; Ranjan, Desh; Zubair, Mohammad; Chen, Lin; He, Jing
2014-01-01
Electron cryomicroscopy is becoming a major experimental technique in solving the structures of large molecular assemblies. More and more three-dimensional images have been obtained at the medium resolutions between 5 and 10 Å. At this resolution range, major α-helices can be detected as cylindrical sticks and β-sheets can be detected as plain-like regions. A critical question in de novo modeling from cryo-EM images is to determine the match between the detected secondary structures from the image and those on the protein sequence. We formulate this matching problem into a constrained graph problem and present an O(Δ(2)N(2)2(N)) algorithm to this NP-Hard problem. The algorithm incorporates the dynamic programming approach into a constrained K-shortest path algorithm. Our method, DP-TOSS, has been tested using α-proteins with maximum 33 helices and α-β proteins up to five helices and 12 β-strands. The correct match was ranked within the top 35 for 19 of the 20 α-proteins and all nine α-β proteins tested. The results demonstrate that DP-TOSS improves accuracy, time and memory space in deriving the topologies of the secondary structure elements for proteins with a large number of secondary structures and a complex skeleton.
Genetics problem solving and worldview
NASA Astrophysics Data System (ADS)
Dale, Esther
The research goal was to determine whether worldview relates to traditional and real-world genetics problem solving. Traditionally, scientific literacy emphasized content knowledge alone because it was sufficient to solve traditional problems. The contemporary definition of scientific literacy is, "The knowledge and understanding of scientific concepts and processes required for personal decision-making, participation in civic and cultural affairs and economic productivity" (NRC, 1996). An expanded definition of scientific literacy is needed to solve socioscientific issues (SSI), complex social issues with conceptual, procedural, or technological associations with science. Teaching content knowledge alone assumes that students will find the scientific explanation of a phenomenon to be superior to a non-science explanation. Formal science and everyday ways of thinking about science are two different cultures (Palmer, 1999). Students address this rift with cognitive apartheid, the boxing away of science knowledge from other types of knowledge (Jedege & Aikenhead, 1999). By addressing worldview, cognitive apartheid may decrease and scientific literacy may increase. Introductory biology students at the University of Minnesota during fall semester 2005 completed a written questionnaire-including a genetics content-knowledge test, four genetic dilemmas, the Worldview Assessment Instrument (WAI) and some items about demographics and religiosity. Six students responded to the interview protocol. Based on statistical analysis and interview data, this study concluded the following: (1) Worldview, in the form of metaphysics, relates to solving traditional genetic dilemmas. (2) Worldview, in the form of agency, relates to solving traditional genetics problems. (3) Thus, worldview must be addressed in curriculum, instruction, and assessment.
Modeling Applied to Problem Solving
NASA Astrophysics Data System (ADS)
Pawl, Andrew; Barrantes, Analia; Pritchard, David E.
2009-11-01
We describe a modeling approach to help students learn expert problem solving. Models are used to present and hierarchically organize the syllabus content and apply it to problem solving, but students do not develop and validate their own Models through guided discovery. Instead, students classify problems under the appropriate instructor-generated Model by selecting a system to consider and describing the interactions that are relevant to that system. We believe that this explicit System, Interactions and Model (S.I.M.) problem modeling strategy represents a key simplification and clarification of the widely disseminated modeling approach originated by Hestenes and collaborators. Our narrower focus allows modeling physics to be integrated into (as opposed to replacing) a typical introductory college mechanics course, while preserving the emphasis on understanding systems and interactions that is the essence of modeling. We have employed the approach in a three-week review course for MIT freshmen who received a D in the fall mechanics course with very encouraging results.
Journey toward Teaching Mathematics through Problem Solving
ERIC Educational Resources Information Center
Sakshaug, Lynae E.; Wohlhuter, Kay A.
2010-01-01
Teaching mathematics through problem solving is a challenge for teachers who learned mathematics by doing exercises. How do teachers develop their own problem solving abilities as well as their abilities to teach mathematics through problem solving? A group of teachers began the journey of learning to teach through problem solving while taking a…
Teaching Problem Solving through Children's Literature.
ERIC Educational Resources Information Center
Forgan, James W.
This book helps general and special education teachers empower students in grades K-4 to independently solve problems by teaching them how characters in children's literature books solved similar problems. Students are also taught a problem solving strategy that they can apply to solve problems in any situation. The book contains ready-to-use…
Solving Maxwell eigenvalue problems for accelerating cavities
NASA Astrophysics Data System (ADS)
Arbenz, Peter; Geus, Roman; Adam, Stefan
2001-02-01
We investigate algorithms for computing steady state electromagnetic waves in cavities. The Maxwell equations for the strength of the electric field are solved by a mixed method with quadratic finite edge (Nédélec) elements for the field values and corresponding node-based finite elements for the Lagrange multiplier. This approach avoids so-called spurious modes which are introduced if the divergence-free condition for the electric field is not treated properly. To compute a few of the smallest positive eigenvalues and corresponding eigenmodes of the resulting large sparse matrix eigenvalue problems, two algorithms have been used: the implicitly restarted Lanczos algorithm and the Jacobi-Davidson algorithm, both with shift-and-invert spectral transformation. Two-level hierarchical basis preconditioners have been employed for the iterative solution of the resulting systems of equations.
Genetic Algorithms for solving SVM-ICA
NASA Astrophysics Data System (ADS)
Górriz, J. M.; Puntonet, C. G.
2004-11-01
In this paper we solve the well known ill-posed problem called Independent Component Analysis using the Support Vector Machines (SVM) methodology and proposing a genetic algorithm to minimize a nonconvex and nonlinear cost function based on statistical estimators. In this way a novel method for blindly separating unobservable independent component signals from their linear and non linear (using mapping functions) mixtures is devised. The GA presented in this work is able to extract independent components with faster rate than the previous independent component analysis algorithms based on Higher Order Statistics (HOS) as input space dimension increases showing significant accuracy and robustness. Using a suitable mathematically notation we derive independent functions equivalent to the Maximum Entropy principle.
Solving the Dark Matter Problem
Baltz, Ted
2016-07-12
Cosmological observations have firmly established that the majority of matter in the universe is of an unknown type, called 'dark matter'. A compelling hypothesis is that the dark matter consists of weakly interacting massive particles (WIMPs) in the mass range around 100 GeV. If the WIMP hypothesis is correct, such particles could be created and studied at accelerators. Furthermore they could be directly detected as the primary component of our galaxy. Solving the dark matter problem requires that the connection be made between the two. We describe some theoretical and experimental avenues that might lead to this connection.
2008-09-18
fumarase; MAN ) mandelate racemase; PEP ) carboxypeptidase B; CDA ) E . coli cytidine deaminase; KSI ) ketosteroid isomerase; CMU ) chorismate...resumption of respiration. A 3D model of E . coli Ndh according to Schmid and Gerloff (2004). Putative flavin-, NADH-, and membrane-binding domains are...DATE 18 SEP 2008 2. REPORT TYPE 3 . DATES COVERED 00-00-2008 to 00-00-2008 4. TITLE AND SUBTITLE Some Very Hard Problems in Nature (Biology
Quantum Algorithm for Linear Programming Problems
NASA Astrophysics Data System (ADS)
Joag, Pramod; Mehendale, Dhananjay
The quantum algorithm (PRL 103, 150502, 2009) solves a system of linear equations with exponential speedup over existing classical algorithms. We show that the above algorithm can be readily adopted in the iterative algorithms for solving linear programming (LP) problems. The first iterative algorithm that we suggest for LP problem follows from duality theory. It consists of finding nonnegative solution of the equation forduality condition; forconstraints imposed by the given primal problem and for constraints imposed by its corresponding dual problem. This problem is called the problem of nonnegative least squares, or simply the NNLS problem. We use a well known method for solving the problem of NNLS due to Lawson and Hanson. This algorithm essentially consists of solving in each iterative step a new system of linear equations . The other iterative algorithms that can be used are those based on interior point methods. The same technique can be adopted for solving network flow problems as these problems can be readily formulated as LP problems. The suggested quantum algorithm cansolveLP problems and Network Flow problems of very large size involving millions of variables.
King Oedipus and the Problem Solving Process.
ERIC Educational Resources Information Center
Borchardt, Donald A.
An analysis of the problem solving process reveals at least three options: (1) finding the cause, (2) solving the problem, and (3) anticipating potential problems. These methods may be illustrated by examining "Oedipus Tyrannus," a play in which a king attempts to deal with a problem that appears to be beyond his ability to solve, and…
Problem Solving with the Elementary Youngster.
ERIC Educational Resources Information Center
Swartz, Vicki
This paper explores research on problem solving and suggests a problem-solving approach to elementary school social studies, using a culture study of the ancient Egyptians and King Tut as a sample unit. The premise is that problem solving is particularly effective in dealing with problems which do not have one simple and correct answer but rather…
Disciplinary Foundations for Solving Interdisciplinary Scientific Problems
ERIC Educational Resources Information Center
Zhang, Dongmei; Shen, Ji
2015-01-01
Problem-solving has been one of the major strands in science education research. But much of the problem-solving research has been conducted on discipline-based contexts; little research has been done on how students, especially individuals, solve interdisciplinary problems. To understand how individuals reason about interdisciplinary problems, we…
Research on Computers and Problem Solving.
ERIC Educational Resources Information Center
Burton, John K.; And Others
1988-01-01
Eight articles review and report on research involving computers and problem solving skills. Topics discussed include research design; problem solving skills and programing languages, including BASIC and LOGO; computer anxiety; diagnostic programs for arithmetic problems; and relationships between ability and problem solving scores and between…
Teaching DICOM by problem solving.
Noumeir, Rita; Pambrun, Jean-François
2012-10-01
The Digital Imaging and Communications in Medicine (DICOM) is the standard for encoding and communicating medical imaging information. It is used in radiology as well as in many other imaging domains such as ophthalmology, dentistry, and pathology. DICOM information objects are used to encode medical images or information about the images. Their usage outside of the imaging department is increasing, especially with the sharing of medical images within Electronic Health Record systems. However, learning DICOM is long and difficult because it defines and uses many specific abstract concepts that relate to each other. In this paper, we present an approach, based on problem solving, for teaching DICOM as part of a graduate course on healthcare information. The proposed approach allows students with diversified background and no software development experience to grasp a large breadth of knowledge in a very short time.
Exploiting Quantum Resonance to Solve Combinatorial Problems
NASA Technical Reports Server (NTRS)
Zak, Michail; Fijany, Amir
2006-01-01
Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.
A Semantic-Linguistic Method of Solving Verbal Problems.
ERIC Educational Resources Information Center
Hoggard, Franklin R.
1987-01-01
Suggests a method for solving verbal problems in chemistry using a linguistic algorithm that is partly adapted from two artificial intelligence languages. Provides examples of problems solved using the mental concepts of translation, rotation, mirror image symmetry, superpositioning, disjoininng, and conjoining. (TW)
The Problem Solving Studio: An Apprenticeship Environment for Aspiring Engineers
ERIC Educational Resources Information Center
Le Doux, Joseph M.; Waller, Alisha A.
2016-01-01
This paper describes the problem-solving studio (PSS) learning environment. PSS was designed to teach students how to solve difficult analytical engineering problems without resorting to rote memorization of algorithms, while at the same time developing their deep conceptual understanding of the course topics. There are several key features of…
Creative Problem Solving for Social Studies.
ERIC Educational Resources Information Center
Weiss, Steve; Kinney, Mark; And Others
1980-01-01
This article discusses techniques for integrating real problem solving and decision making into secondary social studies programs. Approaches to creative problem solving are presented, and various systematic decision making programs currently available for classroom use are identified. (Author/RM)
Community-powered problem solving.
Gouillart, Francis; Billings, Douglas
2013-04-01
Traditionally, companies have managed their constituencies with specific processes: marketing to customers, procuring from vendors, developing HR policies for employees, and so on. The problem is, such processes focus on repeatability and compliance, so they can lead to stagnation. Inviting your constituencies to collectively help you solve problems and exploit opportunities--"co-creation"--is a better approach. It allows you to continually tap the skills and insights of huge numbers of stakeholders and develop new ways to produce value for all. The idea is to provide stakeholders with platforms (physical and digital forums) on which they can interact, get them to start exploring new experiences and connections, and let the system grow organically. A co-creation initiative by a unit of Becton, Dickinson and Company demonstrates how this works. A global leader in syringes, BD set out to deepen its ties with hospital customers and help them reduce the incidence of infections from unsafe injection and syringe disposal practices. The effort began with a cross-functional internal team, brought in the hospital procurement and supply managers BD had relationships with, and then reached out to hospitals' infection-prevention and occupational health leaders. Eventually product designers, nurses, sustainability staffers, and even hospital CFOs were using the platform, contributing data that generated new best practices and reduced infections.
LEGO Robotics: An Authentic Problem Solving Tool?
ERIC Educational Resources Information Center
Castledine, Alanah-Rei; Chalmers, Chris
2011-01-01
With the current curriculum focus on correlating classroom problem solving lessons to real-world contexts, are LEGO robotics an effective problem solving tool? This present study was designed to investigate this question and to ascertain what problem solving strategies primary students engaged with when working with LEGO robotics and whether the…
Collis-Romberg Mathematical Problem Solving Profiles.
ERIC Educational Resources Information Center
Collis, K. F.; Romberg, T. A.
Problem solving has become a focus of mathematics programs in Australia in recent years, necessitating the assessment of students' problem-solving abilities. This manual provides a problem-solving assessment and teaching resource package containing four elements: (1) profiles assessment items; (2) profiles diagnostic forms for recording individual…
Kindergarten Students Solving Mathematical Word Problems
ERIC Educational Resources Information Center
Johnson, Nickey Owen
2013-01-01
The purpose of this study was to explore problem solving with kindergarten students. This line of inquiry is highly significant given that Common Core State Standards emphasize deep, conceptual understanding in mathematics as well as problem solving in kindergarten. However, there is little research on problem solving with kindergarten students.…
The Important Thing about Teaching Problem Solving
ERIC Educational Resources Information Center
Roberts, Sally K.
2010-01-01
The author teaches a content course in problem solving for middle school teachers. During the course, teacher candidates have the opportunity to confront their insecurities as they actively engage in solving math problems using a variety of strategies. As the semester progresses, they add new strategies to their problem-solving arsenal and…
Developing Creativity through Collaborative Problem Solving
ERIC Educational Resources Information Center
Albert, Lillie R.; Kim, Rina
2013-01-01
This paper discusses an alternative approach for developing problem solving experiences for students. The major argument is that students can develop their creativity by engaging in collaborative problem solving activities in which they apply a variety of mathematical methods creatively to solve problems. The argument is supported by: considering…
A Component Analysis of Mathematical Problem Solving.
ERIC Educational Resources Information Center
Schwieger, Ruben Don
The purpose of this study was the construction of a theoretical model for analyzing mathematical problem solving. A list of general problem-solving abilities was generated through a literature search. This list was narrowed to eight basic abilities pertinent to mathematics problem solving. Each of these was operationally defined and exemplified in…
Strategies for Problem Solving. Revised Edition.
ERIC Educational Resources Information Center
Karmos, Joseph S.; Karmos, Ann H.
This manual provides a comprehensive approach to problem solving; it is written in narrative style with numerous examples. The guide is organized in eight sections that cover the following topics: (1) problem-solving overview (with suggested readings and recommendations for schools); (2) a five-step model for solving problems; (3) strategies for…
Perspectives on Problem Solving and Instruction
ERIC Educational Resources Information Center
van Merrienboer, Jeroen J. G.
2013-01-01
Most educators claim that problem solving is important, but they take very different perspective on it and there is little agreement on how it should be taught. This article aims to sort out the different perspectives and discusses problem solving as a goal, a method, and a skill. As a goal, problem solving should not be limited to well-structured…
Fibonacci's Triangle: A Vehicle for Problem Solving.
ERIC Educational Resources Information Center
Ouellette, Hugh
1979-01-01
A method for solving certain types of problems is illustrated by problems related to Fibonacci's triangle. The method involves pattern recognition, generalizing, algebraic manipulation, and mathematical induction. (MP)
ERIC Educational Resources Information Center
Bilgin, Ibrahim
2006-01-01
The purpose of this study was to investigate the effects of pair problem solving technique incorporating Polya's problem solving strategy on undergraduate students' performance in conceptual and algorithmic questions in chemistry. The subjects of this study were 89 students enrolled from two first year chemistry classes. The experimental group was…
Solving optimization problems on computational grids.
Wright, S. J.; Mathematics and Computer Science
2001-05-01
Multiprocessor computing platforms, which have become more and more widely available since the mid-1980s, are now heavily used by organizations that need to solve very demanding computational problems. Parallel computing is now central to the culture of many research communities. Novel parallel approaches were developed for global optimization, network optimization, and direct-search methods for nonlinear optimization. Activity was particularly widespread in parallel branch-and-bound approaches for various problems in combinatorial and network optimization. As the cost of personal computers and low-end workstations has continued to fall, while the speed and capacity of processors and networks have increased dramatically, 'cluster' platforms have become popular in many settings. A somewhat different type of parallel computing platform know as a computational grid (alternatively, metacomputer) has arisen in comparatively recent times. Broadly speaking, this term refers not to a multiprocessor with identical processing nodes but rather to a heterogeneous collection of devices that are widely distributed, possibly around the globe. The advantage of such platforms is obvious: they have the potential to deliver enormous computing power. Just as obviously, however, the complexity of grids makes them very difficult to use. The Condor team, headed by Miron Livny at the University of Wisconsin, were among the pioneers in providing infrastructure for grid computations. More recently, the Globus project has developed technologies to support computations on geographically distributed platforms consisting of high-end computers, storage and visualization devices, and other scientific instruments. In 1997, we started the metaneos project as a collaborative effort between optimization specialists and the Condor and Globus groups. Our aim was to address complex, difficult optimization problems in several areas, designing and implementing the algorithms and the software
Stabilization: A Descriptive Framework for Problem Solving
NASA Astrophysics Data System (ADS)
Savrda, Sherry L.
2006-12-01
An alternative description of problem solving was tested against the think-aloud protocols of twelve introductory calculus-based physics students. Think-aloud protocols are transcripts of problem-solving sessions during which participants are asked to verbalize their thoughts as they attempt to solve a problem. The stabilization model tested considers perceptions of problem difficulty to be related to four primary factors: categorization, goal interpretation, resource relevance, and complexity. A fifth superordinate factor, stabilization, considers the shifting relationships between the four primary factors over the problem-solving process. Problem solving is then described in terms of a search for a stable relationship among the four primary factors. Results from the study to be presented suggest that with further refinement, the stabilization model could be an effective alternative model of problem solving. Results related to the observed problem-solving processes undertaken by the participants will also be presented.
Assessing Cognitive Learning of Analytical Problem Solving
NASA Astrophysics Data System (ADS)
Billionniere, Elodie V.
Introductory programming courses, also known as CS1, have a specific set of expected outcomes related to the learning of the most basic and essential computational concepts in computer science (CS). However, two of the most often heard complaints in such courses are that (1) they are divorced from the reality of application and (2) they make the learning of the basic concepts tedious. The concepts introduced in CS1 courses are highly abstract and not easily comprehensible. In general, the difficulty is intrinsic to the field of computing, often described as "too mathematical or too abstract." This dissertation presents a small-scale mixed method study conducted during the fall 2009 semester of CS1 courses at Arizona State University. This study explored and assessed students' comprehension of three core computational concepts---abstraction, arrays of objects, and inheritance---in both algorithm design and problem solving. Through this investigation students' profiles were categorized based on their scores and based on their mistakes categorized into instances of five computational thinking concepts: abstraction, algorithm, scalability, linguistics, and reasoning. It was shown that even though the notion of computational thinking is not explicit in the curriculum, participants possessed and/or developed this skill through the learning and application of the CS1 core concepts. Furthermore, problem-solving experiences had a direct impact on participants' knowledge skills, explanation skills, and confidence. Implications for teaching CS1 and for future research are also considered.
Problem solving using soft systems methodology.
Land, L
This article outlines a method of problem solving which considers holistic solutions to complex problems. Soft systems methodology allows people involved in the problem situation to have control over the decision-making process.
Thinking Process of Naive Problem Solvers to Solve Mathematical Problems
ERIC Educational Resources Information Center
Mairing, Jackson Pasini
2017-01-01
Solving problems is not only a goal of mathematical learning. Students acquire ways of thinking, habits of persistence and curiosity, and confidence in unfamiliar situations by learning to solve problems. In fact, there were students who had difficulty in solving problems. The students were naive problem solvers. This research aimed to describe…
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.
Understanding Undergraduates’ Problem-Solving Processes †
Nehm, Ross H.
2010-01-01
Fostering effective problem-solving skills is one of the most longstanding and widely agreed upon goals of biology education. Nevertheless, undergraduate biology educators have yet to leverage many major findings about problem-solving processes from the educational and cognitive science research literatures. This article highlights key facets of problem-solving processes and introduces methodologies that may be used to reveal how undergraduate students perceive and represent biological problems. Overall, successful problem-solving entails a keen sensitivity to problem contexts, disciplined internal representation or modeling of the problem, and the principled management and deployment of cognitive resources. Context recognition tasks, problem representation practice, and cognitive resource management receive remarkably little emphasis in the biology curriculum, despite their central roles in problem-solving success. PMID:23653710
The Problem Life Solves (Invited)
NASA Astrophysics Data System (ADS)
Shock, E.
2013-12-01
After forming, planets start the long process of dissipating energy into space. Early on, accretionary processes provide sufficient kinetic energy to raise temperatures enough to drive chemical systems rapidly toward equilibrium, maximizing the release of chemical energy. Eventually heat is dissipated, temperatures drop, and outer portions of planets cool enough to slow the rates of chemical reactions. As reaction rates slow to the scale of geologic time, chemical energy becomes trapped in assemblages of planetary materials far from equilibrium. Numerous examples are provided by chondritic meteorites, which show that activation energy barriers allow chemical energy to remain trapped for most of the age of the solar system even if heat dissipation is efficient -- and perhaps as a direct consequence. Activation energies that inhibit favorable reactions can be overcome by catalysis, which permits chemical systems to attain lower energy states. Catalysis in planets serves to continue the release of energy into space begun by heat dissipation. This implies that there is an overall thermodynamic drive for catalysis to appear as planets cool. Reasons why catalysis emerges in some cases and not others may depend on interactions of cooling rates and compositions but the specifics are murky at present. Life is a particularly efficient catalyst, and its emergence on a planet helps solve the problem generated by the catastrophic decrease in reaction rates during cooling. The single example we have of life on Earth got its start catalyzing oxidation-reduction reactions arranged in states far from equilibrium by geologic processes. On the pre-photosynthetic Earth the boldest biosignatures were redox processes occurring at rates that could only be explained by catalysis, and specifically by catalytic processes that have no abiotic mechanism. Biologically enhanced rates of redox reactions persist to the present, and maintain the biogeochemical cycles that permit the photosynthetic
New Perspectives on Human Problem Solving
ERIC Educational Resources Information Center
Goldstone, Robert L.; Pizlo, Zygmunt
2009-01-01
In November 2008 at Purdue University, the 2nd Workshop on Human Problem Solving was held. This workshop, which was a natural continuation of the first workshop devoted almost exclusively to optimization problems, addressed a wider range of topics that reflect the scope of the "Journal of Problem Solving." The workshop was attended by 35…
Computer Games Teach Problem-Solving.
ERIC Educational Resources Information Center
Clayson, James
1982-01-01
The difficulty many students have in solving complex problems stems not from a lack of mathematical skill but from an inability to visualize the problem. An appropriately-structured computer game may assist students in achieving this visualization and in solving problems better. A heuristic approach in programing one game is provided. (Author/JN)
Distributed problem solving by pilots and dispatchers
NASA Technical Reports Server (NTRS)
Orasanu, Judith; Wich, Mike; Fischer, Ute; Jobe, Kim; Mccoy, Elaine; Beatty, Roger; Smith, Phil
1993-01-01
The study addressed the following question: Are flight planning problems solved differently by PILOTS and DISPATCHERS when they work alone versus when they work together? Aspect of their performance that were of interest include the following: Problem perception and definition; Problem solving strategies and information use; Options considered; Solution and rational; and errors.
Learning to Solve Problems in Primary Grades
ERIC Educational Resources Information Center
Whitin, Phyllis; Whitin, David J.
2008-01-01
Problem solving lies at the heart of mathematical learning. Children need opportunities to write, discuss, and solve problems on a regular basis. The problems must incorporate grade-appropriate content and be "accessible and engaging to the students, building on what they know and can do." Teachers also play a key role in establishing a classroom…
Strengthening Programs through Problem Solving.
ERIC Educational Resources Information Center
Dyer, Jim
1993-01-01
Describes a secondary agricultural education program that was a dumping ground for academically disadvantaged students. Discusses how such a program can be improved by identifying problems and symptoms, treating problems, and goal setting. (JOW)
Common Core: Solve Math Problems
ERIC Educational Resources Information Center
Strom, Erich
2012-01-01
The new common core standards for mathematics demand that students (and teachers!) exhibit deeper conceptual understanding. That's music to the ears of education professor John Tapper, who says teachers have overemphasized teaching procedures--and getting right answers. In his new book, "Solving for Why," he makes a powerful case for moving beyond…
Problem-Solving Test: Pyrosequencing
ERIC Educational Resources Information Center
Szeberenyi, Jozsef
2013-01-01
Terms to be familiar with before you start to solve the test: Maxam-Gilbert sequencing, Sanger sequencing, gel electrophoresis, DNA synthesis reaction, polymerase chain reaction, template, primer, DNA polymerase, deoxyribonucleoside triphosphates, orthophosphate, pyrophosphate, nucleoside monophosphates, luminescence, acid anhydride bond,…
Secondary School Genetics Instruction: Making Problem Solving Explicit and Meaningful.
ERIC Educational Resources Information Center
Thomson, Norman; Stewart, James
1985-01-01
Explains an algorithm which details procedures for solving a broad class of genetics problems common to pre-college biology. Several flow charts (developed from the algorithm) are given with sample questions and suggestions for student use. Conclusions are based on the authors' research (which includes student interviews and textbook analyses).…
Mobile serious games for collaborative problem solving.
Sanchez, Jaime; Mendoza, Claudia; Salinas, Alvaro
2009-01-01
This paper presents the results obtained from the implementation of a series of learning activities based on mobile serious games (MSG) for the development of problem-solving and collaborative skills in Chilean 8th grade students. Three MSGs were developed and played by teams of four students, who had to solve the problems posed by the game collaboratively. The data shows that the experimental group had a higher perception of their own skills of collaboration and of the plan execution dimension of problem solving than the control group, providing empirical evidence regarding the contribution of MSGs to the development of collaborative problem-solving skills.
Disciplinary Foundations for Solving Interdisciplinary Scientific Problems
NASA Astrophysics Data System (ADS)
Zhang, Dongmei; Shen, Ji
2015-10-01
Problem-solving has been one of the major strands in science education research. But much of the problem-solving research has been conducted on discipline-based contexts; little research has been done on how students, especially individuals, solve interdisciplinary problems. To understand how individuals reason about interdisciplinary problems, we conducted an interview study with 16 graduate students coming from a variety of disciplinary backgrounds. During the interviews, we asked participants to solve two interdisciplinary science problems on the topic of osmosis. We investigated participants' problem reasoning processes and probed in their attitudes toward general interdisciplinary approach and specific interdisciplinary problems. Through a careful inductive content analysis of their responses, we studied how disciplinary, cognitive, and affective factors influenced their interdisciplinary problems-solving. We found that participants' prior discipline-based science learning experiences had both positive and negative influences on their interdisciplinary problem-solving. These influences were embodied in their conceptualization of the interdisciplinary problems, the strategies they used to integrate different disciplinary knowledge, and the attitudes they had toward interdisciplinary approach in general and specific interdisciplinary problems. This study sheds light on interdisciplinary science education by revealing the complex relationship between disciplinary learning and interdisciplinary problem-solving.
Applying Cooperative Techniques in Teaching Problem Solving
ERIC Educational Resources Information Center
Barczi, Krisztina
2013-01-01
Teaching how to solve problems--from solving simple equations to solving difficult competition tasks--has been one of the greatest challenges for mathematics education for many years. Trying to find an effective method is an important educational task. Among others, the question arises as to whether a method in which students help each other might…
Problem Solving & Comprehension. Fourth Edition.
ERIC Educational Resources Information Center
Whimbey, Arthur; Lochhead, Jack
This book shows how to increase one's power to analyze and comprehend problems. First, it outlines and illustrates the methods that good problem solvers use in attacking complex ideas. Then it gives some practice in applying these methods to a variety of questions in comprehension and reasoning. Chapters include: (1) "Test Your Mind--See How…
Pen Pals: Practicing Problem Solving
ERIC Educational Resources Information Center
Lampe, Kristen A.; Uselmann, Linda
2008-01-01
This article describes a semester-long pen-pal project in which preservice teachers composed mathematical problems and the middle school students worked for solutions. The college students assessed the solution and the middle school students provided feedback regarding the problem itself. (Contains 6 figures.)
Do TEFL Articles Solve Problems?
ERIC Educational Resources Information Center
Edge, Julian
1985-01-01
Discusses the problem which English-as-a-foreign-language (EFL) teacher trainees who are nonnative English speakers have in reading articles about EFL teaching methods. As a solution to this problem, the author produced a worksheet for the students to fill in while reading the articles which followed Hoey's…
Trigonometric problem cases well solved
NASA Astrophysics Data System (ADS)
Schröer, H.
2001-10-01
Content of the book are trigonometric problems that can be found scarely in the technical literature. It begins with using trigonometric functions to horizon and height. Interesting pure mathematical problems about tangent, inscribed tetragon and parallelogram follow. In chapter 6 is a generalization of Euclid's theorem fo the right-angled triangle. The next themes are exterior circle and incircle. In chapter 9 an unusual proof of the cosine law for sides is given. Further treated problems are the distance of two stars and eclipses. The aim group consists of mathematicians, natural scientists and technicians(also teacher) who have to do professionally with trigonometric problems and (or)who are interested in trigonometric problems. There is an english and a german edition.
Problem Posing and Solving with Mathematical Modeling
ERIC Educational Resources Information Center
English, Lyn D.; Fox, Jillian L.; Watters, James J.
2005-01-01
Mathematical modeling is explored as both problem posing and problem solving from two perspectives, that of the child and the teacher. Mathematical modeling provides rich learning experiences for elementary school children and their teachers.
Indoor Air Quality Problem Solving Tool
Use the IAQ Problem Solving Tool to learn about the connection between health complaints and common solutions in schools. This resource provides an easy, step-by-step process to start identifying and resolving IAQ problems found at your school.
Problem Solving, Patterns, Probability, Pascal, and Palindromes.
ERIC Educational Resources Information Center
Hylton-Lindsay, Althea Antoinette
2003-01-01
Presents a problem-solving activity, the birth order problem, and several solution-seeking strategies. Includes responses of current and prospective teachers and a comparison of various strategies. (YDS)
Combining Computational and Social Effort for Collaborative Problem Solving.
Wagy, Mark D; Bongard, Josh C
2015-01-01
Rather than replacing human labor, there is growing evidence that networked computers create opportunities for collaborations of people and algorithms to solve problems beyond either of them. In this study, we demonstrate the conditions under which such synergy can arise. We show that, for a design task, three elements are sufficient: humans apply intuitions to the problem, algorithms automatically determine and report back on the quality of designs, and humans observe and innovate on others' designs to focus creative and computational effort on good designs. This study suggests how such collaborations should be composed for other domains, as well as how social and computational dynamics mutually influence one another during collaborative problem solving.
ERIC Educational Resources Information Center
Aljaberi, Nahil M.; Gheith, Eman
2016-01-01
This study aims to investigate the ability of pre-service class teacher at University of Petrain solving mathematical problems using Polya's Techniques, their level of problem solving skills in daily-life issues. The study also investigates the correlation between their ability to solve mathematical problems and their level of problem solving…
NASA Astrophysics Data System (ADS)
Easton, Don
1999-03-01
This note is a description of a student solution to a problem. I found the solution exciting because it exemplifies the kind of solution by analogy that Feynman describes in The Feynman Lectures on Physics.
Dynamic Problem Solving: A New Assessment Perspective
ERIC Educational Resources Information Center
Greiff, Samuel; Wustenberg, Sascha; Funke, Joachim
2012-01-01
This article addresses two unsolved measurement issues in dynamic problem solving (DPS) research: (a) unsystematic construction of DPS tests making a comparison of results obtained in different studies difficult and (b) use of time-intensive single tasks leading to severe reliability problems. To solve these issues, the MicroDYN approach is…
Metacognition: Student Reflections on Problem Solving
ERIC Educational Resources Information Center
Wismath, Shelly; Orr, Doug; Good, Brandon
2014-01-01
Twenty-first century teaching and learning focus on the fundamental skills of critical thinking and problem solving, creativity and innovation, and collaboration and communication. Metacognition is a crucial aspect of both problem solving and critical thinking, but it is often difficult to get students to engage in authentic metacognitive…
Solving Problems in Genetics II: Conceptual Restructuring
ERIC Educational Resources Information Center
Orcajo, Teresa Ibanez; Aznar, Mercedes Martinez
2005-01-01
This paper presents the results of part of an investigation carried out with fourth-level Spanish secondary education students (15 years old), in which we implemented a teaching unit based on problem-solving methodology as an investigation to teach genetics and human inheritance curricular contents. By solving open problems, the students…
Problem Solving Software for Math Classes.
ERIC Educational Resources Information Center
Troutner, Joanne
1987-01-01
Described are 10 computer software programs for problem solving related to mathematics. Programs described are: (1) Box Solves Story Problems; (2) Safari Search; (3) Puzzle Tanks; (4) The King's Rule; (5) The Factory; (6) The Royal Rules; (7) The Enchanted Forest; (8) Gears; (9) The Super Factory; and (10) Creativity Unlimited. (RH)
The Functions of Pictures in Problem Solving
ERIC Educational Resources Information Center
Elia, Iliada; Philippou, George
2004-01-01
In the present study, we assert that pictures serve four functions in problem solving: decorative, representational, organizational and informational. We, therefore, investigate the effects of pictures based on their functions in mathematical problem solving (MPS), by high achievement students of Grade 6 in Cyprus, in a communication setting. A…
The Process of Solving Complex Problems
ERIC Educational Resources Information Center
Fischer, Andreas; Greiff, Samuel; Funke, Joachim
2012-01-01
This article is about Complex Problem Solving (CPS), its history in a variety of research domains (e.g., human problem solving, expertise, decision making, and intelligence), a formal definition and a process theory of CPS applicable to the interdisciplinary field. CPS is portrayed as (a) knowledge acquisition and (b) knowledge application…
Interpersonal Problem Solving in Preschool Aged Children.
ERIC Educational Resources Information Center
Swanson, Arthur J.; Siegel, Lawrence J.
This study was designed as a partial replication and extension of the research on interpersonal problem solving in preschool children by Shure and Spivack. Fifteen well-adjusted and 14 impulsive children from Head Start Centers were administered the Preschool Interpersonal Problem Solving test (PIPS) under either incentive or no incentive…
Can Television Enhance Children's Mathematical Problem Solving?
ERIC Educational Resources Information Center
Fisch, Shalom M.; And Others
1994-01-01
A summative evaluation of "Square One TV," an educational mathematics series produced by the Children's Television Workshop, shows that children who regularly viewed the program showed significant improvement in solving unfamiliar, complex mathematical problems, and viewers showed improvement in their mathematical problem-solving ability…
Conceptual Problem Solving in High School Physics
ERIC Educational Resources Information Center
Docktor, Jennifer L.; Strand, Natalie E.; Mestre, José P.; Ross, Brian H.
2015-01-01
Problem solving is a critical element of learning physics. However, traditional instruction often emphasizes the quantitative aspects of problem solving such as equations and mathematical procedures rather than qualitative analysis for selecting appropriate concepts and principles. This study describes the development and evaluation of an…
Problem-Solving Rules for Genetics.
ERIC Educational Resources Information Center
Collins, Angelo
The categories and applications of strategic knowledge as these relate to problem solving in the area of transmission genetics are examined in this research study. The role of computer simulations in helping students acquire the strategic knowledge necessary to solve realistic transmission genetics problems was emphasized. The Genetics…
A Multivariate Model of Physics Problem Solving
ERIC Educational Resources Information Center
Taasoobshirazi, Gita; Farley, John
2013-01-01
A model of expertise in physics problem solving was tested on undergraduate science, physics, and engineering majors enrolled in an introductory-level physics course. Structural equation modeling was used to test hypothesized relationships among variables linked to expertise in physics problem solving including motivation, metacognitive planning,…
Problem Solving Interactions on Electronic Networks.
ERIC Educational Resources Information Center
Waugh, Michael; And Others
Arguing that electronic networking provides a medium which is qualitatively superior to the traditional classroom for conducting certain types of problem solving exercises, this paper details the Water Problem Solving Project, which was conducted on the InterCultural Learning Network in 1985 and 1986 with students from the United States, Mexico,…
Measuring Problem Solving Skills in "Portal 2"
ERIC Educational Resources Information Center
Shute, Valerie J.; Wang, Lubin
2013-01-01
This paper examines possible improvement to problem solving skills as a function of playing the video game "Portal 2." Stealth assessment is used in the game to evaluate students' problem solving abilities--specifically basic and flexible rule application. The stealth assessment measures will be validated against commonly accepted…
Student Modeling Based on Problem Solving Times
ERIC Educational Resources Information Center
Pelánek, Radek; Jarušek, Petr
2015-01-01
Student modeling in intelligent tutoring systems is mostly concerned with modeling correctness of students' answers. As interactive problem solving activities become increasingly common in educational systems, it is useful to focus also on timing information associated with problem solving. We argue that the focus on timing is natural for certain…
Problem Solving in the Middle Grades.
ERIC Educational Resources Information Center
Malloy, Carol E.; Guild, D. Bruce
2000-01-01
Describes the mathematics curriculum proposed by the Principles and Standards for School Mathematics (PSSM)in which students build new mathematical knowledge through problem-solving. Compares the role of PSSM problem solving with that in the 1989 curriculum standards. (YDS)
Creativity and Insight in Problem Solving
ERIC Educational Resources Information Center
Golnabi, Laura
2016-01-01
This paper analyzes the thought process involved in problem solving and its categorization as creative thinking as defined by psychologist R. Weisberg (2006). Additionally, the notion of insight, sometimes present in unconscious creative thinking and often leading to creative ideas, is discussed in the context of geometry problem solving. In…
Strategies for Solving Word Problems in Science.
ERIC Educational Resources Information Center
Garrigan, George A.
1997-01-01
Reviews the approaches presented in the Self-Paced Study of Strategies Useful for Solving Word Problems in the Physical and Biological Sciences that can be used by students to successfully solve word problems encountered in any entry-level science course. Describes the topics covered in five "study sessions" that allow the students to practice the…
Taking "From Scratch" out of Problem Solving
ERIC Educational Resources Information Center
Brown, Wayne
2007-01-01
Solving problems and creating processes and procedures from the ground up has long been part of the IT department's way of operating. IT staffs will continue to encounter new problems to solve and new technologies to be implemented. They also must involve their constituents in the creation of solutions. Nonetheless, for many issues they no longer…
Computer-Based Assessment of Problem Solving.
ERIC Educational Resources Information Center
Baker, E. L.; Mayer, R. E.
1999-01-01
Examines the components required to assess student problem solving in technology environments. Discusses the purposes of testing, provides an example demonstrating the difference between retention and transfer, defines and analyzes problem solving, and explores techniques and standards for measuring the quality of student understanding. Contains…
Could HPS Improve Problem-Solving?
ERIC Educational Resources Information Center
Coelho, Ricardo Lopes
2013-01-01
It is generally accepted nowadays that History and Philosophy of Science (HPS) is useful in understanding scientific concepts, theories and even some experiments. Problem-solving strategies are a significant topic, since students' careers depend on their skill to solve problems. These are the reasons for addressing the question of whether problem…
Mathematical Problem Solving through Sequential Process Analysis
ERIC Educational Resources Information Center
Codina, A.; Cañadas, M. C.; Castro, E.
2015-01-01
Introduction: The macroscopic perspective is one of the frameworks for research on problem solving in mathematics education. Coming from this perspective, our study addresses the stages of thought in mathematical problem solving, offering an innovative approach because we apply sequential relations and global interrelations between the different…
Teaching Problem-Solving. Informal Series/43.
ERIC Educational Resources Information Center
Ross, John A.; Maynes, Florence J.
This monograph is designed to provide practical classroom suggestions, including sample lesson plans, to show how teachers can improve the problem-solving competence of students at all educational and ability levels. The examples provided show that problem-solving instruction can be integrated with teaching the content of particular topics. While…
Teaching Problem Solving: An Instructional Design Strategy.
ERIC Educational Resources Information Center
Ross, John A.; Maynes, Florence J.
1983-01-01
Instructional design strategy for improving problem solving is presented. The strategy entails selecting an appropriate domain of problem-solving tasks, learning hierarchies, teaching methods and assembling of learning materials, and designing teacher training and evaluation. Obstacles to be overcome and directions for future research are…
Mathematical Problem Solving. Issues in Research.
ERIC Educational Resources Information Center
Lester, Frank K., Jr., Ed.; Garofalo, Joe, Ed.
This set of papers was originally developed for a conference on Issues and Directions in Mathematics Problem Solving Research held at Indiana University in May 1981. The purpose is to contribute to the clear formulation of the key issues in mathematical problem-solving research by presenting the ideas of actively involved researchers. An…
Shewchuk, R M; Johnson, M O; Elliott, T R
2000-07-01
Self-report measures of social problem solving abilities have yet to be associated with objective problem solving performance in any consistent manner. In the present study, we investigated the relation of social problem solving abilities--as measured by the Social Problem Solving Skills Inventory--Revised (SPSI-R [Maydeu-Olivares, A. & D'Zurilla, T. J. (1996). A factor analytic study of the Social Problem Solving Inventory: an integration of theory and data. Cognitive Therapy and Research, 20, 115-133])--to performance on a structured problem solving task. Unlike previous studies, we examined the relation of problem solving skills to performance curves observed in repeated trials, while controlling for affective reactions to each trial. Using hierarchical modeling techniques, a negative problem orientation was significantly predictive of performance and this effect was not mediated by negative affectivity. Results are discussed as they pertain to contemporary models of social problem solving.
Collection of solved problems in physics
NASA Astrophysics Data System (ADS)
Koupilová, ZdeÅka; Mandíková, Dana; Snětinová, Marie
2017-01-01
To solve physics problems is a key ability which students should reach during their physics education. Ten years ago we started to develop a Collection of fully solved problems. The structure of problems' solutions is specially designed to substitute tutor's help during lesson and encourage students to solve at least some parts of a problem independently. Nowadays the database contains about 770 fully solved problems in physics in Czech, more than 100 problems in Polish and more than 140 problems in English. Other problems are still being translated. Except for physics problems, the Collection has also a mathematical part, which contains more than 300 fully solved problems in mathematics. This paper follows the presentation of the Collection of solved problems from previous years and introduces a new interface of the Collection, its enhanced functionality, new topics, newly created interface for teachers, user feedback and plans for future development. The database is placed at the website of the Department of Physics Education, Faculty of Mathematics and Physics, Charles University in Prague, the links are: http://reseneulohy.cz/fyzika (Czech version); http://www.physicstasks.eu/ (English version).
Robot, computer problem solving system
NASA Technical Reports Server (NTRS)
Becker, J. D.; Merriam, E. W.
1973-01-01
The TENEX computer system, the ARPA network, and computer language design technology was applied to support the complex system programs. By combining the pragmatic and theoretical aspects of robot development, an approach is created which is grounded in realism, but which also has at its disposal the power that comes from looking at complex problems from an abstract analytical point of view.
Solving the wrong hierarchy problem
Blinov, Nikita; Hook, Anson
2016-06-29
Many theories require augmenting the Standard Model with additional scalar fields with large order one couplings. We present a new solution to the hierarchy problem for these scalar fields. We explore parity- and Z2-symmetric theories where the Standard Model Higgs potential has two vacua. The parity or Z2 copy of the Higgs lives in the minimum far from the origin while our Higgs occupies the minimum near the origin of the potential. This approach results in a theory with multiple light scalar fields but with only a single hierarchy problem, since the bare mass is tied to the Higgs massmore » by a discrete symmetry. The new scalar does not have a new hierarchy problem associated with it because its expectation value and mass are generated by dimensional transmutation of the scalar quartic coupling. The location of the second Higgs minimum is not a free parameter, but is rather a function of the matter content of the theory. As a result, these theories are extremely predictive. We develop this idea in the context of a solution to the strong CP problem. Lastly, we show this mechanism postdicts the top Yukawa to be within 1σ of the currently measured value and predicts scalar color octets with masses in the range 9-200 TeV.« less
Solving the wrong hierarchy problem
Blinov, Nikita; Hook, Anson
2016-06-29
Many theories require augmenting the Standard Model with additional scalar fields with large order one couplings. We present a new solution to the hierarchy problem for these scalar fields. We explore parity- and Z_{2}-symmetric theories where the Standard Model Higgs potential has two vacua. The parity or Z_{2} copy of the Higgs lives in the minimum far from the origin while our Higgs occupies the minimum near the origin of the potential. This approach results in a theory with multiple light scalar fields but with only a single hierarchy problem, since the bare mass is tied to the Higgs mass by a discrete symmetry. The new scalar does not have a new hierarchy problem associated with it because its expectation value and mass are generated by dimensional transmutation of the scalar quartic coupling. The location of the second Higgs minimum is not a free parameter, but is rather a function of the matter content of the theory. As a result, these theories are extremely predictive. We develop this idea in the context of a solution to the strong CP problem. Lastly, we show this mechanism postdicts the top Yukawa to be within 1σ of the currently measured value and predicts scalar color octets with masses in the range 9-200 TeV.
Causality in Solving Economic Problems
ERIC Educational Resources Information Center
Robinson, A. Emanuel; Sloman, Steven A.; Hagmayer, York; Hertzog, Christopher K.
2010-01-01
The role of causal beliefs in people's decisions when faced with economic problems was investigated. Two experiments are reported that vary the causal structure in prisoner's dilemma-like economic situations. We measured willingness to cooperate or defect and collected justifications and think-aloud protocols to examine the strategies that people…
Sour landfill gas problem solved
Nagl, G.; Cantrall, R.
1996-05-01
In Broward County, Fla., near Pompano Beach, Waste Management of North America (WMNA, a subsidiary of WMX Technologies, Oak Brook, IL) operates the Central Sanitary Landfill and Recycling Center, which includes the country`s largest landfill gas-to-energy plant. The landfill consists of three collection sites: one site is closed, one is currently receiving garbage, and one will open in the future. Approximately 9 million standard cubic feet (scf) per day of landfill gas is collected from approximately 300 wells spread over the 250-acre landfill. With a dramatic increase of sulfur-containing waste coming to a South Florida landfill following Hurricane Andrew, odors related to hydrogen sulfide became a serious problem. However, in a matter of weeks, an innovative desulfurization unit helped calm the landfill operator`s fears. These very high H{sub 2}S concentrations caused severe odor problems in the surrounding residential area, corrosion problems in the compressors, and sulfur dioxide (SO{sub 2}) emission problems in the exhaust gas from the turbine generators.
Solving the wrong hierarchy problem
NASA Astrophysics Data System (ADS)
Blinov, Nikita; Hook, Anson
2016-06-01
Many theories require augmenting the Standard Model with additional scalar fields with large order one couplings. We present a new solution to the hierarchy problem for these scalar fields. We explore parity- and Z_2 -symmetric theories where the Standard Model Higgs potential has two vacua. The parity or Z_2 copy of the Higgs lives in the minimum far from the origin while our Higgs occupies the minimum near the origin of the potential. This approach results in a theory with multiple light scalar fields but with only a single hierarchy problem, since the bare mass is tied to the Higgs mass by a discrete symmetry. The new scalar does not have a new hierarchy problem associated with it because its expectation value and mass are generated by dimensional transmutation of the scalar quartic coupling. The location of the second Higgs minimum is not a free parameter, but is rather a function of the matter content of the theory. As a result, these theories are extremely predictive. We develop this idea in the context of a solution to the strong CP problem. We show this mechanism postdicts the top Yukawa to be within 1 σ of the currently measured value and predicts scalar color octets with masses in the range 9-200 TeV.
Problem-Solving Analysis and Business Writing.
ERIC Educational Resources Information Center
Myrsiades, Linda Suny
Problem solving skills such as patterning facts, locating problems, separating problems and solutions, and presenting effective written products are essential to success in the business community. Facts can be patterned using a grid relating a problem's effect at the individual, group, situational, and organizational level. Such a grid tests each…
Averaging schemes for solving fixed point and variational inequality problems
Magnanti, T.L.; Perakis, G.
1994-12-31
In this talk we develop and study averaging schemes for solving fixed point and variational inequality problems. Typically, researchers have established convergence results for methods that solve these problems by establishing contractive estimates for the underlying algorithmic maps. In this talk we establish global convergence results using nonexpansive estimates. After first establishing convergence for a general iterative scheme for computing fixed points, we consider applications to projection and relaxation algorithms for solving variational inequality problems and to a generalized steepest descent method for solving systems of equations. As part of our development, we also establish a new interpretation of a norm condition typically used for establishing convergence of linearization schemes, by associating it with a strong-f-monotonicity condition. We conclude by applying these results to congested transportation networks.
Solving the Telomere Replication Problem
Maestroni, Laetitia; Matmati, Samah; Coulon, Stéphane
2017-01-01
Telomeres are complex nucleoprotein structures that protect the extremities of linear chromosomes. Telomere replication is a major challenge because many obstacles to the progression of the replication fork are concentrated at the ends of the chromosomes. This is known as the telomere replication problem. In this article, different and new aspects of telomere replication, that can threaten the integrity of telomeres, will be reviewed. In particular, we will focus on the functions of shelterin and the replisome for the preservation of telomere integrity. PMID:28146113
ERIC Educational Resources Information Center
Shure, Myrna B.
Designed for teachers of intermediate elementary grades to enable children to learn how to solve the problems they have with others, the underlying goal of the program is to help children develop problem-solving skills so that they learn how to think, not what to think. The interpersonal cognitive problem-solving (ICPS) program includes both…
ERIC Educational Resources Information Center
Kamis, Arnold; Khan, Beverly K.
2009-01-01
How do we model and improve technical problem solving, such as network subnetting? This paper reports an experimental study that tested several hypotheses derived from Kolb's experiential learning cycle and Huber's problem solving model. As subjects solved a network subnetting problem, they mapped their mental processes according to Huber's…
The Cyclic Nature of Problem Solving: An Emergent Multidimensional Problem-Solving Framework
ERIC Educational Resources Information Center
Carlson, Marilyn P.; Bloom, Irene
2005-01-01
This paper describes the problem-solving behaviors of 12 mathematicians as they completed four mathematical tasks. The emergent problem-solving framework draws on the large body of research, as grounded by and modified in response to our close observations of these mathematicians. The resulting "Multidimensional Problem-Solving Framework" has four…
Lesion mapping of social problem solving
Colom, Roberto; Paul, Erick J.; Chau, Aileen; Solomon, Jeffrey; Grafman, Jordan H.
2014-01-01
Accumulating neuroscience evidence indicates that human intelligence is supported by a distributed network of frontal and parietal regions that enable complex, goal-directed behaviour. However, the contributions of this network to social aspects of intellectual function remain to be well characterized. Here, we report a human lesion study (n = 144) that investigates the neural bases of social problem solving (measured by the Everyday Problem Solving Inventory) and examine the degree to which individual differences in performance are predicted by a broad spectrum of psychological variables, including psychometric intelligence (measured by the Wechsler Adult Intelligence Scale), emotional intelligence (measured by the Mayer, Salovey, Caruso Emotional Intelligence Test), and personality traits (measured by the Neuroticism-Extraversion-Openness Personality Inventory). Scores for each variable were obtained, followed by voxel-based lesion–symptom mapping. Stepwise regression analyses revealed that working memory, processing speed, and emotional intelligence predict individual differences in everyday problem solving. A targeted analysis of specific everyday problem solving domains (involving friends, home management, consumerism, work, information management, and family) revealed psychological variables that selectively contribute to each. Lesion mapping results indicated that social problem solving, psychometric intelligence, and emotional intelligence are supported by a shared network of frontal, temporal, and parietal regions, including white matter association tracts that bind these areas into a coordinated system. The results support an integrative framework for understanding social intelligence and make specific recommendations for the application of the Everyday Problem Solving Inventory to the study of social problem solving in health and disease. PMID:25070511
Lesion mapping of social problem solving.
Barbey, Aron K; Colom, Roberto; Paul, Erick J; Chau, Aileen; Solomon, Jeffrey; Grafman, Jordan H
2014-10-01
Accumulating neuroscience evidence indicates that human intelligence is supported by a distributed network of frontal and parietal regions that enable complex, goal-directed behaviour. However, the contributions of this network to social aspects of intellectual function remain to be well characterized. Here, we report a human lesion study (n = 144) that investigates the neural bases of social problem solving (measured by the Everyday Problem Solving Inventory) and examine the degree to which individual differences in performance are predicted by a broad spectrum of psychological variables, including psychometric intelligence (measured by the Wechsler Adult Intelligence Scale), emotional intelligence (measured by the Mayer, Salovey, Caruso Emotional Intelligence Test), and personality traits (measured by the Neuroticism-Extraversion-Openness Personality Inventory). Scores for each variable were obtained, followed by voxel-based lesion-symptom mapping. Stepwise regression analyses revealed that working memory, processing speed, and emotional intelligence predict individual differences in everyday problem solving. A targeted analysis of specific everyday problem solving domains (involving friends, home management, consumerism, work, information management, and family) revealed psychological variables that selectively contribute to each. Lesion mapping results indicated that social problem solving, psychometric intelligence, and emotional intelligence are supported by a shared network of frontal, temporal, and parietal regions, including white matter association tracts that bind these areas into a coordinated system. The results support an integrative framework for understanding social intelligence and make specific recommendations for the application of the Everyday Problem Solving Inventory to the study of social problem solving in health and disease.
The ideal science student and problem solving
NASA Astrophysics Data System (ADS)
Sullivan, Florence R.
2005-09-01
The purpose of this dissertation was to examine the relationship between students' social mental models of the ideal science student, science epistemological beliefs, problem solving strategies used, and problem solving ability in a robotics environment. Participants were twenty-six academically advanced eleven and twelve year old students attending the Center for Talented Youth summer camp. Survey data was collected from the students including demographic background, views of the ideal science student, and science epistemological beliefs. Students also solved a robotics challenge. This problem solving session was videotaped and students were asked to think aloud as they solved the problem. Two social mental models were identified, a traits-based social mental model and a robust social mental model. A significant association was found between social mental model group and strategy usage. The robust social mental model group is more likely to use domain specific strategies than the traits-based group. Additionally, the robust social mental model group achieved significantly higher scores on their final solution than the traits-based social mental model group. Science epistemological beliefs do not appear to be associated with students' social mental model of the ideal science student. While students with a puzzle-solver view of science were more likely to use domain specific strategies in the planning phase of the problem solving session, there was no significant difference in problem solving ability between this group and students who have a dynamic view of the nature of science knowledge. This difference in strategy usage and problem solving performance may be due to a difference in the students' views of learning and cognition. The robust social mental model group evidenced a situative view of learning and cognition. These students made excellent use of the tools available in the task environment. The traits-based social mental model group displayed an
Could HPS Improve Problem-Solving?
NASA Astrophysics Data System (ADS)
Coelho, Ricardo Lopes
2013-05-01
It is generally accepted nowadays that History and Philosophy of Science (HPS) is useful in understanding scientific concepts, theories and even some experiments. Problem-solving strategies are a significant topic, since students' careers depend on their skill to solve problems. These are the reasons for addressing the question of whether problem solving could be improved by means of HPS. Three typical problems in introductory courses of mechanics—the inclined plane, the simple pendulum and the Atwood machine—are taken as the object of the present study. The solving strategies of these problems in the eighteenth and nineteenth century constitute the historical component of the study. Its philosophical component stems from the foundations of mechanics research literature. The use of HPS leads us to see those problems in a different way. These different ways can be tested, for which experiments are proposed. The traditional solving strategies for the incline and pendulum problems are adequate for some situations but not in general. The recourse to apparent weights in the Atwood machine problem leads us to a new insight and a solving strategy for composed Atwood machines. Educational implications also concern the development of logical thinking by means of the variety of lines of thought provided by HPS.
NASA Astrophysics Data System (ADS)
Pei, Jun; Liu, Xinbao; Pardalos, Panos M.; Fan, Wenjuan; Wang, Ling; Yang, Shanlin
2016-03-01
Motivated by applications in manufacturing industry, we consider a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times. The objective is to minimise the makespan by making batching and sequencing decisions. The problem is formalised as a mixed integer programming model and proved to be strongly NP-hard. Some structural properties are presented for both the general case and a special case. Based on these properties, a lower bound is derived, and a novel two-phase heuristic (TP-H) is developed to solve the problem, which guarantees to obtain a worst case performance ratio of ?. Computational experiments with a set of different sizes of random instances are conducted to evaluate the proposed approach TP-H, which is superior to another two heuristics proposed in the literature. Furthermore, the experimental results indicate that TP-H can effectively and efficiently solve large-size problems in a reasonable time.
Unsupervised neural networks for solving Troesch's problem
NASA Astrophysics Data System (ADS)
Muhammad, Asif Zahoor Raja
2014-01-01
In this study, stochastic computational intelligence techniques are presented for the solution of Troesch's boundary value problem. The proposed stochastic solvers use the competency of a feed-forward artificial neural network for mathematical modeling of the problem in an unsupervised manner, whereas the learning of unknown parameters is made with local and global optimization methods as well as their combinations. Genetic algorithm (GA) and pattern search (PS) techniques are used as the global search methods and the interior point method (IPM) is used for an efficient local search. The combination of techniques like GA hybridized with IPM (GA-IPM) and PS hybridized with IPM (PS-IPM) are also applied to solve different forms of the equation. A comparison of the proposed results obtained from GA, PS, IPM, PS-IPM and GA-IPM has been made with the standard solutions including well known analytic techniques of the Adomian decomposition method, the variational iterational method and the homotopy perturbation method. The reliability and effectiveness of the proposed schemes, in term of accuracy and convergence, are evaluated from the results of statistical analysis based on sufficiently large independent runs.
Solving inversion problems with neural networks
NASA Technical Reports Server (NTRS)
Kamgar-Parsi, Behzad; Gualtieri, J. A.
1990-01-01
A class of inverse problems in remote sensing can be characterized by Q = F(x), where F is a nonlinear and noninvertible (or hard to invert) operator, and the objective is to infer the unknowns, x, from the observed quantities, Q. Since the number of observations is usually greater than the number of unknowns, these problems are formulated as optimization problems, which can be solved by a variety of techniques. The feasibility of neural networks for solving such problems is presently investigated. As an example, the problem of finding the atmospheric ozone profile from measured ultraviolet radiances is studied.
Problem Solving through an Optimization Problem in Geometry
ERIC Educational Resources Information Center
Poon, Kin Keung; Wong, Hang-Chi
2011-01-01
This article adapts the problem-solving model developed by Polya to investigate and give an innovative approach to discuss and solve an optimization problem in geometry: the Regiomontanus Problem and its application to football. Various mathematical tools, such as calculus, inequality and the properties of circles, are used to explore and reflect…
Collaborative Problem Solving in Shared Space
ERIC Educational Resources Information Center
Lin, Lin; Mills, Leila A.; Ifenthaler, Dirk
2015-01-01
The purpose of this study was to examine collaborative problem solving in a shared virtual space. The main question asked was: How will the performance and processes differ between collaborative problem solvers and independent problem solvers over time? A total of 104 university students (63 female and 41 male) participated in an experimental…
Solving Problems with the Percentage Bar
ERIC Educational Resources Information Center
van Galen, Frans; van Eerde, Dolly
2013-01-01
At the end of primary school all children more of less know what a percentage is, but yet they often struggle with percentage problems. This article describes a study in which students of 13 and 14 years old were given a written test with percentage problems and a week later were interviewed about the way they solved some of these problems. In a…
Purdue Elementary Problem-Solving Inventory.
ERIC Educational Resources Information Center
Purdue Univ., Lafayette, IN. Educational Research Center.
This inventory was designed to assess the general problem solving ability of disadvantaged elementary school children from various ethnic backgrounds and grade levels. Twelve tasks are included in the inventory: sensing the problem, identifying the problem, asking questions, guessing causes, clarification of goals, judging if more information is…
Towards Automated Training of Legal Problem Solving.
ERIC Educational Resources Information Center
Muntjewerff, Antoinette J.
An examination of Dutch research on legal case solving revealed that few law students get systematic instruction or testing in the technique of legal problem solving. The research being conducted at the Department of Computer Science and Law at the University of Amsterdam focuses on identifying the different functions in legal reasoning tasks in…
Conceptual problem solving in high school physics
NASA Astrophysics Data System (ADS)
Docktor, Jennifer L.; Strand, Natalie E.; Mestre, José P.; Ross, Brian H.
2015-12-01
Problem solving is a critical element of learning physics. However, traditional instruction often emphasizes the quantitative aspects of problem solving such as equations and mathematical procedures rather than qualitative analysis for selecting appropriate concepts and principles. This study describes the development and evaluation of an instructional approach called Conceptual Problem Solving (CPS) which guides students to identify principles, justify their use, and plan their solution in writing before solving a problem. The CPS approach was implemented by high school physics teachers at three schools for major theorems and conservation laws in mechanics and CPS-taught classes were compared to control classes taught using traditional problem solving methods. Information about the teachers' implementation of the approach was gathered from classroom observations and interviews, and the effectiveness of the approach was evaluated from a series of written assessments. Results indicated that teachers found CPS easy to integrate into their curricula, students engaged in classroom discussions and produced problem solutions of a higher quality than before, and students scored higher on conceptual and problem solving measures.
Problem Solving under Time-Constraints,
2014-09-26
to interruptions. Data from the simulation is compared to data from college students doing the same task. Keywords include: Thinking ; problem solving; dual tasks; computer simulation; production systems; arithmetic.
Organizational Structure and Complex Problem Solving
ERIC Educational Resources Information Center
Becker, Selwyn W.; Baloff, Nicholas
1969-01-01
The problem-solving efficiency of different organization structures is discussed in relation to task requirements and the appropriate organizational behavior, to group adaptation to a task over time, and to various group characteristics. (LN)
Physics: Quantum problems solved through games
NASA Astrophysics Data System (ADS)
Maniscalco, Sabrina
2016-04-01
Humans are better than computers at performing certain tasks because of their intuition and superior visual processing. Video games are now being used to channel these abilities to solve problems in quantum physics. See Letter p.210
Solving scheduling tournament problems using a new version of CLONALG
NASA Astrophysics Data System (ADS)
Pérez-Cáceres, Leslie; Riff, María Cristina
2015-01-01
The travelling tournament problem (TTP) is an important and well-known problem within the collective sports research community. The problem is NP-hard which makes difficult finding quality solution in short amount of time. Recently a new kind of TTP has been proposed 'The Relaxed Travelling Tournament Problem'. This version of the problem allows teams to have some days off during the tournament. In this paper, we propose an immune algorithm that is able to solve both problem versions. The algorithm uses moves which are based on the team home/away patterns. One of these moves has been specially designed for the relaxed travel tournament instances. We have tested the algorithm using well-known problem benchmarks and the results obtained are very encouraging.
Assessing Student Problem-Solving Success on Selected Topics in Introductory Chemistry.
ERIC Educational Resources Information Center
Mason, Diana
Incident identification graphs can be used to diagnose areas of difficulty in a subject's problem-solving schema at the episodic level. In this study, 22 subjects (2 experts and 20 novices) categorized into five problem-solving groups (expert, high algorithmic/high conceptual, low algorithmic/high conceptual, high algorithmic/low conceptual, and…
Engineering calculations for solving the orbital allotment problem
NASA Technical Reports Server (NTRS)
Reilly, C.; Walton, E. K.; Mount-Campbell, C.; Caldecott, R.; Aebker, E.; Mata, F.
1988-01-01
Four approaches for calculating downlink interferences for shaped-beam antennas are described. An investigation of alternative mixed-integer programming models for satellite synthesis is summarized. Plans for coordinating the various programs developed under this grant are outlined. Two procedures for ordering satellites to initialize the k-permutation algorithm are proposed. Results are presented for the k-permutation algorithms. Feasible solutions are found for 5 of the 6 problems considered. Finally, it is demonstrated that the k-permutation algorithm can be used to solve arc allotment problems.
Innovative problem solving by wild spotted hyenas.
Benson-Amram, Sarah; Holekamp, Kay E
2012-10-07
Innovative animals are those able to solve novel problems or invent novel solutions to existing problems. Despite the important ecological and evolutionary consequences of innovation, we still know very little about the traits that vary among individuals within a species to make them more or less innovative. Here we examine innovative problem solving by spotted hyenas (Crocuta crocuta) in their natural habitat, and demonstrate for the first time in a non-human animal that those individuals exhibiting a greater diversity of initial exploratory behaviours are more successful problem solvers. Additionally, as in earlier work, we found that neophobia was a critical inhibitor of problem-solving success. Interestingly, although juveniles and adults were equally successful in solving the problem, juveniles were significantly more diverse in their initial exploratory behaviours, more persistent and less neophobic than were adults. We found no significant effects of social rank or sex on success, the diversity of initial exploratory behaviours, behavioural persistence or neophobia. Our results suggest that the diversity of initial exploratory behaviours, akin to some measures of human creativity, is an important, but largely overlooked, determinant of problem-solving success in non-human animals.
Chemical reaction optimization for solving shortest common supersequence problem.
Khaled Saifullah, C M; Rafiqul Islam, Md
2016-10-01
Shortest common supersequence (SCS) is a classical NP-hard problem, where a string to be constructed that is the supersequence of a given string set. The SCS problem has an enormous application of data compression, query optimization in the database and different bioinformatics activities. Due to NP-hardness, the exact algorithms fail to compute SCS for larger instances. Many heuristics and meta-heuristics approaches were proposed to solve this problem. In this paper, we propose a meta-heuristics approach based on chemical reaction optimization, CRO_SCS that is designed inspired by the nature of the chemical reactions. For different optimization problems like 0-1 knapsack, quadratic assignment, global numeric optimization problems CRO algorithm shows very good performance. We have redesigned the reaction operators and a new reform function to solve the SCS problem. The outcomes of the proposed CRO_SCS algorithm are compared with those of the enhanced beam search (IBS_SCS), deposition and reduction (DR), ant colony optimization (ACO) and artificial bee colony (ABC) algorithms. The length of supersequence, execution time and standard deviation of all related algorithms show that CRO_SCS gives better results on the average than all other algorithms.
NASA Astrophysics Data System (ADS)
Adams, Wendy Kristine
The purpose of my research was to produce a problem solving evaluation tool for physics. To do this it was necessary to gain a thorough understanding of how students solve problems. Although physics educators highly value problem solving and have put extensive effort into understanding successful problem solving, there is currently no efficient way to evaluate problem solving skill. Attempts have been made in the past; however, knowledge of the principles required to solve the subject problem are so absolutely critical that they completely overshadow any other skills students may use when solving a problem. The work presented here is unique because the evaluation tool removes the requirement that the student already have a grasp of physics concepts. It is also unique because I picked a wide range of people and picked a wide range of tasks for evaluation. This is an important design feature that helps make things emerge more clearly. This dissertation includes an extensive literature review of problem solving in physics, math, education and cognitive science as well as descriptions of studies involving student use of interactive computer simulations, the design and validation of a beliefs about physics survey and finally the design of the problem solving evaluation tool. I have successfully developed and validated a problem solving evaluation tool that identifies 44 separate assets (skills) necessary for solving problems. Rigorous validation studies, including work with an independent interviewer, show these assets identified by this content-free evaluation tool are the same assets that students use to solve problems in mechanics and quantum mechanics. Understanding this set of component assets will help teachers and researchers address problem solving within the classroom.
Collaborative Everyday Problem Solving: Interpersonal Relationships and Problem Dimensions
ERIC Educational Resources Information Center
Strough, Jonell; Patrick, Julie Hicks; Swenson, Lisa M.; Cheng, Suling; Barnes, Kristi A.
2003-01-01
Older adults' preferred partners for collaborative everyday problem solving and the types of everyday problems solved alone and with others were examined in a sample of community dwelling older adults (N = 112, M age = 71.86 yrs., SD = 5.92 yrs.). Family members (i.e., spouses, adult children) were the most frequently nominated partners for…
Numerical methods for solving terminal optimal control problems
NASA Astrophysics Data System (ADS)
Gornov, A. Yu.; Tyatyushkin, A. I.; Finkelstein, E. A.
2016-02-01
Numerical methods for solving optimal control problems with equality constraints at the right end of the trajectory are discussed. Algorithms for optimal control search are proposed that are based on the multimethod technique for finding an approximate solution of prescribed accuracy that satisfies terminal conditions. High accuracy is achieved by applying a second-order method analogous to Newton's method or Bellman's quasilinearization method. In the solution of problems with direct control constraints, the variation of the control is computed using a finite-dimensional approximation of an auxiliary problem, which is solved by applying linear programming methods.
Prospective Elementary Teachers' Misunderstandings in Solving Ratio and Proportion Problems
ERIC Educational Resources Information Center
Monteiro, Cecilia
2003-01-01
This study explores difficulties that prospective elementary mathematics teachers have with the concepts of ratio and proportion, mainly when they are engaged in solving problems using algorithm procedures. These difficulties can be traced back to earlier experiences when they were students of junior and high school. The reflection on these…
Using CAS to Solve Classical Mathematics Problems
ERIC Educational Resources Information Center
Burke, Maurice J.; Burroughs, Elizabeth A.
2009-01-01
Historically, calculus has displaced many algebraic methods for solving classical problems. This article illustrates an algebraic method for finding the zeros of polynomial functions that is closely related to Newton's method (devised in 1669, published in 1711), which is encountered in calculus. By exploring this problem, precalculus students…
Complex Problem Solving in a Workplace Setting.
ERIC Educational Resources Information Center
Middleton, Howard
2002-01-01
Studied complex problem solving in the hospitality industry through interviews with six office staff members and managers. Findings show it is possible to construct a taxonomy of problem types and that the most common approach can be termed "trial and error." (SLD)
Using Bibliotherapy To Teach Problem Solving.
ERIC Educational Resources Information Center
Forgan, James W.
2002-01-01
This article discusses how students with high-incidence disabilities can benefit from using bibliotherapy by learning to become proactive problem solvers. A sample lesson plan is presented based on a teaching framework for bibliotherapy and problem solving that contains the elements of prereading, guided reading, post-reading discussion, and a…
Discovering Steiner Triple Systems through Problem Solving
ERIC Educational Resources Information Center
Sriraman, Bharath
2004-01-01
An attempt to implement problem solving as a teacher of ninth grade algebra is described. The problems selected were not general ones, they involved combinations and represented various situations and were more complex which lead to the discovery of Steiner triple systems.
Metaphor and analogy in everyday problem solving.
Keefer, Lucas A; Landau, Mark J
2016-11-01
Early accounts of problem solving focused on the ways people represent information directly related to target problems and possible solutions. Subsequent theory and research point to the role of peripheral influences such as heuristics and bodily states. We discuss how metaphor and analogy similarly influence stages of everyday problem solving: Both processes mentally map features of a target problem onto the structure of a relatively more familiar concept. When individuals apply this structure, they use a well-known concept as a framework for reasoning about real world problems and candidate solutions. Early studies found that analogy use helped people gain insight into novel problems. More recent research on metaphor goes further to show that activating mappings has subtle, sometimes surprising effects on judgment and reasoning in everyday problem solving. These findings highlight situations in which mappings can help or hinder efforts to solve problems. WIREs Cogn Sci 2016, 7:394-405. doi: 10.1002/wcs.1407 For further resources related to this article, please visit the WIREs website.
Reasoning by Analogy in Solving Comparison Problems.
ERIC Educational Resources Information Center
English, Lyn D.
1998-01-01
Investigates 10-year-old children's abilities to reason by analogy in solving addition and subtraction comparison problems involving unknown compare sets and unknown reference sets. Children responded in a consistent manner to the tasks involving the basic addition problems, indicating substantial relational knowledge of these but responded in an…
Reinventing the Wheel: Design and Problem Solving
ERIC Educational Resources Information Center
Blasetti, Sean M.
2010-01-01
This article describes a design problem that not only takes students through the technological design process, but it also provides them with real-world problem-solving experience as it relates to the manufacturing and engineering fields. It begins with a scenario placing the student as a custom wheel designer for an automotive manufacturing…
Teaching Teamwork and Problem Solving Concurrently
ERIC Educational Resources Information Center
Goltz, Sonia M.; Hietapelto, Amy B.; Reinsch, Roger W.; Tyrell, Sharon K.
2008-01-01
Teamwork and problem-solving skills have frequently been identified by business leaders as being key competencies; thus, teaching methods such as problem-based learning and team-based learning have been developed. However, the focus of these methods has been on teaching one skill or the other. A key argument for teaching the skills concurrently is…
Solving Math Word Problems: A Software Roundup.
ERIC Educational Resources Information Center
Eiser, Leslie
1988-01-01
Reviewed are 11 software packages for the Apple II computer designed to help teach elementary and secondary school children how to solve mathword problems. Included in the review are hardware requirements, price, grade level, use of graphics, kinds of problems, tools provided, strengths, and weaknesses of each program. (CW)
Solving Geometry Problems via Mechanical Principles
ERIC Educational Resources Information Center
Man, Yiu Kwong
2004-01-01
The application of physical principles in solving mathematics problems have often been neglected in the teaching of physics or mathematics, especially at the secondary school level. This paper discusses how to apply the mechanical principles to geometry problems via concrete examples, which aims at providing insight and inspirations to physics or…
Teacher Learning on Problem-Solving Teams
ERIC Educational Resources Information Center
Gregory, Anne
2010-01-01
Problem-solving teams address student difficulties. Teams comprised of teachers, specialists, and administrators identify the student problem, develop individualized interventions, and assess student change. Teacher experiences of teams are understudied. In a prospective, mixed-method study conducted in the United States, 34 teachers were followed…
Solving Problems of Practice in Education.
ERIC Educational Resources Information Center
Boyd, Robert D.; Menlo, Allen
1984-01-01
Discusses the many complexities involved in the translation of scientific information in the social sciences into forms usable for solving problems of practice in education. Prescribes a series of stages to be followed from the advent of a practitioner's situational problem to the design of a response to it. (Author/JN)
Pose and Solve Varignon Converse Problems
ERIC Educational Resources Information Center
Contreras, José N.
2014-01-01
The activity of posing and solving problems can enrich learners' mathematical experiences because it fosters a spirit of inquisitiveness, cultivates their mathematical curiosity, and deepens their views of what it means to do mathematics. To achieve these goals, a mathematical problem needs to be at the appropriate level of difficulty,…
Problem-Solving Exercises and Evolution Teaching
ERIC Educational Resources Information Center
Angseesing, J. P. A.
1978-01-01
It is suggested that the work of Kammerer provides suitable material, in the form of case studies on which to base discussions of Lamarckism versus Darwinism. A set of structured problems is described as an example of possible problem-solving exercises, and further experiments to extend Kammerer's work are outlined. (Author/MA)
Scientific Problem Solving by Expert Systems.
ERIC Educational Resources Information Center
Good, Ron
1984-01-01
Human expert problem-solving in science is defined and used to account for scientific discovery. These ideas are used to describe BACON.5, a machine expert problem solver that discovers scientific laws using data-driver heuristics and "expectations" such as symmetry. Implications of BACON.5 type research for traditional science education…
Using Programmable Calculators to Solve Electrostatics Problems.
ERIC Educational Resources Information Center
Yerian, Stephen C.; Denker, Dennis A.
1985-01-01
Provides a simple routine which allows first-year physics students to use programmable calculators to solve otherwise complex electrostatic problems. These problems involve finding electrostatic potential and electric field on the axis of a uniformly charged ring. Modest programing skills are required of students. (DH)
Problem solving and decisionmaking: An integration
NASA Technical Reports Server (NTRS)
Dieterly, D. L.
1980-01-01
An attempt was made to redress a critical fault of decisionmaking and problem solving research-a lack of a standard method to classify problem or decision states or conditions. A basic model was identified and expanded to indicate a possible taxonomy of conditions which may be used in reviewing previous research or for systematically pursuing new research designs. A generalization of the basic conditions was then made to indicate that the conditions are essentially the same for both concepts, problem solving and decisionmaking.
NASA Astrophysics Data System (ADS)
Katz, S. D.; Niedermayer, F.; Nógrádi, D.; Török, Cs.
2017-03-01
We study three possible ways to circumvent the sign problem in the O(3) nonlinear sigma model in 1 +1 dimensions. We compare the results of the worm algorithm to complex Langevin and multiparameter reweighting. Using the worm algorithm, the thermodynamics of the model is investigated, and continuum results are shown for the pressure at different μ /T values in the range 0-4. By performing T =0 simulations using the worm algorithm, the Silver Blaze phenomenon is reproduced. Regarding the complex Langevin, we test various implementations of discretizing the complex Langevin equation. We found that the exponentialized Euler discretization of the Langevin equation gives wrong results for the action and the density at low T /m . By performing a continuum extrapolation, we found that this discrepancy does not disappear and depends slightly on temperature. The discretization with spherical coordinates performs similarly at low μ /T but breaks down also at some higher temperatures at high μ /T . However, a third discretization that uses a constraining force to achieve the ϕ2=1 condition gives correct results for the action but wrong results for the density at low μ /T .
A Graph Based Backtracking Algorithm for Solving General CSPs
NASA Technical Reports Server (NTRS)
Pang, Wanlin; Goodwin, Scott D.
2003-01-01
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complete task in general, tractable classes of CSPs have been identified based on the structure of the underlying constraint graphs. Much effort has been spent on exploiting structural properties of the constraint graph to improve the efficiency of finding a solution. These efforts contributed to development of a class of CSP solving algorithms called decomposition algorithms. The strength of CSP decomposition is that its worst-case complexity depends on the structural properties of the constraint graph and is usually better than the worst-case complexity of search methods. Its practical application is limited, however, since it cannot be applied if the CSP is not decomposable. In this paper, we propose a graph based backtracking algorithm called omega-CDBT, which shares merits and overcomes the weaknesses of both decomposition and search approaches.
About decomposition approach for solving the classification problem
NASA Astrophysics Data System (ADS)
Andrianova, A. A.
2016-11-01
This article describes the features of the application of an algorithm with using of decomposition methods for solving the binary classification problem of constructing a linear classifier based on Support Vector Machine method. Application of decomposition reduces the volume of calculations, in particular, due to the emerging possibilities to build parallel versions of the algorithm, which is a very important advantage for the solution of problems with big data. The analysis of the results of computational experiments conducted using the decomposition approach. The experiment use known data set for binary classification problem.
2015-07-14
when solving a variety of hard numerical problems. Identification of the impact of team structure on problem solving behavior under changing conditions...of the algorithm also performed well as an optimization algorithm when solving a variety of hard numerical problems. Identification of the impact of...algorithm also performed well as an optimization algorithm when solving a variety of hard numerical problems. Identification of the impact of team structure
ERIC Educational Resources Information Center
Sukoriyanto; Nusantara, Toto; Subanji; Chandra, Tjang Daniel
2016-01-01
This article was written based on the results of a study evaluating students' errors in problem solving of permutation and combination in terms of problem solving steps according to Polya. Twenty-five students were asked to do four problems related to permutation and combination. The research results showed that the students still did a mistake in…
ERIC Educational Resources Information Center
Karatas, Ilhan; Baki, Adnan
2013-01-01
Problem solving is recognized as an important life skill involving a range of processes including analyzing, interpreting, reasoning, predicting, evaluating and reflecting. For that reason educating students as efficient problem solvers is an important role of mathematics education. Problem solving skill is the centre of mathematics curriculum.…
Encouraging Sixth-Grade Students' Problem-Solving Performance by Teaching through Problem Solving
ERIC Educational Resources Information Center
Bostic, Jonathan D.; Pape, Stephen J.; Jacobbe, Tim
2016-01-01
This teaching experiment provided students with continuous engagement in a problem-solving based instructional approach during one mathematics unit. Three sections of sixth-grade mathematics were sampled from a school in Florida, U.S.A. and one section was randomly assigned to experience teaching through problem solving. Students' problem-solving…
Enhancing chemistry problem-solving achievement using problem categorization
NASA Astrophysics Data System (ADS)
Bunce, Diane M.; Gabel, Dorothy L.; Samuel, John V.
The enhancement of chemistry students' skill in problem solving through problem categorization is the focus of this study. Twenty-four students in a freshman chemistry course for health professionals are taught how to solve problems using the explicit method of problem solving (EMPS) (Bunce & Heikkinen, 1986). The EMPS is an organized approach to problem analysis which includes encoding the information given in a problem (Given, Asked For), relating this to what is already in long-term memory (Recall), and planning a solution (Overall Plan) before a mathematical solution is attempted. In addition to the EMPS training, treatment students receive three 40-minute sessions following achievement tests in which they are taught how to categorize problems. Control students use this time to review the EMPS solutions of test questions. Although problem categorization is involved in one section of the EMPS (Recall), treatment students who received specific training in problem categorization demonstrate significantly higher achievement on combination problems (those problems requiring the use of more than one chemical topic for their solution) at (p = 0.01) than their counterparts. Significantly higher achievement for treatment students is also measured on an unannounced test (p = 0.02). Analysis of interview transcripts of both treatment and control students illustrates a Rolodex approach to problem solving employed by all students in this study. The Rolodex approach involves organizing equations used to solve problems on mental index cards and flipping through them, matching units given when a new problem is to be solved. A second phenomenon observed during student interviews is the absence of a link in the conceptual understanding of the chemical concepts involved in a problem and the problem-solving skills employed to correctly solve problems. This study shows that explicit training in categorization skills and the EMPS can lead to higher achievement in complex problem-solving
Why students still can't solve physics problems after solving over 2000 problems
NASA Astrophysics Data System (ADS)
Byun, Taejin; Lee, Gyoungho
2014-09-01
This study investigates the belief that solving a large number of physics problems helps students better learn physics. We investigated the number of problems solved, student confidence in solving these problems, academic achievement, and the level of conceptual understanding of 49 science high school students enrolled in upper-level physics classes from Spring 2010 to Summer 2011. The participants solved an average of 2200 physics problems before entering high school. Despite having solved so many problems, no statistically significant correlation was found between the number of problems solved and academic achievement on either a mid-term or physics competition examination. In addition, no significant correlation was found between the number of physics problems solved and performance on the Force Concept Inventory (FCI). Lastly, four students were selected from the 49 participants with varying levels of experience and FCI scores for a case study. We determined that their problem solving and learning strategies was more influential in their success than the number of problems they had solved.
Genetic algorithms for the vehicle routing problem
NASA Astrophysics Data System (ADS)
Volna, Eva
2016-06-01
The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks. This problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. Evolutionary algorithms are general iterative algorithms for combinatorial optimization. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. For such problems it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. In this paper we have performed an experimental study that indicates the suitable use of genetic algorithms for the vehicle routing problem.
Ant colony optimization for solving university facility layout problem
NASA Astrophysics Data System (ADS)
Mohd Jani, Nurul Hafiza; Mohd Radzi, Nor Haizan; Ngadiman, Mohd Salihin
2013-04-01
Quadratic Assignment Problems (QAP) is classified as the NP hard problem. It has been used to model a lot of problem in several areas such as operational research, combinatorial data analysis and also parallel and distributed computing, optimization problem such as graph portioning and Travel Salesman Problem (TSP). In the literature, researcher use exact algorithm, heuristics algorithm and metaheuristic approaches to solve QAP problem. QAP is largely applied in facility layout problem (FLP). In this paper we used QAP to model university facility layout problem. There are 8 facilities that need to be assigned to 8 locations. Hence we have modeled a QAP problem with n ≤ 10 and developed an Ant Colony Optimization (ACO) algorithm to solve the university facility layout problem. The objective is to assign n facilities to n locations such that the minimum product of flows and distances is obtained. Flow is the movement from one to another facility, whereas distance is the distance between one locations of a facility to other facilities locations. The objective of the QAP is to obtain minimum total walking (flow) of lecturers from one destination to another (distance).
Problem solving and chemical equilibrium: Successful versus unsuccessful performance
NASA Astrophysics Data System (ADS)
Camacho, Moises; Good, Ron
The purpose of this study was to describe the problem-solving behaviors of experts and novices engaged in solving seven chemical equilibrium problems. Thirteen novices (five high-school students, five undergraduate majors, and three nonmajors) and ten experts (six doctoral students and four faculty members) were videotaped as they individually solved standard chemical equilibrium problems. The nature of the problems was such that they required more than mere recall or algorithmic learning and yet simple enough to provide the novices a reasonable chance of solving them. Extensive analysis of the think-aloud protocols produced 27 behavioral tendencies that can be used to describe and differentiate between successful and unsuccessful problem solvers. Successful solvers' perceptions of the problem were characterized by careful analysis and reasoning of the task, use of related principles and concepts to justify their answers, frequent checks of the consistency of answers and reasons, and better quality of procedural and strategic knowledge. Unsuccessful subjects had many knowledge gaps and misconceptions about the nature of chemical equilibrium. Even faculty experts were sometimes unable to correctly apply common chemical principles during the problem-solving process. Important theoretical concepts such as molar enthalpy, heat of reaction, free energy of formation, and free energy of reaction were rarely used by novices in explaining problems.
Problem solving in a distributed environment
NASA Technical Reports Server (NTRS)
Rashid, R. F.
1980-01-01
Distributed problem solving is anayzed as a blend of two disciplines: (1) problem solving and ai; and (2) distributed systems (monitoring). It may be necessary to distribute because the application itself is one of managing distributed resources (e.g., distributed sensor net) and communication delays preclude centralized processing, or it may be desirable to distribute because a single computational engine may not satisfy the needs of a given task. In addition, considerations of reliability may dictate distribution. Examples of multi-process language environment are given.
Matvienko, G G; Oshlakov, V K; Sukhanov, A Ya; Stepanov, A N
2015-02-28
We consider the algorithms that implement a broadband ('multiwave') radiative transfer with allowance for multiple (aerosol) scattering and absorption by main atmospheric gases. In the spectral range of 0.6 – 1 μm, a closed numerical simulation of modifications of the supercontinuum component of a probing femtosecond pulse is performed. In the framework of the algorithms for solving the inverse atmospheric-optics problems with the help of a genetic algorithm, we give an interpretation of the experimental backscattered spectrum of the supercontinuum. An adequate reconstruction of the distribution mode for the particles of artificial aerosol with the narrow-modal distributions in a size range of 0.5 – 2 mm and a step of 0.5 mm is obtained. (light scattering)
Extending problem-solving procedures through reflection.
Anderson, John R; Fincham, Jon M
2014-11-01
A large-sample (n=75) fMRI study guided the development of a theory of how people extend their problem-solving procedures by reflecting on them. Both children and adults were trained on a new mathematical procedure and then were challenged with novel problems that required them to change and extend their procedure to solve these problems. The fMRI data were analyzed using a combination of hidden Markov models (HMMs) and multi-voxel pattern analysis (MVPA). This HMM-MVPA analysis revealed the existence of 4 stages: Encoding, Planning, Solving, and Responding. Using this analysis as a guide, an ACT-R model was developed that improved the performance of the HMM-MVPA and explained the variation in the durations of the stages across 128 different problems. The model assumes that participants can reflect on declarative representations of the steps of their problem-solving procedures. A Metacognitive module can hold these steps, modify them, create new declarative steps, and rehearse them. The Metacognitive module is associated with activity in the rostrolateral prefrontal cortex (RLPFC). The ACT-R model predicts the activity in the RLPFC and other regions associated with its other cognitive modules (e.g., vision, retrieval). Differences between children and adults seemed related to differences in background knowledge and computational fluency, but not to the differences in their capability to modify procedures.
Representations in Problem Solving: A Case Study with Optimization Problems
ERIC Educational Resources Information Center
Villegas, Jose L.; Castro, Enrique; Gutierrez, Jose
2009-01-01
Introduction: Representations play an essential role in mathematical thinking. They favor the understanding of mathematical concepts and stimulate the development of flexible and versatile thinking in problem solving. Here our focus is on their use in optimization problems, a type of problem considered important in mathematics teaching and…
Problem-Framing: A perspective on environmental problem-solving
NASA Astrophysics Data System (ADS)
Bardwell, Lisa V.
1991-09-01
The specter of environmental calamity calls for the best efforts of an involved public. Ironically, the way people understand the issues all too often serves to discourage and frustrate rather than motivate them to action. This article draws from problem-solving perspectives offered by cognitive psychology and conflict management to examine a framework for thinking about environmental problems that promises to help rather than hinder efforts to address them. Problem-framing emphasizes focusing on the problem definition. Since how one defines a problem determines one's understanding of and approach to that problem, being able to redefine or reframe a problem and to explore the “problem space” can help broaden the range of alternatives and solutions examined. Problem-framing incorporates a cognitive perspective on how people respond to information. It explains why an emphasis on problem definition is not part of people's typical approach to problems. It recognizes the importance of structure and of having ways to organize that information on one's problem-solving effort. Finally, problem-framing draws on both cognitive psychology and conflict management for strategies to manage information and to create a problem-solving environment that not only encourages participation but can yield better approaches to our environmental problems.
ERIC Educational Resources Information Center
Treffinger, Donald J.; Selby, Edwin C.; Isaksen, Scott G.
2008-01-01
More than five decades of research and development have focused on making the Creative Problem Solving process and tools accessible across a wide range of ages and contexts. Recent evidence indicates that when individuals, in both school and corporate settings, understand their own style of problem solving, they are able to learn and apply process…
I Can Problem Solve (ICPS): Interpersonal Cognitive Problem Solving for Young Children.
ERIC Educational Resources Information Center
Shure, Myrna B.
1993-01-01
Teachers of preschool and kindergarten children from low-income families used the I Can Problem Solve (ICPS) program to help the children learn to think through and solve typical interpersonal problems with peers and adults. Compared to nontrained controls, the children exhibited fewer instances of impulsive and inhibited behaviors as observed in…
ERIC Educational Resources Information Center
Shure, Myrna B.
Designed for teachers of kindergarten and the primary grades to enable children to learn how to solve the problems they have with others, the underlying goal of the program is to help children develop problem-solving skills so that they learn how to think, not what to think. The 89 lessons are adaptable for various levels of ability throughout the…
I Can Problem Solve: An Interpersonal Cognitive Problem-Solving Program. Preschool.
ERIC Educational Resources Information Center
Shure, Myrna B.
Designed for teachers of preschool to enable children to learn how to solve the problems they have with others, the underlying goal of the program is to help children develop problem-solving skills so that they learn how to think, not what to think. Originally developed for four-year-old children in a preschool setting, most three-year-old…
Preschoolers' Cooperative Problem Solving: Integrating Play and Problem Solving
ERIC Educational Resources Information Center
Ramani, Geetha B.; Brownell, Celia A.
2014-01-01
Cooperative problem solving with peers plays a central role in promoting children's cognitive and social development. This article reviews research on cooperative problem solving among preschool-age children in experimental settings and social play contexts. Studies suggest that cooperative interactions with peers in experimental settings are…
ERIC Educational Resources Information Center
Chamberlin, Scott A.; Powers, Robert A.
2013-01-01
The focus of the article is the validation of an instrument to assess gifted students' affect after mathematical problem solving tasks. Participants were 225 students identified by their district as gifted in grades four to six. The Chamberlin Affective Instrument for Mathematical Problem Solving was used to assess feelings, emotions, and…
Young Children's Drawings in Problem Solving
ERIC Educational Resources Information Center
Bakar, Kamariah Abu; Way, Jennifer; Bobis, Janette
2016-01-01
This paper explores young children's drawings (6 years old) in early number and addition activities in Malaysia. Observation, informal interviews and analysis of drawings revealed two types of drawing, and gave insight into the transitional process required for children to utilise drawings in problem solving. We argue the importance of valuing and…
Partial Metacognitive Blindness in Collaborative Problem Solving
ERIC Educational Resources Information Center
Ng, Kit Ee Dawn
2010-01-01
This paper investigates the impact of group dynamics on metacognitive behaviours of students (aged 13-14) during group collaborative problem solving attempts involving a design-based real-world applications project. It was discovered that group dynamics mediated the impact of metacognitive judgments related red flag situations and metacognitive…
Nanomedicine: Problem Solving to Treat Cancer
ERIC Educational Resources Information Center
Hemling, Melissa A.; Sammel, Lauren M.; Zenner, Greta; Payne, Amy C.; Crone, Wendy C.
2006-01-01
Many traditional classroom science and technology activities often ask students to complete prepackaged labs that ensure that everyone arrives at the same "scientifically accurate" solution or theory, which ignores the important problem-solving and creative aspects of scientific research and technological design. Students rarely have the…
Instruction Emphasizing Effort Improves Physics Problem Solving
ERIC Educational Resources Information Center
Li, Daoquan
2012-01-01
Effectively using strategies to solve complex problems is an important educational goal and is implicated in successful academic performance. However, people often do not spontaneously use the effective strategies unless they are motivated to do so. The present study was designed to test whether educating students about the importance of effort in…
How Instructional Designers Solve Workplace Problems
ERIC Educational Resources Information Center
Fortney, Kathleen S.; Yamagata-Lynch, Lisa C.
2013-01-01
This naturalistic inquiry investigated how instructional designers engage in complex and ambiguous problem solving across organizational boundaries in two corporations. Participants represented a range of instructional design experience, from novices to experts. Research methods included a participant background survey, observations of…
Complex Problem Solving--More than Reasoning?
ERIC Educational Resources Information Center
Wustenberg, Sascha; Greiff, Samuel; Funke, Joachim
2012-01-01
This study investigates the internal structure and construct validity of Complex Problem Solving (CPS), which is measured by a "Multiple-Item-Approach." It is tested, if (a) three facets of CPS--"rule identification" (adequateness of strategies), "rule knowledge" (generated knowledge) and "rule application"…
Conceptual Structures in Mathematical Problem Solving.
ERIC Educational Resources Information Center
Cifarelli, Victor
The processes by which conceptual knowledge is constructed during mathematical problem solving were studied, focusing on the cognitive activity of learners (i.e., the ways they elaborate, reorganize, and reconceptualize their solution activity). Underlying this research is the view that learners' mathematical conceptions evolve from their activity…
Implicit Theories about Everyday Problem Solving.
ERIC Educational Resources Information Center
Herbert, Margaret E.; Dionne, Jean-Paul
Mental models or implicit theories held by adults about everyday problem solving were studied. Research questions were posed to 12 male and 12 female adults, aged 25 to 60 years, from a wide range of educational and occupational orientations. Subjects were interviewed in pairs. Verbal Protocol Analysis was used to analyze the data from two…
ADHD and Problem-Solving in Play
ERIC Educational Resources Information Center
Borg, Suzanne
2009-01-01
This paper reports a small-scale study to determine whether there is a difference in problem-solving abilities, from a play perspective, between individuals who are diagnosed as ADHD and are on medication and those not on medication. Ten children, five of whom where on medication and five not, diagnosed as ADHD predominantly inattentive type, were…
Problem-Solving Interaction in GFL Videoconferencing
ERIC Educational Resources Information Center
Hoshii, Makiko; Schumacher, Nicole
2016-01-01
This paper reports on the interaction between upper intermediate German as a Foreign Language (GFL) learners in Tokyo and prospective GFL teachers in Berlin in an online videoconferencing environment. It focuses on the way problems in comprehension and production are brought up and solved in the subsequent interaction. Our findings illustrate that…
Student Problem Solving in High School Genetics.
ERIC Educational Resources Information Center
Stewart, James
1983-01-01
Describes set of specific steps (procedural knowledge) used when solving monohybrid/dihybrid cross problems and extent to which students could justify execution of each step in terms of their conceptual knowledge of genetics and meiosis. Implications for genetics instruction are discussed. (JN)
Solving Wicked Problems through Action Learning
ERIC Educational Resources Information Center
Crul, Liselore
2014-01-01
This account of practice outlines the Oxyme Action Learning Program which was conducted as part of the Management Challenge in my final year of the MSc in Coaching and Behavioral Change at Henley Business School. The central research questions were: (1) how action learning can help to solve wicked problems and (2) what the effect of an action…
On Teaching Problem Solving in School Mathematics
ERIC Educational Resources Information Center
Pehkonen, Erkki; Näveri, Liisa; Laine, Anu
2013-01-01
The article begins with a brief overview of the situation throughout the world regarding problem solving. The activities of the ProMath group are then described, as the purpose of this international research group is to improve mathematics teaching in school. One mathematics teaching method that seems to be functioning in school is the use of open…
Teaching, Learning and Assessing Statistical Problem Solving
ERIC Educational Resources Information Center
Marriott, John; Davies, Neville; Gibson, Liz
2009-01-01
In this paper we report the results from a major UK government-funded project, started in 2005, to review statistics and handling data within the school mathematics curriculum for students up to age 16. As a result of a survey of teachers we developed new teaching materials that explicitly use a problem-solving approach for the teaching and…
Why Some Communities Can Solve Their Problems.
ERIC Educational Resources Information Center
Mathews, David
1989-01-01
Effective communities are well-educated about themselves, have a better understanding of public information, talk through public issues to generate shared knowledge, appreciate the difference between public opinion and public judgment, and believe in public leadership as the key to using public power to solve community problems. (SK)
Should Children Learn to Solve Problems?
ERIC Educational Resources Information Center
Watras, Joseph
2011-01-01
In this comparative essay, the author discusses the opposing educational theories of John Dewey and Gregory Bateson. While Dewey believed that the scientific method was the dominant method of solving problems and thereby acquiring knowledge that mattered, Bateson warned that this one-sided approach would lead to actions that could destroy the…
Mental Imagery in Creative Problem Solving.
ERIC Educational Resources Information Center
Polland, Mark J.
In order to investigate the relationship between mental imagery and creative problem solving, a study of 44 separate accounts reporting mental imagery experiences associated with creative discoveries were examined. The data included 29 different scientists, among them Albert Einstein and Stephen Hawking, and 9 artists, musicians, and writers,…
General Problem Solving: Navy Requirements and Solutions.
1985-03-01
Karat, 1982; Lukas, et. al., 1971; Pitt, 1983; Post and Brennan, 1976; Reif and Heller, 1982; Schwieger , 1° 4; Speedie, et. al., 1973; Thor- son...bVo°o ,o. 4*** h ° . . .. - - o. . . . o. , ’ Schwieger , Ruben Don, A Component Analysis of Mathematical Problem Solving, Ph.D
Assessing Mathematical Problem Solving Using Comparative Judgement
ERIC Educational Resources Information Center
Jones, Ian; Swan, Malcolm; Pollitt, Alastair
2015-01-01
There is an increasing demand from employers and universities for school leavers to be able to apply their mathematical knowledge to problem solving in varied and unfamiliar contexts. These aspects are however neglected in most examinations of mathematics and, consequentially, in classroom teaching. One barrier to the inclusion of mathematical…
Problem-Solving Test: Tryptophan Operon Mutants
ERIC Educational Resources Information Center
Szeberenyi, Jozsef
2010-01-01
This paper presents a problem-solving test that deals with the regulation of the "trp" operon of "Escherichia coli." Two mutants of this operon are described: in mutant A, the operator region of the operon carries a point mutation so that it is unable to carry out its function; mutant B expresses a "trp" repressor protein unable to bind…
Raise the Bar on Problem Solving
ERIC Educational Resources Information Center
Englard, Lisa
2010-01-01
In a 1981 diagnostic test, the Ministry of Education in Singapore found its country facing a challenge: Only 46 percent of students in grades 2-4 could solve word problems that were presented without such key words as "altogether" or "left." Yet today, according to results from the Trends in International Mathematics and…
Facilitating Problem Solving in High School Chemistry.
ERIC Educational Resources Information Center
Gabel, Dorothy L.
The major purpose of this study was to determine whether certain types of instructional strategies (factor-label method, use of analogies, use of diagrams, and proportionality) were superior to others in teaching problem solving in four topics (mole concept, gas laws, stoichiometry, and molarity). Also of major interest was whether particular…
Stoichiometric Problem Solving in High School Chemistry.
ERIC Educational Resources Information Center
Schmidt, Hans-Jurgen
The purpose of this descriptive study was to create and test questions on stoichiometry with number ratios for quick mental calculations and to identify students' problem-solving strategies. The present study was a component of a more comprehensive investigation in which 7,441 German senior high school students were asked to work on 154 test items…
Effective Practices (Part 4): Problem Solving.
ERIC Educational Resources Information Center
Moursund, Dave
1996-01-01
Discusses the use of computers to help with problem solving. Topics include information science, including effective procedure and procedural thinking; templates; artificially intelligent agents and expert systems; and applications in education, including the goal of computer literacy for all students, and integrated software packages such as…
Facilitating problem solving in high school chemistry
NASA Astrophysics Data System (ADS)
Gabel, Dorothy L.; Sherwood, Robert D.
The major purpose for conducting this study was to determine whether certain instructional strategies were superior to others in teaching high school chemistry students problem solving. The effectiveness of four instructional strategies for teaching problem solving to students of various proportional reasoning ability, verbal and visual preference, and mathematics anxiety were compared in this aptitude by treatment interaction study. The strategies used were the factor-label method, analogies, diagrams, and proportionality. Six hundred and nine high school students in eight schools were randomly assigned to one of four teaching strategies within each classroom. Students used programmed booklets to study the mole concept, the gas laws, stoichiometry, and molarity. Problem-solving ability was measured by a series of immediate posttests, delayed posttests and the ACS-NSTA Examination in High School Chemistry. Results showed that mathematics anxiety is negatively correlated with science achievement and that problem solving is dependent on students' proportional reasoning ability. The factor-label method was found to be the most desirable method and proportionality the least desirable method for teaching the mole concept. However, the proportionality method was best for teaching the gas laws. Several second-order interactions were found to be significant when mathematics anxiety was one of the aptitudes involved.
Facilitating Problem Solving in High School Chemistry.
ERIC Educational Resources Information Center
Gabel, Dorothy L.; Sherwood, Robert D.
1983-01-01
Investigated superiority of instructional strategies (factor-label method, proportionality, use of analogies, use of diagrams) in teaching problem-solving related to mole concept, gas laws, stoichiometry, and molarity. Also investigated effectiveness of strategies for students (N=609) with different verbal-visual preferences, proportional…
Problem Solving in Chemistry Using Eureka.
ERIC Educational Resources Information Center
Chau, F. T.; Chik, Andy S. W.
1989-01-01
Discusses a software package that allows the user to solve mathematical problems, analyze data, plot graphs, and to examine mathematical models. Presents the attributes of the program and the available mathematical functions. Provides an example of pH calculations. (MVL)
Combining Computational and Social Effort for Collaborative Problem Solving
Wagy, Mark D.; Bongard, Josh C.
2015-01-01
Rather than replacing human labor, there is growing evidence that networked computers create opportunities for collaborations of people and algorithms to solve problems beyond either of them. In this study, we demonstrate the conditions under which such synergy can arise. We show that, for a design task, three elements are sufficient: humans apply intuitions to the problem, algorithms automatically determine and report back on the quality of designs, and humans observe and innovate on others’ designs to focus creative and computational effort on good designs. This study suggests how such collaborations should be composed for other domains, as well as how social and computational dynamics mutually influence one another during collaborative problem solving. PMID:26544199
Problem solving stages in the five square problem.
Fedor, Anna; Szathmáry, Eörs; Öllinger, Michael
2015-01-01
According to the restructuring hypothesis, insight problem solving typically progresses through consecutive stages of search, impasse, insight, and search again for someone, who solves the task. The order of these stages was determined through self-reports of problem solvers and has never been verified behaviorally. We asked whether individual analysis of problem solving attempts of participants revealed the same order of problem solving stages as defined by the theory and whether their subjective feelings corresponded to the problem solving stages they were in. Our participants tried to solve the Five-Square problem in an online task, while we recorded the time and trajectory of their stick movements. After the task they were asked about their feelings related to insight and some of them also had the possibility of reporting impasse while working on the task. We found that the majority of participants did not follow the classic four-stage model of insight, but had more complex sequences of problem solving stages, with search and impasse recurring several times. This means that the classic four-stage model is not sufficient to describe variability on the individual level. We revised the classic model and we provide a new model that can generate all sequences found. Solvers reported insight more often than non-solvers and non-solvers reported impasse more often than solvers, as expected; but participants did not report impasse more often during behaviorally defined impasse stages than during other stages. This shows that impasse reports might be unreliable indicators of impasse. Our study highlights the importance of individual analysis of problem solving behavior to verify insight theory.
Problem solving stages in the five square problem
Fedor, Anna; Szathmáry, Eörs; Öllinger, Michael
2015-01-01
According to the restructuring hypothesis, insight problem solving typically progresses through consecutive stages of search, impasse, insight, and search again for someone, who solves the task. The order of these stages was determined through self-reports of problem solvers and has never been verified behaviorally. We asked whether individual analysis of problem solving attempts of participants revealed the same order of problem solving stages as defined by the theory and whether their subjective feelings corresponded to the problem solving stages they were in. Our participants tried to solve the Five-Square problem in an online task, while we recorded the time and trajectory of their stick movements. After the task they were asked about their feelings related to insight and some of them also had the possibility of reporting impasse while working on the task. We found that the majority of participants did not follow the classic four-stage model of insight, but had more complex sequences of problem solving stages, with search and impasse recurring several times. This means that the classic four-stage model is not sufficient to describe variability on the individual level. We revised the classic model and we provide a new model that can generate all sequences found. Solvers reported insight more often than non-solvers and non-solvers reported impasse more often than solvers, as expected; but participants did not report impasse more often during behaviorally defined impasse stages than during other stages. This shows that impasse reports might be unreliable indicators of impasse. Our study highlights the importance of individual analysis of problem solving behavior to verify insight theory. PMID:26300794
Zhang, Songchuan; Xia, Youshen
2016-12-28
Much research has been devoted to complex-variable optimization problems due to their engineering applications. However, the complex-valued optimization method for solving complex-variable optimization problems is still an active research area. This paper proposes two efficient complex-valued optimization methods for solving constrained nonlinear optimization problems of real functions in complex variables, respectively. One solves the complex-valued nonlinear programming problem with linear equality constraints. Another solves the complex-valued nonlinear programming problem with both linear equality constraints and an ℓ₁-norm constraint. Theoretically, we prove the global convergence of the proposed two complex-valued optimization algorithms under mild conditions. The proposed two algorithms can solve the complex-valued optimization problem completely in the complex domain and significantly extend existing complex-valued optimization algorithms. Numerical results further show that the proposed two algorithms have a faster speed than several conventional real-valued optimization algorithms.
Discovering the structure of mathematical problem solving.
Anderson, John R; Lee, Hee Seung; Fincham, Jon M
2014-08-15
The goal of this research is to discover the stages of mathematical problem solving, the factors that influence the duration of these stages, and how these stages are related to the learning of a new mathematical competence. Using a combination of multivariate pattern analysis (MVPA) and hidden Markov models (HMM), we found that participants went through 5 major phases in solving a class of problems: A Define Phase where they identified the problem to be solved, an Encode Phase where they encoded the needed information, a Compute Phase where they performed the necessary arithmetic calculations, a Transform Phase where they performed any mathematical transformations, and a Respond Phase where they entered an answer. The Define Phase is characterized by activity in visual attention and default network regions, the Encode Phase by activity in visual regions, the Compute Phase by activity in regions active in mathematical tasks, the Transform Phase by activity in mathematical and response regions, and the Respond phase by activity in motor regions. The duration of the Compute and Transform Phases were the only ones that varied with condition. Two features distinguished the mastery trials on which participants came to understand a new problem type. First, the duration of late phases of the problem solution increased. Second, there was increased activation in the rostrolateral prefrontal cortex (RLPFC) and angular gyrus (AG), regions associated with metacognition. This indicates the importance of reflection to successful learning.
Optimal Planning and Problem-Solving
NASA Technical Reports Server (NTRS)
Clemet, Bradley; Schaffer, Steven; Rabideau, Gregg
2008-01-01
CTAEMS MDP Optimal Planner is a problem-solving software designed to command a single spacecraft/rover, or a team of spacecraft/rovers, to perform the best action possible at all times according to an abstract model of the spacecraft/rover and its environment. It also may be useful in solving logistical problems encountered in commercial applications such as shipping and manufacturing. The planner reasons around uncertainty according to specified probabilities of outcomes using a plan hierarchy to avoid exploring certain kinds of suboptimal actions. Also, planned actions are calculated as the state-action space is expanded, rather than afterward, to reduce by an order of magnitude the processing time and memory used. The software solves planning problems with actions that can execute concurrently, that have uncertain duration and quality, and that have functional dependencies on others that affect quality. These problems are modeled in a hierarchical planning language called C_TAEMS, a derivative of the TAEMS language for specifying domains for the DARPA Coordinators program. In realistic environments, actions often have uncertain outcomes and can have complex relationships with other tasks. The planner approaches problems by considering all possible actions that may be taken from any state reachable from a given, initial state, and from within the constraints of a given task hierarchy that specifies what tasks may be performed by which team member.
Solving the shepherding problem: heuristics for herding autonomous, interacting agents.
Strömbom, Daniel; Mann, Richard P; Wilson, Alan M; Hailes, Stephen; Morton, A Jennifer; Sumpter, David J T; King, Andrew J
2014-11-06
Herding of sheep by dogs is a powerful example of one individual causing many unwilling individuals to move in the same direction. Similar phenomena are central to crowd control, cleaning the environment and other engineering problems. Despite single dogs solving this 'shepherding problem' every day, it remains unknown which algorithm they employ or whether a general algorithm exists for shepherding. Here, we demonstrate such an algorithm, based on adaptive switching between collecting the agents when they are too dispersed and driving them once they are aggregated. Our algorithm reproduces key features of empirical data collected from sheep-dog interactions and suggests new ways in which robots can be designed to influence movements of living and artificial agents.
Engineering neural systems for high-level problem solving.
Sylvester, Jared; Reggia, James
2016-07-01
There is a long-standing, sometimes contentious debate in AI concerning the relative merits of a symbolic, top-down approach vs. a neural, bottom-up approach to engineering intelligent machine behaviors. While neurocomputational methods excel at lower-level cognitive tasks (incremental learning for pattern classification, low-level sensorimotor control, fault tolerance and processing of noisy data, etc.), they are largely non-competitive with top-down symbolic methods for tasks involving high-level cognitive problem solving (goal-directed reasoning, metacognition, planning, etc.). Here we take a step towards addressing this limitation by developing a purely neural framework named galis. Our goal in this work is to integrate top-down (non-symbolic) control of a neural network system with more traditional bottom-up neural computations. galis is based on attractor networks that can be "programmed" with temporal sequences of hand-crafted instructions that control problem solving by gating the activity retention of, communication between, and learning done by other neural networks. We demonstrate the effectiveness of this approach by showing that it can be applied successfully to solve sequential card matching problems, using both human performance and a top-down symbolic algorithm as experimental controls. Solving this kind of problem makes use of top-down attention control and the binding together of visual features in ways that are easy for symbolic AI systems but not for neural networks to achieve. Our model can not only be instructed on how to solve card matching problems successfully, but its performance also qualitatively (and sometimes quantitatively) matches the performance of both human subjects that we had perform the same task and the top-down symbolic algorithm that we used as an experimental control. We conclude that the core principles underlying the galis framework provide a promising approach to engineering purely neurocomputational systems for problem-solving
Russian Doll Search for solving Constraint Optimization problems
Verfaillie, G.; Lemaitre, M.
1996-12-31
If the Constraint Satisfaction framework has been extended to deal with Constraint Optimization problems, it appears that optimization is far more complex than satisfaction. One of the causes of the inefficiency of complete tree search methods, like Depth First Branch and Bound, lies in the poor quality of the lower bound on the global valuation of a partial assignment, even when using Forward Checking techniques. In this paper, we introduce the Russian Doll Search algorithm which replaces one search by n successive searches on nested subproblems (n being the number of problem variables), records the results of each search and uses them later, when solving larger subproblems, in order to improve the lower bound on the global valuation of any partial assignment. On small random problems and on large real scheduling problems, this algorithm yields surprisingly good results, which greatly improve as the problems get more constrained and the bandwidth of the used variable ordering diminishes.
Geogebra for Solving Problems of Physics
NASA Astrophysics Data System (ADS)
Kllogjeri, Pellumb; Kllogjeri, Adrian
Today is highly speed progressing the computer-based education, which allowes educators and students to use educational programming language and e-tutors to teach and learn, to interact with one another and share together the results of their work. In this paper we will be concentrated on the use of GeoGebra programme for solving problems of physics. We have brought an example from physics of how can be used GeoGebra for finding the center of mass(centroid) of a picture(or system of polygons). After the problem is solved graphically, there is an application of finding the center of a real object(a plate)by firstly, scanning the object and secondly, by inserting its scanned picture into the drawing pad of GeoGebra window and lastly, by finding its centroid. GeoGebra serve as effective tool in problem-solving. There are many other applications of GeoGebra in the problems of physics, and many more in different fields of mathematics.
A connectionist model for diagnostic problem solving
NASA Technical Reports Server (NTRS)
Peng, Yun; Reggia, James A.
1989-01-01
A competition-based connectionist model for solving diagnostic problems is described. The problems considered are computationally difficult in that (1) multiple disorders may occur simultaneously and (2) a global optimum in the space exponential to the total number of possible disorders is sought as a solution. The diagnostic problem is treated as a nonlinear optimization problem, and global optimization criteria are decomposed into local criteria governing node activation updating in the connectionist model. Nodes representing disorders compete with each other to account for each individual manifestation, yet complement each other to account for all manifestations through parallel node interactions. When equilibrium is reached, the network settles into a locally optimal state. Three randomly generated examples of diagnostic problems, each of which has 1024 cases, were tested, and the decomposition plus competition plus resettling approach yielded very high accuracy.
Giant Story Problems: Reading Comprehension through Math Problem Solving.
ERIC Educational Resources Information Center
Goularte, Renee
Primary students solve "oversized" story problems using drawings, equations, and written responses, helping them understand the links between the language of story problems and the numerical representations of matching equations. The activity also includes oral language and reflective writing, thus bringing together a variety of language…
Human Problem Solving in Fault Diagnosis Tasks
1986-04-01
W - FPFag-kx~~ff~P~xNA F MMIP Research Note 86-33 cc HUMAN PROBLEM SOLVING IN FAULT DIAGNOSIS TASKS J U William B. Rouse and Ruston M. Hunt Center...V -m ... 1 Ira wli W - -. W .: m.4.. . W - r - j ; - R 7T._ W77 m- UNCLASSIFIED SECURITY CLASSIFICATION OF THIS PAGE (When Date Entered) REPORT...ii SECURITY CLASSIFICATION OF THIS PAGE( W "en Data Entered) ,.-... 2
Solving the quadratic assignment problem with clues from nature.
Nissen, V
1994-01-01
This paper describes a new evolutionary approach to solving quadratic assignment problems. The proposed technique is based loosely on a class of search and optimization algorithms known as evolution strategies (ES). These methods are inspired by the mechanics of biological evolution and have been applied successfully to a variety of difficult problems, particularly in continuous optimization. The combinatorial variant of ES presented here performs very well on the given test problems as compared with the standard 2-Opt heuristic and results with simulated annealing and tabu search. Extensions for practical applications in factory layout are described.
Comprehension and computation in Bayesian problem solving
Johnson, Eric D.; Tubau, Elisabet
2015-01-01
Humans have long been characterized as poor probabilistic reasoners when presented with explicit numerical information. Bayesian word problems provide a well-known example of this, where even highly educated and cognitively skilled individuals fail to adhere to mathematical norms. It is widely agreed that natural frequencies can facilitate Bayesian inferences relative to normalized formats (e.g., probabilities, percentages), both by clarifying logical set-subset relations and by simplifying numerical calculations. Nevertheless, between-study performance on “transparent” Bayesian problems varies widely, and generally remains rather unimpressive. We suggest there has been an over-focus on this representational facilitator (i.e., transparent problem structures) at the expense of the specific logical and numerical processing requirements and the corresponding individual abilities and skills necessary for providing Bayesian-like output given specific verbal and numerical input. We further suggest that understanding this task-individual pair could benefit from considerations from the literature on mathematical cognition, which emphasizes text comprehension and problem solving, along with contributions of online executive working memory, metacognitive regulation, and relevant stored knowledge and skills. We conclude by offering avenues for future research aimed at identifying the stages in problem solving at which correct vs. incorrect reasoners depart, and how individual differences might influence this time point. PMID:26283976
A Flipped Pedagogy for Expert Problem Solving
NASA Astrophysics Data System (ADS)
Pritchard, David
The internet provides free learning opportunities for declarative (Wikipedia, YouTube) and procedural (Kahn Academy, MOOCs) knowledge, challenging colleges to provide learning at a higher cognitive level. Our ``Modeling Applied to Problem Solving'' pedagogy for Newtonian Mechanics imparts strategic knowledge - how to systematically determine which concepts to apply and why. Declarative and procedural knowledge is learned online before class via an e-text, checkpoint questions, and homework on edX.org (see http://relate.mit.edu/physicscourse); it is organized into five Core Models. Instructors then coach students on simple ``touchstone problems'', novel exercises, and multi-concept problems - meanwhile exercising three of the four C's: communication, collaboration, critical thinking and problem solving. Students showed 1.2 standard deviations improvement on the MIT final exam after three weeks instruction, a significant positive shift in 7 of the 9 categories in the CLASS, and their grades improved by 0.5 standard deviation in their following physics course (Electricity and Magnetism).
Solving the Swath Segment Selection Problem
NASA Technical Reports Server (NTRS)
Knight, Russell; Smith, Benjamin
2006-01-01
Several artificial-intelligence search techniques have been tested as means of solving the swath segment selection problem (SSSP) -- a real-world problem that is not only of interest in its own right, but is also useful as a test bed for search techniques in general. In simplest terms, the SSSP is the problem of scheduling the observation times of an airborne or spaceborne synthetic-aperture radar (SAR) system to effect the maximum coverage of a specified area (denoted the target), given a schedule of downlinks (opportunities for radio transmission of SAR scan data to a ground station), given the limit on the quantity of SAR scan data that can be stored in an onboard memory between downlink opportunities, and given the limit on the achievable downlink data rate. The SSSP is NP complete (short for "nondeterministic polynomial time complete" -- characteristic of a class of intractable problems that can be solved only by use of computers capable of making guesses and then checking the guesses in polynomial time).
Strategies of Cooperation in Distributed Problem Solving
1983-10-01
STRATEGIES FOR COOPERATION We have come to believe that there are no general algorithms to dictate optimum cooperation. Methods that yield good distributed...the techniques by which a group can implement the chosen policy in a distributed fashion. Briefly, any distributed method of implementing an...8217)th Year A RAND NOTE Prepared for Rand SANTA MONICA, CA. 90406 STRATEGIES OF COOPERATION IN DISTRIBUTED PROBLEM SQLVING Stephanie
Automatic Representation Changes in Problem Solving
1999-06-01
of these language features may violate the completeness of the extended algorithm. 1The Russian mystic Grigori Rasputin used the biblical parable of...clobber rules as in the future. 74 CHAPTER 2. PRODIGY SEARCH rasputin -Back-Chainer 1c. Pick a literal l among the current subgoals. Decision point...whether to negate its conditions. Figure 2.32: Backward-chaining procedure of the rasputin problem solver; it includes new deci- sion points (lines 6c
Insight and analysis problem solving in microbes to machines.
Clark, Kevin B
2015-11-01
A key feature for obtaining solutions to difficult problems, insight is oftentimes vaguely regarded as a special discontinuous intellectual process and/or a cognitive restructuring of problem representation or goal approach. However, this nearly century-old state of art devised by the Gestalt tradition to explain the non-analytical or non-trial-and-error, goal-seeking aptitude of primate mentality tends to neglect problem-solving capabilities of lower animal phyla, Kingdoms other than Animalia, and advancing smart computational technologies built from biological, artificial, and composite media. Attempting to provide an inclusive, precise definition of insight, two major criteria of insight, discontinuous processing and problem restructuring, are here reframed using terminology and statistical mechanical properties of computational complexity classes. Discontinuous processing becomes abrupt state transitions in algorithmic/heuristic outcomes or in types of algorithms/heuristics executed by agents using classical and/or quantum computational models. And problem restructuring becomes combinatorial reorganization of resources, problem-type substitution, and/or exchange of computational models. With insight bounded by computational complexity, humans, ciliated protozoa, and complex technological networks, for example, show insight when restructuring time requirements, combinatorial complexity, and problem type to solve polynomial and nondeterministic polynomial decision problems. Similar effects are expected from other problem types, supporting the idea that insight might be an epiphenomenon of analytical problem solving and consequently a larger information processing framework. Thus, this computational complexity definition of insight improves the power, external and internal validity, and reliability of operational parameters with which to classify, investigate, and produce the phenomenon for computational agents ranging from microbes to man-made devices.
Mathematical Problem Solving: A Review of the Literature.
ERIC Educational Resources Information Center
Funkhouser, Charles
The major perspectives on problem solving of the twentieth century are reviewed--associationism, Gestalt psychology, and cognitive science. The results of the review on teaching problem solving and the uses of computers to teach problem solving are included. Four major issues related to the teaching of problem solving are discussed: (1)…
Teaching Problem Solving Skills to Elementary Age Students with Autism
ERIC Educational Resources Information Center
Cote, Debra L.; Jones, Vita L.; Barnett, Crystal; Pavelek, Karin; Nguyen, Hoang; Sparks, Shannon L.
2014-01-01
Students with disabilities need problem-solving skills to promote their success in solving the problems of daily life. The research into problem-solving instruction has been limited for students with autism. Using a problem-solving intervention and the Self Determined Learning Model of Instruction, three elementary age students with autism were…
Young Children's Analogical Problem Solving: Gaining Insights from Video Displays
ERIC Educational Resources Information Center
Chen, Zhe; Siegler, Robert S.
2013-01-01
This study examined how toddlers gain insights from source video displays and use the insights to solve analogous problems. Two- to 2.5-year-olds viewed a source video illustrating a problem-solving strategy and then attempted to solve analogous problems. Older but not younger toddlers extracted the problem-solving strategy depicted in the video…
Problem-solving analysis: A piagetian study
NASA Astrophysics Data System (ADS)
Hale, James P.
Fifty-nine second-year medical students were asked to solve 12 Piagetian formal operational tasks. The purpose was to describe the formal logical characteristics of this medical student sample (59 of a total 65 possible) in terms of their abilities to solve problems in four formal logical schemata-combinatorial logic, probabilistic reasoning, propositional logic, and proportional reasoning. These tasks were presented as videotape demonstrations or in written form, depending on whether or not equipment manipulation was required, and were scored using conventional, prespecified scoring criteria. The results of this study show approximately 96% of the sample function at the transitional (Piaget's 3A level) stage of formal operations on all tasks and approximately 4% function at the full formal (Piaget's 3B level) stage of formal operations on all tasks. This sample demonstrates formal level thinking to a much greater degree than other samples reported in the literature to date and suggests these students are adequately prepared and developed to meet the challenge of their training (i.e., medical problem solving).
Solving the shepherding problem: heuristics for herding autonomous, interacting agents
Strömbom, Daniel; Mann, Richard P.; Wilson, Alan M.; Hailes, Stephen; Morton, A. Jennifer; Sumpter, David J. T.; King, Andrew J.
2014-01-01
Herding of sheep by dogs is a powerful example of one individual causing many unwilling individuals to move in the same direction. Similar phenomena are central to crowd control, cleaning the environment and other engineering problems. Despite single dogs solving this ‘shepherding problem’ every day, it remains unknown which algorithm they employ or whether a general algorithm exists for shepherding. Here, we demonstrate such an algorithm, based on adaptive switching between collecting the agents when they are too dispersed and driving them once they are aggregated. Our algorithm reproduces key features of empirical data collected from sheep–dog interactions and suggests new ways in which robots can be designed to influence movements of living and artificial agents. PMID:25165603
ERIC Educational Resources Information Center
Hayel Al-Srour, Nadia; Al-Ali, Safa M.; Al-Oweidi, Alia
2016-01-01
The present study aims to detect the impact of teacher training on creative writing and problem-solving using both Futuristic scenarios program to solve problems creatively, and creative problem solving. To achieve the objectives of the study, the sample was divided into two groups, the first consist of 20 teachers, and 23 teachers to second…
Can compactifications solve the cosmological constant problem?
Hertzberg, Mark P.; Masoumi, Ali
2016-06-30
Recently, there have been claims in the literature that the cosmological constant problem can be dynamically solved by specific compactifications of gravity from higher-dimensional toy models. These models have the novel feature that in the four-dimensional theory, the cosmological constant Λ is much smaller than the Planck density and in fact accumulates at Λ=0. Here we show that while these are very interesting models, they do not properly address the real cosmological constant problem. As we explain, the real problem is not simply to obtain Λ that is small in Planck units in a toy model, but to explain why Λ is much smaller than other mass scales (and combinations of scales) in the theory. Instead, in these toy models, all other particle mass scales have been either removed or sent to zero, thus ignoring the real problem. To this end, we provide a general argument that the included moduli masses are generically of order Hubble, so sending them to zero trivially sends the cosmological constant to zero. We also show that the fundamental Planck mass is being sent to zero, and so the central problem is trivially avoided by removing high energy physics altogether. On the other hand, by including various large mass scales from particle physics with a high fundamental Planck mass, one is faced with a real problem, whose only known solution involves accidental cancellations in a landscape.
The Problem of Assessing Problem Solving: Can Comparative Judgement Help?
ERIC Educational Resources Information Center
Jones, Ian; Inglis, Matthew
2015-01-01
School mathematics examination papers are typically dominated by short, structured items that fail to assess sustained reasoning or problem solving. A contributory factor to this situation is the need for student work to be marked reliably by a large number of markers of varied experience and competence. We report a study that tested an…
Solving Optimization Problems with Dynamic Geometry Software: The Airport Problem
ERIC Educational Resources Information Center
Contreras, José
2014-01-01
This paper describes how the author's students (in-service and pre-service secondary mathematics teachers) enrolled in college geometry courses use the Geometers' Sketchpad (GSP) to gain insight to formulate, confirm, test, and refine conjectures to solve the classical airport problem for triangles. The students are then provided with strategic…
Aha: A Connectionist Perspective on Problem Solving
1988-06-08
DOCUMENTATION PAGE 7, -REPORtT SEC.l CASPFC.A’C ON R7ESRtC’ vE %MARK.%GS Unclassif led 22 SECRITY C ASSPFCATION Aur~oRifv 3 ; S’R @Bu ON AjALA81L 3 F...Typically, the search perspective has been used to desc ,.,e problem solving behavior occurring on a macro-level time scale of seconds as opposed to the...unit /. The constants S, E and / (all set to .05 for the simulations described below) scale the strength of the external input, the excitatory input from
Can galileons solve the muon problem?
NASA Astrophysics Data System (ADS)
Lamm, Henry
2015-09-01
The leptonic bound states positronium and muonium are used to constrain Galileon contributions to the Lamb shift of muonic hydrogen. Through the application of a variety of bounds on lepton compositeness, it is shown that either the assumption of equating the charge radius of a particle with its Galileon scale radius is incompatible with experiments, or the scale of Galileons must be M >1.33 GeV , too large to solve the muon problem. The possibility of stronger constraints in the future from true muonium is discussed.
A Process Analysis of Engineering Problem Solving and Assessment of Problem Solving Skills
ERIC Educational Resources Information Center
Grigg, Sarah J.
2012-01-01
In the engineering profession, one of the most critical skills to possess is accurate and efficient problem solving. Thus, engineering educators should strive to help students develop skills needed to become competent problem solvers. In order to measure the development of skills, it is necessary to assess student performance, identify any…
Heuristic algorithm for off-lattice protein folding problem*
Chen, Mao; Huang, Wen-qi
2006-01-01
Enlightened by the law of interactions among objects in the physical world, we propose a heuristic algorithm for solving the three-dimensional (3D) off-lattice protein folding problem. Based on a physical model, the problem is converted from a nonlinear constraint-satisfied problem to an unconstrained optimization problem which can be solved by the well-known gradient method. To improve the efficiency of our algorithm, a strategy was introduced to generate initial configuration. Computational results showed that this algorithm could find states with lower energy than previously proposed ground states obtained by nPERM algorithm for all chains with length ranging from 13 to 55. PMID:16365919
Problem Solving Interventions: Impact on Young Children with Developmental Disabilities
ERIC Educational Resources Information Center
Diamond, Lindsay Lile
2012-01-01
Problem-solving skills are imperative to a child's growth and success across multiple environments, including general and special education. Problem solving is comprised of: (a) attention to the critical aspects of a problem, (b) generation of solution(s) to solve the problem, (c) application of a solution(s) to the identified problem, and…
Teaching Problem Solving as Viewed Through a Theory of Models
ERIC Educational Resources Information Center
Vest, Floyd
1976-01-01
An analysis of methods of teaching children to solve verbal arithmetic problems is presented together with transcriptions of interviews in which children solve problems by reference to problem types. (SD)
Solving large sparse eigenvalue problems on supercomputers
NASA Technical Reports Server (NTRS)
Philippe, Bernard; Saad, Youcef
1988-01-01
An important problem in scientific computing consists in finding a few eigenvalues and corresponding eigenvectors of a very large and sparse matrix. The most popular methods to solve these problems are based on projection techniques on appropriate subspaces. The main attraction of these methods is that they only require the use of the matrix in the form of matrix by vector multiplications. The implementations on supercomputers of two such methods for symmetric matrices, namely Lanczos' method and Davidson's method are compared. Since one of the most important operations in these two methods is the multiplication of vectors by the sparse matrix, methods of performing this operation efficiently are discussed. The advantages and the disadvantages of each method are compared and implementation aspects are discussed. Numerical experiments on a one processor CRAY 2 and CRAY X-MP are reported. Possible parallel implementations are also discussed.
Incubation and Intuition in Creative Problem Solving
Gilhooly, Kenneth J.
2016-01-01
Creative problem solving, in which novel solutions are required, has often been seen as involving a special role for unconscious processes (Unconscious Work) which can lead to sudden intuitive solutions (insights) when a problem is set aside during incubation periods. This notion of Unconscious Work during incubation periods is supported by a review of experimental studies and particularly by studies using the Immediate Incubation paradigm. Other explanations for incubation effects, in terms of Intermittent Work or Beneficial Forgetting are considered. Some recent studies of divergent thinking, using the Alternative Uses task, carried out in my laboratory regarding Immediate vs. Delayed Incubation and the effects of resource competition from interpolated activities are discussed. These studies supported a role for Unconscious Work as against Intermittent Conscious work or Beneficial Forgetting in incubation. PMID:27499745
Solving Math Problems Approximately: A Developmental Perspective
Ganor-Stern, Dana
2016-01-01
Although solving arithmetic problems approximately is an important skill in everyday life, little is known about the development of this skill. Past research has shown that when children are asked to solve multi-digit multiplication problems approximately, they provide estimates that are often very far from the exact answer. This is unfortunate as computation estimation is needed in many circumstances in daily life. The present study examined 4th graders, 6th graders and adults’ ability to estimate the results of arithmetic problems relative to a reference number. A developmental pattern was observed in accuracy, speed and strategy use. With age there was a general increase in speed, and an increase in accuracy mainly for trials in which the reference number was close to the exact answer. The children tended to use the sense of magnitude strategy, which does not involve any calculation but relies mainly on an intuitive coarse sense of magnitude, while the adults used the approximated calculation strategy which involves rounding and multiplication procedures, and relies to a greater extent on calculation skills and working memory resources. Importantly, the children were less accurate than the adults, but were well above chance level. In all age groups performance was enhanced when the reference number was smaller (vs. larger) than the exact answer and when it was far (vs. close) from it, suggesting the involvement of an approximate number system. The results suggest the existence of an intuitive sense of magnitude for the results of arithmetic problems that might help children and even adults with difficulties in math. The present findings are discussed in the context of past research reporting poor estimation skills among children, and the conditions that might allow using children estimation skills in an effective manner. PMID:27171224
Functional reasoning in diagnostic problem solving
NASA Technical Reports Server (NTRS)
Sticklen, Jon; Bond, W. E.; Stclair, D. C.
1988-01-01
This work is one facet of an integrated approach to diagnostic problem solving for aircraft and space systems currently under development. The authors are applying a method of modeling and reasoning about deep knowledge based on a functional viewpoint. The approach recognizes a level of device understanding which is intermediate between a compiled level of typical Expert Systems, and a deep level at which large-scale device behavior is derived from known properties of device structure and component behavior. At this intermediate functional level, a device is modeled in three steps. First, a component decomposition of the device is defined. Second, the functionality of each device/subdevice is abstractly identified. Third, the state sequences which implement each function are specified. Given a functional representation and a set of initial conditions, the functional reasoner acts as a consequence finder. The output of the consequence finder can be utilized in diagnostic problem solving. The paper also discussed ways in which this functional approach may find application in the aerospace field.
Inversion Algorithms for Geophysical Problems
1987-12-16
ktdud* Sccumy Oass/Kjoon) Inversion Algorithms for Geophysical Problems (U) 12. PERSONAL AUTHOR(S) Lanzano, Paolo 13 «. TYPE OF REPORT Final 13b...spectral density. 20. DISTRIBUTION/AVAILABILITY OF ABSTRACT 13 UNCLASSIFIED/UNLIMITED D SAME AS RPT n OTIC USERS 22a. NAME OF RESPONSIBLE...Research Laboratory ’^^ SSZ ’.Washington. DC 20375-5000 NRLrMemorandum Report-6138 Inversion Algorithms for Geophysical Problems p. LANZANO Space
Solving molecular docking problems with multi-objective metaheuristics.
García-Godoy, María Jesús; López-Camacho, Esteban; García-Nieto, José; Aldana-Montes, Antonio J Nebroand José F
2015-06-02
Molecular docking is a hard optimization problem that has been tackled in the past with metaheuristics, demonstrating new and challenging results when looking for one objective: the minimum binding energy. However, only a few papers can be found in the literature that deal with this problem by means of a multi-objective approach, and no experimental comparisons have been made in order to clarify which of them has the best overall performance. In this paper, we use and compare, for the first time, a set of representative multi-objective optimization algorithms applied to solve complex molecular docking problems. The approach followed is focused on optimizing the intermolecular and intramolecular energies as two main objectives to minimize. Specifically, these algorithms are: two variants of the non-dominated sorting genetic algorithm II (NSGA-II), speed modulation multi-objective particle swarm optimization (SMPSO), third evolution step of generalized differential evolution (GDE3), multi-objective evolutionary algorithm based on decomposition (MOEA/D) and S-metric evolutionary multi-objective optimization (SMS-EMOA). We assess the performance of the algorithms by applying quality indicators intended to measure convergence and the diversity of the generated Pareto front approximations. We carry out a comparison with another reference mono-objective algorithm in the problem domain (Lamarckian genetic algorithm (LGA) provided by the AutoDock tool). Furthermore, the ligand binding site and molecular interactions of computed solutions are analyzed, showing promising results for the multi-objective approaches. In addition, a case study of application for aeroplysinin-1 is performed, showing the effectiveness of our multi-objective approach in drug discovery.
Solving Fuzzy Optimization Problem Using Hybrid Ls-Sa Method
NASA Astrophysics Data System (ADS)
Vasant, Pandian
2011-06-01
Fuzzy optimization problem has been one of the most and prominent topics inside the broad area of computational intelligent. It's especially relevant in the filed of fuzzy non-linear programming. It's application as well as practical realization can been seen in all the real world problems. In this paper a large scale non-linear fuzzy programming problem has been solved by hybrid optimization techniques of Line Search (LS), Simulated Annealing (SA) and Pattern Search (PS). As industrial production planning problem with cubic objective function, 8 decision variables and 29 constraints has been solved successfully using LS-SA-PS hybrid optimization techniques. The computational results for the objective function respect to vagueness factor and level of satisfaction has been provided in the form of 2D and 3D plots. The outcome is very promising and strongly suggests that the hybrid LS-SA-PS algorithm is very efficient and productive in solving the large scale non-linear fuzzy programming problem.
Solving unstructured grid problems on massively parallel computers
NASA Technical Reports Server (NTRS)
Hammond, Steven W.; Schreiber, Robert
1990-01-01
A highly parallel graph mapping technique that enables one to efficiently solve unstructured grid problems on massively parallel computers is presented. Many implicit and explicit methods for solving discretized partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The cost of this communication can negate the high performance promised by massively parallel computing. To eliminate this bottleneck, the graph of the irregular problem is mapped into the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. It is shown that using the heuristic mapping algorithm significantly reduces the communication time compared to a naive assignment of processes to processors.
A cognitive model for problem solving in computer science
NASA Astrophysics Data System (ADS)
Parham, Jennifer R.
According to industry representatives, computer science education needs to emphasize the processes involved in solving computing problems rather than their solutions. Most of the current assessment tools used by universities and computer science departments analyze student answers to problems rather than investigating the processes involved in solving them. Approaching assessment from this perspective would reveal potential errors leading to incorrect solutions. This dissertation proposes a model describing how people solve computational problems by storing, retrieving, and manipulating information and knowledge. It describes how metacognition interacts with schemata representing conceptual and procedural knowledge, as well as with the external sources of information that might be needed to arrive at a solution. Metacognition includes higher-order, executive processes responsible for controlling and monitoring schemata, which in turn represent the algorithmic knowledge needed for organizing and adapting concepts to a specific domain. The model illustrates how metacognitive processes interact with the knowledge represented by schemata as well as the information from external sources. This research investigates the differences in the way computer science novices use their metacognition and schemata to solve a computer programming problem. After J. Parham and L. Gugerty reached an 85% reliability for six metacognitive processes and six domain-specific schemata for writing a computer program, the resulting vocabulary provided the foundation for supporting the existence of and the interaction between metacognition, schemata, and external sources of information in computer programming. Overall, the participants in this research used their schemata 6% more than their metacognition and their metacognitive processes to control and monitor their schemata used to write a computer program. This research has potential implications in computer science education and software
Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance
Li, Zhaokai; Yung, Man-Hong; Chen, Hongwei; Lu, Dawei; Whitfield, James D.; Peng, Xinhua; Aspuru-Guzik, Alán; Du, Jiangfeng
2011-01-01
Quantum ground-state problems are computationally hard problems for general many-body Hamiltonians; there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating the ground state is available, as often happens for many problems in physics and chemistry, a quantum computer could employ this trial wavefunction to project the ground state by means of the phase estimation algorithm (PEA). We performed an experimental realization of this idea by implementing a variational-wavefunction approach to solve the ground-state problem of the Heisenberg spin model with an NMR quantum simulator. Our iterative phase estimation procedure yields a high accuracy for the eigenenergies (to the 10−5 decimal digit). The ground-state fidelity was distilled to be more than 80%, and the singlet-to-triplet switching near the critical field is reliably captured. This result shows that quantum simulators can better leverage classical trial wave functions than classical computers PMID:22355607
NASA Astrophysics Data System (ADS)
Bahrami, Saeed; Doulati Ardejani, Faramarz; Baafi, Ernest
2016-05-01
In this study, hybrid models are designed to predict groundwater inflow to an advancing open pit mine and the hydraulic head (HH) in observation wells at different distances from the centre of the pit during its advance. Hybrid methods coupling artificial neural network (ANN) with genetic algorithm (GA) methods (ANN-GA), and simulated annealing (SA) methods (ANN-SA), were utilised. Ratios of depth of pit penetration in aquifer to aquifer thickness, pit bottom radius to its top radius, inverse of pit advance time and the HH in the observation wells to the distance of observation wells from the centre of the pit were used as inputs to the networks. To achieve the objective two hybrid models consisting of ANN-GA and ANN-SA with 4-5-3-1 arrangement were designed. In addition, by switching the last argument of the input layer with the argument of the output layer of two earlier models, two new models were developed to predict the HH in the observation wells for the period of the mining process. The accuracy and reliability of models are verified by field data, results of a numerical finite element model using SEEP/W, outputs of simple ANNs and some well-known analytical solutions. Predicted results obtained by the hybrid methods are closer to the field data compared to the outputs of analytical and simple ANN models. Results show that despite the use of fewer and simpler parameters by the hybrid models, the ANN-GA and to some extent the ANN-SA have the ability to compete with the numerical models.
Journey into Problem Solving: A Gift from Polya
ERIC Educational Resources Information Center
Lederman, Eric
2009-01-01
In "How to Solve It", accomplished mathematician and skilled communicator George Polya describes a four-step universal solving technique designed to help students develop mathematical problem-solving skills. By providing a glimpse at the grace with which experts solve problems, Polya provides definable methods that are not exclusive to…
A genetic algorithm for solving supply chain network design model
NASA Astrophysics Data System (ADS)
Firoozi, Z.; Ismail, N.; Ariafar, S. H.; Tang, S. H.; Ariffin, M. K. M. A.
2013-09-01
Network design is by nature costly and optimization models play significant role in reducing the unnecessary cost components of a distribution network. This study proposes a genetic algorithm to solve a distribution network design model. The structure of the chromosome in the proposed algorithm is defined in a novel way that in addition to producing feasible solutions, it also reduces the computational complexity of the algorithm. Computational results are presented to show the algorithm performance.
Hooke and Jeeves based multilevel coordinate search to globally solving nonsmooth problems
NASA Astrophysics Data System (ADS)
Costa, M. Fernanda P.; Rocha, Ana Maria A. C.; Fernandes, Edite M. G. P.
2013-10-01
In this paper, we present a derivative-free multilevel coordinate search (MCS) approach, that relies on the Hooke and Jeeves local search, for globally solving bound constrained optimization problems. Numerical experiments show that the proposed algorithm is effective in solving benchmark problems, when compared with the well-known solvers MCS and DIRECT.
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.
Dynamics of students’ epistemological framing in group problem solving
NASA Astrophysics Data System (ADS)
Nguyen, Hai D.; Chari, Deepa N.; Sayre, Eleanor C.
2016-11-01
Many studies have investigated students’ epistemological framing when solving physics problems. Framing supports students’ problem solving as they decide what knowledge to employ and the necessary steps to solve the problem. Students may frame the same problem differently and take alternative paths to a correct solution. When students work in group settings, they share and discuss their framing to decide how to proceed in problem solving as a whole group. In this study, we investigate how groups of students negotiate their framing and frame shifts in group problem solving.
a Problem Solving Diagnostic Instrument for Physics Thermodynamics Concepts.
NASA Astrophysics Data System (ADS)
Iona, Steven
Changes in conceptual representations of physics thermodynamics concepts by high school physics students was examined throughout an instructional sequence. The knowledge structures identified were characterized and also compared to problem-solving strategies used by the students on physics problems. Over sixty students from four intact classes completed seven measures including three computer-administered concept relatedness tasks, a test of logical thinking, identification of demographic information, and two problem-solving sessions. Ten teacher/experts also completed the relatedness rating task and problem -solving sessions. For each rating by the students and teacher/experts, the data were transformed into a network using the Pathfinder algorithm, where each node in the network represented one of the physics concepts. Two statistical comparisons were made between the students' and teacher/experts' data: Pearson-r comparison of relatedness data and a Pearson -r comparison of the Pathfinder graphs. The results indicated that there was: (1) A structure to the thermodynamics concepts held by both the students and the teacher/experts. (2) A significant statistical difference in the Pathfinder networks among the teacher/experts. The differences were primarily localized to concepts dealing with gas laws. (3) No increase in the statistical similarity (comparing teacher/experts and students) in the networks during the instructional period. (4) A change in the students' conceptual networks indicating: (a) an acceptance by the students of certain "deep structures," (b) a time-delayed acceptance of some organizing ideas, and/or (c) gaps in the students' understanding of key ideas. (5) A "weak" rather than "strong" restructuring of the concepts by students. (6) Statistically significant similarities in local networks involving pairs of physics concepts and the problem-solving strategies used by the students. Overall this study corroborated much of the research dealing with
On stochastic approximation algorithms for classes of PAC learning problems
Rao, N.S.V.; Uppuluri, V.R.R.; Oblow, E.M.
1994-03-01
The classical stochastic approximation methods are shown to yield algorithms to solve several formulations of the PAC learning problem defined on the domain [o,1]{sup d}. Under some assumptions on different ability of the probability measure functions, simple algorithms to solve some PAC learning problems are proposed based on networks of non-polynomial units (e.g. artificial neural networks). Conditions on the sizes of these samples required to ensure the error bounds are derived using martingale inequalities.
Maximum/Minimum Problems Solved Using an Algebraic Way
ERIC Educational Resources Information Center
Modica, Erasmo
2010-01-01
This article describes some problems of the maximum/minimum type, which are generally solved using calculus at secondary school, but which here are solved algebraically. We prove six algebraic properties and then apply them to this kind of problem. This didactic approach allows pupils to solve these problems even at the beginning of secondary…
Interpersonal and Emotional Problem Solving among Narcotic Drug Abusers.
ERIC Educational Resources Information Center
Appel, Philip W.; Kaestner, Elisabeth
1979-01-01
Measured problem-solving abilities of narcotics abusers using the modified means-ends problem-solving procedure. Good subjects had more total relevent means (RMs) for solving problems, used more introspective and emotional RMs, and were better at RM recognition, but did not have more sufficient narratives than poor subjects. (Author/BEF)
Perceived Problem Solving, Stress, and Health among College Students
ERIC Educational Resources Information Center
Largo-Wight, Erin; Peterson, P. Michael; Chen, W. William
2005-01-01
Objective: To study the relationships among perceived problem solving, stress, and physical health. Methods: The Perceived Stress Questionnaire (PSQ), Personal Problem solving Inventory (PSI), and a stress-related physical health symptoms checklist were used to measure perceived stress, problem solving, and health among undergraduate college…
Independence Pending: Teacher Behaviors Preceding Learner Problem Solving
ERIC Educational Resources Information Center
Roesler, Rebecca A.
2017-01-01
The purposes of the present study were to identify the teacher behaviors that preceded learners' active participation in solving musical and technical problems and describe learners' roles in the problem-solving process. I applied an original model of problem solving to describe the behaviors of teachers and students in 161 rehearsal frames…
Team-Based Complex Problem Solving: A Collective Cognition Perspective
ERIC Educational Resources Information Center
Hung, Woei
2013-01-01
Today, much problem solving is performed by teams, rather than individuals. The complexity of these problems has exceeded the cognitive capacity of any individual and requires a team of members to solve them. The success of solving these complex problems not only relies on individual team members who possess different but complementary expertise,…
The Influence of Cognitive Diversity on Group Problem Solving Strategy
ERIC Educational Resources Information Center
Lamm, Alexa J.; Shoulders, Catherine; Roberts, T. Grady; Irani, Tracy A.; Snyder, Lori J. Unruh; Brendemuhl, Joel
2012-01-01
Collaborative group problem solving allows students to wrestle with different interpretations and solutions brought forth by group members, enhancing both critical thinking and problem solving skills. Since problem solving in groups is a common practice in agricultural education, instructors are often put in the position of organizing student…
Teaching Problem Solving in Secondary School Mathematics Classrooms
ERIC Educational Resources Information Center
Lam, Toh Tin; Guan, Tay Eng; Seng, Quek Khiok; Hoong, Leong Yew; Choon, Toh Pee; Him, Ho Foo; Jaguthsing, Dindyal
2014-01-01
This paper reports an innovative approach to teaching problem solving in secondary school mathematics classrooms based on a specifically designed problem-solving module.This approach adopts the science practical paradigm and rides on the works of Polya and Schoenfeld in order to give greater emphasis to the problem solving processes. We report the…
Surveying Graduate Students' Attitudes and Approaches to Problem Solving
ERIC Educational Resources Information Center
Mason, Andrew; Singh, Chandralekha
2010-01-01
Students' attitudes and approaches to problem solving in physics can profoundly influence their motivation to learn and development of expertise. We developed and validated an Attitudes and Approaches to Problem Solving survey by expanding the Attitudes toward Problem Solving survey of Marx and Cummings and administered it to physics graduate…
Teaching Young Children Interpersonal Problem-Solving Skills
ERIC Educational Resources Information Center
Joseph, Gail E.; Strain, Phillip S.
2010-01-01
Learning how to problem solve is one of the key developmental milestones in early childhood. Children's problem-solving skills represent a key feature in the development of social competence. Problem solving allows children to stay calm during difficult situations, repair social relations quickly, and get their needs met in ways that are safe and…
Problem-Solving Processes Used by Students in Organic Synthesis.
ERIC Educational Resources Information Center
Bowen, Craig W.; Bodner, George M.
1991-01-01
A model for problem solving stressing both psychological and cultural influences is presented. This model is based on the analyses of how graduate students (n=10) solve organic synthesis problems, along with two models of problem solving and a constructivist epistemological stance. (KR)
Capturing Problem-Solving Processes Using Critical Rationalism
ERIC Educational Resources Information Center
Chitpin, Stephanie; Simon, Marielle
2012-01-01
The examination of problem-solving processes continues to be a current research topic in education. Knowing how to solve problems is not only a key aspect of learning mathematics but is also at the heart of cognitive theories, linguistics, artificial intelligence, and computers sciences. Problem solving is a multistep, higher-order cognitive task…
Teacher Practices with Toddlers during Social Problem Solving Opportunities
ERIC Educational Resources Information Center
Gloeckler, Lissy; Cassell, Jennifer
2012-01-01
This article explores how teachers can foster an environment that facilitates social problem solving when toddlers experience conflict, emotional dysregulation, and aggression. This article examines differences in child development and self-regulation outcomes when teachers engage in problem solving "for" toddlers and problem solving "with"…
Harmony Theory: Problem Solving, Parallel Cognitive Models, and Thermal Physics.
ERIC Educational Resources Information Center
Smolensky, Paul; Riley, Mary S.
This document consists of three papers. The first, "A Parallel Model of (Sequential) Problem Solving," describes a parallel model designed to solve a class of relatively simple problems from elementary physics and discusses implications for models of problem-solving in general. It is shown that one of the most salient features of problem…
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…
Problem Solving Strategies for Pharmaceutical/Chemical Technology College Students.
ERIC Educational Resources Information Center
Grant, George F.; Alexander, William E.
Teaching problem solving strategies and steps to first year college students enrolled in the pharmaceutical/chemical technology program as a part of their first year chemistry course focused on teaching the students the basic steps in problem solving and encouraging them to plan carefully and focus on the problem solving process rather than to…
A TAPS Interactive Multimedia Package to Solve Engineering Dynamics Problem
ERIC Educational Resources Information Center
Sidhu, S. Manjit; Selvanathan, N.
2005-01-01
Purpose: To expose engineering students to using modern technologies, such as multimedia packages, to learn, visualize and solve engineering problems, such as in mechanics dynamics. Design/methodology/approach: A multimedia problem-solving prototype package is developed to help students solve an engineering problem in a step-by-step approach. A…
Problem Solving in the School Curriculum from a Design Perspective
ERIC Educational Resources Information Center
Toh, Tin Lam; Leong, Yew Hoong; Dindyal, Jaguthsing; Quek, Khiok Seng
2010-01-01
In this symposium, the participants discuss some preliminary data collected from their problem solving project which uses a design experiment approach. Their approach to problem solving in the school curriculum is in tandem with what Schoenfeld (2007) claimed: "Crafting instruction that would make a wide range of problem-solving strategies…
Internet Computer Coaches for Introductory Physics Problem Solving
ERIC Educational Resources Information Center
Xu Ryan, Qing
2013-01-01
The ability to solve problems in a variety of contexts is becoming increasingly important in our rapidly changing technological society. Problem-solving is a complex process that is important for everyday life and crucial for learning physics. Although there is a great deal of effort to improve student problem solving skills throughout the…
Improving the efficiency of solving discrete optimization problems: The case of VRP
NASA Astrophysics Data System (ADS)
Belov, A.; Slastnikov, S.
2016-02-01
Paper is devoted constructing efficient metaheuristics algorithms for discrete optimization problems. Particularly, we consider vehicle routing problem applying original ant colony optimization method to solve it. Besides, some parts of algorithm are separated for parallel computing. Some experimental results are performed to compare the efficiency of these methods.
Parallel algorithms for boundary value problems
NASA Technical Reports Server (NTRS)
Lin, Avi
1991-01-01
A general approach to solve boundary value problems numerically in a parallel environment is discussed. The basic algorithm consists of two steps: the local step where all the P available processors work in parallel, and the global step where one processor solves a tridiagonal linear system of the order P. The main advantages of this approach are twofold. First, this suggested approach is very flexible, especially in the local step and thus the algorithm can be used with any number of processors and with any of the SIMD or MIMD machines. Secondly, the communication complexity is very small and thus can be used as easily with shared memory machines. Several examples for using this strategy are discussed.
Parallel algorithms for boundary value problems
NASA Technical Reports Server (NTRS)
Lin, Avi
1990-01-01
A general approach to solve boundary value problems numerically in a parallel environment is discussed. The basic algorithm consists of two steps: the local step where all the P available processors work in parallel, and the global step where one processor solves a tridiagonal linear system of the order P. The main advantages of this approach are two fold. First, this suggested approach is very flexible, especially in the local step and thus the algorithm can be used with any number of processors and with any of the SIMD or MIMD machines. Secondly, the communication complexity is very small and thus can be used as easily with shared memory machines. Several examples for using this strategy are discussed.
NASA Astrophysics Data System (ADS)
Li, Yuzhong
Using GA solve the winner determination problem (WDP) with large bids and items, run under different distribution, because the search space is large, constraint complex and it may easy to produce infeasible solution, would affect the efficiency and quality of algorithm. This paper present improved MKGA, including three operator: preprocessing, insert bid and exchange recombination, and use Monkey-king elite preservation strategy. Experimental results show that improved MKGA is better than SGA in population size and computation. The problem that traditional branch and bound algorithm hard to solve, improved MKGA can solve and achieve better effect.
Leprosy: a problem solved by 2000?
Stearns, A T
2002-09-01
It is now the year 2001, and in many endemic regions leprosy remains a public health problem by any definition. It is clear that defining leprosy purely by prevalence side-steps some of the real issues. There is still much to do to solve the problem of leprosy. Control programmes require better tests for early diagnosis if leprosy is to be reduced much further. Treatment of the infection and of reactions is still far from ideal, whilst an effective vaccine would be valuable in high-risk regions. Research into the true incidence in each endemic area is essential, and control programs of the future will need a more detailed understanding of the transmission of M. leprae to permit new logical interventions. Leprosy remains a devastating disease. Much of the damage that it inflicts is irreversible, and leads to disability and stigmatization. This is perhaps the greatest problem posed. It is easy to dwell on the successes of the elimination campaign, so diverting attention from those populations of 'cured' patients who still suffer from the consequences of infection. Leprosy should be regarded as a problem unsolved so long as patients continue to present with disabilities. WHO has carried out a highly successful campaign in reducing the prevalence of leprosy, and this needs to be acknowledged, but what is happening to the incidence in core endemic areas? Maintaining this success, however, may be an even greater struggle if funding is withdrawn and vertical programmes are absorbed into national health structures. We must take heed of the historian George Santayana, 'those who cannot remember the past are condemned to repeat it'. We should take the example of tuberculosis as a warning of the dangers of ignoring a disease before it has been fully controlled, and strive to continue the leprosy elimination programmes until there are no new cases presenting with disability. The World Health Organisation has shown that leprosy is an eminently treatable disease, and has
Young children's analogical problem solving: gaining insights from video displays.
Chen, Zhe; Siegler, Robert S
2013-12-01
This study examined how toddlers gain insights from source video displays and use the insights to solve analogous problems. The sample of 2- and 2.5-year-olds viewed a source video illustrating a problem-solving strategy and then attempted to solve analogous problems. Older, but not younger, toddlers extracted the problem-solving strategy depicted in the video and spontaneously transferred the strategy to solve isomorphic problems. Transfer by analogy from the video was evident only when the video illustrated the complete problem goal structure, including the character's intention and the action needed to achieve a goal. The same action isolated from the problem-solving context did not serve as an effective source analogue. These results illuminate the development of early representation and processes involved in analogical problem solving. Theoretical and educational implications are discussed.
Can Architecture Design Solve Social Problem?
NASA Astrophysics Data System (ADS)
Ginting, S. W.; TSB Darjosanjoto, E.; Sulistyarso, H.
2017-03-01
Most of architects and urban designers believe physical design gives impact on our social life. For example, a sign or landmark in the middle of a city makes people find orientation easier. In vice verse, most of social scientists believe it is social dynamic that plays role in shaping our space. How people spend their time moving from real space into cyber space is a proof that life style and IT give impact to space usage. This paper argues that interaction between physical design and social change is a two ways process. Both design aspect and social dynamic influence each other. This paper aims to examine how designing of gated community plays important role in increasing or decreasing segregation, both spatially and socially. The paper explores some architectural design principles applied in a gated community called CitraLand in west Surabaya, Indonesia, and addresses segregation between CitraLanders and outside kampung. We find CitraLand is designed openly and fully accessible for outsiders. It provides public spaces and several accessible gates and streets without walls and fences making all places inside and outside CitraLand spatially integrated. What’s interesting is it still reinforces social segregation due to its policy on prohibiting using the public park. We believe CitraLand’s planning and designing has successfully solved segregation problem spatially not socially.
A Framework for Distributed Problem Solving
NASA Astrophysics Data System (ADS)
Leone, Joseph; Shin, Don G.
1989-03-01
This work explores a distributed problem solving (DPS) approach, namely the AM/AG model, to cooperative memory recall. The AM/AG model is a hierarchic social system metaphor for DPS based on the Mintzberg's model of organizations. At the core of the model are information flow mechanisms, named amplification and aggregation. Amplification is a process of expounding a given task, called an agenda, into a set of subtasks with magnified degree of specificity and distributing them to multiple processing units downward in the hierarchy. Aggregation is a process of combining the results reported from multiple processing units into a unified view, called a resolution, and promoting the conclusion upward in the hierarchy. The combination of amplification and aggregation can account for a memory recall process which primarily relies on the ability of making associations between vast amounts of related concepts, sorting out the combined results, and promoting the most plausible ones. The amplification process is discussed in detail. An implementation of the amplification process is presented. The process is illustrated by an example.
Space-time spectral collocation algorithm for solving time-fractional Tricomi-type equations
NASA Astrophysics Data System (ADS)
Abdelkawy, M. A.; Ahmed, Engy A.; Alqahtani, Rubayyi T.
2016-01-01
We introduce a new numerical algorithm for solving one-dimensional time-fractional Tricomi-type equations (T-FTTEs). We used the shifted Jacobi polynomials as basis functions and the derivatives of fractional is evaluated by the Caputo definition. The shifted Jacobi Gauss-Lobatt algorithm is used for the spatial discretization, while the shifted Jacobi Gauss-Radau algorithmis applied for temporal approximation. Substituting these approximations in the problem leads to a system of algebraic equations that greatly simplifies the problem. The proposed algorithm is successfully extended to solve the two-dimensional T-FTTEs. Extensive numerical tests illustrate the capability and high accuracy of the proposed methodologies.
A novel heuristic algorithm for capacitated vehicle routing problem
NASA Astrophysics Data System (ADS)
Kır, Sena; Yazgan, Harun Reşit; Tüncel, Emre
2017-02-01
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic algorithm based on the tabu search and adaptive large neighborhood search (ALNS) with several specifically designed operators and features to solve the capacitated vehicle routing problem (CVRP). The effectiveness of the proposed algorithm was illustrated on the benchmark problems. The algorithm provides a better performance on large-scaled instances and gained advantage in terms of CPU time. In addition, we solved a real-life CVRP using the proposed algorithm and found the encouraging results by comparison with the current situation that the company is in.
Solving the Traveling Salesman's Problem Using the African Buffalo Optimization
Odili, Julius Beneoluchi; Mohmad Kahar, Mohd Nizam
2016-01-01
This paper proposes the African Buffalo Optimization (ABO) which is a new metaheuristic algorithm that is derived from careful observation of the African buffalos, a species of wild cows, in the African forests and savannahs. This animal displays uncommon intelligence, strategic organizational skills, and exceptional navigational ingenuity in its traversal of the African landscape in search for food. The African Buffalo Optimization builds a mathematical model from the behavior of this animal and uses the model to solve 33 benchmark symmetric Traveling Salesman's Problem and six difficult asymmetric instances from the TSPLIB. This study shows that buffalos are able to ensure excellent exploration and exploitation of the search space through regular communication, cooperation, and good memory of its previous personal exploits as well as tapping from the herd's collective exploits. The results obtained by using the ABO to solve these TSP cases were benchmarked against the results obtained by using other popular algorithms. The results obtained using the African Buffalo Optimization algorithm are very competitive. PMID:26880872
Solving the Traveling Salesman's Problem Using the African Buffalo Optimization.
Odili, Julius Beneoluchi; Mohmad Kahar, Mohd Nizam
2016-01-01
This paper proposes the African Buffalo Optimization (ABO) which is a new metaheuristic algorithm that is derived from careful observation of the African buffalos, a species of wild cows, in the African forests and savannahs. This animal displays uncommon intelligence, strategic organizational skills, and exceptional navigational ingenuity in its traversal of the African landscape in search for food. The African Buffalo Optimization builds a mathematical model from the behavior of this animal and uses the model to solve 33 benchmark symmetric Traveling Salesman's Problem and six difficult asymmetric instances from the TSPLIB. This study shows that buffalos are able to ensure excellent exploration and exploitation of the search space through regular communication, cooperation, and good memory of its previous personal exploits as well as tapping from the herd's collective exploits. The results obtained by using the ABO to solve these TSP cases were benchmarked against the results obtained by using other popular algorithms. The results obtained using the African Buffalo Optimization algorithm are very competitive.
ERIC Educational Resources Information Center
Jeon, Kyungmoon; Huffman, Douglas; Noh, Taehee
2005-01-01
A problem solving strategy, Thinking Aloud Pair Problem Solving (TAPPS), developed by Arthur Whimbey to help students monitor and understand their own thought process is presented. The TAPPS strategy encouraged the students interact verbally with each other to solve chemistry problems and improve the achievements in chemistry.
Social Emotional Optimization Algorithm for Nonlinear Constrained Optimization Problems
NASA Astrophysics Data System (ADS)
Xu, Yuechun; Cui, Zhihua; Zeng, Jianchao
Nonlinear programming problem is one important branch in operational research, and has been successfully applied to various real-life problems. In this paper, a new approach called Social emotional optimization algorithm (SEOA) is used to solve this problem which is a new swarm intelligent technique by simulating the human behavior guided by emotion. Simulation results show that the social emotional optimization algorithm proposed in this paper is effective and efficiency for the nonlinear constrained programming problems.
ERIC Educational Resources Information Center
Overton, Tina L.; Potter, Nicholas M.
2011-01-01
Much research has been carried out on how students solve algorithmic and structured problems in chemistry. This study is concerned with how students solve open-ended, ill-defined problems in chemistry. Over 200 undergraduate chemistry students solved a number of open-ended problem in groups and individually. The three cognitive variables of…
Application of Dynamic Programming to Solving K Postmen Chinese Postmen Problem
NASA Astrophysics Data System (ADS)
Fei, Rong; Cui, Duwu; Zhang, Yikun; Wang, Chaoxue
In this paper, Dynamic Programming is used to solve K postmen Chinese postmen problem for the first time. And a novel model for decision- making of KPCPP and the computation models for solving the whole problem are proposed. The arcs of G are changed into the points of G' by CAPA, and the model is converted into another one, which applies to Multistep Decision Process, by MDPMCA. On the base of these two programs, Dynamic Programming algorithm KMPDPA can finally solve the NPC problem-KPCPP. An illustrative example is given to clarify concepts and methods. The accuracy of these algorithms and the relative theories are verified by mathematical language.
ERIC Educational Resources Information Center
Dufner, Hillrey A.; Alexander, Patricia A.
The differential effects of two different types of problem-solving training on the problem-solving abilities of gifted fourth graders were studied. Two successive classes of gifted fourth graders from Weslaco Independent School District (Texas) were pretested with the Coloured Progressive Matrices (CPM) and Thinking Creatively With Pictures…
Teaching Problem-Solving Skills to Nuclear Engineering Students
ERIC Educational Resources Information Center
Waller, E.; Kaye, M. H.
2012-01-01
Problem solving is an essential skill for nuclear engineering graduates entering the workforce. Training in qualitative and quantitative aspects of problem solving allows students to conceptualise and execute solutions to complex problems. Solutions to problems in high consequence fields of study such as nuclear engineering require rapid and…
Using a general problem-solving strategy to promote transfer.
Youssef-Shalala, Amina; Ayres, Paul; Schubert, Carina; Sweller, John
2014-09-01
Cognitive load theory was used to hypothesize that a general problem-solving strategy based on a make-as-many-moves-as-possible heuristic could facilitate problem solutions for transfer problems. In four experiments, school students were required to learn about a topic through practice with a general problem-solving strategy, through a conventional problem solving strategy or by studying worked examples. In Experiments 1 and 2 using junior high school students learning geometry, low knowledge students in the general problem-solving group scored significantly higher on near or far transfer tests than the conventional problem-solving group. In Experiment 3, an advantage for a general problem-solving group over a group presented worked examples was obtained on far transfer tests using the same curriculum materials, again presented to junior high school students. No differences between conditions were found in Experiments 1, 2, or 3 using test problems similar to the acquisition problems. Experiment 4 used senior high school students studying economics and found the general problem-solving group scored significantly higher than the conventional problem-solving group on both similar and transfer tests. It was concluded that the general problem-solving strategy was helpful for novices, but not for students that had access to domain-specific knowledge.
Decision making and problem solving with computer assistance
NASA Technical Reports Server (NTRS)
Kraiss, F.
1980-01-01
In modern guidance and control systems, the human as manager, supervisor, decision maker, problem solver and trouble shooter, often has to cope with a marginal mental workload. To improve this situation, computers should be used to reduce the operator from mental stress. This should not solely be done by increased automation, but by a reasonable sharing of tasks in a human-computer team, where the computer supports the human intelligence. Recent developments in this area are summarized. It is shown that interactive support of operator by intelligent computer is feasible during information evaluation, decision making and problem solving. The applied artificial intelligence algorithms comprehend pattern recognition and classification, adaptation and machine learning as well as dynamic and heuristic programming. Elementary examples are presented to explain basic principles.
Deterministic algorithm with agglomerative heuristic for location problems
NASA Astrophysics Data System (ADS)
Kazakovtsev, L.; Stupina, A.
2015-10-01
Authors consider the clustering problem solved with the k-means method and p-median problem with various distance metrics. The p-median problem and the k-means problem as its special case are most popular models of the location theory. They are implemented for solving problems of clustering and many practically important logistic problems such as optimal factory or warehouse location, oil or gas wells, optimal drilling for oil offshore, steam generators in heavy oil fields. Authors propose new deterministic heuristic algorithm based on ideas of the Information Bottleneck Clustering and genetic algorithms with greedy heuristic. In this paper, results of running new algorithm on various data sets are given in comparison with known deterministic and stochastic methods. New algorithm is shown to be significantly faster than the Information Bottleneck Clustering method having analogous preciseness.
ERIC Educational Resources Information Center
Fede, Jessica L.
2010-01-01
This research investigation examined the effects of "GO Solve Word Problems" math intervention on problem-solving skills of struggling 5th grade students. In a randomized controlled study, 16 5th grade students were given a 12-week intervention of "GO Solve", a computer-based program designed to teach schema-based instruction…
Building and Solving Odd-One-Out Classification Problems: A Systematic Approach
ERIC Educational Resources Information Center
Ruiz, Philippe E.
2011-01-01
Classification problems ("find the odd-one-out") are frequently used as tests of inductive reasoning to evaluate human or animal intelligence. This paper introduces a systematic method for building the set of all possible classification problems, followed by a simple algorithm for solving the problems of the R-ASCM, a psychometric test derived…
The relationship between students' problem solving frames and epistemological beliefs
NASA Astrophysics Data System (ADS)
Wampler, Wendi N.
Introductory undergraduate physics courses aim to help students develop the skills and strategies necessary to solve complex, real world problems, but many students not only leave these courses with serious gaps in their conceptual understanding, but also maintain a novice-like approach to solving problems. Matter and Interactions [M&I] is a curriculum that focuses on a restructuring of physics content knowledge and emphasizes a systematic approach to problem solving, called modeling, which involves the application physical principles to carefully defined systems of objects and interactions (Chabay and Sherwood, 2007a). Because the M&I approach to problem solving is different from many students' previous physics experience, efforts need to be made to attend to their epistemological beliefs and expectations about not only learning physics content knowledge, but problem solving as well. If a student frames solving physics problems as a `plug and chug' type activity, then they are going continue practicing this strategy. Thus, it is important to address students' epistemological beliefs and monitor how they frame the activity of problem solving within the M&I course. This study aims to investigate how students frame problem solving within the context of a large scale implementation of the M&I curriculum, and how, if at all, those frames shift through the semester. By investigating how students frame the act of problem solving in the M&I context, I was able to examine the connection between student beliefs and expectations about problem solving in physics and the skills and strategies used while solving problems in class. To accomplish these goals, I recruited student volunteers from Purdue's introductory, calculus-based physics course and assessed their problem solving approach and espoused epistemological beliefs over the course of a semester. I obtained data through video recordings of the students engaged in small group problem solving during recitation activities
Experimental realization of quantum algorithm for solving linear systems of equations
NASA Astrophysics Data System (ADS)
Pan, Jian; Cao, Yudong; Yao, Xiwei; Li, Zhaokai; Ju, Chenyong; Chen, Hongwei; Peng, Xinhua; Kais, Sabre; Du, Jiangfeng
2014-02-01
Many important problems in science and engineering can be reduced to the problem of solving linear equations. The quantum algorithm discovered recently indicates that one can solve an N-dimensional linear equation in O (logN) time, which provides an exponential speedup over the classical counterpart. Here we report an experimental demonstration of the quantum algorithm when the scale of the linear equation is 2×2 using a nuclear magnetic resonance quantum information processor. For all sets of experiments, the fidelities of the final four-qubit states are all above 96%. This experiment gives the possibility of solving a series of practical problems related to linear systems of equations and can serve as the basis to realize many potential quantum algorithms.
Self-affirmation improves problem-solving under stress.
Creswell, J David; Dutcher, Janine M; Klein, William M P; Harris, Peter R; Levine, John M
2013-01-01
High levels of acute and chronic stress are known to impair problem-solving and creativity on a broad range of tasks. Despite this evidence, we know little about protective factors for mitigating the deleterious effects of stress on problem-solving. Building on previous research showing that self-affirmation can buffer stress, we tested whether an experimental manipulation of self-affirmation improves problem-solving performance in chronically stressed participants. Eighty undergraduates indicated their perceived chronic stress over the previous month and were randomly assigned to either a self-affirmation or control condition. They then completed 30 difficult remote associate problem-solving items under time pressure in front of an evaluator. Results showed that self-affirmation improved problem-solving performance in underperforming chronically stressed individuals. This research suggests a novel means for boosting problem-solving under stress and may have important implications for understanding how self-affirmation boosts academic achievement in school settings.
Feasibility of a Web-Based Assessment of Problem Solving.
ERIC Educational Resources Information Center
Schacter, John; And Others
This feasibility study explored the automated data collection, scoring, and reporting of children's complex problem-solving processes and performance in Web-based information-rich environments. Problem solving was studied using realistic problems in realistic contexts demanding multiple cognitive processes in the domain of environmental science.…
Solving the Sailors and the Coconuts Problem via Diagrammatic Approach
ERIC Educational Resources Information Center
Man, Yiu-Kwong
2010-01-01
In this article, we discuss how to use a diagrammatic approach to solve the classic sailors and the coconuts problem. It provides us an insight on how to tackle this type of problem in a novel and intuitive way. This problem-solving approach will be found useful to mathematics teachers or lecturers involved in teaching elementary number theory,…
A Computer Based Problem Solving Environment in Chemistry
ERIC Educational Resources Information Center
Bilgin, Ibrahim; Karakirik, Erol
2005-01-01
The purpose of this study was to introduce the Mole Solver, a computer based system that facilitates monitors and improves the students' problems solving skills on mole concept. The system has three distinct modes that: i) finds step by step solutions to the word problems on the mole concept ii) enable students' to solve word problems on their own…
A Computer Based Problem Solving Environment in Chemistry
ERIC Educational Resources Information Center
Bilgin, Ibrahim; Karakirik, Erol
2005-01-01
The purpose of this study was to introduce the Mole Solver, a computer based system that facilitates monitors and improves students' problem solving skills on mole concept. The system has three distinct modes that: (1) find step by step solutions to the word problems on the mole concept; (2) enable students to solve word problems on their own by…
Future Problem Solving--One Program Meeting Many Needs.
ERIC Educational Resources Information Center
Hume, Katherine C.
2002-01-01
This article describes the Future Problem Solving Program, a year-long curriculum project with competitive and non-competitive options. The international program involves 250,000 students and is designed to help students enlarge, enrich, and make more accurate their images of the future. Team problem solving and individual problem solving…
Problem-Solving during Shared Reading at Kindergarten
ERIC Educational Resources Information Center
Gosen, Myrte N.; Berenst, Jan; de Glopper, Kees
2015-01-01
This paper reports on a conversation analytic study of problem-solving interactions during shared reading at three kindergartens in the Netherlands. It illustrates how teachers and pupils discuss book characters' problems that arise in the events in the picture books. A close analysis of the data demonstrates that problem-solving interactions do…
A Descriptive Study of Cooperative Problem Solving Introductory Physics Labs
ERIC Educational Resources Information Center
Knutson, Paul Aanond
2011-01-01
The purpose of this study was to determine the ways in which cooperative problem solving in physics instructional laboratories influenced the students' ability to provide qualitative responses to problems. The literature shows that problem solving involves both qualitative and quantitative skills. Qualitative skills are important because those…
A Tool for Helping Veterinary Students Learn Diagnostic Problem Solving.
ERIC Educational Resources Information Center
Danielson, Jared A.; Bender, Holly S.; Mills, Eric M.; Vermeer, Pamela J.; Lockee, Barbara B.
2003-01-01
Describes the result of implementing the Problem List Generator, a computer-based tool designed to help clinical pathology veterinary students learn diagnostic problem solving. Findings suggest that student problem solving ability improved, because students identified all relevant data before providing a solution. (MES)
Theory of Constructions and Set in Problem Solving.
ERIC Educational Resources Information Center
Greeno, James G.; And Others
Hierarchically organized knowledge about actions has been postulated to explain planning in problem solving. Perdix, a simulation of problem solving in geometry with schematic planning knowledge, is described. Perdix' planning knowledge enables it to augment the problem space it is given by constructing auxiliary lines. The planning system also…
Complex Mathematical Problem Solving by Individuals and Dyads.
ERIC Educational Resources Information Center
Vye, Nancy J.; Goldman, Susan R.; Voss, James F.; Hmelo, Cindy; Williams, Susan; Cognition and Technology Group at Vanderbilt University
1997-01-01
Describes two studies of mathematical problem solving using an episode from "The Adventures of Jasper Woodbury," a set of curriculum materials that afford complex problem-solving opportunities. Discussion focuses on characteristics of problems that make solutions difficult, kinds of reasoning that dyadic interactions support, and…
Problem-Solving Support for English Language Learners
ERIC Educational Resources Information Center
Wiest, Lynda R.
2008-01-01
Although word problems pose greater language demands, they also encourage more meaningful problem solving and mathematics understanding. With proper instructional support, a student-centered, investigative approach to contextualized problem solving benefits all students. This article presents a lesson built on an author-adapted version of the…
Glogs as Non-Routine Problem Solving Tools in Mathematics
ERIC Educational Resources Information Center
Devine, Matthew T.
2013-01-01
In mathematical problem solving, American students are falling behind their global peers because of a lack of foundational and reasoning skills. A specific area of difficulty with problem solving is working non-routine, heuristic-based problems. Many students are not provided with effective instruction and often grow frustrated and dislike math.…
Solving Information-Based Problems: Evaluating Sources and Information
ERIC Educational Resources Information Center
Brand-Gruwel, Saskia; Stadtler, Marc
2011-01-01
The focus of this special section is on the processes involved when solving information-based problems. Solving these problems requires from people that they are able to define the information problem, search and select usable and reliable sources and information and synthesise information into a coherent body of knowledge. An important aspect…
Problem Solving Treatment for Intellectually Disabled Sex Offenders
ERIC Educational Resources Information Center
Nezu, Christine Maguth; Fiore, Alicia A.; Nezu, Arthur M.
2006-01-01
Over the past thirty years, Problem Solving Therapy (PST) has been shown to be an effective treatment for many different problems and patient populations (Nezu, 2004). Among its many clinical applications, PST interventions were developed for persons with intellectually disabilities (ID), where improving problem-solving skills led to adaptive…
An Algorithm for Linearly Constrained Nonlinear Programming Programming Problems.
1980-01-01
ALGORITHM FOR LINEARLY CONSTRAINED NONLINEAR PROGRAMMING PROBLEMS Mokhtar S. Bazaraa and Jamie J. Goode In this paper an algorithm for solving a linearly...distance pro- gramr.ing, as in the works of Bazaraa and Goode 12], and Wolfe [16 can be used for solving this problem. Special methods that take advantage of...34 Pacific Journal of Mathematics, Volume 16, pp. 1-3, 1966. 2. M. S. Bazaraa and J. j. Goode, "An Algorithm for Finding the Shortest Element of a
Formulating and Solving Problems in Computational Chemistry.
ERIC Educational Resources Information Center
Norris, A. C.
1980-01-01
Considered are the main elements of computational chemistry problems and how these elements can be used to formulate the problems mathematically. Techniques that are useful in devising an appropriate solution are also considered. (Author/TG)
Strategies in Subtraction Problem Solving in Children
ERIC Educational Resources Information Center
Barrouillet, Pierre; Mignon, Mathilde; Thevenot, Catherine
2008-01-01
The aim of this study was to investigate the strategies used by third graders in solving the 81 elementary subtractions that are the inverses of the one-digit additions with addends from 1 to 9 recently studied by Barrouillet and Lepine. Although the pattern of relationship between individual differences in working memory, on the one hand, and…
Problem-Solving Test: Southwestern Blotting
ERIC Educational Resources Information Center
Szeberényi, József
2014-01-01
Terms to be familiar with before you start to solve the test: Southern blotting, Western blotting, restriction endonucleases, agarose gel electrophoresis, nitrocellulose filter, molecular hybridization, polyacrylamide gel electrophoresis, proto-oncogene, c-abl, Src-homology domains, tyrosine protein kinase, nuclear localization signal, cDNA,…
Graphing as a Problem-Solving Strategy.
ERIC Educational Resources Information Center
Cohen, Donald
1984-01-01
The focus is on how line graphs can be used to approximate solutions to rate problems and to suggest equations that offer exact algebraic solutions to the problem. Four problems requiring progressively greater graphing sophistication are presented plus four exercises. (MNS)
ERIC Educational Resources Information Center
Math Forum @ Drexel, 2009
2009-01-01
Different techniques for understanding a problem can lead to ideas for never-used-before solutions. Good problem-solvers use a problem-solving strategy and may come back to it frequently while they are working on the problem to refine their strategy, see if they can find better solutions, or find other questions. Writing is an integral part of…
Surveying graduate students' attitudes and approaches to problem solving
NASA Astrophysics Data System (ADS)
Mason, Andrew; Singh, Chandralekha
2010-07-01
Students’ attitudes and approaches to problem solving in physics can profoundly influence their motivation to learn and development of expertise. We developed and validated an Attitudes and Approaches to Problem Solving survey by expanding the Attitudes toward Problem Solving survey of Marx and Cummings and administered it to physics graduate students. Comparison of their responses to the survey questions about problem solving in their own graduate-level courses vs problem solving in the introductory physics courses provides insight into their expertise in introductory and graduate-level physics. The physics graduate students’ responses to the survey questions were also compared with those of introductory physics and astronomy students and physics faculty. We find that, even for problem solving in introductory physics, graduate students’ responses to some survey questions are less expertlike than those of the physics faculty. Comparison of survey responses of graduate students and introductory students for problem solving in introductory physics suggests that graduate students’ responses are in general more expertlike than those of introductory students. However, survey responses suggest that graduate-level problem solving by graduate students on several measures has remarkably similar trends to introductory-level problem solving by introductory students.
Applying Lakatos' Theory to the Theory of Mathematical Problem Solving.
ERIC Educational Resources Information Center
Nunokawa, Kazuhiko
1996-01-01
The relation between Lakatos' theory and issues in mathematics education, especially mathematical problem solving, is investigated by examining Lakatos' methodology of a scientific research program. (AIM)
Innovation and problem solving: a review of common mechanisms.
Griffin, Andrea S; Guez, David
2014-11-01
Behavioural innovations have become central to our thinking about how animals adjust to changing environments. It is now well established that animals vary in their ability to innovate, but understanding why remains a challenge. This is because innovations are rare, so studying innovation requires alternative experimental assays that create opportunities for animals to express their ability to invent new behaviours, or use pre-existing ones in new contexts. Problem solving of extractive foraging tasks has been put forward as a suitable experimental assay. We review the rapidly expanding literature on problem solving of extractive foraging tasks in order to better understand to what extent the processes underpinning problem solving, and the factors influencing problem solving, are in line with those predicted, and found, to underpin and influence innovation in the wild. Our aim is to determine whether problem solving can be used as an experimental proxy of innovation. We find that in most respects, problem solving is determined by the same underpinning mechanisms, and is influenced by the same factors, as those predicted to underpin, and to influence, innovation. We conclude that problem solving is a valid experimental assay for studying innovation, propose a conceptual model of problem solving in which motor diversity plays a more central role than has been considered to date, and provide recommendations for future research using problem solving to investigate innovation. This article is part of a Special Issue entitled: Cognition in the wild.
Solving Globally-Optimal Threading Problems in ''Polynomial-Time''
Uberbacher, E.C.; Xu, D.; Xu, Y.
1999-04-12
Computational protein threading is a powerful technique for recognizing native-like folds of a protein sequence from a protein fold database. In this paper, we present an improved algorithm (over our previous work) for solving the globally-optimal threading problem, and illustrate how the computational complexity and the fold recognition accuracy of the algorithm change as the cutoff distance for pairwise interactions changes. For a given fold of m residues and M core secondary structures (or simply cores) and a protein sequence of n residues, the algorithm guarantees to find a sequence-fold alignment (threading) that is globally optimal, measured collectively by (1) the singleton match fitness, (2) pairwise interaction preference, and (3) alignment gap penalties, in O(mn + MnN{sup 1.5C-1}) time and O(mn + nN{sup C-1}) space. C, the topological complexity of a fold as we term, is a value which characterizes the overall structure of the considered pairwise interactions in the fold, which are typically determined by a specified cutoff distance between the beta carbon atoms of a pair of amino acids in the fold. C is typically a small positive integer. N represents the maximum number of possible alignments between an individual core of the fold and the protein sequence when its neighboring cores are already aligned, and its value is significantly less than n. When interacting amino acids are required to see each other, C is bounded from above by a small integer no matter how large the cutoff distance is. This indicates that the protein threading problem is polynomial-time solvable if the condition of seeing each other between interacting amino acids is sufficient for accurate fold recognition. A number of extensions have been made to our basic threading algorithm to allow finding a globally-optimal threading under various constraints, which include consistencies with (1) specified secondary structures (both cores and loops), (2) disulfide bonds, (3) active sites, etc.
Anderson, John R.; Betts, Shawn; Ferris, Jennifer L.; Fincham, Jon M.
2010-01-01
Students were taught an algorithm for solving a new class of mathematical problems. Occasionally in the sequence of problems they encountered exception problems that required that they extend the algorithm. Regular and exception problems were associated with different patterns of brain activation produced. Some regions showed a Cognitive pattern of being active only until the problem was solved and no difference between regular or exception problems. Other regions showed a Metacognitive pattern of greater activity for exception problems and activity that extended into the post-solution period, particularly when an error was made. The Cognitive regions included some of parietal and prefrontal regions associated with the triple-code theory of Dehaene et al (2003) and associated with algebra equation solving in the ACT-R theory (Anderson, 2005). Metacognitive regions included the superior prefrontal gyrus, the angular gyrus of the triple-code theory, and frontopolar regions. PMID:21264650
The role of conceptual understanding in children's addition problem solving.
Canobi, K H; Reeve, R A; Pattison, P E
1998-09-01
The study examined the relationship between children's conceptual understanding and addition problem-solving procedures. Forty-eight 6- to 8-year-olds solved addition problems and, in a 2nd task, were prompted to judge whether a puppet could use the arithmetic properties of one problem to solve the next problem. Relational properties between consecutive problems were manipulated to reflect aspects of additive composition, commutativity, and associativity principles. Conceptual understanding was assessed by the ability to spontaneously use such relational properties in problem solving (Task 1) and to recognize and explain them when prompted (Task 2). Results revealed that conceptual understanding was related to using order-indifferent, decomposition, and retrieval strategies and speed and accuracy in solving unrelated problems. The importance of conceptual understanding for addition development is discussed.
Quantum algorithms for the ordered search problem via semidefinite programming
Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A.
2007-03-15
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log{sub 2} N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for the ordered search problem in terms of a semidefinite program, we find quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log{sub 605} N{approx_equal}0.433 log{sub 2} N queries, which improves upon the previously best known exact algorithm.
Multiagent optimization system for solving the traveling salesman problem (TSP).
Xie, Xiao-Feng; Liu, Jiming
2009-04-01
The multiagent optimization system (MAOS) is a nature-inspired method, which supports cooperative search by the self-organization of a group of compact agents situated in an environment with certain sharing public knowledge. Moreover, each agent in MAOS is an autonomous entity with personal declarative memory and behavioral components. In this paper, MAOS is refined for solving the traveling salesman problem (TSP), which is a classic hard computational problem. Based on a simplified MAOS version, in which each agent manipulates on extremely limited declarative knowledge, some simple and efficient components for solving TSP, including two improving heuristics based on a generalized edge assembly recombination, are implemented. Compared with metaheuristics in adaptive memory programming, MAOS is particularly suitable for supporting cooperative search. The experimental results on two TSP benchmark data sets show that MAOS is competitive as compared with some state-of-the-art algorithms, including the Lin-Kernighan-Helsgaun, IBGLK, PHGA, etc., although MAOS does not use any explicit local search during the runtime. The contributions of MAOS components are investigated. It indicates that certain clues can be positive for making suitable selections before time-consuming computation. More importantly, it shows that the cooperative search of agents can achieve an overall good performance with a macro rule in the switch mode, which deploys certain alternate search rules with the offline performance in negative correlations. Using simple alternate rules may prevent the high difficulty of seeking an omnipotent rule that is efficient for a large data set.
ERIC Educational Resources Information Center
Pol, Henk J.; Harskamp, Egbert G.; Suhre, Cor J. M.; Goedhart, Martin J.
2009-01-01
This study investigates the effectiveness of computer-delivered hints in relation to problem-solving abilities in two alternative indirect instruction schemes. In one instruction scheme, hints are available to students immediately after they are given a new problem to solve as well as after they have completed the problem. In the other scheme,…
Solving multiple scattering problems in planetary atmospheres
NASA Technical Reports Server (NTRS)
Irvine, W. M.; Lenoble, J.
1974-01-01
Multiple scattering problems, radiative transfer problems in planetary atmospheres within extended visible portion of the spectrum, are examined. The direct and inverse problems and the extinction coefficient are defined, along with other scattering characteristics. Albedos in semi-infinite and finite atmospheres are considered, as well as surface illumination, energy deposition, and polarization. The Eddington approximation figures prominently in the calculations. Precise numerical methods and analytical solutions are included.
Human opinion dynamics: An inspiration to solve complex optimization problems
Kaur, Rishemjit; Kumar, Ritesh; Bhondekar, Amol P.; Kapur, Pawan
2013-01-01
Human interactions give rise to the formation of different kinds of opinions in a society. The study of formations and dynamics of opinions has been one of the most important areas in social physics. The opinion dynamics and associated social structure leads to decision making or so called opinion consensus. Opinion formation is a process of collective intelligence evolving from the integrative tendencies of social influence with the disintegrative effects of individualisation, and therefore could be exploited for developing search strategies. Here, we demonstrate that human opinion dynamics can be utilised to solve complex mathematical optimization problems. The results have been compared with a standard algorithm inspired from bird flocking behaviour and the comparison proves the efficacy of the proposed approach in general. Our investigation may open new avenues towards understanding the collective decision making. PMID:24141795
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…
Inquiry-based problem solving in introductory physics
NASA Astrophysics Data System (ADS)
Koleci, Carolann
What makes problem solving in physics difficult? How do students solve physics problems, and how does this compare to an expert physicist's strategy? Over the past twenty years, physics education research has revealed several differences between novice and expert problem solving. The work of Chi, Feltovich, and Glaser demonstrates that novices tend to categorize problems based on surface features, while experts categorize according to theory, principles, or concepts1. If there are differences between how problems are categorized, then are there differences between how physics problems are solved? Learning more about the problem solving process, including how students like to learn and what is most effective, requires both qualitative and quantitative analysis. In an effort to learn how novices and experts solve introductory electricity problems, a series of in-depth interviews were conducted, transcribed, and analyzed, using both qualitative and quantitative methods. One-way ANOVA tests were performed in order to learn if there are any significant problem solving differences between: (a) novices and experts, (b) genders, (c) students who like to answer questions in class and those who don't, (d) students who like to ask questions in class and those who don't, (e) students employing an interrogative approach to problem solving and those who don't, and (f) those who like physics and those who dislike it. The results of both the qualitative and quantitative methods reveal that inquiry-based problem solving is prevalent among novices and experts, and frequently leads to the correct physics. These findings serve as impetus for the third dimension of this work: the development of Choose Your Own Adventure Physics(c) (CYOAP), an innovative teaching tool in physics which encourages inquiry-based problem solving. 1Chi, M., P. Feltovich, R. Glaser, "Categorization and Representation of Physics Problems by Experts and Novices", Cognitive Science, 5, 121--152 (1981).
Problem Solving and Comprehension. Third Edition.
ERIC Educational Resources Information Center
Whimbey, Arthur; Lochhead, Jack
This book is directed toward increasing students' ability to analyze problems and comprehend what they read and hear. It outlines and illustrates the methods that good problem solvers use in attacking complex ideas, and provides practice in applying these methods to a variety of questions involving comprehension and reasoning. Chapter I includes a…
Problem Solved: How To Coach Cognition.
ERIC Educational Resources Information Center
Krynock, Karoline; Robb, Louise
1999-01-01
When faced with real-world problems, students devise accurate, logical, and creative solutions using skills connecting to different subject areas. Students are intrigued by assignments involving preservation of species and design of environmentally friendly products and transit systems. Problem-based learning depends on coaching, modeling, and…
ERIC Educational Resources Information Center
Schrock, Connie S.
2000-01-01
Contends that students must learn to adopt a lateral way of thinking, which generates multiple solutions, to resolve their problems. Offers examples of heuristics (plans of attack) that students can use to better approach their problems, such as: visualizing the situation, exploring ideas, choosing a strategy, finding a solution, and checking to…
Thinking can cause forgetting: memory dynamics in creative problem solving.
Storm, Benjamin C; Angello, Genna; Bjork, Elizabeth Ligon
2011-09-01
Research on retrieval-induced forgetting has shown that retrieval can cause the forgetting of related or competing items in memory (Anderson, Bjork, & Bjork, 1994). In the present research, we examined whether an analogous phenomenon occurs in the context of creative problem solving. Using the Remote Associates Test (RAT; Mednick, 1962), we found that attempting to generate a novel common associate to 3 cue words caused the forgetting of other strong associates related to those cue words. This problem-solving-induced forgetting effect occurred even when participants failed to generate a viable solution, increased in magnitude when participants spent additional time problem solving, and was positively correlated with problem-solving success on a separate set of RAT problems. These results implicate a role for forgetting in overcoming fixation in creative problem solving.
ERIC Educational Resources Information Center
Ogilvie, C. A.
2009-01-01
Most students struggle when faced with complex and open-ended tasks because the strategies taught in schools and universities simply require finding and applying the correct formulae or strategy to answer well-structured, algorithmic problems. For students to develop their ability to solve ill-structured problems, they must first believe that…
Artificial immune algorithm for multi-depot vehicle scheduling problems
NASA Astrophysics Data System (ADS)
Wu, Zhongyi; Wang, Donggen; Xia, Linyuan; Chen, Xiaoling
2008-10-01
In the fast-developing logistics and supply chain management fields, one of the key problems in the decision support system is that how to arrange, for a lot of customers and suppliers, the supplier-to-customer assignment and produce a detailed supply schedule under a set of constraints. Solutions to the multi-depot vehicle scheduling problems (MDVRP) help in solving this problem in case of transportation applications. The objective of the MDVSP is to minimize the total distance covered by all vehicles, which can be considered as delivery costs or time consumption. The MDVSP is one of nondeterministic polynomial-time hard (NP-hard) problem which cannot be solved to optimality within polynomial bounded computational time. Many different approaches have been developed to tackle MDVSP, such as exact algorithm (EA), one-stage approach (OSA), two-phase heuristic method (TPHM), tabu search algorithm (TSA), genetic algorithm (GA) and hierarchical multiplex structure (HIMS). Most of the methods mentioned above are time consuming and have high risk to result in local optimum. In this paper, a new search algorithm is proposed to solve MDVSP based on Artificial Immune Systems (AIS), which are inspirited by vertebrate immune systems. The proposed AIS algorithm is tested with 30 customers and 6 vehicles located in 3 depots. Experimental results show that the artificial immune system algorithm is an effective and efficient method for solving MDVSP problems.
Solving global environmental problems through technological innovation
Steinberg, M.
1990-03-01
Much of the environment problems arise from the supply and utilization of energy for industrial, transportation and domestic markets. The use of fossil fuels can result in environmental, atmospheric, and terrestrial problems, including organic, acid rain, and global warming hazards. Here I will address the CO{sub 2} global greenhouse problem and touch upon the nuclear industry and its dilemma as well. We recognize the possibility of global natural feedback phenomena which may limit and mitigate anthropomorphic global greenhouse climate change, however, here I am limiting the discussion to anthropomorphic (man made) technological mitigation process as opposed to adaptation which means adapting to change.
Solving multiple scattering problems in planetary atmospheres
NASA Technical Reports Server (NTRS)
Irvine, W. M.; Lenoble, J.
1974-01-01
Definitions are provided of the basic concepts occurring in the solution of multiple scattering problems involving planetary atmospheres and attention is given to aspects of problem characterization. Approaches are considered for finding the answer to a particular problem without the performance of detailed calculations. The characteristics of albedos are investigated, taking into account semiinfinite atmospheres and finite atmospheres. Questions of surface illumination are discussed along with aspects related to energy deposition in the atmosphere, intensity, and polarization. Precise numerical methods are examined and analytical solutions are presented.
Solving the Quadratic Assignment Problems using Parallel ACO with Symmetric Multi Processing
NASA Astrophysics Data System (ADS)
Tsutsui, Shigeyoshi
In this paper, we propose several types of parallel ant colony optimization algorithms with symmetric multi processing for solving the quadratic assignment problem (QAP). These models include the master-slave models and the island models. As a base ant colony optimization algorithm, we used the cunning Ant System (cAS) which showed promising performance our in previous studies. We evaluated each parallel algorithm with a condition that the run time for each parallel algorithm and the base sequential algorithm are the same. The results suggest that using the master-slave model with increased iteration of ant colony optimization algorithms is promising in solving quadratic assignment problems for real or real-like instances.
Solving Infeasibility Problems in Computerized Test Assembly.
ERIC Educational Resources Information Center
Timminga, Ellen
1998-01-01
Discusses problems of diagnosing and repairing infeasible linear-programming models in computerized test assembly. Demonstrates that it is possible to localize the causes of infeasibility, although this is not always easy. (SLD)
Problem Solving and Cognitive Skill Acquisition
1988-02-22
logically, from constraints on the type of material being 7 understood By definiton , the instuctions for a problem in a knowledge-lean task domain contain all...want to cross a river. They find a boat, but it is a very small boat. It will only hold 200 pounds. The men are named Large, Medium and Small. Large...distance river schema). The second subject is also consider several special cases of the generic river crossing problem. In this case, triggering the
A microcomputer algorithm for solving compartmental models involving radionuclide transformations.
Birchall, A
1986-03-01
An algorithm for solving first-order non-recycling compartment models is described. Given the initial amounts of a radioactive material in each compartment and the fundamental transfer rate constants between each compartment, the algorithm gives both the amount of material remaining at any time t and the integrated number of transformations that would occur up to time t. The method is analytical, and consequently, is ideally suited for implementation on a microcomputer. For a typical microcomputer with 64 kilobytes of random access memory, a model containing up to 100 compartments, with any number of interconnecting translocation routes, can be solved in a few seconds; providing that no recycling occurs. An example computer program, written in 30 lines of Microsoft BASIC, is included in an appendix to demonstrate the use of the algorithm. A detailed description is included to show how the algorithm is modified to satisfy the requirements commonly encountered in compartment modelling, for example, continuous intake, partitioning of activity, and transformations from radioactive progeny. Although the algorithm does not solve models involving recycling, it is often possible to represent such cases by a non-recycling model which is mathematically equivalent.
Qin, Yulin; Xiang, Jie; Wang, Rifeng; Zhou, Haiyan; Li, Kuncheng; Zhong, Ning
2012-12-01
Newell and Simon postulated that the basic steps in human problem-solving involve iteratively applying operators to transform the state of the problem to eventually achieve a goal. To check the neural basis of this framework, the present study focused on the basic processes in human heuristic problem-solving that the participants identified the current problem state and then recalled and applied the corresponding heuristic rules to change the problem state. A new paradigm, solving simplified Sudoku puzzles, was developed for an event-related functional magnetic resonance imaging (fMRI) study in problem solving. Regions of interest (ROIs), including the left prefrontal cortex, the bilateral posterior parietal cortex, the anterior cingulated cortex, the bilateral caudate nuclei, the bilateral fusiform, as well as the bilateral frontal eye fields, were found to be involved in the task. To obtain convergent evidence, in addition to traditional statistical analysis, we used the multivariate voxel classification method to check the accuracy of the predictions for the condition of the task from the blood oxygen level dependent (BOLD) response of the ROIs, using a new classifier developed in this study for fMRI data. To reveal the roles that the ROIs play in problem solving, we developed an ACT-R computational model of the information-processing processes in human problem solving, and tried to predict the BOLD response of the ROIs from the task. Advances in human problem-solving research after Newell and Simon are then briefly discussed.