Problem Solving with Combinations.

ERIC Educational Resources Information Center

English, Lyn

1992-01-01

Highlights combinatorial problems appropriate for students aged 4 to 12 years that utilize manipulatives in a hands-on approach. Examines and identifies students' strategies and self-monitoring techniques that produce effective problem solving. (MDH)

A Structured Approach to Teaching Applied Problem Solving through Technology Assessment.

ERIC Educational Resources Information Center

Fischbach, Fritz A.; Sell, Nancy J.

1986-01-01

Describes an approach to problem solving based on real-world problems. Discusses problem analysis and definitions, preparation of briefing documents, solution finding techniques (brainstorming and synectics), solution evaluation and judgment, and implementation. (JM)

"We Definitely Wouldn't Be Able to Solve It All by Ourselves, but Together…": Group Synergy in Tertiary Students' Problem-Solving Practices

ERIC Educational Resources Information Center

Clark, Kathleen; James, Alex; Montelle, Clemency

2014-01-01

The ability to address and solve problems in minimally familiar contexts is the core business of research mathematicians. Recent studies have identified key traits and techniques that individuals exhibit while problem solving, and revealed strategies and behaviours that are frequently invoked in the process. We studied advanced calculus students…

Planning meals: Problem-solving on a real data-base

ERIC Educational Resources Information Center

Byrne, Richard

1977-01-01

Planning the menu for a dinner party, which involves problem-solving with a large body of knowledge, is used to study the daily operation of human memory. Verbal protocol analysis, a technique devised to investigate formal problem-solving, is examined theoretically and adapted for analysis of this task. (Author/MV)

The application of artificial intelligence techniques to large distributed networks

NASA Technical Reports Server (NTRS)

Dubyah, R.; Smith, T. R.; Star, J. L.

1985-01-01

Data accessibility and transfer of information, including the land resources information system pilot, are structured as large computer information networks. These pilot efforts include the reduction of the difficulty to find and use data, reducing processing costs, and minimize incompatibility between data sources. Artificial Intelligence (AI) techniques were suggested to achieve these goals. The applicability of certain AI techniques are explored in the context of distributed problem solving systems and the pilot land data system (PLDS). The topics discussed include: PLDS and its data processing requirements, expert systems and PLDS, distributed problem solving systems, AI problem solving paradigms, query processing, and distributed data bases.

Characterization and Developmental History of Problem Solving Methods in Medicine

PubMed Central

Harbort, Robert A.

1980-01-01

The central thesis of this paper is the importance of the framework in which information is structured. It is technically important in the design of systems; it is also important in guaranteeing that systems are usable by clinicians. Progress in medical computing depends on our ability to develop a more quantitative understanding of the role of context in our choice of problem solving techniques. This in turn will help us to design more flexible and responsive computer systems. The paper contains an overview of some models of knowledge and problem solving methods, a characterization of modern diagnostic techniques, and a discussion of skill development in medical practice. Diagnostic techniques are examined in terms of how they are taught, what problem solving methods they use, and how they fit together into an overall theory of interpretation of the medical status of a patient.

Enhanced algorithms for stochastic programming

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

Krishna, Alamuru S.

1993-09-01

In this dissertation, we present some of the recent advances made in solving two-stage stochastic linear programming problems of large size and complexity. Decomposition and sampling are two fundamental components of techniques to solve stochastic optimization problems. We describe improvements to the current techniques in both these areas. We studied different ways of using importance sampling techniques in the context of Stochastic programming, by varying the choice of approximation functions used in this method. We have concluded that approximating the recourse function by a computationally inexpensive piecewise-linear function is highly efficient. This reduced the problem from finding the mean ofmore » a computationally expensive functions to finding that of a computationally inexpensive function. Then we implemented various variance reduction techniques to estimate the mean of a piecewise-linear function. This method achieved similar variance reductions in orders of magnitude less time than, when we directly applied variance-reduction techniques directly on the given problem. In solving a stochastic linear program, the expected value problem is usually solved before a stochastic solution and also to speed-up the algorithm by making use of the information obtained from the solution of the expected value problem. We have devised a new decomposition scheme to improve the convergence of this algorithm.« less

A Cognitive Analysis of Students’ Mathematical Problem Solving Ability on Geometry

NASA Astrophysics Data System (ADS)

Rusyda, N. A.; Kusnandi, K.; Suhendra, S.

2017-09-01

The purpose of this research is to analyze of mathematical problem solving ability of students in one of secondary school on geometry. This research was conducted by using quantitative approach with descriptive method. Population in this research was all students of that school and the sample was twenty five students that was chosen by purposive sampling technique. Data of mathematical problem solving were collected through essay test. The results showed the percentage of achievement of mathematical problem solving indicators of students were: 1) solve closed mathematical problems with context in math was 50%; 2) solve the closed mathematical problems with the context beyond mathematics was 24%; 3) solving open mathematical problems with contexts in mathematics was 35%; And 4) solving open mathematical problems with contexts outside mathematics was 44%. Based on the percentage, it can be concluded that the level of achievement of mathematical problem solving ability in geometry still low. This is because students are not used to solving problems that measure mathematical problem solving ability, weaknesses remember previous knowledge, and lack of problem solving framework. So the students’ ability of mathematical problems solving need to be improved with implement appropriate learning strategy.

Evaluation of a transfinite element numerical solution method for nonlinear heat transfer problems

NASA Technical Reports Server (NTRS)

Cerro, J. A.; Scotti, S. J.

1991-01-01

Laplace transform techniques have been widely used to solve linear, transient field problems. A transform-based algorithm enables calculation of the response at selected times of interest without the need for stepping in time as required by conventional time integration schemes. The elimination of time stepping can substantially reduce computer time when transform techniques are implemented in a numerical finite element program. The coupling of transform techniques with spatial discretization techniques such as the finite element method has resulted in what are known as transfinite element methods. Recently attempts have been made to extend the transfinite element method to solve nonlinear, transient field problems. This paper examines the theoretical basis and numerical implementation of one such algorithm, applied to nonlinear heat transfer problems. The problem is linearized and solved by requiring a numerical iteration at selected times of interest. While shown to be acceptable for weakly nonlinear problems, this algorithm is ineffective as a general nonlinear solution method.

Alternative Constraint Handling Technique for Four-Bar Linkage Path Generation

NASA Astrophysics Data System (ADS)

Sleesongsom, S.; Bureerat, S.

2018-03-01

This paper proposes an extension of a new concept for path generation from our previous work by adding a new constraint handling technique. The propose technique was initially designed for problems without prescribed timing by avoiding the timing constraint, while remain constraints are solving with a new constraint handling technique. The technique is one kind of penalty technique. The comparative study is optimisation of path generation problems are solved using self-adaptive population size teaching-learning based optimization (SAP-TLBO) and original TLBO. In this study, two traditional path generation test problem are used to test the proposed technique. The results show that the new technique can be applied with the path generation problem without prescribed timing and gives better results than the previous technique. Furthermore, SAP-TLBO outperforms the original one.

Visual Attention for Solving Multiple-Choice Science Problem: An Eye-Tracking Analysis

ERIC Educational Resources Information Center

Tsai, Meng-Jung; Hou, Huei-Tse; Lai, Meng-Lung; Liu, Wan-Yi; Yang, Fang-Ying

2012-01-01

This study employed an eye-tracking technique to examine students' visual attention when solving a multiple-choice science problem. Six university students participated in a problem-solving task to predict occurrences of landslide hazards from four images representing four combinations of four factors. Participants' responses and visual attention…

Research Utilizing Problem Solving (RUPS) - Classroom Version. Description of Teacher Inservice Education Materials.

ERIC Educational Resources Information Center

National Education Association, Washington, DC. Project on Utilization of Inservice Education R & D Outcomes.

The workshop instructional materials described here are designed to try out a systematic problem solving process as a way of working toward improvements in the school setting. Topics include diagnosis using force field technique, small group dynamics, planning for action, and planning a RUPS (Research Using Problem Solving) project. This…

Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem.

PubMed

Rajeswari, M; Amudhavel, J; Pothula, Sujatha; Dhavachelvan, P

2017-01-01

The Nurse Rostering Problem is an NP-hard combinatorial optimization, scheduling problem for assigning a set of nurses to shifts per day by considering both hard and soft constraints. A novel metaheuristic technique is required for solving Nurse Rostering Problem (NRP). This work proposes a metaheuristic technique called Directed Bee Colony Optimization Algorithm using the Modified Nelder-Mead Method for solving the NRP. To solve the NRP, the authors used a multiobjective mathematical programming model and proposed a methodology for the adaptation of a Multiobjective Directed Bee Colony Optimization (MODBCO). MODBCO is used successfully for solving the multiobjective problem of optimizing the scheduling problems. This MODBCO is an integration of deterministic local search, multiagent particle system environment, and honey bee decision-making process. The performance of the algorithm is assessed using the standard dataset INRC2010, and it reflects many real-world cases which vary in size and complexity. The experimental analysis uses statistical tools to show the uniqueness of the algorithm on assessment criteria.

Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem

PubMed Central

Amudhavel, J.; Pothula, Sujatha; Dhavachelvan, P.

2017-01-01

The Nurse Rostering Problem is an NP-hard combinatorial optimization, scheduling problem for assigning a set of nurses to shifts per day by considering both hard and soft constraints. A novel metaheuristic technique is required for solving Nurse Rostering Problem (NRP). This work proposes a metaheuristic technique called Directed Bee Colony Optimization Algorithm using the Modified Nelder-Mead Method for solving the NRP. To solve the NRP, the authors used a multiobjective mathematical programming model and proposed a methodology for the adaptation of a Multiobjective Directed Bee Colony Optimization (MODBCO). MODBCO is used successfully for solving the multiobjective problem of optimizing the scheduling problems. This MODBCO is an integration of deterministic local search, multiagent particle system environment, and honey bee decision-making process. The performance of the algorithm is assessed using the standard dataset INRC2010, and it reflects many real-world cases which vary in size and complexity. The experimental analysis uses statistical tools to show the uniqueness of the algorithm on assessment criteria. PMID:28473849

Understanding the determinants of problem-solving behavior in a complex environment

NASA Technical Reports Server (NTRS)

Casner, Stephen A.

1994-01-01

It is often argued that problem-solving behavior in a complex environment is determined as much by the features of the environment as by the goals of the problem solver. This article explores a technique to determine the extent to which measured features of a complex environment influence problem-solving behavior observed within that environment. In this study, the technique is used to determine how complex flight deck and air traffic control environment influences the strategies used by airline pilots when controlling the flight path of a modern jetliner. Data collected aboard 16 commercial flights are used to measure selected features of the task environment. A record of the pilots' problem-solving behavior is analyzed to determine to what extent behavior is adapted to the environmental features that were measured. The results suggest that the measured features of the environment account for as much as half of the variability in the pilots' problem-solving behavior and provide estimates on the probable effects of each environmental feature.

Resonance line transfer calculations by doubling thin layers. I - Comparison with other techniques. II - The use of the R-parallel redistribution function. [planetary atmospheres

NASA Technical Reports Server (NTRS)

Yelle, Roger V.; Wallace, Lloyd

1989-01-01

A versatile and efficient technique for the solution of the resonance line scattering problem with frequency redistribution in planetary atmospheres is introduced. Similar to the doubling approach commonly used in monochromatic scattering problems, the technique has been extended to include the frequency dependence of the radiation field. Methods for solving problems with external or internal sources and coupled spectral lines are presented, along with comparison of some sample calculations with results from Monte Carlo and Feautrier techniques. The doubling technique has also been applied to the solution of resonance line scattering problems where the R-parallel redistribution function is appropriate, both neglecting and including polarization as developed by Yelle and Wallace (1989). With the constraint that the atmosphere is illuminated from the zenith, the only difficulty of consequence is that of performing precise frequency integrations over the line profiles. With that problem solved, it is no longer necessary to use the Monte Carlo method to solve this class of problem.

Primal-dual techniques for online algorithms and mechanisms

NASA Astrophysics Data System (ADS)

Liaghat, Vahid

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

Neighboring extremals of dynamic optimization problems with path equality constraints

NASA Technical Reports Server (NTRS)

Lee, A. Y.

1988-01-01

Neighboring extremals of dynamic optimization problems with path equality constraints and with an unknown parameter vector are considered in this paper. With some simplifications, the problem is reduced to solving a linear, time-varying two-point boundary-value problem with integral path equality constraints. A modified backward sweep method is used to solve this problem. Two example problems are solved to illustrate the validity and usefulness of the solution technique.

How to Solve Polyhedron Problem?

NASA Astrophysics Data System (ADS)

Wijayanti, A.; Kusumah, Y. S.; Suhendra

2017-09-01

The purpose of this research is to know the possible strategies to solve the problem in polyhedron topic with Knilsey’s Learning Model as scaffolding for the student. This research was conducted by using mixed method with sequential explanatory design. Researchers used purposive sampling technique to get two classes for Knisley class and conventional class and an extreme case sampling technique to get interview data. The instruments used are tests, observation sheets and interview guidelines. The result of the research shows that: (1) students’ strategies to solve polyhedron problem were grouped into two steps: by partitioning the problem to find out the solution and make a mathematical model of the mathematical sentence given and then connect it with the concept that the students already know; (2) students ‘mathematical problem solving ability in Knisley class is higher than those in conventional class.

The effects of using diagramming as a representational technique on high school students' achievement in solving math word problems

NASA Astrophysics Data System (ADS)

Banerjee, Banmali

Methods and procedures for successfully solving math word problems have been, and continue to be a mystery to many U.S. high school students. Previous studies suggest that the contextual and mathematical understanding of a word problem, along with the development of schemas and their related external representations, positively contribute to students' accomplishments when solving word problems. Some studies have examined the effects of diagramming on students' abilities to solve word problems that only involved basic arithmetic operations. Other studies have investigated how instructional models that used technology influenced students' problem solving achievements. Still other studies have used schema-based instruction involving students with learning disabilities. No study has evaluated regular high school students' achievements in solving standard math word problems using a diagramming technique without technological aid. This study evaluated students' achievement in solving math word problems using a diagramming technique. Using a quasi-experimental experimental pretest-posttest research design, quantitative data were collected from 172 grade 11 Hispanic English language learners (ELLS) and African American learners whose first language is English (EFLLs) in 18 classes at an inner city high school in Northern New Jersey. There were 88 control and 84 experimental students. The pretest and posttest of each participating student and samples of the experimental students' class assignments provided the qualitative data for the study. The data from this study exhibited that the diagramming method of solving math word problems significantly improved student achievement in the experimental group (p<.01) compared to the control group. The study demonstrated that urban, high school, ELLs benefited from instruction that placed emphasis on the mathematical vocabulary and symbols used in word problems and that both ELLs and EFLLs improved their problem solving success through careful attention to the creation and labeling of diagrams to represent the mathematics involved in standard word problems. Although Learnertype (ELL, EFLL), Classtype (Bilingual and Mixed), and Gender (Female, Male) were not significant indicators of student achievement, there was significant interaction between Treatment and Classtype at the level of the Bilingual students ( p<.01) and between Treatment and Learnertype at the level of the ELLs (p<.01).

Class and Home Problems: Optimization Problems

ERIC Educational Resources Information Center

Anderson, Brian J.; Hissam, Robin S.; Shaeiwitz, Joseph A.; Turton, Richard

2011-01-01

Optimization problems suitable for all levels of chemical engineering students are available. These problems do not require advanced mathematical techniques, since they can be solved using typical software used by students and practitioners. The method used to solve these problems forces students to understand the trends for the different terms…

Organizational/Memory Tools: A Technique for Improving Problem Solving Skills.

ERIC Educational Resources Information Center

Steinberg, Esther R.; And Others

1986-01-01

This study was conducted to determine whether students would use a computer-presented organizational/memory tool as an aid in problem solving, and whether and how locus of control would affect tool use and problem-solving performance. Learners did use the tools, which were most effective in the learner control with feedback condition. (MBR)

Thinking about Applications: Effects on Mental Models and Creative Problem-Solving

ERIC Educational Resources Information Center

Barrett, Jamie D.; Peterson, David R.; Hester, Kimberly S.; Robledo, Issac C.; Day, Eric A.; Hougen, Dean P.; Mumford, Michael D.

2013-01-01

Many techniques have been used to train creative problem-solving skills. Although the available techniques have often proven to be effective, creative training often discounts the value of thinking about applications. In this study, 248 undergraduates were asked to develop advertising campaigns for a new high-energy soft drink. Solutions to this…

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.

The potential application of the blackboard model of problem solving to multidisciplinary design

NASA Technical Reports Server (NTRS)

Rogers, James L.

1989-01-01

The potential application of the blackboard model of problem solving to multidisciplinary design is discussed. Multidisciplinary design problems are complex, poorly structured, and lack a predetermined decision path from the initial starting point to the final solution. The final solution is achieved using data from different engineering disciplines. Ideally, for the final solution to be the optimum solution, there must be a significant amount of communication among the different disciplines plus intradisciplinary and interdisciplinary optimization. In reality, this is not what happens in today's sequential approach to multidisciplinary design. Therefore it is highly unlikely that the final solution is the true optimum solution from an interdisciplinary optimization standpoint. A multilevel decomposition approach is suggested as a technique to overcome the problems associated with the sequential approach, but no tool currently exists with which to fully implement this technique. A system based on the blackboard model of problem solving appears to be an ideal tool for implementing this technique because it offers an incremental problem solving approach that requires no a priori determined reasoning path. Thus it has the potential of finding a more optimum solution for the multidisciplinary design problems found in today's aerospace industries.

Optimization techniques applied to spectrum management for communications satellites

NASA Astrophysics Data System (ADS)

Ottey, H. R.; Sullivan, T. M.; Zusman, F. S.

This paper describes user requirements, algorithms and software design features for the application of optimization techniques to the management of the geostationary orbit/spectrum resource. Relevant problems include parameter sensitivity analyses, frequency and orbit position assignment coordination, and orbit position allotment planning. It is shown how integer and nonlinear programming as well as heuristic search techniques can be used to solve these problems. Formalized mathematical objective functions that define the problems are presented. Constraint functions that impart the necessary solution bounds are described. A versatile program structure is outlined, which would allow problems to be solved in stages while varying the problem space, solution resolution, objective function and constraints.

Using Approximate Dynamic Programming to Solve the Military Inventory Routing Problem with Direct Delivery

DTIC Science & Technology

2015-03-26

benefit by no longer having to allocate resources to inventory management . When the inventory routing problem is solved , three key decisions are made at...industries rely on the transportation and manage – ment of goods. To aid in understanding the formulation and techniques for solving the military inventory...Using Approximate Dynamic Programming to Solve the Military Inventory Routing Problem with Direct Delivery THESIS MARCH 2015 Rebekah S. McKenna

Is Insight Always the Same? A Protocol Analysis of Insight in Compound Remote Associate Problems

ERIC Educational Resources Information Center

Cranford, Edward A.; Moss, Jarrod

2012-01-01

Compound Remote Associate (CRA) problems have been used to investigate insight problem solving using both behavioral and neuroimaging techniques. However, it is unclear to what extent CRA problems exhibit characteristics of insight such as impasses and restructuring. CRA problem-solving characteristics were examined in a study in which…

Performance of Grey Wolf Optimizer on large scale problems

NASA Astrophysics Data System (ADS)

Gupta, Shubham; Deep, Kusum

2017-01-01

For solving nonlinear continuous problems of optimization numerous nature inspired optimization techniques are being proposed in literature which can be implemented to solve real life problems wherein the conventional techniques cannot be applied. Grey Wolf Optimizer is one of such technique which is gaining popularity since the last two years. The objective of this paper is to investigate the performance of Grey Wolf Optimization Algorithm on large scale optimization problems. The Algorithm is implemented on 5 common scalable problems appearing in literature namely Sphere, Rosenbrock, Rastrigin, Ackley and Griewank Functions. The dimensions of these problems are varied from 50 to 1000. The results indicate that Grey Wolf Optimizer is a powerful nature inspired Optimization Algorithm for large scale problems, except Rosenbrock which is a unimodal function.

Generalizing Backtrack-Free Search: A Framework for Search-Free Constraint Satisfaction

NASA Technical Reports Server (NTRS)

Jonsson, Ari K.; Frank, Jeremy

2000-01-01

Tractable classes of constraint satisfaction problems are of great importance in artificial intelligence. Identifying and taking advantage of such classes can significantly speed up constraint problem solving. In addition, tractable classes are utilized in applications where strict worst-case performance guarantees are required, such as constraint-based plan execution. In this work, we present a formal framework for search-free (backtrack-free) constraint satisfaction. The framework is based on general procedures, rather than specific propagation techniques, and thus generalizes existing techniques in this area. We also relate search-free problem solving to the notion of decision sets and use the result to provide a constructive criterion that is sufficient to guarantee search-free problem solving.

Using Proportional Reasoning to Solve Geometric Problems

ERIC Educational Resources Information Center

Pandiscio, Eric A

2004-01-01

Students solve a geometric problem of measuring polygons with the help of proportional reasoning. Thus the importance of conceptual reasoning is emphasized as a highly efficient technique for teaching and strengthening mathematical content.

Effects of subliminal hints on insight problem solving.

PubMed

Hattori, Masasi; Sloman, Steven A; Orita, Ryo

2013-08-01

Two experiments tested a total of 509 participants on insight problems (the radiation problem and the nine-dot problem). Half of the participants were first exposed to a 1-min movie that included a subliminal hint. The hint raised the solution rate of people who did not recognize it. In addition, the way they solved the problem was affected by the hint. In Experiment 3, a novel technique was introduced to address some methodological concerns raised by Experiments 1 and 2. A total of 80 participants solved the 10-coin problem, and half of them were exposed to a subliminal hint. The hint facilitated solving the problem, and it shortened the solution time. Some implications of subliminal priming for research on and theorizing about insight problem solving are discussed.

Developing Creativity and Problem-Solving Skills of Engineering Students: A Comparison of Web- and Pen-and-Paper-Based Approaches

ERIC Educational Resources Information Center

Valentine, Andrew; Belski, Iouri; Hamilton, Margaret

2017-01-01

Problem-solving is a key engineering skill, yet is an area in which engineering graduates underperform. This paper investigates the potential of using web-based tools to teach students problem-solving techniques without the need to make use of class time. An idea generation experiment involving 90 students was designed. Students were surveyed…

Examination of the Mathematical Problem-Solving Beliefs and Success Levels of Primary School Teacher Candidates through the Variables of Mathematical Success and Gender

ERIC Educational Resources Information Center

Bal, Ayten Pinar

2015-01-01

The aim of this study is to examine the mathematical problem-solving beliefs and problem-solving success levels of primary school teacher candidates through the variables of academic success and gender. The research was designed according to the mixed methods technique in which qualitative and quantitative methods are used together. The working…

A new neural network model for solving random interval linear programming problems.

PubMed

Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza

2017-05-01

This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.

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.

Six Sigma Approach to Improve Stripping Quality of Automotive Electronics Component – a case study

NASA Astrophysics Data System (ADS)

Razali, Noraini Mohd; Murni Mohamad Kadri, Siti; Con Ee, Toh

2018-03-01

Lacking of problem solving skill techniques and cooperation between support groups are the two obstacles that always been faced in actual production line. Inadequate detail analysis and inappropriate technique in solving the problem may cause the repeating issues which may give impact to the organization performance. This study utilizes a well-structured six sigma DMAIC with combination of other problem solving tools to solve product quality problem in manufacturing of automotive electronics component. The study is concentrated at the stripping process, a critical process steps with highest rejection rate that contribute to the scrap and rework performance. The detail analysis is conducted in the analysis phase to identify the actual root cause of the problem. Then several improvement activities are implemented and the results show that the rejection rate due to stripping defect decrease tremendously and the process capability index improved from 0.75 to 1.67. This results prove that the six sigma approach used to tackle the quality problem is substantially effective.

Multiobjective Resource-Constrained Project Scheduling with a Time-Varying Number of Tasks

PubMed Central

Abello, Manuel Blanco

2014-01-01

In resource-constrained project scheduling (RCPS) problems, ongoing tasks are restricted to utilizing a fixed number of resources. This paper investigates a dynamic version of the RCPS problem where the number of tasks varies in time. Our previous work investigated a technique called mapping of task IDs for centroid-based approach with random immigrants (McBAR) that was used to solve the dynamic problem. However, the solution-searching ability of McBAR was investigated over only a few instances of the dynamic problem. As a consequence, only a small number of characteristics of McBAR, under the dynamics of the RCPS problem, were found. Further, only a few techniques were compared to McBAR with respect to its solution-searching ability for solving the dynamic problem. In this paper, (a) the significance of the subalgorithms of McBAR is investigated by comparing McBAR to several other techniques; and (b) the scope of investigation in the previous work is extended. In particular, McBAR is compared to a technique called, Estimation Distribution Algorithm (EDA). As with McBAR, EDA is applied to solve the dynamic problem, an application that is unique in the literature. PMID:24883398

The effectiveness of problem-based learning on students’ problem solving ability in vector analysis course

NASA Astrophysics Data System (ADS)

Mushlihuddin, R.; Nurafifah; Irvan

2018-01-01

The student’s low ability in mathematics problem solving proved to the less effective of a learning process in the classroom. Effective learning was a learning that affects student’s math skills, one of which is problem-solving abilities. Problem-solving capability consisted of several stages: understanding the problem, planning the settlement, solving the problem as planned, re-examining the procedure and the outcome. The purpose of this research was to know: (1) was there any influence of PBL model in improving ability Problem solving of student math in a subject of vector analysis?; (2) was the PBL model effective in improving students’ mathematical problem-solving skills in vector analysis courses? This research was a quasi-experiment research. The data analysis techniques performed from the test stages of data description, a prerequisite test is the normality test, and hypothesis test using the ANCOVA test and Gain test. The results showed that: (1) there was an influence of PBL model in improving students’ math problem-solving abilities in vector analysis courses; (2) the PBL model was effective in improving students’ problem-solving skills in vector analysis courses with a medium category.

Predicting Academic Success of Junior Secondary School Students in Mathematics through Cognitive Style and Problem Solving Technique

ERIC Educational Resources Information Center

Badru, Ademola K.

2015-01-01

This study examined the prediction of academic success of Junior secondary school mathematics students using their cognitive style and problem solving technique. A descriptive survey of correlation type was adopted for this study. A purposive sampling procedure was used to select five Public Junior secondary schools in Ijebu-Ode local government…

School Attendance Problems: Using the TQM Tools To Identify Root Causes.

ERIC Educational Resources Information Center

Weller, L. David

2000-01-01

Deming's principles and TQM problem-solving tools and techniques can be used to solve noninstructional problems such as vandalism, dropouts, and student absenteeism. This case study presents a model for principals to apply to identify root causes, resolve problems, and provide quality outcomes (at reduced cost) in noninstructional areas. (Contains…

Extraction of a group-pair relation: problem-solving relation from web-board documents.

PubMed

Pechsiri, Chaveevan; Piriyakul, Rapepun

2016-01-01

This paper aims to extract a group-pair relation as a Problem-Solving relation, for example a DiseaseSymptom-Treatment relation and a CarProblem-Repair relation, between two event-explanation groups, a problem-concept group as a symptom/CarProblem-concept group and a solving-concept group as a treatment-concept/repair concept group from hospital-web-board and car-repair-guru-web-board documents. The Problem-Solving relation (particularly Symptom-Treatment relation) including the graphical representation benefits non-professional persons by supporting knowledge of primarily solving problems. The research contains three problems: how to identify an EDU (an Elementary Discourse Unit, which is a simple sentence) with the event concept of either a problem or a solution; how to determine a problem-concept EDU boundary and a solving-concept EDU boundary as two event-explanation groups, and how to determine the Problem-Solving relation between these two event-explanation groups. Therefore, we apply word co-occurrence to identify a problem-concept EDU and a solving-concept EDU, and machine-learning techniques to solve a problem-concept EDU boundary and a solving-concept EDU boundary. We propose using k-mean and Naïve Bayes to determine the Problem-Solving relation between the two event-explanation groups involved with clustering features. In contrast to previous works, the proposed approach enables group-pair relation extraction with high accuracy.

Solving Fractional Programming Problems based on Swarm Intelligence

NASA Astrophysics Data System (ADS)

Raouf, Osama Abdel; Hezam, Ibrahim M.

2014-04-01

This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to solve any type of FPPs. The solution results employing the SI algorithms are compared with a number of exact and metaheuristic solution methods used for handling FPPs. Swarm Intelligence can be denoted as an effective technique for solving linear or nonlinear, non-differentiable fractional objective functions. Problems with an optimal solution at a finite point and an unbounded constraint set, can be solved using the proposed approach. Numerical examples are given to show the feasibility, effectiveness, and robustness of the proposed algorithm. The results obtained using the two SI algorithms revealed the superiority of the proposed technique among others in computational time. A better accuracy was remarkably observed in the solution results of the industrial application problems.

The More Things Change the More They Stay the Same

NASA Astrophysics Data System (ADS)

Moore, John W.

1998-01-01

In what year would you guess that these statements appeared in this Journal? Students can be classified as problem oriented or answer oriented. The answer-oriented student ... does little or no reflective thinking. ...To simply work a problem for a student may not be educational at all. The student should be taught the process used in the solution. ...My experience indicates that an answer-oriented attitude can be changed. ...But one can't do much teaching of problem-solving techniques and at the same time get on with the day's lecture. ...Problem-solving technique is a tool of learning. ...To teach it well should be about the most rewarding academic activity. ...A year of stressing methods of problem solving would alter the orientation and motivation of many students we now call poor.

Crime Solving Techniques: Training Bulletin.

ERIC Educational Resources Information Center

Sands, Jack M.

The document is a training bulletin for criminal investigators, explaining the use of probability, logic, lateral thinking, group problem solving, and psychological profiles as methods of solving crimes. One chpater of several pages is devoted to each of the five methods. The use of each method is explained; problems are presented for the user to…

Math Is Not a Problem...When You Know How to Visualize It.

ERIC Educational Resources Information Center

Nelson, Dennis W.

1983-01-01

Visualization is an effective technique for determining exactly what students must do to solve a mathematics problem. Pictures and charts can be used to help children understand which mathematics facts are present and which are missing--an important step toward problem solving. (PP)

The Missing Curriculum in Physics Problem-Solving Education

NASA Astrophysics Data System (ADS)

Williams, Mobolaji

2018-05-01

Physics is often seen as an excellent introduction to science because it allows students to learn not only the laws governing the world around them, but also, through the problems students solve, a way of thinking which is conducive to solving problems outside of physics and even outside of science. In this article, we contest this latter idea and argue that in physics classes, students do not learn widely applicable problem-solving skills because physics education almost exclusively requires students to solve well-defined problems rather than the less-defined problems which better model problem solving outside of a formal class. Using personal, constructed, and the historical accounts of Schrödinger's development of the wave equation and Feynman's development of path integrals, we argue that what is missing in problem-solving education is practice in identifying gaps in knowledge and in framing these knowledge gaps as questions of the kind answerable using techniques students have learned. We discuss why these elements are typically not taught as part of the problem-solving curriculum and end with suggestions on how to incorporate these missing elements into physics classes.

Analysis of problem solving in terms of cognitive style

NASA Astrophysics Data System (ADS)

Anthycamurty, Rr C. C.; Mardiyana; Saputro, D. R. S.

2018-03-01

The purpose of this study was to analyze the problem solving based on the type of cognitive style. Subjects used in this study are students of class X SMK located in Purworejo. The method used in this research is qualitative descriptive. Data collection techniques used in this research is a problem-solving test to determine student problem solving and GEFT to determine the type of cognitive style possessed by students. The result of this research is to determine the mastery of each type in cognitive style, that is Field Independent type and Field Dependent type on problem solving indicator. The impact of this research is the teacher can know the mastery of student problem solving on each type of cognitive style so that teacher can determine the proper way of delivering to student at next meeting.

Lions (Panthera leo) solve, learn, and remember a novel resource acquisition problem.

PubMed

Borrego, Natalia; Dowling, Brian

2016-09-01

The social intelligence hypothesis proposes that the challenges of complex social life bolster the evolution of intelligence, and accordingly, advanced cognition has convergently evolved in several social lineages. Lions (Panthera leo) offer an ideal model system for cognitive research in a highly social species with an egalitarian social structure. We investigated cognition in lions using a novel resource task: the suspended puzzle box. The task required lions (n = 12) to solve a novel problem, learn the techniques used to solve the problem, and remember techniques for use in future trials. The majority of lions demonstrated novel problem-solving and learning; lions (11/12) solved the task, repeated success in multiple trials, and significantly reduced the latency to success across trials. Lions also demonstrated cognitive abilities associated with memory and solved the task after up to a 7-month testing interval. We also observed limited evidence for social facilitation of the task solution. Four of five initially unsuccessful lions achieved success after being partnered with a successful lion. Overall, our results support the presence of cognition associated with novel problem-solving, learning, and memory in lions. To date, our study is only the second experimental investigation of cognition in lions and further supports expanding cognitive research to lions.

The Extension-Reduction Strategy: Activating Prior Knowledge

ERIC Educational Resources Information Center

Sloyer, Cliff W.

2004-01-01

A mathematical problem is solved using the extension-reduction or build it up-tear it down tactic. This technique is implemented in reviving students' earlier knowledge to enable them to apply this knowledge to solving new problems.

Developing material for promoting problem-solving ability through bar modeling technique

NASA Astrophysics Data System (ADS)

Widyasari, N.; Rosiyanti, H.

2018-01-01

This study aimed at developing material for enhancing problem-solving ability through bar modeling technique with thematic learning. Polya’s steps of problem-solving were chosen as the basis of the study. The methods of the study were research and development. The subject of this study were five teen students of the fifth grade of Lab-school FIP UMJ elementary school. Expert review and student’ response analysis were used to collect the data. Furthermore, the data were analyzed using qualitative descriptive and quantitative. The findings showed that material in theme “Selalu Berhemat Energi” was categorized as valid and practical. The validity was measured by using the aspect of language, contents, and graphics. Based on the expert comments, the materials were easy to implement in the teaching-learning process. In addition, the result of students’ response showed that material was both interesting and easy to understand. Thus, students gained more understanding in learning problem-solving.

Artificial Intelligence and the Education of the Learning Disabled.

ERIC Educational Resources Information Center

Halpern, Noemi

1984-01-01

Computer logic is advised for teaching learning disabled children because the computer reduces complicated problems to series of subproblems, then combines solutions of subproblems to solve the initial problem. Seven examples for using the technique are given, including solving verbal math problems. Encourages teachers to learn computer…

Applications of remote sensing to estuarine problems. [estuaries of Chesapeake Bay

NASA Technical Reports Server (NTRS)

Munday, J. C., Jr.

1975-01-01

A variety of siting problems for the estuaries of the lower Chesapeake Bay have been solved with cost beneficial remote sensing techniques. Principal techniques used were repetitive 1:30,000 color photography of dye emitting buoys to map circulation patterns, and investigation of water color boundaries via color and color infrared imagery to scales of 1:120,000. Problems solved included sewage outfall siting, shoreline preservation and enhancement, oil pollution risk assessment, and protection of shellfish beds from dredge operations.

Development and Evaluation of a Casualty Evacuation Model for a European Conflict.

DTIC Science & Technology

1985-12-01

EVAC, the computer code which implements our technique, has been used to solve a series of test problems in less time and requiring less memory than...the order of 1/K the amount of main memory for a K-commodity problem, so it can solve significantly larger problems than MCNF. I . 10 CHAPTER II A...technique may require only half the memory of the general L.P. package [6]. These advances are due to the efficient data structures which have been

Developing creativity and problem-solving skills of engineering students: a comparison of web- and pen-and-paper-based approaches

NASA Astrophysics Data System (ADS)

Valentine, Andrew; Belski, Iouri; Hamilton, Margaret

2017-11-01

Problem-solving is a key engineering skill, yet is an area in which engineering graduates underperform. This paper investigates the potential of using web-based tools to teach students problem-solving techniques without the need to make use of class time. An idea generation experiment involving 90 students was designed. Students were surveyed about their study habits and reported they use electronic-based materials more than paper-based materials while studying, suggesting students may engage with web-based tools. Students then generated solutions to a problem task using either a paper-based template or an equivalent web interface. Students who used the web-based approach performed as well as students who used the paper-based approach, suggesting the technique can be successfully adopted and taught online. Web-based tools may therefore be adopted as supplementary material in a range of engineering courses as a way to increase students' options for enhancing problem-solving skills.

A hybrid nonlinear programming method for design optimization

NASA Technical Reports Server (NTRS)

Rajan, S. D.

1986-01-01

Solutions to engineering design problems formulated as nonlinear programming (NLP) problems usually require the use of more than one optimization technique. Moreover, the interaction between the user (analysis/synthesis) program and the NLP system can lead to interface, scaling, or convergence problems. An NLP solution system is presented that seeks to solve these problems by providing a programming system to ease the user-system interface. A simple set of rules is used to select an optimization technique or to switch from one technique to another in an attempt to detect, diagnose, and solve some potential problems. Numerical examples involving finite element based optimal design of space trusses and rotor bearing systems are used to illustrate the applicability of the proposed methodology.

Density-matrix-based algorithm for solving eigenvalue problems

NASA Astrophysics Data System (ADS)

Polizzi, Eric

2009-03-01

A fast and stable numerical algorithm for solving the symmetric eigenvalue problem is presented. The technique deviates fundamentally from the traditional Krylov subspace iteration based techniques (Arnoldi and Lanczos algorithms) or other Davidson-Jacobi techniques and takes its inspiration from the contour integration and density-matrix representation in quantum mechanics. It will be shown that this algorithm—named FEAST—exhibits high efficiency, robustness, accuracy, and scalability on parallel architectures. Examples from electronic structure calculations of carbon nanotubes are presented, and numerical performances and capabilities are discussed.

With a Little Help from My Friends: Scaffolding Techniques in Problem Solving

ERIC Educational Resources Information Center

Frederick, Michelle L.; Courtney, Scott; Caniglia, Joanne

2014-01-01

The purpose of this study was to explore middle grade mathematics students' uses of scaffolding and its effectiveness in helping students solve non-routine problems. Students were given two different types of scaffolds to support their learning of sixth grade geometry concepts. First, students solved a math task by using a four square graphic…

An efficient method for generalized linear multiplicative programming problem with multiplicative constraints.

PubMed

Zhao, Yingfeng; Liu, Sanyang

2016-01-01

We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.

Blackboard system generator (BSG) - An alternative distributed problem-solving paradigm

NASA Technical Reports Server (NTRS)

Silverman, Barry G.; Feggos, Kostas; Chang, Joseph Shih

1989-01-01

A status review is presented for a generic blackboard-based distributed problem-solving environment in which multiple-agent cooperation can be effected. This environment is organized into a shared information panel, a chairman control panel, and a metaplanning panel. Each panel contains a number of embedded AI techniques that facilitate its operation and that provide heuristics for solving the underlying team-agent decision problem. The status of these panels and heuristics is described along with a number of robustness considerations. The techniques for each of the three panels and for four sets of paradigm-related advances are described, along with selected results from classroom teaching experiments and from three applications.

Numerical techniques in radiative heat transfer for general, scattering, plane-parallel media

NASA Technical Reports Server (NTRS)

Sharma, A.; Cogley, A. C.

1982-01-01

The study of radiative heat transfer with scattering usually leads to the solution of singular Fredholm integral equations. The present paper presents an accurate and efficient numerical method to solve certain integral equations that govern radiative equilibrium problems in plane-parallel geometry for both grey and nongrey, anisotropically scattering media. In particular, the nongrey problem is represented by a spectral integral of a system of nonlinear integral equations in space, which has not been solved previously. The numerical technique is constructed to handle this unique nongrey governing equation as well as the difficulties caused by singular kernels. Example problems are solved and the method's accuracy and computational speed are analyzed.

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.

A multilevel correction adaptive finite element method for Kohn-Sham equation

NASA Astrophysics Data System (ADS)

Hu, Guanghui; Xie, Hehu; Xu, Fei

2018-02-01

In this paper, an adaptive finite element method is proposed for solving Kohn-Sham equation with the multilevel correction technique. In the method, the Kohn-Sham equation is solved on a fixed and appropriately coarse mesh with the finite element method in which the finite element space is kept improving by solving the derived boundary value problems on a series of adaptively and successively refined meshes. A main feature of the method is that solving large scale Kohn-Sham system is avoided effectively, and solving the derived boundary value problems can be handled efficiently by classical methods such as the multigrid method. Hence, the significant acceleration can be obtained on solving Kohn-Sham equation with the proposed multilevel correction technique. The performance of the method is examined by a variety of numerical experiments.

Thinking in Terms of Sensors: Personification of Self as an Object in Physics Problem Solving

ERIC Educational Resources Information Center

Tabor-Morris, A. E.

2015-01-01

How can physics teachers help students develop consistent problem solving techniques for both simple and complicated physics problems, such as those that encompass objects undergoing multiple forces (mechanical or electrical) as individually portrayed in free-body diagrams and/or phenomenon involving multiple objects, such as Doppler effect…

Factors Influencing Mathematic Problem-Solving Ability of Sixth Grade Students

ERIC Educational Resources Information Center

Pimta, Sakorn; Tayraukham, Sombat; Nuangchalerm, Prasart

2009-01-01

Problem statement: This study aims to investigate factors influencing mathematic problem-solving ability of sixth grade students. One thousand and twenty eight of sixth grade students, studying in the second semester of academic year 2007 were sampled by stratified random sampling technique. Approach: The research instruments used in the study…

Why and How We Made a Problem Oriented AV Teaching Unit for Chemistry Students.

ERIC Educational Resources Information Center

Mulder, T. H. M.; Verdonk, A. H.

1984-01-01

Describes an audiovisual teaching unit on the chemical laboratory technique of recrystallization which was developed along problem-solving lines and based on observation of student laboratory behavior. Discussion includes usual procedures for developing such units, how this unit solves problems typically associated with teaching, and its general…

SOFIA's Choice: Automating the Scheduling of Airborne Observations

NASA Technical Reports Server (NTRS)

Frank, Jeremy; Norvig, Peter (Technical Monitor)

1999-01-01

This paper describes the problem of scheduling observations for an airborne telescope. Given a set of prioritized observations to choose from, and a wide range of complex constraints governing legitimate choices and orderings, how can we efficiently and effectively create a valid flight plan which supports high priority observations? This problem is quite different from scheduling problems which are routinely solved automatically in industry. For instance, the problem requires making choices which lead to other choices later, and contains many interacting complex constraints over both discrete and continuous variables. Furthermore, new types of constraints may be added as the fundamental problem changes. As a result of these features, this problem cannot be solved by traditional scheduling techniques. The problem resembles other problems in NASA and industry, from observation scheduling for rovers and other science instruments to vehicle routing. The remainder of the paper is organized as follows. In 2 we describe the observatory in order to provide some background. In 3 we describe the problem of scheduling a single flight. In 4 we compare flight planning and other scheduling problems and argue that traditional techniques are not sufficient to solve this problem. We also mention similar complex scheduling problems which may benefit from efforts to solve this problem. In 5 we describe an approach for solving this problem based on research into a similar problem, that of scheduling observations for a space-borne probe. In 6 we discuss extensions of the flight planning problem as well as other problems which are similar to flight planning. In 7 we conclude and discuss future work.

Teaching Creative Problem Solving Methods to Undergraduate Economics and Business Students

ERIC Educational Resources Information Center

Cancer, Vesna

2014-01-01

This paper seeks to explore the need for and possibility of teaching current and potential problem solvers--undergraduate students in the economic and business field to define problems, to generate and choose creative and useful ideas and to verify them. It aims to select an array of quick and easy-to-use creative problem solving (CPS) techniques.…

Transformational and derivational strategies in analogical problem solving.

PubMed

Schelhorn, Sven-Eric; Griego, Jacqueline; Schmid, Ute

2007-03-01

Analogical problem solving is mostly described as transfer of a source solution to a target problem based on the structural correspondences (mapping) between source and target. Derivational analogy (Carbonell, Machine learning: an artificial intelligence approach Los Altos. Morgan Kaufmann, 1986) proposes an alternative view: a target problem is solved by replaying a remembered problem-solving episode. Thus, the experience with the source problem is used to guide the search for the target solution by applying the same solution technique rather than by transferring the complete solution. We report an empirical study using the path finding problems presented in Novick and Hmelo (J Exp Psychol Learn Mem Cogn 20:1296-1321, 1994) as material. We show that both transformational and derivational analogy are problem-solving strategies realized by human problem solvers. Which strategy is evoked in a given problem-solving context depends on the constraints guiding object-to-object mapping between source and target problem. Specifically, if constraints facilitating mapping are available, subjects are more likely to employ a transformational strategy, otherwise they are more likely to use a derivational strategy.

Managing Problems Before Problems Manage You.

PubMed

Grigsby, Jim

2015-01-01

Every day we face problems, both personal and professional, and our initial reaction determines how well we solve those problems. Whether a problem is minor or major, short-term or lingering, there are techniques we can employ to help manage the problem and the problem-solving process. This article, based on my book Don't Tick Off The Gators! Managing Problems Before Problems Manage You, presents 12 different concepts for managing problems, not "cookie cutter" solutions, but different ideas that you can apply as they fit your circumstances.

Heuristics for Cooperative Problem Solving

DTIC Science & Technology

1989-02-01

briefly, cooperation is a very common problem-solving technique in natural systems and occurs in a wide variety of animals ranging from termites and...primitive way with pheromones but sometimes more directly. As with social spiders, they show relatively primitive coordination of behavior. In spite

Problem Solving with Spreadsheets.

ERIC Educational Resources Information Center

Catterall, P.; Lewis, R.

1985-01-01

Documents the educational use of spreadsheets through a description of exploratory work which utilizes spreadsheets to achieve the objectives of Conway's Game of Life, a scientific method game for the development of problem-solving techniques. The implementation and classroom use of the spreadsheet programs are discussed. (MBR)

Mathematics Competency for Beginning Chemistry Students Through Dimensional Analysis.

PubMed

Pursell, David P; Forlemu, Neville Y; Anagho, Leonard E

2017-01-01

Mathematics competency in nursing education and practice may be addressed by an instructional variation of the traditional dimensional analysis technique typically presented in beginning chemistry courses. The authors studied 73 beginning chemistry students using the typical dimensional analysis technique and the variation technique. Student quantitative problem-solving performance was evaluated. Students using the variation technique scored significantly better (18.3 of 20 points, p < .0001) on the final examination quantitative titration problem than those who used the typical technique (10.9 of 20 points). American Chemical Society examination scores and in-house assessment indicate that better performing beginning chemistry students were more likely to use the variation technique rather than the typical technique. The variation technique may be useful as an alternative instructional approach to enhance beginning chemistry students' mathematics competency and problem-solving ability in both education and practice. [J Nurs Educ. 2017;56(1):22-26.]. Copyright 2017, SLACK Incorporated.

Closed-form Static Analysis with Inertia Relief and Displacement-Dependent Loads Using a MSC/NASTRAN DMAP Alter

NASA Technical Reports Server (NTRS)

Barnett, Alan R.; Widrick, Timothy W.; Ludwiczak, Damian R.

1995-01-01

Solving for the displacements of free-free coupled systems acted upon by static loads is commonly performed throughout the aerospace industry. Many times, these problems are solved using static analysis with inertia relief. This solution technique allows for a free-free static analysis by balancing the applied loads with inertia loads generated by the applied loads. For some engineering applications, the displacements of the free-free coupled system induce additional static loads. Hence, the applied loads are equal to the original loads plus displacement-dependent loads. Solving for the final displacements of such systems is commonly performed using iterative solution techniques. Unfortunately, these techniques can be time-consuming and labor-intensive. Since the coupled system equations for free-free systems with displacement-dependent loads can be written in closed-form, it is advantageous to solve for the displacements in this manner. Implementing closed-form equations in static analysis with inertia relief is analogous to implementing transfer functions in dynamic analysis. Using a MSC/NASTRAN DMAP Alter, displacement-dependent loads have been included in static analysis with inertia relief. Such an Alter has been used successfully to solve efficiently a common aerospace problem typically solved using an iterative technique.

Solving large-scale fixed cost integer linear programming models for grid-based location problems with heuristic techniques

NASA Astrophysics Data System (ADS)

Noor-E-Alam, Md.; Doucette, John

2015-08-01

Grid-based location problems (GBLPs) can be used to solve location problems in business, engineering, resource exploitation, and even in the field of medical sciences. To solve these decision problems, an integer linear programming (ILP) model is designed and developed to provide the optimal solution for GBLPs considering fixed cost criteria. Preliminary results show that the ILP model is efficient in solving small to moderate-sized problems. However, this ILP model becomes intractable in solving large-scale instances. Therefore, a decomposition heuristic is proposed to solve these large-scale GBLPs, which demonstrates significant reduction of solution runtimes. To benchmark the proposed heuristic, results are compared with the exact solution via ILP. The experimental results show that the proposed method significantly outperforms the exact method in runtime with minimal (and in most cases, no) loss of optimality.

Chebyshev polynomials in the spectral Tau method and applications to Eigenvalue problems

NASA Technical Reports Server (NTRS)

Johnson, Duane

1996-01-01

Chebyshev Spectral methods have received much attention recently as a technique for the rapid solution of ordinary differential equations. This technique also works well for solving linear eigenvalue problems. Specific detail is given to the properties and algebra of chebyshev polynomials; the use of chebyshev polynomials in spectral methods; and the recurrence relationships that are developed. These formula and equations are then applied to several examples which are worked out in detail. The appendix contains an example FORTRAN program used in solving an eigenvalue problem.

Problem Solving with Guided Repeated Oral Reading Instruction

ERIC Educational Resources Information Center

Conderman, Greg; Strobel, Debra

2006-01-01

Many students with disabilities require specialized instructional interventions and frequent progress monitoring in reading. The guided repeated oral reading technique promotes oral reading fluency while providing a reliable data-based monitoring system. This article emphasizes the importance of problem-solving when using this reading approach.

Learning as a Problem Solving Tool. Technical Report CS74018-R.

ERIC Educational Resources Information Center

Claybrook, Billy G.

This paper explores the use of learning as a practical tool in problem solving. The idea that learning should and eventually will be a vital component of most Artificial Intelligence programs is pursued. Current techniques in learning systems are compared. A detailed discussion of the problems of representing, modifying, and creating heuristics is…

Update: Guidelines for Effective Facilitation of Creative Problem Solving. Part 2.

ERIC Educational Resources Information Center

Firestien, Roger L.; Treffinger, Donald J.

1989-01-01

In this second article of a series, the first three stages of the CPS (Creative Problem Solving) process are described and several facilitation techniques that can be used in each stage are discussed. The three stages discussed (Mess-Finding, Data-Finding, and Problem-Finding) each involve a creative thought and a critical thought phase. (JDD)

Problems in Staff and Educational Development Leadership: Solving, Framing, and Avoiding

ERIC Educational Resources Information Center

Blackmore, Paul; Wilson, Andrew

2005-01-01

Analysis of interviews using critical incident technique with a sample of leaders in staff and educational development in higher education institutions reveals a limited use of classical problem-solving approaches. However, many leaders are able to articulate ways in which they frame problems. Framing has to do with goals, which may be complex,…

An evaluation of the problem-solving ability of diplomates from a comprehensive nursing programme.

PubMed

Makhathini, J T; Uys, L R

1996-10-01

The aim of this South African study was to obtain a measurement of the problem-solving ability of diplomates from a basic nursing programme with this skill included in its programme objectives. The problem-solving skills of diplomates from this programme were compared with those of first years to determine if there is an improvement in the problem-solving skills. A comparison was also made with a different basic programmes not claiming to teach problem-solving. The research design selected for this study was the ex post facto design. Data were collected using the Triple Jump Method which is an interview technique. The findings suggested that the level of the problem-solving skills of the comprehensive nursing programme diplomate is not satisfactory. There was, however, some improvement in the problem-solving ability from the first to the fourth year. The level of performance of the fourth years was slightly higher than that of the third years of the three-year nursing programme, who were used as the control group. Recommendations on selection teaching and evaluation of students, as well as further research, were made.

A numerical projection technique for large-scale eigenvalue problems

NASA Astrophysics Data System (ADS)

Gamillscheg, Ralf; Haase, Gundolf; von der Linden, Wolfgang

2011-10-01

We present a new numerical technique to solve large-scale eigenvalue problems. It is based on the projection technique, used in strongly correlated quantum many-body systems, where first an effective approximate model of smaller complexity is constructed by projecting out high energy degrees of freedom and in turn solving the resulting model by some standard eigenvalue solver. Here we introduce a generalization of this idea, where both steps are performed numerically and which in contrast to the standard projection technique converges in principle to the exact eigenvalues. This approach is not just applicable to eigenvalue problems encountered in many-body systems but also in other areas of research that result in large-scale eigenvalue problems for matrices which have, roughly speaking, mostly a pronounced dominant diagonal part. We will present detailed studies of the approach guided by two many-body models.

Smart Training, Smart Learning: The Role of Cooperative Learning in Training for Youth Services.

ERIC Educational Resources Information Center

Doll, Carol A.

1997-01-01

Examines cooperative learning in youth services and adult education. Discusses characteristics of cooperative learning techniques; specific cooperative learning techniques (brainstorming, mini-lecture, roundtable technique, send-a-problem problem solving, talking chips technique, and three-step interview); and the role of the trainer. (AEF)

A problem-solving approach to effective insulin injection for patients at either end of the body mass index.

PubMed

Juip, Micki; Fitzner, Karen

2012-06-01

People with diabetes require skills and knowledge to adhere to medication regimens and self-manage this complex disease. Effective self-management is contingent upon effective problem solving and decision making. Gaps existed regarding useful approaches to problem solving by individuals with very low and very high body mass index (BMI) who self-administer insulin injections. This article addresses those gaps by presenting findings from a patient survey, a symposium on the topic of problem solving, and recent interviews with diabetes educators to facilitate problem-solving approaches for people with diabetes with high and low BMI who inject insulin and/or other medications. In practice, problem solving involves problem identification, definition, and specification; goal and barrier identification are a prelude to generating a set of potential strategies for problem resolution and applying these strategies to implement a solution. Teaching techniques, such as site rotation and ensuring that people with diabetes use the appropriate equipment, increase confidence with medication adherence. Medication taking is more effective when people with diabetes are equipped with the knowledge, skills, and problem-solving behaviors to effectively self-manage their injections.

The use of Galerkin finite-element methods to solve mass-transport equations

USGS Publications Warehouse

Grove, David B.

1977-01-01

The partial differential equation that describes the transport and reaction of chemical solutes in porous media was solved using the Galerkin finite-element technique. These finite elements were superimposed over finite-difference cells used to solve the flow equation. Both convection and flow due to hydraulic dispersion were considered. Linear and Hermite cubic approximations (basis functions) provided satisfactory results: however, the linear functions were computationally more efficient for two-dimensional problems. Successive over relaxation (SOR) and iteration techniques using Tchebyschef polynomials were used to solve the sparce matrices generated using the linear and Hermite cubic functions, respectively. Comparisons of the finite-element methods to the finite-difference methods, and to analytical results, indicated that a high degree of accuracy may be obtained using the method outlined. The technique was applied to a field problem involving an aquifer contaminated with chloride, tritium, and strontium-90. (Woodard-USGS)

Problem Solving and Learning

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.

Use of model analysis to analyse Thai students’ attitudes and approaches to physics problem solving

NASA Astrophysics Data System (ADS)

Rakkapao, S.; Prasitpong, S.

2018-03-01

This study applies the model analysis technique to explore the distribution of Thai students’ attitudes and approaches to physics problem solving and how those attitudes and approaches change as a result of different experiences in physics learning. We administered the Attitudes and Approaches to Problem Solving (AAPS) survey to over 700 Thai university students from five different levels, namely students entering science, first-year science students, and second-, third- and fourth-year physics students. We found that their inferred mental states were generally mixed. The largest gap between physics experts and all levels of the students was about the role of equations and formulas in physics problem solving, and in views towards difficult problems. Most participants of all levels believed that being able to handle the mathematics is the most important part of physics problem solving. Most students’ views did not change even though they gained experiences in physics learning.

Conceptual Comparison of Population Based Metaheuristics for Engineering Problems

PubMed Central

Green, Paul

2015-01-01

Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems. Several extensions of differential evolution have been adopted in solving constrained and nonconstrained multiobjective optimization problems, but in this study, the third version of generalized differential evolution (GDE) is used for solving practical engineering problems. GDE3 metaheuristic modifies the selection process of the basic differential evolution and extends DE/rand/1/bin strategy in solving practical applications. The performance of the metaheuristic is investigated through engineering design optimization problems and the results are reported. The comparison of the numerical results with those of other metaheuristic techniques demonstrates the promising performance of the algorithm as a robust optimization tool for practical purposes. PMID:25874265

Conceptual comparison of population based metaheuristics for engineering problems.

PubMed

Adekanmbi, Oluwole; Green, Paul

2015-01-01

Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems. Several extensions of differential evolution have been adopted in solving constrained and nonconstrained multiobjective optimization problems, but in this study, the third version of generalized differential evolution (GDE) is used for solving practical engineering problems. GDE3 metaheuristic modifies the selection process of the basic differential evolution and extends DE/rand/1/bin strategy in solving practical applications. The performance of the metaheuristic is investigated through engineering design optimization problems and the results are reported. The comparison of the numerical results with those of other metaheuristic techniques demonstrates the promising performance of the algorithm as a robust optimization tool for practical purposes.

A Computer-Aided Instruction Program for Teaching the TOPS20-MM Facility on the DDN (Defense Data Network)

DTIC Science & Technology

1988-06-01

Continue on reverse if necessary and identify by block number) FIELD GROUP SUB-GROUP Computer Assisted Instruction; Artificial Intelligence 194...while he/she tries to perform given tasks. Means-ends analysis, a classic technique for solving search problems in Artificial Intelligence, has been...he/she tries to perform given tasks. Means-ends analysis, a classic technique for solving search problems in Artificial Intelligence, has been used

A GA based penalty function technique for solving constrained redundancy allocation problem of series system with interval valued reliability of components

NASA Astrophysics Data System (ADS)

Gupta, R. K.; Bhunia, A. K.; Roy, D.

2009-10-01

In this paper, we have considered the problem of constrained redundancy allocation of series system with interval valued reliability of components. For maximizing the overall system reliability under limited resource constraints, the problem is formulated as an unconstrained integer programming problem with interval coefficients by penalty function technique and solved by an advanced GA for integer variables with interval fitness function, tournament selection, uniform crossover, uniform mutation and elitism. As a special case, considering the lower and upper bounds of the interval valued reliabilities of the components to be the same, the corresponding problem has been solved. The model has been illustrated with some numerical examples and the results of the series redundancy allocation problem with fixed value of reliability of the components have been compared with the existing results available in the literature. Finally, sensitivity analyses have been shown graphically to study the stability of our developed GA with respect to the different GA parameters.

Solving deterministic non-linear programming problem using Hopfield artificial neural network and genetic programming techniques

NASA Astrophysics Data System (ADS)

Vasant, P.; Ganesan, T.; Elamvazuthi, I.

2012-11-01

A fairly reasonable result was obtained for non-linear engineering problems using the optimization techniques such as neural network, genetic algorithms, and fuzzy logic independently in the past. Increasingly, hybrid techniques are being used to solve the non-linear problems to obtain better output. This paper discusses the use of neuro-genetic hybrid technique to optimize the geological structure mapping which is known as seismic survey. It involves the minimization of objective function subject to the requirement of geophysical and operational constraints. In this work, the optimization was initially performed using genetic programming, and followed by hybrid neuro-genetic programming approaches. Comparative studies and analysis were then carried out on the optimized results. The results indicate that the hybrid neuro-genetic hybrid technique produced better results compared to the stand-alone genetic programming method.

Group decision-making techniques for natural resource management applications

USGS Publications Warehouse

Coughlan, Beth A.K.; Armour, Carl L.

1992-01-01

This report is an introduction to decision analysis and problem-solving techniques for professionals in natural resource management. Although these managers are often called upon to make complex decisions, their training in the natural sciences seldom provides exposure to the decision-making tools developed in management science. Our purpose is to being to fill this gap. We present a general analysis of the pitfalls of group problem solving, and suggestions for improved interactions followed by the specific techniques. Selected techniques are illustrated. The material is easy to understand and apply without previous training or excessive study and is applicable to natural resource management issues.

A neural network simulation package in CLIPS

NASA Technical Reports Server (NTRS)

Bhatnagar, Himanshu; Krolak, Patrick D.; Mcgee, Brenda J.; Coleman, John

1990-01-01

The intrinsic similarity between the firing of a rule and the firing of a neuron has been captured in this research to provide a neural network development system within an existing production system (CLIPS). A very important by-product of this research has been the emergence of an integrated technique of using rule based systems in conjunction with the neural networks to solve complex problems. The systems provides a tool kit for an integrated use of the two techniques and is also extendible to accommodate other AI techniques like the semantic networks, connectionist networks, and even the petri nets. This integrated technique can be very useful in solving complex AI problems.

Use of Concept Profile Analysis to Identify Difficulties in Solving Science Problems.

ERIC Educational Resources Information Center

Gorodetsky, Malka; Hoz, Ron

1980-01-01

Proposed is a new method for analyzing how concepts are used in the process of problem solving in science. Through the use of a "thinking aloud" interview technique, 21 tenth-grade students worked with a problem concerning the boiling point of water at the Dead Sea. Interview protocols were analyzed to develop students' concept profiles.…

A simple technique to increase profits in wood products marketing

Treesearch

George B. Harpole

1971-01-01

Mathematical models can be used to solve quickly some simple day-to-day marketing problems. This note explains how a sawmill production manager, who has an essentially fixed-capacity mill, can solve several optimization problems by using pencil and paper, a forecast of market prices, and a simple algorithm. One such problem is to maximize profits in an operating period...

The Effects of Using Diagramming as a Representational Technique on High School Students' Achievement in Solving Math Word Problems

ERIC Educational Resources Information Center

Banerjee, Banmali

2010-01-01

Methods and procedures for successfully solving math word problems have been, and continue to be a mystery to many U.S. high school students. Previous studies suggest that the contextual and mathematical understanding of a word problem, along with the development of schemas and their related external representations, positively contribute to…

Structural design using equilibrium programming formulations

NASA Technical Reports Server (NTRS)

Scotti, Stephen J.

1995-01-01

Solutions to increasingly larger structural optimization problems are desired. However, computational resources are strained to meet this need. New methods will be required to solve increasingly larger problems. The present approaches to solving large-scale problems involve approximations for the constraints of structural optimization problems and/or decomposition of the problem into multiple subproblems that can be solved in parallel. An area of game theory, equilibrium programming (also known as noncooperative game theory), can be used to unify these existing approaches from a theoretical point of view (considering the existence and optimality of solutions), and be used as a framework for the development of new methods for solving large-scale optimization problems. Equilibrium programming theory is described, and existing design techniques such as fully stressed design and constraint approximations are shown to fit within its framework. Two new structural design formulations are also derived. The first new formulation is another approximation technique which is a general updating scheme for the sensitivity derivatives of design constraints. The second new formulation uses a substructure-based decomposition of the structure for analysis and sensitivity calculations. Significant computational benefits of the new formulations compared with a conventional method are demonstrated.

Undergraduate Performance in Solving Ill-Defined Biochemistry Problems

ERIC Educational Resources Information Center

Sensibaugh, Cheryl A.; Madrid, Nathaniel J.; Choi, Hye-Jeong; Anderson, William L.; Osgood, Marcy P.

2017-01-01

With growing interest in promoting skills related to the scientific process, we studied performance in solving ill-defined problems demonstrated by graduating biochemistry majors at a public, minority-serving university. As adoption of techniques for facilitating the attainment of higher-order learning objectives broadens, so too does the need to…

A Unified Approach for Solving Nonlinear Regular Perturbation Problems

ERIC Educational Resources Information Center

Khuri, S. A.

2008-01-01

This article describes a simple alternative unified method of solving nonlinear regular perturbation problems. The procedure is based upon the manipulation of Taylor's approximation for the expansion of the nonlinear term in the perturbed equation. An essential feature of this technique is the relative simplicity used and the associated unified…

Fostering and Assessing Creativity in Technology Education

ERIC Educational Resources Information Center

Buelin-Biesecker, Jennifer Katherine

2012-01-01

This study compared the creative outcomes in student work resulting from two pedagogical approaches to creative problem solving activities. A secondary goal was to validate the Consensual Assessment Technique (CAT) as a means of assessing creativity. Linear models for problem solving and design processes serve as the current paradigm in classroom…

Idea Bank: Wiffle Ball Physics

ERIC Educational Resources Information Center

Lancor, Rachael

2009-01-01

Projectile motion, a cornerstone topic of introductory physics, is usually a student's first exposure to the problem-solving techniques used in this subject. Often, this is an inactive learning experience--students work with pencil and paper to read and solve projectile motion problems (e.g., diagrams and descriptions of balls being hit, kicked,…

A non-verbal technique for the assessment of general intellectual ability in selection of aviation personnel.

DOT National Transportation Integrated Search

1971-06-01

A study was conducted in which performance on a non-verbal problem- solving task was correlated with the Otis Quick Scoring Mental Ability Test and the Raven Progressive Matrices Test. The problem-solving task, called 'code- lock' required the subjec...

Improving Problem-Solving Techniques for Students in Low-Performing Schools

ERIC Educational Resources Information Center

Hobbs, Robert Maurice

2012-01-01

Teachers can use culturally relevant pedagogical strategies and technologies as emerging tools to improve students' problem-solving skills. The purpose of this study was to investigate and assess the effectiveness of culturally specific computer-based instructional tasks on ninth-grade African American mathematics students. This study tried to…

The "Iron Inventor": Using Creative Problem Solving to Spur Student Creativity

ERIC Educational Resources Information Center

Lee, Seung Hwan; Hoffman, K. Douglas

2014-01-01

Based on the popular television show the "Iron Chef," an innovative marketing activity called the "Iron Inventor" is introduced. Using the creative problem-solving approach and active learning techniques, the Iron Inventor facilitates student learning pertaining to the step-by-step processes of creating a new product and…

A Problem Solving Model for Use in Science Student Teacher Supervision.

ERIC Educational Resources Information Center

Cavallo, Ann M. L.; Tice, Craig J.

1993-01-01

Describes and suggests the use of a problem-solving model that improves communication between student teachers and supervisors through the student teaching practicum. The aim of the model is to promote experimentation with various teaching techniques and to stimulate thinking among student teachers about their teaching experiences. (PR)

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

Research and applications: Artificial intelligence

NASA Technical Reports Server (NTRS)

Chaitin, L. J.; Duda, R. O.; Johanson, P. A.; Raphael, B.; Rosen, C. A.; Yates, R. A.

1970-01-01

The program is reported for developing techniques in artificial intelligence and their application to the control of mobile automatons for carrying out tasks autonomously. Visual scene analysis, short-term problem solving, and long-term problem solving are discussed along with the PDP-15 simulator, LISP-FORTRAN-MACRO interface, resolution strategies, and cost effectiveness.

Autobiographical memory, interpersonal problem solving, and suicidal behavior in adolescent inpatients.

PubMed

Arie, Miri; Apter, Alan; Orbach, Israel; Yefet, Yael; Zalsman, Gil; Zalzman, Gil

2008-01-01

The aim of the study was to test Williams' (Williams JMG. Depression and the specificity of autobiographical memory. In: Rubin D, ed. Remembering Our Past: Studies in Autobiographical Memory. London: Cambridge University Press; 1996:244-267.) theory of suicidal behavior in adolescents and young adults by examining the relationship among suicidal behaviors, defective ability to retrieve specific autobiographical memories, impaired interpersonal problem solving, negative life events, repression, and hopelessness. Twenty-five suicidal adolescent and young adult inpatients (16.5 y +/- 2.5) were compared with 25 nonsuicidal adolescent and young adult inpatients (16.5 y +/- 2.5) and 25 healthy controls. Autobiographical memory was tested by a word association test; problem solving by the means-ends problem solving technique; negative life events by the Coddington scale; repression by the Life Style Index; hopelessness by the Beck scale; suicidal risk by the Plutchik scale, and suicide attempt by clinical history. Impairment in the ability to produce specific autobiographical memories, difficulties with interpersonal problem solving, negative life events, and repression were all associated with hopelessness and suicidal behavior. There were significant correlations among all the variables except for repression and negative life events. These findings support Williams' notion that generalized autobiographical memory is associated with deficits in interpersonal problem solving, negative life events, hopelessness, and suicidal behavior. The finding that defects in autobiographical memory are associated with suicidal behavior in adolescents and young adults may lead to improvements in the techniques of cognitive behavioral therapy in this age group.

Unconscious processing modulates creative problem solving: evidence from an electrophysiological study.

PubMed

Gao, Ying; Zhang, Hao

2014-05-01

Previous behavioral studies have identified the significant role of subliminal cues in creative problem solving. However, neural mechanisms of such unconscious processing remain poorly understood. Here we utilized an event-related potential (ERP) approach and sandwich mask technique to investigate cerebral activities underlying the unconscious processing of cues in creative problem solving. College students were instructed to solve divergent problems under three different conditions (conscious cue, unconscious cue and no-cue conditions). Our data showed that creative problem solving can benefit from unconscious cues, although not as much as from conscious cues. More importantly, we found that there are crucial ERP components associated with unconscious processing of cues in solving divergent problems. Similar to the processing of conscious cues, processing unconscious cues in problem solving involves the semantic activation of unconscious cues (N280-340) in the right inferior parietal lobule (BA 40), new association formation (P350-450) in the right parahippocampal gyrus (BA 36), and mental representation transformation (P500-760) in the right superior temporal gyrus (BA 22). The present results suggest that creative problem solving can be modulated by unconscious processing of enlightening information that is weakly diffused in the semantic network beyond our conscious awareness. Copyright © 2014 Elsevier Inc. All rights reserved.

Evaluation of a problem-solving (PS) techniques-based intervention for informal carers of patients with dementia receiving in-home care.

PubMed

Chiu, Mary; Pauley, Tim; Wesson, Virginia; Pushpakumar, Dunstan; Sadavoy, Joel

2015-06-01

The value of care provided by informal carers in Canada is estimated at $26 billion annually (Hollander et al., 2009). However, carers' needs are often overlooked, limiting their capacity to provide care. Problem-solving therapy (PST), a structured approach to problem solving (PS) and a core principle of the Reitman Centre CARERS Program, has been shown to alleviate emotional distress and improve carers' competence (Chiu et al., 2013). This study evaluated the effectiveness of problem-solving techniques-based intervention based on adapted PST methods, in enhancing carers' physical and emotional capacity to care for relatives with dementia living in the community. 56 carers were equally allocated to a problem-solving techniques-based intervention group or a control arm. Carers in the intervention group received three 1 hr visits by a care coordinator (CC) who had been given advanced training in PS techniques-based intervention. Coping, mastery, competence, burden, and perceived stress of the carers were evaluated at baseline and post-intervention using standardized assessment tools. An intention-to-treat analysis utilizing repeated measures ANOVA was performed on the data. Post-intervention measures completion rate was 82% and 92% for the intervention and control groups, respectively. Carers in the intervention group showed significantly improved task-oriented coping, mastery, and competence and significantly reduced emotion-oriented coping, burden and stress (p < 0.01-0.001). Control carers showed no change. PS techniques, when learned and delivered by CCs as a tool to coach carers in their day-to-day caregiving, improves carers' caregiving competence, coping, burden, and perceived stress. This may reduce dependence on primary, psychiatric, and institutional care. Results provide evidence that establishing effective partnerships between inter-professional clinicians in academic clinical health science centers, and community agencies can extend the reach of the expertise of specialized health care institutions.

The relationship between parental bonding, social problem solving and eating pathology in an anorexic inpatient sample.

PubMed

Swanson, Helen; Power, Kevin; Collin, Paula; Deas, Suzanne; Paterson, Gillian; Grierson, David; Yellowlees, Alex; Park, Katy; Taylor, Louise

2010-01-01

Parental relationships and maladaptive problem solving have been associated with anorexic symptomatology. This study investigates the relationship between perceived parental bonding, social problem solving and eating psychopathology. Forty three female inpatients with anorexia nervosa and 76 student controls were assessed using the Parental Bonding Instrument, the Social Problem Solving Inventory and the Eating Disorders Examination or the Eating Disorders Examination-Questionnaire. The anorexic group reported significantly lower levels of parental care than the student control group and used more negative and avoidance style coping. In the anorexic group, disordered eating was significantly correlated with low maternal care and high control. Maternal bonding was found to mediate the relationship between avoidance style coping and eating pathology. Findings suggest a relationship between maternal bonding, the use of maladaptive problem solving techniques and eating disorder pathology in inpatients with anorexia nervosa.

The problem solving skills and student generated representations (SGRs) profile of senior high school students in Bandung on the topic of work and energy

NASA Astrophysics Data System (ADS)

Alami, Y.; Sinaga, P.; Setiawan, A.

2018-05-01

Based on recommendations from the Physics Education literature recommend the use of multiple representations to help students solve problems. The use of some good representations is considered important to study physics, so many good motivations to learn how students use multiple representations while solving problems and to learn how to solve problems using multiple representations. This study aims to explore the profile of high school students’ problem solving abilities and this study is part of a larger research focus on improving this ability in students in physics. The data is needed to determine the appropriate treatment to be used in subsequent research. A purposive sampling technique was used in this study and a survey was conducted to collect data. 74 students from one high school in Bandung were involved in this research.

Solution mechanism guide: implementing innovation within a research & development organization.

PubMed

Keeton, Kathryn E; Richard, Elizabeth E; Davis, Jeffrey R

2014-10-01

In order to create a culture more open to novel problem-solving mechanisms, NASA's Human Health and Performance Directorate (HH&P) created a strategic knowledge management tool that educates employees about innovative problem-solving techniques, the Solution Mechanism Guide (SMG). The SMG is a web-based, interactive guide that leverages existing and innovative problem-solving methods and presents this information as a unique user experience so that the employee is empowered to make the best decision about which problem-solving tool best meets their needs. By integrating new and innovative methods with existing problem solving tools, the SMG seamlessly introduces open innovation and collaboration concepts within HH&P to more effectively address human health and performance risks. This commentary reviews the path of creating a more open and innovative culture within HH&P and the process and development steps that were taken to develop the SMG.

Insightful problem solving in an Asian elephant.

PubMed

Foerder, Preston; Galloway, Marie; Barthel, Tony; Moore, Donald E; Reiss, Diana

2011-01-01

The "aha" moment or the sudden arrival of the solution to a problem is a common human experience. Spontaneous problem solving without evident trial and error behavior in humans and other animals has been referred to as insight. Surprisingly, elephants, thought to be highly intelligent, have failed to exhibit insightful problem solving in previous cognitive studies. We tested whether three Asian elephants (Elephas maximus) would use sticks or other objects to obtain food items placed out-of-reach and overhead. Without prior trial and error behavior, a 7-year-old male Asian elephant showed spontaneous problem solving by moving a large plastic cube, on which he then stood, to acquire the food. In further testing he showed behavioral flexibility, using this technique to reach other items and retrieving the cube from various locations to use as a tool to acquire food. In the cube's absence, he generalized this tool utilization technique to other objects and, when given smaller objects, stacked them in an attempt to reach the food. The elephant's overall behavior was consistent with the definition of insightful problem solving. Previous failures to demonstrate this ability in elephants may have resulted not from a lack of cognitive ability but from the presentation of tasks requiring trunk-held sticks as potential tools, thereby interfering with the trunk's use as a sensory organ to locate the targeted food.

A New Homotopy Perturbation Scheme for Solving Singular Boundary Value Problems Arising in Various Physical Models

NASA Astrophysics Data System (ADS)

Roul, Pradip; Warbhe, Ujwal

2017-08-01

The classical homotopy perturbation method proposed by J. H. He, Comput. Methods Appl. Mech. Eng. 178, 257 (1999) is useful for obtaining the approximate solutions for a wide class of nonlinear problems in terms of series with easily calculable components. However, in some cases, it has been found that this method results in slowly convergent series. To overcome the shortcoming, we present a new reliable algorithm called the domain decomposition homotopy perturbation method (DDHPM) to solve a class of singular two-point boundary value problems with Neumann and Robin-type boundary conditions arising in various physical models. Five numerical examples are presented to demonstrate the accuracy and applicability of our method, including thermal explosion, oxygen-diffusion in a spherical cell and heat conduction through a solid with heat generation. A comparison is made between the proposed technique and other existing seminumerical or numerical techniques. Numerical results reveal that only two or three iterations lead to high accuracy of the solution and this newly improved technique introduces a powerful improvement for solving nonlinear singular boundary value problems (SBVPs).

A Comparison of Techniques for Optimal Infrastructure Restoration

DTIC Science & Technology

2014-12-01

to solve incremental network design problems. Álvarez et al. (2014) use a continuous MILP to solve the supply chain network infras- tructure problem...S. Long, T. Shoberg, S. Corns. 2014. A mathe- matical model for supply chain network infrastructure restoration. Y. Guan, H. Liao, eds., Proceedings...Links . . . . . . . . . . . . . . . . . 36 A.5 Use Supply from a Particular Node . . . . . . . . . . . . . . . . . 37 A.6 High Demand with High Building

Honey bee-inspired algorithms for SNP haplotype reconstruction problem

NASA Astrophysics Data System (ADS)

PourkamaliAnaraki, Maryam; Sadeghi, Mehdi

2016-03-01

Reconstructing haplotypes from SNP fragments is an important problem in computational biology. There have been a lot of interests in this field because haplotypes have been shown to contain promising data for disease association research. It is proved that haplotype reconstruction in Minimum Error Correction model is an NP-hard problem. Therefore, several methods such as clustering techniques, evolutionary algorithms, neural networks and swarm intelligence approaches have been proposed in order to solve this problem in appropriate time. In this paper, we have focused on various evolutionary clustering techniques and try to find an efficient technique for solving haplotype reconstruction problem. It can be referred from our experiments that the clustering methods relying on the behaviour of honey bee colony in nature, specifically bees algorithm and artificial bee colony methods, are expected to result in more efficient solutions. An application program of the methods is available at the following link. http://www.bioinf.cs.ipm.ir/software/haprs/

Using Interactive Problem-Solving Techniques to Enhance Control Systems Education for Non English-Speakers

ERIC Educational Resources Information Center

Lamont, L. A.; Chaar, L.; Toms, C.

2010-01-01

Interactive learning is beneficial to students in that it allows the continual development and testing of many skills. An interactive approach enables students to improve their technical capabilities, as well as developing both verbal and written communicative ability. Problem solving and communication skills are vital for engineering students; in…

Elementary School Counselors' Perceptions of Reality Play Counseling in Students' Relationship Building and Problem-Solving Skills

ERIC Educational Resources Information Center

Davis, Eric S.; Clark, Mary Ann

2012-01-01

In this qualitative study, eight school counselors participated in a series of reality play counseling trainings introducing techniques appropriate for counseling upper-grade elementary school students to enhance positive relationship building and problem solving skills. Participants were interviewed and their transcripts were analyzed using…

A Simple Acronym for Doing Calculus: CAL

ERIC Educational Resources Information Center

Hathaway, Richard J.

2008-01-01

An acronym is presented that provides students a potentially useful, unifying view of the major topics covered in an elementary calculus sequence. The acronym (CAL) is based on viewing the calculus procedure for solving a calculus problem P* in three steps: (1) recognizing that the problem cannot be solved using simple (non-calculus) techniques;…

Problem Solving Strategies of Selected Pre-Service Secondary School Mathematics Teachers in Malaysia

ERIC Educational Resources Information Center

Yew, Wun Theam; Zamri, Sharifah Norul Akmar Syed

2016-01-01

Problem solving strategies of eight pre-service secondary school mathematics teachers (PSSMTs) were examined in this study. A case study research design was employed and clinical interview technique was used to collect the data. Materials collected for analysis consisted of audiotapes and videotapes of clinical interviews, subjects' notes and…

Effectiveness of Computer-Assisted STAD Cooperative Learning Strategy on Physics Problem Solving, Achievement and Retention

ERIC Educational Resources Information Center

Gambari, Amosa Isiaka; Yusuf, Mudasiru Olalere

2015-01-01

This study investigated the effectiveness of computer-assisted Students' Team Achievement Division (STAD) cooperative learning strategy on physics problem solving, students' achievement and retention. It also examined if the student performance would vary with gender. Purposive sampling technique was used to select two senior secondary schools…

SCAMPER and Creative Problem Solving in Political Science: Insights from Classroom Observation

ERIC Educational Resources Information Center

Radziszewski, Elizabeth

2017-01-01

This article describes the author's experience using SCAMPER, a creativity-building technique, in a creative problem-solving session that was conducted in an environmental conflict course to generate ideas for managing postconflict stability. SCAMPER relies on cues to help students connect ideas from different domains of knowledge, explore random…

An Appropriate Prompts System Based on the Polya Method for Mathematical Problem-Solving

ERIC Educational Resources Information Center

Lee, Chien I.

2017-01-01

Current mathematics education emphasizes techniques, formulas, and procedures, neglecting the importance of understanding, presentation, and reasoning. This turns students into passive listeners that are well-practiced only in using formulas that they do not understand. We therefore adopted the Polya problem-solving method to provide students with…

Computer-Presented Organizational/Memory Aids as Instruction for Solving Pico-Fomi Problems.

ERIC Educational Resources Information Center

Steinberg, Esther R.; And Others

1985-01-01

Describes investigation of effectiveness of computer-presented organizational/memory aids (matrix and verbal charts controlled by computer or learner) as instructional technique for solving Pico-Fomi problems, and the acquisition of deductive inference rules when such aids are present. Results indicate chart use control should be adapted to…

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

Numerical techniques for solving nonlinear instability problems in smokeless tactical solid rocket motors. [finite difference technique

NASA Technical Reports Server (NTRS)

Baum, J. D.; Levine, J. N.

1980-01-01

The selection of a satisfactory numerical method for calculating the propagation of steep fronted shock life waveforms in a solid rocket motor combustion chamber is discussed. A number of different numerical schemes were evaluated by comparing the results obtained for three problems: the shock tube problems; the linear wave equation, and nonlinear wave propagation in a closed tube. The most promising method--a combination of the Lax-Wendroff, Hybrid and Artificial Compression techniques, was incorporated into an existing nonlinear instability program. The capability of the modified program to treat steep fronted wave instabilities in low smoke tactical motors was verified by solving a number of motor test cases with disturbance amplitudes as high as 80% of the mean pressure.

Naturally selecting solutions: the use of genetic algorithms in bioinformatics.

PubMed

Manning, Timmy; Sleator, Roy D; Walsh, Paul

2013-01-01

For decades, computer scientists have looked to nature for biologically inspired solutions to computational problems; ranging from robotic control to scheduling optimization. Paradoxically, as we move deeper into the post-genomics era, the reverse is occurring, as biologists and bioinformaticians look to computational techniques, to solve a variety of biological problems. One of the most common biologically inspired techniques are genetic algorithms (GAs), which take the Darwinian concept of natural selection as the driving force behind systems for solving real world problems, including those in the bioinformatics domain. Herein, we provide an overview of genetic algorithms and survey some of the most recent applications of this approach to bioinformatics based problems.

Application of evolutionary computation in ECAD problems

NASA Astrophysics Data System (ADS)

Lee, Dae-Hyun; Hwang, Seung H.

1998-10-01

Design of modern electronic system is a complicated task which demands the use of computer- aided design (CAD) tools. Since a lot of problems in ECAD are combinatorial optimization problems, evolutionary computations such as genetic algorithms and evolutionary programming have been widely employed to solve those problems. We have applied evolutionary computation techniques to solve ECAD problems such as technology mapping, microcode-bit optimization, data path ordering and peak power estimation, where their benefits are well observed. This paper presents experiences and discusses issues in those applications.

Non-standard finite difference and Chebyshev collocation methods for solving fractional diffusion equation

NASA Astrophysics Data System (ADS)

Agarwal, P.; El-Sayed, A. A.

2018-06-01

In this paper, a new numerical technique for solving the fractional order diffusion equation is introduced. This technique basically depends on the Non-Standard finite difference method (NSFD) and Chebyshev collocation method, where the fractional derivatives are described in terms of the Caputo sense. The Chebyshev collocation method with the (NSFD) method is used to convert the problem into a system of algebraic equations. These equations solved numerically using Newton's iteration method. The applicability, reliability, and efficiency of the presented technique are demonstrated through some given numerical examples.

Description of Student’s Metacognitive Ability in Understanding and Solving Mathematics Problem

NASA Astrophysics Data System (ADS)

Ahmad, Herlina; Febryanti, Fatimah; Febryanti, Fatimah; Muthmainnah

2018-01-01

This research was conducted qualitative which was aim to describe metacognitive ability to understand and solve the problems of mathematics. The subject of the research was the first year students at computer and networking department of SMK Mega Link Majene. The sample was taken by purposive sampling technique. The data obtained used the research instrument based on the form of students achievements were collected by using test of student’s achievement and interview guidance. The technique of collecting data researcher had observation to ascertain the model that used by teacher was teaching model of developing metacognitive. The technique of data analysis in this research was reduction data, presentation and conclusion. Based on the whole findings in this study it was shown that student’s metacognitive ability generally not develops optimally. It was because of limited scope of the materials, and cognitive teaching strategy handled by verbal presentation and trained continuously in facing cognitive tasks, such as understanding and solving problem.

Knowledge-based control for robot self-localization

NASA Technical Reports Server (NTRS)

Bennett, Bonnie Kathleen Holte

1993-01-01

Autonomous robot systems are being proposed for a variety of missions including the Mars rover/sample return mission. Prior to any other mission objectives being met, an autonomous robot must be able to determine its own location. This will be especially challenging because location sensors like GPS, which are available on Earth, will not be useful, nor will INS sensors because their drift is too large. Another approach to self-localization is required. In this paper, we describe a novel approach to localization by applying a problem solving methodology. The term 'problem solving' implies a computational technique based on logical representational and control steps. In this research, these steps are derived from observing experts solving localization problems. The objective is not specifically to simulate human expertise but rather to apply its techniques where appropriate for computational systems. In doing this, we describe a model for solving the problem and a system built on that model, called localization control and logic expert (LOCALE), which is a demonstration of concept for the approach and the model. The results of this work represent the first successful solution to high-level control aspects of the localization problem.

Towards Solving the Mixing Problem in the Decomposition of Geophysical Time Series by Independent Component Analysis

NASA Technical Reports Server (NTRS)

Aires, Filipe; Rossow, William B.; Chedin, Alain; Hansen, James E. (Technical Monitor)

2000-01-01

The use of the Principal Component Analysis technique for the analysis of geophysical time series has been questioned in particular for its tendency to extract components that mix several physical phenomena even when the signal is just their linear sum. We demonstrate with a data simulation experiment that the Independent Component Analysis, a recently developed technique, is able to solve this problem. This new technique requires the statistical independence of components, a stronger constraint, that uses higher-order statistics, instead of the classical decorrelation a weaker constraint, that uses only second-order statistics. Furthermore, ICA does not require additional a priori information such as the localization constraint used in Rotational Techniques.

Are middle school mathematics teachers able to solve word problems without using variable?

NASA Astrophysics Data System (ADS)

Gökkurt Özdemir, Burçin; Erdem, Emrullah; Örnek, Tuğba; Soylu, Yasin

2018-01-01

Many people consider problem solving as a complex process in which variables such as x, y are used. Problems may not be solved by only using 'variable.' Problem solving can be rationalized and made easier using practical strategies. When especially the development of children at younger ages is considered, it is obvious that mathematics teachers should solve problems through concrete processes. In this context, middle school mathematics teachers' skills to solve word problems without using variables were examined in the current study. Through the case study method, this study was conducted with 60 middle school mathematics teachers who have different professional experiences in five provinces in Turkey. A test consisting of five open-ended word problems was used as the data collection tool. The content analysis technique was used to analyze the data. As a result of the analysis, it was seen that the most of the teachers used trial-and-error strategy or area model as the solution strategy. On the other hand, the teachers who solved the problems using variables such as x, a, n or symbols such as Δ, □, ○, * and who also felt into error by considering these solutions as without variable were also seen in the study.

Solving traveling salesman problems with DNA molecules encoding numerical values.

PubMed

Lee, Ji Youn; Shin, Soo-Yong; Park, Tai Hyun; Zhang, Byoung-Tak

2004-12-01

We introduce a DNA encoding method to represent numerical values and a biased molecular algorithm based on the thermodynamic properties of DNA. DNA strands are designed to encode real values by variation of their melting temperatures. The thermodynamic properties of DNA are used for effective local search of optimal solutions using biochemical techniques, such as denaturation temperature gradient polymerase chain reaction and temperature gradient gel electrophoresis. The proposed method was successfully applied to the traveling salesman problem, an instance of optimization problems on weighted graphs. This work extends the capability of DNA computing to solving numerical optimization problems, which is contrasted with other DNA computing methods focusing on logical problem solving.

[The effects of instruction about strategies for efficient calculation].

PubMed

Suzuki, Masayuki; Ichikawa, Shin'ichi

2016-06-01

Calculation problems such as "12x7÷3" can be solved rapidly and easily by using certain techniques; we call these problems "efficient calculation problems." However, it has been pointed out that many students do not always solve them efficiently. In the present study, we examined the effects of an intervention on 35 seventh grade students (23 males, 12 females). The students were instructed to use an overview strategy that stated, "Think carefully about the whole expression", and were then taught three sub-strategies. The results showed that students solved similar problems efficiently after the intervention and the effects were preserved for five months.

Research and applications: Artificial intelligence

NASA Technical Reports Server (NTRS)

Raphael, B.; Fikes, R. E.; Chaitin, L. J.; Hart, P. E.; Duda, R. O.; Nilsson, N. J.

1971-01-01

A program of research in the field of artificial intelligence is presented. The research areas discussed include automatic theorem proving, representations of real-world environments, problem-solving methods, the design of a programming system for problem-solving research, techniques for general scene analysis based upon television data, and the problems of assembling an integrated robot system. Major accomplishments include the development of a new problem-solving system that uses both formal logical inference and informal heuristic methods, the development of a method of automatic learning by generalization, and the design of the overall structure of a new complete robot system. Eight appendices to the report contain extensive technical details of the work described.

Improvement in Generic Problem-Solving Abilities of Students by Use of Tutor-less Problem-Based Learning in a Large Classroom Setting

PubMed Central

Klegeris, Andis; Bahniwal, Manpreet; Hurren, Heather

2013-01-01

Problem-based learning (PBL) was originally introduced in medical education programs as a form of small-group learning, but its use has now spread to large undergraduate classrooms in various other disciplines. Introduction of new teaching techniques, including PBL-based methods, needs to be justified by demonstrating the benefits of such techniques over classical teaching styles. Previously, we demonstrated that introduction of tutor-less PBL in a large third-year biochemistry undergraduate class increased student satisfaction and attendance. The current study assessed the generic problem-solving abilities of students from the same class at the beginning and end of the term, and compared student scores with similar data obtained in three classes not using PBL. Two generic problem-solving tests of equal difficulty were administered such that students took different tests at the beginning and the end of the term. Blinded marking showed a statistically significant 13% increase in the test scores of the biochemistry students exposed to PBL, while no trend toward significant change in scores was observed in any of the control groups not using PBL. Our study is among the first to demonstrate that use of tutor-less PBL in a large classroom leads to statistically significant improvement in generic problem-solving skills of students. PMID:23463230

Improving mathematical problem solving ability through problem-based learning and authentic assessment for the students of Bali State Polytechnic

NASA Astrophysics Data System (ADS)

Darma, I. K.

2018-01-01

This research is aimed at determining: 1) the differences of mathematical problem solving ability between the students facilitated with problem-based learning model and conventional learning model, 2) the differences of mathematical problem solving ability between the students facilitated with authentic and conventional assessment model, and 3) interaction effect between learning and assessment model on mathematical problem solving. The research was conducted in Bali State Polytechnic, using the 2x2 experiment factorial design. The samples of this research were 110 students. The data were collected using a theoretically and empirically-validated test. Instruments were validated by using Aiken’s approach of technique content validity and item analysis, and then analyzed using anova stylistic. The result of the analysis shows that the students facilitated with problem-based learning and authentic assessment models get the highest score average compared to the other students, both in the concept understanding and mathematical problem solving. The result of hypothesis test shows that, significantly: 1) there is difference of mathematical problem solving ability between the students facilitated with problem-based learning model and conventional learning model, 2) there is difference of mathematical problem solving ability between the students facilitated with authentic assessment model and conventional assessment model, and 3) there is interaction effect between learning model and assessment model on mathematical problem solving. In order to improve the effectiveness of mathematics learning, collaboration between problem-based learning model and authentic assessment model can be considered as one of learning models in class.

The Influence of Science Knowledge Structures on Children's Success in Solving Academic Problems.

ERIC Educational Resources Information Center

Champagne, Audrey B.; And Others

Presented is a study of eighth-grade students' academic problem-solving ability based on their knowledge structures, or their information stored in semantic or long-term memory. The authors describe a technique that they developed to probe knowledge structures with an extension of the card-sort method. The method, known as the Concept Structure…

Problem Solving: Tools and Techniques for the Park and Recreation Administrator. Fourth Edition

ERIC Educational Resources Information Center

Arnold, Margaret L.; Heyne, Linda A.; Busser, James A.

2005-01-01

This book is a useful tool for recreation educators in carrying out their responsibilities for preparing the next generation for effective service in recreation and parks. The need for this book is apparent, because few recreation curricula include courses in problem solving. It is true that many texts dealing with recreation describe policies and…

Application of NASA management approach to solve complex problems on earth

NASA Technical Reports Server (NTRS)

Potate, J. S.

1972-01-01

The application of NASA management approach to solving complex problems on earth is discussed. The management of the Apollo program is presented as an example of effective management techniques. Four key elements of effective management are analyzed. Photographs of the Cape Kennedy launch sites and supporting equipment are included to support the discussions.

Solving Drug-Related Problems in the Professional Experience Program.

ERIC Educational Resources Information Center

Kane, Michael P.; And Others

1993-01-01

A study investigated the effectiveness of using the Pharmacist's Work-up of Drug Therapy (PWDT) in teaching 91 pharmacy students in a clinical clerkship program to identify and solve drug-related problems. Because the instructional technique was recently implemented, the study looked at effects of 3 different quantities of training (0, 1, and 3…

Advanced computational techniques for incompressible/compressible fluid-structure interactions

NASA Astrophysics Data System (ADS)

Kumar, Vinod

2005-07-01

Fluid-Structure Interaction (FSI) problems are of great importance to many fields of engineering and pose tremendous challenges to numerical analyst. This thesis addresses some of the hurdles faced for both 2D and 3D real life time-dependent FSI problems with particular emphasis on parachute systems. The techniques developed here would help improve the design of parachutes and are of direct relevance to several other FSI problems. The fluid system is solved using the Deforming-Spatial-Domain/Stabilized Space-Time (DSD/SST) finite element formulation for the Navier-Stokes equations of incompressible and compressible flows. The structural dynamics solver is based on a total Lagrangian finite element formulation. Newton-Raphson method is employed to linearize the otherwise nonlinear system resulting from the fluid and structure formulations. The fluid and structural systems are solved in decoupled fashion at each nonlinear iteration. While rigorous coupling methods are desirable for FSI simulations, the decoupled solution techniques provide sufficient convergence in the time-dependent problems considered here. In this thesis, common problems in the FSI simulations of parachutes are discussed and possible remedies for a few of them are presented. Further, the effects of the porosity model on the aerodynamic forces of round parachutes are analyzed. Techniques for solving compressible FSI problems are also discussed. Subsequently, a better stabilization technique is proposed to efficiently capture and accurately predict the shocks in supersonic flows. The numerical examples simulated here require high performance computing. Therefore, numerical tools using distributed memory supercomputers with message passing interface (MPI) libraries were developed.

Exploiting Symmetry on Parallel Architectures.

NASA Astrophysics Data System (ADS)

Stiller, Lewis Benjamin

1995-01-01

This thesis describes techniques for the design of parallel programs that solve well-structured problems with inherent symmetry. Part I demonstrates the reduction of such problems to generalized matrix multiplication by a group-equivariant matrix. Fast techniques for this multiplication are described, including factorization, orbit decomposition, and Fourier transforms over finite groups. Our algorithms entail interaction between two symmetry groups: one arising at the software level from the problem's symmetry and the other arising at the hardware level from the processors' communication network. Part II illustrates the applicability of our symmetry -exploitation techniques by presenting a series of case studies of the design and implementation of parallel programs. First, a parallel program that solves chess endgames by factorization of an associated dihedral group-equivariant matrix is described. This code runs faster than previous serial programs, and discovered it a number of results. Second, parallel algorithms for Fourier transforms for finite groups are developed, and preliminary parallel implementations for group transforms of dihedral and of symmetric groups are described. Applications in learning, vision, pattern recognition, and statistics are proposed. Third, parallel implementations solving several computational science problems are described, including the direct n-body problem, convolutions arising from molecular biology, and some communication primitives such as broadcast and reduce. Some of our implementations ran orders of magnitude faster than previous techniques, and were used in the investigation of various physical phenomena.

Solving the Container Stowage Problem (CSP) using Particle Swarm Optimization (PSO)

NASA Astrophysics Data System (ADS)

Matsaini; Santosa, Budi

2018-04-01

Container Stowage Problem (CSP) is a problem of containers arrangement into ships by considering rules such as: total weight, weight of one stack, destination, equilibrium, and placement of containers on vessel. Container stowage problem is combinatorial problem and hard to solve with enumeration technique. It is an NP-Hard Problem. Therefore, to find a solution, metaheuristics is preferred. The objective of solving the problem is to minimize the amount of shifting such that the unloading time is minimized. Particle Swarm Optimization (PSO) is proposed to solve the problem. The implementation of PSO is combined with some steps which are stack position change rules, stack changes based on destination, and stack changes based on the weight type of the stacks (light, medium, and heavy). The proposed method was applied on five different cases. The results were compared to Bee Swarm Optimization (BSO) and heuristics method. PSO provided mean of 0.87% gap and time gap of 60 second. While BSO provided mean of 2,98% gap and 459,6 second to the heuristcs.

The Effect of Metacognitive Instruction on Problem Solving Skills in Iranian Students of Health Sciences

PubMed Central

Safari, Yahya; Meskini, Habibeh

2016-01-01

Background: Learning requires application of such processes as planning, supervision, monitoring and reflection that are included in the metacognition. Studies have shown that metacognition is associated with problem solving skills. The current research was conducted to investigate the impact of metacognitive instruction on students’ problem solving skills. Methods: The study sample included 40 students studying in the second semester at Kermanshah University of Medical Sciences, 2013-2014. They were selected through convenience sampling technique and were randomly assigned into two equal groups of experimental and control. For the experimental group, problem solving skills were taught through metacognitive instruction during ten two-hour sessions and for the control group, problem solving skills were taught via conventional teaching method. The instrument for data collection included problem solving inventory (Heppner, 1988), which was administered before and after instruction. The validity and reliability of the questionnaire had been previously confirmed. The collected data were analyzed by descriptive statistics, mean and standard deviation and the hypotheses were tested by t-test and ANCOVA. Results: The findings of the posttest showed that the total mean scores of problem solving skills in the experimental and control groups were 151.90 and 101.65, respectively, indicating a significant difference between them (p<0.001). This difference was also reported to be statistically significant between problem solving skills and its components, including problem solving confidence, orientation-avoidance coping style and personal control (p<0.001). No significant difference, however, was found between the students’ mean scores in terms of gender and major. Conclusion: Since metacognitive instruction has positive effects on students’ problem solving skills and is required to enhance academic achievement, metacognitive strategies are recommended to be taught to the students. PMID:26234970

The Effect of Metacognitive Instruction on Problem Solving Skills in Iranian Students of Health Sciences.

PubMed

Safari, Yahya; Meskini, Habibeh

2015-05-17

Learning requires application of such processes as planning, supervision, monitoring and reflection that are included in the metacognition. Studies have shown that metacognition is associated with problem solving skills. The current research was conducted to investigate the impact of metacognitive instruction on students' problem solving skills. The study sample included 40 students studying in the second semester at Kermanshah University of Medical Sciences, 2013-2014. They were selected through convenience sampling technique and were randomly assigned into two equal groups of experimental and control. For the experimental group, problem solving skills were taught through metacognitive instruction during ten two-hour sessions and for the control group, problem solving skills were taught via conventional teaching method. The instrument for data collection included problem solving inventory (Heppner, 1988), which was administered before and after instruction. The validity and reliability of the questionnaire had been previously confirmed. The collected data were analyzed by descriptive statistics, mean and standard deviation and the hypotheses were tested by t-test and ANCOVA. The findings of the posttest showed that the total mean scores of problem solving skills in the experimental and control groups were 151.90 and 101.65, respectively, indicating a significant difference between them (p<0.001). This difference was also reported to be statistically significant between problem solving skills and its components, including problem solving confidence, orientation-avoidance coping style and personal control (p<0.001). No significant difference, however, was found between the students' mean scores in terms of gender and major. Since metacognitive instruction has positive effects on students' problem solving skills and is required to enhance academic achievement, metacognitive strategies are recommended to be taught to the students.

A computational algorithm for spacecraft control and momentum management

NASA Technical Reports Server (NTRS)

Dzielski, John; Bergmann, Edward; Paradiso, Joseph

1990-01-01

Developments in the area of nonlinear control theory have shown how coordinate changes in the state and input spaces of a dynamical system can be used to transform certain nonlinear differential equations into equivalent linear equations. These techniques are applied to the control of a spacecraft equipped with momentum exchange devices. An optimal control problem is formulated that incorporates a nonlinear spacecraft model. An algorithm is developed for solving the optimization problem using feedback linearization to transform to an equivalent problem involving a linear dynamical constraint and a functional approximation technique to solve for the linear dynamics in terms of the control. The original problem is transformed into an unconstrained nonlinear quadratic program that yields an approximate solution to the original problem. Two examples are presented to illustrate the results.

Mode Selection Techniques in Variable Mass Flexible Body Modeling

NASA Technical Reports Server (NTRS)

Quiocho, Leslie J.; Ghosh, Tushar K.; Frenkel, David; Huynh, An

2010-01-01

In developing a flexible body spacecraft simulation for the Launch Abort System of the Orion vehicle, when a rapid mass depletion takes place, the dynamics problem with time varying eigenmodes had to be addressed. Three different techniques were implemented, with different trade-offs made between performance and fidelity. A number of technical issues had to be solved in the process. This paper covers the background of the variable mass flexibility problem, the three approaches to simulating it, and the technical issues that were solved in formulating and implementing them.

Why use case studies rather than simulation-gaming techniques or library research?

NASA Technical Reports Server (NTRS)

Mcdonald, S. W.

1981-01-01

Method which present a student with a more challenging and true to life situation of needing to conduct research in a problem solving context--and not thinking about organization of format until research and thinking are complete are investigated. Simulation-gaming techniques which attempt to teach initiative and creativity that library research are used for this purpose. However, it is shown case studies provide the greatest opportunities to engage the students in problem solving situations in which they develop skills as researchers and writers.

Robust operative diagnosis as problem solving in a hypothesis space

NASA Technical Reports Server (NTRS)

Abbott, Kathy H.

1988-01-01

This paper describes an approach that formulates diagnosis of physical systems in operation as problem solving in a hypothesis space. Such a formulation increases robustness by: (1) incremental hypotheses construction via dynamic inputs, (2) reasoning at a higher level of abstraction to construct hypotheses, and (3) partitioning the space by grouping fault hypotheses according to the type of physical system representation and problem solving techniques used in their construction. It was implemented for a turbofan engine and hydraulic subsystem. Evaluation of the implementation on eight actual aircraft accident cases involving engine faults provided very promising results.

An Ada Based Expert System for the Ada Version of SAtool II. Volume 1 and 2

DTIC Science & Technology

1991-06-06

Integrated Computer-Aided Manufacturing (ICAM) (20). In fact, IDEF 0 stands for ICAM Definition Method Zero . IDEF0 defines a subset of SA that omits...reasoning that has been programmed). An expert’s knowledge is specific to one problem domain as opposed to knowledge about general problem-solving...techniques. General problem domains are medicine, finance, science or engineering and so forth in which an expert can solve specific problems very well

The Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Schmuck, Frank Bernhard

1988-01-01

Reliable broadcast protocols are important tools in distributed and fault-tolerant programming. They are useful for sharing information and for maintaining replicated data in a distributed system. However, a wide range of such protocols has been proposed. These protocols differ in their fault tolerance and delivery ordering characteristics. There is a tradeoff between the cost of a broadcast protocol and how much ordering it provides. It is, therefore, desirable to employ protocols that support only a low degree of ordering whenever possible. This dissertation presents techniques for deciding how strongly ordered a protocol is necessary to solve a given application problem. It is shown that there are two distinct classes of application problems: problems that can be solved with efficient, asynchronous protocols, and problems that require global ordering. The concept of a linearization function that maps partially ordered sets of events to totally ordered histories is introduced. How to construct an asynchronous implementation that solves a given problem if a linearization function for it can be found is shown. It is proved that in general the question of whether a problem has an asynchronous solution is undecidable. Hence there exists no general algorithm that would automatically construct a suitable linearization function for a given problem. Therefore, an important subclass of problems that have certain commutativity properties are considered. Techniques for constructing asynchronous implementations for this class are presented. These techniques are useful for constructing efficient asynchronous implementations for a broad range of practical problems.

Development of parallel algorithms for electrical power management in space applications

NASA Technical Reports Server (NTRS)

Berry, Frederick C.

1989-01-01

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

The profile of problem-solving ability of students of distance education in science learning

NASA Astrophysics Data System (ADS)

Widiasih; Permanasari, A.; Riandi; Damayanti, T.

2018-05-01

This study aims to analyze the students' problem-solving ability in science learning and lesson-planning ability. The method used is descriptive-quantitative. The subjects of the study were undergraduate students of Distance Higher Education located in Serang, majoring in Primary Teacher Education in-service training. Samples were taken thoroughly from 2 groups taking the course of Science Learning in Primary School in the first term of 2017, amounted to 39 students. The technique of data collection used is essay test of problem solving from case study done at the beginning of lecture in February 2017. The results of this research can be concluded that In-service Training of Primary School Teacher Education Program are categorized as quite capable (score 66) in solving science learning problem and planning science lesson. Therefore, efforts need to be done to improve the ability of students in problem solving, for instance through online tutorials with the basis of interactive discussions.

Solving fully fuzzy transportation problem using pentagonal fuzzy numbers

NASA Astrophysics Data System (ADS)

Maheswari, P. Uma; Ganesan, K.

2018-04-01

In this paper, we propose a simple approach for the solution of fuzzy transportation problem under fuzzy environment in which the transportation costs, supplies at sources and demands at destinations are represented by pentagonal fuzzy numbers. The fuzzy transportation problem is solved without converting to its equivalent crisp form using a robust ranking technique and a new fuzzy arithmetic on pentagonal fuzzy numbers. To illustrate the proposed approach a numerical example is provided.

Parameter estimation in astronomy through application of the likelihood ratio. [satellite data analysis techniques

NASA Technical Reports Server (NTRS)

Cash, W.

1979-01-01

Many problems in the experimental estimation of parameters for models can be solved through use of the likelihood ratio test. Applications of the likelihood ratio, with particular attention to photon counting experiments, are discussed. The procedures presented solve a greater range of problems than those currently in use, yet are no more difficult to apply. The procedures are proved analytically, and examples from current problems in astronomy are discussed.

A review on economic emission dispatch problems using quantum computational intelligence

NASA Astrophysics Data System (ADS)

Mahdi, Fahad Parvez; Vasant, Pandian; Kallimani, Vish; Abdullah-Al-Wadud, M.

2016-11-01

Economic emission dispatch (EED) problems are one of the most crucial problems in power systems. Growing energy demand, limitation of natural resources and global warming make this topic into the center of discussion and research. This paper reviews the use of Quantum Computational Intelligence (QCI) in solving Economic Emission Dispatch problems. QCI techniques like Quantum Genetic Algorithm (QGA) and Quantum Particle Swarm Optimization (QPSO) algorithm are discussed here. This paper will encourage the researcher to use more QCI based algorithm to get better optimal result for solving EED problems.

A study of fuzzy logic ensemble system performance on face recognition problem

NASA Astrophysics Data System (ADS)

Polyakova, A.; Lipinskiy, L.

2017-02-01

Some problems are difficult to solve by using a single intelligent information technology (IIT). The ensemble of the various data mining (DM) techniques is a set of models which are able to solve the problem by itself, but the combination of which allows increasing the efficiency of the system as a whole. Using the IIT ensembles can improve the reliability and efficiency of the final decision, since it emphasizes on the diversity of its components. The new method of the intellectual informational technology ensemble design is considered in this paper. It is based on the fuzzy logic and is designed to solve the classification and regression problems. The ensemble consists of several data mining algorithms: artificial neural network, support vector machine and decision trees. These algorithms and their ensemble have been tested by solving the face recognition problems. Principal components analysis (PCA) is used for feature selection.

Solucion de Problemas y Procesos Cognoscitivos (Problem Solving and Cognitive Processes). Publication No. 41.

ERIC Educational Resources Information Center

Rimoldi, Horacio J. A.

The study of problem solving is made through the analysis of the process that leads to the final answer. The type of information obtained through the study of the process is compared with the information obtained by studying the final answer. The experimental technique used permits to identify the sequence of questions (tactics) that subjects ask…

Analysis of 4th Grade Students' Problem Solving Skills in Terms of Several Variables

ERIC Educational Resources Information Center

Sungur, Gülcan; Bal, Pervin Nedim

2016-01-01

The aim of this study is to examine if the level of primary school students in solving problems differs according to some demographic variables. The research is descriptive type in the general survey method, it was carried out with quantitative research techniques. The sample of the study consisted of 587 primary school students in Grade 4. The…

Problem Solving Techniques in Child Rearing: A Training Script for Parents of Young Children.

ERIC Educational Resources Information Center

Shure, Myrna B.; Spivack, George

Presented is a sequenced series of approximately 25 lessons designed to help mothers increase the interpersonal problem solving ability and behavioral adjustment of their 4- and 5-year-old children. It is explained that the program which takes 20 minutes per day over a 3 month period, combines an educational and preventive mental health approach.…

Toward automatic finite element analysis

NASA Technical Reports Server (NTRS)

Kela, Ajay; Perucchio, Renato; Voelcker, Herbert

1987-01-01

Two problems must be solved if the finite element method is to become a reliable and affordable blackbox engineering tool. Finite element meshes must be generated automatically from computer aided design databases and mesh analysis must be made self-adaptive. The experimental system described solves both problems in 2-D through spatial and analytical substructuring techniques that are now being extended into 3-D.

A family of approximate solutions and explicit error estimates for the nonlinear stationary Navier-Stokes problem

NASA Technical Reports Server (NTRS)

Gabrielsen, R. E.; Karel, S.

1975-01-01

An algorithm for solving the nonlinear stationary Navier-Stokes problem is developed. Explicit error estimates are given. This mathematical technique is potentially adaptable to the separation problem.

Problem solving for depressed suicide attempters and depressed individuals without suicide attempt.

PubMed

Roskar, Saska; Zorko, Maja; Bucik, Valentin; Marusic, Andrej

2007-12-01

Next to feelings of hopelessness, certain cognitive features such as problem solving deficiency, attentional bias and reduced future positive thinking are involved in the development and maintenance of suicidal behavior. The aim of this study was to examine feelings of hopelessness and problem solving ability in depressed suicide attempters and depressed individuals without a suicide attempt and to see whether these features change over time. Three groups of participants, depressed suicide attempters (N=23), psychiatric control group (N=27) and healthy volunteers (N=27) completed measures of hopelessness and executive planning and problem solving abilities. The two clinical groups completed all measures shortly after admission and then again 7 weeks later whereas the non-clinical control group completed measures at baseline only. Both clinical groups displayed a higher level of hopelessness and poorer problem solving ability when compared to non-clinical volunteers. However, no differences were found between the two clinical groups. In neither of the clinical groups was improvement in problem solving ability between baseline and retesting observed despite the lowering of feelings of hopelessness. The diagnoses in the psychiatric controls group were only obtained by the psychiatrist and not checked by further documentation or questionnaires. Furthermore we did not control for personality traits which might influence cognitive functioning. Since feelings of hopelessness decreased over time and problem solving ability nevertheless remained stable it is important that treatment not only focuses on mood improvement of depressed suicidal and depressed non-suicidal individuals but also on teaching problem solving techniques.

The Use of Classroom Assessment to Explore Problem Solving Skills Based on Pre-Service Teachers’ Cognitive Style Dimension in Basic Physics Course

NASA Astrophysics Data System (ADS)

Rahmawati; Rustaman, Nuryani Y.; Hamidah, Ida; Rusdiana, Dadi

2017-02-01

The aim of this study was to explore the use of assessment strategy which can measure problem solving skills of pre-service teachers based on their cognitive style in basic physics course. The sample consisted of 95 persons (male = 15, female = 75). This study used an exploratory research with observation techniques by interview, questionnaire, and test. The results indicated that the lecturer only used paper-pencil test assessment strategy to measure pre-service teachers’ achievement and also used conventional learning strategy. It means that the lecturer did not measure pre-services’ thinking process in learning, like problem solving skills. One of the factors which can influence student problem solving skills is cognitive style as an internal factor. Field Dependent (FD) and Field Independent (FI) are two cognitive styles which were measured with using Group Embedded Figure Test (GEFT) test. The result showed that 82% of pre-service teachers were FD cognitive style and only 18% of pre-service teachers had FI cognitive style. Furthermore, these findings became the fundamental design to develop a problem solving assessment model to measure pre-service teachers’ problem solving skills and process in basic physics course.

Students’ Algebraic Reasonsing In Solving Mathematical Problems With Adversity Quotient

NASA Astrophysics Data System (ADS)

Aryani, F.; Amin, S. M.; Sulaiman, R.

2018-01-01

Algebraic reasoning is a process in which students generalize mathematical ideas from a set of particular instances and express them in increasingly formal and age-appropriate ways. Using problem solving approach to develop algebraic reasoning of mathematics may enhace the long-term learning trajectory of the majority students. The purpose of this research was to describe the algebraic reasoning of quitter, camper, and climber junior high school students in solving mathematical problems. This research used qualitative descriptive method. Subjects were determined by purposive sampling. The technique of collecting data was done by task-based interviews.The results showed that the algebraic reasoning of three students in the process of pattern seeking by identifying the things that are known and asked in a similar way. But three students found the elements of pattern recognition in different ways or method. So, they are generalize the problem of pattern formation with different ways. The study of algebraic reasoning and problem solving can be a learning paradigm in the improve students’ knowledge and skills in algebra work. The goal is to help students’ improve academic competence, develop algebraic reasoning in problem solving.

Test techniques: A survey paper on cryogenic tunnels, adaptive wall test sections, and magnetic suspension and balance systems

NASA Technical Reports Server (NTRS)

Kilgore, Robert A.; Dress, David A.; Wolf, Stephen W. D.; Britcher, Colin P.

1989-01-01

The ability to get good experimental data in wind tunnels is often compromised by things seemingly beyond our control. Inadequate Reynolds number, wall interference, and support interference are three of the major problems in wind tunnel testing. Techniques for solving these problems are available. Cryogenic wind tunnels solve the problem of low Reynolds number. Adaptive wall test sections can go a long way toward eliminating wall interference. A magnetic suspension and balance system (MSBS) completely eliminates support interference. Cryogenic tunnels, adaptive wall test sections, and MSBS are surveyed. A brief historical overview is given and the present state of development and application in each area is described.

Evaluation of POE and instructor-led problem-solving approaches integrated into force and motion lecture classes using a model analysis technique

NASA Astrophysics Data System (ADS)

Rakkapao, S.; Pengpan, T.; Srikeaw, S.; Prasitpong, S.

2014-01-01

This study aims to investigate the use of the predict-observe-explain (POE) approach integrated into large lecture classes on forces and motion. It is compared to the instructor-led problem-solving method using model analysis. The samples are science (SC, N = 420) and engineering (EN, N = 434) freshmen, from Prince of Songkla University, Thailand. Research findings from the force and motion conceptual evaluation indicate that the multimedia-supported POE method promotes students’ learning better than the problem-solving method, in particular for the velocity and acceleration concepts. There is a small shift of the students’ model states after the problem-solving instruction. Moreover, by using model analysis instructors are able to investigate students’ misconceptions and evaluate teaching methods. It benefits instructors in organizing subsequent instructional materials.

ALPS: A Linear Program Solver

NASA Technical Reports Server (NTRS)

Ferencz, Donald C.; Viterna, Larry A.

1991-01-01

ALPS is a computer program which can be used to solve general linear program (optimization) problems. ALPS was designed for those who have minimal linear programming (LP) knowledge and features a menu-driven scheme to guide the user through the process of creating and solving LP formulations. Once created, the problems can be edited and stored in standard DOS ASCII files to provide portability to various word processors or even other linear programming packages. Unlike many math-oriented LP solvers, ALPS contains an LP parser that reads through the LP formulation and reports several types of errors to the user. ALPS provides a large amount of solution data which is often useful in problem solving. In addition to pure linear programs, ALPS can solve for integer, mixed integer, and binary type problems. Pure linear programs are solved with the revised simplex method. Integer or mixed integer programs are solved initially with the revised simplex, and the completed using the branch-and-bound technique. Binary programs are solved with the method of implicit enumeration. This manual describes how to use ALPS to create, edit, and solve linear programming problems. Instructions for installing ALPS on a PC compatible computer are included in the appendices along with a general introduction to linear programming. A programmers guide is also included for assistance in modifying and maintaining the program.

Paper simulation techniques in user requirements analysis for interactive computer systems

NASA Technical Reports Server (NTRS)

Ramsey, H. R.; Atwood, M. E.; Willoughby, J. K.

1979-01-01

This paper describes the use of a technique called 'paper simulation' in the analysis of user requirements for interactive computer systems. In a paper simulation, the user solves problems with the aid of a 'computer', as in normal man-in-the-loop simulation. In this procedure, though, the computer does not exist, but is simulated by the experimenters. This allows simulated problem solving early in the design effort, and allows the properties and degree of structure of the system and its dialogue to be varied. The technique, and a method of analyzing the results, are illustrated with examples from a recent paper simulation exercise involving a Space Shuttle flight design task

Efficient ICCG on a shared memory multiprocessor

NASA Technical Reports Server (NTRS)

Hammond, Steven W.; Schreiber, Robert

1989-01-01

Different approaches are discussed for exploiting parallelism in the ICCG (Incomplete Cholesky Conjugate Gradient) method for solving large sparse symmetric positive definite systems of equations on a shared memory parallel computer. Techniques for efficiently solving triangular systems and computing sparse matrix-vector products are explored. Three methods for scheduling the tasks in solving triangular systems are implemented on the Sequent Balance 21000. Sample problems that are representative of a large class of problems solved using iterative methods are used. We show that a static analysis to determine data dependences in the triangular solve can greatly improve its parallel efficiency. We also show that ignoring symmetry and storing the whole matrix can reduce solution time substantially.

Quality improvement--boon or boondoggle?

PubMed

Paterson, M A; Wendel, J

1994-01-01

Is quality improvement (QI) reducing healthcare costs while improving patient care? Researchers find that QI has improved employee satisfaction and morale, but it was designed to do more. One solution is to use problem-solving techniques to help teams identify the level at which they want to address a problem, whether that be the subinstitutional, institutional, or system level. If QI is to fulfill its promise, skilled managers must create effective teams capable of defining and solving complex problems.

Functional Techniques for Data Analysis

NASA Technical Reports Server (NTRS)

Tomlinson, John R.

1997-01-01

This dissertation develops a new general method of solving Prony's problem. Two special cases of this new method have been developed previously. They are the Matrix Pencil and the Osculatory Interpolation. The dissertation shows that they are instances of a more general solution type which allows a wide ranging class of linear functional to be used in the solution of the problem. This class provides a continuum of functionals which provide new methods that can be used to solve Prony's problem.

Vectorial finite elements for solving the radiative transfer equation

NASA Astrophysics Data System (ADS)

Badri, M. A.; Jolivet, P.; Rousseau, B.; Le Corre, S.; Digonnet, H.; Favennec, Y.

2018-06-01

The discrete ordinate method coupled with the finite element method is often used for the spatio-angular discretization of the radiative transfer equation. In this paper we attempt to improve upon such a discretization technique. Instead of using standard finite elements, we reformulate the radiative transfer equation using vectorial finite elements. In comparison to standard finite elements, this reformulation yields faster timings for the linear system assemblies, as well as for the solution phase when using scattering media. The proposed vectorial finite element discretization for solving the radiative transfer equation is cross-validated against a benchmark problem available in literature. In addition, we have used the method of manufactured solutions to verify the order of accuracy for our discretization technique within different absorbing, scattering, and emitting media. For solving large problems of radiation on parallel computers, the vectorial finite element method is parallelized using domain decomposition. The proposed domain decomposition method scales on large number of processes, and its performance is unaffected by the changes in optical thickness of the medium. Our parallel solver is used to solve a large scale radiative transfer problem of the Kelvin-cell radiation.

Automatic Generation of Heuristics for Scheduling

NASA Technical Reports Server (NTRS)

Morris, Robert A.; Bresina, John L.; Rodgers, Stuart M.

1997-01-01

This paper presents a technique, called GenH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing consensus that heuristics encode advice that is, at best, useful in solving most, or typical, problem instances, and, at worst, useful in solving only a narrowly defined set of instances. In either case, heuristic problem solvers, to be broadly applicable, should have a means of automatically adjusting to the idiosyncrasies of each problem instance. GenH generates a search heuristic for a given problem instance by hill-climbing in the space of possible multi-attribute heuristics, where the evaluation of a candidate heuristic is based on the quality of the solution found under its guidance. We present empirical results obtained by applying GenH to the real world problem of telescope observation scheduling. These results demonstrate that GenH is a simple and effective way of improving the performance of an heuristic scheduler.

A hybrid, auto-adaptive and rule-based multi-agent approach using evolutionary algorithms for improved searching

NASA Astrophysics Data System (ADS)

Izquierdo, Joaquín; Montalvo, Idel; Campbell, Enrique; Pérez-García, Rafael

2016-08-01

Selecting the most appropriate heuristic for solving a specific problem is not easy, for many reasons. This article focuses on one of these reasons: traditionally, the solution search process has operated in a given manner regardless of the specific problem being solved, and the process has been the same regardless of the size, complexity and domain of the problem. To cope with this situation, search processes should mould the search into areas of the search space that are meaningful for the problem. This article builds on previous work in the development of a multi-agent paradigm using techniques derived from knowledge discovery (data-mining techniques) on databases of so-far visited solutions. The aim is to improve the search mechanisms, increase computational efficiency and use rules to enrich the formulation of optimization problems, while reducing the search space and catering to realistic problems.

A review of estimation of distribution algorithms in bioinformatics

PubMed Central

Armañanzas, Rubén; Inza, Iñaki; Santana, Roberto; Saeys, Yvan; Flores, Jose Luis; Lozano, Jose Antonio; Peer, Yves Van de; Blanco, Rosa; Robles, Víctor; Bielza, Concha; Larrañaga, Pedro

2008-01-01

Evolutionary search algorithms have become an essential asset in the algorithmic toolbox for solving high-dimensional optimization problems in across a broad range of bioinformatics problems. Genetic algorithms, the most well-known and representative evolutionary search technique, have been the subject of the major part of such applications. Estimation of distribution algorithms (EDAs) offer a novel evolutionary paradigm that constitutes a natural and attractive alternative to genetic algorithms. They make use of a probabilistic model, learnt from the promising solutions, to guide the search process. In this paper, we set out a basic taxonomy of EDA techniques, underlining the nature and complexity of the probabilistic model of each EDA variant. We review a set of innovative works that make use of EDA techniques to solve challenging bioinformatics problems, emphasizing the EDA paradigm's potential for further research in this domain. PMID:18822112

Focusing on the golden ball metaheuristic: an extended study on a wider set of problems.

PubMed

Osaba, E; Diaz, F; Carballedo, R; Onieva, E; Perallos, A

2014-01-01

Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found. Anyway, there are many recently proposed techniques, such as the artificial bee colony and imperialist competitive algorithm. This paper is focused on one recently published technique, the one called Golden Ball (GB). The GB is a multiple-population metaheuristic based on soccer concepts. Although it was designed to solve combinatorial optimization problems, until now, it has only been tested with two simple routing problems: the traveling salesman problem and the capacitated vehicle routing problem. In this paper, the GB is applied to four different combinatorial optimization problems. Two of them are routing problems, which are more complex than the previously used ones: the asymmetric traveling salesman problem and the vehicle routing problem with backhauls. Additionally, one constraint satisfaction problem (the n-queen problem) and one combinatorial design problem (the one-dimensional bin packing problem) have also been used. The outcomes obtained by GB are compared with the ones got by two different genetic algorithms and two distributed genetic algorithms. Additionally, two statistical tests are conducted to compare these results.

Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems

PubMed Central

Osaba, E.; Diaz, F.; Carballedo, R.; Onieva, E.; Perallos, A.

2014-01-01

Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found. Anyway, there are many recently proposed techniques, such as the artificial bee colony and imperialist competitive algorithm. This paper is focused on one recently published technique, the one called Golden Ball (GB). The GB is a multiple-population metaheuristic based on soccer concepts. Although it was designed to solve combinatorial optimization problems, until now, it has only been tested with two simple routing problems: the traveling salesman problem and the capacitated vehicle routing problem. In this paper, the GB is applied to four different combinatorial optimization problems. Two of them are routing problems, which are more complex than the previously used ones: the asymmetric traveling salesman problem and the vehicle routing problem with backhauls. Additionally, one constraint satisfaction problem (the n-queen problem) and one combinatorial design problem (the one-dimensional bin packing problem) have also been used. The outcomes obtained by GB are compared with the ones got by two different genetic algorithms and two distributed genetic algorithms. Additionally, two statistical tests are conducted to compare these results. PMID:25165742

Mathematical problem solving ability of sport students in the statistical study

NASA Astrophysics Data System (ADS)

Sari, E. F. P.; Zulkardi; Putri, R. I. I.

2017-12-01

This study aims to determine the problem-solving ability of sport students of PGRI Palembang semester V in the statistics course. Subjects in this study were sport students of PGRI Palembang semester V which amounted to 31 people. The research method used is quasi experiment type one case shoot study. Data collection techniques in this study use the test and data analysis used is quantitative descriptive statistics. The conclusion of this study shown that the mathematical problem solving ability of PGRI Palembang sport students of V semester in the statistical course is categorized well with the average of the final test score of 80.3.

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.

Solving Large-Scale Inverse Magnetostatic Problems using the Adjoint Method

PubMed Central

Bruckner, Florian; Abert, Claas; Wautischer, Gregor; Huber, Christian; Vogler, Christoph; Hinze, Michael; Suess, Dieter

2017-01-01

An efficient algorithm for the reconstruction of the magnetization state within magnetic components is presented. The occurring inverse magnetostatic problem is solved by means of an adjoint approach, based on the Fredkin-Koehler method for the solution of the forward problem. Due to the use of hybrid FEM-BEM coupling combined with matrix compression techniques the resulting algorithm is well suited for large-scale problems. Furthermore the reconstruction of the magnetization state within a permanent magnet as well as an optimal design application are demonstrated. PMID:28098851

Multiobjective optimization approach: thermal food processing.

PubMed

Abakarov, A; Sushkov, Y; Almonacid, S; Simpson, R

2009-01-01

The objective of this study was to utilize a multiobjective optimization technique for the thermal sterilization of packaged foods. The multiobjective optimization approach used in this study is based on the optimization of well-known aggregating functions by an adaptive random search algorithm. The applicability of the proposed approach was illustrated by solving widely used multiobjective test problems taken from the literature. The numerical results obtained for the multiobjective test problems and for the thermal processing problem show that the proposed approach can be effectively used for solving multiobjective optimization problems arising in the food engineering field.

Using genetic algorithms to determine near-optimal pricing, investment and operating strategies in the electric power industry

NASA Astrophysics Data System (ADS)

Wu, Dongjun

Network industries have technologies characterized by a spatial hierarchy, the "network," with capital-intensive interconnections and time-dependent, capacity-limited flows of products and services through the network to customers. This dissertation studies service pricing, investment and business operating strategies for the electric power network. First-best solutions for a variety of pricing and investment problems have been studied. The evaluation of genetic algorithms (GA, which are methods based on the idea of natural evolution) as a primary means of solving complicated network problems, both w.r.t. pricing: as well as w.r.t. investment and other operating decisions, has been conducted. New constraint-handling techniques in GAs have been studied and tested. The actual application of such constraint-handling techniques in solving practical non-linear optimization problems has been tested on several complex network design problems with encouraging initial results. Genetic algorithms provide solutions that are feasible and close to optimal when the optimal solution is know; in some instances, the near-optimal solutions for small problems by the proposed GA approach can only be tested by pushing the limits of currently available non-linear optimization software. The performance is far better than several commercially available GA programs, which are generally inadequate in solving any of the problems studied in this dissertation, primarily because of their poor handling of constraints. Genetic algorithms, if carefully designed, seem very promising in solving difficult problems which are intractable by traditional analytic methods.

MSC/NASTRAN DMAP Alter Used for Closed-Form Static Analysis With Inertia Relief and Displacement-Dependent Loads

NASA Technical Reports Server (NTRS)

1996-01-01

Solving for the displacements of free-free coupled systems acted upon by static loads is a common task in the aerospace industry. Often, these problems are solved by static analysis with inertia relief. This technique allows for a free-free static analysis by balancing the applied loads with the inertia loads generated by the applied loads. For some engineering applications, the displacements of the free-free coupled system induce additional static loads. Hence, the applied loads are equal to the original loads plus the displacement-dependent loads. A launch vehicle being acted upon by an aerodynamic loading can have such applied loads. The final displacements of such systems are commonly determined with iterative solution techniques. Unfortunately, these techniques can be time consuming and labor intensive. Because the coupled system equations for free-free systems with displacement-dependent loads can be written in closed form, it is advantageous to solve for the displacements in this manner. Implementing closed-form equations in static analysis with inertia relief is analogous to implementing transfer functions in dynamic analysis. An MSC/NASTRAN (MacNeal-Schwendler Corporation/NASA Structural Analysis) DMAP (Direct Matrix Abstraction Program) Alter was used to include displacement-dependent loads in static analysis with inertia relief. It efficiently solved a common aerospace problem that typically has been solved with an iterative technique.

A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES/spl I.bar/DECOMPOSE.

PubMed

Aras, N; Altinel, I K; Oommen, J

2003-01-01

In addition to the classical heuristic algorithms of operations research, there have also been several approaches based on artificial neural networks for solving the traveling salesman problem. Their efficiency, however, decreases as the problem size (number of cities) increases. A technique to reduce the complexity of a large-scale traveling salesman problem (TSP) instance is to decompose or partition it into smaller subproblems. We introduce an all-neural decomposition heuristic that is based on a recent self-organizing map called KNIES, which has been successfully implemented for solving both the Euclidean traveling salesman problem and the Euclidean Hamiltonian path problem. Our solution for the Euclidean TSP proceeds by solving the Euclidean HPP for the subproblems, and then patching these solutions together. No such all-neural solution has ever been reported.

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.

Restart Operator Meta-heuristics for a Problem-Oriented Evolutionary Strategies Algorithm in Inverse Mathematical MISO Modelling Problem Solving

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.

Multigrid solution strategies for adaptive meshing problems

NASA Technical Reports Server (NTRS)

Mavriplis, Dimitri J.

1995-01-01

This paper discusses the issues which arise when combining multigrid strategies with adaptive meshing techniques for solving steady-state problems on unstructured meshes. A basic strategy is described, and demonstrated by solving several inviscid and viscous flow cases. Potential inefficiencies in this basic strategy are exposed, and various alternate approaches are discussed, some of which are demonstrated with an example. Although each particular approach exhibits certain advantages, all methods have particular drawbacks, and the formulation of a completely optimal strategy is considered to be an open problem.

Solving a product safety problem using a recycled high density polyethylene container

NASA Technical Reports Server (NTRS)

Liu, Ping; Waskom, T. L.

1993-01-01

The objectives are to introduce basic problem-solving techniques for product safety including problem identification, definition, solution criteria, test process and design, and data analysis. The students are given a recycled milk jug made of high density polyethylene (HDPE) by blow molding. The objectives are to design and perform proper material test(s) so they can evaluate the product safety if the milk jug is used in a certain way which is specified in the description of the procedure for this investigation.

Application of remote sensing to state and regional problems

NASA Technical Reports Server (NTRS)

Bouchillon, C. W.; Miller, W. F.; Landphair, H.; Zitta, V. L.

1974-01-01

The use of remote sensing techniques to help the state of Mississippi recognize and solve its environmental, resource, and socio-economic problems through inventory, analysis, and monitoring is suggested.

Shape and Reinforcement Optimization of Underground Tunnels

NASA Astrophysics Data System (ADS)

Ghabraie, Kazem; Xie, Yi Min; Huang, Xiaodong; Ren, Gang

Design of support system and selecting an optimum shape for the opening are two important steps in designing excavations in rock masses. Currently selecting the shape and support design are mainly based on designer's judgment and experience. Both of these problems can be viewed as material distribution problems where one needs to find the optimum distribution of a material in a domain. Topology optimization techniques have proved to be useful in solving these kinds of problems in structural design. Recently the application of topology optimization techniques in reinforcement design around underground excavations has been studied by some researchers. In this paper a three-phase material model will be introduced changing between normal rock, reinforced rock, and void. Using such a material model both problems of shape and reinforcement design can be solved together. A well-known topology optimization technique used in structural design is bi-directional evolutionary structural optimization (BESO). In this paper the BESO technique has been extended to simultaneously optimize the shape of the opening and the distribution of reinforcements. Validity and capability of the proposed approach have been investigated through some examples.

Application of the artificial bee colony algorithm for solving the set covering problem.

PubMed

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

PubMed Central

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

Quantifying risk and accuracy in cancer risk assessment: the process and its role in risk management problem-solving.

PubMed

Turturro, A; Hart, R W

1987-01-01

A better understanding of chemical-induced cancer has led to appreciation of similarities to problems addressed by risk management of radiation-induced toxicity. Techniques developed for cancer risk assessment of toxic substances can be generalized to toxic agents. A recent problem-solving approach for risk management of toxic substances developed for the U.S. Department of Health and Human Services, and the role of risk assessment and how uncertainty should be treated within the context of this approach, is discussed. Finally, two different methods, research into the assumptions underlying risk assessment and the modification of risk assessment/risk management documents, are used to illustrate how the technique can be applied.

Some variance reduction methods for numerical stochastic homogenization

PubMed Central

Blanc, X.; Le Bris, C.; Legoll, F.

2016-01-01

We give an overview of a series of recent studies devoted to variance reduction techniques for numerical stochastic homogenization. Numerical homogenization requires that a set of problems is solved at the microscale, the so-called corrector problems. In a random environment, these problems are stochastic and therefore need to be repeatedly solved, for several configurations of the medium considered. An empirical average over all configurations is then performed using the Monte Carlo approach, so as to approximate the effective coefficients necessary to determine the macroscopic behaviour. Variance severely affects the accuracy and the cost of such computations. Variance reduction approaches, borrowed from other contexts in the engineering sciences, can be useful. Some of these variance reduction techniques are presented, studied and tested here. PMID:27002065

Sparse Image Reconstruction on the Sphere: Analysis and Synthesis.

PubMed

Wallis, Christopher G R; Wiaux, Yves; McEwen, Jason D

2017-11-01

We develop techniques to solve ill-posed inverse problems on the sphere by sparse regularization, exploiting sparsity in both axisymmetric and directional scale-discretized wavelet space. Denoising, inpainting, and deconvolution problems and combinations thereof, are considered as examples. Inverse problems are solved in both the analysis and synthesis settings, with a number of different sampling schemes. The most effective approach is that with the most restricted solution-space, which depends on the interplay between the adopted sampling scheme, the selection of the analysis/synthesis problem, and any weighting of the l 1 norm appearing in the regularization problem. More efficient sampling schemes on the sphere improve reconstruction fidelity by restricting the solution-space and also by improving sparsity in wavelet space. We apply the technique to denoise Planck 353-GHz observations, improving the ability to extract the structure of Galactic dust emission, which is important for studying Galactic magnetism.

An element search ant colony technique for solving virtual machine placement problem

NASA Astrophysics Data System (ADS)

Srija, J.; Rani John, Rose; Kanaga, Grace Mary, Dr.

2017-09-01

The data centres in the cloud environment play a key role in providing infrastructure for ubiquitous computing, pervasive computing, mobile computing etc. This computing technique tries to utilize the available resources in order to provide services. Hence maintaining the resource utilization without wastage of power consumption has become a challenging task for the researchers. In this paper we propose the direct guidance ant colony system for effective mapping of virtual machines to the physical machine with maximal resource utilization and minimal power consumption. The proposed algorithm has been compared with the existing ant colony approach which is involved in solving virtual machine placement problem and thus the proposed algorithm proves to provide better result than the existing technique.

Texas two-step: a framework for optimal multi-input single-output deconvolution.

PubMed

Neelamani, Ramesh; Deffenbaugh, Max; Baraniuk, Richard G

2007-11-01

Multi-input single-output deconvolution (MISO-D) aims to extract a deblurred estimate of a target signal from several blurred and noisy observations. This paper develops a new two step framework--Texas Two-Step--to solve MISO-D problems with known blurs. Texas Two-Step first reduces the MISO-D problem to a related single-input single-output deconvolution (SISO-D) problem by invoking the concept of sufficient statistics (SSs) and then solves the simpler SISO-D problem using an appropriate technique. The two-step framework enables new MISO-D techniques (both optimal and suboptimal) based on the rich suite of existing SISO-D techniques. In fact, the properties of SSs imply that a MISO-D algorithm is mean-squared-error optimal if and only if it can be rearranged to conform to the Texas Two-Step framework. Using this insight, we construct new wavelet- and curvelet-based MISO-D algorithms with asymptotically optimal performance. Simulated and real data experiments verify that the framework is indeed effective.

Applications of Evolutionary Technology to Manufacturing and Logistics Systems : State-of-the Art Survey

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin

Many combinatorial optimization problems from industrial engineering and operations research in real-world are very complex in nature and quite hard to solve them by conventional techniques. Since the 1960s, there has been an increasing interest in imitating living beings to solve such kinds of hard combinatorial optimization problems. Simulating the natural evolutionary process of human beings results in stochastic optimization techniques called evolutionary algorithms (EAs), which can often outperform conventional optimization methods when applied to difficult real-world problems. In this survey paper, we provide a comprehensive survey of the current state-of-the-art in the use of EA in manufacturing and logistics systems. In order to demonstrate the EAs which are powerful and broadly applicable stochastic search and optimization techniques, we deal with the following engineering design problems: transportation planning models, layout design models and two-stage logistics models in logistics systems; job-shop scheduling, resource constrained project scheduling in manufacturing system.

Hybrid General Pattern Search and Simulated Annealing for Industrail Production Planning Problems

NASA Astrophysics Data System (ADS)

Vasant, P.; Barsoum, N.

2010-06-01

In this paper, the hybridization of GPS (General Pattern Search) method and SA (Simulated Annealing) incorporated in the optimization process in order to look for the global optimal solution for the fitness function and decision variables as well as minimum computational CPU time. The real strength of SA approach been tested in this case study problem of industrial production planning. This is due to the great advantage of SA for being easily escaping from trapped in local minima by accepting up-hill move through a probabilistic procedure in the final stages of optimization process. Vasant [1] in his Ph. D thesis has provided 16 different techniques of heuristic and meta-heuristic in solving industrial production problems with non-linear cubic objective functions, eight decision variables and 29 constraints. In this paper, fuzzy technological problems have been solved using hybrid techniques of general pattern search and simulated annealing. The simulated and computational results are compared to other various evolutionary techniques.

Pen-based Interfaces for Engineering and Education

NASA Astrophysics Data System (ADS)

Stahovich, Thomas F.

Sketches are an important problem-solving tool in many fields. This is particularly true of engineering design, where sketches facilitate creativity by providing an efficient medium for expressing ideas. However, despite the importance of sketches in engineering practice, current engineering software still relies on traditional mouse and keyboard interfaces, with little or no capabilities to handle free-form sketch input. With recent advances in machine-interpretation techniques, it is now becoming possible to create practical interpretation-based interfaces for such software. In this chapter, we report on our efforts to create interpretation techniques to enable pen-based engineering applications. We describe work on two fundamental sketch understanding problems. The first is sketch parsing, the task of clustering pen strokes or geometric primitives into individual symbols. The second is symbol recognition, the task of classifying symbols once they have been located by a parser. We have used the techniques that we have developed to construct several pen-based engineering analysis tools. These are used here as examples to illustrate our methods. We have also begun to use our techniques to create pen-based tutoring systems that scaffold students in solving problems in the same way they would ordinarily solve them with paper and pencil. The chapter concludes with a brief discussion of these systems.

Application of an enriched FEM technique in thermo-mechanical contact problems

NASA Astrophysics Data System (ADS)

Khoei, A. R.; Bahmani, B.

2018-02-01

In this paper, an enriched FEM technique is employed for thermo-mechanical contact problem based on the extended finite element method. A fully coupled thermo-mechanical contact formulation is presented in the framework of X-FEM technique that takes into account the deformable continuum mechanics and the transient heat transfer analysis. The Coulomb frictional law is applied for the mechanical contact problem and a pressure dependent thermal contact model is employed through an explicit formulation in the weak form of X-FEM method. The equilibrium equations are discretized by the Newmark time splitting method and the final set of non-linear equations are solved based on the Newton-Raphson method using a staggered algorithm. Finally, in order to illustrate the capability of the proposed computational model several numerical examples are solved and the results are compared with those reported in literature.

Using a Problem Solving-Cooperative Learning Approach to Improve Students' Skills for Interpreting [Superscript 1]H NMR Spectra of Unknown Compounds in an Organic Spectroscopy Course

ERIC Educational Resources Information Center

Angawi, Rihab F.

2014-01-01

To address third- and fourth-year chemistry students' difficulties with the challenge of interpreting [superscript 1]H NMR spectra, a problem solving-cooperative learning technique was incorporated in a Spectra of Organic Compounds course. Using this approach helped students deepen their understanding of the basics of [superscript 1]H NMR…

Refined genetic algorithm -- Economic dispatch example

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

Sheble, G.B.; Brittig, K.

1995-02-01

A genetic-based algorithm is used to solve an economic dispatch (ED) problem. The algorithm utilizes payoff information of perspective solutions to evaluate optimality. Thus, the constraints of classical LaGrangian techniques on unit curves are eliminated. Using an economic dispatch problem as a basis for comparison, several different techniques which enhance program efficiency and accuracy, such as mutation prediction, elitism, interval approximation and penalty factors, are explored. Two unique genetic algorithms are also compared. The results are verified for a sample problem using a classical technique.

An iterative kernel based method for fourth order nonlinear equation with nonlinear boundary condition

NASA Astrophysics Data System (ADS)

Azarnavid, Babak; Parand, Kourosh; Abbasbandy, Saeid

2018-06-01

This article discusses an iterative reproducing kernel method with respect to its effectiveness and capability of solving a fourth-order boundary value problem with nonlinear boundary conditions modeling beams on elastic foundations. Since there is no method of obtaining reproducing kernel which satisfies nonlinear boundary conditions, the standard reproducing kernel methods cannot be used directly to solve boundary value problems with nonlinear boundary conditions as there is no knowledge about the existence and uniqueness of the solution. The aim of this paper is, therefore, to construct an iterative method by the use of a combination of reproducing kernel Hilbert space method and a shooting-like technique to solve the mentioned problems. Error estimation for reproducing kernel Hilbert space methods for nonlinear boundary value problems have yet to be discussed in the literature. In this paper, we present error estimation for the reproducing kernel method to solve nonlinear boundary value problems probably for the first time. Some numerical results are given out to demonstrate the applicability of the method.

Problems in Recording the Electrocardiogram.

ERIC Educational Resources Information Center

Webster, John G.

The unwanted signals that arise in electrocardiography are discussed. A technical background of electrocardiography is given, along with teaching techniques that educate students of medical instrumentation to solve the problems caused by these signals. (MJH)

A stabilized element-based finite volume method for poroelastic problems

NASA Astrophysics Data System (ADS)

Honório, Hermínio T.; Maliska, Clovis R.; Ferronato, Massimiliano; Janna, Carlo

2018-07-01

The coupled equations of Biot's poroelasticity, consisting of stress equilibrium and fluid mass balance in deforming porous media, are numerically solved. The governing partial differential equations are discretized by an Element-based Finite Volume Method (EbFVM), which can be used in three dimensional unstructured grids composed of elements of different types. One of the difficulties for solving these equations is the numerical pressure instability that can arise when undrained conditions take place. In this paper, a stabilization technique is developed to overcome this problem by employing an interpolation function for displacements that considers also the pressure gradient effect. The interpolation function is obtained by the so-called Physical Influence Scheme (PIS), typically employed for solving incompressible fluid flows governed by the Navier-Stokes equations. Classical problems with analytical solutions, as well as three-dimensional realistic cases are addressed. The results reveal that the proposed stabilization technique is able to eliminate the spurious pressure instabilities arising under undrained conditions at a low computational cost.

Hybrid water flow-like algorithm with Tabu search for traveling salesman problem

NASA Astrophysics Data System (ADS)

Bostamam, Jasmin M.; Othman, Zulaiha

2016-08-01

This paper presents a hybrid Water Flow-like Algorithm with Tabu Search for solving travelling salesman problem (WFA-TS-TSP).WFA has been proven its outstanding performances in solving TSP meanwhile TS is a conventional algorithm which has been used since decades to solve various combinatorial optimization problem including TSP. Hybridization between WFA with TS provides a better balance of exploration and exploitation criteria which are the key elements in determining the performance of one metaheuristic. TS use two different local search namely, 2opt and 3opt separately. The proposed WFA-TS-TSP is tested on 23 sets on the well-known benchmarked symmetric TSP instances. The result shows that the proposed WFA-TS-TSP has significant better quality solutions compared to WFA. The result also shows that the WFA-TS-TSP with 3-opt obtained the best quality solution. With the result obtained, it could be concluded that WFA has potential to be further improved by using hybrid technique or using better local search technique.

Neural networks in chemistry

NASA Astrophysics Data System (ADS)

Zupan, Jure

1995-04-01

All problems that in some way are linked to handling of multi-variate experiments versus multi-variate responses can be approached by the group of methods that has recently became known as the artificial neural network (ANN) techniques. In this lecture, the types of the problems that can be solved by ANN techniques rather than the ANN techniques themselves will be addressed first. This issue is rather important due to the fact that the ANN techniques can be used for a very broad range of problems and choosing the wrong method can often result in either a failure to produce an effective solution or in a very time consuming and ineffective handling. Among the types of problems that can be solved by different ANN techniques the classification, mapping, look-up table, and modelling will be emphasized and discussed. Because all mentioned methods can be solved by different standard techniques, special emphasis will be paid to stress the advantages and drawbacks when employing different ANN techniques. Due to the fact that the range of possible use of ANN is so broad, even a very specific problem can be solved by many different ANN architectures or even using different learning strategies within ANN. In the second part the main learning strategies and corresponding choices of ANN architectures will be discussed. In this part the parameters and some guidelines how to select the method and the design of the ANNs will be shown on the examples of reported ANN applications in chemistry. The ANN learning strategies discussed will be back-propagation of errors, the Kohonen, and the counter propagation learning. The potential user of ANN should first, consider the problem, second, he must inspect the availability of data and the data themselves to decide for which ANN method they are best suited. In this respect, the amount of data, the dimensionality of the measurement space, the form of data (alphanumeric entries, binary, real, or even mixed forms of data) are crucial. After considering all this factors, the determination of the appropriate neural network architecture can be made. Additionally, the selection the optimal ANN involves the determination of specific internal parameters like the learning rate, the momentum term, the neighbourhood function, the time dependent decrease of corrections, etc. Even after all these decisions have been made the learning procedure itself is not a straightforward task. Here, the division of the entire ensemble of data into three data sets: training, controlling and the test set are crucial. This problem is addressed as well.

Time domain localization technique with sparsity constraint for imaging acoustic sources

NASA Astrophysics Data System (ADS)

Padois, Thomas; Doutres, Olivier; Sgard, Franck; Berry, Alain

2017-09-01

This paper addresses source localization technique in time domain for broadband acoustic sources. The objective is to accurately and quickly detect the position and amplitude of noise sources in workplaces in order to propose adequate noise control options and prevent workers hearing loss or safety risk. First, the generalized cross correlation associated with a spherical microphone array is used to generate an initial noise source map. Then a linear inverse problem is defined to improve this initial map. Commonly, the linear inverse problem is solved with an l2 -regularization. In this study, two sparsity constraints are used to solve the inverse problem, the orthogonal matching pursuit and the truncated Newton interior-point method. Synthetic data are used to highlight the performances of the technique. High resolution imaging is achieved for various acoustic sources configurations. Moreover, the amplitudes of the acoustic sources are correctly estimated. A comparison of computation times shows that the technique is compatible with quasi real-time generation of noise source maps. Finally, the technique is tested with real data.

The development and nature of problem-solving among first-semester calculus students

NASA Astrophysics Data System (ADS)

Dawkins, Paul Christian; Mendoza Epperson, James A.

2014-08-01

This study investigates interactions between calculus learning and problem-solving in the context of two first-semester undergraduate calculus courses in the USA. We assessed students' problem-solving abilities in a common US calculus course design that included traditional lecture and assessment with problem-solving-oriented labs. We investigate this blended instruction as a local representative of the US calculus reform movements that helped foster it. These reform movements tended to emphasize problem-solving as well as multiple mathematical registers and quantitative modelling. Our statistical analysis reveals the influence of the blended traditional/reform calculus instruction on students' ability to solve calculus-related, non-routine problems through repeated measures over the semester. The calculus instruction in this study significantly improved students' performance on non-routine problems, though performance improved more regarding strategies and accuracy than it did for drawing conclusions and providing justifications. We identified problem-solving behaviours that characterized top performance or attrition in the course. Top-performing students displayed greater algebraic proficiency, calculus skills, and more general heuristics than their peers, but overused algebraic techniques even when they proved cumbersome or inappropriate. Students who subsequently withdrew from calculus often lacked algebraic fluency and understanding of the graphical register. The majority of participants, when given a choice, relied upon less sophisticated trial-and-error approaches in the numerical register and rarely used the graphical register, contrary to the goals of US calculus reform. We provide explanations for these patterns in students' problem-solving performance in view of both their preparation for university calculus and the courses' assessment structure, which preferentially rewarded algebraic reasoning. While instruction improved students' problem-solving performance, we observe that current instruction requires ongoing refinement to help students develop multi-register fluency and the ability to model quantitatively, as is called for in current US standards for mathematical instruction.

Students’ Covariational Reasoning in Solving Integrals’ Problems

NASA Astrophysics Data System (ADS)

Harini, N. V.; Fuad, Y.; Ekawati, R.

2018-01-01

Covariational reasoning plays an important role to indicate quantities vary in learning calculus. This study investigates students’ covariational reasoning during their studies concerning two covarying quantities in integral problem. Six undergraduate students were chosen to solve problems that involved interpreting and representing how quantities change in tandem. Interviews were conducted to reveal the students’ reasoning while solving covariational problems. The result emphasizes that undergraduate students were able to construct the relation of dependent variables that changes in tandem with the independent variable. However, students faced difficulty in forming images of continuously changing rates and could not accurately apply the concept of integrals. These findings suggest that learning calculus should be increased emphasis on coordinating images of two quantities changing in tandem about instantaneously rate of change and to promote conceptual knowledge in integral techniques.

Semilinear programming: applications and implementation

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

Mohan, S.

Semilinear programming is a method of solving optimization problems with linear constraints where the non-negativity restrictions on the variables are dropped and the objective function coefficients can take on different values depending on whether the variable is positive or negative. The simplex method for linear programming is modified in this thesis to solve general semilinear and piecewise linear programs efficiently without having to transform them into equivalent standard linear programs. Several models in widely different areas of optimization such as production smoothing, facility locations, goal programming and L/sub 1/ estimation are presented first to demonstrate the compact formulation that arisesmore » when such problems are formulated as semilinear programs. A code SLP is constructed using the semilinear programming techniques. Problems in aggregate planning and L/sub 1/ estimation are solved using SLP and equivalent linear programs using a linear programming simplex code. Comparisons of CPU times and number iterations indicate SLP to be far superior. The semilinear programming techniques are extended to piecewise linear programming in the implementation of the code PLP. Piecewise linear models in aggregate planning are solved using PLP and equivalent standard linear programs using a simple upper bounded linear programming code SUBLP.« less

Applying nonlinear diffusion acceleration to the neutron transport k-Eigenvalue problem with anisotropic scattering

DOE PAGES

Willert, Jeffrey; Park, H.; Taitano, William

2015-11-01

High-order/low-order (or moment-based acceleration) algorithms have been used to significantly accelerate the solution to the neutron transport k-eigenvalue problem over the past several years. Recently, the nonlinear diffusion acceleration algorithm has been extended to solve fixed-source problems with anisotropic scattering sources. In this paper, we demonstrate that we can extend this algorithm to k-eigenvalue problems in which the scattering source is anisotropic and a significant acceleration can be achieved. Lastly, we demonstrate that the low-order, diffusion-like eigenvalue problem can be solved efficiently using a technique known as nonlinear elimination.

Exploring students’ perceived and actual ability in solving statistical problems based on Rasch measurement tools

NASA Astrophysics Data System (ADS)

Azila Che Musa, Nor; Mahmud, Zamalia; Baharun, Norhayati

2017-09-01

One of the important skills that is required from any student who are learning statistics is knowing how to solve statistical problems correctly using appropriate statistical methods. This will enable them to arrive at a conclusion and make a significant contribution and decision for the society. In this study, a group of 22 students majoring in statistics at UiTM Shah Alam were given problems relating to topics on testing of hypothesis which require them to solve the problems using confidence interval, traditional and p-value approach. Hypothesis testing is one of the techniques used in solving real problems and it is listed as one of the difficult concepts for students to grasp. The objectives of this study is to explore students’ perceived and actual ability in solving statistical problems and to determine which item in statistical problem solving that students find difficult to grasp. Students’ perceived and actual ability were measured based on the instruments developed from the respective topics. Rasch measurement tools such as Wright map and item measures for fit statistics were used to accomplish the objectives. Data were collected and analysed using Winsteps 3.90 software which is developed based on the Rasch measurement model. The results showed that students’ perceived themselves as moderately competent in solving the statistical problems using confidence interval and p-value approach even though their actual performance showed otherwise. Item measures for fit statistics also showed that the maximum estimated measures were found on two problems. These measures indicate that none of the students have attempted these problems correctly due to reasons which include their lack of understanding in confidence interval and probability values.

A problem with problem solving: motivational traits, but not cognition, predict success on novel operant foraging tasks.

PubMed

van Horik, Jayden O; Madden, Joah R

2016-04-01

Rates of innovative foraging behaviours and success on problem-solving tasks are often used to assay differences in cognition, both within and across species. Yet the cognitive features of some problem-solving tasks can be unclear. As such, explanations that attribute cognitive mechanisms to individual variation in problem-solving performance have revealed conflicting results. We investigated individual consistency in problem-solving performances in captive-reared pheasant chicks, Phasianus colchicus , and addressed whether success depends on cognitive processes, such as trial-and-error associative learning, or whether performances may be driven solely via noncognitive motivational mechanisms, revealed through subjects' willingness to approach, engage with and persist in their interactions with an apparatus, or via physiological traits such as body condition. While subjects' participation and success were consistent within the same problems and across similar tasks, their performances were inconsistent across different types of task. Moreover, subjects' latencies to approach each test apparatus and their attempts to access the reward were not repeatable across trials. Successful individuals did not improve their performances with experience, nor were they consistent in their techniques in repeated presentations of a task. However, individuals that were highly motivated to enter the experimental chamber were more likely to participate. Successful individuals were also faster to approach each test apparatus and more persistent in their attempts to solve the tasks than unsuccessful individuals. Our findings therefore suggest that individual differences in problem-solving success can arise from inherent motivational differences alone and hence be achieved without inferring more complex cognitive processes.

A problem with problem solving: motivational traits, but not cognition, predict success on novel operant foraging tasks

PubMed Central

van Horik, Jayden O.; Madden, Joah R.

2016-01-01

Rates of innovative foraging behaviours and success on problem-solving tasks are often used to assay differences in cognition, both within and across species. Yet the cognitive features of some problem-solving tasks can be unclear. As such, explanations that attribute cognitive mechanisms to individual variation in problem-solving performance have revealed conflicting results. We investigated individual consistency in problem-solving performances in captive-reared pheasant chicks, Phasianus colchicus, and addressed whether success depends on cognitive processes, such as trial-and-error associative learning, or whether performances may be driven solely via noncognitive motivational mechanisms, revealed through subjects' willingness to approach, engage with and persist in their interactions with an apparatus, or via physiological traits such as body condition. While subjects' participation and success were consistent within the same problems and across similar tasks, their performances were inconsistent across different types of task. Moreover, subjects' latencies to approach each test apparatus and their attempts to access the reward were not repeatable across trials. Successful individuals did not improve their performances with experience, nor were they consistent in their techniques in repeated presentations of a task. However, individuals that were highly motivated to enter the experimental chamber were more likely to participate. Successful individuals were also faster to approach each test apparatus and more persistent in their attempts to solve the tasks than unsuccessful individuals. Our findings therefore suggest that individual differences in problem-solving success can arise from inherent motivational differences alone and hence be achieved without inferring more complex cognitive processes. PMID:27122637

Numerical approximations for fractional diffusion equations via a Chebyshev spectral-tau method

NASA Astrophysics Data System (ADS)

Doha, Eid H.; Bhrawy, Ali H.; Ezz-Eldien, Samer S.

2013-10-01

In this paper, a class of fractional diffusion equations with variable coefficients is considered. An accurate and efficient spectral tau technique for solving the fractional diffusion equations numerically is proposed. This method is based upon Chebyshev tau approximation together with Chebyshev operational matrix of Caputo fractional differentiation. Such approach has the advantage of reducing the problem to the solution of a system of algebraic equations, which may then be solved by any standard numerical technique. We apply this general method to solve four specific examples. In each of the examples considered, the numerical results show that the proposed method is of high accuracy and is efficient for solving the time-dependent fractional diffusion equations.

Very Large Scale Optimization

NASA Technical Reports Server (NTRS)

Vanderplaats, Garrett; Townsend, James C. (Technical Monitor)

2002-01-01

The purpose of this research under the NASA Small Business Innovative Research program was to develop algorithms and associated software to solve very large nonlinear, constrained optimization tasks. Key issues included efficiency, reliability, memory, and gradient calculation requirements. This report describes the general optimization problem, ten candidate methods, and detailed evaluations of four candidates. The algorithm chosen for final development is a modern recreation of a 1960s external penalty function method that uses very limited computer memory and computational time. Although of lower efficiency, the new method can solve problems orders of magnitude larger than current methods. The resulting BIGDOT software has been demonstrated on problems with 50,000 variables and about 50,000 active constraints. For unconstrained optimization, it has solved a problem in excess of 135,000 variables. The method includes a technique for solving discrete variable problems that finds a "good" design, although a theoretical optimum cannot be guaranteed. It is very scalable in that the number of function and gradient evaluations does not change significantly with increased problem size. Test cases are provided to demonstrate the efficiency and reliability of the methods and software.

A comparison of Heuristic method and Llewellyn’s rules for identification of redundant constraints

NASA Astrophysics Data System (ADS)

Estiningsih, Y.; Farikhin; Tjahjana, R. H.

2018-03-01

Important techniques in linear programming is modelling and solving practical optimization. Redundant constraints are consider for their effects on general linear programming problems. Identification and reduce redundant constraints are for avoidance of all the calculations associated when solving an associated linear programming problems. Many researchers have been proposed for identification redundant constraints. This paper a compararison of Heuristic method and Llewellyn’s rules for identification of redundant constraints.

Efficacy of problem based learning in a high school science classroom

NASA Astrophysics Data System (ADS)

Rissi, James Ryan

At the high school level, the maturity of the students, as well as constraints of the traditional high school (both in terms of class time, and number of students), impedes the use of the Problem-based instruction. But with more coaching, guidance, and planning, Problem-based Learning may be an effective teaching technique with secondary students. In recent years, the State of Michigan High School Content Expectations have emphasized the importance of inquiry and problem solving in the high school science classroom. In order to help students gain inquiry and problem solving skills, a move towards a problem-based curriculum and away from the didactic approach may lead to favorable results. In this study, the problem-based-learning framework was implemented in a high school Anatomy and Physiology classroom. Using pre-tests and post-tests over the material presented using the Problem-based technique, student comprehension and long-term retention of the material was monitored. It was found that Problem-based Learning produced comparable test performance when compared to traditional lecture, note-taking, and enrichment activities. In addition, students showed evidence of gaining research and team-working skills.

Creater-cizes: Creativity Exercises.

ERIC Educational Resources Information Center

Rule, Michael

1998-01-01

Creativity exercises, or creater-cizes, can help camp staff generate ideas and solve problems. Common techniques are brainstorming, story-boarding, analogies and metaphors, association and free association, spinning, and lists. Defines and gives examples of each technique. (SAS)

Solving Constraint-Satisfaction Problems In Prolog Language

NASA Technical Reports Server (NTRS)

Nachtsheim, Philip R.

1991-01-01

Technique for solution of constraint-satisfaction problems uses definite-clause grammars of Prolog computer language. Exploits fact that grammar-rule notation viewed as "state-change notation". Facilitates development of dynamic representation performing informed as well as blind searches. Applicable to design, scheduling, and planning problems.

A device-oriented optimizer for solving ground state problems on an approximate quantum computer, Part II: Experiments for interacting spin and molecular systems

NASA Astrophysics Data System (ADS)

Kandala, Abhinav; Mezzacapo, Antonio; Temme, Kristan; Bravyi, Sergey; Takita, Maika; Chavez-Garcia, Jose; Córcoles, Antonio; Smolin, John; Chow, Jerry; Gambetta, Jay

Hybrid quantum-classical algorithms can be used to find variational solutions to generic quantum problems. Here, we present an experimental implementation of a device-oriented optimizer that uses superconducting quantum hardware. The experiment relies on feedback between the quantum device and classical optimization software which is robust to measurement noise. Our device-oriented approach uses naturally available interactions for the preparation of trial states. We demonstrate the application of this technique for solving interacting spin and molecular structure problems.

Indirect addressing and load balancing for faster solution to Mandelbrot Set on SIMD architectures

NASA Technical Reports Server (NTRS)

Tomboulian, Sherryl

1989-01-01

SIMD computers with local indirect addressing allow programs to have queues and buffers, making certain kinds of problems much more efficient. Examined here are a class of problems characterized by computations on data points where the computation is identical, but the convergence rate is data dependent. Normally, in this situation, the algorithm time is governed by the maximum number of iterations required by each point. Using indirect addressing allows a processor to proceed to the next data point when it is done, reducing the overall number of iterations required to approach the mean convergence rate when a sufficiently large problem set is solved. Load balancing techniques can be applied for additional performance improvement. Simulations of this technique applied to solving Mandelbrot Sets indicate significant performance gains.

Some variance reduction methods for numerical stochastic homogenization.

PubMed

Blanc, X; Le Bris, C; Legoll, F

2016-04-28

We give an overview of a series of recent studies devoted to variance reduction techniques for numerical stochastic homogenization. Numerical homogenization requires that a set of problems is solved at the microscale, the so-called corrector problems. In a random environment, these problems are stochastic and therefore need to be repeatedly solved, for several configurations of the medium considered. An empirical average over all configurations is then performed using the Monte Carlo approach, so as to approximate the effective coefficients necessary to determine the macroscopic behaviour. Variance severely affects the accuracy and the cost of such computations. Variance reduction approaches, borrowed from other contexts in the engineering sciences, can be useful. Some of these variance reduction techniques are presented, studied and tested here. © 2016 The Author(s).

Optimal mistuning for enhanced aeroelastic stability of transonic fans

NASA Technical Reports Server (NTRS)

Hall, K. C.; Crawley, E. F.

1983-01-01

An inverse design procedure was developed for the design of a mistuned rotor. The design requirements are that the stability margin of the eigenvalues of the aeroelastic system be greater than or equal to some minimum stability margin, and that the mass added to each blade be positive. The objective was to achieve these requirements with a minimal amount of mistuning. Hence, the problem was posed as a constrained optimization problem. The constrained minimization problem was solved by the technique of mathematical programming via augmented Lagrangians. The unconstrained minimization phase of this technique was solved by the variable metric method. The bladed disk was modelled as being composed of a rigid disk mounted on a rigid shaft. Each of the blades were modelled with a single tosional degree of freedom.

Metacognitive skills and students' motivation toward chemical equilibrium problem solving ability: A correlational study on students of XI IPA SMAN 2 Banjarmasin

NASA Astrophysics Data System (ADS)

Muna, Khairiatul; Sanjaya, Rahmat Eko; Syahmani, Bakti, Iriani

2017-12-01

The demand for students to have metacognitive skills and problem solving ability can be seen in the core competencies of the 2013 curriculum. Metacognitive skills are the skills which affect students' success in solving problems depending on students' motivation. This explains the possibility of the relationship between metacognition and motivation in affecting students' achievement including problem solving. Due to the importance of metacognitive skills to solve problems and the possible relationship between metacognition and motivation, a study to find the relationship among the variables is necessary to conduct, particularly on chemistry problem solving. This one shot case study using quantitative method aimed to investigate the correlation between metacognitive skills and motivation toward problem solving ability focusing on chemical equilibrium. The research population was students of grade XI of majoring Science of Banjarmasin Public High Scool 2 (XI IPA SMAN 2 Banjarmasin) with the samples of 33 students obtained by using purposive sampling technique. The research data were collected using test and non-test and analyzed using multiple regression in SPSS 21. The results of this study showed that (1) the students' metacognitive skills and motivation correlated positively with coefficient of +0.450 to problem solving ability on chemical equilibrium: (2) inter-variables of students' motivation (self-efficacy, active learning strategies, science/chemistry learning value, performance goal, achievement goal, and learning environment stimulations) correlated positively to metacognitive skills with the correlation coefficients of +0.580, +0.537, +0.363, +0.241, +0.516, and +0.271, respectively. Based on the results, it is necessary for teachers to implement learning which develops students' metacognitive skills and motivation, such as learning with scientific approach. The implementation of the learning is also supposed to be complemented with the use of learning device, such as student worksheet, to help students use their metacognitive skills in solving problems, particularly on chemistry subject.

Rational-Emotive Therapy and Youth: Some New Techniques for Counselors.

ERIC Educational Resources Information Center

Roush, David W.

1984-01-01

Derived from experience with cognitively and emotionally impaired juvenile offenders, several techniques are presented to increase the effectiveness of Rational Emotive Therapy with youth. The techniques provide young people with useful tools for building an effective personal problem solving approach to life. (JAC)

A variable-gain output feedback control design methodology

NASA Technical Reports Server (NTRS)

Halyo, Nesim; Moerder, Daniel D.; Broussard, John R.; Taylor, Deborah B.

1989-01-01

A digital control system design technique is developed in which the control system gain matrix varies with the plant operating point parameters. The design technique is obtained by formulating the problem as an optimal stochastic output feedback control law with variable gains. This approach provides a control theory framework within which the operating range of a control law can be significantly extended. Furthermore, the approach avoids the major shortcomings of the conventional gain-scheduling techniques. The optimal variable gain output feedback control problem is solved by embedding the Multi-Configuration Control (MCC) problem, previously solved at ICS. An algorithm to compute the optimal variable gain output feedback control gain matrices is developed. The algorithm is a modified version of the MCC algorithm improved so as to handle the large dimensionality which arises particularly in variable-gain control problems. The design methodology developed is applied to a reconfigurable aircraft control problem. A variable-gain output feedback control problem was formulated to design a flight control law for an AFTI F-16 aircraft which can automatically reconfigure its control strategy to accommodate failures in the horizontal tail control surface. Simulations of the closed-loop reconfigurable system show that the approach produces a control design which can accommodate such failures with relative ease. The technique can be applied to many other problems including sensor failure accommodation, mode switching control laws and super agility.

A survey of mixed finite element methods

NASA Technical Reports Server (NTRS)

Brezzi, F.

1987-01-01

This paper is an introduction to and an overview of mixed finite element methods. It discusses the mixed formulation of certain basic problems in elasticity and hydrodynamics. It also discusses special techniques for solving the discrete problem.

Group Design Problems in Engineering Design Graphics.

ERIC Educational Resources Information Center

Kelley, David

2001-01-01

Describes group design techniques used within the engineering design graphics sequence at Western Washington University. Engineering and design philosophies such as concurrent engineering place an emphasis on group collaboration for the solving of design problems. (Author/DDR)

Playful Physics

NASA Technical Reports Server (NTRS)

Weaver, David

2008-01-01

Effectively communicate qualitative and quantitative information orally and in writing. Explain the application of fundamental physical principles to various physical phenomena. Apply appropriate problem-solving techniques to practical and meaningful problems using graphical, mathematical, and written modeling tools. Work effectively in collaborative groups.

Solution and reasoning reuse in space planning and scheduling applications

NASA Technical Reports Server (NTRS)

Verfaillie, Gerard; Schiex, Thomas

1994-01-01

In the space domain, as in other domains, the CSP (Constraint Satisfaction Problems) techniques are increasingly used to represent and solve planning and scheduling problems. But these techniques have been developed to solve CSP's which are composed of fixed sets of variables and constraints, whereas many planning and scheduling problems are dynamic. It is therefore important to develop methods which allow a new solution to be rapidly found, as close as possible to the previous one, when some variables or constraints are added or removed. After presenting some existing approaches, this paper proposes a simple and efficient method, which has been developed on the basis of the dynamic backtracking algorithm. This method allows previous solution and reasoning to be reused in the framework of a CSP which is close to the previous one. Some experimental results on general random CSPs and on operation scheduling problems for remote sensing satellites are given.

Numerical optimization in Hilbert space using inexact function and gradient evaluations

NASA Technical Reports Server (NTRS)

Carter, Richard G.

1989-01-01

Trust region algorithms provide a robust iterative technique for solving non-convex unstrained optimization problems, but in many instances it is prohibitively expensive to compute high accuracy function and gradient values for the method. Of particular interest are inverse and parameter estimation problems, since function and gradient evaluations involve numerically solving large systems of differential equations. A global convergence theory is presented for trust region algorithms in which neither function nor gradient values are known exactly. The theory is formulated in a Hilbert space setting so that it can be applied to variational problems as well as the finite dimensional problems normally seen in trust region literature. The conditions concerning allowable error are remarkably relaxed: relative errors in the gradient error condition is automatically satisfied if the error is orthogonal to the gradient approximation. A technique for estimating gradient error and improving the approximation is also presented.

A Generalized Fast Frequency Sweep Algorithm for Coupled Circuit-EM Simulations

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

Rockway, J D; Champagne, N J; Sharpe, R M

2004-01-14

Frequency domain techniques are popular for analyzing electromagnetics (EM) and coupled circuit-EM problems. These techniques, such as the method of moments (MoM) and the finite element method (FEM), are used to determine the response of the EM portion of the problem at a single frequency. Since only one frequency is solved at a time, it may take a long time to calculate the parameters for wideband devices. In this paper, a fast frequency sweep based on the Asymptotic Wave Expansion (AWE) method is developed and applied to generalized mixed circuit-EM problems. The AWE method, which was originally developed for lumped-loadmore » circuit simulations, has recently been shown to be effective at quasi-static and low frequency full-wave simulations. Here it is applied to a full-wave MoM solver, capable of solving for metals, dielectrics, and coupled circuit-EM problems.« less

Identification and addressing reduction-related misconceptions

NASA Astrophysics Data System (ADS)

Gal-Ezer, Judith; Trakhtenbrot, Mark

2016-07-01

Reduction is one of the key techniques used for problem-solving in computer science. In particular, in the theory of computation and complexity (TCC), mapping and polynomial reductions are used for analysis of decidability and computational complexity of problems, including the core concept of NP-completeness. Reduction is a highly abstract technique that involves revealing close non-trivial connections between problems that often seem to have nothing in common. As a result, proper understanding and application of reduction is a serious challenge for students and a source of numerous misconceptions. The main contribution of this paper is detection of such misconceptions, analysis of their roots, and proposing a way to address them in an undergraduate TCC course. Our observations suggest that the main source of the misconceptions is the false intuitive rule "the bigger is a set/problem, the harder it is to solve". Accordingly, we developed a series of exercises for proactive prevention of these misconceptions.

Electrodynamics; Problems and solutions

NASA Astrophysics Data System (ADS)

Ilie, Carolina C.; Schrecengost, Zachariah S.

2018-05-01

This book of problems and solutions is a natural continuation of Ilie and Schrecengost's first book Electromagnetism: Problems and Solutions. Aimed towards students who would like to work independently on more electrodynamics problems in order to deepen their understanding and problem-solving skills, this book discusses main concepts and techniques related to Maxwell's equations, conservation laws, electromagnetic waves, potentials and fields, and radiation.

Dynamic programming and graph algorithms in computer vision.

PubMed

Felzenszwalb, Pedro F; Zabih, Ramin

2011-04-01

Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting since, by carefully exploiting problem structure, they often provide nontrivial guarantees concerning solution quality. In this paper, we review dynamic programming and graph algorithms, and discuss representative examples of how these discrete optimization techniques have been applied to some classical vision problems. We focus on the low-level vision problem of stereo, the mid-level problem of interactive object segmentation, and the high-level problem of model-based recognition.

Techniques in Chemistry: The Centerpiece of a Research-Oriented Curriculum.

ERIC Educational Resources Information Center

Hanks, T. W.; Wright, Laura L.

2002-01-01

Introduces the Techniques in Chemistry I course taught in the Furman University Department of Chemistry which focuses on organic and inorganic chemistry. Uses a problem solving approach and active learning. (Contains 17 references.) (YDS)

Simulation of Neural Firing Dynamics: A Student Project.

ERIC Educational Resources Information Center

Kletsky, E. J.

This paper describes a student project in digital simulation techniques that is part of a graduate systems analysis course entitled Biosimulation. The students chose different simulation techniques to solve a problem related to the neuron model. (MLH)

Recursive heuristic classification

NASA Technical Reports Server (NTRS)

Wilkins, David C.

1994-01-01

The author will describe a new problem-solving approach called recursive heuristic classification, whereby a subproblem of heuristic classification is itself formulated and solved by heuristic classification. This allows the construction of more knowledge-intensive classification programs in a way that yields a clean organization. Further, standard knowledge acquisition and learning techniques for heuristic classification can be used to create, refine, and maintain the knowledge base associated with the recursively called classification expert system. The method of recursive heuristic classification was used in the Minerva blackboard shell for heuristic classification. Minerva recursively calls itself every problem-solving cycle to solve the important blackboard scheduler task, which involves assigning a desirability rating to alternative problem-solving actions. Knowing these ratings is critical to the use of an expert system as a component of a critiquing or apprenticeship tutoring system. One innovation of this research is a method called dynamic heuristic classification, which allows selection among dynamically generated classification categories instead of requiring them to be prenumerated.

The application of MINIQUASI to thermal program boundary and initial value problems

NASA Technical Reports Server (NTRS)

1974-01-01

The feasibility of applying the solution techniques of Miniquasi to the set of equations which govern a thermoregulatory model is investigated. For solving nonlinear equations and/or boundary conditions, a Taylor Series expansion is required for linearization of both equations and boundary conditions. The solutions are iterative and in each iteration, a problem like the linear case is solved. It is shown that Miniquasi cannot be applied to the thermoregulatory model as originally planned.

Using Perturbed QR Factorizations To Solve Linear Least-Squares Problems

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

Avron, Haim; Ng, Esmond G.; Toledo, Sivan

2008-03-21

We propose and analyze a new tool to help solve sparse linear least-squares problems min{sub x} {parallel}Ax-b{parallel}{sub 2}. Our method is based on a sparse QR factorization of a low-rank perturbation {cflx A} of A. More precisely, we show that the R factor of {cflx A} is an effective preconditioner for the least-squares problem min{sub x} {parallel}Ax-b{parallel}{sub 2}, when solved using LSQR. We propose applications for the new technique. When A is rank deficient we can add rows to ensure that the preconditioner is well-conditioned without column pivoting. When A is sparse except for a few dense rows we canmore » drop these dense rows from A to obtain {cflx A}. Another application is solving an updated or downdated problem. If R is a good preconditioner for the original problem A, it is a good preconditioner for the updated/downdated problem {cflx A}. We can also solve what-if scenarios, where we want to find the solution if a column of the original matrix is changed/removed. We present a spectral theory that analyzes the generalized spectrum of the pencil (A*A,R*R) and analyze the applications.« less

Improving Transportation Services for the University of the Thai Chamber of Commerce: A Case Study on Solving the Mixed-Fleet Vehicle Routing Problem with Split Deliveries

NASA Astrophysics Data System (ADS)

Suthikarnnarunai, N.; Olinick, E.

2009-01-01

We present a case study on the application of techniques for solving the Vehicle Routing Problem (VRP) to improve the transportation service provided by the University of The Thai Chamber of Commerce to its staff. The problem is modeled as VRP with time windows, split deliveries, and a mixed fleet. An exact algorithm and a heuristic solution procedure are developed to solve the problem and implemented in the AMPL modeling language and CPLEX Integer Programming solver. Empirical results indicate that the heuristic can find relatively good solutions in a small fraction of the time required by the exact method. We also perform sensitivity analysis and find that a savings in outsourcing cost can be achieved with a small increase in vehicle capacity.

Scaffolding for solving problem in static fluid: A case study

NASA Astrophysics Data System (ADS)

Koes-H, Supriyono; Muhardjito, Wijaya, Charisma P.

2018-01-01

Problem solving is one of the basic abilities that should be developed from learning physics. However, students still face difficulties in the process of non-routine problem-solving. Efforts are necessary to be taken in order to identify such difficulties and the solutions to solve them. An effort in the form of a diagnosis of students' performance in problem solving can be taken to identify their difficulties, and various instructional scaffolding supports can be utilized to eliminate the difficulties. This case study aimed to describe the students' difficulties in solving static fluid problems and the effort to overcome such difficulties through different scaffolding supports. The research subjects consisted of four 10-grade students of (Public Senior High School) SMAN 4 Malang selected by purposive sampling technique. The data of students' difficulties were collected via think-aloud protocol implemented on students' performance in solving non-routine static fluid problems. Subsequently, combined scaffolding supports were given to the students based on their particular difficulties. The research findings pointed out that there were several conceptual difficulties discovered from the students when solving static fluid problems, i.e. the use of buoyancy force formula, determination of all forces acting on a plane in a fluid, the resultant force on a plane in a fluid, and determination of a plane depth in a fluid. An effort that can be taken to overcome such conceptual difficulties is providing a combination of some appropriate scaffolding supports, namely question prompts with specific domains, simulation, and parallel modeling. The combination can solve students' lack of knowledge and improve their conceptual understanding, as well as help them to find solutions by linking the problems with their prior knowledge. According to the findings, teachers are suggested to diagnose the students' difficulties so that they can provide an appropriate combination of scaffolding to support their students in finding the solutions.

Algorithms and software for solving finite element equations on serial and parallel architectures

NASA Technical Reports Server (NTRS)

George, Alan

1989-01-01

Over the past 15 years numerous new techniques have been developed for solving systems of equations and eigenvalue problems arising in finite element computations. A package called SPARSPAK has been developed by the author and his co-workers which exploits these new methods. The broad objective of this research project is to incorporate some of this software in the Computational Structural Mechanics (CSM) testbed, and to extend the techniques for use on multiprocessor architectures.

Rule-governed Approaches to Physics--Newton's Third Law.

ERIC Educational Resources Information Center

Maloney, David P.

1984-01-01

Describes an approach to assessing the use of rules in solving problems related to Newton's third law of motion. Discusses the problems used, method of questioning, scoring of problem sets, and a general overview of the use of the technique in aiding the teacher in dealing with student's conceptual levels. (JM)

The Westminster Eighth Grade World Problems Course (Pilot Project).

ERIC Educational Resources Information Center

Barth, James P.; And Others

The rationale, objectives, and social studies units are provided in this curriculum guide for grade 8. Focus is upon students' assessing, hypothesizing, and synthesizing the world's critical problems. Teaching techniques are process education oriented emphasizing inquiry training, problem solving, and inductive learning in an attempt to prepare…

Application of the perturbation iteration method to boundary layer type problems.

PubMed

Pakdemirli, Mehmet

2016-01-01

The recently developed perturbation iteration method is applied to boundary layer type singular problems for the first time. As a preliminary work on the topic, the simplest algorithm of PIA(1,1) is employed in the calculations. Linear and nonlinear problems are solved to outline the basic ideas of the new solution technique. The inner and outer solutions are determined with the iteration algorithm and matched to construct a composite expansion valid within all parts of the domain. The solutions are contrasted with the available exact or numerical solutions. It is shown that the perturbation-iteration algorithm can be effectively used for solving boundary layer type problems.

GeoGebra Assist Discovery Learning Model for Problem Solving Ability and Attitude toward Mathematics

NASA Astrophysics Data System (ADS)

Murni, V.; Sariyasa, S.; Ardana, I. M.

2017-09-01

This study aims to describe the effet of GeoGebra utilization in the discovery learning model on mathematical problem solving ability and students’ attitude toward mathematics. This research was quasi experimental and post-test only control group design was used in this study. The population in this study was 181 of students. The sampling technique used was cluster random sampling, so the sample in this study was 120 students divided into 4 classes, 2 classes for the experimental class and 2 classes for the control class. Data were analyzed by using one way MANOVA. The results of data analysis showed that the utilization of GeoGebra in discovery learning can lead to solving problems and attitudes towards mathematics are better. This is because the presentation of problems using geogebra can assist students in identifying and solving problems and attracting students’ interest because geogebra provides an immediate response process to students. The results of the research are the utilization of geogebra in the discovery learning can be applied in learning and teaching wider subject matter, beside subject matter in this study.

Robust penalty method for structural synthesis

NASA Technical Reports Server (NTRS)

Kamat, M. P.

1983-01-01

The Sequential Unconstrained Minimization Technique (SUMT) offers an easy way of solving nonlinearly constrained problems. However, this algorithm frequently suffers from the need to minimize an ill-conditioned penalty function. An ill-conditioned minimization problem can be solved very effectively by posing the problem as one of integrating a system of stiff differential equations utilizing concepts from singular perturbation theory. This paper evaluates the robustness and the reliability of such a singular perturbation based SUMT algorithm on two different problems of structural optimization of widely separated scales. The report concludes that whereas conventional SUMT can be bogged down by frequent ill-conditioning, especially in large scale problems, the singular perturbation SUMT has no such difficulty in converging to very accurate solutions.

High performance techniques for space mission scheduling

NASA Technical Reports Server (NTRS)

Smith, Stephen F.

1994-01-01

In this paper, we summarize current research at Carnegie Mellon University aimed at development of high performance techniques and tools for space mission scheduling. Similar to prior research in opportunistic scheduling, our approach assumes the use of dynamic analysis of problem constraints as a basis for heuristic focusing of problem solving search. This methodology, however, is grounded in representational assumptions more akin to those adopted in recent temporal planning research, and in a problem solving framework which similarly emphasizes constraint posting in an explicitly maintained solution constraint network. These more general representational assumptions are necessitated by the predominance of state-dependent constraints in space mission planning domains, and the consequent need to integrate resource allocation and plan synthesis processes. First, we review the space mission problems we have considered to date and indicate the results obtained in these application domains. Next, we summarize recent work in constraint posting scheduling procedures, which offer the promise of better future solutions to this class of problems.

EIT image reconstruction based on a hybrid FE-EFG forward method and the complete-electrode model.

PubMed

Hadinia, M; Jafari, R; Soleimani, M

2016-06-01

This paper presents the application of the hybrid finite element-element free Galerkin (FE-EFG) method for the forward and inverse problems of electrical impedance tomography (EIT). The proposed method is based on the complete electrode model. Finite element (FE) and element-free Galerkin (EFG) methods are accurate numerical techniques. However, the FE technique has meshing task problems and the EFG method is computationally expensive. In this paper, the hybrid FE-EFG method is applied to take both advantages of FE and EFG methods, the complete electrode model of the forward problem is solved, and an iterative regularized Gauss-Newton method is adopted to solve the inverse problem. The proposed method is applied to compute Jacobian in the inverse problem. Utilizing 2D circular homogenous models, the numerical results are validated with analytical and experimental results and the performance of the hybrid FE-EFG method compared with the FE method is illustrated. Results of image reconstruction are presented for a human chest experimental phantom.

Network-Based Management Procedures.

ERIC Educational Resources Information Center

Buckner, Allen L.

Network-based management procedures serve as valuable aids in organizational management, achievement of objectives, problem solving, and decisionmaking. Network techniques especially applicable to educational management systems are the program evaluation and review technique (PERT) and the critical path method (CPM). Other network charting…

Biotechnology Apprenticeship for Secondary-Level Students: Teaching Advanced Cell Culture Techniques for Research.

ERIC Educational Resources Information Center

Lewis, Jennifer R.; Kotur, Mark S.; Butt, Omar; Kulcarni, Sumant; Riley, Alyssa A.; Ferrell, Nick; Sullivan, Kathryn D.; Ferrari, Mauro

2002-01-01

Discusses small-group apprenticeships (SGAs) as a method for introducing cell culture techniques to high school participants. Teaches cell culture practices and introduces advance imaging techniques to solve various biomedical engineering problems. Clarifies and illuminates the value of small-group laboratory apprenticeships. (Author/KHR)

Gridless particle technique for the Vlasov-Poisson system in problems with high degree of symmetry

NASA Astrophysics Data System (ADS)

Boella, E.; Coppa, G.; D'Angola, A.; Peiretti Paradisi, B.

2018-03-01

In the paper, gridless particle techniques are presented in order to solve problems involving electrostatic, collisionless plasmas. The method makes use of computational particles having the shape of spherical shells or of rings, and can be used to study cases in which the plasma has spherical or axial symmetry, respectively. As a computational grid is absent, the technique is particularly suitable when the plasma occupies a rapidly changing space region.

Fitting Prony Series To Data On Viscoelastic Materials

NASA Technical Reports Server (NTRS)

Hill, S. A.

1995-01-01

Improved method of fitting Prony series to data on viscoelastic materials involves use of least-squares optimization techniques. Based on optimization techniques yields closer correlation with data than traditional method. Involves no assumptions regarding the gamma'(sub i)s and higher-order terms, and provides for as many Prony terms as needed to represent higher-order subtleties in data. Curve-fitting problem treated as design-optimization problem and solved by use of partially-constrained-optimization techniques.

Emotional intensity reduces later generalized anxiety disorder symptoms when fear of anxiety and negative problem-solving appraisal are low.

PubMed

Sugiura, Yoshinori; Sugiura, Tomoko

2015-08-01

While research based on the emotion dysregulation model indicates a positive relationship between intense emotions and generalized anxiety disorder (GAD) symptoms, emotion-focused intervention involves the use of techniques to enhance emotional experiences, based on the notion that GAD patients are engaging in avoidance strategies. To reveal the conditions under which intense emotions lead to reduced GAD symptoms, we designed a longitudinal study to monitor changes in GAD symptoms among students (N = 129) over 3 months. Our focus was on possible moderators of the effect of emotional intensity. Results indicated that when fear of emotions and negative appraisals about problem solving were low, negative emotional intensity reduced later GAD symptoms. Moreover, under the condition of high responsibility to continue thinking, emotional intensity tended to reduce later GAD symptoms. Results suggest that reduced fear of emotions and reduced negative appraisals about problem solving may enhance the use of emotional processing techniques (e.g., emotional exposure). The interaction between responsibility to continue thinking and emotional intensity requires further examination. Copyright © 2015 The Authors. Published by Elsevier Ltd.. All rights reserved.

Three-dimensional electrical impedance tomography: a topology optimization approach.

PubMed

Mello, Luís Augusto Motta; de Lima, Cícero Ribeiro; Amato, Marcelo Britto Passos; Lima, Raul Gonzalez; Silva, Emílio Carlos Nelli

2008-02-01

Electrical impedance tomography is a technique to estimate the impedance distribution within a domain, based on measurements on its boundary. In other words, given the mathematical model of the domain, its geometry and boundary conditions, a nonlinear inverse problem of estimating the electric impedance distribution can be solved. Several impedance estimation algorithms have been proposed to solve this problem. In this paper, we present a three-dimensional algorithm, based on the topology optimization method, as an alternative. A sequence of linear programming problems, allowing for constraints, is solved utilizing this method. In each iteration, the finite element method provides the electric potential field within the model of the domain. An electrode model is also proposed (thus, increasing the accuracy of the finite element results). The algorithm is tested using numerically simulated data and also experimental data, and absolute resistivity values are obtained. These results, corresponding to phantoms with two different conductive materials, exhibit relatively well-defined boundaries between them, and show that this is a practical and potentially useful technique to be applied to monitor lung aeration, including the possibility of imaging a pneumothorax.

Profile of students’ generated representations and creative thinking skill in problem solving in vocational school

NASA Astrophysics Data System (ADS)

Fikri, P. M.; Sinaga, P.; Hasanah, L.; Solehat, D.

2018-05-01

This study aims to determine profile of students’ generated representations and creative thinking skill on problem solving in vocational school. This research is a descriptive research to get an idea of comprehend students’ generated representations and creative thinking skill on problem solving of vocational school in Bandung. Technique of collecting data is done by test method, observation, and interview. Representation is something that represents, describes or symbolizes an object or process. To evaluate the multi-representation skill used essay test with rubric of scoring was used to assess multi-depressant student skills. While creative thinking skill on problem solving used essay test which contains the components of skills in finding facts, problem finding skills, idea finding skills and solution finding skills. The results showed generated representations is still relatively low, this is proven by average student answers explanation is mathematically correct but there is no explanation verbally or graphically. While creative thinking skill on problem solving is still relatively low, this is proven by average score for skill indicator in finding the student problem is 1.52 including the non-creative category, average score for the skill indicator in finding the student idea is 1.23 including the non-creative category, and the average score of the students skill in finding this solution is 0.72 belongs to a very uncreative category.

Pseudo-point transport technique: a new method for solving the Boltzmann transport equation in media with highly fluctuating cross sections

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

Nakhai, B.

A new method for solving radiation transport problems is presented. The heart of the technique is a new cross section processing procedure for the calculation of group-to-point and point-to-group cross sections sets. The method is ideally suited for problems which involve media with highly fluctuating cross sections, where the results of the traditional multigroup calculations are beclouded by the group averaging procedures employed. Extensive computational efforts, which would be required to evaluate double integrals in the multigroup treatment numerically, prohibit iteration to optimize the energy boundaries. On the other hand, use of point-to-point techniques (as in the stochastic technique) ismore » often prohibitively expensive due to the large computer storage requirement. The pseudo-point code is a hybrid of the two aforementioned methods (group-to-group and point-to-point) - hence the name pseudo-point - that reduces the computational efforts of the former and the large core requirements of the latter. The pseudo-point code generates the group-to-point or the point-to-group transfer matrices, and can be coupled with the existing transport codes to calculate pointwise energy-dependent fluxes. This approach yields much more detail than is available from the conventional energy-group treatments. Due to the speed of this code, several iterations could be performed (in affordable computing efforts) to optimize the energy boundaries and the weighting functions. The pseudo-point technique is demonstrated by solving six problems, each depicting a certain aspect of the technique. The results are presented as flux vs energy at various spatial intervals. The sensitivity of the technique to the energy grid and the savings in computational effort are clearly demonstrated.« less

The application analysis of the multi-angle polarization technique for ocean color remote sensing

NASA Astrophysics Data System (ADS)

Zhang, Yongchao; Zhu, Jun; Yin, Huan; Zhang, Keli

2017-02-01

The multi-angle polarization technique, which uses the intensity of polarized radiation as the observed quantity, is a new remote sensing means for earth observation. With this method, not only can the multi-angle light intensity data be provided, but also the multi-angle information of polarized radiation can be obtained. So, the technique may solve the problems, those could not be solved with the traditional remote sensing methods. Nowadays, the multi-angle polarization technique has become one of the hot topics in the field of the international quantitative research on remote sensing. In this paper, we firstly introduce the principles of the multi-angle polarization technique, then the situations of basic research and engineering applications are particularly summarized and analysed in 1) the peeled-off method of sun glitter based on polarization, 2) the ocean color remote sensing based on polarization, 3) oil spill detection using polarization technique, 4) the ocean aerosol monitoring based on polarization. Finally, based on the previous work, we briefly present the problems and prospects of the multi-angle polarization technique used in China's ocean color remote sensing.

Recursive partitioned inversion of large (1500 x 1500) symmetric matrices

NASA Technical Reports Server (NTRS)

Putney, B. H.; Brownd, J. E.; Gomez, R. A.

1976-01-01

A recursive algorithm was designed to invert large, dense, symmetric, positive definite matrices using small amounts of computer core, i.e., a small fraction of the core needed to store the complete matrix. The described algorithm is a generalized Gaussian elimination technique. Other algorithms are also discussed for the Cholesky decomposition and step inversion techniques. The purpose of the inversion algorithm is to solve large linear systems of normal equations generated by working geodetic problems. The algorithm was incorporated into a computer program called SOLVE. In the past the SOLVE program has been used in obtaining solutions published as the Goddard earth models.

High speed propeller acoustics and aerodynamics - A boundary element approach

NASA Technical Reports Server (NTRS)

Farassat, F.; Myers, M. K.; Dunn, M. H.

1989-01-01

The Boundary Element Method (BEM) is applied in this paper to the problems of acoustics and aerodynamics of high speed propellers. The underlying theory is described based on the linearized Ffowcs Williams-Hawkings equation. The surface pressure on the blade is assumed unknown in the aerodynamic problem. It is obtained by solving a singular integral equation. The acoustic problem is then solved by moving the field point inside the fluid medium and evaluating some surface and line integrals. Thus the BEM provides a powerful technique in calculation of high speed propeller aerodynamics and acoustics.

Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software

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

Jeff Linderoth

2011-11-06

the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

Computational inverse methods of heat source in fatigue damage problems

NASA Astrophysics Data System (ADS)

Chen, Aizhou; Li, Yuan; Yan, Bo

2018-04-01

Fatigue dissipation energy is the research focus in field of fatigue damage at present. It is a new idea to solve the problem of calculating fatigue dissipation energy by introducing inverse method of heat source into parameter identification of fatigue dissipation energy model. This paper introduces the research advances on computational inverse method of heat source and regularization technique to solve inverse problem, as well as the existing heat source solution method in fatigue process, prospects inverse method of heat source applying in fatigue damage field, lays the foundation for further improving the effectiveness of fatigue dissipation energy rapid prediction.

Calculation of Ceramic Phase Diagrams

DTIC Science & Technology

1979-11-30

Recent examples of the use of data bases and computer techniques in solw~ng problems associated with: in-situ formation of columbium, nickel and...examples of the use of data bases and computer techniques in solving problems associated with: in-situ formation of columbium, nickel and cobalt based...covers processing of in-situ eutectic composite formation in columbium, nickel and cobalt base superalloys, sigma phase formation in high temperature

Learning and Optimization of Cognitive Capabilities. Final Project Report.

ERIC Educational Resources Information Center

Lumsdaine, A.A.; And Others

The work of a three-year series of experimental studies of human cognition is summarized in this report. Proglem solving and learning in man-machine interaction was investigated, as well as relevant variables and processes. The work included four separate projects: (1) computer-aided problem solving, (2) computer-aided instruction techniques, (3)…

A Computer Algebra Approach to Solving Chemical Equilibria in General Chemistry

ERIC Educational Resources Information Center

Kalainoff, Melinda; Lachance, Russ; Riegner, Dawn; Biaglow, Andrew

2012-01-01

In this article, we report on a semester-long study of the incorporation into our general chemistry course, of advanced algebraic and computer algebra techniques for solving chemical equilibrium problems. The method presented here is an alternative to the commonly used concentration table method for describing chemical equilibria in general…

Sensitivity calculations for iteratively solved problems

NASA Technical Reports Server (NTRS)

Haftka, R. T.

1985-01-01

The calculation of sensitivity derivatives of solutions of iteratively solved systems of algebraic equations is investigated. A modified finite difference procedure is presented which improves the accuracy of the calculated derivatives. The procedure is demonstrated for a simple algebraic example as well as an element-by-element preconditioned conjugate gradient iterative solution technique applied to truss examples.

Modelling skin penetration using the Laplace transform technique.

PubMed

Anissimov, Y G; Watkinson, A

2013-01-01

The Laplace transform is a convenient mathematical tool for solving ordinary and partial differential equations. The application of this technique to problems arising in drug penetration through the skin is reviewed in this paper. © 2013 S. Karger AG, Basel.

Implicit time-integration method for simultaneous solution of a coupled non-linear system

NASA Astrophysics Data System (ADS)

Watson, Justin Kyle

Historically large physical problems have been divided into smaller problems based on the physics involved. This is no different in reactor safety analysis. The problem of analyzing a nuclear reactor for design basis accidents is performed by a handful of computer codes each solving a portion of the problem. The reactor thermal hydraulic response to an event is determined using a system code like TRAC RELAP Advanced Computational Engine (TRACE). The core power response to the same accident scenario is determined using a core physics code like Purdue Advanced Core Simulator (PARCS). Containment response to the reactor depressurization in a Loss Of Coolant Accident (LOCA) type event is calculated by a separate code. Sub-channel analysis is performed with yet another computer code. This is just a sample of the computer codes used to solve the overall problems of nuclear reactor design basis accidents. Traditionally each of these codes operates independently from each other using only the global results from one calculation as boundary conditions to another. Industry's drive to uprate power for reactors has motivated analysts to move from a conservative approach to design basis accident towards a best estimate method. To achieve a best estimate calculation efforts have been aimed at coupling the individual physics models to improve the accuracy of the analysis and reduce margins. The current coupling techniques are sequential in nature. During a calculation time-step data is passed between the two codes. The individual codes solve their portion of the calculation and converge to a solution before the calculation is allowed to proceed to the next time-step. This thesis presents a fully implicit method of simultaneous solving the neutron balance equations, heat conduction equations and the constitutive fluid dynamics equations. It discusses the problems involved in coupling different physics phenomena within multi-physics codes and presents a solution to these problems. The thesis also outlines the basic concepts behind the nodal balance equations, heat transfer equations and the thermal hydraulic equations, which will be coupled to form a fully implicit nonlinear system of equations. The coupling of separate physics models to solve a larger problem and improve accuracy and efficiency of a calculation is not a new idea, however implementing them in an implicit manner and solving the system simultaneously is. Also the application to reactor safety codes is new and has not be done with thermal hydraulics and neutronics codes on realistic applications in the past. The coupling technique described in this thesis is applicable to other similar coupled thermal hydraulic and core physics reactor safety codes. This technique is demonstrated using coupled input decks to show that the system is solved correctly and then verified by using two derivative test problems based on international benchmark problems the OECD/NRC Three mile Island (TMI) Main Steam Line Break (MSLB) problem (representative of pressurized water reactor analysis) and the OECD/NRC Peach Bottom (PB) Turbine Trip (TT) benchmark (representative of boiling water reactor analysis).

Reminiscence and adaptation to critical life events in older adults with mild to moderate depressive symptoms.

PubMed

Korte, Jojanneke; Bohlmeijer, Ernst T; Westerhof, Gerben J; Pot, Anne Margriet; Pot, Anne M

2011-07-01

The role of reminiscence as a way of adapting to critical life events and chronic medical conditions was investigated in older adults with mild to moderate depressive symptoms. Reminiscence is the (non)volitional act or process of recollecting memories of one's self in the past. 171 Dutch older adults with a mean age of 64 years (SD = 7.4) participated in this study. All of them had mild to moderate depressive symptoms. Participants completed measures on critical life events, chronic medical conditions, depressive symptoms, symptoms of anxiety and satisfaction with life. The reminiscence functions included were: identity, problem solving, bitterness revival and boredom reduction. Critical life events were positively correlated with identity and problem solving. Bitterness revival and boredom reduction were both positively correlated with depressive and anxiety symptoms, and negatively to satisfaction with life. Problem solving had a negative relation with anxiety symptoms. When all the reminiscence functions were included, problem solving was uniquely associated with symptoms of anxiety, and bitterness revival was uniquely associated with depressive symptoms and satisfaction with life. Interestingly, problem solving mediated the relation of critical life events with anxiety. This study corroborates the theory that reminiscence plays a role in coping with critical life events, and thereby maintaining mental health. Furthermore, it is recommended that therapists focus on techniques which reduce bitterness revival in people with depressive symptoms, and focus on problem-solving reminiscences among people with anxiety symptoms.

The Convergence of Intelligences

NASA Astrophysics Data System (ADS)

Diederich, Joachim

Minsky (1985) argued an extraterrestrial intelligence may be similar to ours despite very different origins. ``Problem- solving'' offers evolutionary advantages and individuals who are part of a technical civilisation should have this capacity. On earth, the principles of problem-solving are the same for humans, some primates and machines based on Artificial Intelligence (AI) techniques. Intelligent systems use ``goals'' and ``sub-goals'' for problem-solving, with memories and representations of ``objects'' and ``sub-objects'' as well as knowledge of relations such as ``cause'' or ``difference.'' Some of these objects are generic and cannot easily be divided into parts. We must, therefore, assume that these objects and relations are universal, and a general property of intelligence. Minsky's arguments from 1985 are extended here. The last decade has seen the development of a general learning theory (``computational learning theory'' (CLT) or ``statistical learning theory'') which equally applies to humans, animals and machines. It is argued that basic learning laws will also apply to an evolved alien intelligence, and this includes limitations of what can be learned efficiently. An example from CLT is that the general learning problem for neural networks is intractable, i.e. it cannot be solved efficiently for all instances (it is ``NP-complete''). It is the objective of this paper to show that evolved intelligences will be constrained by general learning laws and will use task-decomposition for problem-solving. Since learning and problem-solving are core features of intelligence, it can be said that intelligences converge despite very different origins.

Dynamic Programming and Graph Algorithms in Computer Vision*

PubMed Central

Felzenszwalb, Pedro F.; Zabih, Ramin

2013-01-01

Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting, since by carefully exploiting problem structure they often provide non-trivial guarantees concerning solution quality. In this paper we briefly review dynamic programming and graph algorithms, and discuss representative examples of how these discrete optimization techniques have been applied to some classical vision problems. We focus on the low-level vision problem of stereo; the mid-level problem of interactive object segmentation; and the high-level problem of model-based recognition. PMID:20660950

Learning to Predict Combinatorial Structures

NASA Astrophysics Data System (ADS)

Vembu, Shankar

2009-12-01

The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions to ensure efficient, polynomial time estimation of model parameters. For several combinatorial structures, including cycles, partially ordered sets, permutations and other graph classes, these assumptions do not hold. In this thesis, we address the problem of designing learning algorithms for predicting combinatorial structures by introducing two new assumptions: (i) The first assumption is that a particular counting problem can be solved efficiently. The consequence is a generalisation of the classical ridge regression for structured prediction. (ii) The second assumption is that a particular sampling problem can be solved efficiently. The consequence is a new technique for designing and analysing probabilistic structured prediction models. These results can be applied to solve several complex learning problems including but not limited to multi-label classification, multi-category hierarchical classification, and label ranking.

Three-dimensional elasticity solution of an infinite plate with a circular hole

NASA Technical Reports Server (NTRS)

Delale, F.; Erdogan, F.

1982-01-01

The elasticity problem for a thick plate with a circular hole is formulated in a systematic fashion by using the z-component of the Galerkin vector and that of Muki's harmonic vector function. The problem was originally solved by Alblas. The reasons for reconsidering it are to develop a technique which may be used in solving the elasticity problem for a multilayered plate and to verify and extend the results given by Alblas. The problem is reduced to an infinite system of algebraic equations which is solved by the method of reduction. Various stress components are tabulated as functions of a/h, z/h, r/a, and nu, a and 2h being the radius of the hole and the plate thickness and nu, the Poisson's ratio. The significant effect of the Poisson's ratio on the behavior and the magnitude of the stresses is discussed.

Applications of Genetic Methods to NASA Design and Operations Problems

NASA Technical Reports Server (NTRS)

Laird, Philip D.

1996-01-01

We review four recent NASA-funded applications in which evolutionary/genetic methods are important. In the process we survey: the kinds of problems being solved today with these methods; techniques and tools used; problems encountered; and areas where research is needed. The presentation slides are annotated briefly at the top of each page.

Sharing Teaching Ideas: Active Participation in the Classroom through Creative Problem Generation.

ERIC Educational Resources Information Center

Gonzales, Nancy A.; And Others

1996-01-01

Presents an activity to involve students in mathematical communication and creative thinking. The activity is similar to the "pass it along" gossip game in which each person in a chain adds a piece of information. The class analyzes the resulting mathematics problem using George Polya's problem-solving techniques. (MKR)

Student Task Force: An Experiment in Interdisciplinary Education.

ERIC Educational Resources Information Center

Weiner, Harry

During the first semester of the 1971-72 academic year, students at 7 universities located in urban areas across the U.S. participated in an interdisciplinary program that was designed to help the students develop problem-solving techniques. The particular problem that the students attacked was that of drug addiction. This problem incorporated the…

Solving fractional optimal control problems within a Chebyshev-Legendre operational technique

NASA Astrophysics Data System (ADS)

Bhrawy, A. H.; Ezz-Eldien, S. S.; Doha, E. H.; Abdelkawy, M. A.; Baleanu, D.

2017-06-01

In this manuscript, we report a new operational technique for approximating the numerical solution of fractional optimal control (FOC) problems. The operational matrix of the Caputo fractional derivative of the orthonormal Chebyshev polynomial and the Legendre-Gauss quadrature formula are used, and then the Lagrange multiplier scheme is employed for reducing such problems into those consisting of systems of easily solvable algebraic equations. We compare the approximate solutions achieved using our approach with the exact solutions and with those presented in other techniques and we show the accuracy and applicability of the new numerical approach, through two numerical examples.

Computational experiments in the optimal slewing of flexible structures

NASA Technical Reports Server (NTRS)

Baker, T. E.; Polak, Lucian Elijah

1989-01-01

Numerical experiments on the problem of moving a flexible beam are discussed. An optimal control problem is formulated and transcribed into a form which can be solved using semi-infinite optimization techniques. All experiments were carried out on a SUN 3 microcomputer.

Neuroscience: toward unbinding the binding problem.

PubMed

Whitney, David

2009-03-24

How the brain 'binds' information to create a coherent perceptual experience is an enduring question. Recent research in the psychophysics of perceptual binding and developments in fMRI analysis techniques are bringing us closer to an understanding of how the brain solves the binding problem.

Simulation Insights Using "R"

ERIC Educational Resources Information Center

Kostadinov, Boyan

2013-01-01

This article attempts to introduce the reader to computational thinking and solving problems involving randomness. The main technique being employed is the Monte Carlo method, using the freely available software "R for Statistical Computing." The author illustrates the computer simulation approach by focusing on several problems of…

The School Leadership Literature in Managerialist Times: Exploring the Problem of Textual Apologism.

ERIC Educational Resources Information Center

Thrupp, Martin

2003-01-01

Critiques major topics or themes in school-leadership texts, such as problem-solving techniques; suggests alternative topics or themes for school administrators, such as ideas-based leadership. Draws implications for writers on school leadership. (Contains 59 references.) (PKP)

Biotechnology Apprenticeship for Secondary-Level Students: Teaching Advanced Cell Culture Techniques for Research

ERIC Educational Resources Information Center

Lewis, Jennifer R.; Kotur, Mark S.; Butt, Omar; Kulcarni, Sumant; Riley, Alyssa A.; Ferrell, Nick; Sullivan, Kathryn D.; Ferrari, Mauro

2002-01-01

The purpose of this article is to discuss "small-group apprenticeships (SGAs)" as a method to instruct cell culture techniques to high school participants. The study aimed to teach cell culture practices and to introduce advanced imaging techniques to solve various biomedical engineering problems. Participants designed and completed experiments…

Exploring Fencerows--An Outdoor Teaching Technique.

ERIC Educational Resources Information Center

Rillo, Thomas J.

The exploration of fencerows as an outdoor teaching technique is described. The concepts that can be developed as students walk down the fencerows are related to science, life styles, and economy. By dividing a class into small groups, a teacher can employ problem-solving techniques in fencerow exploration. The following group topics are possible…

Project TEAMS (Techniques and Education for Achieving Management Skills): Business and Industrial Supervisors.

ERIC Educational Resources Information Center

Platte Technical Community Coll., Columbus, NE.

These Project TEAMS (Techniques and Education for Achieving Management Skills) instructional materials consist of five units for use in training business and industrial supervisors. Unit 1 is designed to help managers in business or industry increase management skills in regard to leadership techniques, problem solving and decision making, and…

Mathematical Geology.

ERIC Educational Resources Information Center

Jones, Thomas A.

1983-01-01

Mathematical techniques used to solve geological problems are briefly discussed (including comments on use of geostatistics). Highlights of conferences/meetings and conference papers in mathematical geology are also provided. (JN)

Bio-Inspired Genetic Algorithms with Formalized Crossover Operators for Robotic Applications.

PubMed

Zhang, Jie; Kang, Man; Li, Xiaojuan; Liu, Geng-Yang

2017-01-01

Genetic algorithms are widely adopted to solve optimization problems in robotic applications. In such safety-critical systems, it is vitally important to formally prove the correctness when genetic algorithms are applied. This paper focuses on formal modeling of crossover operations that are one of most important operations in genetic algorithms. Specially, we for the first time formalize crossover operations with higher-order logic based on HOL4 that is easy to be deployed with its user-friendly programing environment. With correctness-guaranteed formalized crossover operations, we can safely apply them in robotic applications. We implement our technique to solve a path planning problem using a genetic algorithm with our formalized crossover operations, and the results show the effectiveness of our technique.

Problem-Solving Phase Transitions During Team Collaboration.

PubMed

Wiltshire, Travis J; Butner, Jonathan E; Fiore, Stephen M

2018-01-01

Multiple theories of problem-solving hypothesize that there are distinct qualitative phases exhibited during effective problem-solving. However, limited research has attempted to identify when transitions between phases occur. We integrate theory on collaborative problem-solving (CPS) with dynamical systems theory suggesting that when a system is undergoing a phase transition it should exhibit a peak in entropy and that entropy levels should also relate to team performance. Communications from 40 teams that collaborated on a complex problem were coded for occurrence of problem-solving processes. We applied a sliding window entropy technique to each team's communications and specified criteria for (a) identifying data points that qualify as peaks and (b) determining which peaks were robust. We used multilevel modeling, and provide a qualitative example, to evaluate whether phases exhibit distinct distributions of communication processes. We also tested whether there was a relationship between entropy values at transition points and CPS performance. We found that a proportion of entropy peaks was robust and that the relative occurrence of communication codes varied significantly across phases. Peaks in entropy thus corresponded to qualitative shifts in teams' CPS communications, providing empirical evidence that teams exhibit phase transitions during CPS. Also, lower average levels of entropy at the phase transition points predicted better CPS performance. We specify future directions to improve understanding of phase transitions during CPS, and collaborative cognition, more broadly. Copyright © 2017 Cognitive Science Society, Inc.

Space-dependent perfusion coefficient estimation in a 2D bioheat transfer problem

NASA Astrophysics Data System (ADS)

Bazán, Fermín S. V.; Bedin, Luciano; Borges, Leonardo S.

2017-05-01

In this work, a method for estimating the space-dependent perfusion coefficient parameter in a 2D bioheat transfer model is presented. In the method, the bioheat transfer model is transformed into a time-dependent semidiscrete system of ordinary differential equations involving perfusion coefficient values as parameters, and the estimation problem is solved through a nonlinear least squares technique. In particular, the bioheat problem is solved by the method of lines based on a highly accurate pseudospectral approach, and perfusion coefficient values are estimated by the regularized Gauss-Newton method coupled with a proper regularization parameter. The performance of the method on several test problems is illustrated numerically.

Variational data assimilation for the initial-value dynamo problem.

PubMed

Li, Kuan; Jackson, Andrew; Livermore, Philip W

2011-11-01

The secular variation of the geomagnetic field as observed at the Earth's surface results from the complex magnetohydrodynamics taking place in the fluid core of the Earth. One way to analyze this system is to use the data in concert with an underlying dynamical model of the system through the technique of variational data assimilation, in much the same way as is employed in meteorology and oceanography. The aim is to discover an optimal initial condition that leads to a trajectory of the system in agreement with observations. Taking the Earth's core to be an electrically conducting fluid sphere in which convection takes place, we develop the continuous adjoint forms of the magnetohydrodynamic equations that govern the dynamical system together with the corresponding numerical algorithms appropriate for a fully spectral method. These adjoint equations enable a computationally fast iterative improvement of the initial condition that determines the system evolution. The initial condition depends on the three dimensional form of quantities such as the magnetic field in the entire sphere. For the magnetic field, conservation of the divergence-free condition for the adjoint magnetic field requires the introduction of an adjoint pressure term satisfying a zero boundary condition. We thus find that solving the forward and adjoint dynamo system requires different numerical algorithms. In this paper, an efficient algorithm for numerically solving this problem is developed and tested for two illustrative problems in a whole sphere: one is a kinematic problem with prescribed velocity field, and the second is associated with the Hall-effect dynamo, exhibiting considerable nonlinearity. The algorithm exhibits reliable numerical accuracy and stability. Using both the analytical and the numerical techniques of this paper, the adjoint dynamo system can be solved directly with the same order of computational complexity as that required to solve the forward problem. These numerical techniques form a foundation for ultimate application to observations of the geomagnetic field over the time scale of centuries.

CometBoards Users Manual Release 1.0

NASA Technical Reports Server (NTRS)

Guptill, James D.; Coroneos, Rula M.; Patnaik, Surya N.; Hopkins, Dale A.; Berke, Lazlo

1996-01-01

Several nonlinear mathematical programming algorithms for structural design applications are available at present. These include the sequence of unconstrained minimizations technique, the method of feasible directions, and the sequential quadratic programming technique. The optimality criteria technique and the fully utilized design concept are two other structural design methods. A project was undertaken to bring all these design methods under a common computer environment so that a designer can select any one of these tools that may be suitable for his/her application. To facilitate selection of a design algorithm, to validate and check out the computer code, and to ascertain the relative merits of the design tools, modest finite element structural analysis programs based on the concept of stiffness and integrated force methods have been coupled to each design method. The code that contains both these design and analysis tools, by reading input information from analysis and design data files, can cast the design of a structure as a minimum-weight optimization problem. The code can then solve it with a user-specified optimization technique and a user-specified analysis method. This design code is called CometBoards, which is an acronym for Comparative Evaluation Test Bed of Optimization and Analysis Routines for the Design of Structures. This manual describes for the user a step-by-step procedure for setting up the input data files and executing CometBoards to solve a structural design problem. The manual includes the organization of CometBoards; instructions for preparing input data files; the procedure for submitting a problem; illustrative examples; and several demonstration problems. A set of 29 structural design problems have been solved by using all the optimization methods available in CometBoards. A summary of the optimum results obtained for these problems is appended to this users manual. CometBoards, at present, is available for Posix-based Cray and Convex computers, Iris and Sun workstations, and the VM/CMS system.

Large-scale inverse model analyses employing fast randomized data reduction

NASA Astrophysics Data System (ADS)

Lin, Youzuo; Le, Ellen B.; O'Malley, Daniel; Vesselinov, Velimir V.; Bui-Thanh, Tan

2017-08-01

When the number of observations is large, it is computationally challenging to apply classical inverse modeling techniques. We have developed a new computationally efficient technique for solving inverse problems with a large number of observations (e.g., on the order of 107 or greater). Our method, which we call the randomized geostatistical approach (RGA), is built upon the principal component geostatistical approach (PCGA). We employ a data reduction technique combined with the PCGA to improve the computational efficiency and reduce the memory usage. Specifically, we employ a randomized numerical linear algebra technique based on a so-called "sketching" matrix to effectively reduce the dimension of the observations without losing the information content needed for the inverse analysis. In this way, the computational and memory costs for RGA scale with the information content rather than the size of the calibration data. Our algorithm is coded in Julia and implemented in the MADS open-source high-performance computational framework (http://mads.lanl.gov). We apply our new inverse modeling method to invert for a synthetic transmissivity field. Compared to a standard geostatistical approach (GA), our method is more efficient when the number of observations is large. Most importantly, our method is capable of solving larger inverse problems than the standard GA and PCGA approaches. Therefore, our new model inversion method is a powerful tool for solving large-scale inverse problems. The method can be applied in any field and is not limited to hydrogeological applications such as the characterization of aquifer heterogeneity.

Direct SQP-methods for solving optimal control problems with delays

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

Goellmann, L.; Bueskens, C.; Maurer, H.

The maximum principle for optimal control problems with delays leads to a boundary value problem (BVP) which is retarded in the state and advanced in the costate function. Based on shooting techniques, solution methods for this type of BVP have been proposed. In recent years, direct optimization methods have been favored for solving control problems without delays. Direct methods approximate the control and the state over a fixed mesh and solve the resulting NLP-problem with SQP-methods. These methods dispense with the costate function and have shown to be robust and efficient. In this paper, we propose a direct SQP-method formore » retarded control problems. In contrast to conventional direct methods, only the control variable is approximated by e.g. spline-functions. The state is computed via a high order Runge-Kutta type algorithm and does not enter explicitly the NLP-problem through an equation. This approach reduces the number of optimization variables considerably and is implementable even on a PC. Our method is illustrated by the numerical solution of retarded control problems with constraints. In particular, we consider the control of a continuous stirred tank reactor which has been solved by dynamic programming. This example illustrates the robustness and efficiency of the proposed method. Open questions concerning sufficient conditions and convergence of discretized NLP-problems are discussed.« less

Metaheuristic optimisation methods for approximate solving of singular boundary value problems

NASA Astrophysics Data System (ADS)

Sadollah, Ali; Yadav, Neha; Gao, Kaizhou; Su, Rong

2017-07-01

This paper presents a novel approximation technique based on metaheuristics and weighted residual function (WRF) for tackling singular boundary value problems (BVPs) arising in engineering and science. With the aid of certain fundamental concepts of mathematics, Fourier series expansion, and metaheuristic optimisation algorithms, singular BVPs can be approximated as an optimisation problem with boundary conditions as constraints. The target is to minimise the WRF (i.e. error function) constructed in approximation of BVPs. The scheme involves generational distance metric for quality evaluation of the approximate solutions against exact solutions (i.e. error evaluator metric). Four test problems including two linear and two non-linear singular BVPs are considered in this paper to check the efficiency and accuracy of the proposed algorithm. The optimisation task is performed using three different optimisers including the particle swarm optimisation, the water cycle algorithm, and the harmony search algorithm. Optimisation results obtained show that the suggested technique can be successfully applied for approximate solving of singular BVPs.

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

PubMed Central

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

2016-01-01

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

Multiobjective immune algorithm with nondominated neighbor-based selection.

PubMed

Gong, Maoguo; Jiao, Licheng; Du, Haifeng; Bo, Liefeng

2008-01-01

Abstract Nondominated Neighbor Immune Algorithm (NNIA) is proposed for multiobjective optimization by using a novel nondominated neighbor-based selection technique, an immune inspired operator, two heuristic search operators, and elitism. The unique selection technique of NNIA only selects minority isolated nondominated individuals in the population. The selected individuals are then cloned proportionally to their crowding-distance values before heuristic search. By using the nondominated neighbor-based selection and proportional cloning, NNIA pays more attention to the less-crowded regions of the current trade-off front. We compare NNIA with NSGA-II, SPEA2, PESA-II, and MISA in solving five DTLZ problems, five ZDT problems, and three low-dimensional problems. The statistical analysis based on three performance metrics including the coverage of two sets, the convergence metric, and the spacing, show that the unique selection method is effective, and NNIA is an effective algorithm for solving multiobjective optimization problems. The empirical study on NNIA's scalability with respect to the number of objectives shows that the new algorithm scales well along the number of objectives.

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

PubMed

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

2016-01-01

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

Use of EPR to Solve Biochemical Problems

PubMed Central

Sahu, Indra D.; McCarrick, Robert M.; Lorigan, Gary A.

2013-01-01

EPR spectroscopy is a very powerful biophysical tool that can provide valuable structural and dynamic information on a wide variety of biological systems. The intent of this review is to provide a general overview for biochemists and biological researchers on the most commonly used EPR methods and how these techniques can be used to answer important biological questions. The topics discussed could easily fill one or more textbooks; thus, we present a brief background on several important biological EPR techniques and an overview of several interesting studies that have successfully used EPR to solve pertinent biological problems. The review consists of the following sections: an introduction to EPR techniques, spin labeling methods, and studies of naturally occurring organic radicals and EPR active transition metal systems which are presented as a series of case studies in which EPR spectroscopy has been used to greatly further our understanding of several important biological systems. PMID:23961941

Physics faculty beliefs and values about the teaching and learning of problem solving. II. Procedures for measurement and analysis

NASA Astrophysics Data System (ADS)

Henderson, Charles; Yerushalmi, Edit; Kuo, Vince H.; Heller, Kenneth; Heller, Patricia

2007-12-01

To identify and describe the basis upon which instructors make curricular and pedagogical decisions, we have developed an artifact-based interview and an analysis technique based on multilayered concept maps. The policy capturing technique used in the interview asks instructors to make judgments about concrete instructional artifacts similar to those they likely encounter in their teaching environment. The analysis procedure alternatively employs both an a priori systems view analysis and an emergent categorization to construct a multilayered concept map, which is a hierarchically arranged set of concept maps where child maps include more details than parent maps. Although our goal was to develop a model of physics faculty beliefs about the teaching and learning of problem solving in the context of an introductory calculus-based physics course, the techniques described here are applicable to a variety of situations in which instructors make decisions that influence teaching and learning.

Obesity prevention: Comparison of techniques and potential solution

NASA Astrophysics Data System (ADS)

Zulkepli, Jafri; Abidin, Norhaslinda Zainal; Zaibidi, Nerda Zura

2014-12-01

Over the years, obesity prevention has been a broadly studied subject by both academicians and practitioners. It is one of the most serious public health issue as it can cause numerous chronic health and psychosocial problems. Research is needed to suggest a population-based strategy for obesity prevention. In the academic environment, the importance of obesity prevention has triggered various problem solving approaches. A good obesity prevention model, should comprehend and cater all complex and dynamics issues. Hence, the main purpose of this paper is to discuss the qualitative and quantitative approaches on obesity prevention study and to provide an extensive literature review on various recent modelling techniques for obesity prevention. Based on these literatures, the comparison of both quantitative and qualitative approahes are highlighted and the justification on the used of system dynamics technique to solve the population of obesity is discussed. Lastly, a potential framework solution based on system dynamics modelling is proposed.

Three-dimensional finite element analysis for high velocity impact. [of projectiles from space debris

NASA Technical Reports Server (NTRS)

Chan, S. T. K.; Lee, C. H.; Brashears, M. R.

1975-01-01

A finite element algorithm for solving unsteady, three-dimensional high velocity impact problems is presented. A computer program was developed based on the Eulerian hydroelasto-viscoplastic formulation and the utilization of the theorem of weak solutions. The equations solved consist of conservation of mass, momentum, and energy, equation of state, and appropriate constitutive equations. The solution technique is a time-dependent finite element analysis utilizing three-dimensional isoparametric elements, in conjunction with a generalized two-step time integration scheme. The developed code was demonstrated by solving one-dimensional as well as three-dimensional impact problems for both the inviscid hydrodynamic model and the hydroelasto-viscoplastic model.

Problems and solutions for patients with fibromyalgia: Building new helping relationships.

PubMed

Montesó-Curto, Pilar; García-Martinez, Montserrat; Romaguera, Sara; Mateu, María Luisa; Cubí-Guillén, María Teresa; Sarrió-Colas, Lidia; Llàdser, Anna Núria; Bradley, Stephen; Panisello-Chavarria, María Luisa

2018-02-01

The aim of this study was to identify the main biological, psychological and sociological problems and potential solutions for patients diagnosed with fibromyalgia by use of Group Problem-Solving Therapy. Group Problem-Solving Therapy is a technique for identifying and solving problems, increasing assertiveness, self-esteem and eliminating negative thoughts. Qualitative phenomenological interpretive design: Group Problem-Solving Therapy sessions conducted with patients suffering fibromyalgia were studied; participants recruited via the Rheumatology Department at a general hospital and associations in Catalonia, Spain with sessions conducted in nearby university setting. The study included 44 people diagnosed with fibromyalgia (43 female, 1 male) from 6 Group Problem-Solving Therapy sessions. Data collected from March-June 2013. A total of 24 sessions were audio recorded, all with prior informed consent. Data were transcribed and then analysed in accordance with established methods of inductive thematic analysis, via a process of reduction to manage and classify data. Five themes were identified: (1) Current problems are often related to historical trauma; (2) There are no "one size fits all" solutions; (3) Fibromyalgia is life-changing; (4) Fibromyalgia is widely misunderstood; (5) Statistically Significant impacts on physical, psychological and social are described. The majority of patients' problems were associated with their previous history and the onset of fibromyalgia; which may be related to trauma in adolescence, early adulthood or later. The solutions provided during the groups appeared to be accepted by the participants. These findings can improve the self-management of fibromyalgia patients by helping to enhance adaptive behaviours and incorporating the female gender approach. © 2017 John Wiley & Sons Ltd.

Sculpting in cyberspace: Parallel processing the development of new software

NASA Technical Reports Server (NTRS)

Fisher, Rob

1993-01-01

Stimulating creativity in problem solving, particularly where software development is involved, is applicable to many disciplines. Metaphorical thinking keeps the problem in focus but in a different light, jarring people out of their mental ruts and sparking fresh insights. It forces the mind to stretch to find patterns between dissimilar concepts, in the hope of discovering unusual ideas in odd associations (Technology Review January 1993, p. 37). With a background in Engineering and Visual Design from MIT, I have for the past 30 years pursued a career as a sculptor of interdisciplinary monumental artworks that bridge the fields of science, engineering and art. Since 1979, I have pioneered the application of computer simulation to solve the complex problems associated with these projects. A recent project for the roof of the Carnegie Science Center in Pittsburgh made particular use of the metaphoric creativity technique described above. The problem-solving process led to the creation of hybrid software combining scientific, architectural and engineering visualization techniques. David Steich, a Doctoral Candidate in Electrical Engineering at Penn State, was commissioned to develop special software that enabled me to create innovative free-form sculpture. This paper explores the process of inventing the software through a detailed analysis of the interaction between an artist and a computer programmer.

Mathematical improvement of the Hopfield model for feasible solutions to the traveling salesman problem by a synapse dynamical system.

PubMed

Takahashi, Y

1998-01-01

It is well known that the Hopfield Model (HM) for neural networks to solve the Traveling Salesman Problem (TSP) suffers from three major drawbacks. (1) It can converge on nonoptimal locally minimum solutions. (2) It can converge on infeasible solutions. (3) Results are very sensitive to the careful tuning of its parameters. A number of methods have been proposed to overcome (a) well. In contrast, work on (b) and (c) has not been sufficient; techniques have not been generalized to more general optimization problems. Thus this paper mathematically resolves (b) and (c) to such an extent that the resolution can be applied to solving with some general network continuous optimization problems including the Hopfield version of the TSP. It first constructs an Extended HM (E-HM) that overcomes both (b) and (c). Fundamental techniques of the E-HM lie in the addition of a synapse dynamical system cooperated with the current HM unit dynamical system. It is this synapse dynamical system that makes the TSP constraint hold at any final states for whatever choices of the IIM parameters and an initial state. The paper then generalizes the E-HM further to a network that can solve a class of continuous optimization problems with a constraint equation where both of the objective function and the constraint function are nonnegative and continuously differentiable.

Undergraduate Performance in Solving Ill-Defined Biochemistry Problems

PubMed Central

Sensibaugh, Cheryl A.; Madrid, Nathaniel J.; Choi, Hye-Jeong; Anderson, William L.; Osgood, Marcy P.

2017-01-01

With growing interest in promoting skills related to the scientific process, we studied performance in solving ill-defined problems demonstrated by graduating biochemistry majors at a public, minority-serving university. As adoption of techniques for facilitating the attainment of higher-order learning objectives broadens, so too does the need to appropriately measure and understand student performance. We extended previous validation of the Individual Problem Solving Assessment (IPSA) and administered multiple versions of the IPSA across two semesters of biochemistry courses. A final version was taken by majors just before program exit, and student responses on that version were analyzed both quantitatively and qualitatively. This mixed-methods study quantifies student performance in scientific problem solving, while probing the qualitative nature of unsatisfactory solutions. Of the five domains measured by the IPSA, we found that average graduates were only successful in two areas: evaluating given experimental data to state results and reflecting on performance after the solution to the problem was provided. The primary difficulties in each domain were quite different. The most widespread challenge for students was to design an investigation that rationally aligned with a given hypothesis. We also extend the findings into pedagogical recommendations. PMID:29180350

Mobile code security

NASA Astrophysics Data System (ADS)

Ramalingam, Srikumar

2001-11-01

A highly secure mobile agent system is very important for a mobile computing environment. The security issues in mobile agent system comprise protecting mobile hosts from malicious agents, protecting agents from other malicious agents, protecting hosts from other malicious hosts and protecting agents from malicious hosts. Using traditional security mechanisms the first three security problems can be solved. Apart from using trusted hardware, very few approaches exist to protect mobile code from malicious hosts. Some of the approaches to solve this problem are the use of trusted computing, computing with encrypted function, steganography, cryptographic traces, Seal Calculas, etc. This paper focuses on the simulation of some of these existing techniques in the designed mobile language. Some new approaches to solve malicious network problem and agent tampering problem are developed using public key encryption system and steganographic concepts. The approaches are based on encrypting and hiding the partial solutions of the mobile agents. The partial results are stored and the address of the storage is destroyed as the agent moves from one host to another host. This allows only the originator to make use of the partial results. Through these approaches some of the existing problems are solved.

An efficient three-dimensional Poisson solver for SIMD high-performance-computing architectures

NASA Technical Reports Server (NTRS)

Cohl, H.

1994-01-01

We present an algorithm that solves the three-dimensional Poisson equation on a cylindrical grid. The technique uses a finite-difference scheme with operator splitting. This splitting maps the banded structure of the operator matrix into a two-dimensional set of tridiagonal matrices, which are then solved in parallel. Our algorithm couples FFT techniques with the well-known ADI (Alternating Direction Implicit) method for solving Elliptic PDE's, and the implementation is extremely well suited for a massively parallel environment like the SIMD architecture of the MasPar MP-1. Due to the highly recursive nature of our problem, we believe that our method is highly efficient, as it avoids excessive interprocessor communication.

Non-recursive augmented Lagrangian algorithms for the forward and inverse dynamics of constrained flexible multibodies

NASA Technical Reports Server (NTRS)

Bayo, Eduardo; Ledesma, Ragnar

1993-01-01

A technique is presented for solving the inverse dynamics of flexible planar multibody systems. This technique yields the non-causal joint efforts (inverse dynamics) as well as the internal states (inverse kinematics) that produce a prescribed nominal trajectory of the end effector. A non-recursive global Lagrangian approach is used in formulating the equations for motion as well as in solving the inverse dynamics equations. Contrary to the recursive method previously presented, the proposed method solves the inverse problem in a systematic and direct manner for both open-chain as well as closed-chain configurations. Numerical simulation shows that the proposed procedure provides an excellent tracking of the desired end effector trajectory.

Continuous Measurements and Quantitative Constraints: Challenge Problems for Discrete Modeling Techniques

NASA Technical Reports Server (NTRS)

Goodrich, Charles H.; Kurien, James; Clancy, Daniel (Technical Monitor)

2001-01-01

We present some diagnosis and control problems that are difficult to solve with discrete or purely qualitative techniques. We analyze the nature of the problems, classify them and explain why they are frequently encountered in systems with closed loop control. This paper illustrates the problem with several examples drawn from industrial and aerospace applications and presents detailed information on one important application: In-Situ Resource Utilization (ISRU) on Mars. The model for an ISRU plant is analyzed showing where qualitative techniques are inadequate to identify certain failure modes and to maintain control of the system in degraded environments. We show why the solution to the problem will result in significantly more robust and reliable control systems. Finally, we illustrate requirements for a solution to the problem by means of examples.

The use of Lanczos's method to solve the large generalized symmetric definite eigenvalue problem

NASA Technical Reports Server (NTRS)

Jones, Mark T.; Patrick, Merrell L.

1989-01-01

The generalized eigenvalue problem, Kx = Lambda Mx, is of significant practical importance, especially in structural enginering where it arises as the vibration and buckling problem. A new algorithm, LANZ, based on Lanczos's method is developed. LANZ uses a technique called dynamic shifting to improve the efficiency and reliability of the Lanczos algorithm. A new algorithm for solving the tridiagonal matrices that arise when using Lanczos's method is described. A modification of Parlett and Scott's selective orthogonalization algorithm is proposed. Results from an implementation of LANZ on a Convex C-220 show it to be superior to a subspace iteration code.

Block clustering based on difference of convex functions (DC) programming and DC algorithms.

PubMed

Le, Hoai Minh; Le Thi, Hoai An; Dinh, Tao Pham; Huynh, Van Ngai

2013-10-01

We investigate difference of convex functions (DC) programming and the DC algorithm (DCA) to solve the block clustering problem in the continuous framework, which traditionally requires solving a hard combinatorial optimization problem. DC reformulation techniques and exact penalty in DC programming are developed to build an appropriate equivalent DC program of the block clustering problem. They lead to an elegant and explicit DCA scheme for the resulting DC program. Computational experiments show the robustness and efficiency of the proposed algorithm and its superiority over standard algorithms such as two-mode K-means, two-mode fuzzy clustering, and block classification EM.

Application of decentralized cooperative problem solving in dynamic flexible scheduling

NASA Astrophysics Data System (ADS)

Guan, Zai-Lin; Lei, Ming; Wu, Bo; Wu, Ya; Yang, Shuzi

1995-08-01

The object of this study is to discuss an intelligent solution to the problem of task-allocation in shop floor scheduling. For this purpose, the technique of distributed artificial intelligence (DAI) is applied. Intelligent agents (IAs) are used to realize decentralized cooperation, and negotiation is realized by using message passing based on the contract net model. Multiple agents, such as manager agents, workcell agents, and workstation agents, make game-like decisions based on multiple criteria evaluations. This procedure of decentralized cooperative problem solving makes local scheduling possible. And by integrating such multiple local schedules, dynamic flexible scheduling for the whole shop floor production can be realized.

Exploiting replication in distributed systems

NASA Technical Reports Server (NTRS)

Birman, Kenneth P.; Joseph, T. A.

1989-01-01

Techniques are examined for replicating data and execution in directly distributed systems: systems in which multiple processes interact directly with one another while continuously respecting constraints on their joint behavior. Directly distributed systems are often required to solve difficult problems, ranging from management of replicated data to dynamic reconfiguration in response to failures. It is shown that these problems reduce to more primitive, order-based consistency problems, which can be solved using primitives such as the reliable broadcast protocols. Moreover, given a system that implements reliable broadcast primitives, a flexible set of high-level tools can be provided for building a wide variety of directly distributed application programs.

AGARD Flight Test Techniques Series. Volume 2. Identification of Dynamic Systems

DTIC Science & Technology

1985-01-01

should not depend upon it to solve the problem autonomously. The analyst’s strong point is in formulating the problem; the computer’s strength is in...of derivation for the output-error method is to reduce the problem to the static form of Chapter 5. We will see that the dinamic system make- the

A Dynamic Process Model for Optimizing the Hospital Environment Cash-Flow

NASA Astrophysics Data System (ADS)

Pater, Flavius; Rosu, Serban

2011-09-01

In this article is presented a new approach to some fundamental techniques of solving dynamic programming problems with the use of functional equations. We will analyze the problem of minimizing the cost of treatment in a hospital environment. Mathematical modeling of this process leads to an optimal control problem with a finite horizon.

Computing wave functions in multichannel collisions with non-local potentials using the R-matrix method

NASA Astrophysics Data System (ADS)

Bonitati, Joey; Slimmer, Ben; Li, Weichuan; Potel, Gregory; Nunes, Filomena

2017-09-01

The calculable form of the R-matrix method has been previously shown to be a useful tool in approximately solving the Schrodinger equation in nuclear scattering problems. We use this technique combined with the Gauss quadrature for the Lagrange-mesh method to efficiently solve for the wave functions of projectile nuclei in low energy collisions (1-100 MeV) involving an arbitrary number of channels. We include the local Woods-Saxon potential, the non-local potential of Perey and Buck, a Coulomb potential, and a coupling potential to computationally solve for the wave function of two nuclei at short distances. Object oriented programming is used to increase modularity, and parallel programming techniques are introduced to reduce computation time. We conclude that the R-matrix method is an effective method to predict the wave functions of nuclei in scattering problems involving both multiple channels and non-local potentials. Michigan State University iCER ACRES REU.

Evolutionary algorithm based heuristic scheme for nonlinear heat transfer equations.

PubMed

Ullah, Azmat; Malik, Suheel Abdullah; Alimgeer, Khurram Saleem

2018-01-01

In this paper, a hybrid heuristic scheme based on two different basis functions i.e. Log Sigmoid and Bernstein Polynomial with unknown parameters is used for solving the nonlinear heat transfer equations efficiently. The proposed technique transforms the given nonlinear ordinary differential equation into an equivalent global error minimization problem. Trial solution for the given nonlinear differential equation is formulated using a fitness function with unknown parameters. The proposed hybrid scheme of Genetic Algorithm (GA) with Interior Point Algorithm (IPA) is opted to solve the minimization problem and to achieve the optimal values of unknown parameters. The effectiveness of the proposed scheme is validated by solving nonlinear heat transfer equations. The results obtained by the proposed scheme are compared and found in sharp agreement with both the exact solution and solution obtained by Haar Wavelet-Quasilinearization technique which witnesses the effectiveness and viability of the suggested scheme. Moreover, the statistical analysis is also conducted for investigating the stability and reliability of the presented scheme.

Collaboration with Community Partners

ERIC Educational Resources Information Center

Sterling, Donna R.; Frazier, Wendy M.

2006-01-01

For eight years, relationships with community partners have been the mainstay of a science enrichment program for secondary students. Through the use of problem-based learning, science classes use, the techniques and tools of scientists to solve authentic problems directly related to students' interests and needs. In this article, the author…

Desensitization of Fire Bell Phobia

ERIC Educational Resources Information Center

O'Reilly, Patricia P.

1971-01-01

This case study presents an example of how one school psychologist helped a child and an entire class solve a problem. Although the techniques used are not unique to school psychological practice, the problems presented by their use are. The procedure consisted of a desensitization process lasting ten weeks. (Author)

Common approach to solving SGEMP, DEMP, and ESD survivability

NASA Technical Reports Server (NTRS)

Ling, D.

1977-01-01

System Generated Electromagnetic Pulse (SGEMP) and Dispersed Electromagnetic Pulse DEMP) are nuclear generated spacecraft environments. Electrostatic discharge (ESD) is a natural spacecraft environment resulting from differential charging in magnetic substorms. All three phenomena, though differing in origin, result in the same problem to the spacecraft and that is Electromagnetic Interference (EMI). A common design approach utilizing a spacecraft structural Faraday Cage is presented which helps solve the EMI problem. Also, other system design techniques are discussed which minimize the magnitude of these environments through control of materials and electrical grounding configuration.

Applications of an exponential finite difference technique

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

Handschuh, R.F.; Keith, T.G. Jr.

1988-07-01

An exponential finite difference scheme first presented by Bhattacharya for one dimensional unsteady heat conduction problems in Cartesian coordinates was extended. The finite difference algorithm developed was used to solve the unsteady diffusion equation in one dimensional cylindrical coordinates and was applied to two and three dimensional conduction problems in Cartesian coordinates. Heat conduction involving variable thermal conductivity was also investigated. The method was used to solve nonlinear partial differential equations in one and two dimensional Cartesian coordinates. Predicted results are compared to exact solutions where available or to results obtained by other numerical methods.

From nonlinear optimization to convex optimization through firefly algorithm and indirect approach with applications to CAD/CAM.

PubMed

Gálvez, Akemi; Iglesias, Andrés

2013-01-01

Fitting spline curves to data points is a very important issue in many applied fields. It is also challenging, because these curves typically depend on many continuous variables in a highly interrelated nonlinear way. In general, it is not possible to compute these parameters analytically, so the problem is formulated as a continuous nonlinear optimization problem, for which traditional optimization techniques usually fail. This paper presents a new bioinspired method to tackle this issue. In this method, optimization is performed through a combination of two techniques. Firstly, we apply the indirect approach to the knots, in which they are not initially the subject of optimization but precomputed with a coarse approximation scheme. Secondly, a powerful bioinspired metaheuristic technique, the firefly algorithm, is applied to optimization of data parameterization; then, the knot vector is refined by using De Boor's method, thus yielding a better approximation to the optimal knot vector. This scheme converts the original nonlinear continuous optimization problem into a convex optimization problem, solved by singular value decomposition. Our method is applied to some illustrative real-world examples from the CAD/CAM field. Our experimental results show that the proposed scheme can solve the original continuous nonlinear optimization problem very efficiently.

From Nonlinear Optimization to Convex Optimization through Firefly Algorithm and Indirect Approach with Applications to CAD/CAM

PubMed Central

Gálvez, Akemi; Iglesias, Andrés

2013-01-01

Fitting spline curves to data points is a very important issue in many applied fields. It is also challenging, because these curves typically depend on many continuous variables in a highly interrelated nonlinear way. In general, it is not possible to compute these parameters analytically, so the problem is formulated as a continuous nonlinear optimization problem, for which traditional optimization techniques usually fail. This paper presents a new bioinspired method to tackle this issue. In this method, optimization is performed through a combination of two techniques. Firstly, we apply the indirect approach to the knots, in which they are not initially the subject of optimization but precomputed with a coarse approximation scheme. Secondly, a powerful bioinspired metaheuristic technique, the firefly algorithm, is applied to optimization of data parameterization; then, the knot vector is refined by using De Boor's method, thus yielding a better approximation to the optimal knot vector. This scheme converts the original nonlinear continuous optimization problem into a convex optimization problem, solved by singular value decomposition. Our method is applied to some illustrative real-world examples from the CAD/CAM field. Our experimental results show that the proposed scheme can solve the original continuous nonlinear optimization problem very efficiently. PMID:24376380

Autonomous Intersection Management

DTIC Science & Technology

2009-12-01

is irrelevant. Fortunately, researchers are attacking this problem with many techniques. In 2004, Honda introduced an intelligent night vision system...or less a solved problem . The problem itself is not too difficult: there are no pedestrians or cyclists and vehicles travel in the same direction at...organized according to the following subgoals, each of which is a contribution of the thesis. 1. Problem definition First, this thesis contributes a

Effectiveness of the Touch Math Technique in Teaching Basic Addition to Children with Autism

ERIC Educational Resources Information Center

Yikmis, Ahmet

2016-01-01

This study aims to reveal whether the touch math technique is effective in teaching basic addition to children with autism. The dependent variable of this study is the children's skills to solve addition problems correctly, whereas teaching with the touch math technique is the independent variable. Among the single-subject research models, a…

Skinner Boxing.

ERIC Educational Resources Information Center

Bower, Bruce

1986-01-01

Presents summaries and opposing views of six of B. F. Skinner's major tenets of behavioristic psychology. Relates conflicting positions on issues as environmental determination, problem solving techniques, cultural reinforcement, and mental processing. (ML)

On regularization and error estimates for the backward heat conduction problem with time-dependent thermal diffusivity factor

NASA Astrophysics Data System (ADS)

Karimi, Milad; Moradlou, Fridoun; Hajipour, Mojtaba

2018-10-01

This paper is concerned with a backward heat conduction problem with time-dependent thermal diffusivity factor in an infinite "strip". This problem is drastically ill-posed which is caused by the amplified infinitely growth in the frequency components. A new regularization method based on the Meyer wavelet technique is developed to solve the considered problem. Using the Meyer wavelet technique, some new stable estimates are proposed in the Hölder and Logarithmic types which are optimal in the sense of given by Tautenhahn. The stability and convergence rate of the proposed regularization technique are proved. The good performance and the high-accuracy of this technique is demonstrated through various one and two dimensional examples. Numerical simulations and some comparative results are presented.

Greeks Assisting Greeks (G.A.G). Training Manual.

ERIC Educational Resources Information Center

Ensminger, David

This training manual, intended for use by college students to learn peer counseling techniques, contains four sections. The first section provides an introduction to peer counseling. Effective therapeutic communication, solving a problem, basic counseling techniques, communicating styles, and the limitations of peer counseling are discussed. The…

An optimization-based approach for solving a time-harmonic multiphysical wave problem with higher-order schemes

NASA Astrophysics Data System (ADS)

Mönkölä, Sanna

2013-06-01

This study considers developing numerical solution techniques for the computer simulations of time-harmonic fluid-structure interaction between acoustic and elastic waves. The focus is on the efficiency of an iterative solution method based on a controllability approach and spectral elements. We concentrate on the model, in which the acoustic waves in the fluid domain are modeled by using the velocity potential and the elastic waves in the structure domain are modeled by using displacement. Traditionally, the complex-valued time-harmonic equations are used for solving the time-harmonic problems. Instead of that, we focus on finding periodic solutions without solving the time-harmonic problems directly. The time-dependent equations can be simulated with respect to time until a time-harmonic solution is reached, but the approach suffers from poor convergence. To overcome this challenge, we follow the approach first suggested and developed for the acoustic wave equations by Bristeau, Glowinski, and Périaux. Thus, we accelerate the convergence rate by employing a controllability method. The problem is formulated as a least-squares optimization problem, which is solved with the conjugate gradient (CG) algorithm. Computation of the gradient of the functional is done directly for the discretized problem. A graph-based multigrid method is used for preconditioning the CG algorithm.

Performance evaluation of different types of particle representation procedures of Particle Swarm Optimization in Job-shop Scheduling Problems

NASA Astrophysics Data System (ADS)

Izah Anuar, Nurul; Saptari, Adi

2016-02-01

This paper addresses the types of particle representation (encoding) procedures in a population-based stochastic optimization technique in solving scheduling problems known in the job-shop manufacturing environment. It intends to evaluate and compare the performance of different particle representation procedures in Particle Swarm Optimization (PSO) in the case of solving Job-shop Scheduling Problems (JSP). Particle representation procedures refer to the mapping between the particle position in PSO and the scheduling solution in JSP. It is an important step to be carried out so that each particle in PSO can represent a schedule in JSP. Three procedures such as Operation and Particle Position Sequence (OPPS), random keys representation and random-key encoding scheme are used in this study. These procedures have been tested on FT06 and FT10 benchmark problems available in the OR-Library, where the objective function is to minimize the makespan by the use of MATLAB software. Based on the experimental results, it is discovered that OPPS gives the best performance in solving both benchmark problems. The contribution of this paper is the fact that it demonstrates to the practitioners involved in complex scheduling problems that different particle representation procedures can have significant effects on the performance of PSO in solving JSP.

Transshipment site selection using the AHP and TOPSIS approaches under fuzzy environment.

PubMed

Onüt, Semih; Soner, Selin

2008-01-01

Site selection is an important issue in waste management. Selection of the appropriate solid waste site requires consideration of multiple alternative solutions and evaluation criteria because of system complexity. Evaluation procedures involve several objectives, and it is often necessary to compromise among possibly conflicting tangible and intangible factors. For these reasons, multiple criteria decision-making (MCDM) has been found to be a useful approach to solve this kind of problem. Different MCDM models have been applied to solve this problem. But most of them are basically mathematical and ignore qualitative and often subjective considerations. It is easier for a decision-maker to describe a value for an alternative by using linguistic terms. In the fuzzy-based method, the rating of each alternative is described using linguistic terms, which can also be expressed as triangular fuzzy numbers. Furthermore, there have not been any studies focused on the site selection in waste management using both fuzzy TOPSIS (technique for order preference by similarity to ideal solution) and AHP (analytical hierarchy process) techniques. In this paper, a fuzzy TOPSIS based methodology is applied to solve the solid waste transshipment site selection problem in Istanbul, Turkey. The criteria weights are calculated by using the AHP.

Multichannel myopic deconvolution in underwater acoustic channels via low-rank recovery

PubMed Central

Tian, Ning; Byun, Sung-Hoon; Sabra, Karim; Romberg, Justin

2017-01-01

This paper presents a technique for solving the multichannel blind deconvolution problem. The authors observe the convolution of a single (unknown) source with K different (unknown) channel responses; from these channel outputs, the authors want to estimate both the source and the channel responses. The authors show how this classical signal processing problem can be viewed as solving a system of bilinear equations, and in turn can be recast as recovering a rank-1 matrix from a set of linear observations. Results of prior studies in the area of low-rank matrix recovery have identified effective convex relaxations for problems of this type and efficient, scalable heuristic solvers that enable these techniques to work with thousands of unknown variables. The authors show how a priori information about the channels can be used to build a linear model for the channels, which in turn makes solving these systems of equations well-posed. This study demonstrates the robustness of this methodology to measurement noises and parametrization errors of the channel impulse responses with several stylized and shallow water acoustic channel simulations. The performance of this methodology is also verified experimentally using shipping noise recorded on short bottom-mounted vertical line arrays. PMID:28599565

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

Onuet, Semih; Soner, Selin

Site selection is an important issue in waste management. Selection of the appropriate solid waste site requires consideration of multiple alternative solutions and evaluation criteria because of system complexity. Evaluation procedures involve several objectives, and it is often necessary to compromise among possibly conflicting tangible and intangible factors. For these reasons, multiple criteria decision-making (MCDM) has been found to be a useful approach to solve this kind of problem. Different MCDM models have been applied to solve this problem. But most of them are basically mathematical and ignore qualitative and often subjective considerations. It is easier for a decision-maker tomore » describe a value for an alternative by using linguistic terms. In the fuzzy-based method, the rating of each alternative is described using linguistic terms, which can also be expressed as triangular fuzzy numbers. Furthermore, there have not been any studies focused on the site selection in waste management using both fuzzy TOPSIS (technique for order preference by similarity to ideal solution) and AHP (analytical hierarchy process) techniques. In this paper, a fuzzy TOPSIS based methodology is applied to solve the solid waste transshipment site selection problem in Istanbul, Turkey. The criteria weights are calculated by using the AHP.« less

The International Ultraviolet Explorer: Case study in spacecraft design

NASA Technical Reports Server (NTRS)

Freeman, H. R.; Longanecker, G. W.

1979-01-01

The International Ultraviolet Explorer (IUE) is a geosynchronous scientific satellite that was conceived as an international space observatory capable of measuring UV spectra of faint celestial bodies. Simple operational procedures allow the astronomers to joystick the spaceborne telescope about the sky, using familiar ground-based observatory techniques. The present paper deals with the IUE project objectives, the technical problems, constraints, trade-offs, and the problem solving techniques used in the IUE program.

jMetalCpp: optimizing molecular docking problems with a C++ metaheuristic framework.

PubMed

López-Camacho, Esteban; García Godoy, María Jesús; Nebro, Antonio J; Aldana-Montes, José F

2014-02-01

Molecular docking is a method for structure-based drug design and structural molecular biology, which attempts to predict the position and orientation of a small molecule (ligand) in relation to a protein (receptor) to produce a stable complex with a minimum binding energy. One of the most widely used software packages for this purpose is AutoDock, which incorporates three metaheuristic techniques. We propose the integration of AutoDock with jMetalCpp, an optimization framework, thereby providing both single- and multi-objective algorithms that can be used to effectively solve docking problems. The resulting combination of AutoDock + jMetalCpp allows users of the former to easily use the metaheuristics provided by the latter. In this way, biologists have at their disposal a richer set of optimization techniques than those already provided in AutoDock. Moreover, designers of metaheuristic techniques can use molecular docking for case studies, which can lead to more efficient algorithms oriented to solving the target problems.  jMetalCpp software adapted to AutoDock is freely available as a C++ source code at http://khaos.uma.es/AutodockjMetal/.

Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems

NASA Astrophysics Data System (ADS)

Shen, Zhao-Li; Huang, Ting-Zhu; Carpentieri, Bruno; Wen, Chun; Gu, Xian-Ming

2018-06-01

Recently, the adaptive algebraic aggregation multigrid method has been proposed for computing stationary distributions of Markov chains. This method updates aggregates on every iterative cycle to keep high accuracies of coarse-level corrections. Accordingly, its fast convergence rate is well guaranteed, but often a large proportion of time is cost by aggregation processes. In this paper, we show that the aggregates on each level in this method can be utilized to transfer the probability equation of that level into a block linear system. Then we propose a Block-Jacobi relaxation that deals with the block system on each level to smooth error. Some theoretical analysis of this technique is presented, meanwhile it is also adapted to solve PageRank problems. The purpose of this technique is to accelerate the adaptive aggregation multigrid method and its variants for solving Markov chains and PageRank problems. It also attempts to shed some light on new solutions for making aggregation processes more cost-effective for aggregation multigrid methods. Numerical experiments are presented to illustrate the effectiveness of this technique.

Multi-level adaptive finite element methods. 1: Variation problems

NASA Technical Reports Server (NTRS)

Brandt, A.

1979-01-01

A general numerical strategy for solving partial differential equations and other functional problems by cycling between coarser and finer levels of discretization is described. Optimal discretization schemes are provided together with very fast general solvers. It is described in terms of finite element discretizations of general nonlinear minimization problems. The basic processes (relaxation sweeps, fine-grid-to-coarse-grid transfers of residuals, coarse-to-fine interpolations of corrections) are directly and naturally determined by the objective functional and the sequence of approximation spaces. The natural processes, however, are not always optimal. Concrete examples are given and some new techniques are reviewed. Including the local truncation extrapolation and a multilevel procedure for inexpensively solving chains of many boundary value problems, such as those arising in the solution of time-dependent problems.

Identifying barriers to recovery from work related upper extremity disorders: use of a collaborative problem solving technique.

PubMed

Shaw, William S; Feuerstein, Michael; Miller, Virginia I; Wood, Patricia M

2003-08-01

Improving health and work outcomes for individuals with work related upper extremity disorders (WRUEDs) may require a broad assessment of potential return to work barriers by engaging workers in collaborative problem solving. In this study, half of all nurse case managers from a large workers' compensation system were randomly selected and invited to participate in a randomized, controlled trial of an integrated case management (ICM) approach for WRUEDs. The focus of ICM was problem solving skills training and workplace accommodation. Volunteer nurses attended a 2 day ICM training workshop including instruction in a 6 step process to engage clients in problem solving to overcome barriers to recovery. A chart review of WRUED case management reports (n = 70) during the following 2 years was conducted to extract case managers' reports of barriers to recovery and return to work. Case managers documented from 0 to 21 barriers per case (M = 6.24, SD = 4.02) within 5 domains: signs and symptoms (36%), work environment (27%), medical care (13%), functional limitations (12%), and coping (12%). Compared with case managers who did not receive the training (n = 67), workshop participants identified more barriers related to signs and symptoms, work environment, functional limitations, and coping (p < .05), but not to medical care. Problem solving skills training may help focus case management services on the most salient recovery factors affecting return to work.

Concept mapping improves academic performance in problem solving questions in biochemistry subject.

PubMed

Baig, Mukhtiar; Tariq, Saba; Rehman, Rehana; Ali, Sobia; Gazzaz, Zohair J

2016-01-01

To assess the effectiveness of concept mapping (CM) on the academic performance of medical students' in problem-solving as well as in declarative knowledge questions and their perception regarding CM. The present analytical and questionnaire-based study was carried out at Bahria University Medical and Dental College (BUMDC), Karachi, Pakistan. In this analytical study, students were assessed with problem-solving questions (A-type MCQs), and declarative knowledge questions (short essay questions), and 50% of the questions were from the topics learned by CM. Students also filled a 10-item, 3-point Likert scale questionnaire about their perception regarding the effectiveness of the CM approach, and two open-ended questions were also asked. There was a significant difference in the marks obtained in those problem-solving questions, which were learned by CM as compared to those topics which were taught by the traditional lectures (p<0.001), while no significant difference was observed in marks in declarative knowledge questions (p=0.704). Analysis of students' perception regarding CM showed that majority of the students perceive that CM is a helpful technique and it is enjoyed by the students. In open-ended questions, the majority of the students commented positively about the effectiveness of CM. Our results indicate that CM improves academic performance in problem solving but not in declarative knowledge questions. Students' perception about the effectiveness of CM was overwhelmingly positive.

Application of Decision Making and Team Training Research to Operational Training. A Translative Technique.

DTIC Science & Technology

DECISION MAKING , * GROUP DYNAMICS, NAVAL TRAINING, TRANSFER OF TRAINING, SCIENTIFIC RESEARCH, CLASSIFICATION, PROBLEM SOLVING, MATHEMATICAL MODELS, SUBMARINES, SIMULATORS, PERFORMANCE(HUMAN), UNDERSEA WARFARE.

FAST TRACK COMMUNICATION Solving the ultradiscrete KdV equation

NASA Astrophysics Data System (ADS)

Willox, Ralph; Nakata, Yoichi; Satsuma, Junkichi; Ramani, Alfred; Grammaticos, Basile

2010-12-01

We show that a generalized cellular automaton, exhibiting solitonic interactions, can be explicitly solved by means of techniques first introduced in the context of the scattering problem for the KdV equation. We apply this method to calculate the phase-shifts caused by interactions between the solitonic and non-solitonic parts into which arbitrary initial states separate in time.

A Special Application of Absolute Value Techniques in Authentic Problem Solving

ERIC Educational Resources Information Center

Stupel, Moshe

2013-01-01

There are at least five different equivalent definitions of the absolute value concept. In instances where the task is an equation or inequality with only one or two absolute value expressions, it is a worthy educational experience for learners to solve the task using each one of the definitions. On the other hand, if more than two absolute value…

SOLVE II: A Technique to Improve Efficiency and Solve Problems in Hardwood Sawmills

Treesearch

Edward L. Adams; Daniel E. Dunmire

1977-01-01

The squeeze between rising costs and product values is getting tighter for sawmill managers. So, they are taking a closer took at the efficiency of their sawmills by making a complete analysis of their milling situation. Such an analysis requires considerable time and expense. To aid the manager with this task, the USDA Forest Service's Northeastern Forest...

A Heuristic Fast Method to Solve the Nonlinear Schroedinger Equation in Fiber Bragg Gratings with Arbitrary Shape Input Pulse

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

Emami, F.; Hatami, M.; Keshavarz, A. R.

2009-08-13

Using a combination of Runge-Kutta and Jacobi iterative method, we could solve the nonlinear Schroedinger equation describing the pulse propagation in FBGs. By decomposing the electric field to forward and backward components in fiber Bragg grating and utilizing the Fourier series analysis technique, the boundary value problem of a set of coupled equations governing the pulse propagation in FBG changes to an initial condition coupled equations which can be solved by simple Runge-Kutta method.

Some observations on a new numerical method for solving Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Kumar, A.

1981-01-01

An explicit-implicit technique for solving Navier-Stokes equations is described which, is much less complex than other implicit methods. It is used to solve a complex, two-dimensional, steady-state, supersonic-flow problem. The computational efficiency of the method and the quality of the solution obtained from it at high Courant-Friedrich-Lewy (CFL) numbers are discussed. Modifications are discussed and certain observations are made about the method which may be helpful in using it successfully.

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

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

Groer, Christopher S; Sullivan, Blair D; Weerapurage, Dinesh P

2012-10-01

It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \\emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms wemore » have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.« less

Identification and Addressing Reduction-Related Misconceptions

ERIC Educational Resources Information Center

Gal-Ezer, Judith; Trakhtenbrot, Mark

2016-01-01

Reduction is one of the key techniques used for problem-solving in computer science. In particular, in the theory of computation and complexity (TCC), mapping and polynomial reductions are used for analysis of decidability and computational complexity of problems, including the core concept of NP-completeness. Reduction is a highly abstract…

Ingenuity in Action: Connecting Tinkering to Engineering Design Processes

ERIC Educational Resources Information Center

Wang, Jennifer; Werner-Avidon, Maia; Newton, Lisa; Randol, Scott; Smith, Brooke; Walker, Gretchen

2013-01-01

The Lawrence Hall of Science, a science center, seeks to replicate real-world engineering at the "Ingenuity in Action" exhibit, which consists of three open-ended challenges. These problems encourage children to engage in engineering design processes and problem-solving techniques through tinkering. We observed and interviewed 112…

Realistic Approach to Innovation.

ERIC Educational Resources Information Center

Dawson, Garth C.

Part of the Omaha police in-service training program was devoted to innovative approaches to solving police department problems and improving community relations. The sessions were an attempt to use the brainstorming technique to elicit new solutions to everyday problems faced by the rank-and-file members of the police department. The report…

Life Skills: a Course in Applied Problem Solving.

ERIC Educational Resources Information Center

Saskatchewan NewStart, Inc., Prince Albert.

This paper describes a Life Skills Course developed by Saskatchewan Newstart Inc. The course represents an attempt to integrate educational and psychotherapeutic principles and techniques for the development of personal competence in many aspects of life among the disadvantaged. It provides the student with competence in the use of problem solving…

Sociodrama: Group Creative Problem Solving in Action.

ERIC Educational Resources Information Center

Riley, John F.

1990-01-01

Sociodrama is presented as a structured, yet flexible, method of encouraging the use of creative thinking to examine a difficult problem. An example illustrates the steps involved in putting sociodrama into action. Production techniques useful in sociodrama include the soliloquy, double, role reversal, magic shop, unity of opposites, and audience…

Application of remote sensing to solution of ecological problems

NASA Technical Reports Server (NTRS)

Adelman, A.

1972-01-01

The application of remote sensing techniques to solving ecological problems is discussed. The three phases of environmental ecological management are examined. The differences between discovery and exploitation of natural resources and their ecological management are described. The specific application of remote sensing to water management is developed.

Path Planning For A Class Of Cutting Operations

NASA Astrophysics Data System (ADS)

Tavora, Jose

1989-03-01

Optimizing processing time in some contour-cutting operations requires solving the so-called no-load path problem. This problem is formulated and an approximate resolution method (based on heuristic search techniques) is described. Results for real-life instances (clothing layouts in the apparel industry) are presented and evaluated.

Total-variation based velocity inversion with Bregmanized operator splitting algorithm

NASA Astrophysics Data System (ADS)

Zand, Toktam; Gholami, Ali

2018-04-01

Many problems in applied geophysics can be formulated as a linear inverse problem. The associated problems, however, are large-scale and ill-conditioned. Therefore, regularization techniques are needed to be employed for solving them and generating a stable and acceptable solution. We consider numerical methods for solving such problems in this paper. In order to tackle the ill-conditioning of the problem we use blockiness as a prior information of the subsurface parameters and formulate the problem as a constrained total variation (TV) regularization. The Bregmanized operator splitting (BOS) algorithm as a combination of the Bregman iteration and the proximal forward backward operator splitting method is developed to solve the arranged problem. Two main advantages of this new algorithm are that no matrix inversion is required and that a discrepancy stopping criterion is used to stop the iterations, which allow efficient solution of large-scale problems. The high performance of the proposed TV regularization method is demonstrated using two different experiments: 1) velocity inversion from (synthetic) seismic data which is based on Born approximation, 2) computing interval velocities from RMS velocities via Dix formula. Numerical examples are presented to verify the feasibility of the proposed method for high-resolution velocity inversion.

A variational technique for smoothing flight-test and accident data

NASA Technical Reports Server (NTRS)

Bach, R. E., Jr.

1980-01-01

The problem of determining aircraft motions along a trajectory is solved using a variational algorithm that generates unmeasured states and forcing functions, and estimates instrument bias and scale-factor errors. The problem is formulated as a nonlinear fixed-interval smoothing problem, and is solved as a sequence of linear two-point boundary value problems, using a sweep method. The algorithm has been implemented for use in flight-test and accident analysis. Aircraft motions are assumed to be governed by a six-degree-of-freedom kinematic model; forcing functions consist of body accelerations and winds, and the measurement model includes aerodynamic and radar data. Examples of the determination of aircraft motions from typical flight-test and accident data are presented.

Skipping Strategy (SS) for Initial Population of Job-Shop Scheduling Problem

NASA Astrophysics Data System (ADS)

Abdolrazzagh-Nezhad, M.; Nababan, E. B.; Sarim, H. M.

2018-03-01

Initial population in job-shop scheduling problem (JSSP) is an essential step to obtain near optimal solution. Techniques used to solve JSSP are computationally demanding. Skipping strategy (SS) is employed to acquire initial population after sequence of job on machine and sequence of operations (expressed in Plates-jobs and mPlates-jobs) are determined. The proposed technique is applied to benchmark datasets and the results are compared to that of other initialization techniques. It is shown that the initial population obtained from the SS approach could generate optimal solution.

The archiving of meteor research information

NASA Technical Reports Server (NTRS)

Nechitailenko, V. A.

1987-01-01

The results obtained over the past years under GLOBMET are not reviewed but some of the problems the solution of which will guide further development of meteor investigation and international cooperation in this field for the near term are discussed. The main attention is paid to problems which the meteor community itself can solve, or at least expedite. Most of them are more or less connected with the problem of information archiving. Information archiving deals with methods and techniques of solving two closely connected groups of problems. The first is the analysis of data and information as an integral part of meteor research and deals with the solution of certain methodological problems. The second deals with gathering data and information for the designing of models of the atmosphere and/or meteor complex and its utilization. These problem solutions are discussed.

The Computer in Educational Decision Making. An Introduction and Guide for School Administrators.

ERIC Educational Resources Information Center

Sanders, Susan; And Others

This text provides educational administrators with a working knowledge of the problem-solving techniques of PERT (planning, evaluation, and review technique), Linear Programming, Queueing Theory, and Simulation. The text includes an introduction to decision-making and operations research, four chapters consisting of indepth explanations of each…

Developing Coping Skills in Early Childhood: Theory and Techniques.

ERIC Educational Resources Information Center

Forquer, Sandra L.

1982-01-01

Discusses techniques that child care workers can utilize to foster the development of coping skills in young children. Emphasizes the difference between psychological immunity to stress based on problem-solving abilities and pseudo-immunity created by overprotectiveness. Holds that challenges build children's competence and self-esteem.…

Design Features of Pedagogically-Sound Software in Mathematics.

ERIC Educational Resources Information Center

Haase, Howard; And Others

Weaknesses in educational software currently available in the domain of mathematics are discussed. A technique that was used for the design and production of mathematics software aimed at improving problem-solving skills which combines sound pedagogy and innovative programming is presented. To illustrate the design portion of this technique, a…

Using Reflection Documents to Assess Student Learning

ERIC Educational Resources Information Center

Powell, Larkin A.

2009-01-01

Traditional assessment methods such as tests and essays may not be adequate to evaluate students' ability to solve problems and think critically. I developed a qualitative assessment technique for a junior-level Wildlife Management Techniques course that incorporated written responses in a pre- and post-course reflection exercise. I provided the…

Protein-Sequencing Jigsaw

ERIC Educational Resources Information Center

Davis-McGibony, C. Michele

2010-01-01

The jigsaw technique has been used in a fourth-year biochemistry course to increase problem-solving abilities of the students. The jigsaw method is a cooperative-learning technique that involves a group structure. Students start with a "home" group. That group is responsible for learning an assigned portion of a task. Then the instructor separates…

Teaching, Learning and Evaluation Techniques in the Engineering Courses.

ERIC Educational Resources Information Center

Vermaas, Luiz Lenarth G.; Crepaldi, Paulo Cesar; Fowler, Fabio Roberto

This article presents some techniques of professional formation from the Petra Model that can be applied in Engineering Programs. It shows its philosophy, teaching methods for listening, making abstracts, studying, researching, team working and problem solving. Some questions regarding planning and evaluation, based in the model are, as well,…

Linear and nonlinear dynamic analysis by boundary element method. Ph.D. Thesis, 1986 Final Report

NASA Technical Reports Server (NTRS)

Ahmad, Shahid

1991-01-01

An advanced implementation of the direct boundary element method (BEM) applicable to free-vibration, periodic (steady-state) vibration and linear and nonlinear transient dynamic problems involving two and three-dimensional isotropic solids of arbitrary shape is presented. Interior, exterior, and half-space problems can all be solved by the present formulation. For the free-vibration analysis, a new real variable BEM formulation is presented which solves the free-vibration problem in the form of algebraic equations (formed from the static kernels) and needs only surface discretization. In the area of time-domain transient analysis, the BEM is well suited because it gives an implicit formulation. Although the integral formulations are elegant, because of the complexity of the formulation it has never been implemented in exact form. In the present work, linear and nonlinear time domain transient analysis for three-dimensional solids has been implemented in a general and complete manner. The formulation and implementation of the nonlinear, transient, dynamic analysis presented here is the first ever in the field of boundary element analysis. Almost all the existing formulation of BEM in dynamics use the constant variation of the variables in space and time which is very unrealistic for engineering problems and, in some cases, it leads to unacceptably inaccurate results. In the present work, linear and quadratic isoparametric boundary elements are used for discretization of geometry and functional variations in space. In addition, higher order variations in time are used. These methods of analysis are applicable to piecewise-homogeneous materials, such that not only problems of the layered media and the soil-structure interaction can be analyzed but also a large problem can be solved by the usual sub-structuring technique. The analyses have been incorporated in a versatile, general-purpose computer program. Some numerical problems are solved and, through comparisons with available analytical and numerical results, the stability and high accuracy of these dynamic analysis techniques are established.

9.9 Sales Grid Style Produces Results

ERIC Educational Resources Information Center

Blake, Robert R.; Mouton, Jane Srygley

1970-01-01

Selling effectiveness experiments have provided evidence that solution selling (problem solving) produces far better results than formula selling (sales technique oriented), hard sell, people-oriented selling, or order taking. (PT)

A critical analysis of the accuracy of several numerical techniques for combustion kinetic rate equations

NASA Technical Reports Server (NTRS)

Radhadrishnan, Krishnan

1993-01-01

A detailed analysis of the accuracy of several techniques recently developed for integrating stiff ordinary differential equations is presented. The techniques include two general-purpose codes EPISODE and LSODE developed for an arbitrary system of ordinary differential equations, and three specialized codes CHEMEQ, CREK1D, and GCKP4 developed specifically to solve chemical kinetic rate equations. The accuracy study is made by application of these codes to two practical combustion kinetics problems. Both problems describe adiabatic, homogeneous, gas-phase chemical reactions at constant pressure, and include all three combustion regimes: induction, heat release, and equilibration. To illustrate the error variation in the different combustion regimes the species are divided into three types (reactants, intermediates, and products), and error versus time plots are presented for each species type and the temperature. These plots show that CHEMEQ is the most accurate code during induction and early heat release. During late heat release and equilibration, however, the other codes are more accurate. A single global quantity, a mean integrated root-mean-square error, that measures the average error incurred in solving the complete problem is used to compare the accuracy of the codes. Among the codes examined, LSODE is the most accurate for solving chemical kinetics problems. It is also the most efficient code, in the sense that it requires the least computational work to attain a specified accuracy level. An important finding is that use of the algebraic enthalpy conservation equation to compute the temperature can be more accurate and efficient than integrating the temperature differential equation.

Calculation of Pareto-optimal solutions to multiple-objective problems using threshold-of-acceptability constraints

NASA Technical Reports Server (NTRS)

Giesy, D. P.

1978-01-01

A technique is presented for the calculation of Pareto-optimal solutions to a multiple-objective constrained optimization problem by solving a series of single-objective problems. Threshold-of-acceptability constraints are placed on the objective functions at each stage to both limit the area of search and to mathematically guarantee convergence to a Pareto optimum.

Grand challenges for biological engineering

PubMed Central

Yoon, Jeong-Yeol; Riley, Mark R

2009-01-01

Biological engineering will play a significant role in solving many of the world's problems in medicine, agriculture, and the environment. Recently the U.S. National Academy of Engineering (NAE) released a document "Grand Challenges in Engineering," covering broad realms of human concern from sustainability, health, vulnerability and the joy of living. Biological engineers, having tools and techniques at the interface between living and non-living entities, will play a prominent role in forging a better future. The 2010 Institute of Biological Engineering (IBE) conference in Cambridge, MA, USA will address, in part, the roles of biological engineering in solving the challenges presented by the NAE. This letter presents a brief outline of how biological engineers are working to solve these large scale and integrated problems of our society. PMID:19772647

Solving a problem by using what you know: a physicist looks at a problem in ecology

NASA Astrophysics Data System (ADS)

Greenler, Robert

2015-08-01

Two philosophical ideas motivate this paper. The first is an answer to the question of what is an appropriate activity for a physicist. My answer is that an appropriate activity is anything where the tools of a physicist enable him or her to make a contribution to the solution of a significant problem. This may be obvious in areas that overlap physics (e.g. chemistry, engineering, geology) but also true in any endeavour where mathematical modelling may contribute insight to the solution of problems (e.g. timing of traffic lights, efficient ways to seat passengers on airplanes, whether it is better to walk or run in a rain shower). The second idea concerns an approach to problem solving. Before some people try to solve a problem, they think they first must learn everything that is known about the subject. However, sometimes an effective approach is to declare, ‘I’m going to solve this problem with what I know now!’ I see a relationship between this approach and the idea of back-of-the-envelope calculations, which many of us appreciate. Of course there are limitations to this method, but I believe that such an aggressive approach to a problem—uninfluenced by the methods everyone else has used—can be productive. This paper describes such an approach to a real-world problem, using only what is known by the teacher of the introductory, calculus-based physics course. The intent of this paper is to encourage students and teachers of physics to look for unconventional areas, outside of physics, where they might use the techniques they have learned to solve problems

Fan noise prediction assessment

NASA Technical Reports Server (NTRS)

Bent, Paul H.

1995-01-01

This report is an evaluation of two techniques for predicting the fan noise radiation from engine nacelles. The first is a relatively computational intensive finite element technique. The code is named ARC, an abbreviation of Acoustic Radiation Code, and was developed by Eversman. This is actually a suite of software that first generates a grid around the nacelle, then solves for the potential flowfield, and finally solves the acoustic radiation problem. The second approach is an analytical technique requiring minimal computational effort. This is termed the cutoff ratio technique and was developed by Rice. Details of the duct geometry, such as the hub-to-tip ratio and Mach number of the flow in the duct, and modal content of the duct noise are required for proper prediction.

A method to stabilize linear systems using eigenvalue gradient information

NASA Technical Reports Server (NTRS)

Wieseman, C. D.

1985-01-01

Formal optimization methods and eigenvalue gradient information are used to develop a stabilizing control law for a closed loop linear system that is initially unstable. The method was originally formulated by using direct, constrained optimization methods with the constraints being the real parts of the eigenvalues. However, because of problems in trying to achieve stabilizing control laws, the problem was reformulated to be solved differently. The method described uses the Davidon-Fletcher-Powell minimization technique to solve an indirect, constrained minimization problem in which the performance index is the Kreisselmeier-Steinhauser function of the real parts of all the eigenvalues. The method is applied successfully to solve two different problems: the determination of a fourth-order control law stabilizes a single-input single-output active flutter suppression system and the determination of a second-order control law for a multi-input multi-output lateral-directional flight control system. Various sets of design variables and initial starting points were chosen to show the robustness of the method.

An efficient computational method for solving nonlinear stochastic Itô integral equations: Application for stochastic problems in physics

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

Heydari, M.H., E-mail: heydari@stu.yazd.ac.ir; The Laboratory of Quantum Information Processing, Yazd University, Yazd; Hooshmandasl, M.R., E-mail: hooshmandasl@yazd.ac.ir

Because of the nonlinearity, closed-form solutions of many important stochastic functional equations are virtually impossible to obtain. Thus, numerical solutions are a viable alternative. In this paper, a new computational method based on the generalized hat basis functions together with their stochastic operational matrix of Itô-integration is proposed for solving nonlinear stochastic Itô integral equations in large intervals. In the proposed method, a new technique for computing nonlinear terms in such problems is presented. The main advantage of the proposed method is that it transforms problems under consideration into nonlinear systems of algebraic equations which can be simply solved. Errormore » analysis of the proposed method is investigated and also the efficiency of this method is shown on some concrete examples. The obtained results reveal that the proposed method is very accurate and efficient. As two useful applications, the proposed method is applied to obtain approximate solutions of the stochastic population growth models and stochastic pendulum problem.« less

Computational Study for Planar Connected Dominating Set Problem

NASA Astrophysics Data System (ADS)

Marzban, Marjan; Gu, Qian-Ping; Jia, Xiaohua

The connected dominating set (CDS) problem is a well studied NP-hard problem with many important applications. Dorn et al. [ESA2005, LNCS3669,pp95-106] introduce a new technique to generate 2^{O(sqrt{n})} time and fixed-parameter algorithms for a number of non-local hard problems, including the CDS problem in planar graphs. The practical performance of this algorithm is yet to be evaluated. We perform a computational study for such an evaluation. The results show that the size of instances can be solved by the algorithm mainly depends on the branchwidth of the instances, coinciding with the theoretical result. For graphs with small or moderate branchwidth, the CDS problem instances with size up to a few thousands edges can be solved in a practical time and memory space. This suggests that the branch-decomposition based algorithms can be practical for the planar CDS problem.

Problem Solving-based Learning Materials on Fraction for Training Creativity of Elementary School Students

NASA Astrophysics Data System (ADS)

Widhitama, Y. N.; Lukito, A.; Khabibah, S.

2018-01-01

The aim of this research is to develop problem solving based learning materials on fraction for training creativity of elementary school students. Curriculum 2006 states that mathematics should be studied by all learners starting from elementary level in order for them mastering thinking skills, one of them is creative thinking. To our current knowledge, there is no such a research topic being done. To promote this direction, we initiate by developing learning materials with problem solving approach. The developed materials include Lesson Plan, Student Activity Sheet, Mathematical Creativity Test, and Achievement Test. We implemented a slightly modified 4-D model by Thiagajan et al. (1974) consisting of Define, Design, Development, and Disseminate. Techniques of gathering data include observation, test, and questionnaire. We applied three good qualities for the resulted materials; that is, validity, practicality, and effectiveness. The results show that the four mentioned materials meet the corresponding criteria of good quality product.

The effect of Missouri mathematics project learning model on students’ mathematical problem solving ability

NASA Astrophysics Data System (ADS)

Handayani, I.; Januar, R. L.; Purwanto, S. E.

2018-01-01

This research aims to know the influence of Missouri Mathematics Project Learning Model to Mathematical Problem-solving Ability of Students at Junior High School. This research is a quantitative research and uses experimental research method of Quasi Experimental Design. The research population includes all student of grade VII of Junior High School who are enrolled in the even semester of the academic year 2016/2017. The Sample studied are 76 students from experimental and control groups. The sampling technique being used is cluster sampling method. The instrument is consisted of 7 essay questions whose validity, reliability, difficulty level and discriminating power have been tested. Before analyzing the data by using t-test, the data has fulfilled the requirement for normality and homogeneity. The result of data shows that there is the influence of Missouri mathematics project learning model to mathematical problem-solving ability of students at junior high school with medium effect.

Students’ Errors in Geometry Viewed from Spatial Intelligence

NASA Astrophysics Data System (ADS)

Riastuti, N.; Mardiyana, M.; Pramudya, I.

2017-09-01

Geometry is one of the difficult materials because students must have ability to visualize, describe images, draw shapes, and know the kind of shapes. This study aim is to describe student error based on Newmans’ Error Analysis in solving geometry problems viewed from spatial intelligence. This research uses descriptive qualitative method by using purposive sampling technique. The datas in this research are the result of geometri material test and interview by the 8th graders of Junior High School in Indonesia. The results of this study show that in each category of spatial intelligence has a different type of error in solving the problem on the material geometry. Errors are mostly made by students with low spatial intelligence because they have deficiencies in visual abilities. Analysis of student error viewed from spatial intelligence is expected to help students do reflection in solving the problem of geometry.

Wave envelope technique for multimode wave guide problems

NASA Technical Reports Server (NTRS)

Hariharan, S. I.; Sudharsanan, S. I.

1986-01-01

A fast method for solving wave guide problems is proposed. In particular, the guide is considered to be inhomogeneous allowing propagation of waves of higher order modes. Such problems have been handled successfully for acoustic wave propagation problems with single mode and finite length. This paper extends this concept to electromagnetic wave guides with several modes and infinite length. The method is described and results of computations are presented.

Fractional Programming for Communication Systems—Part I: Power Control and Beamforming

NASA Astrophysics Data System (ADS)

Shen, Kaiming; Yu, Wei

2018-05-01

This two-part paper explores the use of FP in the design and optimization of communication systems. Part I of this paper focuses on FP theory and on solving continuous problems. The main theoretical contribution is a novel quadratic transform technique for tackling the multiple-ratio concave-convex FP problem--in contrast to conventional FP techniques that mostly can only deal with the single-ratio or the max-min-ratio case. Multiple-ratio FP problems are important for the optimization of communication networks, because system-level design often involves multiple signal-to-interference-plus-noise ratio terms. This paper considers the applications of FP to solving continuous problems in communication system design, particularly for power control, beamforming, and energy efficiency maximization. These application cases illustrate that the proposed quadratic transform can greatly facilitate the optimization involving ratios by recasting the original nonconvex problem as a sequence of convex problems. This FP-based problem reformulation gives rise to an efficient iterative optimization algorithm with provable convergence to a stationary point. The paper further demonstrates close connections between the proposed FP approach and other well-known algorithms in the literature, such as the fixed-point iteration and the weighted minimum mean-square-error beamforming. The optimization of discrete problems is discussed in Part II of this paper.

A Computationally Efficient Parallel Levenberg-Marquardt Algorithm for Large-Scale Big-Data Inversion

NASA Astrophysics Data System (ADS)

Lin, Y.; O'Malley, D.; Vesselinov, V. V.

2015-12-01

Inverse modeling seeks model parameters given a set of observed state variables. However, for many practical problems due to the facts that the observed data sets are often large and model parameters are often numerous, conventional methods for solving the inverse modeling can be computationally expensive. We have developed a new, computationally-efficient Levenberg-Marquardt method for solving large-scale inverse modeling. Levenberg-Marquardt methods require the solution of a dense linear system of equations which can be prohibitively expensive to compute for large-scale inverse problems. Our novel method projects the original large-scale linear problem down to a Krylov subspace, such that the dimensionality of the measurements can be significantly reduced. Furthermore, instead of solving the linear system for every Levenberg-Marquardt damping parameter, we store the Krylov subspace computed when solving the first damping parameter and recycle it for all the following damping parameters. The efficiency of our new inverse modeling algorithm is significantly improved by using these computational techniques. We apply this new inverse modeling method to invert for a random transitivity field. Our algorithm is fast enough to solve for the distributed model parameters (transitivity) at each computational node in the model domain. The inversion is also aided by the use regularization techniques. The algorithm is coded in Julia and implemented in the MADS computational framework (http://mads.lanl.gov). Julia is an advanced high-level scientific programing language that allows for efficient memory management and utilization of high-performance computational resources. By comparing with a Levenberg-Marquardt method using standard linear inversion techniques, our Levenberg-Marquardt method yields speed-up ratio of 15 in a multi-core computational environment and a speed-up ratio of 45 in a single-core computational environment. Therefore, our new inverse modeling method is a powerful tool for large-scale applications.

A technique for locating function roots and for satisfying equality constraints in optimization

NASA Technical Reports Server (NTRS)

Sobieszczanski-Sobieski, Jaroslaw

1991-01-01

A new technique for locating simultaneous roots of a set of functions is described. The technique is based on the property of the Kreisselmeier-Steinhauser function which descends to a minimum at each root location. It is shown that the ensuing algorithm may be merged into any nonlinear programming method for solving optimization problems with equality constraints.

A technique for locating function roots and for satisfying equality constraints in optimization

NASA Technical Reports Server (NTRS)

Sobieszczanski-Sobieski, J.

1992-01-01

A new technique for locating simultaneous roots of a set of functions is described. The technique is based on the property of the Kreisselmeier-Steinhauser function which descends to a minimum at each root location. It is shown that the ensuing algorithm may be merged into any nonlinear programming method for solving optimization problems with equality constraints.

Dynamic Relaxation: A Technique for Detailed Thermo-Elastic Structural Analysis of Transportation Structures

NASA Astrophysics Data System (ADS)

Shoukry, Samir N.; William, Gergis W.; Riad, Mourad Y.; McBride, Kevyn C.

2006-08-01

Dynamic relaxation is a technique developed to solve static problems through an explicit integration in finite element. The main advantage of such a technique is the ability to solve a large problem in a relatively short time compared with the traditional implicit techniques, especially when using nonlinear material models. This paper describes the use of such a technique in analyzing large transportation structures as dowel jointed concrete pavements and 306-m-long, reinforced concrete bridge superstructure under the effect of temperature variations. The main feature of the pavement model is the detailed modeling of dowel bars and their interfaces with the surrounding concrete using extremely fine mesh of solid elements, while in the bridge structure it is the detailed modeling of the girder-deck interface as well as the bracing members between the girders. The 3DFE results were found to be in a good agreement with experimentally measured data obtained from an instrumented pavements sections and a highway bridge constructed in West Virginia. Thus, such a technique provides a good tool for analyzing the response of large structures to static loads in a fraction of the time required by traditional, implicit finite element methods.

SUBOPT: A CAD program for suboptimal linear regulators

NASA Technical Reports Server (NTRS)

Fleming, P. J.

1985-01-01

An interactive software package which provides design solutions for both standard linear quadratic regulator (LQR) and suboptimal linear regulator problems is described. Intended for time-invariant continuous systems, the package is easily modified to include sampled-data systems. LQR designs are obtained by established techniques while the large class of suboptimal problems containing controller and/or performance index options is solved using a robust gradient minimization technique. Numerical examples demonstrate features of the package and recent developments are described.

Brainstorming

ERIC Educational Resources Information Center

Ball, Daniel W.

1973-01-01

Suggests the technique of brainstorming, in which a group generates spontaneous thoughts regarding how something might be used or how a problem might be solved, as a valuable way to help elementary school children learn science. (JR)

Freshwater Ecosystem Research in Water Quality Management

ERIC Educational Resources Information Center

Ferris, James J.; And Others

1974-01-01

Describes the use of modeling techniques to contribute to the basic knowledge of ecologic science, and in solving problems of biological production, resource-use planning and management, and environmental quality. (JR)

Damage tolerant design using collapse techniques

NASA Technical Reports Server (NTRS)

Haftka, R. T.

1982-01-01

A new approach to the design of structures for improved global damage tolerance is presented. In its undamaged condition the structure is designed subject to strength, displacement and buckling constraints. In the damaged condition the only constraint is that the structure will not collapse. The collapse load calculation is formulated as a maximization problem and solved by an interior extended penalty function. The design for minimum weight subject to constraints on the undamaged structure and a specified level of the collapse load is a minimization problem which is also solved by a penalty function formulation. Thus the overall problem is of a nested or multilevel optimization. Examples are presented to demonstrate the difference between the present and more traditional approaches.

Computer Graphics-aided systems analysis: application to well completion design

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

Detamore, J.E.; Sarma, M.P.

1985-03-01

The development of an engineering tool (in the form of a computer model) for solving design and analysis problems related with oil and gas well production operations is discussed. The development of the method is based on integrating the concepts of ''Systems Analysis'' with the techniques of ''Computer Graphics''. The concepts behind the method are very general in nature. This paper, however, illustrates the application of the method in solving gas well completion design problems. The use of the method will save time and improve the efficiency of such design and analysis problems. The method can be extended to othermore » design and analysis aspects of oil and gas wells.« less

A centre-free approach for resource allocation with lower bounds

NASA Astrophysics Data System (ADS)

Obando, Germán; Quijano, Nicanor; Rakoto-Ravalontsalama, Naly

2017-09-01

Since complexity and scale of systems are continuously increasing, there is a growing interest in developing distributed algorithms that are capable to address information constraints, specially for solving optimisation and decision-making problems. In this paper, we propose a novel method to solve distributed resource allocation problems that include lower bound constraints. The optimisation process is carried out by a set of agents that use a communication network to coordinate their decisions. Convergence and optimality of the method are guaranteed under some mild assumptions related to the convexity of the problem and the connectivity of the underlying graph. Finally, we compare our approach with other techniques reported in the literature, and we present some engineering applications.

Domain decomposition methods in aerodynamics

NASA Technical Reports Server (NTRS)

Venkatakrishnan, V.; Saltz, Joel

1990-01-01

Compressible Euler equations are solved for two-dimensional problems by a preconditioned conjugate gradient-like technique. An approximate Riemann solver is used to compute the numerical fluxes to second order accuracy in space. Two ways to achieve parallelism are tested, one which makes use of parallelism inherent in triangular solves and the other which employs domain decomposition techniques. The vectorization/parallelism in triangular solves is realized by the use of a recording technique called wavefront ordering. This process involves the interpretation of the triangular matrix as a directed graph and the analysis of the data dependencies. It is noted that the factorization can also be done in parallel with the wave front ordering. The performances of two ways of partitioning the domain, strips and slabs, are compared. Results on Cray YMP are reported for an inviscid transonic test case. The performances of linear algebra kernels are also reported.

Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem

PubMed Central

Akutsah, Francis; Olusanya, Micheal O.; Adewumi, Aderemi O.

2018-01-01

The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization problems. This paper presents an improved intelligent water drop algorithm for solving multi-depot vehicle routing problems. A simulated annealing algorithm was introduced into the proposed algorithm as a local search metaheuristic to prevent the intelligent water drop algorithm from getting trapped into local minima and also improve its solution quality. In addition, some of the potential problematic issues associated with using simulated annealing that include high computational runtime and exponential calculation of the probability of acceptance criteria, are investigated. The exponential calculation of the probability of acceptance criteria for the simulated annealing based techniques is computationally expensive. Therefore, in order to maximize the performance of the intelligent water drop algorithm using simulated annealing, a better way of calculating the probability of acceptance criteria is considered. The performance of the proposed hybrid algorithm is evaluated by using 33 standard test problems, with the results obtained compared with the solutions offered by four well-known techniques from the subject literature. Experimental results and statistical tests show that the new method possesses outstanding performance in terms of solution quality and runtime consumed. In addition, the proposed algorithm is suitable for solving large-scale problems. PMID:29554662

Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem.

PubMed

Ezugwu, Absalom E; Akutsah, Francis; Olusanya, Micheal O; Adewumi, Aderemi O

2018-01-01

The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization problems. This paper presents an improved intelligent water drop algorithm for solving multi-depot vehicle routing problems. A simulated annealing algorithm was introduced into the proposed algorithm as a local search metaheuristic to prevent the intelligent water drop algorithm from getting trapped into local minima and also improve its solution quality. In addition, some of the potential problematic issues associated with using simulated annealing that include high computational runtime and exponential calculation of the probability of acceptance criteria, are investigated. The exponential calculation of the probability of acceptance criteria for the simulated annealing based techniques is computationally expensive. Therefore, in order to maximize the performance of the intelligent water drop algorithm using simulated annealing, a better way of calculating the probability of acceptance criteria is considered. The performance of the proposed hybrid algorithm is evaluated by using 33 standard test problems, with the results obtained compared with the solutions offered by four well-known techniques from the subject literature. Experimental results and statistical tests show that the new method possesses outstanding performance in terms of solution quality and runtime consumed. In addition, the proposed algorithm is suitable for solving large-scale problems.

Comparison of student's learning achievement through realistic mathematics education (RME) approach and problem solving approach on grade VII

NASA Astrophysics Data System (ADS)

Ilyas, Muhammad; Salwah

2017-02-01

The type of this research was experiment. The purpose of this study was to determine the difference and the quality of student's learning achievement between students who obtained learning through Realistic Mathematics Education (RME) approach and students who obtained learning through problem solving approach. This study was a quasi-experimental research with non-equivalent experiment group design. The population of this study was all students of grade VII in one of junior high school in Palopo, in the second semester of academic year 2015/2016. Two classes were selected purposively as sample of research that was: year VII-5 as many as 28 students were selected as experiment group I and VII-6 as many as 23 students were selected as experiment group II. Treatment that used in the experiment group I was learning by RME Approach, whereas in the experiment group II by problem solving approach. Technique of data collection in this study gave pretest and posttest to students. The analysis used in this research was an analysis of descriptive statistics and analysis of inferential statistics using t-test. Based on the analysis of descriptive statistics, it can be concluded that the average score of students' mathematics learning after taught using problem solving approach was similar to the average results of students' mathematics learning after taught using realistic mathematics education (RME) approach, which are both at the high category. In addition, It can also be concluded that; (1) there was no difference in the results of students' mathematics learning taught using realistic mathematics education (RME) approach and students who taught using problem solving approach, (2) quality of learning achievement of students who received RME approach and problem solving approach learning was same, which was at the high category.

A numerical method for solving a nonlinear 2-D optimal control problem with the classical diffusion equation

NASA Astrophysics Data System (ADS)

Mamehrashi, K.; Yousefi, S. A.

2017-02-01

This paper presents a numerical solution for solving a nonlinear 2-D optimal control problem (2DOP). The performance index of a nonlinear 2DOP is described with a state and a control function. Furthermore, dynamic constraint of the system is given by a classical diffusion equation. It is preferred to use the Ritz method for finding the numerical solution of the problem. The method is based upon the Legendre polynomial basis. By using this method, the given optimisation nonlinear 2DOP reduces to the problem of solving a system of algebraic equations. The benefit of the method is that it provides greater flexibility in which the given initial and boundary conditions of the problem are imposed. Moreover, compared with the eigenfunction method, the satisfactory results are obtained only in a small number of polynomials order. This numerical approach is applicable and effective for such a kind of nonlinear 2DOP. The convergence of the method is extensively discussed and finally two illustrative examples are included to observe the validity and applicability of the new technique developed in the current work.

An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems

NASA Astrophysics Data System (ADS)

Li, Hong; Zhang, Li; Jiao, Yong-Chang

2016-07-01

This paper presents an interactive approach based on a discrete differential evolution algorithm to solve a class of integer bilevel programming problems, in which integer decision variables are controlled by an upper-level decision maker and real-value or continuous decision variables are controlled by a lower-level decision maker. Using the Karush--Kuhn-Tucker optimality conditions in the lower-level programming, the original discrete bilevel formulation can be converted into a discrete single-level nonlinear programming problem with the complementarity constraints, and then the smoothing technique is applied to deal with the complementarity constraints. Finally, a discrete single-level nonlinear programming problem is obtained, and solved by an interactive approach. In each iteration, for each given upper-level discrete variable, a system of nonlinear equations including the lower-level variables and Lagrange multipliers is solved first, and then a discrete nonlinear programming problem only with inequality constraints is handled by using a discrete differential evolution algorithm. Simulation results show the effectiveness of the proposed approach.

Application of shifted Jacobi pseudospectral method for solving (in)finite-horizon min-max optimal control problems with uncertainty

NASA Astrophysics Data System (ADS)

Nikooeinejad, Z.; Delavarkhalafi, A.; Heydari, M.

2018-03-01

The difficulty of solving the min-max optimal control problems (M-MOCPs) with uncertainty using generalised Euler-Lagrange equations is caused by the combination of split boundary conditions, nonlinear differential equations and the manner in which the final time is treated. In this investigation, the shifted Jacobi pseudospectral method (SJPM) as a numerical technique for solving two-point boundary value problems (TPBVPs) in M-MOCPs for several boundary states is proposed. At first, a novel framework of approximate solutions which satisfied the split boundary conditions automatically for various boundary states is presented. Then, by applying the generalised Euler-Lagrange equations and expanding the required approximate solutions as elements of shifted Jacobi polynomials, finding a solution of TPBVPs in nonlinear M-MOCPs with uncertainty is reduced to the solution of a system of algebraic equations. Moreover, the Jacobi polynomials are particularly useful for boundary value problems in unbounded domain, which allow us to solve infinite- as well as finite and free final time problems by domain truncation method. Some numerical examples are given to demonstrate the accuracy and efficiency of the proposed method. A comparative study between the proposed method and other existing methods shows that the SJPM is simple and accurate.

Application of symbolic/numeric matrix solution techniques to the NASTRAN program

NASA Technical Reports Server (NTRS)

Buturla, E. M.; Burroughs, S. H.

1977-01-01

The matrix solving algorithm of any finite element algorithm is extremely important since solution of the matrix equations requires a large amount of elapse time due to null calculations and excessive input/output operations. An alternate method of solving the matrix equations is presented. A symbolic processing step followed by numeric solution yields the solution very rapidly and is especially useful for nonlinear problems.

Solving Fuzzy Fractional Differential Equations Using Zadeh's Extension Principle

PubMed Central

Ahmad, M. Z.; Hasan, M. K.; Abbasbandy, S.

2013-01-01

We study a fuzzy fractional differential equation (FFDE) and present its solution using Zadeh's extension principle. The proposed study extends the case of fuzzy differential equations of integer order. We also propose a numerical method to approximate the solution of FFDEs. To solve nonlinear problems, the proposed numerical method is then incorporated into an unconstrained optimisation technique. Several numerical examples are provided. PMID:24082853

The artificial-free technique along the objective direction for the simplex algorithm

NASA Astrophysics Data System (ADS)

Boonperm, Aua-aree; Sinapiromsaran, Krung

2014-03-01

The simplex algorithm is a popular algorithm for solving linear programming problems. If the origin point satisfies all constraints then the simplex can be started. Otherwise, artificial variables will be introduced to start the simplex algorithm. If we can start the simplex algorithm without using artificial variables then the simplex iterate will require less time. In this paper, we present the artificial-free technique for the simplex algorithm by mapping the problem into the objective plane and splitting constraints into three groups. In the objective plane, one of variables which has a nonzero coefficient of the objective function is fixed in terms of another variable. Then it can split constraints into three groups: the positive coefficient group, the negative coefficient group and the zero coefficient group. Along the objective direction, some constraints from the positive coefficient group will form the optimal solution. If the positive coefficient group is nonempty, the algorithm starts with relaxing constraints from the negative coefficient group and the zero coefficient group. We guarantee the feasible region obtained from the positive coefficient group to be nonempty. The transformed problem is solved using the simplex algorithm. Additional constraints from the negative coefficient group and the zero coefficient group will be added to the solved problem and use the dual simplex method to determine the new optimal solution. An example shows the effectiveness of our algorithm.

Generating realistic images using Kray

NASA Astrophysics Data System (ADS)

Tanski, Grzegorz

2004-07-01

Kray is an application for creating realistic images. It is written in C++ programming language, has a text-based interface, solves global illumination problem using techniques such as radiosity, path tracing and photon mapping.

Laboratory Scale Electrodeposition. Practice and Applications.

ERIC Educational Resources Information Center

Bruno, Thomas J.

1986-01-01

Discusses some aspects of electrodeposition and electroplating. Emphasizes the materials, techniques, and safety precautions necessary to make electrodeposition work reliably in the chemistry laboratory. Describes some problem-solving applications of this process. (TW)

An investigation of the effects of interventions on problem-solving strategies and abilities

NASA Astrophysics Data System (ADS)

Cox, Charles Terrence, Jr.

Problem-solving has been described as being the "heart" of the chemistry classroom, and students' development of problem-solving skills is essential for their success in chemistry. Despite the importance of problem-solving, there has been little research within the chemistry domain, largely because of the lack of tools to collect data for large populations. Problem-solving was assessed using a software package known as IMMEX (for Interactive Multimedia Exercises) which has an HTML tracking feature that allows for collection of problem-solving data in the background as students work the problems. The primary goal of this research was to develop methods (known as interventions) that could promote improvements in students' problem-solving and most notably aid in their transition from the novice to competent level. Three intervention techniques that were incorporated within the chemistry curricula: collaborative grouping (face-to-face and distance), concept mapping, and peer-led team learning. The face-to-face collaborative grouping intervention was designed to probe the factors affecting the quality of the group interaction. Students' logical reasoning abilities were measured using the Group Assessment of Logical Thinking (GALT) test which classifies students as formal, transitional, or concrete. These classifications essentially provide a basis for identifying scientific aptitude. These designations were used as the basis for forming collaborative groups of two students. The six possibilities (formal-formal, formal-transitional, etc.) were formed to determine how the group composition influences the gains in student abilities observed from collaborative grouping interventions. Students were given three assignments (an individual pre-collaborative, an individual post collaborative, and a collaborative assignment) each requiring them to work an IMMEX problem set. Similar gains in performance of 10% gains were observed for each group with two exceptions. The transitional students who were paired with concrete students had a 15% gain, and the concrete students paired with other concrete students had only a marginal gain. In fact, there was no statistical difference in the pre-collaborative and post-collaborative student abilities for concrete-concrete groups. The distance collaborative intervention was completed using a new interface for the IMMEX software designed to mimic face-to-face collaboration. A stereochemistry problem set which had a solved rate of 28% prior to collaboration was chosen for incorporation into this distance collaboration study. (Abstract shortened by UMI.)

Changing Attitudes and Facilitating Understanding in the Undergraduate Statistics Classroom: A Collaborative Learning Approach

ERIC Educational Resources Information Center

Curran, Erin; Carlson, Kerri; Celotta, Dayius Turvold

2013-01-01

Collaborative and problem-based learning strategies are theorized to be effective methods for strengthening undergraduate science, technology, engineering, and mathematics education. Peer-Led Team Learning (PLTL) is a collaborative learning technique that engages students in problem solving and discussion under the guidance of a trained peer…

Administrative Technology and the School Executive: Applying the Systems Approach to Educational Administration.

ERIC Educational Resources Information Center

Knezevich, Stephen J., Ed.

In this era of rapid social change, educational administrators have discovered that new approaches to problem solving and decision making are needed. Systems analysis could afford a promising approach to administrative problems by providing a number of systematic techniques designed to sharpen administrative decision making, enhance efficiency,…

Qualitative Reasoning methods for CELSS modeling.

PubMed

Guerrin, F; Bousson, K; Steyer JPh; Trave-Massuyes, L

1994-11-01

Qualitative Reasoning (QR) is a branch of Artificial Intelligence that arose from research on engineering problem solving. This paper describes the major QR methods and techniques, which, we believe, are capable of addressing some of the problems that are emphasized in the literature and posed by CELSS modeling, simulation, and control at the supervisory level.

Semantic Grammar: An Engineering Technique for Constructing Natural Language Understanding Systems.

ERIC Educational Resources Information Center

Burton, Richard R.

In an attempt to overcome the lack of natural means of communication between student and computer, this thesis addresses the problem of developing a system which can understand natural language within an educational problem-solving environment. The nature of the environment imposes efficiency, habitability, self-teachability, and awareness of…

Who's in the Mirror? Finding the Real Me.

ERIC Educational Resources Information Center

Herron, Ron; Peter, Val J.

This book teaches adolescents problem solving techniques to help them as they strive for independence and struggle with responsibility. Each issue is introduced by a story involving a teen dealing with the problem or issue to be discussed. The book discusses eight ways that adolescents can get along better with their parents, thus gaining their…

Changes in Teachers' Adaptive Expertise in an Engineering Professional Development Course

ERIC Educational Resources Information Center

Martin, Taylor; Peacock, Stephanie Baker; Ko, Pat; Rudolph, Jennifer J.

2015-01-01

Although the consensus seems to be that high-school-level introductory engineering courses should focus on design, this creates a problem for teacher training. Traditionally, math and science teachers are trained to teach and assess factual knowledge and closed-ended problem-solving techniques specific to a particular discipline, which is unsuited…

Grid-Independent Compressive Imaging and Fourier Phase Retrieval

ERIC Educational Resources Information Center

Liao, Wenjing

2013-01-01

This dissertation is composed of two parts. In the first part techniques of band exclusion(BE) and local optimization(LO) are proposed to solve linear continuum inverse problems independently of the grid spacing. The second part is devoted to the Fourier phase retrieval problem. Many situations in optics, medical imaging and signal processing call…

Learning Difficulties of Diabetic Patients: A Survey of Educators.

ERIC Educational Resources Information Center

Bonnet, Caroline; Gagnayre, Remi; d'Ivernois, Jean-Francois

1998-01-01

Surveys 85 health care professionals on the learning difficulties of diabetic patients. Results show that educators find it easy to teach techniques: patients master procedures well and make few mistakes. In contrast, diabetic patients seem to have problems learning skills, such as insulin dose adjustment, that require complex problem-solving.…

Heterogeneity in Health Care Computing Environments

PubMed Central

Sengupta, Soumitra

1989-01-01

This paper discusses issues of heterogeneity in computer systems, networks, databases, and presentation techniques, and the problems it creates in developing integrated medical information systems. The need for institutional, comprehensive goals are emphasized. Using the Columbia-Presbyterian Medical Center's computing environment as the case study, various steps to solve the heterogeneity problem are presented.

Solving Discipline Problems: Strategies for Classroom Teachers.

ERIC Educational Resources Information Center

Wolfgang, Charles H.; Glickman, Carl D.

This book provides classroom teachers with a variety of discipline models, techniques, methods, and constructs designed to enable them to move beyond a singular approach in handling classroom behavior problems. The book first discusses the Teacher Behavior Continuum (TBC) which shows the teacher the context of his or her own general behavior with…

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.

On the parallel solution of parabolic equations

NASA Technical Reports Server (NTRS)

Gallopoulos, E.; Saad, Youcef

1989-01-01

Parallel algorithms for the solution of linear parabolic problems are proposed. The first of these methods is based on using polynomial approximation to the exponential. It does not require solving any linear systems and is highly parallelizable. The two other methods proposed are based on Pade and Chebyshev approximations to the matrix exponential. The parallelization of these methods is achieved by using partial fraction decomposition techniques to solve the resulting systems and thus offers the potential for increased time parallelism in time dependent problems. Experimental results from the Alliant FX/8 and the Cray Y-MP/832 vector multiprocessors are also presented.

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

NASA Astrophysics Data System (ADS)

Tinney, Charles Evan

2007-12-01

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

The min-conflicts heuristic: Experimental and theoretical results

NASA Technical Reports Server (NTRS)

Minton, Steven; Philips, Andrew B.; Johnston, Mark D.; Laird, Philip

1991-01-01

This paper describes a simple heuristic method for solving large-scale constraint satisfaction and scheduling problems. Given an initial assignment for the variables in a problem, the method operates by searching through the space of possible repairs. The search is guided by an ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. We demonstrate empirically that the method performs orders of magnitude better than traditional backtracking techniques on certain standard problems. For example, the one million queens problem can be solved rapidly using our approach. We also describe practical scheduling applications where the method has been successfully applied. A theoretical analysis is presented to explain why the method works so well on certain types of problems and to predict when it is likely to be most effective.

Impact of problem-based learning in a large classroom setting: student perception and problem-solving skills.

PubMed

Klegeris, Andis; Hurren, Heather

2011-12-01

Problem-based learning (PBL) can be described as a learning environment where the problem drives the learning. This technique usually involves learning in small groups, which are supervised by tutors. It is becoming evident that PBL in a small-group setting has a robust positive effect on student learning and skills, including better problem-solving skills and an increase in overall motivation. However, very little research has been done on the educational benefits of PBL in a large classroom setting. Here, we describe a PBL approach (using tutorless groups) that was introduced as a supplement to standard didactic lectures in University of British Columbia Okanagan undergraduate biochemistry classes consisting of 45-85 students. PBL was chosen as an effective method to assist students in learning biochemical and physiological processes. By monitoring student attendance and using informal and formal surveys, we demonstrated that PBL has a significant positive impact on student motivation to attend and participate in the course work. Student responses indicated that PBL is superior to traditional lecture format with regard to the understanding of course content and retention of information. We also demonstrated that student problem-solving skills are significantly improved, but additional controlled studies are needed to determine how much PBL exercises contribute to this improvement. These preliminary data indicated several positive outcomes of using PBL in a large classroom setting, although further studies aimed at assessing student learning are needed to further justify implementation of this technique in courses delivered to large undergraduate classes.

The use of multiple representations and visualizations in student learning of introductory physics: An example from work and energy

NASA Astrophysics Data System (ADS)

Zou, Xueli

In the past three decades, physics education research has primarily focused on student conceptual understanding; little work has been conducted to investigate student difficulties in problem solving. In cognitive science and psychology, however, extensive studies have explored the differences in problem solving between experts and naive students. A major finding indicates that experts often apply qualitative representations in problem solving, but that novices use an equation-centered method. This dissertation describes investigations into the use of multiple representations and visualizations in student understanding and problem solving with the concepts of work and energy. A multiple-representation strategy was developed to help students acquire expertise in solving work-energy problems. In this approach, a typical work-energy problem is considered as a physical process. The process is first described in words-the verbal representation of the process. Next, a sketch or a picture, called a pictorial representation, is used to represent the process. This is followed by work-energy bar charts-a physical representation of the same processes. Finally, this process is represented mathematically by using a generalized work-energy equation. In terms of the multiple representations, the goal of solving a work- energy problem is to represent the physical process the more intuitive pictorial and diagrammatic physical representations. Ongoing assessment of student learning indicates that this multiple-representation technique is more effective than standard instruction methods in student problem solving. visualize this difficult-to-understand concept, a guided- inquiry learning activity using a pair of model carts and an experiment problem using a sandbag were developed. Assessment results have shown that these research-based materials are effective in helping students visualize this concept and give a pictorial idea of ``where the kinetic energy goes'' during inelastic collisions. The research and curriculum development was conducted in the context of the introductory calculus-based physics course. Investigations were carried out using common physics education research tools, including open-ended surveys, written test questions, and individual student interviews.

A shrinking hypersphere PSO for engineering optimisation problems

NASA Astrophysics Data System (ADS)

Yadav, Anupam; Deep, Kusum

2016-03-01

Many real-world and engineering design problems can be formulated as constrained optimisation problems (COPs). Swarm intelligence techniques are a good approach to solve COPs. In this paper an efficient shrinking hypersphere-based particle swarm optimisation (SHPSO) algorithm is proposed for constrained optimisation. The proposed SHPSO is designed in such a way that the movement of the particle is set to move under the influence of shrinking hyperspheres. A parameter-free approach is used to handle the constraints. The performance of the SHPSO is compared against the state-of-the-art algorithms for a set of 24 benchmark problems. An exhaustive comparison of the results is provided statistically as well as graphically. Moreover three engineering design problems namely welded beam design, compressed string design and pressure vessel design problems are solved using SHPSO and the results are compared with the state-of-the-art algorithms.

An Investigation to Manufacturing Analytical Services Composition using the Analytical Target Cascading Method.

PubMed

Tien, Kai-Wen; Kulvatunyou, Boonserm; Jung, Kiwook; Prabhu, Vittaldas

2017-01-01

As cloud computing is increasingly adopted, the trend is to offer software functions as modular services and compose them into larger, more meaningful ones. The trend is attractive to analytical problems in the manufacturing system design and performance improvement domain because 1) finding a global optimization for the system is a complex problem; and 2) sub-problems are typically compartmentalized by the organizational structure. However, solving sub-problems by independent services can result in a sub-optimal solution at the system level. This paper investigates the technique called Analytical Target Cascading (ATC) to coordinate the optimization of loosely-coupled sub-problems, each may be modularly formulated by differing departments and be solved by modular analytical services. The result demonstrates that ATC is a promising method in that it offers system-level optimal solutions that can scale up by exploiting distributed and modular executions while allowing easier management of the problem formulation.

Improvement in Generic Problem-Solving Abilities of Students by Use of Tutor-Less Problem-Based Learning in a Large Classroom Setting

ERIC Educational Resources Information Center

Klegeris, Andis; Bahniwal, Manpreet; Hurren, Heather

2013-01-01

Problem-based learning (PBL) was originally introduced in medical education programs as a form of small-group learning, but its use has now spread to large undergraduate classrooms in various other disciplines. Introduction of new teaching techniques, including PBL-based methods, needs to be justified by demonstrating the benefits of such…

Ozone contamination in aircraft cabins: Objectives and approach

NASA Technical Reports Server (NTRS)

Perkins, P. J.

1979-01-01

Three panels were developed to solve the problem of ozone contamination in aircraft cabins. The problem is defined from direct in-flight measurements of ozone concentrations inside and outside airliners in their normal operations. Solutions to the cabin ozone problem are discussed under two areas: (1) flight planning to avoid high ozone concentrations, and (2) ozone destruction techniques installed in the cabin air systems.

Stress Management Techniques for Graduate Students: Cognitive Coping, Problem-Solving and Time Management.

ERIC Educational Resources Information Center

Kolko, David J.

The application of stress management techniques to highly specialized populations and disorders has become an increasingly important clinical endeavor in recent years. Curiously, however, individuals undergoing one of the most stress-laden experiences, graduate school, have rarely been the focus of such efforts. There are three major forms of…

Business and Industrial Supervisors. Project TEAMS. (Techniques and Education for Achieving Management Skills).

ERIC Educational Resources Information Center

Platte Technical Community Coll., Columbus, NE.

The result of a project to develop short courses to help business and industrial supervisors in developing practical, up-to-date managerial skills, this instructional workbook provides information and exercises applicable to on-the-job situations. Unit I covers the following aspects of management: leadership techniques, problem solving, decision…

A Brief Review of Psychological Theories and Counseling Techniques for Outdoor Leaders.

ERIC Educational Resources Information Center

Bankie, Brett; And Others

The paper is intended to provide resource information and an annotated bibliography on psychological theories and counseling techniques specifically written for outdoor educators, to stimulate research on the subject, and to stimulate outdoor leaders to make themselves aware of various options for solving interpersonal problems that might occur in…

Studying Parental Decision Making with Micro-Computers: The CPSI Technique.

ERIC Educational Resources Information Center

Holden, George W.

A technique for studying how parents think, make decisions, and solve childrearing problems, Computer-Presented Social Interactions (CPSI), is described. Two studies involving CPSI are presented. The first study concerns a common parental cognitive task: causal analysis of an undesired behavior. The task was to diagnose the cause of non-contingent…

Project TEAMS (Techniques and Education for Achieving Management Skills): Health Care Administrators.

ERIC Educational Resources Information Center

Platte Technical Community Coll., Columbus, NE.

These Project TEAMS (Techniques and Education for Achieving Management Skills) instructional materials consist of five units for use in training health care administrators. Unit 1 contains materials designed to help the health care administrators increase their management skills in regard to self-awareness, time management, problem solving,…

The Gandhi Technique: A Biculturalization Approach for Empowering Asian and Pacific Islander Families.

ERIC Educational Resources Information Center

Fong, Rowena; Boyd, Carylee; Browne, Collette

1999-01-01

Western social-work interventions must be adapted to empower ethnic minority families. A case study of a Hawaiian family-centered, family-empowering, problem-solving intervention using the Gandhi Technique shows it to be compatible with Asian and Pacific-Islander values. Considerations for culturally competent social work practice with Asian and…

Determining the Deacetylation Degree of Chitosan: Opportunities to Learn Instrumental Techniques

ERIC Educational Resources Information Center

Pérez-Álvarez, Leyre; Ruiz-Rubio, Leire; Vilas-Vilela, Jose Luis

2018-01-01

To enhance critical thinking and problem-solving skills, a project-based learning (PBL) approach for "Instrumental Techniques" courses in undergraduate physical chemistry was specifically developed for a pharmacy bachelor degree program. The starting point of this PBL was an open-ended question that is close to the student scientist's…

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.

Flight control with adaptive critic neural network

NASA Astrophysics Data System (ADS)

Han, Dongchen

2001-10-01

In this dissertation, the adaptive critic neural network technique is applied to solve complex nonlinear system control problems. Based on dynamic programming, the adaptive critic neural network can embed the optimal solution into a neural network. Though trained off-line, the neural network forms a real-time feedback controller. Because of its general interpolation properties, the neurocontroller has inherit robustness. The problems solved here are an agile missile control for U.S. Air Force and a midcourse guidance law for U.S. Navy. In the first three papers, the neural network was used to control an air-to-air agile missile to implement a minimum-time heading-reverse in a vertical plane corresponding to following conditions: a system without constraint, a system with control inequality constraint, and a system with state inequality constraint. While the agile missile is a one-dimensional problem, the midcourse guidance law is the first test-bed for multiple-dimensional problem. In the fourth paper, the neurocontroller is synthesized to guide a surface-to-air missile to a fixed final condition, and to a flexible final condition from a variable initial condition. In order to evaluate the adaptive critic neural network approach, the numerical solutions for these cases are also obtained by solving two-point boundary value problem with a shooting method. All of the results showed that the adaptive critic neural network could solve complex nonlinear system control problems.

Mining EEG with SVM for Understanding Cognitive Underpinnings of Math Problem Solving Strategies

PubMed Central

López, Julio

2018-01-01

We have developed a new methodology for examining and extracting patterns from brain electric activity by using data mining and machine learning techniques. Data was collected from experiments focused on the study of cognitive processes that might evoke different specific strategies in the resolution of math problems. A binary classification problem was constructed using correlations and phase synchronization between different electroencephalographic channels as characteristics and, as labels or classes, the math performances of individuals participating in specially designed experiments. The proposed methodology is based on using well-established procedures of feature selection, which were used to determine a suitable brain functional network size related to math problem solving strategies and also to discover the most relevant links in this network without including noisy connections or excluding significant connections. PMID:29670667

Mining EEG with SVM for Understanding Cognitive Underpinnings of Math Problem Solving Strategies.

PubMed

Bosch, Paul; Herrera, Mauricio; López, Julio; Maldonado, Sebastián

2018-01-01

We have developed a new methodology for examining and extracting patterns from brain electric activity by using data mining and machine learning techniques. Data was collected from experiments focused on the study of cognitive processes that might evoke different specific strategies in the resolution of math problems. A binary classification problem was constructed using correlations and phase synchronization between different electroencephalographic channels as characteristics and, as labels or classes, the math performances of individuals participating in specially designed experiments. The proposed methodology is based on using well-established procedures of feature selection, which were used to determine a suitable brain functional network size related to math problem solving strategies and also to discover the most relevant links in this network without including noisy connections or excluding significant connections.

The characteristics of failure among students who experienced pseudo thinking

NASA Astrophysics Data System (ADS)

Anggraini, D.; Kusmayadi, T. A.; Pramudya, I.

2018-04-01

The purpose of this research is to describe the thinking process of students who experienced pseudo thinking when solving the straight line equation. The result of this study shows the characteristics of error that caused students to experience pseudo thinking when solving the problem and their relation with students’ metacognition skill. This qualitative research was conducted in State 16 Junior High School in Surakarta, Indonesia during the odd semester of 2017/2018 academic year. The subjects of the study were students Junior High School students of 8th grade chosen using purposive sampling technique. Data were collected through the administration of think aloud method. The result showed that the characteristics of errors among the subjects are: 1) the answers resulted from pseudo thinking when solving the problem were obtained from the spontaneous, fast, unconscious and uncontrolled thinking process; 2) students had misconception; 3) students had tendency to memorize the formula and imitate the completion procedure; 4) students experienced fuzzy memory when solving the problem. From the mistakes among students who experienced pseudo thinking, their metacognition ability could be inferred.

Machine-learning techniques for fast and accurate feature localization in holograms of colloidal particles

NASA Astrophysics Data System (ADS)

Hannel, Mark D.; Abdulali, Aidan; O'Brien, Michael; Grier, David G.

2018-06-01

Holograms of colloidal particles can be analyzed with the Lorenz-Mie theory of light scattering to measure individual particles' three-dimensional positions with nanometer precision while simultaneously estimating their sizes and refractive indexes. Extracting this wealth of information begins by detecting and localizing features of interest within individual holograms. Conventionally approached with heuristic algorithms, this image analysis problem can be solved faster and more generally with machine-learning techniques. We demonstrate that two popular machine-learning algorithms, cascade classifiers and deep convolutional neural networks (CNN), can solve the feature-localization problem orders of magnitude faster than current state-of-the-art techniques. Our CNN implementation localizes holographic features precisely enough to bootstrap more detailed analyses based on the Lorenz-Mie theory of light scattering. The wavelet-based Haar cascade proves to be less precise, but is so computationally efficient that it creates new opportunities for applications that emphasize speed and low cost. We demonstrate its use as a real-time targeting system for holographic optical trapping.

A Finite Element Projection Method for the Solution of Particle Transport Problems with Anisotropic Scattering.

DTIC Science & Technology

1984-07-01

piecewise constant energy dependence. This is a seven-dimensional problem with time dependence, three spatial and two angular or directional variables and...in extending the computer implementation of the method to time and energy dependent problems, and to solving and validating this technique on a...problems they have severe limitations. The Monte Carlo method, usually requires the use of many hours of expensive computer time , and for deep

Menu-Driven Solver Of Linear-Programming Problems

NASA Technical Reports Server (NTRS)

Viterna, L. A.; Ferencz, D.

1992-01-01

Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).

Efficient sequential and parallel algorithms for finding edit distance based motifs.

PubMed

Pal, Soumitra; Xiao, Peng; Rajasekaran, Sanguthevar

2016-08-18

Motif search is an important step in extracting meaningful patterns from biological data. The general problem of motif search is intractable and there is a pressing need to develop efficient, exact and approximation algorithms to solve this problem. In this paper, we present several novel, exact, sequential and parallel algorithms for solving the (l,d) Edit-distance-based Motif Search (EMS) problem: given two integers l,d and n biological strings, find all strings of length l that appear in each input string with atmost d errors of types substitution, insertion and deletion. One popular technique to solve the problem is to explore for each input string the set of all possible l-mers that belong to the d-neighborhood of any substring of the input string and output those which are common for all input strings. We introduce a novel and provably efficient neighborhood exploration technique. We show that it is enough to consider the candidates in neighborhood which are at a distance exactly d. We compactly represent these candidate motifs using wildcard characters and efficiently explore them with very few repetitions. Our sequential algorithm uses a trie based data structure to efficiently store and sort the candidate motifs. Our parallel algorithm in a multi-core shared memory setting uses arrays for storing and a novel modification of radix-sort for sorting the candidate motifs. The algorithms for EMS are customarily evaluated on several challenging instances such as (8,1), (12,2), (16,3), (20,4), and so on. The best previously known algorithm, EMS1, is sequential and in estimated 3 days solves up to instance (16,3). Our sequential algorithms are more than 20 times faster on (16,3). On other hard instances such as (9,2), (11,3), (13,4), our algorithms are much faster. Our parallel algorithm has more than 600 % scaling performance while using 16 threads. Our algorithms have pushed up the state-of-the-art of EMS solvers and we believe that the techniques introduced in this paper are also applicable to other motif search problems such as Planted Motif Search (PMS) and Simple Motif Search (SMS).

Geophysical methods in Geology. Second edition

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

Sharma, P.V.

This book presents an introduction to the methods of geophysics and their application to geological problems. The text emphasizes the broader aspects of geophysics, including the way in which geophysical methods help solve structural, correlational, and geochromological problems. Stress is laid on the principles and applications of methods rather than on instrumental techniques. This edition includes coverage of recent developments in geophysics and geology. New topics are introduced, including paleomagnetic methods, electromagnetic methods, microplate tectronics, and the use of multiple geophysical techniques.

Enhanced Multiobjective Optimization Technique for Comprehensive Aerospace Design. Part A

NASA Technical Reports Server (NTRS)

Chattopadhyay, Aditi; Rajadas, John N.

1997-01-01

A multidisciplinary design optimization procedure which couples formal multiobjectives based techniques and complex analysis procedures (such as computational fluid dynamics (CFD) codes) developed. The procedure has been demonstrated on a specific high speed flow application involving aerodynamics and acoustics (sonic boom minimization). In order to account for multiple design objectives arising from complex performance requirements, multiobjective formulation techniques are used to formulate the optimization problem. Techniques to enhance the existing Kreisselmeier-Steinhauser (K-S) function multiobjective formulation approach have been developed. The K-S function procedure used in the proposed work transforms a constrained multiple objective functions problem into an unconstrained problem which then is solved using the Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm. Weight factors are introduced during the transformation process to each objective function. This enhanced procedure will provide the designer the capability to emphasize specific design objectives during the optimization process. The demonstration of the procedure utilizes a computational Fluid dynamics (CFD) code which solves the three-dimensional parabolized Navier-Stokes (PNS) equations for the flow field along with an appropriate sonic boom evaluation procedure thus introducing both aerodynamic performance as well as sonic boom as the design objectives to be optimized simultaneously. Sensitivity analysis is performed using a discrete differentiation approach. An approximation technique has been used within the optimizer to improve the overall computational efficiency of the procedure in order to make it suitable for design applications in an industrial setting.

Applications of aerospace technology to petroleum exploration. Volume 1: Efforts and results

NASA Technical Reports Server (NTRS)

Jaffe, L. D.

1976-01-01

The feasibility of applying aerospace techniques to help solve significant problems in petroleum exploration is studied. Through contacts with petroleum industry and petroleum service industry, important petroleum exploration problems were identified. For each problem, areas of aerospace technology that might aid in its solution were also identified where possible. Topics selected for investigation include: seismic reflection systems; down-hole acoustic techniques; identification of geological analogies; drilling methods; remote geological sensing; and sea floor imaging and mapping. Specific areas of aerospace technology are applied to 21 concepts formulated from the topics of concern.

A tool for modeling concurrent real-time computation

NASA Technical Reports Server (NTRS)

Sharma, D. D.; Huang, Shie-Rei; Bhatt, Rahul; Sridharan, N. S.

1990-01-01

Real-time computation is a significant area of research in general, and in AI in particular. The complexity of practical real-time problems demands use of knowledge-based problem solving techniques while satisfying real-time performance constraints. Since the demands of a complex real-time problem cannot be predicted (owing to the dynamic nature of the environment) powerful dynamic resource control techniques are needed to monitor and control the performance. A real-time computation model for a real-time tool, an implementation of the QP-Net simulator on a Symbolics machine, and an implementation on a Butterfly multiprocessor machine are briefly described.

Portable parallel portfolio optimization in the Aurora Financial Management System

NASA Astrophysics Data System (ADS)

Laure, Erwin; Moritsch, Hans

2001-07-01

Financial planning problems are formulated as large scale, stochastic, multiperiod, tree structured optimization problems. An efficient technique for solving this kind of problems is the nested Benders decomposition method. In this paper we present a parallel, portable, asynchronous implementation of this technique. To achieve our portability goals we elected the programming language Java for our implementation and used a high level Java based framework, called OpusJava, for expressing the parallelism potential as well as synchronization constraints. Our implementation is embedded within a modular decision support tool for portfolio and asset liability management, the Aurora Financial Management System.

A new operational approach for solving fractional variational problems depending on indefinite integrals

NASA Astrophysics Data System (ADS)

Ezz-Eldien, S. S.; Doha, E. H.; Bhrawy, A. H.; El-Kalaawy, A. A.; Machado, J. A. T.

2018-04-01

In this paper, we propose a new accurate and robust numerical technique to approximate the solutions of fractional variational problems (FVPs) depending on indefinite integrals with a type of fixed Riemann-Liouville fractional integral. The proposed technique is based on the shifted Chebyshev polynomials as basis functions for the fractional integral operational matrix (FIOM). Together with the Lagrange multiplier method, these problems are then reduced to a system of algebraic equations, which greatly simplifies the solution process. Numerical examples are carried out to confirm the accuracy, efficiency and applicability of the proposed algorithm

Analyzing Convergence in e-Learning Resource Filtering Based on ACO Techniques: A Case Study with Telecommunication Engineering Students

ERIC Educational Resources Information Center

Munoz-Organero, Mario; Ramirez, Gustavo A.; Merino, Pedro Munoz; Kloos, Carlos Delgado

2010-01-01

The use of swarm intelligence techniques in e-learning scenarios provides a way to combine simple interactions of individual students to solve a more complex problem. After getting some data from the interactions of the first students with a central system, the use of these techniques converges to a solution that the rest of the students can…

Application of Central Upwind Scheme for Solving Special Relativistic Hydrodynamic Equations

PubMed Central

Yousaf, Muhammad; Ghaffar, Tayabia; Qamar, Shamsul

2015-01-01

The accurate modeling of various features in high energy astrophysical scenarios requires the solution of the Einstein equations together with those of special relativistic hydrodynamics (SRHD). Such models are more complicated than the non-relativistic ones due to the nonlinear relations between the conserved and state variables. A high-resolution shock-capturing central upwind scheme is implemented to solve the given set of equations. The proposed technique uses the precise information of local propagation speeds to avoid the excessive numerical diffusion. The second order accuracy of the scheme is obtained with the use of MUSCL-type initial reconstruction and Runge-Kutta time stepping method. After a discussion of the equations solved and of the techniques employed, a series of one and two-dimensional test problems are carried out. To validate the method and assess its accuracy, the staggered central and the kinetic flux-vector splitting schemes are also applied to the same model. The scheme is robust and efficient. Its results are comparable to those obtained from the sophisticated algorithms, even in the case of highly relativistic two-dimensional test problems. PMID:26070067

Auxiliary principle technique and iterative algorithm for a perturbed system of generalized multi-valued mixed quasi-equilibrium-like problems.

PubMed

Rahaman, Mijanur; Pang, Chin-Tzong; Ishtyak, Mohd; Ahmad, Rais

2017-01-01

In this article, we introduce a perturbed system of generalized mixed quasi-equilibrium-like problems involving multi-valued mappings in Hilbert spaces. To calculate the approximate solutions of the perturbed system of generalized multi-valued mixed quasi-equilibrium-like problems, firstly we develop a perturbed system of auxiliary generalized multi-valued mixed quasi-equilibrium-like problems, and then by using the celebrated Fan-KKM technique, we establish the existence and uniqueness of solutions of the perturbed system of auxiliary generalized multi-valued mixed quasi-equilibrium-like problems. By deploying an auxiliary principle technique and an existence result, we formulate an iterative algorithm for solving the perturbed system of generalized multi-valued mixed quasi-equilibrium-like problems. Lastly, we study the strong convergence analysis of the proposed iterative sequences under monotonicity and some mild conditions. These results are new and generalize some known results in this field.

Numerical simulation of transient, incongruent vaporization induced by high power laser

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

Tsai, C.H.

1981-01-01

A mathematical model and numerical calculations were developed to solve the heat and mass transfer problems specifically for uranum oxide subject to laser irradiation. It can easily be modified for other heat sources or/and other materials. In the uranium-oxygen system, oxygen is the preferentially vaporizing component, and as a result of the finite mobility of oxygen in the solid, an oxygen deficiency is set up near the surface. Because of the bivariant behavior of uranium oxide, the heat transfer problem and the oxygen diffusion problem are coupled and a numerical method of simultaneously solving the two boundary value problems ismore » studied. The temperature dependence of the thermal properties and oxygen diffusivity, as well as the highly ablative effect on the surface, leads to considerable non-linearities in both the governing differential equations and the boundary conditions. Based on the earlier work done in this laboratory by Olstad and Olander on Iron and on Zirconium hydride, the generality of the problem is expanded and the efficiency of the numerical scheme is improved. The finite difference method, along with some advanced numerical techniques, is found to be an efficient way to solve this problem.« less

An interative solution of an integral equation for radiative transfer by using variational technique

NASA Technical Reports Server (NTRS)

Yoshikawa, K. K.

1973-01-01

An effective iterative technique is introduced to solve a nonlinear integral equation frequently associated with radiative transfer problems. The problem is formulated in such a way that each step of an iterative sequence requires the solution of a linear integral equation. The advantage of a previously introduced variational technique which utilizes a stepwise constant trial function is exploited to cope with the nonlinear problem. The method is simple and straightforward. Rapid convergence is obtained by employing a linear interpolation of the iterative solutions. Using absorption coefficients of the Milne-Eddington type, which are applicable to some planetary atmospheric radiation problems. Solutions are found in terms of temperature and radiative flux. These solutions are presented numerically and show excellent agreement with other numerical solutions.

Derivative free Davidon-Fletcher-Powell (DFP) for solving symmetric systems of nonlinear equations

NASA Astrophysics Data System (ADS)

Mamat, M.; Dauda, M. K.; Mohamed, M. A. bin; Waziri, M. Y.; Mohamad, F. S.; Abdullah, H.

2018-03-01

Research from the work of engineers, economist, modelling, industry, computing, and scientist are mostly nonlinear equations in nature. Numerical solution to such systems is widely applied in those areas of mathematics. Over the years, there has been significant theoretical study to develop methods for solving such systems, despite these efforts, unfortunately the methods developed do have deficiency. In a contribution to solve systems of the form F(x) = 0, x ∈ Rn , a derivative free method via the classical Davidon-Fletcher-Powell (DFP) update is presented. This is achieved by simply approximating the inverse Hessian matrix with {Q}k+1-1 to θkI. The modified method satisfied the descent condition and possess local superlinear convergence properties. Interestingly, without computing any derivative, the proposed method never fail to converge throughout the numerical experiments. The output is based on number of iterations and CPU time, different initial starting points were used on a solve 40 benchmark test problems. With the aid of the squared norm merit function and derivative-free line search technique, the approach yield a method of solving symmetric systems of nonlinear equations that is capable of significantly reducing the CPU time and number of iteration, as compared to its counterparts. A comparison between the proposed method and classical DFP update were made and found that the proposed methodis the top performer and outperformed the existing method in almost all the cases. In terms of number of iterations, out of the 40 problems solved, the proposed method solved 38 successfully, (95%) while classical DFP solved 2 problems (i.e. 05%). In terms of CPU time, the proposed method solved 29 out of the 40 problems given, (i.e.72.5%) successfully whereas classical DFP solves 11 (27.5%). The method is valid in terms of derivation, reliable in terms of number of iterations and accurate in terms of CPU time. Thus, suitable and achived the objective.

Strengthening a Design for Evaluating a Broad-Aimed Functional Literacy and Family Life Education Program

ERIC Educational Resources Information Center

Farmer, James A., Jr.

1974-01-01

Techniques are illustrated in this article for strengthening evaluative designs and methodologies relevant to educational programs that incorporate within their broad aims assisting in social problem-solving. (AJ)

Buckling Of Shells Of Revolution /BOSOR/ with various wall constructions

NASA Technical Reports Server (NTRS)

Almroth, B. O.; Bushnell, D.; Sobel, L. H.

1969-01-01

Computer program, using numerical integration and finite difference techniques, solves almost any buckling problem for shells exhibiting orthotropic behavior. Stability analyses can be performed with reasonable accuracy and without unduly restrictive approximations.

Exploring Oil Pollution

ERIC Educational Resources Information Center

Rillo, Thomas J.

1974-01-01

Discusses damages of oil tanker spillage to the marine organisms and scientists' research in oil pollution removal techniques. Included is a list of learning activities concerning the causes and effects of oil pollution and methods of solving the problem. (CC)

Review on solving the forward problem in EEG source analysis

PubMed Central

Hallez, Hans; Vanrumste, Bart; Grech, Roberta; Muscat, Joseph; De Clercq, Wim; Vergult, Anneleen; D'Asseler, Yves; Camilleri, Kenneth P; Fabri, Simon G; Van Huffel, Sabine; Lemahieu, Ignace

2007-01-01

Background The aim of electroencephalogram (EEG) source localization is to find the brain areas responsible for EEG waves of interest. It consists of solving forward and inverse problems. The forward problem is solved by starting from a given electrical source and calculating the potentials at the electrodes. These evaluations are necessary to solve the inverse problem which is defined as finding brain sources which are responsible for the measured potentials at the EEG electrodes. Methods While other reviews give an extensive summary of the both forward and inverse problem, this review article focuses on different aspects of solving the forward problem and it is intended for newcomers in this research field. Results It starts with focusing on the generators of the EEG: the post-synaptic potentials in the apical dendrites of pyramidal neurons. These cells generate an extracellular current which can be modeled by Poisson's differential equation, and Neumann and Dirichlet boundary conditions. The compartments in which these currents flow can be anisotropic (e.g. skull and white matter). In a three-shell spherical head model an analytical expression exists to solve the forward problem. During the last two decades researchers have tried to solve Poisson's equation in a realistically shaped head model obtained from 3D medical images, which requires numerical methods. The following methods are compared with each other: the boundary element method (BEM), the finite element method (FEM) and the finite difference method (FDM). In the last two methods anisotropic conducting compartments can conveniently be introduced. Then the focus will be set on the use of reciprocity in EEG source localization. It is introduced to speed up the forward calculations which are here performed for each electrode position rather than for each dipole position. Solving Poisson's equation utilizing FEM and FDM corresponds to solving a large sparse linear system. Iterative methods are required to solve these sparse linear systems. The following iterative methods are discussed: successive over-relaxation, conjugate gradients method and algebraic multigrid method. Conclusion Solving the forward problem has been well documented in the past decades. In the past simplified spherical head models are used, whereas nowadays a combination of imaging modalities are used to accurately describe the geometry of the head model. Efforts have been done on realistically describing the shape of the head model, as well as the heterogenity of the tissue types and realistically determining the conductivity. However, the determination and validation of the in vivo conductivity values is still an important topic in this field. In addition, more studies have to be done on the influence of all the parameters of the head model and of the numerical techniques on the solution of the forward problem. PMID:18053144

Improvements in surface singularity analysis and design methods. [applicable to airfoils

NASA Technical Reports Server (NTRS)

Bristow, D. R.

1979-01-01

The coupling of the combined source vortex distribution of Green's potential flow function with contemporary numerical techniques is shown to provide accurate, efficient, and stable solutions to subsonic inviscid analysis and design problems for multi-element airfoils. The analysis problem is solved by direct calculation of the surface singularity distribution required to satisfy the flow tangency boundary condition. The design or inverse problem is solved by an iteration process. In this process, the geometry and the associated pressure distribution are iterated until the pressure distribution most nearly corresponding to the prescribed design distribution is obtained. Typically, five iteration cycles are required for convergence. A description of the analysis and design method is presented, along with supporting examples.

Methods for solving reasoning problems in abstract argumentation – A survey

PubMed Central

Charwat, Günther; Dvořák, Wolfgang; Gaggl, Sarah A.; Wallner, Johannes P.; Woltran, Stefan

2015-01-01

Within the last decade, abstract argumentation has emerged as a central field in Artificial Intelligence. Besides providing a core formalism for many advanced argumentation systems, abstract argumentation has also served to capture several non-monotonic logics and other AI related principles. Although the idea of abstract argumentation is appealingly simple, several reasoning problems in this formalism exhibit high computational complexity. This calls for advanced techniques when it comes to implementation issues, a challenge which has been recently faced from different angles. In this survey, we give an overview on different methods for solving reasoning problems in abstract argumentation and compare their particular features. Moreover, we highlight available state-of-the-art systems for abstract argumentation, which put these methods to practice. PMID:25737590

Obchs: AN Effective Harmony Search Algorithm with Oppositionbased Chaos-Enhanced Initialization for Solving Uncapacitated Facility Location Problems

NASA Astrophysics Data System (ADS)

Heidari, A. A.; Kazemizade, O.; Abbaspour, R. A.

2015-12-01

In this paper, a continuous harmony search (HS) approach is investigated for tackling the Uncapacitated Facility Location (UFL) task. This article proposes an efficient modified HS-based optimizer to improve the performance of HS on complex spatial tasks like UFL problems. For this aim, opposition-based learning (OBL) and chaotic patterns are utilized. The proposed technique is examined against several UFL benchmark challenges in specialized literature. Then, the modified HS is substantiated in detail and compared to the basic HS and some other methods. The results showed that new opposition-based chaotic HS (OBCHS) algorithm not only can exploit better solutions competently but it is able to outperform HS in solving UFL problems.

Inflationary dynamics for matrix eigenvalue problems

PubMed Central

Heller, Eric J.; Kaplan, Lev; Pollmann, Frank

2008-01-01

Many fields of science and engineering require finding eigenvalues and eigenvectors of large matrices. The solutions can represent oscillatory modes of a bridge, a violin, the disposition of electrons around an atom or molecule, the acoustic modes of a concert hall, or hundreds of other physical quantities. Often only the few eigenpairs with the lowest or highest frequency (extremal solutions) are needed. Methods that have been developed over the past 60 years to solve such problems include the Lanczos algorithm, Jacobi–Davidson techniques, and the conjugate gradient method. Here, we present a way to solve the extremal eigenvalue/eigenvector problem, turning it into a nonlinear classical mechanical system with a modified Lagrangian constraint. The constraint induces exponential inflationary growth of the desired extremal solutions. PMID:18511564

Solving and Learning Soft Temporal Constraints: Experimental Scenario and Examples

NASA Technical Reports Server (NTRS)

Rossi, F.; Venable, K. B.; Sperduti, A.; Khatib, L.; Morris, P.; Morris, R.; Koga, Dennis (Technical Monitor)

2001-01-01

Soft temporal constraint problems allow to describe in a natural way scenarios where events happen over time and preferences are associated to event distances and durations. However, sometimes such local preferences are difficult to set, and it may be easier instead to associate preferences to some complete solutions of the problem. To model everything in a uniform way via local preferences only, and also to take advantage of the existing constraint solvers which exploit only local preference use machine learning techniques which learn the local preferences from the global ones. In this paper we describe the existing framework for both solving and learning preferences in temporal constraint problems, the implemented modules, the experimental scenario, and preliminary results on some examples.

A fast immersed boundary method for external incompressible viscous flows using lattice Green's functions

NASA Astrophysics Data System (ADS)

Liska, Sebastian; Colonius, Tim

2017-02-01

A new parallel, computationally efficient immersed boundary method for solving three-dimensional, viscous, incompressible flows on unbounded domains is presented. Immersed surfaces with prescribed motions are generated using the interpolation and regularization operators obtained from the discrete delta function approach of the original (Peskin's) immersed boundary method. Unlike Peskin's method, boundary forces are regarded as Lagrange multipliers that are used to satisfy the no-slip condition. The incompressible Navier-Stokes equations are discretized on an unbounded staggered Cartesian grid and are solved in a finite number of operations using lattice Green's function techniques. These techniques are used to automatically enforce the natural free-space boundary conditions and to implement a novel block-wise adaptive grid that significantly reduces the run-time cost of solutions by limiting operations to grid cells in the immediate vicinity and near-wake region of the immersed surface. These techniques also enable the construction of practical discrete viscous integrating factors that are used in combination with specialized half-explicit Runge-Kutta schemes to accurately and efficiently solve the differential algebraic equations describing the discrete momentum equation, incompressibility constraint, and no-slip constraint. Linear systems of equations resulting from the time integration scheme are efficiently solved using an approximation-free nested projection technique. The algebraic properties of the discrete operators are used to reduce projection steps to simple discrete elliptic problems, e.g. discrete Poisson problems, that are compatible with recent parallel fast multipole methods for difference equations. Numerical experiments on low-aspect-ratio flat plates and spheres at Reynolds numbers up to 3700 are used to verify the accuracy and physical fidelity of the formulation.

Interaction Networks: Generating High Level Hints Based on Network Community Clustering

ERIC Educational Resources Information Center

Eagle, Michael; Johnson, Matthew; Barnes, Tiffany

2012-01-01

We introduce a novel data structure, the Interaction Network, for representing interaction-data from open problem solving environment tutors. We show how using network community detecting techniques are used to identify sub-goals in problems in a logic tutor. We then use those community structures to generate high level hints between sub-goals.…

An implicit semianalytic numerical method for the solution of nonequilibrium chemistry problems

NASA Technical Reports Server (NTRS)

Graves, R. A., Jr.; Gnoffo, P. A.; Boughner, R. E.

1974-01-01

The first order differential equation form systems of equations. They are solved by a simple and relatively accurate implicit semianalytic technique which is derived from a quadrature solution of the governing equation. This method is mathematically simpler than most implicit methods and has the exponential nature of the problem embedded in the solution.

Factors Affecting Police Officers' Acceptance of GIS Technologies: A Study of the Turkish National Police

ERIC Educational Resources Information Center

Cakar, Bekir

2011-01-01

The situations and problems that police officers face are more complex in today's society, due in part to the increase of technology and growing complexity of globalization. Accordingly, to solve these problems and deal with the complexities, law enforcement organizations develop and apply new techniques and methods such as geographic information…

Special Relativity as a Simple Geometry Problem

ERIC Educational Resources Information Center

de Abreu, Rodrigo; Guerra, Vasco

2009-01-01

The null result of the Michelson-Morley experiment and the constancy of the one-way speed of light in the "rest system" are used to formulate a simple problem, to be solved by elementary geometry techniques using a pair of compasses and non-graduated rulers. The solution consists of a drawing allowing a direct visualization of all the fundamental…

Artificial intelligence within the chemical laboratory.

PubMed

Winkel, P

1994-01-01

Various techniques within the area of artificial intelligence such as expert systems and neural networks may play a role during the problem-solving processes within the clinical biochemical laboratory. Neural network analysis provides a non-algorithmic approach to information processing, which results in the ability of the computer to form associations and to recognize patterns or classes among data. It belongs to the machine learning techniques which also include probabilistic techniques such as discriminant function analysis and logistic regression and information theoretical techniques. These techniques may be used to extract knowledge from example patients to optimize decision limits and identify clinically important laboratory quantities. An expert system may be defined as a computer program that can give advice in a well-defined area of expertise and is able to explain its reasoning. Declarative knowledge consists of statements about logical or empirical relationships between things. Expert systems typically separate declarative knowledge residing in a knowledge base from the inference engine: an algorithm that dynamically directs and controls the system when it searches its knowledge base. A tool is an expert system without a knowledge base. The developer of an expert system uses a tool by entering knowledge into the system. Many, if not the majority of problems encountered at the laboratory level are procedural. A problem is procedural if it is possible to write up a step-by-step description of the expert's work or if it can be represented by a decision tree. To solve problems of this type only small expert system tools and/or conventional programming are required.(ABSTRACT TRUNCATED AT 250 WORDS)

Numerical methods in Markov chain modeling

NASA Technical Reports Server (NTRS)

Philippe, Bernard; Saad, Youcef; Stewart, William J.

1989-01-01

Several methods for computing stationary probability distributions of Markov chains are described and compared. The main linear algebra problem consists of computing an eigenvector of a sparse, usually nonsymmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous singular linear system. Several methods based on combinations of Krylov subspace techniques are presented. The performance of these methods on some realistic problems are compared.

On the reliable and flexible solution of practical subset regression problems

NASA Technical Reports Server (NTRS)

Verhaegen, M. H.

1987-01-01

A new algorithm for solving subset regression problems is described. The algorithm performs a QR decomposition with a new column-pivoting strategy, which permits subset selection directly from the originally defined regression parameters. This, in combination with a number of extensions of the new technique, makes the method a very flexible tool for analyzing subset regression problems in which the parameters have a physical meaning.

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

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

Analysis of problem solving on project based learning with resource based learning approach computer-aided program

NASA Astrophysics Data System (ADS)

Kuncoro, K. S.; Junaedi, I.; Dwijanto

2018-03-01

This study aimed to reveal the effectiveness of Project Based Learning with Resource Based Learning approach computer-aided program and analyzed problem-solving abilities in terms of problem-solving steps based on Polya stages. The research method used was mixed method with sequential explanatory design. The subject of this research was the students of math semester 4. The results showed that the S-TPS (Strong Top Problem Solving) and W-TPS (Weak Top Problem Solving) had good problem-solving abilities in each problem-solving indicator. The problem-solving ability of S-MPS (Strong Middle Problem Solving) and (Weak Middle Problem Solving) in each indicator was good. The subject of S-BPS (Strong Bottom Problem Solving) had a difficulty in solving the problem with computer program, less precise in writing the final conclusion and could not reflect the problem-solving process using Polya’s step. While the Subject of W-BPS (Weak Bottom Problem Solving) had not been able to meet almost all the indicators of problem-solving. The subject of W-BPS could not precisely made the initial table of completion so that the completion phase with Polya’s step was constrained.

The Circle of Apollonius and Its Applications in Introductory Physics

NASA Astrophysics Data System (ADS)

Partensky, Michael B.

2008-02-01

The circle of Apollonius is named after the ancient geometrician Apollonius of Perga. This beautiful geometric construct can be helpful when solving some general problems of geometry and mathematical physics, optics, and electricity. Here we discuss two of its applications: localizing an object in space and calculating electric fields. First, we pose an entertaining localization problem to trigger students' interest in the subject. Analyzing this problem, we introduce the circle of Apollonius and show that this geometric technique helps solve the problem in an elegant and intuitive manner. Then we switch to seemingly unrelated problems of calculating the electric fields. We show that the zero equipotential line for two unlike charges is the Apollonius circle for these two charges and use this discovery to find the electric field of a charge positioned near a grounded conductive sphere. Finally, we pose some questions for further examination.

Cognitive Mapping Techniques: Implications for Research in Engineering and Technology Education

ERIC Educational Resources Information Center

Dixon, Raymond A.; Lammi, Matthew

2014-01-01

The primary goal of this paper is to present the theoretical basis and application of two types of cognitive maps, concept map and mind map, and explain how they can be used by educational researchers in engineering design research. Cognitive mapping techniques can be useful to researchers as they study students' problem solving strategies…

Application of Guided Inquiry System Technique (GIST) to Controlled Ecological Life Support Systems (CELSS)

NASA Technical Reports Server (NTRS)

Aroeste, H.

1982-01-01

Guided Inquiry System Technique, a global approach to problem solving, was applied to the subject of Controlled Ecological Life Support Systems (CELSS). Nutrition, food processing, and the use of higher plants in a CELSS were considered by a panel of experts. Specific ideas and recommendations gleaned from discussions with panel members are presented.

Graphical models for optimal power flow

DOE PAGES

Dvijotham, Krishnamurthy; Chertkov, Michael; Van Hentenryck, Pascal; ...

2016-09-13

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithmmore » for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for “smart grid” applications like control of distributed energy resources. In conclusion, numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.« less