Solving Sudoku with Constraint Programming
Crawford, Broderick; Castro, Carlos; Monfroy, Eric
Constraint Programming (CP) is a powerful paradigm for modeling and solving Complex Combinatorial Problems (generally issued from Decision Making). In this work, we model the known Sudoku puzzle as a Constraint Satisfaction Problems and solve it with CP comparing the performance of different Variable and Value Selection Heuristics in its Enumeration phase. We encourage this kind of benchmark problem because it may suggest new techniques in constraint modeling and solving of complex systems, or aid the understanding of its main advantages and limits.
Solving Linear Fractional Multilevel Programs
Directory of Open Access Journals (Sweden)
Shifali Bhargava
2014-01-01
Full Text Available The linear fractional multilevel programming (LFMP problem has been studied and it has been proved that an optimal solution to this problem occurs at a boundary feasible extreme point. Hence the Kth-best algorithm can be proposed to solve the problem. This property can be applied to quasiconcave multilevel problems provided that the first (n - 1 level objective functions are explicitly quasimonotonic, otherwise it cannot be proved that there exists a boundary feasible extreme point that solves the LFMP problem. (original abstract
Photovoltaic Program Branch annual report, FY 1989
Energy Technology Data Exchange (ETDEWEB)
Summers, K A [ed.
1990-03-01
This report summarizes the progress of the Photovoltaic (PV) Program Branch of the Solar Energy Research Institute (SERI) from October 1, 1988, through September 30, 1989. The branch is responsible for managing the subcontracted portion of SERI's PV Advanced Research and Development Project. In fiscal year (FY) 1989, this included nearly 50 subcontracts, with a total annualized funding of approximately $13.1 million. Approximately two-thirds of the subcontracts were with universities, at a total funding of nearly $4 million. The six technical sections of the report cover the main areas of the subcontracted program: Amorphous Silicon Research, Polycrystalline Thin Films, Crystalline Silicon Materials Research, High-Efficiency Concepts, New Ideas, and University Participation. Technical summaries of each of the subcontracted programs provide a discussion of approaches, major accomplishments in FY 1989, and future research directions. Each report will be cataloged individually.
A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem
Directory of Open Access Journals (Sweden)
Lin-Peng Yang
2014-01-01
Full Text Available This paper presents a global optimization algorithm for solving globally the generalized nonlinear multiplicative programming (MP with a nonconvex constraint set. The algorithm uses a branch and bound scheme based on an equivalently reverse convex programming problem. As a result, in the computation procedure the main work is solving a series of linear programs that do not grow in size from iterations to iterations. Further several key strategies are proposed to enhance solution production, and some of them can be used to solve a general reverse convex programming problem. Numerical results show that the computational efficiency is improved obviously by using these strategies.
Saad, Shakila; Wan Jaafar, Wan Nurhadani; Jamil, Siti Jasmida
2013-04-01
The standard Traveling Salesman Problem (TSP) is the classical Traveling Salesman Problem (TSP) while Multiple Traveling Salesman Problem (MTSP) is an extension of TSP when more than one salesman is involved. The objective of MTSP is to find the least costly route that the traveling salesman problem can take if he wishes to visit exactly once each of a list of n cities and then return back to the home city. There are a few methods that can be used to solve MTSP. The objective of this research is to implement an exact method called Branch-and-Bound (B&B) algorithm. Briefly, the idea of B&B algorithm is to start with the associated Assignment Problem (AP). A branching strategy will be applied to the TSP and MTSP which is Breadth-first-Search (BFS). 11 nodes of cities are implemented for both problem and the solutions to the problem are presented.
Programming languages for business problem solving
Wang, Shouhong
2007-01-01
It has become crucial for managers to be computer literate in today's business environment. It is also important that those entering the field acquire the fundamental theories of information systems, the essential practical skills in computer applications, and the desire for life-long learning in information technology. Programming Languages for Business Problem Solving presents a working knowledge of the major programming languages, including COBOL, C++, Java, HTML, JavaScript, VB.NET, VBA, ASP.NET, Perl, PHP, XML, and SQL, used in the current business computing environment. The book examin
Fuzzy linear programming approach for solving transportation ...
Indian Academy of Sciences (India)
ALI EBRAHIMNEJAD
DEFINITION 2.3 ([28]). Let ˜AL ∈ FT N (wL) and ˜AU ∈ FT N (wU ). A level (wL, wU )- interval-valued trapezoidal fuzzy number ˜˜A, denoted by ˜˜A = [. ˜AL, ˜AU. ] = 〈. (aL ...... Appl. Math. Sci. 4(2): 79–90. [14] Kumar A and Kaur A 2010 Application of linear program- ming for solving fuzzy transportation problems. J. Appl. Math.
On Computational Power of Quantum Read-Once Branching Programs
Directory of Open Access Journals (Sweden)
Farid Ablayev
2011-03-01
Full Text Available In this paper we review our current results concerning the computational power of quantum read-once branching programs. First of all, based on the circuit presentation of quantum branching programs and our variant of quantum fingerprinting technique, we show that any Boolean function with linear polynomial presentation can be computed by a quantum read-once branching program using a relatively small (usually logarithmic in the size of input number of qubits. Then we show that the described class of Boolean functions is closed under the polynomial projections.
A BASIC Programming Curriculum for Enhancing Problem-Solving Ability.
Overbaugh, Richard C.
This curriculum is proposed to enhance problem-solving ability through learning to program in BASIC. Current research shows development of problem-solving skills from learning to program in BASIC. Successful treatments have been based on contemporary problem-solving theory, top-down, modular programing, and rigorous length and intensity. The…
Teaching model of problem solving Programming Fundamentals
Directory of Open Access Journals (Sweden)
Iván Darwin Tutillo-Arcentales
2016-10-01
Full Text Available The formation process has been studied by several authors in those last years, although not always focusing in the technology careers which requires of a pedagogical and didactic point of view, which promotes behaviouring changes in the teachers with impact in the quality of graduates. The purposes of this paper is: to value the pedagogical fundamentals of the formation in the career Analysis of systems,in order to promote qualitative and quantitative improvements in the students learning. The questioner applied to students and teachers proved the difficulties in the contents related to the algorithmic procedures, which constitutes a necessary content in their formation and to them contributes other syllabus of the first level. So it is necessary to model a theoretical construction which express the new relationships established from the psychological and didactic point of view in order to solving those situations from the programing.
Solving Quadratic Assignment Problem with Fixed Assignment (QAPFA) using Branch and Bound Approach
Shuthairah Syed-Abdullah, Sharifah; Abdul-Rahman, Syariza; Mauziah Benjamin, Aida; Wibowo, Antoni; Ku-Mahamud, Ku-Ruhana
2018-01-01
Quadratic Assignment Problem (QAP) has been a very popular problem to be solved among researchers due to its practical applications. Several variants of QAP have been proposed by researchers in the past in order to reflect the real situations of QAP. One of the real problems of QAP is related with facilities which are required to be assigned to certain locations due to its function. In solving this problem, a fixed assignment has to be made thus allowing for the complexity of the problem to be reduced. Hence, this study introduces Quadratic Assignment Problem with Fixed Assignment (QAPFA) with the objective to minimize the assignment cost between the facility and location. This assignment takes into account the flow and distance between facility and location. QAPFA represents the real-world situation of the problem especially in dealing with specific requirement of some facilities to specific locations. Dataset of QAPFA is introduced and is solved using branch and bound approach. As for validation, the results of QAPFA are compared with QAP in terms of objective function and running time. The computational results show that the solution quality of QAPFA is lower when compared with the QAP, while the running time for QAPFA is lower than the QAP. Since the complexity of the problem is reduced by fixing the assignment, thus there is possibility that QAPFA has lower quality than QAP due to the fixed assignment. Nevertheless, in terms of running time QAPFA is better than QAP. It can be concluded that this problem reflect the real problem and practical to be used.
The Coin Problem and Pseudorandomness for Branching Programs
DEFF Research Database (Denmark)
Brody, Joshua; Verbin, Elad
2010-01-01
be distinguished by small-width read-once branching programs. We suggest one application for this kind of theorems: we prove that Nisan's Generator fools width-$w$ read-once emph{regular} branching programs, using seed length $O(w^4 log n log log n + log n log (1/eps))$. For $w=eps=Theta(1)$, this seed length...... is $O(log n log log n)$. The coin theorem and its relatives might have other connections to PRGs. This application is related to the independent, but chronologically-earlier, work of Braver man, Rao, Raz and Yehudayoff~cite{BRRY}....
Agriculture and Food Processes Branch program summary document
Energy Technology Data Exchange (ETDEWEB)
None
1980-06-01
The work of the Agriculture and Food Processes Branch within the US DOE's Office of Industrial Programs is discussed and reviewed. The Branch is responsible for assisting the food and agricultural sectors of the economy in increasing their energy efficiency by cost sharing with industry the development and demonstration of technologies industry by itself would not develop because of a greater than normal risk factor, but have significant energy conservation benefits. This task is made more difficult by the diversity of agriculture and the food industry. The focus of the program is now on the development and demonstration of energy conservation technology in high energy use industry sectors and agricultural functions (e.g., sugar processing, meat processing, irrigation, and crop drying, high energy use functions common to many sectors of the food industry (e.g., refrigeration, drying, and evaporation), and innovative concepts (e.g., energy integrated farm systems. Specific projects within the program are summarized. (LCL)
An approach for solving linear fractional programming problems ...
African Journals Online (AJOL)
The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebraically using the concept of duality ...
Primal-Dual Method of Solving Convex Quadratic Programming Problems
Directory of Open Access Journals (Sweden)
V. Moraru
2000-10-01
Full Text Available This paper presents a primal-dual method for solving quadratic programming problems. The method is based on finding an exact solution of a finite sequence of unconstrained quadratic prigraamming problems and on finding an aproximative solution of constrained minimization problem with simple constraints. The subproblem with simple constraints is solved by the interior-reflective Newton's method [6].
The Environmental Justice Collaborative Problem-Solving Cooperative Agreement Program
The Environmental Justice Collaborative Problem-Solving (CPS) Cooperative Agreement Program provides financial assistance to eligible organizations working on or planning to work on projects to address local environmental and/or public health issues
Fuzzy linear programming approach for solving transportation ...
Indian Academy of Sciences (India)
Transportation problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at ...
Evaluating fuzzy inequalities and solving fully fuzzified linear fractional programs
Directory of Open Access Journals (Sweden)
Stanojević B.
2012-01-01
Full Text Available In our earlier articles, we proposed two methods for solving the fully fuzzified linear fractional programming (FFLFP problems. In this paper, we introduce a different approach of evaluating fuzzy inequalities between two triangular fuzzy numbers and solving FFLFP problems. First, using the Charnes-Cooper method, we transform the linear fractional programming problem into a linear one. Second, the problem of maximizing a function with triangular fuzzy value is transformed into a problem of deterministic multiple objective linear programming. Illustrative numerical examples are given to clarify the developed theory and the proposed algorithm.
Planning under uncertainty solving large-scale stochastic linear programs
Energy Technology Data Exchange (ETDEWEB)
Infanger, G. [Stanford Univ., CA (United States). Dept. of Operations Research]|[Technische Univ., Vienna (Austria). Inst. fuer Energiewirtschaft
1992-12-01
For many practical problems, solutions obtained from deterministic models are unsatisfactory because they fail to hedge against certain contingencies that may occur in the future. Stochastic models address this shortcoming, but up to recently seemed to be intractable due to their size. Recent advances both in solution algorithms and in computer technology now allow us to solve important and general classes of practical stochastic problems. We show how large-scale stochastic linear programs can be efficiently solved by combining classical decomposition and Monte Carlo (importance) sampling techniques. We discuss the methodology for solving two-stage stochastic linear programs with recourse, present numerical results of large problems with numerous stochastic parameters, show how to efficiently implement the methodology on a parallel multi-computer and derive the theory for solving a general class of multi-stage problems with dependency of the stochastic parameters within a stage and between different stages.
Developing a complex endovascular fenestrated and branched aortic program.
Schanzer, Andres; Baril, Donald; Robinson, William P; Simons, Jessica P; Aiello, Francesco A; Messina, Louis M
2015-03-01
In 2008, the top priority in our division's 5-year strategic plan was "to become an internationally recognized center of excellence for the endovascular treatment of complex aortic pathology extending from the aortic valve to the external iliac artery." Five components were identified as "most critical" to achieve this strategic priority: (1) training at centers of excellence in complex endovascular repair; (2) industry partnership to improve access to developing technologies; (3) a fully integrated team approach with one leader involved in all steps of all cases; (4) prospective data collection; and (5) development and implementation of a physician-sponsored investigational device exemption for juxtarenal, pararenal, and thoracoabdominal aneurysms. We have now performed 49 repairs (16 commercially manufactured devices, 33 physician-modified devices) for 3 common iliac, 20 juxtarenal, 9 pararenal, and 17 thoracoabdominal aneurysms, using 142 fenestrations, branches, and scallops. All patients had complete 30-day follow-up for calculation of 30-day events. Kaplan-Meier analysis was used to calculate 1-year events. In 5 years, we developed a successful complex endovascular aortic program that uses fenestrated/branched repair techniques. A focused team strategic planning approach to program development is an effective way for vascular surgery divisions to gain experience and expertise with new complex technologies while ensuring acceptable patient outcomes. Copyright © 2015 Society for Vascular Surgery. Published by Elsevier Inc. All rights reserved.
DEFF Research Database (Denmark)
Robenek, Tomáš; Umang, Nitish; Bierlaire, Michel
2014-01-01
the integrated problem. In the proposed model, the master problem is formulated as a set-partitioning problem, and subproblems to identify columns with negative reduced costs are solved using mixed integer programming. To obtain sub-optimal solutions quickly, a metaheuristic approach based on critical...
Hayel Al-Srour, Nadia; Al-Ali, Safa M.; Al-Oweidi, Alia
2016-01-01
The present study aims to detect the impact of teacher training on creative writing and problem-solving using both Futuristic scenarios program to solve problems creatively, and creative problem solving. To achieve the objectives of the study, the sample was divided into two groups, the first consist of 20 teachers, and 23 teachers to second…
Solving the Programmed/ Non-Programmed Aging Conundrum.
Goldsmith, Theodore C
2015-04-21
For more than 150 years there has been some level of scientific argument regarding whether aging in humans and other mammals is purposely genetically programmed because living too long produces an evolutionary disadvantage, or whether aging in mammals is non-programmed because there is no such disadvantage. Although for many decades it was very widely thought that programmed aging in mammals was theoretically impossible, new evolutionary mechanics theories and new discoveries support programmed mammal aging as well as programmed lifespan limitation in non-mammals. The emergence of modern programmed aging theories has created a schism in the bioscience community regarding the programmed/ non-programmed issue. Because the two theories have radically different predictions regarding the fundamental nature of aging and consequently the nature of highly age-related diseases like cancer, stroke, and heart disease, resolving this issue is critical to medical research. This article summarizes the evolutionary mechanics basis of modern programmed and non-programmed aging theories, describes some of the many ancillary circumstances that continue to prevent resolution of this issue, and recommends steps that could be taken to rapidly resolve the programmed/ non-programmed conundrum.
A new algorithm for solving linear programming problems
Directory of Open Access Journals (Sweden)
Andrés Leonardo Ramírez Leal
2012-08-01
Full Text Available Linear programming (LP is one of the most widely-applied techniques in operations research. Many methods have been developed and several others are being proposed for solving LP problems, including the famous simplex method and interior point algorithms. This study was aimed at introducing a new method for solving LP problems. The proposed algorithm starts from an interior point and then carries out orthogonal projections using parametric straight lines to move between the interior and polyhedron frontier defining the feasible region until reaching the extreme optimal point.
A Branch-and-Bound Algorithm Embedded with DCA for DC Programming
Directory of Open Access Journals (Sweden)
Meihua Wang
2012-01-01
Full Text Available The special importance of Difference of Convex (DC functions programming has been recognized in recent studies on nonconvex optimization problems. In this work, a class of DC programming derived from the portfolio selection problems is studied. The most popular method applied to solve the problem is the Branch-and-Bound (B&B algorithm. However, “the curse of dimensionality” will affect the performance of the B&B algorithm. DC Algorithm (DCA is an efficient method to get a local optimal solution. It has been applied to many practical problems, especially for large-scale problems. A B&B-DCA algorithm is proposed by embedding DCA into the B&B algorithms, the new algorithm improves the computational performance and obtains a global optimal solution. Computational results show that the proposed B&B-DCA algorithm has the superiority of the branch number and computational time than general B&B. The nice features of DCA (inexpensiveness, reliability, robustness, globality of computed solutions, etc. provide crucial support to the combined B&B-DCA for accelerating the convergence of B&B.
Quasi-Newton Methods for Solving Nonlinear Programming Problems
Directory of Open Access Journals (Sweden)
V.Moraru
1996-03-01
Full Text Available In the present paper the problem of constrained equality optimization is reduced to sequential solving a series of problems of quadratic programming. The Hessian of the Lagrangian is approximated by a sequence of symmetric positive definite matrices. The matrix approximation is updated at every iteration by a Gram- Schmidt modified algorithm. We establish that methods is locally convergent and the sequence {xk}converges to the solution a two-step superlinear rate.
Constraint Programming to Solve Maximal Density Still Life
Chu, Geoffrey; Petrie, Karen Elizabeth; Yorke-Smith, Neil
The Maximum Density Still Life problem fills a finite Game of Life board with a stable pattern of cells that has as many live cells as possible. Although simple to state, this problem is computationally challenging for any but the smallest sizes of board. Especially difficult is to prove that the maximum number of live cells has been found. Various approaches have been employed. The most successful are approaches based on Constraint Programming (CP). We describe the Maximum Density Still Life problem, introduce the concept of constraint programming, give an overview on how the problem can be modelled and solved with CP, and report on best-known results for the problem.
Solving Fractional Programming Problems based on Swarm Intelligence
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.
Third annual Walker Branch Watershed research symposium. Program and abstracts
Energy Technology Data Exchange (ETDEWEB)
1992-03-01
The methods and concepts of watershed research, originally applied in an experimental or monitoring mode to relatively small catchments, are increasingly being used at larger scales and for specific applied problems. Research at Oak Ridge National Laboratory, the Tennessee Valley Authority, the US Forest Service, and other agencies and institutions participating in this symposium reflects research over a broad range of spatial scales that is being integrated through large-scale experiments along with computer modeling and graphical interfaces. These research projects address the basic atmospheric, geophysical, biogeochemical, and biological processes that regulate the responses of forested ecosystems to natural environmental variation and anthropogenic stresses. Regional and global issues addressed by presentations include emissions of carbon dioxide, methane, and other hydrocarbons; deposition of sulfate, nitrate, and mercury; land-use changes; biological diversity; droughts; and water quality. The reports presented in this symposium illustrate a wide range of methods and approaches and focus more on concepts and techniques than on a specific physical site. Sites and projects that have contributed research results to this symposium include Walker Branch Watershed (DOE), the Coweeta Hydrologic Laboratory and LTER site (USFS and NSF), Great Smoky Mountains National Park (research funded by NPS, TVA, and EPRI), Imnavait Creek, Alaska (DOE), the TVA-Norris Whole-tree Facility (TVA and EPRI), and DOE`s Biomass Program.
EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report.
Jarvis, John J.; And Others
Designed for student use in solving linear programming problems, the interactive computer program described (EZLP) permits the student to input the linear programming model in exactly the same manner in which it would be written on paper. This report includes a brief review of the development of EZLP; narrative descriptions of program features,…
Solving cyclical nurse scheduling problem using preemptive goal programming
Sundari, V. E.; Mardiyati, S.
2017-07-01
Nurse scheduling system in a hospital is being modeled as a preemptive goal programming problem that is solved by using LINGO software with the objective function to minimize deviation variable at each goal. The scheduling is done cyclically, so every nurse is treated fairly since they have the same work shift portion with the other nurses. By paying attention to the hospital's rules regarding nursing work shift cyclically, it can be obtained that numbers of nurse needed in every ward are 18 nurses and the numbers of scheduling periods are 18 periods where every period consists of 21 days.
A recurrent neural network for solving bilevel linear programming problem.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian
2014-04-01
In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.
Boolean Variables in Economic Models Solved by Linear Programming
Directory of Open Access Journals (Sweden)
Lixandroiu D.
2014-12-01
Full Text Available The article analyses the use of logical variables in economic models solved by linear programming. Focus is given to the presentation of the way logical constraints are obtained and of the definition rules based on predicate logic. Emphasis is also put on the possibility to use logical variables in constructing a linear objective function on intervals. Such functions are encountered when costs or unitary receipts are different on disjunct intervals of production volumes achieved or sold. Other uses of Boolean variables are connected to constraint systems with conditions and the case of a variable which takes values from a finite set of integers.
Neural network for solving convex quadratic bilevel programming problems.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie
2014-03-01
In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.
Shen, Peiping; Zhang, Tongli; Wang, Chunfeng
2017-01-01
This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve this problem, the algorithm solves an equivalent optimization problem (Q) via an exploration of a suitably defined nonuniform grid. The main work of the algorithm involves checking the feasibility of linear programs associated with the interesting grid points. It is proved that the proposed algorithm is a fully polynomial time approximation scheme as the ratio terms are fixed in the objective function to problem (P), based on the computational complexity result. In contrast to existing results in literature, the algorithm does not require the assumptions on quasi-concavity or low-rank of the objective function to problem (P). Numerical results are given to illustrate the feasibility and effectiveness of the proposed algorithm.
A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs
DEFF Research Database (Denmark)
Stidsen, Thomas Riis; Andersen, Kim Allan; Dammann, Bernd
2014-01-01
Most real-world optimization problems are multiobjective by nature, involving noncomparable objectives. Many of these problems can be formulated in terms of a set of linear objective functions that should be simultaneously optimized over a class of linear constraints. Often there is the complicat......Most real-world optimization problems are multiobjective by nature, involving noncomparable objectives. Many of these problems can be formulated in terms of a set of linear objective functions that should be simultaneously optimized over a class of linear constraints. Often...... Pareto-optimal front). In this paper, we first give a survey of the newly developed branch and bound methods for solving MOMIP problems. After that, we propose a new branch and bound method for solving a subclass of MOMIP problems, where only two objectives are allowed, the integer variables are binary...
Restricted dynamic programming: A flexible framework for solving realistic VRP's.
Gromicho, J.; van Hoorn, J.J.; Kok, A.L.; Schutten, Johannes M.J.
2012-01-01
Most solution methods for solving large vehicle routing and scheduling problems are based on local search. A drawback of these approaches is that they are designed and optimized for specific types of vehicle routing problems (VRPs). As a consequence, it is hard to adapt these solution methods to
Restricted dynamic programming: a flexible framework for solving realistic VRPs
Gromicho, J.; van Hoorn, J.J.; Kok, A.L.; Schutten, Johannes M.J.
2009-01-01
Most solution methods for solving large vehicle routing and schedu- ling problems are based on local search. A drawback of these ap- proaches is that they are designed and optimized for specific types of vehicle routing problems (VRPs). As a consequence, it is hard to adapt these solution methods to
Restricted dynamic programming: a flexible framework for solving realistic VRPs
Gromicho Dos Santos, J.A.; van Hoorn, J.J.; Kok, A.L.; Schutten, J.M.J.
2012-01-01
Most successful solution methods for solving large vehicle routing and scheduling problems are based on local search. These approaches are designed and optimized for specific types of vehicle routing problems (VRPs). VRPs appearing in practice typically accommodate restrictions that are not
A Decision Support System for Solving Linear Programming Problems
Nikolaos Ploskas; Nikolaos Samaras; Jason Papathanasiou
2014-01-01
Linear programming algorithms have been widely used in Decision Support Systems. These systems have incorporated linear programming algorithms for the solution of the given problems. Yet, the special structure of each linear problem may take advantage of different linear programming algorithms or different techniques used in these algorithms. This paper proposes a web-based DSS that assists decision makers in the solution of linear programming problems with a variety of linear programming alg...
Approximate Dynamic Programming Solving the Curses of Dimensionality
Powell, Warren B
2011-01-01
Praise for the First Edition "Finally, a book devoted to dynamic programming and written using the language of operations research (OR)! This beautiful book fills a gap in the libraries of OR specialists and practitioners."-Computing Reviews This new edition showcases a focus on modeling and computation for complex classes of approximate dynamic programming problems Understanding approximate dynamic programming (ADP) is vital in order to develop practical and high-quality solutions to complex industrial problems, particularly when those problems involve making decisions in the presence of unce
Bandele, Samuel Oye; Adekunle, Adeyemi Suraju
2015-01-01
The study was conducted to design, develop and test a c++ application program CAP-QUAD for solving quadratic equation in elementary school in Nigeria. The package was developed in c++ using object-oriented programming language, other computer program that were also utilized during the development process is DevC++ compiler, it was used for…
How Does Early Feedback in an Online Programming Course Change Problem Solving?
Ebrahimi, Alireza
2012-01-01
How does early feedback change the programming problem solving in an online environment and help students choose correct approaches? This study was conducted in a sample of students learning programming in an online course entitled Introduction to C++ and OOP (Object Oriented Programming) using the ANGEL learning management system platform. My…
A new neural network model for solving random interval linear programming problems.
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.
Reconstructing Program Theories : Methods Available and Problems to be Solved
Leeuw, Frans de
2003-01-01
This paper discusses methods for reconstructing theories underlying programs and policies. It describes three approaches. One is empirical–analytical in nature and focuses on interviews, documents and argumentational analysis. The second has strategic assessment, group dynamics, and dialogue as its
Dijkstra's interpretation of the approach to solving a problem of program correctness
Directory of Open Access Journals (Sweden)
Markoski Branko
2010-01-01
Full Text Available Proving the program correctness and designing the correct programs are two connected theoretical problems, which are of great practical importance. The first is solved within program analysis, and the second one in program synthesis, although intertwining of these two processes is often due to connection between the analysis and synthesis of programs. Nevertheless, having in mind the automated methods of proving correctness and methods of automatic program synthesis, the difference is easy to tell. This paper presents denotative interpretation of programming calculation explaining semantics by formulae φ and ψ, in such a way that they can be used for defining state sets for program P.
Approximate dynamic programming solving the curses of dimensionality
Powell, Warren B
2007-01-01
Warren B. Powell, PhD, is Professor of Operations Research and Financial Engineering at Princeton University, where he is founder and Director of CASTLE Laboratory, a research unit that works with industrial partners to test new ideas found in operations research. The recipient of the 2004 INFORMS Fellow Award, Dr. Powell has authored over 100 refereed publications on stochastic optimization, approximate dynamic programming, and dynamic resource management.
On Solving Linear Complementarity Problems as Linear Programs.
1976-03-01
I,1 c, -, I - - -= 1. I NIRODU CIT I ON Et is a fair’ly well-known fa(t that if a lineas complemenl•arity problem has L solution) then it has a...W. Cottle, "Manifestations of the Schur complement," Linear Algebra and Its Applications, 8 (1974), 189-211. [6] R. W. Cottle and G. B. Dantzig...34Complementarity pivot theory of mathematical programming," Linear Algebra and Its Applications . (1968), 103-125. [7] R. W. Cottle, G. H. Golub and R. S
Developing a pedagogical problem solving view for mathematics teachers with two reflection programs
Directory of Open Access Journals (Sweden)
Bracha Karamarski
2009-10-01
Full Text Available The study investigated the effects of two reflection support programs on elementary school mathematics teachers’ pedagogical problem solving view. Sixty-two teachers participated in a professional development program. Thirty teachers were assigned to the self-questioning (S_Q training and thirty two teachers were assigned to the reflection discourse (R_D training. The S_Q program was based on the IMPROVE self-questioning approach which emphasizes systematic discussion along the phases of mathematical or pedagogical problem solving as student and teacher. The R_D program emphasized discussion of standard based teaching and learning principles. Findings indicated that systematic reflection support (S_Q is effective for developing mathematics PCK, and strengthening metacognitive knowledge of mathematics teachers, more than reflection discourse (R_D. No differences were found between the groups in developing beliefs about teaching mathematics in using problem solving view.
Directory of Open Access Journals (Sweden)
Renata Melo e Silva de Oliveira
2015-03-01
Full Text Available Scheduling is a key factor for operations management as well as for business success. From industrial Job-shop Scheduling problems (JSSP, many optimization challenges have emerged since de 1960s when improvements have been continuously required such as bottlenecks allocation, lead-time reductions and reducing response time to requests. With this in perspective, this work aims to discuss 3 different optimization models for minimizing Makespan. Those 3 models were applied on 17 classical problems of examples JSSP and produced different outputs. The first model resorts on Mixed and Integer Programming (MIP and it resulted on optimizing 60% of the studied problems. The other models were based on Constraint Programming (CP and approached the problem in two different ways: a model CP1 is a standard IBM algorithm whereof restrictions have an interval structure that fail to solve 53% of the proposed instances, b Model CP-2 approaches the problem with disjunctive constraints and optimized 88% of the instances. In this work, each model is individually analyzed and then compared considering: i Optimization success performance, ii Computational processing time, iii Greatest Resource Utilization and, iv Minimum Work-in-process Inventory. Results demonstrated that CP-2 presented best results on criteria i and ii, but MIP was superior on criteria iii and iv and those findings are discussed at the final section of this work.
Calling the lp_solve Linear Program Software from R, S-PLUS and Excel
Directory of Open Access Journals (Sweden)
Samuel E. Buttrey
2005-05-01
Full Text Available We present a link that allows R, S-PLUS and Excel to call the functions in the lp_solve system. lp_solve is free software (licensed under the GNU Lesser GPL that solves linear and mixed integer linear programs of moderate size (on the order of 10,000 variables and 50,000 constraints. R does not include this ability (though two add-on packages offer linear programs without integer variables, while S-PLUS users need to pay extra for the NuOPT library in order to solve these problems. Our link manages the interface between these statistical packages and lp_solve. Excel has a built-in add-in named Solver that is capable of solving mixed integer programs, but only with fewer than 200 variables. This link allows Excel users to handle substantially larger problems at no extra cost. While our primary concern has been the Windows operating system, the package has been tested on some Unix-type systems as well.
Energy Technology Data Exchange (ETDEWEB)
Dantzig, G.B.; Glynn, P.; Infanger, G.
1994-03-01
Planning under uncertainty is a fundamental problem of decision science where solution could advance man`s ability to plan, schedule, design, and control complex situations. Goal is to develop efficient methods for solving an important class of planning problems, namely linear programs whose parameters (coefficients, right hand sides) are not known with certainty. The research concentrated on theoretical tasks of decomposition and importance sampling techniques, implementation, and software development issues and on applications. Research is continuing on use of parallel processors for solving stochastic programs.
The role of metacognitive skills in solving object-oriented programming problems: a case study
Directory of Open Access Journals (Sweden)
Marietjie Havenga
2015-07-01
Full Text Available This article reports on the role of metacognitive skills when solving object-oriented programming problems as part of a case study. The research was constructivist-based within an interpretivist approach to explore how four students constructed their own thinking when solving programming problems. A qualitative methodology was employed. Both concept-driven coding and data-driven coding were applied. Two main issues emerged from the findings. Participating students had fragmented knowledge of the object-oriented approach and shortcomings regarding the implementation thereof, and they experienced problems with metacognitive control during all the steps of program development. Based on the findings the use of metacognitive critical control points (MCCPs is proposed to be used as a mechanism to facilitate students in their programming efforts and to prevent loss of control during program development.
The Strengthening Families Program 10–14: influence on parent and youth problem-solving skill
Semeniuk, Y.; Brown, R. L.; Riesch, S.K.; Zywicki, M.; Hopper, J.; Henriques, J.B.
2011-01-01
The aim of this paper is to report the results of a preliminary examination of the efficacy of the Strengthening Families Program (SFP) 10–14 in improving parent and youth problem-solving skill. The Hypotheses in this paper include: (1) youth and parents who participated in SFP would have lower mean scores immediately (T2) and 6 months (T3) post intervention on indicators of hostile and negative problem-solving strategies; (2) higher mean scores on positive problem-solving strategies; and (3) youth who participated in SFP would have higher mean scores at T2 and at T3 on indicators of individual problem solving and problem-solving efficacy than youth in the comparison group. The dyads were recruited from elementary schools that had been stratified for race and assigned randomly to intervention or comparison conditions. Mean age of youth was 11 years (SD = 1.04). Fifty-seven dyads (34-intervention & 23-control) were videotaped discussing a frequently occurring problem. The videotapes were analysed using the Iowa Family Interaction Rating Scale (IFIRS) and data were analysed using Dyadic Assessment Intervention Model. Most mean scores on the IFIRS did not change. One score changed as predicted: youth hostility decreased at T3. Two scores changed contrary to prediction: parent hostility increased T3 and parent positive problem solving decreased at T2. SFP demonstrated questionable efficacy for problem-solving skill in this study. PMID:20584236
Oak Ridge Gaseous Diffusion Plant Biological Monitoring and Abatement Program for Mitchell Branch
Energy Technology Data Exchange (ETDEWEB)
Loar, J.M.; Adams, S.M.; Kszos, L.A.; Ryon, M.G.; Smith, J.G.; Southworth, G.R.; Stewart, A.J.
1992-01-01
A proposed Biological Monitoring and Abatement Program (BMAP) for the Oak Ridge Gaseous Diffusion Plant (ORGDP; currently the Oak Ridge K-25 Site) was prepared in December 1986, as required by the modified National Pollutant Discharge Elimination System (NPDES) permit that was issued on September 11, 1986. The effluent discharges to Mitchell Branch are complex, consisting of trace elements, organic chemicals, and radionuclides in addition to various conventional pollutants. Moreover, the composition of these effluent streams will be changing over time as various pollution abatement measures are implemented over the next several years. Although contaminant inputs to the stream originate primarily as point sources from existing plant operations, area sources, such as the classified burial grounds and the K-1407-C holding pond, can not be eliminated as potential sources of contaminants. The proposed BMAP consists of four tasks. These tasks include (1) ambient toxicity testing, (2) bioaccumulation studies, (3) biological indicator studies, and (4) ecological surveys of the benthic invertebrate and fish communities. BMAP will determine whether the effluent limits established for ORGDP protect the designated use of the receiving stream (Mitchell Branch) for growth and propagation of fish and aquatic life. Another objective of the program is to document the ecological effects resulting from various pollution abatement projects, such as the Central Neutralization Facility.
Students' Usability Evaluation of a Web-Based Tutorial Program for College Biology Problem Solving
Kim, H. S.; Prevost, L.; Lemons, P. P.
2015-01-01
The understanding of core concepts and processes of science in solving problems is important to successful learning in biology. We have designed and developed a Web-based, self-directed tutorial program, "SOLVEIT," that provides various scaffolds (e.g., prompts, expert models, visual guidance) to help college students enhance their…
Enhancing creative problem solving in an integrated visual art and geometry program: A pilot study
Schoevers, E.M.; Kroesbergen, E.H.; Pitta-Pantazi, D.
2017-01-01
This article describes a new pedagogical method, an integrated visual art and geometry program, which has the aim to increase primary school students' creative problem solving and geometrical ability. This paper presents the rationale for integrating visual art and geometry education. Furthermore
Enhancing Problem-Solving Capabilities Using Object-Oriented Programming Language
Unuakhalu, Mike F.
2009-01-01
This study integrated object-oriented programming instruction with transfer training activities in everyday tasks, which might provide a mechanism that can be used for efficient problem solving. Specifically, a Visual BASIC embedded with everyday tasks group was compared to another group exposed to Visual BASIC instruction only. Subjects were 40…
Guo, Sangang
2017-09-01
There are two stages in solving security-constrained unit commitment problems (SCUC) within Lagrangian framework: one is to obtain feasible units’ states (UC), the other is power economic dispatch (ED) for each unit. The accurate solution of ED is more important for enhancing the efficiency of the solution to SCUC for the fixed feasible units’ statues. Two novel methods named after Convex Combinatorial Coefficient Method and Power Increment Method respectively based on linear programming problem for solving ED are proposed by the piecewise linear approximation to the nonlinear convex fuel cost functions. Numerical testing results show that the methods are effective and efficient.
Pen Branch fault program: Interim report on the High Resolution, Shallow Seismic Reflection surveys
Energy Technology Data Exchange (ETDEWEB)
Stieve, A.L. (Westinghouse Savannah River Co., Aiken, SC (United States))
1991-01-31
The Pen Branch fault was identified in the subsurface at the Savannah River Site in 1989 based upon the interpretation of earlier seismic reflection surveys and other geologic investigations. A program was initiated at that time to further define the fault in terms of its capability to release seismic energy. The High-Resolution, Shallow Seismic Reflection survey recently completed at SRS was initiated to determine the shallowest extent of the fault and to demonstrate the presence of flat-lying sediments in the top 300 feet of sediments. Conclusions at this time are based upon this shallow seismic survey and the Conoco deep seismic survey (1988--1989). Deformation related to the Pen Branch fault is at least 200 milliseconds beneath the surface in the Conoco data and at least 150 milliseconds in the shallow seismic reflection data. This corresponds to approximately 300 feet below the surface. Sediments at that depth are lower Tertiary (Danian stage) or over 60 million years old. This indicates that the fault is not capable.
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming
DEFF Research Database (Denmark)
Christensen, Tue; Andersen, Kim Allan; Klose, Andreas
2013-01-01
This paper considers a minimum-cost network flow problem in a bipartite graph with a single sink. The transportation costs exhibit a staircase cost structure because such types of transportation cost functions are often found in practice. We present a dynamic programming algorithm for solving...... this so-called single-sink, fixed-charge, multiple-choice transportation problem exactly. The method exploits heuristics and lower bounds to peg binary variables, improve bounds on flow variables, and reduce the state-space variable. In this way, the dynamic programming method is able to solve large...... instances with up to 10,000 nodes and 10 different transportation modes in a few seconds, much less time than required by a widely used mixed-integer programming solver and other methods proposed in the literature for this problem....
Directory of Open Access Journals (Sweden)
Samir Dey
2015-07-01
Full Text Available This paper proposes a new multi-objective intuitionistic fuzzy goal programming approach to solve a multi-objective nonlinear programming problem in context of a structural design. Here we describe some basic properties of intuitionistic fuzzy optimization. We have considered a multi-objective structural optimization problem with several mutually conflicting objectives. The design objective is to minimize weight of the structure and minimize the vertical deflection at loading point of a statistically loaded three-bar planar truss subjected to stress constraints on each of the truss members. This approach is used to solve the above structural optimization model based on arithmetic mean and compare with the solution by intuitionistic fuzzy goal programming approach. A numerical solution is given to illustrate our approach.
A Two-Phase Support Method for Solving Linear Programs: Numerical Experiments
Directory of Open Access Journals (Sweden)
Mohand Bentobache
2012-01-01
Full Text Available We develop a single artificial variable technique to initialize the primal support method for solving linear programs with bounded variables. We first recall the full artificial basis technique, then we will present the proposed algorithm. In order to study the performances of the suggested algorithm, an implementation under the MATLAB programming language has been developed. Finally, we carry out an experimental study about CPU time and iterations number on a large set of the NETLIB test problems. These test problems are practical linear programs modelling various real-life problems arising from several fields such as oil refinery, audit staff scheduling, airline scheduling, industrial production and allocation, image restoration, multisector economic planning, and data fitting. It has been shown that our approach is competitive with our implementation of the primal simplex method and the primal simplex algorithm implemented in the known open-source LP solver LP_SOLVE.
Tunjo Perić; Zoran Babić; Maid Omerović
2017-01-01
This paper presents and analyzes the applicability of three linearization techniques used for solving multi-objective linear fractional programming problems using the goal programming method. The three linearization techniques are: (1) Taylor’s polynomial linearization approximation, (2) the method of variable change, and (3) a modification of the method of variable change proposed in [20]. All three linearization techniques are presented and analyzed in two variants: (a) using the optimal va...
Directory of Open Access Journals (Sweden)
Vitalii M. Bazurin
2015-05-01
Full Text Available Delphi visual programming environment provides ample opportunities for visual mapping arrays. There are a number of Delphi screen form components, which help you to visualize the array on the form. Processing arrays programs in Delphi environment have their differences from the same programs in Pascal. The article describes these differences. Also, the features of student learning methods for solving problems of array processing using Delphi visual components are highlighted. It has been exposed sequence and logic of the teaching material on arrays processing using TStringGrid and TMemo components.
Pol, Henk J.; Harskamp, Egbert G.; Suhre, Cor J. M.; Goedhart, Martin J.
2008-01-01
Many students experience difficulties in solving applied physics problems. Most programs that want students to improve problem-solving skills are concerned with the development of content knowledge. Physhint is an example of a student-controlled computer program that supports students in developing their strategic knowledge in combination with…
Pol, Henk J.; Harskamp, Egbert G.; Suhre, Cor J. M.; Goedhart, Martin J.
Many students experience difficulties in solving applied physics problems. Most programs that want students to improve problem-solving skills are concerned with the development of content knowledge. Physhint is an example of a student-controlled computer program that supports students in developing
Potential function methods for approximately solving linear programming problems theory and practice
Bienstock, Daniel
2002-01-01
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.
Directory of Open Access Journals (Sweden)
Animesh Biswas
2016-04-01
Full Text Available This paper deals with fuzzy goal programming approach to solve fuzzy linear bilevel integer programming problems with fuzzy probabilistic constraints following Pareto distribution and Frechet distribution. In the proposed approach a new chance constrained programming methodology is developed from the view point of managing those probabilistic constraints in a hybrid fuzzy environment. A method of defuzzification of fuzzy numbers using ?-cut has been adopted to reduce the problem into a linear bilevel integer programming problem. The individual optimal value of the objective of each DM is found in isolation to construct the fuzzy membership goals. Finally, fuzzy goal programming approach is used to achieve maximum degree of each of the membership goals by minimizing under deviational variables in the decision making environment. To demonstrate the efficiency of the proposed approach, a numerical example is provided.
Stress-constrained truss topology optimization problems that can be solved by linear programming
DEFF Research Database (Denmark)
Stolpe, Mathias; Svanberg, Krister
2004-01-01
We consider the problem of simultaneously selecting the material and determining the area of each bar in a truss structure in such a way that the cost of the structure is minimized subject to stress constraints under a single load condition. We show that such problems can be solved by linear...... programming to give the global optimum, and that two different materials are always sufficient in an optimal structure....
Quadratic and nonlinear programming problems solving and analysis in fully fuzzy environment
Gabr, Walaa Ibrahim
2015-01-01
This paper presents a comprehensive methodology for solving and analyzing quadratic and nonlinear programming problems in fully fuzzy environment. The solution approach is based on the Arithmetic Fuzzy Logic-based Representations, previously founded on normalized fuzzy matrices. The suggested approach is generalized for the fully fuzzy case of the general forms of quadratic and nonlinear modeling and optimization problems of both the unconstrained and constrained fuzzy optimization problems. ...
Reliability and decomposition techniques to solve certain class of stochastic programming problems
Energy Technology Data Exchange (ETDEWEB)
Minguez, R., E-mail: Roberto.Minguez@unican.e [Environmental Hydraulics Institute ' IH Cantabria' , Universidad de Cantabria, Cantabria (Spain); Conejo, A.J.; Garcia-Bertrand, R. [Department of Electrical Engineering, University of Castilla-La Mancha, Ciudad Real (Spain)
2011-02-15
Reliability based techniques has been an area of active research in structural design during the last decade, and different methods have been developed. The same has occurred with stochastic programming, which is a framework for modeling optimization problems involving uncertainty. The discipline of stochastic programming has grown and broadened to cover a wide range of applications, such as agriculture, capacity planning, energy, finance, fisheries management, production control, scheduling, transportation, water management, etc., and because of this, techniques for solving stochastic programming models are of great interest for the scientific community. This paper presents a new approach for solving a certain type of stochastic programming problems presenting the following characteristics: (i) the joint probability distributions of random variables are given, (ii) these do not depend on the decisions made, and (iii) random variables only affect the objective function. The method is based on mathematical programming decomposition procedures and first-order reliability methods, and constitutes an efficient method for optimizing quantiles in high-dimensional settings. The solution provided by the method allows us to make informed decisions accounting for uncertainty.
A return to the traveling salesman model: a network branch and bound approach
Directory of Open Access Journals (Sweden)
Elias Munapo
2013-02-01
Full Text Available This paper presents a network branch and bound approach for solving the traveling salesman problem. The problem is broken into sub-problems, each of which is solved as a minimum spanning tree model. This is easier to solve than either the linear programming-based or assignment models.
Markovian Monte Carlo program EvolFMC v.2 for solving QCD evolution equations
Jadach, S.; Płaczek, W.; Skrzypek, M.; Stokłosa, P.
2010-02-01
We present the program EvolFMC v.2 that solves the evolution equations in QCD for the parton momentum distributions by means of the Monte Carlo technique based on the Markovian process. The program solves the DGLAP-type evolution as well as modified-DGLAP ones. In both cases the evolution can be performed in the LO or NLO approximation. The quarks are treated as massless. The overall technical precision of the code has been established at 5×10. This way, for the first time ever, we demonstrate that with the Monte Carlo method one can solve the evolution equations with precision comparable to the other numerical methods. New version program summaryProgram title: EvolFMC v.2 Catalogue identifier: AEFN_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFN_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including binary test data, etc.: 66 456 (7407 lines of C++ code) No. of bytes in distributed program, including test data, etc.: 412 752 Distribution format: tar.gz Programming language: C++ Computer: PC, Mac Operating system: Linux, Mac OS X RAM: Less than 256 MB Classification: 11.5 External routines: ROOT ( http://root.cern.ch/drupal/) Nature of problem: Solution of the QCD evolution equations for the parton momentum distributions of the DGLAP- and modified-DGLAP-type in the LO and NLO approximations. Solution method: Monte Carlo simulation of the Markovian process of a multiple emission of partons. Restrictions:Limited to the case of massless partons. Implemented in the LO and NLO approximations only. Weighted events only. Unusual features: Modified-DGLAP evolutions included up to the NLO level. Additional comments: Technical precision established at 5×10. Running time: For the 10 6 events at 100 GeV: DGLAP NLO: 27s; C-type modified DGLAP NLO: 150s (MacBook Pro with Mac OS X v.10
A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3
Czech Academy of Sciences Publication Activity Database
Šíma, Jiří; Žák, Stanislav
-, subm. 2015 (2018) ISSN 0022-0000 R&D Projects: GA ČR GBP202/12/G061; GA ČR GAP202/10/1333 Institutional support: RVO:67985807 Keywords : derandomization * Hitting Set * read-once branching programs * bounded width Subject RIV: IN - Informatics, Computer Science Impact factor: 1.678, year: 2016
Directory of Open Access Journals (Sweden)
Kai Yang
2016-01-01
Full Text Available This work investigates a bioinspired microimmune optimization algorithm to solve a general kind of single-objective nonlinear constrained expected value programming without any prior distribution. In the study of algorithm, two lower bound sample estimates of random variables are theoretically developed to estimate the empirical values of individuals. Two adaptive racing sampling schemes are designed to identify those competitive individuals in a given population, by which high-quality individuals can obtain large sampling size. An immune evolutionary mechanism, along with a local search approach, is constructed to evolve the current population. The comparative experiments have showed that the proposed algorithm can effectively solve higher-dimensional benchmark problems and is of potential for further applications.
Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems
Kuterin, F. A.; Sumin, M. I.
2017-01-01
A convex programming problem in a Hilbert space with an operator equality constraint and a finite number of functional inequality constraints is considered. All constraints involve parameters. The close relation of the instability of this problem and, hence, the instability of the classical Lagrange principle for it to its regularity properties and the subdifferentiability of the value function in the problem is discussed. An iterative nondifferential Lagrange principle with a stopping rule is proved for the indicated problem. The principle is stable with respect to errors in the initial data and covers the normal, regular, and abnormal cases of the problem and the case where the classical Lagrange principle does not hold. The possibility of using the stable sequential Lagrange principle for directly solving unstable optimization problems is discussed. The capabilities of this principle are illustrated by numerically solving the classical ill-posed problem of finding the normal solution of a Fredholm integral equation of the first kind.
... BTTC are experts in their respective fields. Neuro-Oncology Clinical Fellowship This is a joint program with ... can increase survival rates. Learn more... The Neuro-Oncology Branch welcomes Dr. Mark Gilbert as new Branch ...
A semidefinite programming based branch-and-bound framework for the quadratic assignment problem
Truetsch, U.
2014-01-01
The practical approach to calculate an exact solution for a quadratic assignment problem (QAP) via a branch-and-bound framework depends strongly on a "smart" choice of different strategies within the framework, for example the branching strategy, heuristics for the upper bound or relaxations for the
Programmed Self-Assembly of Branched Nanocrystals with an Amphiphilic Surface Pattern.
Taniguchi, Yuki; Sazali, Muhammad Adli Bin; Kobayashi, Yusei; Arai, Noriyoshi; Kawai, Tsuyoshi; Nakashima, Takuya
2017-09-26
Site-selective surface modification on the shape-controlled nanocrystals is a key approach in the programmed self-assembly of inorganic colloidal materials. This study demonstrates a simple methodology to gain self-assemblies of semiconductor nanocrystals with branched shapes through tip-to-tip attachment. Short-chained water-soluble cationic thiols are employed as a surface ligand for CdSe tetrapods and CdSe/CdS core/shell octapods. Because of the less affinity of arm-tip to the surface ligands compared to the arm-side wall, the tip-surface becomes uncapped to give a hydrophobic nature, affording an amphiphilic surface pattern. The amphiphilic tetrapods aggregated into porous agglomerates through tip-to-tip connection in water, while they afforded a hexagonally arranged Kagome-like two-dimensional (2D) assembly by the simple casting of aqueous dispersion with the aid of a convective self-assembly mechanism. A 2D net-like assembly was similarly obtained from amphiphilic octapods. A dissipative particle dynamics simulation using a planar tripod model with an amphiphilic surface pattern reproduced the formation of the Kagome-like assembly in a 2D confined space, demonstrating that the lateral diffusion of nanoparticles and the firm contacts between the hydrophobic tips play crucial roles in the self-assembly.
Govender, I.; Govender, D.; Havenga, M.; Mentz, E.; Breed, B.; Dignum, F.; Dignum, V.
2014-01-01
The difficulty of learning to program has long been identified amongst novices. This study explored the benefits of teaching a problem solving strategy by comparing students’ perceptions and attitudes towards problem solving before and after the strategy was implemented in secondary schools. Based
Directory of Open Access Journals (Sweden)
Tunjo Perić
2017-01-01
Full Text Available This paper presents and analyzes the applicability of three linearization techniques used for solving multi-objective linear fractional programming problems using the goal programming method. The three linearization techniques are: (1 Taylor’s polynomial linearization approximation, (2 the method of variable change, and (3 a modification of the method of variable change proposed in [20]. All three linearization techniques are presented and analyzed in two variants: (a using the optimal value of the objective functions as the decision makers’ aspirations, and (b the decision makers’ aspirations are given by the decision makers. As the criteria for the analysis we use the efficiency of the obtained solutions and the difficulties the analyst comes upon in preparing the linearization models. To analyze the applicability of the linearization techniques incorporated in the linear goal programming method we use an example of a financial structure optimization problem.
Gulland, E.-K.; Veenendaal, B.; Schut, A. G. T.
2012-07-01
Problem-solving knowledge and skills are an important attribute of spatial sciences graduates. The challenge of higher education is to build a teaching and learning environment that enables students to acquire these skills in relevant and authentic applications. This study investigates the effectiveness of traditional face-to-face teaching and online learning technologies in supporting the student learning of problem-solving and computer programming skills, techniques and solutions. The student cohort considered for this study involves students in the surveying as well as geographic information science (GISc) disciplines. Also, students studying across a range of learning modes including on-campus, distance and blended, are considered in this study. Student feedback and past studies reveal a lack of student interest and engagement in problem solving and computer programming. Many students do not see such skills as directly relevant and applicable to their perceptions of what future spatial careers hold. A range of teaching and learning methods for both face-to-face teaching and distance learning were introduced to address some of the perceived weaknesses of the learning environment. These included initiating greater student interaction in lectures, modifying assessments to provide greater feedback and student accountability, and the provision of more interactive and engaging online learning resources. The paper presents and evaluates the teaching methods used to support the student learning environment. Responses of students in relation to their learning experiences were collected via two anonymous, online surveys and these results were analysed with respect to student pass and retention rates. The study found a clear distinction between expectations and engagement of surveying students in comparison to GISc students. A further outcome revealed that students who were already engaged in their learning benefited the most from the interactive learning resources and
Directory of Open Access Journals (Sweden)
E.-K. Gulland
2012-07-01
Full Text Available Problem-solving knowledge and skills are an important attribute of spatial sciences graduates. The challenge of higher education is to build a teaching and learning environment that enables students to acquire these skills in relevant and authentic applications. This study investigates the effectiveness of traditional face-to-face teaching and online learning technologies in supporting the student learning of problem-solving and computer programming skills, techniques and solutions. The student cohort considered for this study involves students in the surveying as well as geographic information science (GISc disciplines. Also, students studying across a range of learning modes including on-campus, distance and blended, are considered in this study. Student feedback and past studies reveal a lack of student interest and engagement in problem solving and computer programming. Many students do not see such skills as directly relevant and applicable to their perceptions of what future spatial careers hold. A range of teaching and learning methods for both face-to-face teaching and distance learning were introduced to address some of the perceived weaknesses of the learning environment. These included initiating greater student interaction in lectures, modifying assessments to provide greater feedback and student accountability, and the provision of more interactive and engaging online learning resources. The paper presents and evaluates the teaching methods used to support the student learning environment. Responses of students in relation to their learning experiences were collected via two anonymous, online surveys and these results were analysed with respect to student pass and retention rates. The study found a clear distinction between expectations and engagement of surveying students in comparison to GISc students. A further outcome revealed that students who were already engaged in their learning benefited the most from the interactive
Solving stochastic programming problems using new approach to Differential Evolution algorithm
Directory of Open Access Journals (Sweden)
Ali Wagdy Mohamed
2017-07-01
Full Text Available This paper presents a new approach to Differential Evolution algorithm for solving stochastic programming problems, named DESP. The proposed algorithm introduces a new triangular mutation rule based on the convex combination vector of the triangle and the difference vector between the best and the worst individuals among the three randomly selected vectors. The proposed novel approach to mutation operator is shown to enhance the global and local search capabilities and to increase the convergence speed of the new algorithm compared with conventional DE. DESP uses Deb’s constraint handling technique based on feasibility and the sum of constraint violations without any additional parameters. Besides, a new dynamic tolerance technique to handle equality constraints is also adopted. Two models of stochastic programming (SP problems are considered: Linear Stochastic Fractional Programming Problems and Multi-objective Stochastic Linear Programming Problems. The comparison results between the DESP and basic DE, basic particle swarm optimization (PSO, Genetic Algorithm (GA and the available results from where it is indicated that the proposed DESP algorithm is competitive with, and in some cases superior to, other algorithms in terms of final solution quality, efficiency and robustness of the considered problems in comparison with the quoted results in the literature.
Multi-objective genetic algorithm for solving N-version program design problem
Energy Technology Data Exchange (ETDEWEB)
Yamachi, Hidemi [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan) and Department of Production and Information Systems Engineering, Tokyo Metropolitan Institute of Technology, Hino, Tokyo 191-0065 (Japan)]. E-mail: yamachi@nit.ac.jp; Tsujimura, Yasuhiro [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan)]. E-mail: tujimr@nit.ac.jp; Kambayashi, Yasushi [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan)]. E-mail: yasushi@nit.ac.jp; Yamamoto, Hisashi [Department of Production and Information Systems Engineering, Tokyo Metropolitan Institute of Technology, Hino, Tokyo 191-0065 (Japan)]. E-mail: yamamoto@cc.tmit.ac.jp
2006-09-15
N-version programming (NVP) is a programming approach for constructing fault tolerant software systems. Generally, an optimization model utilized in NVP selects the optimal set of versions for each module to maximize the system reliability and to constrain the total cost to remain within a given budget. In such a model, while the number of versions included in the obtained solution is generally reduced, the budget restriction may be so rigid that it may fail to find the optimal solution. In order to ameliorate this problem, this paper proposes a novel bi-objective optimization model that maximizes the system reliability and minimizes the system total cost for designing N-version software systems. When solving multi-objective optimization problem, it is crucial to find Pareto solutions. It is, however, not easy to obtain them. In this paper, we propose a novel bi-objective optimization model that obtains many Pareto solutions efficiently. We formulate the optimal design problem of NVP as a bi-objective 0-1 nonlinear integer programming problem. In order to overcome this problem, we propose a Multi-objective genetic algorithm (MOGA), which is a powerful, though time-consuming, method to solve multi-objective optimization problems. When implementing genetic algorithm (GA), the use of an appropriate genetic representation scheme is one of the most important issues to obtain good performance. We employ random-key representation in our MOGA to find many Pareto solutions spaced as evenly as possible along the Pareto frontier. To pursue improve further performance, we introduce elitism, the Pareto-insertion and the Pareto-deletion operations based on distance between Pareto solutions in the selection process. The proposed MOGA obtains many Pareto solutions along the Pareto frontier evenly. The user of the MOGA can select the best compromise solution among the candidates by controlling the balance between the system reliability and the total cost.
Educational Resources The Pediatric Oncology Branch has produced a number of educational and therapeutic materials to help the children we serve learn about their condition and cope with the challenges they might face as a result of their illness. If you are interested in any of these resources, contact Lori Wiener, Ph.D., at wienerl@mail.nih.gov.
AC Transmission Network Expansion Planning: A Semidefinite Programming Branch-and-Cut Approach
Ghaddar, Bissan; Jabr, Rabih
2017-01-01
Transmission network expansion planning is a mixed-integer optimization problem, whose solution is used to guide future investment in transmission equipment. An approach is presented to find the global solution of the transmission planning problem using an AC network model. The approach builds on the semidefinite relaxation of the AC optimal power flow problem (ACOPF); its computational engine is a new specialized branch-and-cut algorithm for transmission expansion planning to deal with the u...
Energy Technology Data Exchange (ETDEWEB)
Hinzman, R.L. [ed.; Adams, S.M.; Ashwood, T.L. [Oak Ridge National Lab., TN (United States)] [and others
1995-08-01
As a condition of the modified National Pollutant Discharge Elimination System (NPDES) permit issued to the Oak Ridge Gaseous Diffusion Plant (ORGDP; now referred to as the Oak Ridge K-25 Site) on September 11, 1986, a Biological Monitoring and Abatement Program (BMAP) was developed for the receiving stream (Mitchell Branch or K-1700 stream). On October 1, 1992, a renewed NPDES permit was issued for the K-25 Site. A biological monitoring plan was submitted for Mitchell Branch, Poplar Creek, Poplar Creek Embayment of the Clinch River and any unnamed tributaries of these streams. The objectives of BMAP are to (1) demonstrate that the effluent limitations established for the Oak Ridge K-25 Site protect and maintain the use of Mitchell Branch for growth and propagation of fish and other aquatic life and (2) document the effects on stream biota resulting from operation of major new pollution abatement facilities, including the Central Neutralization Facility (CNF) and the Toxic Substances Control Act (TSCA) incinerator. The BMAP consists of four tasks: (1) toxicity monitoring; (2) bioaccumulation monitoring; (3) assessment of fish health; and (4) instream monitoring of biological communities, including benthic macroinvertebrates and fish. This document, the third in a series, reports on the results of the Oak Ridge K-25 Site BMAP; it describes studies that were conducted over various periods of time between June 1990 and December 1993, although monitoring conducted outside this time period is included, as appropriate.
Kler, A. M.; Maximov, A. S.; Epishkin, N. O.
2017-09-01
The paper describes the developed method for analyzing technological schemes of thermal power plants based on solving problems of auxiliary linear programming. This method involves solving the linear programming problems to evaluate the effect of supply and removal of heat or material flows of various sizes at different points of the technological scheme of a thermal power plant (TPP). The method effectiveness is demonstrated by the example of the coaldust steam turbine unit with nominal electrical output of 660 MW. As a result of its application, the change of the technological scheme of the unit was found to provide reduction in electricity cost by 0.3%.
Quadratic and nonlinear programming problems solving and analysis in fully fuzzy environment
Directory of Open Access Journals (Sweden)
Walaa Ibrahim Gabr
2015-09-01
Full Text Available This paper presents a comprehensive methodology for solving and analyzing quadratic and nonlinear programming problems in fully fuzzy environment. The solution approach is based on the Arithmetic Fuzzy Logic-based Representations, previously founded on normalized fuzzy matrices. The suggested approach is generalized for the fully fuzzy case of the general forms of quadratic and nonlinear modeling and optimization problems of both the unconstrained and constrained fuzzy optimization problems. The constrained problems are extended by incorporating the suggested fuzzy logic-based representations assuming complete fuzziness of all the optimization formulation parameters. The robustness of the optimal fuzzy solutions is then analyzed using the recently newly developed system consolidity index. Four examples of quadratic and nonlinear programming optimization problems are investigated to illustrate the efficacy of the developed formulations. Moreover, consolidity patterns for the illustrative examples are sketched to show the ability of the optimal solution to withstand any system and input parameters changes effects. It is demonstrated that the geometric analysis of the consolidity charts of each region can be carried out based on specifying the type of consolidity region shape (such as elliptical or circular, slope or angle in degrees of the centerline of the geometric, the location of the centroid of the geometric shape, area of the geometric shape, lengths of principals diagonals of the shape, and the diversity ratio of consolidity points. The overall results demonstrate the consistency and effectiveness of the developed approach for incorporation and implementation for fuzzy quadratic and nonlinear optimization problems. Finally, it is concluded that the presented concept could provide a comprehensive methodology for various quadratic and nonlinear systems’ modeling and optimization in fully fuzzy environments.
New Mathematical Strategy Using Branch and Bound Method
Tarray, Tanveer Ahmad; Bhat, Muzafar Rasool
In this paper, the problem of optimal allocation in stratified random sampling is used in the presence of nonresponse. The problem is formulated as a nonlinear programming problem (NLPP) and is solved using Branch and Bound method. Also the results are formulated through LINGO.
A Python Program for Solving Schro¨dinger's Equation in Undergraduate Physical Chemistry
Srnec, Matthew N.; Upadhyay, Shiv; Madura, Jeffry D.
2017-01-01
In undergraduate physical chemistry, Schrödinger's equation is solved for a variety of cases. In doing so, the energies and wave functions of the system can be interpreted to provide connections with the physical system being studied. Solving this equation by hand for a one-dimensional system is a manageable task, but it becomes time-consuming…
Xia, Youshen; Feng, Gang; Wang, Jun
2004-09-01
This paper presents a recurrent neural network for solving strict convex quadratic programming problems and related linear piecewise equations. Compared with the existing neural networks for quadratic program, the proposed neural network has a one-layer structure with a low model complexity. Moreover, the proposed neural network is shown to have a finite-time convergence and exponential convergence. Illustrative examples further show the good performance of the proposed neural network in real-time applications.
Gleason, Brenda L; Gaebelein, Claude J; Grice, Gloria R; Crannage, Andrew J; Weck, Margaret A; Hurd, Peter; Walter, Brenda; Duncan, Wendy
2013-10-14
To determine the feasibility of using a validated set of assessment rubrics to assess students' critical-thinking and problem-solving abilities across a doctor of pharmacy (PharmD) curriculum. Trained faculty assessors used validated rubrics to assess student work samples for critical-thinking and problem-solving abilities. Assessment scores were collected and analyzed to determine student achievement of these 2 ability outcomes across the curriculum. Feasibility of the process was evaluated in terms of time and resources used. One hundred sixty-one samples were assessed for critical thinking, and 159 samples were assessed for problem-solving. Rubric scoring allowed assessors to evaluate four 5- to 7-page work samples per hour. The analysis indicated that overall critical-thinking scores improved over the curriculum. Although low yield for problem-solving samples precluded meaningful data analysis, it was informative for identifying potentially needed curricular improvements. Use of assessment rubrics for program ability outcomes was deemed authentic and feasible. Problem-solving was identified as a curricular area that may need improving. This assessment method has great potential to inform continuous quality improvement of a PharmD program.
Gaebelein, Claude J.; Grice, Gloria R.; Crannage, Andrew J.; Weck, Margaret A.; Hurd, Peter; Walter, Brenda; Duncan, Wendy
2013-01-01
Objective. To determine the feasibility of using a validated set of assessment rubrics to assess students’ critical-thinking and problem-solving abilities across a doctor of pharmacy (PharmD) curriculum. Methods. Trained faculty assessors used validated rubrics to assess student work samples for critical-thinking and problem-solving abilities. Assessment scores were collected and analyzed to determine student achievement of these 2 ability outcomes across the curriculum. Feasibility of the process was evaluated in terms of time and resources used. Results. One hundred sixty-one samples were assessed for critical thinking, and 159 samples were assessed for problem-solving. Rubric scoring allowed assessors to evaluate four 5- to 7-page work samples per hour. The analysis indicated that overall critical-thinking scores improved over the curriculum. Although low yield for problem-solving samples precluded meaningful data analysis, it was informative for identifying potentially needed curricular improvements. Conclusions. Use of assessment rubrics for program ability outcomes was deemed authentic and feasible. Problem-solving was identified as a curricular area that may need improving. This assessment method has great potential to inform continuous quality improvement of a PharmD program. PMID:24159207
Energy Technology Data Exchange (ETDEWEB)
Smith, J.G. [ed.; Adams, S.M.; Kszos, L.A.; Ryon, M.G.; Southworth, G.R.; Loar, J.M.
1993-08-01
A modified National Pollutant Discharge Elimination System permit was issued to the Oak Ridge Gaseous Diffusion Plant (now referred to as the Oak Ridge K-25 Site) on September 11, 1986. The Oak Ridge K-25 Site is a former uranium-enrichment production facility, which is currently managed by Martin Marietta Energy Systems, Inc. for the US Department of Energy. As required in Part III (L) of that permit, a plan for the biological monitoring of Mitchell Branch (K-1700 stream) was prepared and submitted for approval to the US Environmental Protection Agency and the Tennessee Department of Environment and Conservation [formerly the Tennessee Department of Health and Environment (Loar et al. 1992b)]. The K-25 Site Biological Monitoring and Abatement Program (BMAP) described biomonitoring activities that would be conducted over the duration of the permit. Because it was anticipated that the composition of existing effluent streams entering Mitchell Branch would be altered shortly after the modified permit was issued, sampling of the benthic invertebrate and fish communities (Task 4 of BMAP) was initiated in August and September 1986 respectively.
Energy Technology Data Exchange (ETDEWEB)
Smith, J.G. [ed.; Adams, S.M.; Hinzman, R.L.; Kszos, L.A.; Loar, J.M.; Peterson, M.J.; Ryon, M.G.; Southworth, G.R. [Oak Ridge National Lab., TN (United States); Crumby, W.D. [Automated Sciences Group, Inc., Oak Ridge, TN (United States)
1994-03-01
On September 11, 1986, a modified National Pollutant Discharge Elimination System permit was issued for the Oak Ridge Gaseous Diffusion Plant (ORGDP; now referred to as the Oak Ridge K-25 Site), a former uranium-enrichment production facility. As required in Part III of the permit, a Biological Monitoring and Abatement Program (BMAP) was developed for the biological monitoring of Mitchell Branch (K-1700 stream) and submitted for approval to the US EPA and the Tennessee Department of Environment and Conservation. The plan described biomonitoring activities that would be conducted over the duration of the permit. The objectives of the BMAP are to demonstrate that the effluent limitations established for the Oak Ridge K-25 Site protect and maintain the use of Mitchell Branch for growth and propagation of fish and other aquatic life, and to document the effects on stream biota resulting from operation of major new pollution abatement facilities. The BMAP consists of four tasks: ambient toxicity testing; bioaccumulation studies; biological indicator studies; and ecological surveys of stream communities, including benthic macroinvertebrates and fish. This document is the second in a series of reports presenting the results of the studies that were conducted over various periods of time between August 1987 and June 1990.
An Effectiveness Analysis of the U.S. Federal Government Executive Branch Ethics Policy and Program
2003-06-01
and unblushing frauds would have cost those who participated in them their heads under any system than our own (Mackenzie, 2002, p. 55). A reform...and responsibilities. • Employees shall disclose waste, fraud , abuse, and corruption to appropriate authorities. • Employees shall satisfy in good...the programs vary from company to company. A possible research study would involve comparing pre-Enron/ WorldCom business ethics programs to post
Serang, Oliver
2012-01-01
Linear programming (LP) problems are commonly used in analysis and resource allocation, frequently surfacing as approximations to more difficult problems. Existing approaches to LP have been dominated by a small group of methods, and randomized algorithms have not enjoyed popularity in practice. This paper introduces a novel randomized method of solving LP problems by moving along the facets and within the interior of the polytope along rays randomly sampled from the polyhedral cones defined by the bounding constraints. This conic sampling method is then applied to randomly sampled LPs, and its runtime performance is shown to compare favorably to the simplex and primal affine-scaling algorithms, especially on polytopes with certain characteristics. The conic sampling method is then adapted and applied to solve a certain quadratic program, which compute a projection onto a polytope; the proposed method is shown to outperform the proprietary software Mathematica on large, sparse QP problems constructed from mass spectometry-based proteomics.
Hardiani, N.; Budayasa, I. K.; Juniati, D.
2018-01-01
The aim of this study was to describe algebraic thinking of high school female student’s field independent cognitive style in solving linier program problem by revealing deeply the female students’ responses. Subjects in this study were 7 female students having field independent cognitive style in class 11. The type of this research was descriptive qualitative. The method of data collection used was observation, documentation, and interview. Data analysis technique was by reduction, presentation, and conclusion. The results of this study showed that the female students with field independent cognitive style in solving the linier program problem had the ability to represent algebraic ideas from the narrative question that had been read by manipulating symbols and variables presented in tabular form, creating and building mathematical models in two variables linear inequality system which represented algebraic ideas, and interpreting the solutions as variables obtained from the point of intersection in the solution area to obtain maximum benefit.
Tapia, R. A.; Vanrooy, D. L.
1976-01-01
A quasi-Newton method is presented for minimizing a nonlinear function while constraining the variables to be nonnegative and sum to one. The nonnegativity constraints were eliminated by working with the squares of the variables and the resulting problem was solved using Tapia's general theory of quasi-Newton methods for constrained optimization. A user's guide for a computer program implementing this algorithm is provided.
A new branch and bound algorithm for minimax ratios problems
Directory of Open Access Journals (Sweden)
Zhao Yingfeng
2017-06-01
Full Text Available This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP. By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming problem is then established by utilizing convexity and concavity of functions in the problem. Other than usual branch and bound algorithm, an adapted partition skill and a practical reduction technique performed only in an unidimensional interval are incorporated into the algorithm scheme to significantly improve the computational performance. The global convergence is proved. Finally, some comparative experiments and a randomized numerical test are carried out to demonstrate the efficiency and robustness of the proposed algorithm.
Technological Problem-Solving Activities as a Means of Instruction: The TSM Integration Program.
Sanders, Mark
1994-01-01
Discusses the Technology, Science, Mathematics Integration Project's technological problem-solving method, briefly describes 15 activities and the corresponding technology, science, and mathematics content involved (including 1 detailed example), and proposes a general structure of the activities and research in support of this approach. (MKR)
The NASA Computational Fluid Dynamics (CFD) program - Building technology to solve future challenges
Richardson, Pamela F.; Dwoyer, Douglas L.; Kutler, Paul; Povinelli, Louis A.
1993-01-01
This paper presents the NASA Computational Fluid Dynamics program in terms of a strategic vision and goals as well as NASA's financial commitment and personnel levels. The paper also identifies the CFD program customers and the support to those customers. In addition, the paper discusses technical emphasis and direction of the program and some recent achievements. NASA's Ames, Langley, and Lewis Research Centers are the research hubs of the CFD program while the NASA Headquarters Office of Aeronautics represents and advocates the program.
Summary Of Branch And Bound Algorithm For BIP (0,1) Using LP ...
African Journals Online (AJOL)
A generic algorithm is presented and illustrated by solving a knapsack problem. Keywords: Linear programming, Binary Integer programming, Relaxation, Branch and Bound, Variable selection, Partitioning, fathoming, Depth-first search, Fixing Variable Journal of the Nigerian Association of Mathematical Physics, Volume ...
A branch-and-cut algorithm for the elementary shortest path problem with resource constraints
DEFF Research Database (Denmark)
Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon
The elementary shortest path with resource constraints have commonly been solved with dynamic programming algorithms. Assuming an undirected graph, we present a compact formulation of this problem and a branch-and-cut algorithm to solve it. Two types of resources are discussed: a capacity...... and a fixed charge resource. The former is the subproblem of the capacitated vehicle routing problem and the latter is from the split delivery version. Computational results are presented and compared to dynamic programming algorithms....
2015-03-26
classes. The vehicle routing problem ( VRP ) is a component of the inventory routing prob– lem; literature on this subject offers insight into this...vehicle breakdown have a similar complexity in a civilian con– text. Mu et al. [19] solve a variant of the VRP in which a new routing solution must be...TUAS = tactical unmanned aerial system UAV = unmanned aerial vehicles VMIP = vendor managed inventory practices VRP = vehicle routing problem VRPSD
This article examines the development and implementation of the NOx Budget Trading Program (NBP) and the lessons the Environmental Protection Agency has learned from this seasonal emissions cap-and-trade program.
Java programming fundamentals problem solving through object oriented analysis and design
Nair, Premchand S
2008-01-01
While Java texts are plentiful, it's difficult to find one that takes a real-world approach, and encourages novice programmers to build on their Java skills through practical exercise. Written by an expert with 19 experience teaching computer programming, Java Programming Fundamentals presents object-oriented programming by employing examples taken from everyday life. Provides a foundation in object-oriented design principles and UML notation Describes common pitfalls and good programming practicesFurnishes supplemental links, documents, and programs on its companion website, www.premnair.netU
Jang, In Sung; Hatt, Dylan; Beaton, Rachael L.; Lee, Myung Gyoon; Freedman, Wendy L.; Madore, Barry F.; Hoyt, Taylor J.; Monson, Andrew J.; Rich, Jeffrey A.; Scowcroft, Victoria; Seibert, Mark
2018-01-01
The Carnegie–Chicago Hubble Program (CCHP) seeks to anchor the distance scale of Type Ia supernovae via the Tip of the Red Giant Branch (TRGB) method. Based on deep Hubble Space Telescope ACS/WFC imaging, we present an analysis of the TRGB for the metal-poor halo of NGC 1365, a giant spiral galaxy in the Fornax cluster that was host to the Type Ia supernova SN 2012fr. We have measured the extinction-corrected TRGB magnitude of NGC 1365 to be F814W = 27.34 ± 0.03stat ± 0.04sys mag. In advance of future direct calibration by Gaia, we adopt a provisional I-band TRGB luminosity set at the Large Magellanic Cloud and find a true distance modulus μ 0 = 31.29 ± 0.04stat ± 0.06sys mag or D = 18.1 ± 0.3stat ± 0.5sys Mpc. This measurement is in excellent agreement with recent Cepheid-based distances to NGC 1365 and reveals no significant difference in the distances derived from stars of Populations I and II for this galaxy. We revisit the error budget for the CCHP path to the Hubble constant based on the analysis presented here, i.e., that for one of the most distant Type Ia supernova hosts within our Program, and find that a 2.5% measurement is feasible with the current sample of galaxies and TRGB absolute calibration. Based in part on observations made with the NASA/ESA Hubble Space Telescope, obtained at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555. These observations are associated with program #13691.
Gordon, Gail
2012-01-01
The Materials Test Branch resides at Marshall Space Flight Center's Materials and Processing laboratory and has a long history of supporting NASA programs from Mercury to the recently retired Space Shuttle. The Materials Test Branch supports its customers by supplying materials testing expertise in a wide range of applications. The Materials Test Branch is divided into three Teams, The Chemistry Team, The Tribology Team and the Mechanical Test Team. Our mission and goal is to provide world-class engineering excellence in materials testing with a special emphasis on customer service.
Problem-Solving Strategies and Group Processes in Small Groups Learning Computer Programming.
Webb, Noreen M.; And Others
1986-01-01
Planning and debugging strategies and group processes predicting learning of computer programming were studied in 30 students aged 11 to 14. Students showed little advance planning. Factors associated with learning included high-level planning of program chunks, debugging of single statements, explaining, and verbalizing aloud while typing.…
OpenMP GNU and Intel Fortran programs for solving the time-dependent Gross-Pitaevskii equation
Young-S., Luis E.; Muruganandam, Paulsamy; Adhikari, Sadhan K.; Lončar, Vladimir; Vudragović, Dušan; Balaž, Antun
2017-11-01
We present Open Multi-Processing (OpenMP) version of Fortran 90 programs for solving the Gross-Pitaevskii (GP) equation for a Bose-Einstein condensate in one, two, and three spatial dimensions, optimized for use with GNU and Intel compilers. We use the split-step Crank-Nicolson algorithm for imaginary- and real-time propagation, which enables efficient calculation of stationary and non-stationary solutions, respectively. The present OpenMP programs are designed for computers with multi-core processors and optimized for compiling with both commercially-licensed Intel Fortran and popular free open-source GNU Fortran compiler. The programs are easy to use and are elaborated with helpful comments for the users. All input parameters are listed at the beginning of each program. Different output files provide physical quantities such as energy, chemical potential, root-mean-square sizes, densities, etc. We also present speedup test results for new versions of the programs. Program files doi:http://dx.doi.org/10.17632/y8zk3jgn84.2 Licensing provisions: Apache License 2.0 Programming language: OpenMP GNU and Intel Fortran 90. Computer: Any multi-core personal computer or workstation with the appropriate OpenMP-capable Fortran compiler installed. Number of processors used: All available CPU cores on the executing computer. Journal reference of previous version: Comput. Phys. Commun. 180 (2009) 1888; ibid.204 (2016) 209. Does the new version supersede the previous version?: Not completely. It does supersede previous Fortran programs from both references above, but not OpenMP C programs from Comput. Phys. Commun. 204 (2016) 209. Nature of problem: The present Open Multi-Processing (OpenMP) Fortran programs, optimized for use with commercially-licensed Intel Fortran and free open-source GNU Fortran compilers, solve the time-dependent nonlinear partial differential (GP) equation for a trapped Bose-Einstein condensate in one (1d), two (2d), and three (3d) spatial dimensions for
Berman, Margit I; Buckey, Jay C; Hull, Jay G; Linardatos, Eftihia; Song, Sueyoung L; McLellan, Robert K; Hegel, Mark T
2014-05-01
Computer-based depression interventions lacking live therapist support have difficulty engaging users. This study evaluated the usability, acceptability, credibility, therapeutic alliance and efficacy of a stand-alone multimedia, interactive, computer-based Problem Solving Treatment program (ePST™) for depression. The program simulated live treatment from an expert PST therapist, and delivered 6 ePST™ sessions over 9weeks. Twenty-nine participants with moderate-severe symptoms received the intervention; 23 completed a minimally adequate dose of ePST™ (at least 4 sessions). Program usability, acceptability, credibility, and therapeutic alliance were assessed at treatment midpoint and endpoint. Depressive symptoms and health-related functioning were assessed at baseline, treatment midpoint (4weeks), and study endpoint (10weeks). Depression outcomes and therapeutic alliance ratings were also compared to previously published research on live PST and computer-based depression therapy. Participants rated the program as highly usable, acceptable, and credible, and reported a therapeutic alliance with the program comparable to that observed in live therapy. Depressive symptoms improved significantly over time. These findings also provide preliminary evidence that ePST™ may be effective as a depression treatment. Larger clinical trials with diverse samples are indicated. Copyright © 2014. Published by Elsevier Ltd.
Automated Program Design – an Example Solving a Weather Forecasting Problem
Directory of Open Access Journals (Sweden)
Doroshenko Anatoliy
2016-01-01
Full Text Available High-level algebra-algorithmic software tools for automated design of parallel code in the OpenMP environment are developed for the purpose of both producing efficient parallel code and increasing the performance of program developers. Application of the tools is illustrated with an example of a problem in atmosphere circulation modeling, represented as a service belonging to an Internet portal providing meteorological forecasting services. Results of execution of the parallel weather forecasting program on multiprocessor platforms are given.
Model-based problem solving through symbolic regression via pareto genetic programming
Vladislavleva, E.
2008-01-01
Pareto genetic programming methodology is extended by additional generic model selection and generation strategies that (1) drive the modeling engine to creation of models of reduced non-linearity and increased generalization capabilities, and (2) improve the effectiveness of the search for robust
An interactive method to solve infeasibility in linear programming test assembling models
Huitzing, HA
2004-01-01
In optimal assembly of tests from item banks, linear programming (LP) models have proved to be very useful. Assembly by hand has become nearly impossible, but these LP techniques are able to find the best solutions, given the demands and needs of the test to be assembled and the specifics of the
PROGRAMMING OF METHODS FOR THE NEEDS OF LOGISTICS DISTRIBUTION SOLVING PROBLEMS
Directory of Open Access Journals (Sweden)
Andrea Štangová
2014-06-01
Full Text Available Logistics has become one of the dominant factors which is affecting the successful management, competitiveness and mentality of the global economy. Distribution logistics materializes the connesciton of production and consumer marke. It uses different methodology and methods of multicriterial evaluation and allocation. This thesis adresses the problem of the costs of securing the distribution of product. It was therefore relevant to design a software product thet would be helpful in solvin the problems related to distribution logistics. Elodis – electronic distribution logistics program was designed on the basis of theoretical analysis of the issue of distribution logistics and on the analysis of the software products market. The program uses a multicriterial evaluation methods to deremine the appropriate type and mathematical and geometrical method to determine an appropriate allocation of the distribution center, warehouse and company.
Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
2013-01-01
entropy. Artificial Intelligence 157, 1-2, 139–202. KHULLER, S., MARTINEZ, M. V., NAU, D. S., SLIVA, A., SIMARI, G. I., AND SUBRAHMANIAN, V. S. 2007...Computing most probable worlds of action probabilistic logic programs: scalable estimation for 1030, 000 worlds. Ann. Math. Artif . Intell. 51, 2-4...application in link discovery. In IJCAI. 2462–2467. ROTH, D. 1996. On the hardness of approximate reasoning. Artificial Intelligence 82, 273–302. RYCHTÁŘ, J
Frady, Greg; Nesman, Thomas; Zoladz, Thomas; Szabo, Roland
2010-01-01
For many years, the capabilities to determine the root-cause failure of component failures have been limited to the analytical tools and the state of the art data acquisition systems. With this limited capability, many anomalies have been resolved by adding material to the design to increase robustness without the ability to determine if the design solution was satisfactory until after a series of expensive test programs were complete. The risk of failure and multiple design, test, and redesign cycles were high. During the Space Shuttle Program, many crack investigations in high energy density turbomachines, like the SSME turbopumps and high energy flows in the main propulsion system, have led to the discovery of numerous root-cause failures and anomalies due to the coexistences of acoustic forcing functions, structural natural modes, and a high energy excitation, such as an edge tone or shedding flow, leading the technical community to understand many of the primary contributors to extremely high frequency high cycle fatique fluid-structure interaction anomalies. These contributors have been identified using advanced analysis tools and verified using component and system tests during component ground tests, systems tests, and flight. The structural dynamics and fluid dynamics communities have developed a special sensitivity to the fluid-structure interaction problems and have been able to adjust and solve these problems in a time effective manner to meet budget and schedule deadlines of operational vehicle programs, such as the Space Shuttle Program over the years.
Maddrey, Elizabeth
Research in academia and industry continues to identify a decline in enrollment in computer science. One major component of this decline in enrollment is a shortage of female students. The primary reasons for the gender gap presented in the research include lack of computer experience prior to their first year in college, misconceptions about the field, negative cultural stereotypes, lack of female mentors and role models, subtle discriminations in the classroom, and lack of self-confidence (Pollock, McCoy, Carberry, Hundigopal, & You, 2004). Male students are also leaving the field due to misconceptions about the field, negative cultural stereotypes, and a lack of self-confidence. Analysis of first year attrition revealed that one of the major challenges faced by students of both genders is a lack of problem-solving skills (Beaubouef, Lucas & Howatt, 2001; Olsen, 2005; Paxton & Mumey, 2001). The purpose of this study was to investigate whether specific, non-mathematical problem-solving instruction as part of introductory programming courses significantly increased computer programming self-efficacy and achievement of students. The results of this study showed that students in the experimental group had significantly higher achievement than students in the control group. While this shows statistical significance, due to the effect size and disordinal nature of the data between groups, care has to be taken in its interpretation. The study did not show significantly higher programming self-efficacy among the experimental students. There was not enough data collected to statistically analyze the effect of the treatment on self-efficacy and achievement by gender. However, differences in means were observed between the gender groups, with females in the experimental group demonstrating a higher than average degree of self-efficacy when compared with males in the experimental group and both genders in the control group. These results suggest that the treatment from this
Fitting of full Cobb-Douglas and full VRTS cost frontiers by solving goal programming problem
Venkateswarlu, B.; Mahaboob, B.; Subbarami Reddy, C.; Madhusudhana Rao, B.
2017-11-01
The present research article first defines two popular production functions viz, Cobb-Douglas and VRTS production frontiers and their dual cost functions and then derives their cost limited maximal outputs. This paper tells us that the cost limited maximal output is cost efficient. Here the one side goal programming problem is proposed by which the full Cobb-Douglas cost frontier, full VRTS frontier can be fitted. This paper includes the framing of goal programming by which stochastic cost frontier and stochastic VRTS frontiers are fitted. Hasan et al. [1] used a parameter approach Stochastic Frontier Approach (SFA) to examine the technical efficiency of the Malaysian domestic banks listed in the Kuala Lumpur stock Exchange (KLSE) market over the period 2005-2010. AshkanHassani [2] exposed Cobb-Douglas Production Functions application in construction schedule crashing and project risk analysis related to the duration of construction projects. Nan Jiang [3] applied Stochastic Frontier analysis to a panel of New Zealand dairy forms in 1998/99-2006/2007.
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming
DEFF Research Database (Denmark)
Rauff Lind Christensen, Tue; Klose, Andreas; Andersen, Kim Allan
The Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem (SSFCMCTP) is a problem with versatile applications. This problem is a generalization of the Single-Sink, Fixed-Charge Transportation Problem (SSFCTP), which has a fixed-charge, linear cost structure. However, in at least two...... important aspects of supplier selection, an important application of the SSFCTP, this does not reflect the real life situation. First, transportation costs faced by many companies are in fact piecewise linear. Secondly, when suppliers offer discounts, either incremental or all-unit discounts, such savings...... are neglected in the SSFCTP. The SSFCMCTP overcome this problem by incorporating a staircase cost structure in the cost function instead of the usual one used in SSFCTP. We present a dynamic programming algorithm for the resulting problem. To enhance the performance of the generic algorithm a number...
A Branch-and-Cut Algorithm for Elementary Shortest Path Problem with Resource Constraints
DEFF Research Database (Denmark)
Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon
The elementary shortest path with resource constraints are commonly solved with dynamic programming algorithms. We present a branch-and-cut algorithm for the undirected version. Two types of resources are discussed: A capacity and a fixed charge resource. The former is the subproblem...
Directory of Open Access Journals (Sweden)
H Kazemipoor
2012-04-01
Full Text Available A multi-skilled project scheduling problem (MSPSP has been generally presented to schedule a project with staff members as resources. Each activity in project network requires different skills and also staff members have different skills, too. This causes the MSPSP becomes a special type of a multi-mode resource-constrained project scheduling problem (MM-RCPSP with a huge number of modes. Given the importance of this issue, in this paper, a mixed integer linear programming for the MSPSP is presented. Due to the complexity of the problem, a meta-heuristic algorithm is proposed in order to find near optimal solutions. To validate performance of the algorithm, results are compared against exact solutions solved by the LINGO solver. The results are promising and show that optimal or near-optimal solutions are derived for small instances and good solutions for larger instances in reasonable time.
Gaik Tay, Kim; Cheong, Tau Han; Foong Lee, Ming; Kek, Sie Long; Abdul-Kahar, Rosmila
2017-08-01
In the previous work on Euler’s spreadsheet calculator for solving an ordinary differential equation, the Visual Basic for Application (VBA) programming was used, however, a graphical user interface was not developed to capture users input. This weakness may make users confuse on the input and output since those input and output are displayed in the same worksheet. Besides, the existing Euler’s spreadsheet calculator is not interactive as there is no prompt message if there is a mistake in inputting the parameters. On top of that, there are no users’ instructions to guide users to input the derivative function. Hence, in this paper, we improved previous limitations by developing a user-friendly and interactive graphical user interface. This improvement is aimed to capture users’ input with users’ instructions and interactive prompt error messages by using VBA programming. This Euler’s graphical user interface spreadsheet calculator is not acted as a black box as users can click on any cells in the worksheet to see the formula used to implement the numerical scheme. In this way, it could enhance self-learning and life-long learning in implementing the numerical scheme in a spreadsheet and later in any programming language.
Directory of Open Access Journals (Sweden)
Daniel T.L. Shek
2006-01-01
Full Text Available This paper outlines the proposal for the development, implementation, and evaluation of a positive youth development program that attempts to promote the mental health of stressful Chinese adolescents using principles of Problem Solving Therapy (PST. There are two general aims of PST: to help clients identify life difficulties and resolve them, as well as to teach them skills on how to deal with future problems. The proposed project will utilize the principles of PST as the guiding framework to run two mental health promotion courses for adolescents who are experiencing disturbing stressful responses and students who want to improve their stress management style. Both objective and subjective outcome evaluation strategies will be carried out to assess the effectiveness of the intervention to promote the psychological well-being in adolescents who are experiencing stress. A related sample proposal is described that can give social workers some insight on how to prepare a proposal for developing the Tier 2 Program of the Project P.A.T.H.S. (Positive Adolescent Training through Holistic Social Programs.
Tian, Yanping; Li, Chengren; Wang, Jiali; Cai, Qiyan; Wang, Hanzhi; Chen, Xingshu; Liu, Yunlai; Mei, Feng; Xiao, Lan; Jian, Rui; Li, Hongli
2017-09-07
Despite great advances, China's postgraduate education faces many problems, for example traditional lecture-based learning (LBL) method provides fewer oppotunities to apply knowledge in a working situation. Task-based learning (TBL) is an efficient strategy for increasing the connections among skills, knowledge and competences. This study aimed to evaluate the effect of a modified TBL model on problem-solving abilities among postgraduate medical students in China. We allocated 228 first-year postgraduate students at Third Military Medical University into two groups: the TBL group and LBL group. The TBL group was taught using a TBL program for immunohistochemistry. The curriculum consisted of five phases: task design, self-learning, experimental operations, discussion and summary. The LBL group was taught using traditional LBL. After the course, learning performance was assessed using theoretical and practical tests. The students' preferences and satisfaction of TBL and LBL were also evaluated using questionnaires. There were notable differences in the mean score rates in the practical test (P 80) in the TBL group was higher than that in the LBL group. We observed no substantial differences in the theoretical test between the two groups (P > 0.05). The questionnaire results indicated that the TBL students were satisfied with teaching content, teaching methods and experiment content. The TBL program was also beneficial for the postgraduates in completing their research projects. Furthermore, the TBL students reported positive effects in terms of innovative thinking, collaboration, and communication. TBL is a powerful educational strategy for postgraduate education in China. Our modified TBL imparted basic knowledge to the students and also engaged them more effectively in applying knowledge to solve real-world issues. In conclusion, our TBL established a good foundation for the students' future in both medical research and clinical work.
Shorikov, A. F.
2017-10-01
In this paper we study the problem of optimization of guaranteed result for program control by the final state of regional social and economic system in the presence of risks. For this problem we propose a mathematical model in the form of two-level hierarchical minimax program control problem of the final state of this process with incomplete information. For solving of its problem we constructed the common algorithm that has a form of a recurrent procedure of solving a linear programming and a finite optimization problems.
Branched polymers on branched polymers
Durhuus, Bergfinnur; Jonsson, Thordur
1996-01-01
We study an ensemble of branched polymers which are embedded on other branched polymers. This is a toy model which allows us to study explicitly the reaction of a statistical system on an underlying geometrical structure, a problem of interest in the study of the interaction of matter and quantized gravity. We find a phase transition at which the embedded polymers begin to cover the basis polymers. At the phase transition point the susceptibility exponent $\\gamma$ takes the value 3/4 and the ...
Using Genetic Programming with Prior Formula Knowledge to Solve Symbolic Regression Problem.
Lu, Qiang; Ren, Jun; Wang, Zhiguang
2016-01-01
A researcher can infer mathematical expressions of functions quickly by using his professional knowledge (called Prior Knowledge). But the results he finds may be biased and restricted to his research field due to limitation of his knowledge. In contrast, Genetic Programming method can discover fitted mathematical expressions from the huge search space through running evolutionary algorithms. And its results can be generalized to accommodate different fields of knowledge. However, since GP has to search a huge space, its speed of finding the results is rather slow. Therefore, in this paper, a framework of connection between Prior Formula Knowledge and GP (PFK-GP) is proposed to reduce the space of GP searching. The PFK is built based on the Deep Belief Network (DBN) which can identify candidate formulas that are consistent with the features of experimental data. By using these candidate formulas as the seed of a randomly generated population, PFK-GP finds the right formulas quickly by exploring the search space of data features. We have compared PFK-GP with Pareto GP on regression of eight benchmark problems. The experimental results confirm that the PFK-GP can reduce the search space and obtain the significant improvement in the quality of SR.
Korkmaz, Özgen
2016-01-01
The aim of this study was to investigate the effect of the Scratch and Lego Mindstorms Ev3 programming activities on academic achievement with respect to computer programming, and on the problem-solving and logical-mathematical thinking skills of students. This study was a semi-experimental, pretest-posttest study with two experimental groups and…
Psycharis, Sarantos; Kallia, Maria
2017-01-01
In this paper we investigate whether computer programming has an impact on high school student's reasoning skills, problem solving and self-efficacy in Mathematics. The quasi-experimental design was adopted to implement the study. The sample of the research comprised 66 high school students separated into two groups, the experimental and the…
Uysal, Murat Pasa
2014-01-01
The introductory computer programming (CP) course has been taught for three decades in the faculty. Besides pursuing CP technology, one major goal has been enhancing learners' problem-solving (PS) skills. However, the current situation has implied that this might not be the case. Therefore, a research was conducted to investigate the effects of a…
Ismail, Mohd Nasir; Ngah, Nor Azilah; Umar, Irfan Naufal
2010-01-01
The purpose of the study is to investigate the effects of mind mapping with cooperative learning (MMCL) and cooperative learning (CL) on: (a) programming performance; (b) problem solving skill; and (c) metacognitive knowledge among computer science students in Malaysia. The moderating variable is the students' logical thinking level with two…
Kayili, Gökhan; Ari, Ramazan
2016-01-01
The current research was conducted with the purpose of analyzing the effect of Montessori method supported by Social Skills Training Program on kindergarten children's skills of understanding feelings and social problem solving. 53 children attending Ihsan Dogramaci Applied Nursery School affiliated to Selcuk University, Faculty of Health Sciences…
Vi D. Nguyen; Lara A. Roman; Dexter H. Locke; Sarah K. Mincey; Jessica R. Sanders; Erica Smith Fichman; Mike Duran-Mitchell; Sarah Lumban Tobing
2017-01-01
Residential lands constitute a major component of existing and possible tree canopy in many cities in the United States. To expand the urban forest on these lands, some municipalities and nonprofit organizations have launched residential yard tree distribution programs, also known as tree giveaway programs. This paper describes the operations of five tree distribution...
Directory of Open Access Journals (Sweden)
Hamidreza Karkehabadi
2012-08-01
Full Text Available Balanced scorecard is a performance appraisal method planned for measuring the organizational efficiency to develop their strategies. Organization’s strategies in a specified period are the main inputs in this model. Furthermore, due to nature, experts' opinions play the vital role in determining the strategies. In this research, the proposed algorithm is designed by using fuzzy set covering problem and non-linear multiple objective integer programming (zero and one variables, so that it can be useful to choose the best combination of strategies for specified period of time with the least deviation in experts` opinions. The presented model is carried out in Islamic Azad University, Semnan Branch. The results indicate that the designed model can provide the best combination of strategies for entering into the balanced scorecard system.
DEFF Research Database (Denmark)
Dohn, Anders Høeg; Mason, Andrew
2013-01-01
We present a novel generic programming implementation of a column-generation algorithm for the generalized staff rostering problem. The problem is represented as a generalized set partitioning model, which is able to capture commonly occurring problem characteristics given in the literature. Colu...
de Klerk, E.; Sotirov, R.; Truetsch, U.
2015-01-01
Recent progress in solving quadratic assignment problems (QAPs) from the QAPLIB (Quadratic Assignment Problem Library) test set has come from mixed-integer linear or quadratic programming models that are solved in a branch-and-bound framework. Semidefinite programming (SDP) bounds for QAPs have also
Sole, Marla A.
2016-01-01
Open-ended questions that can be solved using different strategies help students learn and integrate content, and provide teachers with greater insights into students' unique capabilities and levels of understanding. This article provides a problem that was modified to allow for multiple approaches. Students tended to employ high-powered, complex,…
Lončar, Vladimir; Young-S., Luis E.; Škrbić, Srdjan; Muruganandam, Paulsamy; Adhikari, Sadhan K.; Balaž, Antun
2016-12-01
We present new versions of the previously published C and CUDA programs for solving the dipolar Gross-Pitaevskii equation in one, two, and three spatial dimensions, which calculate stationary and non-stationary solutions by propagation in imaginary or real time. Presented programs are improved and parallelized versions of previous programs, divided into three packages according to the type of parallelization. First package contains improved and threaded version of sequential C programs using OpenMP. Second package additionally parallelizes three-dimensional variants of the OpenMP programs using MPI, allowing them to be run on distributed-memory systems. Finally, previous three-dimensional CUDA-parallelized programs are further parallelized using MPI, similarly as the OpenMP programs. We also present speedup test results obtained using new versions of programs in comparison with the previous sequential C and parallel CUDA programs. The improvements to the sequential version yield a speedup of 1.1-1.9, depending on the program. OpenMP parallelization yields further speedup of 2-12 on a 16-core workstation, while OpenMP/MPI version demonstrates a speedup of 11.5-16.5 on a computer cluster with 32 nodes used. CUDA/MPI version shows a speedup of 9-10 on a computer cluster with 32 nodes.
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.
Branch-and-cut-and-price for the traveling salesman problem with time windows
DEFF Research Database (Denmark)
Røpke, Stefan; Madsen, Oli B.G.
In the traveling salesman problem with time windows (TSPTW) one is given a depot and a set of nodes to be visited by a salesman. The salesman starts his trip at the depot and must visit all nodes while respecting time windows at the nodes. The objective of the problem is to minimize the total...... distance traveled by the salesman. The TSPTW is formulated as a set-partitioning problem which is solved by using combined cut and column generation. The pricing sub problem in the column generation procedure is a shortest path problem with time window constraints and 2-cycle elimination. A standard column...... paradigms such as branch-and-cut, dynamic programming and constraint programming. We cannot conclude that the branch-and-cut-and-price approach always is superior to the others paradigms, but several instances are reported solved to optimality for the rst time and bounds are strengthened for other, still...
Hill, Mary C.
1990-01-01
This report documents PCG2 : a numerical code to be used with the U.S. Geological Survey modular three-dimensional, finite-difference, ground-water flow model . PCG2 uses the preconditioned conjugate-gradient method to solve the equations produced by the model for hydraulic head. Linear or nonlinear flow conditions may be simulated. PCG2 includes two reconditioning options : modified incomplete Cholesky preconditioning, which is efficient on scalar computers; and polynomial preconditioning, which requires less computer storage and, with modifications that depend on the computer used, is most efficient on vector computers . Convergence of the solver is determined using both head-change and residual criteria. Nonlinear problems are solved using Picard iterations. This documentation provides a description of the preconditioned conjugate gradient method and the two preconditioners, detailed instructions for linking PCG2 to the modular model, sample data inputs, a brief description of PCG2, and a FORTRAN listing.
Coalition for Evidence-Based Policy, 2015
2015-01-01
The Social Spending Innovation Research (SSIR) proposal seeks to replicate, in social spending, the great success of the Small Business Innovation Research (SBIR) program in technology development. The SBIR program funds technology development by entrepreneurial small companies. The program has spawned breakthrough technologies in diverse areas…
Shorikov, A. F.
2016-12-01
This article discusses the discrete-time dynamical system consisting from two controlled objects and described by a linear recurrent vector equations in the presence of uncertain perturbations. This dynamical system has two levels of a control: dominant level (the first level or the level I) and subordinate level (the second level or the level II) and both have different linear terminal criterions of functioning and united a priori by determined information and control connections. It is assumed that the sets constraining all a priori undefined parameters are known and they are a finite sets or convex, closed and bounded polyhedrons in the corresponding finite-dimensional vector spaces. For the dynamical system in question, we propose a mathematical formalization in the form of solving two-level hierarchical minimax program control problem with incomplete information. In this article for solving of the investigated problem is proposed the algorithm that has a form of a recurrent procedure of solving a linear programming and a finite optimization problems. The results obtained in this article can be used for computer simulation of an actual dynamical processes and for designing controlling and navigation systems.
An overview of solution methods for multi-objective mixed integer linear programming programs
DEFF Research Database (Denmark)
Andersen, Kim Allan; Stidsen, Thomas Riis
Multiple objective mixed integer linear programming (MOMIP) problems are notoriously hard to solve to optimality, i.e. finding the complete set of non-dominated solutions. We will give an overview of existing methods. Among those are interactive methods, the two phases method and enumeration...... methods. In particular we will discuss the existing branch and bound approaches for solving multiple objective integer programming problems. Despite the fact that branch and bound methods has been applied successfully to integer programming problems with one criterion only a few attempts has been made...
Pal, Hridis Kumar; Shukla, Alok
2008-08-01
A set of weakly interacting spin- 1/2 > Fermions, confined by a harmonic oscillator potential, and interacting with each other via a contact potential, is a model system which closely represents the physics of a dilute gas of two-component fermionic atoms confined in a magneto-optic trap. In the present work, our aim is to present a Fortran 90 computer program which, using a basis set expansion technique, solves the Hartree-Fock (HF) equations for spin- 1/2 > Fermions confined by a three-dimensional harmonic oscillator potential, and interacting with each other via pair-wise delta-function potentials. Additionally, the program can also account for those anharmonic potentials which can be expressed as a polynomial in the position operators x, y, and z. Both the restricted-HF (RHF), and the unrestricted-HF (UHF) equations can be solved for a given number of Fermions, with either repulsive or attractive interactions among them. The option of UHF solutions for such systems also allows us to study possible magnetic properties of the physics of two-component confined atomic Fermi gases, with imbalanced populations. Using our code we also demonstrate that such a system exhibits shell structure, and follows Hund's rule. Program summaryProgram title: trap.x Catalogue identifier: AEBB_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEBB_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 17 750 No. of bytes in distributed program, including test data, etc.: 205 138 Distribution format: tar.gz Programming language: mostly Fortran 90 Computer: PCs—SUN, HP Alpha, IBM Operating system: Linux, Solaris, Tru64, AIX Classification: 7.7 Nature of problem: The simplest description of a spin 1/2 >; trapped system at the mean field level is given by the Hartree-Fock method. This
3rd Workshop on Branching Processes and their Applications
González, Miguel; Gutiérrez, Cristina; Martínez, Rodrigo; Minuesa, Carmen; Molina, Manuel; Mota, Manuel; Ramos, Alfonso; WBPA15
2016-01-01
This volume gathers papers originally presented at the 3rd Workshop on Branching Processes and their Applications (WBPA15), which was held from 7 to 10 April 2015 in Badajoz, Spain (http://branching.unex.es/wbpa15/index.htm). The papers address a broad range of theoretical and practical aspects of branching process theory. Further, they amply demonstrate that the theoretical research in this area remains vital and topical, as well as the relevance of branching concepts in the development of theoretical approaches to solving new problems in applied fields such as Epidemiology, Biology, Genetics, and, of course, Population Dynamics. The topics covered can broadly be classified into the following areas: 1. Coalescent Branching Processes 2. Branching Random Walks 3. Population Growth Models in Varying and Random Environments 4. Size/Density/Resource-Dependent Branching Models 5. Age-Dependent Branching Models 6. Special Branching Models 7. Applications in Epidemiology 8. Applications in Biology and Genetics Offer...
National Zoological Park Branch Library.
Kenyon, Kay A.
1988-01-01
Describes the functions of the National Zoological Park Branch of the Smithsonian Institution Libraries, which is dedicated to supporting the special information needs of the zoo. Topics covered include the library's history, collection, programs, services, future plans, and relations with other zoo libraries. (two references) (Author/CLB)
Directory of Open Access Journals (Sweden)
S. Vairamuthu
2016-10-01
Full Text Available End users’ computing environment has been consistently changing in recent years due to the major advancements of Information Technology. This work aimed to measure the level of users’ satisfaction and provide feedbacks for continuous improvement of a course offered in an academic institution. End users here were the students enrolled for the course and the faculty members who offered the same and also acted as an assessor for the assessments. All assessments were scheduled and conducted online. This study was conducted to focus on two different aspects: Measuring User satisfaction and investigating information systems measures to improve usability using nature inspired computing. For user satisfaction analysis, the study employed the Multicriteria Satisfaction Analysis. The course considered was a problem solving and programming course offered to the fresh students enrolled in the first year of the undergraduate degree program in the academic institution during 2015-2016. To identify the factors for improved usability, PSO was employed in this work.
Branched polynomial covering maps
DEFF Research Database (Denmark)
Hansen, Vagn Lundsgaard
1999-01-01
A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...... set. Particular studies are made of branched polynomial covering maps arising from Riemann surfaces and from knots in the 3-sphere....
Branched polynomial covering maps
DEFF Research Database (Denmark)
Hansen, Vagn Lundsgaard
2002-01-01
A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...... set. Particular studies are made of branched polynomial covering maps arising from Riemann surfaces and from knots in the 3-sphere. (C) 2001 Elsevier Science B.V. All rights reserved....
Strategy of Irrigation Branch in Russia
Zeyliger, A.; Ermolaeva, O.
2012-04-01
At this moment, at the starting time of the program on restoration of a large irrigation in Russia till 2020, the scientific and technical community of irrigation branch does not have clear vision on how to promote a development of irrigated agriculture and without repeating of mistakes having a place in the past. In many respects absence of a vision is connected to serious backlog of a scientific and technical and informational and technological level of development of domestic irrigation branch from advanced one. Namely such level of development is necessary for the resolving of new problems in new conditions of managing, and also for adequate answers to new challenges from climate and degradation of ground & water resources, as well as a rigorous requirement from an environment. In such important situation for irrigation branch when it is necessary quickly generate a scientific and technical politics for the current decade for maintenance of translation of irrigated agriculture in the Russian Federation on a new highly effective level of development, in our opinion, it is required to carry out open discussion of needs and requirements as well as a research for a adequate solutions. From political point of view a framework organized in FP6 DESIRE 037046 project is an example of good practice that can serve as methodical approach how to organize and develop such processes. From technical point of view a technology of operational management of irrigation at large scale presents a prospective alternative to the current type of management based on planning. From point of view ICT operational management demands creation of a new platform for the professional environment of activity. This platform should allow to perceive processes in real time, at their partial predictability on signals of a straight line and a feedback, within the framework of variability of decision making scenarious, at high resolution and the big ex-awning of sensor controls and the gauges
Solving Optimization Problems with Spreadsheets
Beigie, Darin
2017-01-01
Spreadsheets provide a rich setting for first-year algebra students to solve problems. Individual spreadsheet cells play the role of variables, and creating algebraic expressions for a spreadsheet to perform a task allows students to achieve a glimpse of how mathematics is used to program a computer and solve problems. Classic optimization…
Hatt, Dylan; Beaton, Rachael L.; Freedman, Wendy L.; Madore, Barry F.; Jang, In-Sung; Hoyt, Taylor J.; Lee, Myung Gyoon; Monson, Andrew J.; Rich, Jeffrey A.; Scowcroft, Victoria; Seibert, Mark
2017-08-01
IC 1613 is an isolated dwarf galaxy within the Local Group. Low foreground and internal extinction, low metallicity, and low crowding make it an invaluable testbed for the calibration of the local distance ladder. We present new, high-fidelity distance estimates to IC 1613 via its Tip of the Red Giant Branch (TRGB) and its RR Lyrae (RRL) variables as part of the Carnegie-Chicago Hubble Program, which seeks an alternate local route to H 0 using Population II stars. We have measured a TRGB magnitude {I}{ACS}{TRGB}=20.35+/- {0.01}{stat}+/- {0.01}{sys} mag using wide-field observations obtained from the IMACS camera on the Magellan-Baade telescope. We have further constructed optical and near-infrared RRL light curves using archival BI- and new H-band observations from the ACS/WFC and WFC3/IR instruments on board the Hubble Space Telescope (HST). In advance of future Gaia data releases, we set provisional values for the TRGB luminosity via the Large Magellanic Cloud and Galactic RRL zero-points via HST parallaxes. We find corresponding true distance moduli {μ }0{TRGB}=24.30+/- {0.03}{stat}+/- {0.05}{sys} {mag} and =24.28+/- {0.04}{stat+{sys}} mag. We compare our results to a body of recent publications on IC 1613 and find no statistically significant difference between the distances derived from Population I and II stars. Based in part on observations made with the NASA/ESA Hubble Space Telescope, obtained at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555. These observations are associated with programs #10505 and #13691. Additional observations are credited to the Observatories of the Carnegie Institution of Washington for the use of Magellan-Baade IMACS. Presented as part of a dissertation to the Department of Astronomy and Astrophysics, The University of Chicago, in partial fulfillment of the requirements for the Ph.D. degree.
Arkansas State University Beebe Branch Faculty Handbook.
Arkansas State Univ., Beebe.
Arkansas State University Beebe Branch provides a liberal arts oriented program for traditional and nontraditional students. Its faculty handbook contains institutional goals, description of responsibilities of administrative officers and faculty committees, faculty employment policies, and administrative and instructional policies. The…
Directory of Open Access Journals (Sweden)
Naima Moustaid-Moussa
2012-08-01
Full Text Available Background: Recent findings from our research indicate that children participating in a creative afterschool program exhibit overall healthier lifestyle practices compared to the average US pediatric population. This observation led us to investigate the prevalence of overweight/obesity and lifestyle practices of their parents. Objective: To determine the strongest predictors of weight status for female parents whose children were participating in such creative afterschool program. Design: Surveyed subjects were parents of children who competed in the 2008 and 2009 Destination ImagiNation® Global Finals in Knoxville, Tennessee. A total of 4,608 children participated in data collection, with parental consent. For the combined 2 years, 1,118 parents, 87% of whom were females (n=1,032 completed online questionnaires, which were based on the Behavioral Risk Factor Surveillance System and included self-reported height, weight, dietary intake, physical activity, and socioeconomic status. The majority of this population was white, and less than 5% were African American or Hispanic. Results: We report here results obtained for the female parents. Only 45.2% of these female parents were overweight/obese, compared to a national average of 64.1% reported by the National Health Nutrition Examination Surveys for 2007—2008. Furthermore, this population was significantly more physically active compared to national average. Most parents (76% had completed a college degree and reported high incomes. Parents with the lowest income were the most obese in this population. Finally, we found a significant association between parent and child weight status. Conclusions: These studies demonstrate that female parents of children who have healthy lifestyles were physically active, which likely accounts for the parents’ lower overweight/obesity rates. In addition to physical activity, income and percentage of calories from fat were all predictors of weight status.
Branching processes and neutral evolution
Taïb, Ziad
1992-01-01
The Galton-Watson branching process has its roots in the problem of extinction of family names which was given a precise formulation by F. Galton as problem 4001 in the Educational Times (17, 1873). In 1875, an attempt to solve this problem was made by H. W. Watson but as it turned out, his conclusion was incorrect. Half a century later, R. A. Fisher made use of the Galton-Watson process to determine the extinction probability of the progeny of a mutant gene. However, it was J. B. S. Haldane who finally gave the first sketch of the correct conclusion. J. B. S. Haldane also predicted that mathematical genetics might some day develop into a "respectable branch of applied mathematics" (quoted in M. Kimura & T. Ohta, Theoretical Aspects of Population Genetics. Princeton, 1971). Since the time of Fisher and Haldane, the two fields of branching processes and mathematical genetics have attained a high degree of sophistication but in different directions. This monograph is a first attempt to apply the current sta...
Branch and bound algorithms to solve semiring constraint satisfaction problems
CSIR Research Space (South Africa)
Leenen, L
2008-12-01
Full Text Available . (2004) 4. Georget, Y., Codognet, P.: Compiling semiring-based constraint with clp(fd,s). In: Proceedings of CP-1998. (1998) 5. Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based CSPs and valued CSPs...
Broin, Cathal Ó
2013-01-01
We present a General-purpose computing on graphics processing units (GPGPU) based computational program and framework for the electronic dynamics of atomic systems under intense laser fields. We present our results using the case of hydrogen, however the code is trivially extensible to tackle problems within the single-active electron (SAE) approximation. Building on our previous work, we introduce the first available GPGPU based implementation of the Taylor, Runge-Kutta and Lanczos based methods created with strong field ab-initio simulations specifically in mind; CLTDSE. The code makes use of finite difference methods and the OpenCL framework for GPU acceleration. The specific example system used is the classic test system; Hydrogen. After introducing the standard theory, and specific quantities which are calculated, the code, including installation and usage, is discussed in-depth. This is followed by some examples and a short benchmark between an 8 hardware thread (i.e logical core) Intel Xeon CPU and an ...
Directory of Open Access Journals (Sweden)
Narong Wichapa
2018-01-01
Full Text Available Infectious waste disposal remains one of the most serious problems in the medical, social and environmental domains of almost every country. Selection of new suitable locations and finding the optimal set of transport routes for a fleet of vehicles to transport infectious waste material, location routing problem for infectious waste disposal, is one of the major problems in hazardous waste management. Determining locations for infectious waste disposal is a difficult and complex process, because it requires combining both intangible and tangible factors. Additionally, it depends on several criteria and various regulations. This facility location problem for infectious waste disposal is complicated, and it cannot be addressed using any stand-alone technique. Based on a case study, 107 hospitals and 6 candidate municipalities in Upper-Northeastern Thailand, we considered criteria such as infrastructure, geology and social & environmental criteria, evaluating global priority weights using the fuzzy analytical hierarchy process (Fuzzy AHP. After that, a new multi-objective facility location problem model which hybridizes fuzzy AHP and goal programming (GP, namely the HGP model, was tested. Finally, the vehicle routing problem (VRP for a case study was formulated, and it was tested using a hybrid genetic algorithm (HGA which hybridizes the push forward insertion heuristic (PFIH, genetic algorithm (GA and three local searches including 2-opt, insertion-move and interexchange-move. The results show that both the HGP and HGA can lead to select new suitable locations and to find the optimal set of transport routes for vehicles delivering infectious waste material. The novelty of the proposed methodologies, HGP, is the simultaneous combination of relevant factors that are difficult to interpret and cost factors in order to determine new suitable locations, and HGA can be applied to determine the transport routes which provide a minimum number of vehicles
Jones, G. Brian; And Others
In response to intended future California legislation which would allot state aid to schools on the basis of how well each educational program met its stated objectives, the Comprehensive Career Guidance System (CCGS) was developed. It is a systematic approach to the development and evaluation of guidance oriented objectives and related…
Solving Environmental Problems
DEFF Research Database (Denmark)
Ørding Olsen, Anders; Sofka, Wolfgang; Grimpe, Christoph
2017-01-01
dispersed. Hence, firms need to collaborate. We shed new light on collaborative search strategies led by firms in general and for solving environmental problems in particular. Both topics are largely absent in the extant open innovation literature. Using data from the European Seventh Framework Program......Recent innovation and strategy research emphasizes the importance of firm’s search for external knowledge to improve innovation performance. We focus on such search strategies within the domain of sustainable innovation in which problems are inherently complex and the relevant knowledge is widely...... for Research and Technological Development (FP7), our results indicate that the problem-solving potential of a search strategy increases with the diversity of existing knowledge of the partners in a consortium and with the experience of the partners involved. Moreover, we identify a substantial negative effect...
Coherent branching feature bisimulation
Directory of Open Access Journals (Sweden)
Tessa Belder
2015-04-01
Full Text Available Progress in the behavioral analysis of software product lines at the family level benefits from further development of the underlying semantical theory. Here, we propose a behavioral equivalence for feature transition systems (FTS generalizing branching bisimulation for labeled transition systems (LTS. We prove that branching feature bisimulation for an FTS of a family of products coincides with branching bisimulation for the LTS projection of each the individual products. For a restricted notion of coherent branching feature bisimulation we furthermore present a minimization algorithm and show its correctness. Although the minimization problem for coherent branching feature bisimulation is shown to be intractable, application of the algorithm in the setting of a small case study results in a significant speed-up of model checking of behavioral properties.
SOLVE The performance analyst for hardwood sawmills
Jeff Palmer; Jan Wiedenbeck; Elizabeth Porterfield
2009-01-01
Presents the users manual and CD-ROM for SOLVE, a computer program that helps sawmill managers improve efficiency and solve problems commonly found in hardwood sawmills. SOLVE provides information on key operational factors including log size distribution, lumber grade yields, lumber recovery factor and overrun, and break-even log costs. (Microsoft Windows? Edition)...
Collis-Romberg Mathematical Problem Solving Profiles.
Collis, K. F.; Romberg, T. A.
Problem solving has become a focus of mathematics programs in Australia in recent years, necessitating the assessment of students' problem-solving abilities. This manual provides a problem-solving assessment and teaching resource package containing four elements: (1) profiles assessment items; (2) profiles diagnostic forms for recording individual…
Adolescent substance users: problem-solving abilities.
Frank, A; Green, V; McNeil, D W
1993-01-01
Cognitive ability and cognitive egocentrism were examined as predictors of problem-solving ability in adolescent substance users in a vocational training program. Problem-solving outcome variables were significantly predicted by two cognitive ability measures, as well as by measures of cognitive independence and egocentrism in thinking. Extent of substance use did not affect cognitive ability, cognitive egocentrism, or problem-solving ability.
Problem-Solving Workshop for Families.
Ritchey, Kathleen M.; Jankowski, Jon
1989-01-01
Cites a need for problem-solving approaches and applications in counseling and outlines current problem-solving training programs and counseling interventions. Proposes a psychoeducational problem-solving workshop for total family participation which is based on D'Zurilla and Goldfried's model. Includes didactic presentations, role modeling, group…
Cellular and physical mechanisms of branching morphogenesis
Varner, Victor D.; Nelson, Celeste M.
2014-01-01
Branching morphogenesis is the developmental program that builds the ramified epithelial trees of various organs, including the airways of the lung, the collecting ducts of the kidney, and the ducts of the mammary and salivary glands. Even though the final geometries of epithelial trees are distinct, the molecular signaling pathways that control branching morphogenesis appear to be conserved across organs and species. However, despite this molecular homology, recent advances in cell lineage analysis and real-time imaging have uncovered surprising differences in the mechanisms that build these diverse tissues. Here, we review these studies and discuss the cellular and physical mechanisms that can contribute to branching morphogenesis. PMID:25005470
Moraes Rêgo, Patrícia Helena; Viana da Fonseca Neto, João; Ferreira, Ernesto M.
2015-08-01
The main focus of this article is to present a proposal to solve, via UDUT factorisation, the convergence and numerical stability problems that are related to the covariance matrix ill-conditioning of the recursive least squares (RLS) approach for online approximations of the algebraic Riccati equation (ARE) solution associated with the discrete linear quadratic regulator (DLQR) problem formulated in the actor-critic reinforcement learning and approximate dynamic programming context. The parameterisations of the Bellman equation, utility function and dynamic system as well as the algebra of Kronecker product assemble a framework for the solution of the DLQR problem. The condition number and the positivity parameter of the covariance matrix are associated with statistical metrics for evaluating the approximation performance of the ARE solution via RLS-based estimators. The performance of RLS approximators is also evaluated in terms of consistence and polarisation when associated with reinforcement learning methods. The used methodology contemplates realisations of online designs for DLQR controllers that is evaluated in a multivariable dynamic system model.
Raja, Muhammad Asif Zahoor; Zameer, Aneela; Khan, Aziz Ullah; Wazwaz, Abdul Majid
2016-01-01
In this study, a novel bio-inspired computing approach is developed to analyze the dynamics of nonlinear singular Thomas-Fermi equation (TFE) arising in potential and charge density models of an atom by exploiting the strength of finite difference scheme (FDS) for discretization and optimization through genetic algorithms (GAs) hybrid with sequential quadratic programming. The FDS procedures are used to transform the TFE differential equations into a system of nonlinear equations. A fitness function is constructed based on the residual error of constituent equations in the mean square sense and is formulated as the minimization problem. Optimization of parameters for the system is carried out with GAs, used as a tool for viable global search integrated with SQP algorithm for rapid refinement of the results. The design scheme is applied to solve TFE for five different scenarios by taking various step sizes and different input intervals. Comparison of the proposed results with the state of the art numerical and analytical solutions reveals that the worth of our scheme in terms of accuracy and convergence. The reliability and effectiveness of the proposed scheme are validated through consistently getting optimal values of statistical performance indices calculated for a sufficiently large number of independent runs to establish its significance.
DEFF Research Database (Denmark)
Andersson, Zarah; Thisted, Ebbe; Andersen, Ulrik Bjørn
2017-01-01
Renovascular hypertension is a common cause of pediatric hypertension. In the fraction of cases that are unrelated to syndromes such as neurofibromatosis, patients with a solitary stenosis on a branch of the renal artery are common and can be diagnostically challenging. Imaging techniques...... that perform well in the diagnosis of main renal artery stenosis may fall short when it comes to branch artery stenosis. We report 2 cases that illustrate these difficulties and show that a branch artery stenosis may be overlooked even by the gold standard method, renal angiography....
... 2015. Bundle branch block Symptoms & causes Diagnosis & treatment Advertisement Mayo Clinic does not endorse companies or products. ... a Job Site Map About This Site Twitter Facebook Google YouTube Pinterest Mayo Clinic is a not- ...
Branching processes in biology
Kimmel, Marek
2015-01-01
This book provides a theoretical background of branching processes and discusses their biological applications. Branching processes are a well-developed and powerful set of tools in the field of applied probability. The range of applications considered includes molecular biology, cellular biology, human evolution and medicine. The branching processes discussed include Galton-Watson, Markov, Bellman-Harris, Multitype, and General Processes. As an aid to understanding specific examples, two introductory chapters, and two glossaries are included that provide background material in mathematics and in biology. The book will be of interest to scientists who work in quantitative modeling of biological systems, particularly probabilists, mathematical biologists, biostatisticians, cell biologists, molecular biologists, and bioinformaticians. The authors are a mathematician and cell biologist who have collaborated for more than a decade in the field of branching processes in biology for this new edition. This second ex...
Branch-and-Cut-and-Price for the Pickup and Delivery Problem with Time Windows
DEFF Research Database (Denmark)
Røpke, Stefan; Cordeau, Jean-Francois
2009-01-01
-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear programming relaxation of a set partitioning formulation. Two pricing subproblems are considered in the column generation algorithm: an elementary and a non-elementary shortest path problem. Valid inequalities......In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch...... are added dynamically to strengthen the relaxations. Some of the previously proposed inequalities for the PDPTW are also shown to be implied by the set partitioning formulation. Computational experiments indicate that the proposed algorithm outperforms a recent branch-and-cut algorithm....
Problem Solving Software for Math Classes.
Troutner, Joanne
1987-01-01
Described are 10 computer software programs for problem solving related to mathematics. Programs described are: (1) Box Solves Story Problems; (2) Safari Search; (3) Puzzle Tanks; (4) The King's Rule; (5) The Factory; (6) The Royal Rules; (7) The Enchanted Forest; (8) Gears; (9) The Super Factory; and (10) Creativity Unlimited. (RH)
Synthesis of branched polysaccharides with tunable degree of branching
Ciric, Jelena; Loos, Katja
2013-01-01
An in vitro enzyme-catalyzed tandem reaction using the enzymes phosphorylase b from rabbit muscle and Deinococcus geothermalis glycogen branching enzyme (Dg GBE) to obtain branched polyglucans with tunable degree of branching (2% divided by 13%) is presented. The tunable degree of branching is
DEFF Research Database (Denmark)
Bussink, Barbara E; Holst, Anders Gaarsdal; Jespersen, Lasse
2013-01-01
AimsTo determine the prevalence, predictors of newly acquired, and the prognostic value of right bundle branch block (RBBB) and incomplete RBBB (IRBBB) on a resting 12-lead electrocardiogram in men and women from the general population.Methods and resultsWe followed 18 441 participants included.......5%/2.3% in women, P Right bundle branch block was associated with significantly...... increased all-cause and cardiovascular mortality in both genders with age-adjusted hazard ratios (HR) of 1.31 [95% confidence interval (CI), 1.11-1.54] and 1.87 (95% CI, 1.48-2.36) in the gender pooled analysis with little attenuation after multiple adjustment. Right bundle branch block was associated...
Game Theory and its Relationship with Linear Programming Models ...
African Journals Online (AJOL)
Game theory, a branch of operations research, has been successfully applied to solve various categories of problems arising from human decisions making characterized by the complexity of situations and the limits of individual processing abilities. This paper shows that game theory and linear programming problem are ...
Troyer, Elizabeth Osbaldeston; Kelly, Patrice
The Gabriel Dumont Community Training Residence (CTR) in Saskatoon (Saskatchewan, Canada) seeks to facilitate the transition of female offenders back into society. The residence will be the first of its type in Saskatchewan. The majority of women eligible for the program are Native Americans; thus the program will address the specific needs of…
A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles
Directory of Open Access Journals (Sweden)
İsmail Karaoğlan
2015-06-01
Full Text Available This paper addresses the vehicle routing problem with multiple use of vehicles (VRPMUV, an important variant of the classic vehicle routing problem (VRP. Unlike the classical VRP, vehicles are allowed to use more than one route in the VRPMUV. We propose a branch-and-cut algorithm for solving the VRPMUV. The proposed algorithm includes several valid inequalities from the literature for the purpose of improving its lower bounds, and a heuristic algorithm based on simulated annealing and a mixed integer programming-based intensification procedure for obtaining the upper bounds. The algorithm is evaluated in terms of the test problems derived from the literature. The computational results which follow show that, if there were 120 customers on the route (in the simulation, the problem would be solved optimally in a reasonable amount of time.
Persistence-Based Branch Misprediction Bounds for WCET Analysis
DEFF Research Database (Denmark)
Puffitsch, Wolfgang
2015-01-01
Branch prediction is an important feature of pipelined processors to achieve high performance. However, it can lead to overly pessimistic worst-case execution time (WCET) bounds when being modeled too conservatively. This paper presents bounds on the number of branch mispredictions for local...... linear programming formulations of the WCET problem. An evaluation on a number of benchmarks shows that with these bounds, dynamic branch prediction does not necessarily lead to higher WCET bounds than static prediction schemes....... dynamic branch predictors. To handle interferences between branch instructions we use the notion of persistence, a concept that is also found in cache analyses. The bounds apply to branches in general, not only to branches that close a loop. Furthermore, the bounds can be easily integrated into integer...
Bi-objective branch-and-cut algorithms
DEFF Research Database (Denmark)
Gadegaard, Sune Lauth; Ehrgott, Matthias; Nielsen, Lars Relund
bound sets that prevents us from solving the bi-objective LP-relaxation of each branching node. To strengthen the lower bound sets, we propose a bi-objective cutting plane algorithm that dynamically adjusts the weights of the objective functions such that different parts of the feasible set...... are strengthened by cutting planes. In addition, we suggest an extension of the branching strategy "Pareto branching''. Extensive computational results obtained for the bi-objective single source capacitated facility location problem prove the effectiveness of the algorithms....
DEFF Research Database (Denmark)
Jensen, Rune Møller; Veloso, Manuela M.; Bryant, Randal E.
2008-01-01
In this article, we present a framework called state-set branching that combines symbolic search based on reduced ordered Binary Decision Diagrams (BDDs) with best-first search, such as A* and greedy best-first search. The framework relies on an extension of these algorithms from expanding a sing...
Tracheobronchial Branching Anomalies
Energy Technology Data Exchange (ETDEWEB)
Hong, Min Ji; Kim, Young Tong; Jou, Sung Shick [Soonchunhyang University, Cheonan Hospital, Cheonan (Korea, Republic of); Park, A Young [Soonchunhyang University College of Medicine, Asan (Korea, Republic of)
2010-04-15
There are various congenital anomalies with respect to the number, length, diameter, and location of tracheobronchial branching patterns. The tracheobronchial anomalies are classified into two groups. The first one, anomalies of division, includes tracheal bronchus, cardiac bronchus, tracheal diverticulum, pulmonary isomerism, and minor variations. The second one, dysmorphic lung, includes lung agenesis-hypoplasia complex and lobar agenesis-aplasia complex
Interactive problem solving using LOGO
Boecker, Heinz-Dieter; Fischer, Gerhard
2014-01-01
This book is unique in that its stress is not on the mastery of a programming language, but on the importance and value of interactive problem solving. The authors focus on several specific interest worlds: mathematics, computer science, artificial intelligence, linguistics, and games; however, their approach can serve as a model that may be applied easily to other fields as well. Those who are interested in symbolic computing will find that Interactive Problem Solving Using LOGO provides a gentle introduction from which one may move on to other, more advanced computational frameworks or more
Buskulic, Damir; De Bonis, I; Décamp, D; Ghez, P; Goy, C; Lees, J P; Lucotte, A; Minard, M N; Odier, P; Pietrzyk, B; Ariztizabal, F; Chmeissani, M; Crespo, J M; Efthymiopoulos, I; Fernández, E; Fernández-Bosman, M; Gaitan, V; Garrido, L; Martínez, M; Orteu, S; Pacheco, A; Padilla, C; Palla, Fabrizio; Pascual, A; Perlas, J A; Sánchez, F; Teubert, F; Colaleo, A; Creanza, D; De Palma, M; Farilla, A; Gelao, G; Girone, M; Iaselli, Giuseppe; Maggi, G; Maggi, M; Marinelli, N; Natali, S; Nuzzo, S; Ranieri, A; Raso, G; Romano, F; Ruggieri, F; Selvaggi, G; Silvestris, L; Tempesta, P; Zito, G; Huang, X; Lin, J; Ouyang, Q; Wang, T; Xie, Y; Xu, R; Xue, S; Zhang, J; Zhang, L; Zhao, W; Bonvicini, G; Cattaneo, M; Comas, P; Coyle, P; Drevermann, H; Engelhardt, A; Forty, Roger W; Frank, M; Hagelberg, R; Harvey, J; Jacobsen, R; Janot, P; Jost, B; Kneringer, E; Knobloch, J; Lehraus, Ivan; Markou, C; Martin, E B; Mato, P; Minten, Adolf G; Miquel, R; Oest, T; Palazzi, P; Pater, J R; Pusztaszeri, J F; Ranjard, F; Rensing, P E; Rolandi, Luigi; Schlatter, W D; Schmelling, M; Schneider, O; Tejessy, W; Tomalin, I R; Venturi, A; Wachsmuth, H W; Wiedenmann, W; Wildish, T; Witzeling, W; Wotschack, J; Ajaltouni, Ziad J; Bardadin-Otwinowska, Maria; Barrès, A; Boyer, C; Falvard, A; Gay, P; Guicheney, C; Henrard, P; Jousset, J; Michel, B; Monteil, S; Montret, J C; Pallin, D; Perret, P; Podlyski, F; Proriol, J; Rossignol, J M; Saadi, F; Fearnley, Tom; Hansen, J B; Hansen, J D; Hansen, J R; Hansen, P H; Nilsson, B S; Kyriakis, A; Simopoulou, Errietta; Siotis, I; Vayaki, Anna; Zachariadou, K; Blondel, A; Bonneaud, G R; Brient, J C; Bourdon, P; Passalacqua, L; Rougé, A; Rumpf, M; Tanaka, R; Valassi, Andrea; Verderi, M; Videau, H L; Candlin, D J; Parsons, M I; Focardi, E; Parrini, G; Corden, M; Delfino, M C; Georgiopoulos, C H; Jaffe, D E; Antonelli, A; Bencivenni, G; Bologna, G; Bossi, F; Campana, P; Capon, G; Chiarella, V; Felici, G; Laurelli, P; Mannocchi, G; Murtas, F; Murtas, G P; Pepé-Altarelli, M; Dorris, S J; Halley, A W; ten Have, I; Knowles, I G; Lynch, J G; Morton, W T; O'Shea, V; Raine, C; Reeves, P; Scarr, J M; Smith, K; Smith, M G; Thompson, A S; Thomson, F; Thorn, S; Turnbull, R M; Becker, U; Braun, O; Geweniger, C; Graefe, G; Hanke, P; Hepp, V; Kluge, E E; Putzer, A; Rensch, B; Schmidt, M; Sommer, J; Stenzel, H; Tittel, K; Werner, S; Wunsch, M; Beuselinck, R; Binnie, David M; Cameron, W; Colling, D J; Dornan, Peter J; Konstantinidis, N P; Moneta, L; Moutoussi, A; Nash, J; San Martin, G; Sedgbeer, J K; Stacey, A M; Dissertori, G; Girtler, P; Kuhn, D; Rudolph, G; Bowdery, C K; Brodbeck, T J; Colrain, P; Crawford, G; Finch, A J; Foster, F; Hughes, G; Sloan, Terence; Whelan, E P; Williams, M I; Galla, A; Greene, A M; Kleinknecht, K; Quast, G; Raab, J; Renk, B; Sander, H G; Wanke, R; Van Gemmeren, P; Zeitnitz, C; Aubert, Jean-Jacques; Bencheikh, A M; Benchouk, C; Bonissent, A; Bujosa, G; Calvet, D; Carr, J; Diaconu, C A; Etienne, F; Thulasidas, M; Nicod, D; Payre, P; Rousseau, D; Talby, M; Abt, I; Assmann, R W; Bauer, C; Blum, Walter; Brown, D; Dietl, H; Dydak, Friedrich; Ganis, G; Gotzhein, C; Jakobs, K; Kroha, H; Lütjens, G; Lutz, Gerhard; Männer, W; Moser, H G; Richter, R H; Rosado-Schlosser, A; Schael, S; Settles, Ronald; Seywerd, H C J; Saint-Denis, R; Wolf, G; Alemany, R; Boucrot, J; Callot, O; Cordier, A; Courault, F; Davier, M; Duflot, L; Grivaz, J F; Heusse, P; Jacquet, M; Kim, D W; Le Diberder, F R; Lefrançois, J; Lutz, A M; Musolino, G; Nikolic, I A; Park, H J; Park, I C; Schune, M H; Simion, S; Veillet, J J; Videau, I; Abbaneo, D; Azzurri, P; Bagliesi, G; Batignani, G; Bettarini, S; Bozzi, C; Calderini, G; Carpinelli, M; Ciocci, M A; Ciulli, V; Dell'Orso, R; Fantechi, R; Ferrante, I; Foà, L; Forti, F; Giassi, A; Giorgi, M A; Gregorio, A; Ligabue, F; Lusiani, A; Marrocchesi, P S; Messineo, A; Rizzo, G; Sanguinetti, G; Sciabà, A; Spagnolo, P; Steinberger, Jack; Tenchini, Roberto; Tonelli, G; Triggiani, G; Vannini, C; Verdini, P G; Walsh, J; Betteridge, A P; Blair, G A; Bryant, L M; Cerutti, F; Gao, Y; Green, M G; Johnson, D L; Medcalf, T; Mir, L M; Perrodo, P; Strong, J A; Bertin, V; Botterill, David R; Clifft, R W; Edgecock, T R; Haywood, S; Edwards, M; Maley, P; Norton, P R; Thompson, J C; Bloch-Devaux, B; Colas, P; Emery, S; Kozanecki, Witold; Lançon, E; Lemaire, M C; Locci, E; Marx, B; Pérez, P; Rander, J; Renardy, J F; Roussarie, A; Schuller, J P; Schwindling, J; Trabelsi, A; Vallage, B; Johnson, R P; Kim, H Y; Litke, A M; McNeil, M A; Taylor, G; Beddall, A; Booth, C N; Boswell, R; Cartwright, S L; Combley, F; Dawson, I; Köksal, A; Letho, M; Newton, W M; Rankin, C; Thompson, L F; Böhrer, A; Brandt, S; Cowan, G D; Feigl, E; Grupen, Claus; Lutters, G; Minguet-Rodríguez, J A; Rivera, F; Saraiva, P; Smolik, L; Stephan, F; Apollonio, M; Bosisio, L; Della Marina, R; Giannini, G; Gobbo, B; Ragusa, F; Rothberg, J E; Wasserbaech, S R; Armstrong, S R; Bellantoni, L; Elmer, P; Feng, Z; Ferguson, D P S; Gao, Y S; González, S; Grahl, J; Harton, J L; Hayes, O J; Hu, H; McNamara, P A; Nachtman, J M; Orejudos, W; Pan, Y B; Saadi, Y; Schmitt, M; Scott, I J; Sharma, V; Turk, J; Walsh, A M; Wu Sau Lan; Wu, X; Yamartino, J M; Zheng, M; Zobernig, G
1996-01-01
A sample of 62249 \\tau-pair events is selected from data taken with the ALEPH detector in 1991, 1992 and 1993. The measurement of the branching fractions for \\tau decays into electrons and muons is presented with emphasis on the study of systematic effects from selection, particle identification and decay classification. Combined with the most recent ALEPH determination of the \\tau lifetime, these results provide a relative measurement of the leptonic couplings in the weak charged current for transverse W bosons.
Efficient Worst-Case Execution Time Analysis of Dynamic Branch Prediction
DEFF Research Database (Denmark)
Puffitsch, Wolfgang
2016-01-01
Dynamic branch prediction is commonly found in modern processors, but notoriously difficult to model for worst-case execution time analysis. This is particularly true for global dynamic branch predictors, where predictions are influenced by the global branch history. Prior research in this area has...... concluded that modeling of global branch prediction is too costly for practical use. This paper presents an approach to model global branch prediction while keeping the analysis effort reasonably low. The approach separates the branch history analysis from the integer linear programming formulation...... of the worst-case execution time problem. Consequently, the proposed approach scales to longer branch history lengths than previous approaches....
A primer on scientific programming with Python
Langtangen, Hans Petter
2016-01-01
The book serves as a first introduction to computer programming of scientific applications, using the high-level Python language. The exposition is example and problem-oriented, where the applications are taken from mathematics, numerical calculus, statistics, physics, biology and finance. The book teaches "Matlab-style" and procedural programming as well as object-oriented programming. High school mathematics is a required background and it is advantageous to study classical and numerical one-variable calculus in parallel with reading this book. Besides learning how to program computers, the reader will also learn how to solve mathematical problems, arising in various branches of science and engineering, with the aid of numerical methods and programming. By blending programming, mathematics and scientific applications, the book lays a solid foundation for practicing computational science. From the reviews: Langtangen … does an excellent job of introducing programming as a set of skills in problem solving. ...
A primer on scientific programming with Python
Langtangen, Hans Petter
2014-01-01
The book serves as a first introduction to computer programming of scientific applications, using the high-level Python language. The exposition is example and problem-oriented, where the applications are taken from mathematics, numerical calculus, statistics, physics, biology and finance. The book teaches "Matlab-style" and procedural programming as well as object-oriented programming. High school mathematics is a required background and it is advantageous to study classical and numerical one-variable calculus in parallel with reading this book. Besides learning how to program computers, the reader will also learn how to solve mathematical problems, arising in various branches of science and engineering, with the aid of numerical methods and programming. By blending programming, mathematics and scientific applications, the book lays a solid foundation for practicing computational science. From the reviews: Langtangen … does an excellent job of introducing programming as a set of skills in problem solving. ...
Super 7: Daily Exercises in Problem Solving.
Hamilton, Octavia
This book is a year-long program of daily exercises in problem solving for 2nd and 3rd grade students that presents 144 lessons, each with seven problems. The problems cover number sense, computation, measurements, geometry, problem solving, and patterns. The material is presented in a sequential fashion with concepts repeated and expanded, and…
Solving applied mathematical problems with Matlab
Xue, Dingyu
2008-01-01
Computer Mathematics Language-An Overview. Fundamentals of MATLAB Programming. Calculus Problems. MATLAB Computations of Linear Algebra Problems. Integral Transforms and Complex Variable Functions. Solutions to Nonlinear Equations and Optimization Problems. MATLAB Solutions to Differential Equation Problems. Solving Interpolations and Approximations Problems. Solving Probability and Mathematical Statistics Problems. Nontraditional Solution Methods for Mathematical Problems.
Coyle, Shawn; Jones, Thea; Pickle, Shirley Kirk
2009-01-01
This article presents a sample of online learning programs serving very different populations: a small district spread over a vast area, a large inner school district, and a statewide program serving numerous districts. It describes how these districts successfully implemented e-learning programs in their schools and discusses the positive impact…
A Unifying Theory of Branching Morphogenesis.
Hannezo, Edouard; Scheele, Colinda L G J; Moad, Mohammad; Drogo, Nicholas; Heer, Rakesh; Sampogna, Rosemary V; van Rheenen, Jacco; Simons, Benjamin D
2017-09-21
The morphogenesis of branched organs remains a subject of abiding interest. Although much is known about the underlying signaling pathways, it remains unclear how macroscopic features of branched organs, including their size, network topology, and spatial patterning, are encoded. Here, we show that, in mouse mammary gland, kidney, and human prostate, these features can be explained quantitatively within a single unifying framework of branching and annihilating random walks. Based on quantitative analyses of large-scale organ reconstructions and proliferation kinetics measurements, we propose that morphogenesis follows from the proliferative activity of equipotent tips that stochastically branch and randomly explore their environment but compete neutrally for space, becoming proliferatively inactive when in proximity with neighboring ducts. These results show that complex branched epithelial structures develop as a self-organized process, reliant upon a strikingly simple but generic rule, without recourse to a rigid and deterministic sequence of genetically programmed events. Copyright © 2017 The Author(s). Published by Elsevier Inc. All rights reserved.
Thermal Energy Conversion Branch
Bielozer, Matthew C.; Schreiber, Jeffrey, G.; Wilson, Scott D.
2004-01-01
The Thermal Energy Conversion Branch (5490) leads the way in designing, conducting, and implementing research for the newest thermal systems used in space applications at the NASA Glenn Research Center. Specifically some of the most advanced technologies developed in this branch can be broken down into four main areas: Dynamic Power Systems, Primary Solar Concentrators, Secondary Solar Concentrators, and Thermal Management. Work was performed in the Dynamic Power Systems area, specifically the Stirling Engine subdivision. Today, the main focus of the 5490 branch is free-piston Stirling cycle converters, Brayton cycle nuclear reactors, and heat rejection systems for long duration mission spacecraft. All space exploring devices need electricity to operate. In most space applications, heat energy from radioisotopes is converted to electrical power. The Radioisotope Thermoelectric Generator (RTG) already supplies electricity for missions such as the Cassini Spacecraft. The focus of today's Stirling research at GRC is aimed at creating an engine that can replace the RTG. The primary appeal of the Stirling engine is its high system efficiency. Because it is so efficient, the Stirling engine will significantly reduce the plutonium fuel mission requirements compared to the RTG. Stirling is also being considered for missions such as the lunar/Mars bases and rovers. This project has focused largely on Stirling Engines of all types, particularly the fluidyne liquid piston engine. The fluidyne was developed by Colin D. West. This engine uses the same concepts found in any type of Stirling engine, with the exception of missing mechanical components. All the working components are fluid. One goal was to develop and demonstrate a working Stirling Fluidyne Engine at the 2nd Annual International Energy Conversion Engineering Conference in Providence, Rhode Island.
The branch librarians' handbook
Rivers, Vickie
2004-01-01
""Recommended""--Booklist; ""an excellent addition...highly recommended""--Public Libraries; ""clear...very sound advice...strongly recommend""--Catholic Library World; ""excellent resource...organized...well written""--Against the Grain; ""interesting...thoroughly practical...a very good book...well organized...clearly written""--ARBA. This handbook covers a wide variety of issues that the branch librarian must deal with every day. Chapters are devoted to mission statements (the Dallas Public Library and Dayton Metro Library mission statements are highlighted as examples), library systems,
Flight Dynamics Analysis Branch
Stengle, Tom; Flores-Amaya, Felipe
2000-01-01
This report summarizes the major activities and accomplishments carried out by the Flight Dynamics Analysis Branch (FDAB), Code 572, in support of flight projects and technology development initiatives in fiscal year 2000. The report is intended to serve as a summary of the type of support carried out by the FDAB, as well as a concise reference of key accomplishments and mission experience derived from the various mission support roles. The primary focus of the FDAB is to provide expertise in the disciplines of flight dynamics, spacecraft trajectory, attitude analysis, and attitude determination and control. The FDAB currently provides support for missions and technology development projects involving NASA, government, university, and private industry.
A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
DEFF Research Database (Denmark)
Görtz, Simon; Klose, Andreas
2012-01-01
This paper presents a simple branch-and-bound method based on Lagrangean relaxation and subgradient optimization for solving large instances of the capacitated facility location problem (CFLP) to optimality. To guess a primal solution to the Lagrangean dual, we average solutions to the Lagrangean...... subproblem. Branching decisions are then based on this estimated (fractional) primal solution. Extensive numerical results reveal that the method is much faster and more robust than other state-of-the-art methods for solving the CFLP exactly....
Linear circuit analysis program for IBM 1620 Monitor 2, 1311/1443 data processing system /CIRCS/
Hatfield, J.
1967-01-01
CIRCS is modification of IBSNAP Circuit Analysis Program, for use on smaller systems. This data processing system retains the basic dc, transient analysis, and FORTRAN 2 formats. It can be used on the IBM 1620/1311 Monitor I Mod 5 system, and solves a linear network containing 15 nodes and 45 branches.
Sharon, Jared Bear
The major purpose of this study was to design and evaluate a programed instructional unit for a first year college chemistry course. The topic of the unit was the categorization and solution of acid-base equilibria problems. The experimental programed instruction text was used by 41 students and the fifth edition of Schaum's Theory and Problems of…
Su, Addison Y. S.; Yang, Stephen J. H.; Hwang, Wu-Yuin; Huang, Chester S. J.; Tern, Ming-Yu
2014-01-01
For more than 2 years, Scratch programming has been taught in Taiwanese elementary schools. However, past studies have shown that it is difficult to find appropriate learning methods or tools to boost students' Scratch programming performance. This inability to readily identify tutoring tools has become one of the primary challenges addressed in…
Quiver Varieties and Branching
Directory of Open Access Journals (Sweden)
Hiraku Nakajima
2009-01-01
Full Text Available Braverman and Finkelberg recently proposed the geometric Satake correspondence for the affine Kac-Moody group Gaff [Braverman A., Finkelberg M., arXiv:0711.2083]. They conjecture that intersection cohomology sheaves on the Uhlenbeck compactification of the framed moduli space of Gcpt-instantons on $R^4/Z_r$ correspond to weight spaces of representations of the Langlands dual group $G_{aff}^{vee}$ at level $r$. When $G = SL(l$, the Uhlenbeck compactification is the quiver variety of type $sl(r_{aff}$, and their conjecture follows from the author's earlier result and I. Frenkel's level-rank duality. They further introduce a convolution diagram which conjecturally gives the tensor product multiplicity [Braverman A., Finkelberg M., Private communication, 2008]. In this paper, we develop the theory for the branching in quiver varieties and check this conjecture for $G = SL(l$.
Durability of branches in branched and fenestrated endografts.
Mastracci, Tara M; Greenberg, Roy K; Eagleton, Matthew J; Hernandez, Adrian V
2013-04-01
Branched and fenestrated repair has been shown to be effective for treatment of complex aortic aneurysms. However, the long-term durability of branches is not well reported. Prospective data collected for all patients enrolled in a physician-sponsored investigational device exemption trial for branched and fenestrated endografts were analyzed. Retrospective review of imaging studies and electronic records was used to supplement the dataset. Incidences of branch stent secondary intervention, stent fracture, migration, branch-related rupture, and death were calculated. A time-to-event analysis was performed for secondary intervention for any branch. Univariable and multivariable analyses were performed to identify related variables. Branch instability, a composite outcome of any branch event, was reported as a function of exponential decay to capture the loss of freedom from complications over time. Between the years 2001 and 2010, 650 patients underwent endovascular aortic repair with branched or fenestrated devices. Over 9 years of follow-up (mean [standard deviation], 3 [2.3] years), secondary procedures were performed for 0.6% of celiac, 4% of superior mesenteric artery (SMA), 6% of right renal artery, and 5% of left renal artery stents. Mean time to reintervention was 237 (354) days. The 30-day, 1-year, and 5-year freedom from branch intervention was 98% (95% confidence interval [CI], 96%-99%), 94% (95% CI, 92%-96%), and 84% (95% CI, 78%-90%), respectively. Death from branch stent complications occurred in three patients, two related to SMA thrombosis and one due to an unstented SMA scallop. Multivariable analysis revealed no factors as independent predictors of need for branch reintervention. Branches, after branched or fenestrated aortic repair, appear to be durable and are rarely the cause of patient death. The absence of long-term data on branch patency in open repair precludes comparison, yet the lower morbidity and mortality risk coupled with longer
The control of branching morphogenesis
Iber, Dagmar; Menshykau, Denis
2013-01-01
Many organs of higher organisms are heavily branched structures and arise by an apparently similar process of branching morphogenesis. Yet the regulatory components and local interactions that have been identified differ greatly in these organs. It is an open question whether the regulatory processes work according to a common principle and how far physical and geometrical constraints determine the branching process. Here, we review the known regulatory factors and physical constraints in lung, kidney, pancreas, prostate, mammary gland and salivary gland branching morphogenesis, and describe the models that have been formulated to analyse their impacts. PMID:24004663
Methods and Technologies Branch (MTB)
The Methods and Technologies Branch focuses on methods to address epidemiologic data collection, study design and analysis, and to modify technological approaches to better understand cancer susceptibility.
DEFF Research Database (Denmark)
Chemi, Tatiana
2016-01-01
a perspective that is relevant to higher education. The focus here is on how artists solve problems in distributed paths, and on the elements of creative collaboration. Creative problem-solving will be looked at as an ongoing dialogue that artists engage with themselves, with others, with recipients......, what can educators at higher education learn from the ways creative groups solve problems? How can artists contribute to inspiring higher education?......This chapter aims to deconstruct some persistent myths about creativity: the myth of individualism and of the genius. By looking at literature that approaches creativity as a participatory and distributed phenomenon and by bringing empirical evidence from artists’ studios, the author presents...
The AFCRL Lunar amd Planetary Research Branch
Price, Stephan D.
2011-07-01
The Lunar and Planetary research program led by Dr John (Jack) Salisbury in the 1960s at the United States Air Force Cambridge Research Laboratories (AFCRL) investigated the surface characteristics of Solar System bodies. The Branch was one of the first groups to measure the infrared spectra of likely surface materials in the laboratory under appropriate vacuum and temperature conditions. The spectral atlases created from the results were then compared to photometric and spectral measurements obtained from ground- and balloon-based telescopes to infer the mineral compositions and physical conditions of the regoliths of the Moon, Mars and asteroids. Starting from scratch, the Branch initially sponsored observations of other groups while its in-house facilities were being constructed. The earliest contracted efforts include the spatially-resolved mapping of the Moon in the first half of the 1960s by Richard W. Shorthill and John W. Saari of the Boeing Scientific Research Laboratories in Seattle. This effort ultimately produced isophotal and isothermal contour maps of the Moon during a lunation and time-resolved thermal images of the eclipsed Moon. The Branch also sponsored probe rocket-based experiments flown by Riccardo Giacconi and his group at American Science and Engineering Inc. that produced the first observations of X-ray stars in 1962 and later the first interferometric measurement of the ozone and C02 emission in the upper atmosphere. The Branch also made early use of balloon-based measurements. This was a singular set of experiments, as these observations are among the very few mid-infrared astronomical measurements obtained from a balloon platform. Notable results of the AFCRL balloon flights were the mid-infrared spectra of the spatially-resolved Moon obtained with the University of Denver mid-infrared spectrometer on the Branch's balloon-borne 61-cm telescope during a 1968 flight. These observations remain among the best available. Salisbury also funded
Singh, Chandralekha
2016-01-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 metacognition. 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.
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.
Lyon, Harold C.; And Others
1992-01-01
The computer-based PlanAlyzer program was designed to teach clinical diagnosis to medical students, taking into account several characteristics common to the clinical problem solver: limited capacity for short-term memory; use of heuristic strategies; sequential information seeking; and problem conceptualization. Six years of development and…
Buskulic, Damir; De Bonis, I; Décamp, D; Ghez, P; Goy, C; Lees, J P; Lucotte, A; Minard, M N; Odier, P; Pietrzyk, B; Ariztizabal, F; Chmeissani, M; Crespo, J M; Efthymiopoulos, I; Fernández, E; Fernández-Bosman, M; Gaitan, V; Martínez, M; Orteu, S; Pacheco, A; Padilla, C; Palla, Fabrizio; Pascual, A; Perlas, J A; Sánchez, F; Teubert, F; Colaleo, A; Creanza, D; De Palma, M; Farilla, A; Gelao, G; Girone, M; Iaselli, Giuseppe; Maggi, G; Maggi, M; Marinelli, N; Natali, S; Nuzzo, S; Ranieri, A; Raso, G; Romano, F; Ruggieri, F; Selvaggi, G; Silvestris, L; Tempesta, P; Zito, G; Huang, X; Lin, J; Ouyang, Q; Wang, T; Xie, Y; Xu, R; Xue, S; Zhang, J; Zhang, L; Zhao, W; Bonvicini, G; Cattaneo, M; Comas, P; Coyle, P; Drevermann, H; Engelhardt, A; Forty, Roger W; Frank, M; Hagelberg, R; Harvey, J; Jacobsen, R; Janot, P; Jost, B; Kneringer, E; Knobloch, J; Lehraus, Ivan; Markou, C; Martin, E B; Mato, P; Minten, Adolf G; Miquel, R; Oest, T; Palazzi, P; Pater, J R; Pusztaszeri, J F; Ranjard, F; Rensing, P E; Rolandi, Luigi; Schlatter, W D; Schmelling, M; Schneider, O; Tejessy, W; Tomalin, I R; Venturi, A; Wachsmuth, H W; Wiedenmann, W; Wildish, T; Witzeling, W; Wotschack, J; Ajaltouni, Ziad J; Bardadin-Otwinowska, Maria; Barrès, A; Boyer, C; Falvard, A; Gay, P; Guicheney, C; Henrard, P; Jousset, J; Michel, B; Monteil, S; Pallin, D; Perret, P; Podlyski, F; Proriol, J; Rossignol, J M; Saadi, F; Fearnley, Tom; Hansen, J B; Hansen, J D; Hansen, J R; Hansen, P H; Nilsson, B S; Kyriakis, A; Simopoulou, Errietta; Siotis, I; Vayaki, Anna; Zachariadou, K; Blondel, A; Bonneaud, G R; Brient, J C; Bourdon, P; Passalacqua, L; Rougé, A; Rumpf, M; Tanaka, R; Valassi, Andrea; Verderi, M; Videau, H L; Candlin, D J; Parsons, M I; Focardi, E; Parrini, G; Corden, M; Delfino, M C; Georgiopoulos, C H; Jaffe, D E; Antonelli, A; Bencivenni, G; Bologna, G; Bossi, F; Campana, P; Capon, G; Chiarella, V; Felici, G; Laurelli, P; Mannocchi, G; Murtas, F; Murtas, G P; Pepé-Altarelli, M; Dorris, S J; Halley, A W; ten Have, I; Knowles, I G; Lynch, J G; Morton, W T; O'Shea, V; Raine, C; Reeves, P; Scarr, J M; Smith, K; Smith, M G; Thompson, A S; Thomson, F; Thorn, S; Turnbull, R M; Becker, U; Braun, O; Geweniger, C; Graefe, G; Hanke, P; Hepp, V; Kluge, E E; Putzer, A; Rensch, B; Schmidt, M; Sommer, J; Stenzel, H; Tittel, K; Werner, S; Wunsch, M; Beuselinck, R; Binnie, David M; Cameron, W; Colling, D J; Dornan, Peter J; Konstantinidis, N P; Moneta, L; Moutoussi, A; Nash, J; San Martin, G; Sedgbeer, J K; Stacey, A M; Dissertori, G; Girtler, P; Kuhn, D; Rudolph, G; Bowdery, C K; Brodbeck, T J; Colrain, P; Crawford, G; Finch, A J; Foster, F; Hughes, G; Sloan, Terence; Whelan, E P; Williams, M I; Galla, A; Greene, A M; Kleinknecht, K; Quast, G; Raab, J; Renk, B; Sander, H G; Wanke, R; Van Gemmeren, P; Zeitnitz, C; Aubert, Jean-Jacques; Bencheikh, A M; Benchouk, C; Bonissent, A; Bujosa, G; Calvet, D; Carr, J; Diaconu, C A; Etienne, F; Thulasidas, M; Nicod, D; Payre, P; Rousseau, D; Talby, M; Abt, I; Assmann, R W; Bauer, C; Blum, Walter; Brown, D; Dietl, H; Dydak, Friedrich; Ganis, G; Gotzhein, C; Jakobs, K; Kroha, H; Lütjens, G; Lutz, Gerhard; Männer, W; Moser, H G; Richter, R H; Rosado-Schlosser, A; Schael, S; Settles, Ronald; Seywerd, H C J; Saint-Denis, R; Wolf, G; Alemany, R; Boucrot, J; Callot, O; Cordier, A; Courault, F; Davier, M; Duflot, L; Grivaz, J F; Heusse, P; Jacquet, M; Kim, D W; Le Diberder, F R; Lefrançois, J; Lutz, A M; Musolino, G; Nikolic, I A; Park, H J; Park, I C; Schune, M H; Simion, S; Veillet, J J; Videau, I; Abbaneo, D; Azzurri, P; Bagliesi, G; Batignani, G; Bettarini, S; Bozzi, C; Calderini, G; Carpinelli, M; Ciocci, M A; Ciulli, V; Dell'Orso, R; Fantechi, R; Ferrante, I; Foà, L; Forti, F; Giassi, A; Giorgi, M A; Gregorio, A; Ligabue, F; Lusiani, A; Marrocchesi, P S; Messineo, A; Rizzo, G; Sanguinetti, G; Sciabà, A; Spagnolo, P; Steinberger, Jack; Tenchini, Roberto; Tonelli, G; Triggiani, G; Vannini, C; Verdini, P G; Walsh, J; Betteridge, A P; Blair, G A; Bryant, L M; Cerutti, F; Gao, Y; Green, M G; Johnson, D L; Medcalf, T; Mir, L M; Perrodo, P; Strong, J A; Bertin, V; Botterill, David R; Clifft, R W; Edgecock, T R; Haywood, S; Edwards, M; Maley, P; Norton, P R; Thompson, J C; Bloch-Devaux, B; Colas, P; Emery, S; Kozanecki, Witold; Lançon, E; Lemaire, M C; Locci, E; Marx, B; Pérez, P; Rander, J; Renardy, J F; Roussarie, A; Schuller, J P; Schwindling, J; Trabelsi, A; Vallage, B; Johnson, R P; Kim, H Y; Litke, A M; McNeil, M A; Taylor, G; Beddall, A; Booth, C N; Boswell, R; Cartwright, S L; Combley, F; Dawson, I; Köksal, A; Letho, M; Newton, W M; Rankin, C; Thompson, L F; Böhrer, A; Brandt, S; Cowan, G D; Feigl, E; Grupen, Claus; Lutters, G; Minguet-Rodríguez, J A; Rivera, F; Saraiva, P; Smolik, L; Stephan, F; Apollonio, M; Bosisio, L; Della Marina, R; Giannini, G; Gobbo, B; Ragusa, F; Rothberg, J E; Wasserbaech, S R; Armstrong, S R; Bellantoni, L; Elmer, P; Feng, Z; Ferguson, D P S; Gao, Y S; González, S; Grahl, J; Harton, J L; Hayes, O J; Hu, H; McNamara, P A; Nachtman, J M; Orejudos, W; Pan, Y B; Saadi, Y; Schmitt, M; Scott, I J; Sharma, V; Turk, J; Walsh, A M; Wu Sau Lan; Wu, X; Yamartino, J M; Zheng, M; Zobernig, G
1996-01-01
From 64492 selected \\tau-pair events, produced at the Z^0 resonance, the measurement of the tau decays into hadrons from a global analysis using 1991, 1992 and 1993 ALEPH data is presented. Special emphasis is given to the reconstruction of photons and \\pi^0's, and the removal of fake photons. A detailed study of the systematics entering the \\pi^0 reconstruction is also given. A complete and consistent set of tau hadronic branching ratios is presented for 18 exclusive modes. Most measurements are more precise than the present world average. The new level of precision reached allows a stringent test of \\tau-\\mu universality in hadronic decays, g_\\tau/g_\\mu \\ = \\ 1.0013 \\ \\pm \\ 0.0095, and the first measurement of the vector and axial-vector contributions to the non-strange hadronic \\tau decay width: R_{\\tau ,V} \\ = \\ 1.788 \\ \\pm \\ 0.025 and R_{\\tau ,A} \\ = \\ 1.694 \\ \\pm \\ 0.027. The ratio (R_{\\tau ,V} - R_{\\tau ,A}) / (R_{\\tau ,V} + R_{\\tau ,A}), equal to (2.7 \\pm 1.3) \\ \\%, is a measure of the importance of Q...
Supporting Organizational Problem Solving with a Workstation.
1982-07-01
G. [., and Sussman, G. J. AMORD: Explicit Control or Reasoning. In Proceedings of the Symposium on Artificial Intellignece and Programming Languagues...0505 9. PERFORMING ORGANIZATION NAME AND ADDRESS 10. PROGRAM ELEMENT. PROJECT. TASK Artificial Intelligence Laboratory AREA& WORK UNIT NUMBERS 545...extending ideas from the field of Artificial Intelligence (A), we describ office work as a problem solving activity. A knowledge embedding language called
Legislative Branch: FY2014 Appropriations
2013-11-25
Authorizations Since 1999, by Matthew E. Glassman . Legislative Branch: FY2014 Appropriations Congressional Research Service 10 The FY2012 level of...Congresses, by Matthew E. Glassman . Legislative Branch: FY2014 Appropriations Congressional Research Service 11 Members’ Representational...vehicles; communications equipment; security equipment and its installation; dignitary protection; intelligence analysis; hazardous material response
On the Optimization and Parallelizing Little Algorithm for Solving the Traveling Salesman Problem
Directory of Open Access Journals (Sweden)
V. V. Vasilchikov
2016-01-01
Full Text Available The paper describes some ways to accelerate solving the NP-complete Traveling Salesman Problem. The classic Little algorithm belonging to the category of ”branch and bound methods” can solve it both for directed and undirected graphs. However, for undirected graphs its operation can be accelerated by eliminating the consideration of branches examined earlier. The paper proposes changes to be made in the key operations of the algorithm to speed up its execution. It also describes the results of an experiment that demonstrated a significant acceleration of solving the problem by using an advanced algorithm. Another way to speed up the work is to parallelize the algorithm. For problems of this kind it is difficult to break the task into a sufficient number of subtasks having comparable complexity. Their parallelism arises dynamically during the execution. For such problems, it seems reasonable to use parallel-recursive algorithms. In our case the use of the library RPM ParLib developed by the author was a good choice. It allows us to develop effective applications for parallel computing on a local network using any .NET-compatible programming language. We used C# to develop the programs. Parallel applications were developed as for basic and modified algorithms, the comparing of their speed was made. Experiments were performed for the graphs with the number of vertexes up to 45 and with the number of network computers up to 16. We also investigated the acceleration that can be achieved by parallelizing the basic Little algorithm for directed graphs. The results of these experiments are also presented in the paper.
SolveDB: Integrating Optimization Problem Solvers Into SQL Databases
DEFF Research Database (Denmark)
Siksnys, Laurynas; Pedersen, Torben Bach
2016-01-01
Many real-world decision problems involve solving optimization problems based on data in an SQL database. Traditionally, solving such problems requires combining a DBMS with optimization software packages for each required class of problems (e.g. linear and constraint programming) -- leading...... to workflows that are cumbersome, complex, inefficient, and error-prone. In this paper, we present SolveDB - a DBMS for optimization applications. SolveDB supports solvers for different problem classes and offers seamless data management and optimization problem solving in a pure SQL-based setting. This allows...... for much simpler and more effective solutions of database-based optimization problems. SolveDB is based on the 3-level ANSI/SPARC architecture and allows formulating, solving, and analysing solutions of optimization problems using a single so-called solve query. SolveDB provides (1) an SQL-based syntax...
DEFF Research Database (Denmark)
Hansen, David
2012-01-01
employee strengths in continuou simprovements of the work system. The research question was: “How can Lean problem solving and Appreciative Inquiry be combined for optimized work system innovation?” The research project was carried out as a co-creation process with close cooperation between researcher...... and participants and was documented by qualitative methods. This paper presents an academic literature review on Appreciative Inquiry and problem solving for continuous improvements that did not reveal successful attempts in combining the two.Both the literature and the empirical study showed one of the main...... to work system innovation and discusses how Appreciative Inquiry, Problem Solving, and the combination ‘Appreciative Problem Solving’ can be used to optimize continuous work system innovation.These findings add to the theoretical foundation of the emerging field of Strength-based Lean....
PENERAPAN BRANCH AND BOUND ALGORITHM DALAM OPTIMALISASI PRODUKSI ROTI
Directory of Open Access Journals (Sweden)
GEDE SURYAWAN
2016-11-01
Full Text Available Companies which engaged in production activities such as Ramadhan Bakery would want optimal profit in their every production. The aim of this study was to find optimal profit and optimal combination of bread production (original chocolate bread, extra chocolate bread, rounding chocolate bread and mattress chocolate bread that was produced by Ramadhan Bakery by applying Branch and Bound Algorithm method. Branch and Bound Algorithm is one method to solve Integer Programming’s problems other than Cutting Plane method. Compared with Cutting Plane method, Branch and Bound Algorithm method is more effective in determining the optimal value. As the result of this study showed that to get optimal profit, Ramadhan Bakery should produce 360 pcs of original chocolate bread, 300 pcs of extra chocolate bread, 306 pcs of rounding chocolate bread and 129 pcs of mattress chocolate bread with optimal profit amounts Rp. 1.195.624,00.. The profit will increase amounts 25,2 % than before.
Hierarchical Ring Network Design Using Branch-and-Price
DEFF Research Database (Denmark)
Thomadsen, Tommy; Stidsen, Thomas K.
2005-01-01
link establishment costs and the link capacity costs into account. Hierarchical ring network design problems combines the following optimization problems: Clustering, hub selection, metro ring design, federal ring design and routing problems. In this paper a branch-and-price algorithm is presented...... for jointly solving the clustering problem, the metro ring design problem and the routing problem. Computational results are given for networks with up to 36 nodes....
Energy Technology Data Exchange (ETDEWEB)
Ondis, L.A., II; Tyburski, L.J.; Moskowitz, B.S.
2000-03-01
The RCP01 Monte Carlo program is used to analyze many geometries of interest in nuclear design and analysis of light water moderated reactors such as the core in its pressure vessel with complex piping arrangement, fuel storage arrays, shipping and container arrangements, and neutron detector configurations. Written in FORTRAN and in use on a variety of computers, it is capable of estimating steady state neutron or photon reaction rates and neutron multiplication factors. The energy range covered in neutron calculations is that relevant to the fission process and subsequent slowing-down and thermalization, i.e., 20 MeV to 0 eV. The same energy range is covered for photon calculations.
Directory of Open Access Journals (Sweden)
V. A. Sednin
2009-01-01
Full Text Available The paper presents a problem statement, a developed mathematical model and proposed algorithm for solving optimization of capital investments in modernization (introduction of automatic controlsystems of thermal processes of large systems of centralized heat supply which are based on application of network model.The formulated problem refers to the problems of combinatory (discrete optimization. Methods of «branches and boundaries» or dynamic programming are applied nowadays for solving problems of this type. These methods are not considered as universal ones because they greatly depend on description of solution feasible area. As a result of it it is not possible to develop a universal software for solving any assignments which can be formulated as problems of combinatory optimization.The presented network model of the investigated problem does not have above-mentioned disadvantages and an algorithm is proposed for solving this problem which admits a simple programming realization.
Mathematics as Problem Solving.
Soifer, Alexander
This book contains about 200 problems. It is suggested that it be used by students, teachers or anyone interested in exploring mathematics. In addition to a general discussion on problem solving, there are problems concerned with number theory, algebra, geometry, and combinatorics. (PK)
Dobbs, David E.
2013-01-01
A direct method is given for solving first-order linear recurrences with constant coefficients. The limiting value of that solution is studied as "n to infinity." This classroom note could serve as enrichment material for the typical introductory course on discrete mathematics that follows a calculus course.
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
2006-01-01
as a general approach to problem solving. We apply these Simonian ideas to organisational issues, specifically new organisational forms. Specifically, Simonian ideas allow us to develop a morphology of new organisational forms and to point to some design problems that characterise these forms....
P.H. Utomo (Putranto); R.H. Makarim (Rusydi)
2017-01-01
textabstractA Binary puzzle is a Sudoku-like puzzle with values in each cell taken from the set (Formula presented.). Let (Formula presented.) be an even integer, a solved binary puzzle is an (Formula presented.) binary array that satisfies the following conditions: (1) no three consecutive ones and
Ayrinhac, Simon
2014-01-01
We present in this work a demonstration of the maze-solving problem with electricity. Electric current flowing in a maze as a printed circuit produces Joule heating and the right way is instantaneously revealed with infrared thermal imaging. The basic properties of electric current can be discussed in this context, with this challenging question:…
Solving Problems through Circles
Grahamslaw, Laura; Henson, Lisa H.
2015-01-01
Several problem-solving interventions that utilise a "circle" approach have been applied within the field of educational psychology, for example, Circle Time, Circle of Friends, Sharing Circles, Circle of Adults and Solution Circles. This research explored two interventions, Solution Circles and Circle of Adults, and used thematic…
Solving Linear Differential Equations
Nguyen, K.A.; Put, M. van der
2010-01-01
The theme of this paper is to 'solve' an absolutely irreducible differential module explicitly in terms of modules of lower dimension and finite extensions of the differential field K. Representations of semi-simple Lie algebras and differential Galo is theory are the main tools. The results extend
Universal Design Problem Solving
Sterling, Mary C.
2004-01-01
Universal design is made up of four elements: accessibility, adaptability, aesthetics, and affordability. This article addresses the concept of universal design problem solving through experiential learning for an interior design studio course in postsecondary education. Students' experiences with clients over age 55 promoted an understanding of…
Introspection in Problem Solving
Jäkel, Frank; Schreiber, Cornell
2013-01-01
Problem solving research has encountered an impasse. Since the seminal work of Newell und Simon (1972) researchers do not seem to have made much theoretical progress (Batchelder and Alexander, 2012; Ohlsson, 2012). In this paper we argue that one factor that is holding back the field is the widespread rejection of introspection among cognitive…
Greene, Kim; Heyck-Williams, Jeff; Timpson Gray, Elicia
2017-01-01
Problem solving spans all grade levels and content areas, as evidenced by this compilation of projects from schools across the United States. In one project, high school girls built a solar-powered tent to serve their city's homeless population. In another project, 4th graders explored historic Jamestown to learn about the voices lost to history.…
Models of lung branching morphogenesis.
Miura, Takashi
2015-03-01
Vertebrate airway has a tree-like-branched structure. This structure is generated by repeated tip splitting, which is called branching morphogenesis. Although this phenomenon is extensively studied in developmental biology, the mechanism of the pattern formation is not well understood. Conversely, there are many tree-like structures in purely physical or chemical systems, and their pattern formation mechanisms are well-understood using mathematical models. Recent studies correlate these biological observations and mathematical models to understand lung branching morphogenesis. These models use slightly different mechanisms. In this article, we will review recent progress in modelling lung branching morphogenesis, and future directions to experimentally verify the models. © The Authors 2015. Published by Oxford University Press on behalf of the Japanese Biochemical Society. All rights reserved.
DEFF Research Database (Denmark)
Risum, Niels; Strauss, David; Sogaard, Peter
2013-01-01
The relationship between myocardial electrical activation by electrocardiogram (ECG) and mechanical contraction by echocardiography in left bundle-branch block (LBBB) has never been clearly demonstrated. New strict criteria for LBBB based on a fundamental understanding of physiology have recently...
Toward Solving the Problem of Problem Solving: An Analysis Framework
Roesler, Rebecca A.
2016-01-01
Teaching is replete with problem solving. Problem solving as a skill, however, is seldom addressed directly within music teacher education curricula, and research in music education has not examined problem solving systematically. A framework detailing problem-solving component skills would provide a needed foundation. I observed problem solving…
Lyons, Kathleen D; Hull, Jay G; Kaufman, Peter A; Li, Zhongze; Seville, Janette L; Ahles, Tim A; Kornblith, Alice B; Hegel, Mark T
2015-01-01
The purpose of this research was to develop and pilot test an intervention to optimize functional recovery for breast cancer survivors. Over two studies, 31 women enrolled in a goal-setting program via telephone. All eligible women enrolled (37% of those screened) and 66% completed all study activities. Completers were highly satisfied with the intervention, using it to address, on average, four different challenging activities. The longitudinal analysis showed a main effect of time for overall quality of life (F(5, 43.1) = 5.1, p = 0.001) and improvements in active coping (F (3, 31.7) = 4.9, p = 0.007), planning (F (3, 36.0) = 4.1, p = 0.01), reframing (F (3, 29.3) = 8.5, p < 0.001), and decreases in self-blame (F (3,31.6) = 4.3, p = 0.01). The intervention is feasible and warrants further study to determine its efficacy in fostering recovery and maximizing activity engagement after cancer treatment.
Directory of Open Access Journals (Sweden)
Narong Wichapa
Full Text Available The selection of a suitable location for infectious waste disposal is one of the major problems in waste management. Determining the location of infectious waste disposal centers is a difficult and complex process because it requires combining social and environmental factors that are hard to interpret, and cost factors that require the allocation of resources. Additionally, it depends on several regulations. Based on the actual conditions of a case study, forty hospitals and three candidate municipalities in the sub-Northeast region of Thailand, we considered multiple factors such as infrastructure, geological and social & environmental factors, calculating global priority weights using the fuzzy analytical hierarchy process (FAHP. After that, a new multi-objective facility location problem model which combines FAHP and goal programming (GP, namely the FAHP-GP model, was tested. The proposed model can lead to selecting new suitable locations for infectious waste disposal by considering both total cost and final priority weight objectives. The novelty of the proposed model is the simultaneous combination of relevant factors that are difficult to interpret and cost factors, which require the allocation of resources. Keywords: Multi-objective facility location problem, Fuzzy analytic hierarchy process, Infectious waste disposal centers
Gu, Liangliang; Xu, Yuewen; Fahnhorst, Grant; Macosko, Christopher W.
2017-05-01
A trifunctional aziridine linker, trimethylolpropane tris(2-methyl-1-aziridinepropionate) (TTMAP), was melt blended with linear polylactic acid (PLA) to make star branched PLA. Adding pyromellitic dianhydride (PMDA) led to long chain branched (LCB) PLA. Mixing torque evolution during melt processing revealed high reactivity of aziridine with the carboxyl end group on PLA and an incomplete reaction of PMDA with the hydroxyl end group. Star-shaped PLA exhibited higher viscosity but no strain hardening in extensional flow while LCB PLA showed significant extensional hardening. Excess TTMAP in the branching reaction resulted in gel formation, which led to failure at low strain in extension. PMDA conversion was estimated based on gelation theory. The strain rate dependence of extensional hardening indicated that the LCB PLA had a low concentration of long chain branched molecules with an H-shaped topology. Unlike current methods used to branch PLA, free radical chemistry or use of an epoxy functional oligomers, our branching strategy produced strain hardening with less increase in shear viscosity. This study provides guidelines for design of polymers with low shear viscosity, which reduces pressure drop in extrusion, combined with strong extensional hardening, which enhances performance in processes that involve melt stretching.
Structural Mechanics and Dynamics Branch
Stefko, George
2003-01-01
The 2002 annual report of the Structural Mechanics and Dynamics Branch reflects the majority of the work performed by the branch staff during the 2002 calendar year. Its purpose is to give a brief review of the branch s technical accomplishments. The Structural Mechanics and Dynamics Branch develops innovative computational tools, benchmark experimental data, and solutions to long-term barrier problems in the areas of propulsion aeroelasticity, active and passive damping, engine vibration control, rotor dynamics, magnetic suspension, structural mechanics, probabilistics, smart structures, engine system dynamics, and engine containment. Furthermore, the branch is developing a compact, nonpolluting, bearingless electric machine with electric power supplied by fuel cells for future "more electric" aircraft. An ultra-high-power-density machine that can generate projected power densities of 50 hp/lb or more, in comparison to conventional electric machines, which generate usually 0.2 hp/lb, is under development for application to electric drives for propulsive fans or propellers. In the future, propulsion and power systems will need to be lighter, to operate at higher temperatures, and to be more reliable in order to achieve higher performance and economic viability. The Structural Mechanics and Dynamics Branch is working to achieve these complex, challenging goals.
Improved β Decay Branching Ratios
Iacob, V. E.; Hardy, J. C.; Golovko, V.
2008-04-01
The work we report here aims at increasing the precision possible in the measurement of branching ratios for superallowed β^+decays. Such highly accurate values are essential in generating precise ft-values for 0^+->0^+decays, which can then be used to test the Standard Model via the unitarity of the Cabibbo-Kobayashi-Maskawa matrix [1]. The required precision is ˜0.1% or better. While this limit was already achieved in the case of ^34Ar [2], it would have been very difficult, if not impossible, to achieve it for other β^+-decays without an upgrade to our acquisition and data-reduction systems. We have thus improved the controls over all the key elements in our experimental set-up: we now have direct control over the dead-time for the singles and coincidence channels and <0.1 mm control over the source-detector distance. In addition, we have extensively studied the efficiency of the β-detector with source-measurements tested against various Monte Carlo programs [3]. We have tested our new acquisition set-up on ^60Co and ^22Na (β^- and β^+ emitters respectively) to validate our new methods. Preliminary results on the two sources are statistically consistent with the expected values. An ^34Ar decay experiment using the new experimental configuration has already been performed and is currently analyzed. [1] J.C. Hardy and I.S. Towner, PRC 71, 055501 (2005) [2] V. Iacob et al., BAPS 52(3)B16; BAPS 52(9)HF3 [3] V. Golovko et al., BAPS 52(9)DH4; this BAPS
Solving the Extended Tree Knapsack Problem with fixed cost flow ...
African Journals Online (AJOL)
the-shelf software, heuristics, dynamic programming, metaheuristics, etc. For the TKP and ETKP models various dynamic programming and branch-and-bound methods are available; see, for example, [4, 5, 9, 15, 16]. Further approaches to the general planning problem is presented in [1]. A depth-first dynamic programming ...
Directory of Open Access Journals (Sweden)
Yaritza Tardo Fernández
2013-02-01
Full Text Available The cultural, technological and eminently social character of the computer programming problems solving process, joined with the complexity and difficulties detected in their teaching, has contributed to increase the concern about the study of the processes of communication, transmission and understanding of computer programming and to attract the attention of a wide scientific community in correspondence with the growing development that this reaches at the present time. That is the reason why this paper has the objective of discover, from the didactic point of view, the integrators axes of an algorithmic logic that solves the contradiction that is revealed in the formative process between the mathematic modeling and their algorithmic systematization to empower an efficient performance of the professionals of Computer Science and Computer Engineering. In this sense a new didactic proposal is based, that consist in an algorithmic logic, in which are specified and explained those essentials processes that should be carry out to solve computer programming problems. Based on the theoretical fundaments, we concluded that these processes constitute didactics moments, required in order to solve the contradiction mentioned before.RESUMENEl carácter eminentemente social, cultural y tecnológico del proceso de resolución de problemas de programación computacional, junto a la complejidad y dificultades detectadas en su enseñanza, han contribuido a despertar la preocupación por el estudio de los procesos de comunicación, transmisión y comprensión de la Programación y a interesar a una amplia comunidad científica en correspondencia con el creciente desarrollo que ésta alcanza en la actualidad. Razón por la cual este trabajo tiene como objetivo que se develen, desde el punto de vista didáctico, los ejes integradores de una lógica algorítmica que sea contentiva de la solución a la contradicción que se revela en el proceso formativo entre la
DEFF Research Database (Denmark)
Hansen, Anders Dohn; Kolind, Esben; Clausen, Jens
. The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test...
Solving Environmental Problems
DEFF Research Database (Denmark)
Grimpe, Christoph; Ørding Olsen, Anders; Sofka, Wolfgang
dispersed. As a result, firms frequently collaborate with international partners. We shed new light on collaborative search strategies led by firms in general and for solving environmental problems in particular. Both topics are largely absent in the extant open innovation literature. Using data from......Recent innovation and strategy research emphasizes the importance of firm’s search for external knowledge to improve innovation performance. We focus on such search strategies within the domain of sustainable innovation in which probl ems are inherently complex and the relevant knowledge is widely...... the European Seventh Framework Programme for research and technological development, our results indicate that the problem solving potential of a search strategy increases with the diversity of existing knowledge of the partners in a consortium and with the experience of the partners involved. Moreover, we...
Annual report, Basic Sciences Branch, FY 1991
Energy Technology Data Exchange (ETDEWEB)
1993-04-01
This report summarizes the progress of the Basic Sciences Branch of the National Renewable Energy Laboratory (NREL) from October 1, 1990, through September 30, 1991. Seven technical sections of the report cover these main areas of NREL's in-house research: Semiconductor Crystal Growth, Amorphous Silicon Research, Polycrystalline Thin Films, III-V High-Efficiency Photovoltaic Cells, Solid-State Theory, Solid-State Spectroscopy, and Superconductivity. Each section explains the purpose and major accomplishments of the work in the context of the US Department of Energy's National Photovoltaic Research Program plans.
Annual report, Basic Sciences Branch, FY 1991
Energy Technology Data Exchange (ETDEWEB)
1993-04-01
This report summarizes the progress of the Basic Sciences Branch of the National Renewable Energy Laboratory (NREL) from October 1, 1990, through September 30, 1991. Seven technical sections of the report cover these main areas of NREL`s in-house research: Semiconductor Crystal Growth, Amorphous Silicon Research, Polycrystalline Thin Films, III-V High-Efficiency Photovoltaic Cells, Solid-State Theory, Solid-State Spectroscopy, and Superconductivity. Each section explains the purpose and major accomplishments of the work in the context of the US Department of Energy`s National Photovoltaic Research Program plans.
Creativity and Problem Solving
DEFF Research Database (Denmark)
Vidal, Rene Victor Valqui
2004-01-01
This paper presents some modern and interdisciplinary concepts about creativity and creative processes of special relevance for Operational Research workers. Central publications in the area Creativity-Operational Research are shortly reviewed. Some creative tools and the Creative Problem Solving...... approach are also discussed. Finally, some applications of these concepts and tools are outlined. Some central references are presented for further study of themes related to creativity or creative tools....
Singh, Chandralekha
2016-01-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 metacognition. The abstract nature of the laws of physics and the chain of reasoning required to draw meanin...
Cartreine, James Albert; Locke, Steven E; Buckey, Jay C; Sandoval, Luis; Hegel, Mark T
2012-09-25
Computer-automated depression interventions rely heavily on users reading text to receive the intervention. However, text-delivered interventions place a burden on persons with depression and convey only verbal content. The primary aim of this project was to develop a computer-automated treatment for depression that is delivered via interactive media technology. By using branching video and audio, the program simulates the experience of being in therapy with a master clinician who provides six sessions of problem-solving therapy. A secondary objective was to conduct a pilot study of the program's usability, acceptability, and credibility, and to obtain an initial estimate of its efficacy. The program was produced in a professional multimedia production facility and incorporates video, audio, graphics, animation, and text. Failure analyses of patient data are conducted across sessions and across problems to identify ways to help the user improve his or her problem solving. A pilot study was conducted with persons who had minor depression. An experimental group (n = 7) used the program while a waitlist control group (n = 7) was provided with no treatment for 6 weeks. All of the experimental group participants completed the trial, whereas 1 from the control was lost to follow-up. Experimental group participants rated the program high on usability, acceptability, and credibility. The study was not powered to detect clinical improvement, although these pilot data are encouraging. Although the study was not powered to detect treatment effects, participants did find the program highly usable, acceptable, and credible. This suggests that the highly interactive and immersive nature of the program is beneficial. Further clinical trials are warranted. ClinicalTrials.gov NCT00906581; http://clinicaltrials.gov/ct2/show/NCT00906581 (Archived by WebCite at http://www.webcitation.org/6A5Ni5HUp).
Branching Out in Roots: Uncovering Form, Function, and Regulation1
Atkinson, Jonathan A.; Rasmussen, Amanda; Traini, Richard; Voß, Ute; Sturrock, Craig; Mooney, Sacha J.; Wells, Darren M.; Bennett, Malcolm J.
2014-01-01
Root branching is critical for plants to secure anchorage and ensure the supply of water, minerals, and nutrients. To date, research on root branching has focused on lateral root development in young seedlings. However, many other programs of postembryonic root organogenesis exist in angiosperms. In cereal crops, the majority of the mature root system is composed of several classes of adventitious roots that include crown roots and brace roots. In this Update, we initially describe the diversity of postembryonic root forms. Next, we review recent advances in our understanding of the genes, signals, and mechanisms regulating lateral root and adventitious root branching in the plant models Arabidopsis (Arabidopsis thaliana), maize (Zea mays), and rice (Oryza sativa). While many common signals, regulatory components, and mechanisms have been identified that control the initiation, morphogenesis, and emergence of new lateral and adventitious root organs, much more remains to be done. We conclude by discussing the challenges and opportunities facing root branching research. PMID:25136060
Learning Matlab a problem solving approach
Gander, Walter
2015-01-01
This comprehensive and stimulating introduction to Matlab, a computer language now widely used for technical computing, is based on an introductory course held at Qian Weichang College, Shanghai University, in the fall of 2014. Teaching and learning a substantial programming language aren’t always straightforward tasks. Accordingly, this textbook is not meant to cover the whole range of this high-performance technical programming environment, but to motivate first- and second-year undergraduate students in mathematics and computer science to learn Matlab by studying representative problems, developing algorithms and programming them in Matlab. While several topics are taken from the field of scientific computing, the main emphasis is on programming. A wealth of examples are completely discussed and solved, allowing students to learn Matlab by doing: by solving problems, comparing approaches and assessing the proposed solutions.
A subgradient-based branch-and-bound algorithm for the capacitated facility location problem
DEFF Research Database (Denmark)
Görtz, Simon; Klose, Andreas
This paper presents a simple branch-and-bound method based on Lagrangean relaxation and subgradient optimization for solving large instances of the capacitated facility location problem (CFLP) to optimality. In order to guess a primal solution to the Lagrangean dual, we average solutions to the L......This paper presents a simple branch-and-bound method based on Lagrangean relaxation and subgradient optimization for solving large instances of the capacitated facility location problem (CFLP) to optimality. In order to guess a primal solution to the Lagrangean dual, we average solutions...... to the Lagrangean subproblem. Branching decisions are then based on this estimated (fractional) primal solution. Extensive numerical results reveal that the method is much more faster and robust than other state-of-the-art methods for solving the CFLP exactly....
Solving Rational Expectations Models Using Excel
Strulik, Holger
2004-01-01
Simple problems of discrete-time optimal control can be solved using a standard spreadsheet software. The employed-solution method of backward iteration is intuitively understandable, does not require any programming skills, and is easy to implement so that it is suitable for classroom exercises with rational-expectations models. The author…
Solving Wicked Problems through Action Learning
Crul, Liselore
2014-01-01
This account of practice outlines the Oxyme Action Learning Program which was conducted as part of the Management Challenge in my final year of the MSc in Coaching and Behavioral Change at Henley Business School. The central research questions were: (1) how action learning can help to solve wicked problems and (2) what the effect of an action…
Efficient Implementation Of Branch-And-Bound Method On Desktop Grids
Directory of Open Access Journals (Sweden)
Bo Tian
2014-01-01
Full Text Available The Berkeley Open Infrastructure for Network Computing (BOINC is an opensource middleware system for volunteer and desktop grid computing. In this paper we propose BNBTEST, a BOINC version of distributed branch and bound method. The crucial issues of distributed branch-and-bound method are traversing the search tree and loading balance. We developed subtaskspackaging method and three dierent subtasks' distribution strategies to solve these.
Starostin, Nikolai P.; Vasileva, Maria A.; Andreev, Boris I.
2017-11-01
The thermal process of welding a saddle branch to a polyethylene pipe is considered with the heat of the phase transition taken into account. The corresponding three-dimensional nonlinear equation of thermal conductivity is solved by the finite element method in a complex domain. The technological operations necessary for welding the saddle branch to the polyethylene pipe at air temperatures below standard are defined based on the study of the dynamics of the temperature field during welding at various ambient temperatures.
Multiple pathways regulate shoot branching
Directory of Open Access Journals (Sweden)
Catherine eRameau
2015-01-01
Full Text Available Shoot branching patterns result from the spatio-temporal regulation of axillary bud outgrowth. Numerous endogenous, developmental and environmental factors are integrated at the bud and plant levels to determine numbers of growing shoots. Multiple pathways that converge to common integrators are most probably involved. We propose several pathways involving not only the classical hormones auxin, cytokinins and strigolactones, but also other signals with a strong influence on shoot branching such as gibberellins, sugars or molecular actors of plant phase transition. We also deal with recent findings about the molecular mechanisms and the pathway involved in the response to shade as an example of an environmental signal controlling branching. We propose the TCP transcription factor TB1/BRC1 and the polar auxin transport stream in the stem as possible integrators of these pathways. We finally discuss how modeling can help to represent this highly dynamic system by articulating knowledges and hypothesis and calculating the phenotype properties they imply.
Directory of Open Access Journals (Sweden)
Bisheng He
2014-01-01
Full Text Available A time-space network based optimization method is designed for high-speed rail train timetabling problem to improve the service level of the high-speed rail. The general time-space path cost is presented which considers both the train travel time and the high-speed rail operation requirements: (1 service frequency requirement; (2 stopping plan adjustment; and (3 priority of train types. Train timetabling problem based on time-space path aims to minimize the total general time-space path cost of all trains. An improved branch-and-price algorithm is applied to solve the large scale integer programming problem. When dealing with the algorithm, a rapid branching and node selection for branch-and-price tree and a heuristic train time-space path generation for column generation are adopted to speed up the algorithm computation time. The computational results of a set of experiments on China’s high-speed rail system are presented with the discussions about the model validation, the effectiveness of the general time-space path cost, and the improved branch-and-price algorithm.
Branch prediction in the pentium family
DEFF Research Database (Denmark)
Fog, Agner
1998-01-01
How the branch prediction mechanism in the Pentium has been uncovered with all its quirks, and the incredibly more effective branch prediction in the later versions.......How the branch prediction mechanism in the Pentium has been uncovered with all its quirks, and the incredibly more effective branch prediction in the later versions....
On the Applicability of Lower Bounds for Solving Rectilinear
DEFF Research Database (Denmark)
Clausen, Jens; Karisch, Stefan E.; Perregaard, M.
1998-01-01
The quadratic assignment problem (QAP) belongs to the hard core of NP-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not sufficient....... Recently, lower bounds based on decomposition were proposed for the so called rectilinear QAP that proved to be the strongest for a large class of problem instances. We investigate the strength of these bounds when applied not only at the root node of a search tree but as the bound function used...... in a Branch-and-Bound code solving large scale QAPs....
Solving Differential Equations in R: Package deSolve
In this paper we present the R package deSolve to solve initial value problems (IVP) written as ordinary differential equations (ODE), differential algebraic equations (DAE) of index 0 or 1 and partial differential equations (PDE), the latter solved using the method of lines appr...
Solving Differential Equations in R: Package deSolve
Soetaert, K.E.R.; Petzoldt, T.; Setzer, R.W.
2010-01-01
In this paper we present the R package deSolve to solve initial value problems (IVP) written as ordinary differential equations (ODE), differential algebraic equations (DAE) of index 0 or 1 and partial differential equations (PDE), the latter solved using the method of lines approach. The
A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
DEFF Research Database (Denmark)
Masson, Renaud; Røpke, Stefan; Lehuédé, Fabien
2014-01-01
for the PDPS and a branch-and-cut-and-price algorithm to solve it. The pricing sub-problem, an Elementary Shortest Path Problem with Resource Constraints (ESPPRC), is solved with a labeling algorithm enhanced with efficient dominance rules. Three families of valid inequalities are used to strengthen...
Branching diffusion with particle interactions
Engländer, János; Zhang, Liang
2016-01-01
A $d$-dimensional branching diffusion, $Z$, is investigated, where the linear attraction or repulsion between particles is competing with an Ornstein-Uhlenbeck drift, with parameter $b$ (we take $b>0$ for inward O-U and $b0$) or repulsion ($\\gamma 0$, while escapes to infinity exponentially fast (rate $|b|$) when $b
Risk Factor Assessment Branch (RFAB)
The Risk Factor Assessment Branch (RFAB) focuses on the development, evaluation, and dissemination of high-quality risk factor metrics, methods, tools, technologies, and resources for use across the cancer research continuum, and the assessment of cancer-related risk factors in the population.
Directory of Open Access Journals (Sweden)
Lee Shaish
astogeny in S. pistillata is a regulated process expressed through programmed events and not directly related to simple energy trade-off principles or to environmental conditions, and that branch polarity and apical dominance do not dictate colony astogeny. Therefore, plasticity and astogenic disparities encompass a diversity of genetic (fixed and flexible induced responses.
Energy Technology Data Exchange (ETDEWEB)
Miller, A. [Univ. of New Brunswick, Fredericton, New Brunswick (Canada)
1999-06-01
Human influences create both environmental problems and barriers to effective policy aimed at addressing those problems. In effect, environmental managers manage people as much as they manage the environment. Therefore, they must gain an understanding of the psychological and sociopolitical dimensions of environmental problems that they are attempting to resolve. The author reappraises conventional analyses of environmental problems using lessons from the psychosocial disciplines. The author combines the disciplines of ecology, political sociology and psychology to produce a more adaptive approach to problem-solving that is specifically geared toward the environmental field. Numerous case studies demonstrate the practical application of theory in a way that is useful to technical and scientific professionals as well as to policymakers and planners.
Solved problems in electromagnetics
Salazar Bloise, Félix; Bayón Rojo, Ana; Gascón Latasa, Francisco
2017-01-01
This book presents the fundamental concepts of electromagnetism through problems with a brief theoretical introduction at the beginning of each chapter. The present book has a strong didactic character. It explains all the mathematical steps and the theoretical concepts connected with the development of the problem. It guides the reader to understand the employed procedures to learn to solve the exercises independently. The exercises are structured in a similar way: The chapters begin with easy problems increasing progressively in the level of difficulty. This book is written for students of physics and engineering in the framework of the new European Plans of Study for Bachelor and Master and also for tutors and lecturers. .
Linear and Branching Formats in Culture Assimilator Training
Malpass, Roy S.; Salancik, Gerald R.
1977-01-01
Defines the "branching format" of training materials as materials not requiring an absolute judgement of appropriateness of alternatives and the "linear format" as materials requiring an independent evaluation of each alternative. Tests these contrasting formats for effectiveness in cross cultural training programs. Available from: International…
Branching processes in disease epidemics
Singh, Sarabjeet
Branching processes have served as a model for chemical reactions, biological growth processes and contagion (of disease, information or fads). Through this connection, these seemingly different physical processes share some common universalities that can be elucidated by analyzing the underlying branching process. In this thesis, we focus on branching processes as a model for infectious diseases spreading between individuals belonging to different populations. The distinction between populations can arise from species separation (as in the case of diseases which jump across species) or spatial separation (as in the case of disease spreading between farms, cities, urban centers, etc). A prominent example of the former is zoonoses -- infectious diseases that spill from animals to humans -- whose specific examples include Nipah virus, monkeypox, HIV and avian influenza. A prominent example of the latter is infectious diseases of animals such as foot and mouth disease and bovine tuberculosis that spread between farms or cattle herds. Another example of the latter is infectious diseases of humans such as H1N1 that spread from one city to another through migration of infectious hosts. This thesis consists of three main chapters, an introduction and an appendix. The introduction gives a brief history of mathematics in modeling the spread of infectious diseases along with a detailed description of the most commonly used disease model -- the Susceptible-Infectious-Recovered (SIR) model. The introduction also describes how the stochastic formulation of the model reduces to a branching process in the limit of large population which is analyzed in detail. The second chapter describes a two species model of zoonoses with coupled SIR processes and proceeds into the calculation of statistics pertinent to cross species infection using multitype branching processes. The third chapter describes an SIR process driven by a Poisson process of infection spillovers. This is posed as a
Solving unit commitment and economic load dispatch problems ...
African Journals Online (AJOL)
This paper introduces Genetic Algorithm (GA) or Dynamic Programming (DP) to solve UC and then Shuffled BAT (BAT) technique as an evolutionary based approach is presented to solve the constrained ELD problem of thermal plants depending on the results obtained from UC solution. The IEEE 30 bus system is used to ...
(Eds.). Resource-bounded problem solving (Dagstuhl Seminar 14341)
Haxhimusa, Y.; Rooij, I.J.E.I. van; Varma, S.; Wareham, H.T.
2014-01-01
This report documents the program and the outcomes of Dagstuhl Seminar 14341 'Resource-bounded Problem Solving'. This seminar is a successor to Dagstuhl Seminar 11351: 'Computer Science & Problem Solving: New Foundations', held in August 2011, which was the first Dagstuhl event to bring together
Palacio-Cayetano, Joycelin
"Problem-solving through reflective thinking should be both the method and valuable outcome of science instruction in America's schools" proclaimed John Dewey (Gabel, 1995). If the development of problem-solving is a primary goal of science education, more problem-solving opportunities must be an integral part of K-16 education. To examine the effective use of technology in developing and assessing problem-solving skills, a problem-solving authoring, learning, and assessment software, the UCLA IMMEX Program-Interactive Multimedia Exercises-was investigated. This study was a twenty-week quasi-experimental study that was implemented as a control-group time series design among 120 tenth grade students. Both the experimental group (n = 60) and the control group (n = 60) participated in a problem-based learning curriculum; however, the experimental group received regular intensive experiences with IMMEX problem-solving and the control group did not. Problem-solving pretest and posttest were administered to all students. The instruments used were a 35-item Processes of Biological Inquiry Test and an IMMEX problem-solving assessment test, True Roots. Students who participated in the IMMEX Program achieved significant (p level of analytical and integration skills; and (3) focused search strategy coupled with superior discrimination, analytical, and integration skills. The strategies of students who were successful and unsuccessful solving IMMEX problems were consistent with those of expert and novice problem solvers identified in the literature on problem-solving.
Branched endografts for thoracoabdominal aneurysms.
Greenberg, Roy; Eagleton, Matthew; Mastracci, Tara
2010-12-01
Endovascular management of thoracoabdominal aneurysms has been studied since 2001, with marked advances allowing for the treatment of complex anatomic situations including chronic aortic dissections, tortuous anatomy, and extensive aneurysms that involve the visceral segment, aortic arch, and iliacs as well. However, the technology is not widely disseminated, and a thorough understanding of the engineering principles, imaging techniques, and devices available is required. Reinforced fenestrated branches coupled with balloon expandable stent grafts, and side-arm branch designs mated with self-expanding stent grafts have been used. Pure fenestrated designs were used for juxtarenal aneurysms, whereas thoracoabdominal aneurysms were treated with reinforced fenestrated branches or hybrid devices including side-arm branches and reinforced fenestrated branches. Intraoperative fusion techniques have been used since 2009, whereby preoperative computed tomographic data are fused with intraoperative fluoroscopy. Long-term survival in accordance with extent of disease was assessed with life table analysis techniques, and differences were analyzed using the log rank test. Intermediate-term data pertaining to patency related to both types of branches and paraplegia have been evaluated and previously published. A total of 406 patients with thoracoabdominal aneurysms and 227 patients with juxtarenal aneurysms have been enrolled in a prospective study. Perioperative and 2-year survival were most closely related to extent of initial disease and were estimated to be 1.8% and 82% for juxtarenal aneurysms, 2.3% and 82% for type IV, and 5.2% and 74% for type II and III thoracoabdominal aneurysms at 24 months, respectively. When patients undergoing endovascular repair (ER group) were matched with those having contemporary surgical repair (SR group) for anatomic disease extent, mortality was similar at 30 days (5.7% ER vs 8.3% SR; P = .2) and at 12 months (15.6% ER vs 15.9% SR; P = .9
Solid State Photovoltaic Research Branch
Energy Technology Data Exchange (ETDEWEB)
1990-09-01
This report summarizes the progress of the Solid State Photovoltaic Research Branch of the Solar Energy Research Institute (SERI) from October 1, 1988, through September 30,l 1989. Six technical sections of the report cover these main areas of SERIs in-house research: Semiconductor Crystal Growth, Amorphous Silicon Research, Polycrystalline Thin Films, III-V High-Efficiency Photovoltaic Cells, Solid-State Theory, and Laser Raman and Luminescence Spectroscopy. Sections have been indexed separately for inclusion on the data base.
Artificial Intelligence Research Branch future plans
Stewart, Helen (Editor)
1992-01-01
This report contains information on the activities of the Artificial Intelligence Research Branch (FIA) at NASA Ames Research Center (ARC) in 1992, as well as planned work in 1993. These activities span a range from basic scientific research through engineering development to fielded NASA applications, particularly those applications that are enabled by basic research carried out in FIA. Work is conducted in-house and through collaborative partners in academia and industry. All of our work has research themes with a dual commitment to technical excellence and applicability to NASA short, medium, and long-term problems. FIA acts as the Agency's lead organization for research aspects of artificial intelligence, working closely with a second research laboratory at the Jet Propulsion Laboratory (JPL) and AI applications groups throughout all NASA centers. This report is organized along three major research themes: (1) Planning and Scheduling: deciding on a sequence of actions to achieve a set of complex goals and determining when to execute those actions and how to allocate resources to carry them out; (2) Machine Learning: techniques for forming theories about natural and man-made phenomena; and for improving the problem-solving performance of computational systems over time; and (3) Research on the acquisition, representation, and utilization of knowledge in support of diagnosis design of engineered systems and analysis of actual systems.
Electrostatically anchored branched brush layers.
Liu, Xiaoyan; Dedinaite, Andra; Rutland, Mark; Thormann, Esben; Visnevskij, Ceslav; Makuska, Ricardas; Claesson, Per M
2012-11-06
A novel type of block copolymer has been synthesized. It consists of a linear cationic block and an uncharged bottle-brush block. The nonionic bottle-brush block contains 45 units long poly(ethylene oxide) side chains. This polymer was synthesized with the intention of creating branched brush layers firmly physisorbed to negatively charged surfaces via the cationic block, mimicking the architecture (but not the chemistry) of bottle-brush molecules suggested to be present on the cartilage surface, and contributing to the efficient lubrication of synovial joints. The adsorption properties of the diblock copolymer as well as of the two blocks separately were studied on silica surfaces using quartz crystal microbalance with dissipation monitoring (QCM-D) and optical reflectometry. The adsorption kinetics data highlight that the diblock copolymers initially adsorb preferentially parallel to the surface with both the cationic block and the uncharged bottle-brush block in contact with the surface. However, as the adsorption proceeds, a structural change occurs within the layer, and the PEO bottle-brush block extends toward solution, forming a surface-anchored branched brush layer. As the adsorption plateau is reached, the diblock copolymer layer is 46-48 nm thick, and the water content in the layer is above 90 wt %. The combination of strong electrostatic anchoring and highly hydrated branched brush structures provide strong steric repulsion, low friction forces, and high load bearing capacity. The strong electrostatic anchoring also provides high stability of preadsorbed layers under different ionic strength conditions.
Solving the Antibiotic Crisis.
Wright, Gerard D
2015-02-13
Antibiotics are essential for both treating and preventing infectious diseases. Paradoxically, despite their importance as pillars of modern medicine, we are in danger of losing antibiotics because of the evolution and dissemination of resistance mechanisms throughout all pathogenic microbes. This fact, coupled with an inability to bring new drugs to market at a pace that matches resistance, has resulted in a crisis of global proportion. Solving this crisis requires the actions of many stakeholders, but chemists, chemical biologists, and microbiologists must drive the scientific innovation that is required to maintain our antibiotic arsenal. This innovation requires (1) a deep understanding of the evolution and reservoirs of resistance; (2) full knowledge of the molecular mechanisms of antibiotic action and resistance; (3) the discovery of chemical and genetic probes of antibiotic action and resistance; (4) the integration of systems biology into antibiotic discovery; and (5) the discovery of new antimicrobial chemical matter. Addressing these pressing scientific gaps will ensure that we can meet the antibiotic crisis with creativity and purpose.
Automated Test Assembly Using lp_Solve Version 5.5 in R
Diao, Qi; van der Linden, Wim J.
2011-01-01
This article reviews the use of the software program lp_solve version 5.5 for solving mixed-integer automated test assembly (ATA) problems. The program is freely available under Lesser General Public License 2 (LGPL2). It can be called from the statistical language R using the lpSolveAPI interface. Three empirical problems are presented to…
Automated test assembly using lp_solve version 5.5 in R
Diao, Qi; van der Linden, Willem J.
2011-01-01
This article reviews the use of the software program lp_solve version 5.5 for solving mixed-integer automated test assembly (ATA) problems. The program is freely available under Lesser General Public License 2 (LGPL2). It can be called from the statistical language R using the lpSolveAPI interface.
Workshop on Branching Processes and Their Applications
Gonzalez Velasco, Miguel; Martinez, Rodrigo; Molina, Manuel
2010-01-01
Contains papers presented at the Workshop on Branching Processes and Their Applications (WBPA09), held in Badajoz, Spain, April 20-23, 2009, which deal with theoretical and practical aspects of branching process theory
Coulomb branch localization in quiver quantum mechanics
Energy Technology Data Exchange (ETDEWEB)
Ohta, Kazutoshi; Sasai, Yuya [Institute of Physics, Meiji Gakuin University,1518 Kamikurata-cho, Yokohama, 244-8539 (Japan)
2016-02-16
We show how to exactly calculate the refined indices of N=4U(1)×U(N) supersymmetric quiver quantum mechanics in the Coulomb branch by using the localization technique. The Coulomb branch localization is discussed from the viewpoint of both non-linear and gauged linear sigma models. A classification of fixed points in the Coulomb branch differs from one in the Higgs branch, but the derived indices completely agree with the results which were obtained by the localization in the Higgs branch. In the Coulomb branch localization, the refined indices can be written as a summation over different sets of the Coulomb branch fixed points. We also discuss a space-time picture of the fixed points in the Coulomb branch.
Large sliding contact along branched discontinuities with X-FEM
Siavelis, Maximilien; Guiton, Martin L. E.; Massin, Patrick; Moës, Nicolas
2013-07-01
The extended finite element method (X-FEM) has been developed to minimize requirements on the mesh in a problem with a displacement discontinuity. We present the development carried out to take advantage of the X-FEM approach in simplifying the meshing of complex 3D networks of discontinuities with junctions. Contact with large sliding along the branched discontinuities is discussed. Solutions are proposed and discussed to solve some matrix conditioning issues. Several examples are presented in this paper in order to prove the efficiency of the proposed approach.
Parallel Branch-and-Bound Methods for the Job Shop Scheduling
DEFF Research Database (Denmark)
Clausen, Jens; Perregaard, Michael
1998-01-01
Job-shop scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been branch-and-bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions...
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands
DEFF Research Database (Denmark)
Christiansen, Christian Holk; Lysgaard, Jens; Wøhlk, Sanne
2009-01-01
We address the Capacitated Arc Routing Problem with Stochastic Demands (CARPSD), which we formulate as a Set Partitioning Problem. The CARPSD is solved by a Branch-and-Price algorithm, which we apply without graph transformation. The demand's stochastic nature is incorporated into the pricing...
The Effects of a Branch Campus
Lien, Donald; Wang, Yaqin
2012-01-01
We examine the effects of a branch campus on the social welfare of the host country and the foreign university. Overall, we find that a branch campus increases both the domestic social welfare (measured by the aggregate student utility) and the tuition revenue of the foreign university. The effect of a branch campus on the brain drain is…
Introduction of Branching Degrees of Octane Isomers.
Perdih, Anton
2016-01-01
The concept of branching degrees is introduced. In the case of octane isomers it is derived from the values of a set of their physicochemical properties, calculating for each isomer the average of the normalized values and these averages are defined as branching degrees of octane isomers. The sequence of these branching degrees of octane isomers does not differ much from the »regular« one defined earlier. 2,2-Dimethylhexane appears to be less branched than 3,4-dimethylhexane and 3-ethyl, 2-methylpentane, whereas 2,3,4-trimethylpentane appears to be less branched than 3-ethyl, 3-methylpentane. While the increasing number of branches gives rise to increasing branching degrees, the peripheral position of branches and the separation between branches decreases the value of the branching degree. The central position of branches increases it. A bigger branch increases it more than a smaller one. The quantification of these structural features and their correlations with few indices is given as well.
Structural dynamics branch research and accomplishments
1990-01-01
Summaries are presented of fiscal year 1989 research highlights from the Structural Dynamics Branch at NASA Lewis Research Center. Highlights from the branch's major work areas include aeroelasticity, vibration control, dynamic systems, and computation structural methods. A listing of the fiscal year 1989 branch publications is given.
RUSSIAN HOUSING AND COMMUNAL ECONOMY BRANCH REFORMATION AND DEVELOPMENT PROSPECTS
Directory of Open Access Journals (Sweden)
K. A. Ivanov
2011-01-01
Full Text Available Implementation of socially oriented principles and market tools is main direction of Russian housing and communal economy branch reformation aimed at proving the population with decent housing conditions. At present, owners of dwelling facilities are bound to maintain and repair them at their own. If dwellings were privatized in houses that were to be overhauled, respective current and capital repairs work is to be carried out by the state in accordance with norms. Housing and communal economy branch reformation assistance Fund and Program are created in the country, the latter being organized on the co-financing principle (major part of means needed for the repairs is provided by Fund, lesser part – by regional and local governments, some 10% – by the owners. Coordinated activities of governmental, scientific and business organizations as well as dwelling owners are needed for further sustainable development of the branch.
Khotimah, Rita Pramujiyanti; Masduki
2016-01-01
Differential equations is a branch of mathematics which is closely related to mathematical modeling that arises in real-world problems. Problem solving ability is an essential component to solve contextual problem of differential equations properly. The purposes of this study are to describe contextual teaching and learning (CTL) model in…
Solving complex fisheries management problems
DEFF Research Database (Denmark)
Petter Johnsen, Jahn; Eliasen, Søren Qvist
2011-01-01
A crucial issue for the new EU common fisheries policy is how to solve the discard problem. Through a study of the institutional set up and the arrangements for solving the discard problem in Denmark, the Faroe Islands, Iceland and Norway, the article identifies the discard problem as related...... to both natural, other material and to cultural conditions. Hence, solving the discard problem requires not only technical and regulatory instruments, but also arenas and structures that allow and facilitate processes of cultural change....
FY 1991 Measurements and Characterization Branch annual report
Energy Technology Data Exchange (ETDEWEB)
Osterwald, C.R.; Dippo, P.C. (eds.)
1992-11-01
The Measurements and Characterization Branch of the National Renewable Laboratory (NREL) provides comprehensive photovoltaic (PV) materials, devices, characterization, measurement, fabrication, modeling research, and support for the international PV research community, in the context of the US Department of Energy's Photovoltaic Research Program goals. This report summarizes the progress of the Branch from 31 January 1991 through 31 January 1992. The eight technical sections present a succinct overview of the capabilities and accomplishments of each group in the Branch. The Branch is comprised of the following groups: Surface and interface Analysis; Materials Characterization; Device Development; Electro-optical Characterization; Advanced PV module Performance and Reliability Research; Cell Performance Characterization; Surface Interactions, Modification, and Stability; and FTIR Spectroscopic Research. The including measurements and tests of PV materials, cells, submodules, and modules. The report contains a comprehensive bibliography of 77 branch originated journal and conference publications, which were authored in collaboration with, or in support of, approximately 135 university, industrial, government, and in-house research groups.
Problem Solving vis Soap Bubbles
Bader, William A.
1975-01-01
Describes the use of a scientific phenomenon related to the concept of surface tension as an intriguing vehicle to direct attention to useful problem solving techniques. The need for a definite building process in attempts to solve mathematical problems is stressed. (EB)
Difficulties in Genetics Problem Solving.
Tolman, Richard R.
1982-01-01
Examined problem-solving strategies of 30 high school students as they solved genetics problems. Proposes a new sequence of teaching genetics based on results: meiosis, sex chromosomes, sex determination, sex-linked traits, monohybrid and dihybrid crosses (humans), codominance (humans), and Mendel's pea experiments. (JN)
Crime Solving Techniques: Training Bulletin.
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…
Problem Solving, Scaffolding and Learning
Lin, Shih-Yin
2012-01-01
Helping students to construct robust understanding of physics concepts and develop good solving skills is a central goal in many physics classrooms. This thesis examine students' problem solving abilities from different perspectives and explores strategies to scaffold students' learning. In studies involving analogical problem solving…
Chiral methyl-branched pheromones.
Ando, Tetsu; Yamakawa, Rei
2015-07-01
Insect pheromones are some of the most interesting natural products because they are utilized for interspecific communication between various insects, such as beetles, moths, ants, and cockroaches. A large number of compounds of many kinds have been identified as pheromone components, reflecting the diversity of insect species. While this review deals only with chiral methyl-branched pheromones, the chemical structures of more than one hundred non-terpene compounds have been determined by applying excellent analytical techniques. Furthermore, their stereoselective syntheses have been achieved by employing trustworthy chiral sources and ingenious enantioselective reactions. The information has been reviewed here not only to make them available for new research but also to understand the characteristic chemical structures of the chiral pheromones. Since biosynthetic studies are still limited, it might be meaningful to examine whether the structures, particularly the positions and configurations of the branched methyl groups, are correlated with the taxonomy of the pheromone producers and also with the function of the pheromones in communication systems.
Yamamoto, Keisuke; Tsuchisaka, Atsunari; Yukawa, Hideaki
Branched-chain amino acids (BCAAs), viz., L-isoleucine, L-leucine, and L-valine, are essential amino acids that cannot be synthesized in higher organisms and are important nutrition for humans as well as livestock. They are also valued as synthetic intermediates for pharmaceuticals. Therefore, the demand for BCAAs in the feed and pharmaceutical industries is increasing continuously. Traditional industrial fermentative production of BCAAs was performed using microorganisms isolated by random mutagenesis. A collection of these classical strains was also scientifically useful to clarify the details of the BCAA biosynthetic pathways, which are tightly regulated by feedback inhibition and transcriptional attenuation. Based on this understanding of the metabolism of BCAAs, it is now possible for us to pursue strains with higher BCAA productivity using rational design and advanced molecular biology techniques. Additionally, systems biology approaches using augmented omics information help us to optimize carbon flux toward BCAA production. Here, we describe the biosynthetic pathways of BCAAs and their regulation and then overview the microorganisms developed for BCAA production. Other chemicals, including isobutanol, i.e., a second-generation biofuel, can be synthesized by branching the BCAA biosynthetic pathways, which are also outlined.
PICO: An Object-Oriented Framework for Branch and Bound
Energy Technology Data Exchange (ETDEWEB)
ECKSTEIN,JONATHAN; HART,WILLIAM E.; PHILLIPS,CYNTHIA A.
2000-12-01
This report describes the design of PICO, a C++ framework for implementing general parallel branch-and-bound algorithms. The PICO framework provides a mechanism for the efficient implementation of a wide range of branch-and-bound methods on an equally wide range of parallel computing platforms. We first discuss the basic architecture of PICO, including the application class hierarchy and the package's serial and parallel layers. We next describe the design of the serial layer, and its central notion of manipulating subproblem states. Then, we discuss the design of the parallel layer, which includes flexible processor clustering and communication rates, various load balancing mechanisms, and a non-preemptive task scheduler running on each processor. We describe the application of the package to a branch-and-bound method for mixed integer programming, along with computational results on the ASCI Red massively parallel computer. Finally we describe the application of the branch-and-bound mixed-integer programming code to a resource constrained project scheduling problem for Pantex.
Solving Nonlinear Euler Equations with Arbitrary Accuracy
Dyson, Rodger W.
2005-01-01
A computer program that efficiently solves the time-dependent, nonlinear Euler equations in two dimensions to an arbitrarily high order of accuracy has been developed. The program implements a modified form of a prior arbitrary- accuracy simulation algorithm that is a member of the class of algorithms known in the art as modified expansion solution approximation (MESA) schemes. Whereas millions of lines of code were needed to implement the prior MESA algorithm, it is possible to implement the present MESA algorithm by use of one or a few pages of Fortran code, the exact amount depending on the specific application. The ability to solve the Euler equations to arbitrarily high accuracy is especially beneficial in simulations of aeroacoustic effects in settings in which fully nonlinear behavior is expected - for example, at stagnation points of fan blades, where linearizing assumptions break down. At these locations, it is necessary to solve the full nonlinear Euler equations, and inasmuch as the acoustical energy is of the order of 4 to 5 orders of magnitude below that of the mean flow, it is necessary to achieve an overall fractional error of less than 10-6 in order to faithfully simulate entropy, vortical, and acoustical waves.
Directory of Open Access Journals (Sweden)
Chao Lu
2016-01-01
Full Text Available This paper is concerned with the scheduling of Electrical Multiple Units (EMUs under the condition of their utilization on one sector or within several interacting sectors. Based on the introduction of the train connection graph which describes the possible connection relationship between trains, the integer programming model of EMU circulation planning is constructed. In order to analyzing the resolution of the model, a heuristic which shares the characteristics with the existing methods is introduced first. This method consists of two stages: one is a greedy strategy to construct a feasible circulation plan fragment, and another is to apply a stochastic disturbance to it to generate a whole feasible solution or get a new feasible solution. Then, an exact branch and bound method which is based on graph designing is proposed. Due to the complexity, the lower bound is computed through a polynomial approximation algorithm which is a modification from the one solving the degree constraint minimum 1-tree problem. Then, a branching strategy is designed to cope with the maintenance constraints. Finally, we report extensive computational results on a railway corridor in which the sectors possess the basic feature of railway networks.
Branching process models of cancer
Durrett, Richard
2015-01-01
This volume develops results on continuous time branching processes and applies them to study rate of tumor growth, extending classic work on the Luria-Delbruck distribution. As a consequence, the authors calculate the probability that mutations that confer resistance to treatment are present at detection and quantify the extent of tumor heterogeneity. As applications, the authors evaluate ovarian cancer screening strategies and give rigorous proofs for results of Heano and Michor concerning tumor metastasis. These notes should be accessible to students who are familiar with Poisson processes and continuous time. Richard Durrett is mathematics professor at Duke University, USA. He is the author of 8 books, over 200 journal articles, and has supervised more than 40 Ph.D. students. Most of his current research concerns the applications of probability to biology: ecology, genetics, and most recently cancer.
2010-11-01
By discovering the first double star where a pulsating Cepheid variable and another star pass in front of one another, an international team of astronomers has solved a decades-old mystery. The rare alignment of the orbits of the two stars in the double star system has allowed a measurement of the Cepheid mass with unprecedented accuracy. Up to now astronomers had two incompatible theoretical predictions of Cepheid masses. The new result shows that the prediction from stellar pulsation theory is spot on, while the prediction from stellar evolution theory is at odds with the new observations. The new results, from a team led by Grzegorz Pietrzyński (Universidad de Concepción, Chile, Obserwatorium Astronomiczne Uniwersytetu Warszawskiego, Poland), appear in the 25 November 2010 edition of the journal Nature. Grzegorz Pietrzyński introduces this remarkable result: "By using the HARPS instrument on the 3.6-metre telescope at ESO's La Silla Observatory in Chile, along with other telescopes, we have measured the mass of a Cepheid with an accuracy far greater than any earlier estimates. This new result allows us to immediately see which of the two competing theories predicting the masses of Cepheids is correct." Classical Cepheid Variables, usually called just Cepheids, are unstable stars that are larger and much brighter than the Sun [1]. They expand and contract in a regular way, taking anything from a few days to months to complete the cycle. The time taken to brighten and grow fainter again is longer for stars that are more luminous and shorter for the dimmer ones. This remarkably precise relationship makes the study of Cepheids one of the most effective ways to measure the distances to nearby galaxies and from there to map out the scale of the whole Universe [2]. Unfortunately, despite their importance, Cepheids are not fully understood. Predictions of their masses derived from the theory of pulsating stars are 20-30% less than predictions from the theory of the
Vegetation survey of PEN Branch wetlands
Energy Technology Data Exchange (ETDEWEB)
1991-01-01
A survey was conducted of vegetation along Pen Branch Creek at Savannah River Site (SRS) in support of K-Reactor restart. Plants were identified to species by overstory, understory, shrub, and groundcover strata. Abundance was also characterized and richness and diversity calculated. Based on woody species basal area, the Pen Branch delta was the most impacted, followed by the sections between the reactor and the delta. Species richness for shrub and groundcover strata were also lowest in the delta. No endangered plant species were found. Three upland pine areas were also sampled. In support of K Reactor restart, this report summarizes a study of the wetland vegetation along Pen Branch. Reactor effluent enters Indian Grove Branch and then flows into Pen Branch and the Pen Branch Delta.
How to solve mathematical problems
Wickelgren, Wayne A
1995-01-01
Seven problem-solving techniques include inference, classification of action sequences, subgoals, contradiction, working backward, relations between problems, and mathematical representation. Also, problems from mathematics, science, and engineering with complete solutions.
Directory of Open Access Journals (Sweden)
Amélie ePinet
2015-02-01
Full Text Available Plant branching is a key process in the yield elaboration of winter oilseed rape (WOSR. It is also involved in plant tolerance to flower damage because it allows the setting of new fertile inflorescences. Here we characterize the changes in the branching and distribution of the number of pods between primary and secondary inflorescences in response to floral bud clippings. Then we investigate the impacts of the modifications in branching on the biomass allocation and its consequence on the crop productivity (harvest index. These issues were addressed on plants with contrasted architecture and branching potential, using three genotypes (Exocet, Pollen, and Gamin grown under two levels of nitrogen fertilization. Clipping treatments of increasing intensities were applied to either inflorescences or flower buds.We were able to show that restoration of the number of pods after clipping is the main lever for the compensation. Genotypes presented different behaviors in branching and biomass allocation as a function of clipping treatments. The number of fertile ramifications increased for the high intensities of clipping. In particular, the growth of secondary ramifications carried by branches developed before clipping has been observed. The proportions of yield and of number of pods carried by these secondary axes increased and became almost equivalent to the proportion carried by primary inflorescences. In terms of biomass allocation, variations have also been evidenced in the relationship between pod dry mass on a given axis and the number of pods set, while the shoot/root ratio was not modified. The harvest index presented different responses: it decreased after flower buds clipping, while it was maintained after the clipping of the whole inflorescences. The results are discussed relative to their implications regarding the identification of interesting traits to be target in breeding programs in order to improve WOSR tolerance.
Callejo, Maria Luz
1994-01-01
Reports, in French, an investigation on the use of graphic representations in problem-solving tasks of the type in Spanish Mathematical Olympiads. Analysis showed that the choice and interpretation of the first graphic representation played a decisive role in the discovery of the solution. (34 references) (Author/MKR)
Solving the pre-marshalling problem to optimality with A* and IDA*
DEFF Research Database (Denmark)
Tierney, Kevin; Pacino, Dario; Voß, Stefan
2017-01-01
We present a novel solution approach to the container pre-marshalling problem using the A* and IDA* algorithms combined with several novel branching and symmetry breaking rules that significantly increases the number of pre-marshalling instances that can be solved to optimality. A* and IDA...
Molecular Analysis of Salivary Gland Branching Morphogenesis
National Research Council Canada - National Science Library
Sakai, Takayoshi; Larsen, Melinda; Kogo, Mikihiko; Yamada, Kenneth M
2004-01-01
.... This mini-review describes a recently developed and tested set of approaches for identifying and characterizing molecules essential for branching morphogenesis and other developmental processes...
Axis deviation without left bundle branch block.
Patanè, Salvatore; Marte, Filippo; Mancuso, Antonia
2010-04-15
It has been rarely reported changing axis deviation in the presence of left bundle branch block also during atrial fibrillation and with acute myocardial infarction too. It has also been rarely reported changing axis deviation with changing bundle branch block with onset of atrial fibrillation during acute myocardial infarction. We present a case of axis deviation without left bundle branch block and without atrial fibrillation and acute myocardial infarction in a 65-year-old Italian man. To our knowledge, this is the first report of axis deviation without left bundle branch block and without atrial fibrillation and acute myocardial infarction. Copyright 2008 Elsevier Ireland Ltd. All rights reserved.
Clinical and Translational Epidemiology Branch (CTEB)
The Clinical and Translational Epidemiology Branch focuses on factors that influence cancer progression, recurrence, survival, and other treatment outcomes, and factors associated with cancer development.
Toward improved branch prediction through data mining.
Energy Technology Data Exchange (ETDEWEB)
Hemmert, K. Scott; Johnson, D. Eric (University of Texas at Austin)
2009-09-01
Data mining and machine learning techniques can be applied to computer system design to aid in optimizing design decisions, improving system runtime performance. Data mining techniques have been investigated in the context of branch prediction. Specifically, a comparison of traditional branch predictor performance has been made to data mining algorithms. Additionally, the possiblity of whether additional features available within the architectural state might serve to further improve branch prediction has been evaluated. Results show that data mining techniques indicate potential for improved branch prediction, especially when register file contents are included as a feature set.
Systematic comparison of solved problems as a cooperative learning task
Taconis, Ruurd; van Hout-Wolters, Bernadette
1999-09-01
Problem-solving skills and understanding of domain, knowledge (e.g., fighting misconceptions) are important goals in both secondary and tertiary science education. A prototype of an instructional task is presented which aims at improved problem-solving skills based on understanding of domain knowledge. In this task, comparing carefully selected solved problems by groups of students is utilised as a learning activity for the acquisition of adequate problem schemata. The task is designed as a part of the so-called UBP-program (UBP=Understanding Based Problem solving) currently being developed, for education in science. The result of an evaluative study for the field of mechanics is presented. The UBP-task appears apt to improve problem-solving skills at a less advanced level of physics education (e.g., 10th grade), especially for students normally performing poorly—who are often girls.
Schoenfeld's problem solving theory in a student controlled learning environment
Harskamp, E.; Suhre, C.
2007-01-01
This paper evaluates the effectiveness of a student controlled computer program for high school mathematics based on instruction principles derived from Schoenfeld's theory of problem solving. The computer program allows students to choose problems and to make use of hints during different episodes
Solving the Quadratic Capacitated Facilities Location Problem by Computer.
Cote, Leon C.; Smith, Wayland P.
Several computer programs were developed to solve various versions of the quadratic capacitated facilities location problem. Matrices, which represent various business costs, are defined for the factors of sites, facilities, customers, commodities, and production units. The objective of the program is to find an optimization matrix for the lowest…
Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem
DEFF Research Database (Denmark)
Gamst, Mette; Petersen, Bjørn
2012-01-01
-Protocol Label Switching. The problem has previously been solved to optimality through branch-and-price. In this paper we propose two exact solution methods both based on an alternative decomposition. The two methods differ in their branching strategy. The first method, which branches on forbidden edge sequences......The Multi-Commodity k-splittable Maximum Flow Problem consists in routing as much flow as possible through a capacitated network such that each commodity uses at most k paths and the capacities are satisfied. The problem appears in telecommunications, specifically when considering Multi...
Quantification of Structural Topology in Branched Polymers
Ramachandran, Ramnath
Complex molecular structures occur in various natural and synthetic materials. From common plastics like polyethylene to proteins like hemoglobin, the significant effect of the molecular structure of these materials on their properties cannot be understated. Hence, it is fundamental to comprehensively characterize these complex structures. In the case of polyethylene, branching plays a significant role in determining its structure-property relationships. Various characterization techniques are available to measure the branch content in polyethylene. Qualitative techniques based on gel permeation chromatography and rheology; and absolute measurements from nuclear magnetic resonance spectroscopy are commonly used to estimate branch content. Drawbacks posed by these common techniques have been well documented in literature. Further, these techniques are unable to provide a comprehensive picture of the structural topology of polyethylene which is crucial to understanding the structure-property relationships of these systems. In this dissertation, a novel scaling approach is described to quantify branching in polyethylene. The approach is useful in quantifying both short-chain and long-chain branch contents in polyethylene. Additionally, unique measurements such as average long-chain branch length and hyperbranch (branch-on-branch) content are available through this approach. Such enhanced topological information can help us better understand the effect of catalyst systems on the structure of polyethylene as well as the effect of branching on the polymer's physical properties. The scaling approach was successful in quantifying the structure of variety of model and commercial branched polyethylene systems. Specific examples of high-density and linear low-density polyethylene as well as hydrogenated polybutadienes are discussed here. The dissertation is intended to standardize and corroborate the scaling approach in quantifying the structure of branched polymers. The
Compositional Verification with Abstraction, Learning, and SAT Solving
2015-05-01
Compositional Verification with Abstraction, Learning , and SAT Solving Anvesh Komuravelli CMU-CS-15-102 May 2015 School of Computer Science Computer...grant number F8721-05-C-0003, and the Portuguese Science Technology Foundation. The views and conclusions contained in this document are those of the...with Abstraction, Learning , and SAT Solving 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d. PROJECT NUMBER 5e. TASK
Directory of Open Access Journals (Sweden)
Matteo Ghiringhelli
2015-07-01
Full Text Available Our study is focused on evaluation and use of the most effective and correct nutrients. In particular, our attention is directed to the role of certain amino acids in cachectic patients. During parenteral nutrition in humans, physician already associates in the PN-bags different formulations including amino acids, lipids and glucose solutions or essential amino acids solution alone or exclusively branched-chain amino acids (BCAA. Studies investigated the effects of dietary BCAA ingestion on different diseases and conditions such as obesity and metabolic disorders, liver disease, muscle atrophy, cancer, impaired immunity or injuries (surgery, trauma, burns, and sepsis. BCAAs have been shown to affect gene expression, protein metabolism, apoptosis and regeneration of hepatocytes, and insulin resistance. They have also been shown to inhibit the proliferation of liver cancer cells in vitro, and are essential for lymphocyte proliferation and dendritic cell maturation. Oral or parenteral administration of these three amino acids will allow us to evaluate the real efficacy of these compounds during a therapy to treat malnutrition in subjects unable to feed themselves.
Optimal Planning and Problem-Solving
Clemet, Bradley; Schaffer, Steven; Rabideau, Gregg
2008-01-01
CTAEMS MDP Optimal Planner is a problem-solving software designed to command a single spacecraft/rover, or a team of spacecraft/rovers, to perform the best action possible at all times according to an abstract model of the spacecraft/rover and its environment. It also may be useful in solving logistical problems encountered in commercial applications such as shipping and manufacturing. The planner reasons around uncertainty according to specified probabilities of outcomes using a plan hierarchy to avoid exploring certain kinds of suboptimal actions. Also, planned actions are calculated as the state-action space is expanded, rather than afterward, to reduce by an order of magnitude the processing time and memory used. The software solves planning problems with actions that can execute concurrently, that have uncertain duration and quality, and that have functional dependencies on others that affect quality. These problems are modeled in a hierarchical planning language called C_TAEMS, a derivative of the TAEMS language for specifying domains for the DARPA Coordinators program. In realistic environments, actions often have uncertain outcomes and can have complex relationships with other tasks. The planner approaches problems by considering all possible actions that may be taken from any state reachable from a given, initial state, and from within the constraints of a given task hierarchy that specifies what tasks may be performed by which team member.
3D modelling of branching in plants
Evers, J.B.
2011-01-01
Shoot branching is a key determinant of overall aboveground plant form. During plant development, the number of branches formed strongly influences the amount of light absorbed by the plant, and thus the plant’s competitive strength in terms of light capture in relation to neighbouring plants.
A Unifying Theory of Branching Morphogenesis
Hannezo, Edouard; Scheele, Colinda L G J; Moad, Mohammad; Drogo, Nicholas; Heer, Rakesh; Sampogna, Rosemary V; van Rheenen, Jacco; Simons, Benjamin D
2017-01-01
The morphogenesis of branched organs remains a subject of abiding interest. Although much is known about the underlying signaling pathways, it remains unclear how macroscopic features of branched organs, including their size, network topology, and spatial patterning, are encoded. Here, we show that,
Variants of the left aortic arch branches
African Journals Online (AJOL)
ORIGINAL ARTICLE. Variants of the left aortic arch branches. N Z Makhanya. MB ChB. R T Mamogale. MB 0113. N Khan. FCRaD (0). Department of Diagnostic Radiology. Medical University of Southern Africa. Abstract. The normal aorta has three branches from its arch, but variations in this pattern are not uncommon. Our.
Tail paradox, partial identifiability, and influential priors in Bayesian branch length inference.
Rannala, Bruce; Zhu, Tianqi; Yang, Ziheng
2012-01-01
Recent studies have observed that Bayesian analyses of sequence data sets using the program MrBayes sometimes generate extremely large branch lengths, with posterior credibility intervals for the tree length (sum of branch lengths) excluding the maximum likelihood estimates. Suggested explanations for this phenomenon include the existence of multiple local peaks in the posterior, lack of convergence of the chain in the tail of the posterior, mixing problems, and misspecified priors on branch lengths. Here, we analyze the behavior of Bayesian Markov chain Monte Carlo algorithms when the chain is in the tail of the posterior distribution and note that all these phenomena can occur. In Bayesian phylogenetics, the likelihood function approaches a constant instead of zero when the branch lengths increase to infinity. The flat tail of the likelihood can cause poor mixing and undue influence of the prior. We suggest that the main cause of the extreme branch length estimates produced in many Bayesian analyses is the poor choice of a default prior on branch lengths in current Bayesian phylogenetic programs. The default prior in MrBayes assigns independent and identical distributions to branch lengths, imposing strong (and unreasonable) assumptions about the tree length. The problem is exacerbated by the strong correlation between the branch lengths and parameters in models of variable rates among sites or among site partitions. To resolve the problem, we suggest two multivariate priors for the branch lengths (called compound Dirichlet priors) that are fairly diffuse and demonstrate their utility in the special case of branch length estimation on a star phylogeny. Our analysis highlights the need for careful thought in the specification of high-dimensional priors in Bayesian analyses.
Deutsch, Nancy L.; Reitz-Krueger, Cristina L.; Henneberger, Angela K.; Futch Ehrlich, Valerie A.; Lawrence, Edith C.
2017-01-01
Group mentoring is an increasingly popular intervention, but is still under-studied. This article reports findings from a qualitative study of the Young Women Leaders Program (YWLP), a combined group and one-on-one mentoring program for early adolescent girls. Protégés (n = 113) were interviewed post-program about changes they made as a result of…
2008+ solved problems in electromagnetics
Nasar, Syed
2007-01-01
SciTech Publishing is reissuing this extremely valuable learning resource, originally published in 1992 in the Schaum's Problem-Solving Series for students of electromagnetics and those who wish to refresh and solidify their understanding of its challenging applications. Problem-solving drill helps develop confidence, but few textbooks offer the answers, never mind the complete solutions, to their chapter exercises. Here noted author Professor Syed Nasar has divided the book's problems into topic areas similar to a textbook and presented a wide array of problems, followed immediately by their
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
as a general approach to problem solving. We apply these Simonian ideas to organizational issues, specifically new organizational forms. Specifically, Simonian ideas allow us to develop a morphology of new organizational forms and to point to some design problems that characterize these forms.Keywords: Herbert...... Simon, problem-solving, new organizational forms. JEL Code: D23, D83......Two of Herbert Simon's best-known papers are "The Architecture of Complexity" and "The Structure of Ill-Structured Problems." We discuss the neglected links between these two papers, highlighting the role of decomposition in the context of problems on which constraints have been imposed...
[Croatian Medical Association--Branch Zagreb].
Kaić, Zvonimir; Sain, Snjezana; Gulić, Mirjana; Mahovlić, Vjekoslav; Krznarić, Zeljko
2014-01-01
The available literature shows us that "Druztvo ljeciteljah u Zagrebus (the Society of Healers in Zagreb) was founded as far back as the year 1845 by a total of thirteen members. This data allows us to follow the role of doctors and health workers in Zagreb through their everyday profession, research, organizational and social work as well as management through a period of over one hundred to seventy years. The Branch Zagreb was active before the official establishment of subsidiaries of CMA which is evident from the minutes of the regular annual assembly of the Croatian Medical Association on 21 March 1948. Until the end of 1956, there was no clear division of labor, functions and competencies between the Branch and the Main Board. Their actions were instead consolidated and the Branch operated within and under the name of Croatian Medical Association. In that year the Branch became independent. The Branch Zagreb is the largest and one of the most active branches of the Croatian Medical Association. At the moment, the Branch brings together 3621 members, regular members--doctors of medicine (2497), doctors of dental medicine (384), retired physicians (710), and associate members (30 specialists with higher education who are not doctors). The Branch is especially accomplished in its activities in the area of professional development of its members and therefore organizes a series of scientific conferences in the framework of continuous education of physicians, allowing its members to acquire necessary points for the extension of their operating license. The choir "Zagrebacki lijecnici pjevaci" (Zagreb Physicians' Choir) of the Croatian Medical Music Society of the CMA and its activities are inseparable from the Branch Zagreb. The Branch is firmly linked to the parent body, the CMA, and thus has a visible impact on the strategy and the activities of the Association as a whole. Most professional societies of the CMA have their headquarters in Zagreb and this is
iNKT cell development is orchestrated by different branches of TGF-β signaling
Doisne, Jean-Marc; Bartholin, Laurent; Yan, Kai-Ping; Garcia, Céline N.; Duarte, Nadia; Le Luduec, Jean-Benoît; Vincent, David; Cyprian, Farhan; Horvat, Branka; Martel, Sylvie; Rimokh, Ruth; Losson, Régine; Benlagha, Kamel
2009-01-01
Invariant natural killer T (iNKT) cells constitute a distinct subset of T lymphocytes exhibiting important immune-regulatory functions. Although various steps of their differentiation have been well characterized, the factors controlling their development remain poorly documented. Here, we show that TGF-β controls the differentiation program of iNKT cells. We demonstrate that TGF-β signaling carefully and specifically orchestrates several steps of iNKT cell development. In vivo, this multifaceted role of TGF-β involves the concerted action of different pathways of TGF-β signaling. Whereas the Tif-1γ branch controls lineage expansion, the Smad4 branch maintains the maturation stage that is initially repressed by a Tif-1γ/Smad4-independent branch. Thus, these three different branches of TGF-β signaling function in concert as complementary effectors, allowing TGF-β to fine tune the iNKT cell differentiation program. PMID:19451264
A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem
DEFF Research Database (Denmark)
Jepsen, Mads Kehlet; Spoorendonk, Simon; Røpke, Stefan
2013-01-01
This paper presents an exact method for solving the symmetric two-echelon capacitated vehicle routing problem, a transportation problem concerned with the distribution of goods from a depot to a set of customers through a set of satellite locations. The presented method is based on an edge flow...... model that is a relaxation and provides a valid lower bound. A specialized branching scheme is employed to obtain feasible solutions. Out of a test set of 93 instances the algorithm is able to solve 47 to optimality surpassing previous exact algorithms....
Teaching clinical problem solving: a preceptor's guide.
Weitzel, Kristin W; Walters, Erika A; Taylor, James
2012-09-15
Instructional methods to help pharmacists succeed in their growing role in practice-based teaching are discussed, with an emphasis on techniques for fulfilling the four key preceptor roles. The American Society of Health-System Pharmacists (ASHP) and other organizations advocate ongoing efforts to develop the teaching skills of clinician-educators serving as preceptors to pharmacy students and residents. The broad model of teaching clinical problem solving recommended by ASHP emphasizes the creative and flexible application of the four major preceptor roles: (1) direct instruction, (2) modeling, (3) coaching, and (4) facilitating. A variety of teaching methods used in the fields of medicine and nursing that can also be adopted by practice-based pharmacy educators are presented; in particular, the advantages and disadvantages of various case-presentation formats (e.g., One-Minute Preceptor, SNAPPS, patient-witnessed teaching, "Aunt Minnie," "think-aloud") are reviewed. Other topics discussed include the appropriate use of questioning as an educational tool, strategies for providing constructive feedback, teaching learners to self-evaluate their skills and progress, and integrating residents into teaching activities. The ASHP-recommended approach to teaching clinical problem-solving skills can be applied within the educational frameworks provided by schools of pharmacy as well as pharmacy residency programs. A wide range of validated teaching strategies can be used to tailor learning experiences to individual learner needs while meeting overall program goals and objectives.
Mechanisms of Side Branching and Tip Splitting in a Model of Branching Morphogenesis
Guo, Yina; Sun, Mingzhu; Garfinkel, Alan; Zhao, Xin
2014-01-01
Recent experimental work in lung morphogenesis has described an elegant pattern of branching phenomena. Two primary forms of branching have been identified: side branching and tip splitting. In our previous study of lung branching morphogenesis, we used a 4 variable partial differential equation (PDE), due to Meinhardt, as our mathematical model to describe the reaction and diffusion of morphogens creating those branched patterns. By altering key parameters in the model, we were able to reproduce all the branching styles and the switch between branching modes. Here, we attempt to explain the branching phenomena described above, as growing out of two fundamental instabilities, one in the longitudinal (growth) direction and the other in the transverse direction. We begin by decoupling the original branching process into two semi-independent sub-processes, 1) a classic activator/inhibitor system along the growing stalk, and 2) the spatial growth of the stalk. We then reduced the full branching model into an activator/inhibitor model that embeds growth of the stalk as a controllable parameter, to explore the mechanisms that determine different branching patterns. We found that, in this model, 1) side branching results from a pattern-formation instability of the activator/inhibitor subsystem in the longitudinal direction. This instability is far from equilibrium, requiring a large inhomogeneity in the initial conditions. It successively creates periodic activator peaks along the growing stalk, each of which later on migrates out and forms a side branch; 2) tip splitting is due to a Turing-style instability along the transversal direction, that creates the spatial splitting of the activator peak into 2 simultaneously-formed peaks at the growing tip, the occurrence of which requires the widening of the growing stalk. Tip splitting is abolished when transversal stalk widening is prevented; 3) when both instabilities are satisfied, tip bifurcation occurs together with side
Mechanisms of side branching and tip splitting in a model of branching morphogenesis.
Directory of Open Access Journals (Sweden)
Yina Guo
Full Text Available Recent experimental work in lung morphogenesis has described an elegant pattern of branching phenomena. Two primary forms of branching have been identified: side branching and tip splitting. In our previous study of lung branching morphogenesis, we used a 4 variable partial differential equation (PDE, due to Meinhardt, as our mathematical model to describe the reaction and diffusion of morphogens creating those branched patterns. By altering key parameters in the model, we were able to reproduce all the branching styles and the switch between branching modes. Here, we attempt to explain the branching phenomena described above, as growing out of two fundamental instabilities, one in the longitudinal (growth direction and the other in the transverse direction. We begin by decoupling the original branching process into two semi-independent sub-processes, 1 a classic activator/inhibitor system along the growing stalk, and 2 the spatial growth of the stalk. We then reduced the full branching model into an activator/inhibitor model that embeds growth of the stalk as a controllable parameter, to explore the mechanisms that determine different branching patterns. We found that, in this model, 1 side branching results from a pattern-formation instability of the activator/inhibitor subsystem in the longitudinal direction. This instability is far from equilibrium, requiring a large inhomogeneity in the initial conditions. It successively creates periodic activator peaks along the growing stalk, each of which later on migrates out and forms a side branch; 2 tip splitting is due to a Turing-style instability along the transversal direction, that creates the spatial splitting of the activator peak into 2 simultaneously-formed peaks at the growing tip, the occurrence of which requires the widening of the growing stalk. Tip splitting is abolished when transversal stalk widening is prevented; 3 when both instabilities are satisfied, tip bifurcation occurs
Simulation of branching blood flows on parallel computers.
Yue, Xue; Hwang, Feng-Nan; Shandas, Robin; Cai, Xiao-Chuan
2004-01-01
We present a fully parallel nonlinearly implicit algorithm for the numerical simulation of some branching blood flow problems, which require efficient and robust solver technologies in order to handle the high nonlinearity and the complex geometry. Parallel processing is necessary because of the large number of mesh points needed to accurately discretize the system of differential equations. In this paper we introduce a parallel Newton-Krylov-Schwarz based implicit method, and software for distributed memory parallel computers, for solving the nonlinear algebraic systems arising from a Q2-Q1 finite element discretization of the incompressible Navier-Stokes equations that we use to model the blood flow in the left anterior descending coronary artery.
Problem Solving through Paper Folding
Wares, Arsalan
2014-01-01
The purpose of this article is to describe a couple of challenging mathematical problems that involve paper folding. These problem-solving tasks can be used to foster geometric and algebraic thinking among students. The context of paper folding makes some of the abstract mathematical ideas involved relatively concrete. When implemented…
Solved problems in classical electromagnetism
Franklin, Jerrold
2018-01-01
This original Dover publication is the companion to a new edition of the author's Classical Electromagnetism: Second Edition. The latter volume will feature only basic answers; this book will contain some problems from the reissue as well as many other new ones. All feature complete, worked-out solutions and form a valuable source of problem-solving material for students.
Funke, Joachim
2013-01-01
This paper presents a bibliography of 263 references related to human problem solving, arranged by subject matter. The references were taken from PsycInfo and Academic Premier data-base. Journal papers, book chapters, and dissertations are included. The topics include human development, education, neuroscience, and research in applied settings. It…
Students' Problem Solving and Justification
Glass, Barbara; Maher, Carolyn A.
2004-01-01
This paper reports on methods of students' justifications of their solution to a problem in the area of combinatorics. From the analysis of the problem solving of 150 students in a variety of settings from high-school to graduate study, four major forms of reasoning evolved: (1) Justification by Cases, (2) Inductive Argument, (3) Elimination…
Solving Intuitionistic Fuzzy Nonlinear Equations
Directory of Open Access Journals (Sweden)
Mohammad Keyanpour
2014-09-01
Full Text Available In this paper a numerical method is proposed to solve intuitionistic fuzzy nonlinear equations. The method is based on the Midpoint Newton's method in which the intuitionistic fuzzy quantities are presented in parametric form. The efficiency of the proposed method is tested with an illustrative example.
Solving Differential Equations in R: Package deSolve
Directory of Open Access Journals (Sweden)
Karline Soetaert
2010-02-01
Full Text Available In this paper we present the R package deSolve to solve initial value problems (IVP written as ordinary differential equations (ODE, differential algebraic equations (DAE of index 0 or 1 and partial differential equations (PDE, the latter solved using the method of lines approach. The differential equations can be represented in R code or as compiled code. In the latter case, R is used as a tool to trigger the integration and post-process the results, which facilitates model development and application, whilst the compiled code significantly increases simulation speed. The methods implemented are efficient, robust, and well documented public-domain Fortran routines. They include four integrators from the ODEPACK package (LSODE, LSODES, LSODA, LSODAR, DVODE and DASPK2.0. In addition, a suite of Runge-Kutta integrators and special-purpose solvers to efficiently integrate 1-, 2- and 3-dimensional partial differential equations are available. The routines solve both stiff and non-stiff systems, and include many options, e.g., to deal in an efficient way with the sparsity of the Jacobian matrix, or finding the root of equations. In this article, our objectives are threefold: (1 to demonstrate the potential of using R for dynamic modeling, (2 to highlight typical uses of the different methods implemented and (3 to compare the performance of models specified in R code and in compiled code for a number of test cases. These comparisons demonstrate that, if the use of loops is avoided, R code can efficiently integrate problems comprising several thousands of state variables. Nevertheless, the same problem may be solved from 2 to more than 50 times faster by using compiled code compared to an implementation using only R code. Still, amongst the benefits of R are a more flexible and interactive implementation, better readability of the code, and access to R’s high-level procedures. deSolve is the successor of package odesolve which will be deprecated in
Learning via problem solving in mathematics education
Directory of Open Access Journals (Sweden)
Piet Human
2009-09-01
problem-solving movement, over the last twenty years, mathematics educators around the world started increasingly to appreciate the role of social interaction and mathematical discourse in classrooms, and to take into consideration the inﬂ uence of the social, socio-mathematical and mathematical norms established in classrooms. This shift away from an emphasis on individualised instruction towards classroom practices characterised by rich and focused social interaction orchestrated by the teacher, became the second element, next to problem-solving, of what is now known as the “reform agenda”. Learning and teaching by means of problem-solving in a socially-interactive classroom, with a strong demand for conceptual understanding, is radically different from traditional expository teaching. However, contrary to commonly-held misunderstandings, it requires substantial teacher involvement. It also requires teachers to assume a much higher level of responsibility for the extent and quality of learning than that which teachers tended to assume traditionally. Over the last 10 years, teaching for and via problem solving has become entrenched in the national mathematics curriculum statements of many countries, and programs have been launched to induce and support teachers to implement it. Actual implementation of the “reform agenda” in classrooms is, however, still limited. The limited implementation is ascribed to a number of factors, including the failure of assessment practices to accommodate problem solving and higher levels of understanding that may be facilitated by teaching via problem solving, lack of clarity about what teaching for and via problem solving may actually mean in practice, and limited mathematical expertise of teachers. Some leading mathematics educators (for example, Schoenfeld, Stigler and Hiebert believe that the reform agenda speciﬁ es classroom practices that are fundamentally foreign to culturally embedded pedagogical traditions, and hence
Solving PDEs in Python the FEniCS tutorial I
Langtangen, Hans Petter
2016-01-01
This book offers a concise and gentle introduction to finite element programming in Python based on the popular FEniCS software library. Using a series of examples, including the Poisson equation, the equations of linear elasticity, the incompressible Navier–Stokes equations, and systems of nonlinear advection–diffusion–reaction equations, it guides readers through the essential steps to quickly solving a PDE in FEniCS, such as how to define a finite variational problem, how to set boundary conditions, how to solve linear and nonlinear systems, and how to visualize solutions and structure finite element Python programs. This book is open access under a CC BY license.
Görücü, Alpaslan; Cantav, Erkan
2017-01-01
In this research, it is aimed to analyze the problem solving skills of university students in terms of different variables and to analyze the differences among the levels of perceived problem solving skill of the students of Physical Education and Sports College and other branch students. The sample consists of the university students from the…
Absolute branching intensities in the decay of 92Rb to 92Sr
Lhersonneau, G; Rizzi, V; Alyakrinskiy, O; Lanchais, A; Volkov, Yu.M; Barzakh, A.E; Fedorov, D.V; Ionan, A.M; Ivanov, V.S; Mezilev, K.A; Moroz, F.V; Orlov, S.Yu; Panteleev, V.N; Lau, C; Bajeat, O; Essabaa, S; Leroy, R; Jardin, P; Stroe, L; 10.1103/PhysRevC.74.017308
2006-01-01
The branching of the 2+ to 0+ transition in 92Sr has been measured to 0.032(4) per 92Rb decay. It confirms an earlier measurement however discarded in nuclear data evaluations since in contradiction with accepted lower logft limits. The conflict could be solved assuming that close to half of the decay intensity, mostly as high-energy ground-state transitions, is missing in th edecay scheme.
Application of VAX/VMS graphics for solving preliminary ship design problems
McGowan, Gerald K.
1989-01-01
Approved for public release; distribution is unlimited The VAX/VMS UIS graphics library routines were used in the creation of a menu driven, interactive program which solves basic preliminary ship design problems. The program uses a menu with active mouse and keyboard to select options, enter data, and control program execution. At present, the program solves transverse and longitudinal static stability problems and predicts the effects of shifting weight in three planes. It also calculate...
77 FR 39143 - Executive Branch Qualified Trusts
2012-07-02
... executive branch qualified trust, an entity must meet the strict requirements for independence set forth in... this subpart. A parent or guardian may execute the umbrella trust agreement on behalf of a required...
FY 1990 Applied Sciences Branch annual report
Energy Technology Data Exchange (ETDEWEB)
Keyes, B.M.; Dippo, P.C. (eds.)
1991-11-01
The Applied Sciences Branch actively supports the advancement of DOE/SERI goals for the development and implementation of the solar photovoltaic technology. The primary focus of the laboratories is to provide state-of-the-art analytical capabilities for materials and device characterization and fabrication. The branch houses a comprehensive facility which is capable of providing information on the full range of photovoltaic components. A major objective of the branch is to aggressively pursue collaborative research with other government laboratories, universities, and industrial firms for the advancement of photovoltaic technologies. Members of the branch disseminate research findings to the technical community in publications and presentations. This report contains information on surface and interface analysis, materials characterization, development, electro-optical characterization module testing and performance, surface interactions and FTIR spectroscopy.
Overview of the Advanced High Frequency Branch
Miranda, Felix A.
2015-01-01
This presentation provides an overview of the competencies, selected areas of research and technology development activities, and current external collaborative efforts of the NASA Glenn Research Center's Advanced High Frequency Branch.
General Description of Human Problem Solving.
Current theories of problem solving have no explanatory account of the processes of problem identification. Gestalt approaches to problem solving did...solving is presented which extends the Gestalt work. Problem solving is defined as two simultaneous processes: the generation and evaluation of
How Banks Go Abroad : Branches or Subsidiaries?
Cerutti, Eugenio; Dell'Ariccia, Giovanni; Martínez Pería, Maria Soledad
2005-01-01
The authors examine the factors that influence banks' type of organizational form when operating in foreign markets using an original database of the branches and subsidiaries in Latin America and Eastern Europe of the top 100 international banks. They find that regulation, taxation, the degree of desired penetration in the local market, and host-country economic and political risks matter. Banks are more likely to operate as branches in countries that have higher corporate taxes and when the...
Branch retinal artery occlusion in Susac's syndrome
Directory of Open Access Journals (Sweden)
Ricardo Evangelista Marrocos de Aragão
2015-02-01
Full Text Available Susac's syndrome is a rare disease attribuited to a microangiopathy involving the arterioles of the cochlea, retina and brain. Encefalopathy, hearing loss, and visual deficits are the hallmarks of the disease. Visual loss is due to multiple, recurrent branch arterial retinal occlusions. We report a case of a 20-year-old women with Susac syndrome presented with peripheral vestibular syndrome, hearing loss, ataxia, vertigo, and vision loss due occlusion of the retinal branch artery.
All change at the CERN UBS branch
Antonella Del Rosso
2012-01-01
UBS branches across the country are being modernised, and the CERN branch is no exception. The Bulletin brings you a preview of the project, which will get under way in January 2013. Mock-up of the renovated UBS branch. The changes at the UBS branch in CERN's Main Building will be no simple facelift. The entire bank will be renovated, transforming the present relatively confined premises into an open and attractive area. "The renovation of the UBS branches is part of a wider campaign designed to further enhance our customer relations," explains Ezio Mangia, the head of the CERN branch. The UBS bank currently occupies three sets of premises in CERN's Main Building (two on the ground floor and one in the basement). "By the end of the work, which is scheduled to be completed by the middle of next year, CERN customers will benefit from a new area with open-plan counters and "hole-in-the-wall" machines accessible to...
A Newton method for solving continuous multiple material minimum compliance problems
DEFF Research Database (Denmark)
Stolpe, M; Stegmann, Jan
This paper presents an implementation of an active-set line-search Newton method intended for solving large-scale instances of a class of multiple material minimum compliance problems. The problem is modeled with a convex objective function and linear constraints. At each iteration of the Newton....... Computational experiments with a branch and bound method indicate that the proposed Newton method can, on most instances in the test-set, take advantage of the available starting point information in an enumeration tree and resolve the relaxations after branching with few additional function evaluations...
A Newton method for solving continuous multiple material minimum compliance problems
DEFF Research Database (Denmark)
Stolpe, Mathias; Stegmann, Jan
2007-01-01
This paper presents an implementation of an active-set line-search Newton method intended for solving large-scale instances of a class of multiple material minimum compliance problems. The problem is modeled with a convex objective function and linear constraints. At each iteration of the Newton....... Computational experiments with a branch and bound method indicate that the proposed Newton method can, on most instances in the test-set, take advantage of the available starting point information in an enumeration tree and resolve the relaxations after branching with few additional function evaluations...
Methods of solving nonstandard problems
Grigorieva, Ellina
2015-01-01
This book, written by an accomplished female mathematician, is the second to explore nonstandard mathematical problems – those that are not directly solved by standard mathematical methods but instead rely on insight and the synthesis of a variety of mathematical ideas. It promotes mental activity as well as greater mathematical skills, and is an ideal resource for successful preparation for the mathematics Olympiad. Numerous strategies and techniques are presented that can be used to solve intriguing and challenging problems of the type often found in competitions. The author uses a friendly, non-intimidating approach to emphasize connections between different fields of mathematics and often proposes several different ways to attack the same problem. Topics covered include functions and their properties, polynomials, trigonometric and transcendental equations and inequalities, optimization, differential equations, nonlinear systems, and word problems. Over 360 problems are included with hints, ...
Solving higher curvature gravity theories
Energy Technology Data Exchange (ETDEWEB)
Chakraborty, Sumanta [IUCAA, Pune (India); SenGupta, Soumitra [Indian Association for the Cultivation of Science, Theoretical Physics Department, Kolkata (India)
2016-10-15
Solving field equations in the context of higher curvature gravity theories is a formidable task. However, in many situations, e.g., in the context of f(R) theories, the higher curvature gravity action can be written as an Einstein-Hilbert action plus a scalar field action. We show that not only the action but the field equations derived from the action are also equivalent, provided the spacetime is regular. We also demonstrate that such an equivalence continues to hold even when the gravitational field equations are projected on a lower-dimensional hypersurface. We have further addressed explicit examples in which the solutions for Einstein-Hilbert and a scalar field system lead to solutions of the equivalent higher curvature theory. The same, but on the lower-dimensional hypersurface, has been illustrated in the reverse order as well. We conclude with a brief discussion on this technique of solving higher curvature field equations. (orig.)
A Generalized Fluid System Simulation Program to Model Flow Distribution in Fluid Networks
Majumdar, Alok; Bailey, John W.; Schallhorn, Paul; Steadman, Todd
1998-01-01
This paper describes a general purpose computer program for analyzing steady state and transient flow in a complex network. The program is capable of modeling phase changes, compressibility, mixture thermodynamics and external body forces such as gravity and centrifugal. The program's preprocessor allows the user to interactively develop a fluid network simulation consisting of nodes and branches. Mass, energy and specie conservation equations are solved at the nodes; the momentum conservation equations are solved in the branches. The program contains subroutines for computing "real fluid" thermodynamic and thermophysical properties for 33 fluids. The fluids are: helium, methane, neon, nitrogen, carbon monoxide, oxygen, argon, carbon dioxide, fluorine, hydrogen, parahydrogen, water, kerosene (RP-1), isobutane, butane, deuterium, ethane, ethylene, hydrogen sulfide, krypton, propane, xenon, R-11, R-12, R-22, R-32, R-123, R-124, R-125, R-134A, R-152A, nitrogen trifluoride and ammonia. The program also provides the options of using any incompressible fluid with constant density and viscosity or ideal gas. Seventeen different resistance/source options are provided for modeling momentum sources or sinks in the branches. These options include: pipe flow, flow through a restriction, non-circular duct, pipe flow with entrance and/or exit losses, thin sharp orifice, thick orifice, square edge reduction, square edge expansion, rotating annular duct, rotating radial duct, labyrinth seal, parallel plates, common fittings and valves, pump characteristics, pump power, valve with a given loss coefficient, and a Joule-Thompson device. The system of equations describing the fluid network is solved by a hybrid numerical method that is a combination of the Newton-Raphson and successive substitution methods. This paper also illustrates the application and verification of the code by comparison with Hardy Cross method for steady state flow and analytical solution for unsteady flow.
On solving stochastic MADM problems
Directory of Open Access Journals (Sweden)
Văduva Ion
2009-01-01
Full Text Available The paper examines a MADM problem with stochastic attributes. The transformation of a stochastic MADM problem into a cardinal problem is done by the standardization of the probability distribution of each attribute X and calculating the information of each attribute as Shannon's entropy or Onicescu's informational energy. Some well known (performant methods to solve a cardinal MADM problem are presented and a method for combining results of several methods to give a final MADM solution is discussed.
Better branch prediction through prophet/critic hybrids
Falcón Samper, Ayose Jesús; Stark, Jared; Ramírez Bellido, Alejandro; Lai, Konrad; Valero Cortés, Mateo
2005-01-01
The prophet/critic hybrid conditional branch predictor has two component predictors. The prophet uses a branch's history to predict its direction. We call this prediction and the ones for branches following it the branch future. The critic uses the branch's history and future to critique the prophet's prediction. The hybrid combines the prophet's prediction with the critique, either agrees or disagree, forming the branch's overall prediction. Results shows these hybrids can reduce mispredicts...
A Comparative Analysis of Schemes for Correlated Branch Prediction
Young, Cliff; Gloy, Nicolas; Smith, Michael D.
1995-01-01
Modern high-performance architectures require extremely accurate branch prediction to overcome the performance limitations of conditional branches. We present a framework that categorizes branch prediction schemes by the way in which they partition dynamic branches and by the kind of predictor that they use. The framework allows us to compare and contrast branch prediction schemes, and to analyze why they work. We use the framework to show how a static correlated branch prediction scheme incr...
Higashihara, Tomoya; Sugiyama, Kenji; Yoo, Hee-Soo; Hayashi, Mayumi; Hirao, Akira
2010-06-16
This paper reviews the precise synthesis of many-armed and multi-compositional star-branched polymers, exact graft (co)polymers, and structurally well-defined dendrimer-like star-branched polymers, which are synthetically difficult, by a commonly-featured iterative methodology combining living anionic polymerization with branched reactions to design branched polymers. The methodology basically involves only two synthetic steps; (a) preparation of a polymeric building block corresponding to each branched polymer and (b) connection of the resulting building unit to another unit. The synthetic steps were repeated in a stepwise fashion several times to successively synthesize a series of well-defined target branched polymers. Copyright © 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Directory of Open Access Journals (Sweden)
James A. Cartreine
2012-01-01
Full Text Available Problem-solving treatment (PST offers a promising approach to the depression care; however, few PST training opportunities exist. A computer-guided, interactive media program has been developed to deliver PST electronically (ePST, directly to patients. The program is a six-session, weekly intervention modeled on an evidence-based PST protocol. Users are guided through each session by a clinician who is presented via hundreds of branching audio and video clips. Because expert clinician behaviors are modeled in the program, not only does the ePST program have the potential to deliver PST to patients but it may also serve as a training tool to teach clinicians how to deliver PST. Thirteen social workers and trainees used ePST self-instructionally and subsequently attended a day-long workshop on PST. Participants’ PST knowledge level increased significantly from baseline to post-ePST (P=.001 and did not increase significantly further after attending the subsequent workshop. Additionally, attending the workshop did not significantly increase the participants' skill at performing PST beyond the use of the ePST program. Using the ePST program appears to train novices to a sufficient level of competence to begin practicing PST under supervision. This self-instructional training method could enable PST for depression to be widely disseminated, although follow-up supervision is still required.
Cartreine, James A; Chang, Trina E; Seville, Janette L; Sandoval, Luis; Moore, John B; Xu, Shuai; Hegel, Mark T
2012-01-01
Problem-solving treatment (PST) offers a promising approach to the depression care; however, few PST training opportunities exist. A computer-guided, interactive media program has been developed to deliver PST electronically (ePST), directly to patients. The program is a six-session, weekly intervention modeled on an evidence-based PST protocol. Users are guided through each session by a clinician who is presented via hundreds of branching audio and video clips. Because expert clinician behaviors are modeled in the program, not only does the ePST program have the potential to deliver PST to patients but it may also serve as a training tool to teach clinicians how to deliver PST. Thirteen social workers and trainees used ePST self-instructionally and subsequently attended a day-long workshop on PST. Participants' PST knowledge level increased significantly from baseline to post-ePST (P = .001) and did not increase significantly further after attending the subsequent workshop. Additionally, attending the workshop did not significantly increase the participants' skill at performing PST beyond the use of the ePST program. Using the ePST program appears to train novices to a sufficient level of competence to begin practicing PST under supervision. This self-instructional training method could enable PST for depression to be widely disseminated, although follow-up supervision is still required.
Ecological effects of contaminants in McCoy Branch, 1989-1990
Energy Technology Data Exchange (ETDEWEB)
Ryon, M.G. (ed.)
1992-01-01
The 1984 Hazardous and Solid Waste Amendments to the Resource Conservation and Recovery Act (RCRA) required assessment of all current and former solid waste management units. Such a RCRA Facility Investigation (RFI) was required of the Y-12 Plant for their Filled Coal Ash Pond on McCoy Branch. Because the disposal of coal ash in the ash pond, McCoy Branch, and Rogers Quarry was not consistent with the Tennessee Water Quality Act, several remediation steps were implemented or planned for McCoy Branch to address disposal problems. The McCoy Branch RFI plan included provisions for biological monitoring of the McCoy Branch watershed. The objectives of the biological monitoring were to: (1) document changes in biological quality of McCoy Branch after completion of a pipeline and after termination of all discharges to Rogers Quarry, (2) provide guidance on the need for additional remediation, and (3) evaluate the effectiveness of implemented remedial actions. The data from the biological monitoring program will also determine if the classified uses, as identified by the State of Tennessee, of McCoy Branch are being protected and maintained. This report discusses results from toxicity monitoring of snails fish community assessment, and a Benthic macroinvertebrate community assessment.
Ecological effects of contaminants in McCoy Branch, 1991--1993
Energy Technology Data Exchange (ETDEWEB)
Ryon, M.G. [ed.
1996-09-01
The 1984 Hazardous and Solid Waste Amendments to the Resource Conservation and Recovery Act (RCRA) required assessment of all current and former solid waste management units. Following guidelines under RCRA and the Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA), a remedial investigation (RI) was required of the Y-12 Plant for their filled coal ash pond (FCAP) and associated areas on McCoy Branch. The RI process was initiated and assessments were presented. Because the disposal of coal ash in the ash pond, McCoy Branch, and Rogers Quarry was not consistent with the Tennessee Water Quality Act, several remediation steps were implemented between 1986 and 1994 for McCoy Branch to address disposal problems. The required ecological risk assessments of McCoy Branch watershed included provisions for biological monitoring of the watershed. The objectives of the biological monitoring were to (1) document changes in biological quality of McCoy Branch after completion of a pipeline bypassing upper McCoy Branch and further, after termination of all discharges to Rogers Quarry, (2) provide guidance on the need for additional remediation, and (3) evaluate the effectiveness of implemented remedial actions. The data from the biological monitoring program may also determine whether the goals of protection of human health and the environment of McCoy Branch are being accomplished.
Practical Consideration of Pair Problem Solving in Computer Literacy Education
Oya, Yoshihiko; Uchida, Kimiko
2013-01-01
Direct instruction to students enrolled in a computer literacy program at the undergraduate level frequently involves difficulties due to varied knowledge levels and skills among the students, as well as an increase in the number of unmotivated students. An available solution is the pair problem solving approach which can prove to be effective as…
Learning Styles and Problem Solving Skills of Turkish Prospective Teachers
Gencel, Ilke Evin
2015-01-01
Global changes in educational discourse have an impact on educational systems, so teacher education programs need to be transformed to better train teachers and to contribute to their professional development. In this process learning styles and problem solving skills should be considered as individual differences which have an impact in…
Bellman – Ford Method for Solving the Optimal Route Problem
Directory of Open Access Journals (Sweden)
Laima Greičiūnė
2014-12-01
Full Text Available The article aims to adapt the dynamic programming method for optimal route determination using real-time data on ITS equipment. For this purpose, VBA code has been applied for solving the Bellman - Ford method for an optimal route considering optimality criteria for time, distance and the amount of emissions.
How One Library Solved the Overcrowded Storytime Problem.
Sherman, Gale W.
1998-01-01
Describes how one public library's preschool storytime solved its overcrowding problem by using parent volunteers to offer more programs with fewer children. Offers tips on recruitment and orientation. Discusses planning and organization by library staff, and the need for ongoing observation and evaluation. (AEF)
Using Computer Symbolic Algebra to Solve Differential Equations.
Mathews, John H.
1989-01-01
This article illustrates that mathematical theory can be incorporated into the process to solve differential equations by a computer algebra system, muMATH. After an introduction to functions of muMATH, several short programs for enhancing the capabilities of the system are discussed. Listed are six references. (YP)
Problem Solving in the Borderland between Mathematics and Physics
Jensen, Jens Højgaard; Niss, Martin; Jankvist, Uffe Thomas
2017-01-01
The article addresses the problématique of where mathematization is taught in the educational system, and who teaches it. Mathematization is usually not a part of mathematics programs at the upper secondary level, but we argue that physics teaching has something to offer in this respect, if it focuses on solving so-called unformalized problems,…
Modeling Regular Replacement for String Constraint Solving
Fu, Xiang; Li, Chung-Chih
2010-01-01
Bugs in user input sanitation of software systems often lead to vulnerabilities. Among them many are caused by improper use of regular replacement. This paper presents a precise modeling of various semantics of regular substitution, such as the declarative, finite, greedy, and reluctant, using finite state transducers (FST). By projecting an FST to its input/output tapes, we are able to solve atomic string constraints, which can be applied to both the forward and backward image computation in model checking and symbolic execution of text processing programs. We report several interesting discoveries, e.g., certain fragments of the general problem can be handled using less expressive deterministic FST. A compact representation of FST is implemented in SUSHI, a string constraint solver. It is applied to detecting vulnerabilities in web applications
Modeling and Solving the Train Pathing Problem
Directory of Open Access Journals (Sweden)
Yusin Lee
2009-04-01
Full Text Available In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. In this paper, we present an optimization heuristic to solve the train pathing and timetabling problem. This heuristic allows the dwell time of trains in a station or link to be dependent on the assigned tracks. It also allows the minimum clearance time between the trains to depend on their relative status. The heuristic generates a number of alternative paths for each train service in the initialization phase. Then it uses a neighborhood search approach to find good feasible combinations of these paths. A linear program is developed to evaluate the quality of each combination that is encountered. Numerical examples are provided.
CFD Problems Solving Parallel Approaches on Supercomputers
Directory of Open Access Journals (Sweden)
Kudryashova Tatiana
2016-01-01
Full Text Available The work is devoted to developing and testing parallel algorithms, suit of computer programs for numerical solution of CFD-problems on modern supercomputers. The paper summarizes our experience in solving various practical problems of gas dynamics. These problems include research of gas flow around bodies of complex shape by viscous gas flows with radiation processes near the surface of the bodies, calculations of jet streams in the open space and flows in micro channels of technical systems. We have developed approaches combining unstructured grids, domain decomposition technique, parallel implementation via MPI technology, OpenMP, CUDA. Calculations are performed on the heterogeneous computer systems with Graphical Processing Units, classical microprocessors (Central Processing Units and use advanced parallel approaches.
Kwon, Hae Ryong; Larsen, Melinda
2015-06-01
Branching morphogenesis is the developmental program responsible for generating a large surface to volume ratio in many secretory and absorptive organs. To accomplish branching morphogenesis, spatiotemporal regulation of specific cell subpopulations is required. Here, we review recent studies that define the contributions of distinct cell subpopulations to specific cellular processes during branching morphogenesis in the mammalian submandibular salivary gland, including the initiation of the gland, the coordination of cleft formation, and the contribution of stem/progenitor cells to morphogenesis. In conclusion, we provide an overview of technological advances that have opened opportunities to further probe the contributions of specific cell subpopulations and to define the integration of events required for branching morphogenesis. Copyright © 2015 Elsevier Ltd. All rights reserved.
Airway branching morphogenesis in three dimensional culture
Directory of Open Access Journals (Sweden)
Gudjonsson Thorarinn
2010-11-01
Full Text Available Abstract Background Lungs develop from the fetal digestive tract where epithelium invades the vascular rich stroma in a process called branching morphogenesis. In organogenesis, endothelial cells have been shown to be important for morphogenesis and the maintenance of organ structure. The aim of this study was to recapitulate human lung morphogenesis in vitro by establishing a three dimensional (3D co-culture model where lung epithelial cells were cultured in endothelial-rich stroma. Methods We used a human bronchial epithelial cell line (VA10 recently developed in our laboratory. This cell line cell line maintains a predominant basal cell phenotype, expressing p63 and other basal markers such as cytokeratin-5 and -14. Here, we cultured VA10 with human umbilical vein endothelial cells (HUVECs, to mimic the close interaction between these cell types during lung development. Morphogenesis and differentiation was monitored by phase contrast microscopy, immunostainings and confocal imaging. Results We found that in co-culture with endothelial cells, the VA10 cells generated bronchioalveolar like structures, suggesting that lung epithelial branching is facilitated by the presence of endothelial cells. The VA10 derived epithelial structures display various complex patterns of branching and show partial alveolar type-II differentiation with pro-Surfactant-C expression. The epithelial origin of the branching VA10 colonies was confirmed by immunostaining. These bronchioalveolar-like structures were polarized with respect to integrin expression at the cell-matrix interface. The endothelial-induced branching was mediated by soluble factors. Furthermore, fibroblast growth factor receptor-2 (FGFR-2 and sprouty-2 were expressed at the growing tips of the branching structures and the branching was inhibited by the FGFR-small molecule inhibitor SU5402. Discussion In this study we show that a human lung epithelial cell line can be induced by endothelial cells to
Gardner's Minichess Variant is solved
Mhalla, Mehdi; Prost, Frederic
2013-01-01
A 5x5 board is the smallest board on which one can set up all kind of chess pieces as a start position. We consider Gardner's minichess variant in which all pieces are set as in a standard chessboard (from Rook to King). This game has roughly 9x10^{18} legal positions and is comparable in this respect with checkers. We weakly solve this game, that is we prove its game-theoretic value and give a strategy to draw against best play for White and Black sides. Our approach requires surprisingly sm...
Problem solving through recreational mathematics
Averbach, Bonnie
1999-01-01
Historically, many of the most important mathematical concepts arose from problems that were recreational in origin. This book takes advantage of that fact, using recreational mathematics - problems, puzzles and games - to teach students how to think critically. Encouraging active participation rather than just observation, the book focuses less on mathematical results than on how these results can be applied to thinking about problems and solving them. Each chapter contains a diverse array of problems in such areas as logic, number and graph theory, two-player games of strategy, solitaire ga
Measurement of Tau Lepton Branching Fractions
Energy Technology Data Exchange (ETDEWEB)
Nicol, N.
2003-12-19
We present {tau}{sup -} lepton branching fraction measurements based on data from the TPC/Two-Gamma detector at PEP. Using a sample of {tau}{sup -} {yields} {nu}{sub {tau}}K{sup -}{pi}{sup +}{pi}{sup -} events, we examine the resonance structure of the K{sup -}{pi}{sup +}{pi}{sup -} system and obtain the first measurements of branching fractions for {tau}{sup -} {yields} {nu}{sub {tau}}K{sub 1}{sup -}(1270) and {tau}{sup -} {yields} {nu}{sub {tau}}K{sub 1}{sup -}(1400). We also describe a complete set of branching fraction measurements in which all the decays of the {tau}{sup -} lepton are separated into classes defined by the identities of the charged particles and an estimate of the number of neutrals. This is the first such global measurement with decay classes defined by the four possible charged particle species, e, {mu}, {pi}, and K.
Crack branching in cross-ply composites
La Saponara, Valeria
2001-10-01
The purpose of this research work is to examine the behavior of an interface crack in a cross-ply laminate which is subject to static and fatigue loading. The failure mechanism analyzed here is crack branching (or crack kinking or intra-layer crack): the delamination located between two different plies starts growing as an interface crack and then may branch into the less tough ply. The specimens were manufactured from different types of Glass/Epoxy and Graphite/Epoxy, by hand lay-up, vacuum bagging and cure in autoclave. Each specimen had a delamination starter. Static mixed mode tests and compressive fatigue tests were performed. Experiments showed the scale of the problem, one ply thickness, and some significant features, like contact in the branched crack. The amount of scatter in the experiments required use of statistics. Exploratory Data Analysis and a factorial design of experiments based on a 8 x 8 Hadamard matrix were used. Experiments and statistics show that there is a critical branching angle above which crack growth is greatly accelerated. This angle seems: (1) not to be affected by the specimens' life; (2) not to depend on the specimen geometry and loading conditions; (3) to strongly depend on the amount of contact in the branched crack. Numerical analysis was conducted to predict crack propagation based on the actual displacement/load curves for static tests. This method allows us to predict the total crack propagation in 2D conditions, while neglecting branching. Finally, the existence of a solution based on analytic continuation is discussed.
The branching channel network in the Yangtze Estuary
Wang, Z.B.; Ding, P.X.
2012-01-01
The channels in the Yangtze Estuary have an ordered-branching structure: The estuary is first divided by the Chongming Island into the North Branch and the South Branch. Then the South Branch is divided into the North Channel and South Channel by the Islands Changxing and Hengsha. The South Channel
Nature of branching in disordered materials
Kulkarni, Amit S.
The phenomenon of structural branching is ubiquitous in a wide array of materials such as polymers, ceramic aggregates, networks and gels. These materials with structural branching are a unique class of disordered materials and often display complex architectures. Branching has a strong influence over the structure-property relationships of these materials. Despite the generic importance across a wide spectrum of materials, our physical understanding of the scientific nature of branching and the analytic description and quantification of branching is at an early stage, though many decades of effort have been made. For polymers, branching is conventionally characterized by hydrodynamic radius (size exclusion chromatography, SEC, rheology) or by counting branch sites (nuclear magnetic resonance spectroscopy, NMR). SEC and rheology are, at best, qualitative; and quantitative characterization techniques like NMR and transmission electron microscopy (TEM) (for ceramic nanoparticulate aggregates) have limitations in providing routine quantification. Effective structure characterization, though an important step in understanding these materials, remains elusive. For ceramic aggregates, theoretical work has dominated and only a few publications on analytic studies exist to support theory. A new generic scaling model is proposed in Chapter I, which encompasses the critical structural features associated with these complex architectures. The central theme of this work is the application of this model to describe a variety of disordered structures like aggregated nano-particulates, long chain branched polymers like polyethylene, hyperbranched polymers, multi-arm star polymers, and cyclic macromolecules. The application of the proposed model to these materials results in a number of fundamental structural parameters, like the mass-fractal dimension, df, the minimum path dimension, dmin, connectivity dimension, c, and the mole fraction branch content, φbr. These dimensions
Solving rational expectations models using Excel
DEFF Research Database (Denmark)
Strulik, Holger
2004-01-01
Problems of discrete time optimal control can be solved using backward iteration and Microsoft Excel. The author explains the method in general and shows how the basic models of neoclassical growth and real business cycles are solved...
Multimedia Aids to Problem-Solving Transfer.
Mayer, Richard E.
1999-01-01
Reviews evidence from more than 40 studies that multimedia learning environments can promote constructivist learning that enables problem-solving transfer. Explores the problem of how multimedia instructional messages can be designed to promote problem-solving transfer. (SLD)
LEGO Robotics: An Authentic Problem Solving Tool?
Castledine, Alanah-Rei; Chalmers, Chris
2011-01-01
With the current curriculum focus on correlating classroom problem solving lessons to real-world contexts, are LEGO robotics an effective problem solving tool? This present study was designed to investigate this question and to ascertain what problem solving strategies primary students engaged with when working with LEGO robotics and whether the…
Disciplinary Foundations for Solving Interdisciplinary Scientific Problems
Zhang, Dongmei; Shen, Ji
2015-01-01
Problem-solving has been one of the major strands in science education research. But much of the problem-solving research has been conducted on discipline-based contexts; little research has been done on how students, especially individuals, solve interdisciplinary problems. To understand how individuals reason about interdisciplinary problems, we…
Perspectives on Problem Solving and Instruction
van Merrienboer, Jeroen J. G.
2013-01-01
Most educators claim that problem solving is important, but they take very different perspective on it and there is little agreement on how it should be taught. This article aims to sort out the different perspectives and discusses problem solving as a goal, a method, and a skill. As a goal, problem solving should not be limited to well-structured…
Developing Creativity through Collaborative Problem Solving
Albert, Lillie R.; Kim, Rina
2013-01-01
This paper discusses an alternative approach for developing problem solving experiences for students. The major argument is that students can develop their creativity by engaging in collaborative problem solving activities in which they apply a variety of mathematical methods creatively to solve problems. The argument is supported by: considering…
Problem Solving Applied to Teaching Technical Writing.
Parker, Anne
1990-01-01
Describes the problem-solving approach implemented in the University of Manitoba's first-year technical communication course. Considers technical writing as a process which can be broken down into steps: classify, analyze, test, and solve. Explains that this process offers students the methodology and flexibility they need to solve either…
Palomo, M.; Kralj, S.; van der Maarel, M. J. E. C.; Dijkhuizen, L.
2009-01-01
Glycogen branching enzymes (GBE) or 1,4-alpha-glucan branching enzymes (EC 2.4.1.18) introduce alpha-1,6 branching points in alpha-glucans, e.g., glycogen. To identify structural features in GBEs that determine their branching pattern specificity, the Deinococcus geothermalis and Deinococcus
Solving network design problems via decomposition, aggregation and approximation
Bärmann, Andreas
2016-01-01
Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. Contents Decomposition for Multi-Period Network Design Solving Network Design Problems via Ag...
2010-10-01
... Technical Assistance Branch, Marketing Services Division, Transportation and Marketing Programs... Administrator, Marketing Services Branch, Transportation and Marketing Programs, AMS, USDA, 1800 M Street, NW... Agricultural Marketing Service Farmers' Market Promotion Program: Notice of Request for Extension and Revision...
Constraint Satisfaction by Branch & Sample: anImplementation in C
DEFF Research Database (Denmark)
Galle, Per
1999-01-01
.) This Web publication presents B&S from the point of view of practical programming. The algorithm is incrementally developed from a simple sketch to full application independent source code in C, available free of charge on gentlemanly conditions. Concerns of user-machine interaction are introduced as part......The Branch & Sample algorithm (B&S) offers a search strategy potentially applicable to constraint satisfaction problems (CSPs) whose variables are interdependent in terms of the constraints to be satisfied. CSPs are often combinatorially explosive (have very large numbers of solutions...... of the algorithm development, and practical advice on how to incorporate B&S into an application program is offered by way of example. For the benefit of non-C programmers, the essentials of C notation is briefly explained....
Solving large mixed linear models using preconditioned conjugate gradient iteration.
Strandén, I; Lidauer, M
1999-12-01
Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.
Solving the structure of metakaolin
Energy Technology Data Exchange (ETDEWEB)
Proffen, Thomas E [Los Alamos National Laboratory; White, Claire E [Los Alamos National Laboratory; Provis, John L [UNIV. OF MELBOURNE; Riley, Daniel P [UNIV. OF MELBOURNE; Van Deventer, Jannie S J [UNIV. OF MELBOURNE
2009-01-01
Metakaolin has been used extensively as a cement additive and paint extender, and recently as a geopolymer precursor. This disordered layered aluminosilicate is formed via the dehydroxylation of kaolinite. However, an accurate representation of its atomic structure has bever before been presented. Here, a novel synergy between total scattering and density functional modeling is presented to solve the structure of metakaolin. The metastable structure is elucidated by iterating between least-squares real-space refinement using neutron pair distribution function data, and geometry optimization using density functional modeling. The resulting structural representation is both energetically feasible and in excellent agreement with experimental data. This accurate structure of metakaolin provides new insight into the local environment of the aluminum atoms, with evidence of the existence of tri-coordinated aluminum. By the availability of this detailed atomic description, there exists the opportunity to tailor chemical and mechanical processes involving metakaolin at the atomic level to obtain optimal performance at the macro-scale.
Pesticides and Asbestos Programs and Enforcement Branch Case Tracking System
U.S. Environmental Protection Agency — Tracks the entire life cycle of a regulated site from initial inspection through site response to enforcement actions. Separate site action history is maintained for...
Pesticides and Asbestos Programs and Enforcement Branch Case Tracking System
Tracks the entire life cycle of a regulated site from initial inspection through site response to enforcement actions. Separate site action history is maintained for each statute under which the site is regulated.
Partial Order Reduction for Probabilistic Branching Time
Baier, Christel; d' Argenio, P.R.; Größer, Marcus
2005-01-01
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both linear time and branching time specifications, methods have been developed to apply partial order reduction in the context of
Simple statistical model for branched aggregates
DEFF Research Database (Denmark)
Lemarchand, Claire; Hansen, Jesper Schmidt
2015-01-01
We propose a statistical model that can reproduce the size distribution of any branched aggregate, including amylopectin, dendrimers, molecular clusters of monoalcohols, and asphaltene nanoaggregates. It is based on the conditional probability for one molecule to form a new bond with a molecule...
Medial branch neurotomy in low back pain
Energy Technology Data Exchange (ETDEWEB)
Masala, Salvatore; Mammucari, Matteo; Simonetti, Giovanni [Interventional Radiology and Radiotherapy University ' ' Tor Vergata' ' , Department of Diagnostic and Molecular Imaging, Rome (Italy); Nano, Giovanni [Interventional Radiology and Radiotherapy University ' ' Tor Vergata' ' , Department of Diagnostic and Molecular Imaging, Rome (Italy); University ' ' Tor Vergata' ' , Department of Radiology, Rome (Italy); Marcia, Stefano [S. Giovanni di Dio Hospital, Department of Diagnostic and Molecular Imaging, Cagliari (Italy)
2012-07-15
This study aimed to assess the effectiveness of pulsed radiofrequency medial branch dorsal ramus neurotomy in patients with facet joint syndrome. From January 2008 to April 2010, 92 patients with facet joint syndrome diagnosed by strict inclusion criteria and controlled diagnostic blocks undergone medial branch neurotomy. We did not exclude patients with failed back surgery syndrome (FBSS). Electrodes (20G) with 5-mm active tip were placed under fluoroscopy guide parallel to medial branch. Patients were followed up by physical examination and by Visual Analog Scale and Oswestry Disability Index at 1, 6, and 12 months. In all cases, pain improvement was statistically significant and so quality of life. Three non-FBSS patients had to undergo a second neurotomy because of non-satisfactory pain decrease. Complications were reported in no case. Medial branch radiofrequency neurotomy has confirmed its well-established effectiveness in pain and quality of life improvement as long as strict inclusion criteria be fulfilled and nerve ablation be accomplished by parallel electrode positioning. This statement can be extended also to FBSS patients. (orig.)
Origin of buds, branches, and sprouts
Kevin T. Smith
2014-01-01
Recent research shows that survivor trees in rural, managed forests rebuild broken crowns with new branches and foliage after ice storm injury (Shortle et al. 2014). Veteran trees in historic parks and landscapes show repeated cycles of crown loss and recovery (Fay 2002). Crown rebuilding or reiteration from sprouts is a physiological response with architectural...
Academic Branch Libraries: Assessment and Collection Development
Poole, Julie
2009-01-01
An ongoing project at Mercer University's Regional Academic Center Libraries illustrates how utilizing established assessment guidelines, stakeholder input, and a clear understanding of audience and curriculum needs may all be used to optimize a collection. Academic branch libraries often have clear collection development limitations in terms of…
Headward growth and branching in subterranean channels
Kudrolli, Arshad; Ionkin, Nikolay; Panaitescu, Andreea
2017-11-01
We investigate the erosive growth of channels in a thin subsurface sedimentary layer driven by hydrodynamic drag toward understanding subterranean networks and their relation to river networks charged by ground water. Building on a model based on experimental observations of fluid-driven evolution of bed porosity, we focus on the characteristics of the channel growth and their bifurcations in a horizontal rectangular domain subject to various fluid source and sink distributions. We find that the erosion front between low- and high-porosity regions becomes unstable, giving rise to branched channel networks, depending on the spatial fluctuations of the fluid flow near the front and the degree to which the flow is above the erodibility threshold of the medium. Focusing on the growth of a network starting from a single channel, and by identifying the channel heads and their branch points, we find that the number of branches increases sublinearly and is affected by the source distribution. The mean angles between branches are found to be systematically lower than river networks in humid climates and depend on the domain geometry.
Methodological innovations in public health education: transdisciplinary problem solving.
Lawlor, Edward F; Kreuter, Matthew W; Sebert-Kuhlmann, Anne K; McBride, Timothy D
2015-03-01
In 2008, the faculty of the Brown School at Washington University in St. Louis designed a Master of Public Health program centered on transdisciplinary problem solving in public health. We have described the rationale for our approach, guiding principles and pedagogy for the program, and specific transdisciplinary competencies students acquire. We have explained how transdisciplinary content has been organized and delivered, how the program is being evaluated, and how we have demonstrated the feasibility of this approach for a Master of Public Health degree.
Solving the selective multi-category parallel-servicing problem
DEFF Research Database (Denmark)
Range, Troels Martin; Lusby, Richard Martin; Larsen, Jesper
2015-01-01
In this paper, we present a new scheduling problem and describe a shortest path-based heuristic as well as a dynamic programming-based exact optimization algorithm to solve it. The selective multi-category parallel-servicing problem arises when a set of jobs has to be scheduled on a server (machine...... interval of a given planning horizon, while respecting the server capacity and scheduling requirements. We compare the proposed solution methods with a Mixed Integer Linear Programming (MILP) formulation and show that the dynamic programming approach is faster when the number of categories is large...
Energy Technology Data Exchange (ETDEWEB)
Pagola, Silvina; Polymeros, Alekos; Kourkoumelis, Nikolaos
2017-02-01
The direct-space methods software
Tree Branching: Leonardo da Vinci's Rule versus Biomechanical Models
Minamino, Ryoko; Tateno, Masaki
2014-01-01
This study examined Leonardo da Vinci's rule (i.e., the sum of the cross-sectional area of all tree branches above a branching point at any height is equal to the cross-sectional area of the trunk or the branch immediately below the branching point) using simulations based on two biomechanical models: the uniform stress and elastic similarity models. Model calculations of the daughter/mother ratio (i.e., the ratio of the total cross-sectional area of the daughter branches to the cross-sectional area of the mother branch at the branching point) showed that both biomechanical models agreed with da Vinci's rule when the branching angles of daughter branches and the weights of lateral daughter branches were small; however, the models deviated from da Vinci's rule as the weights and/or the branching angles of lateral daughter branches increased. The calculated values of the two models were largely similar but differed in some ways. Field measurements of Fagus crenata and Abies homolepis also fit this trend, wherein models deviated from da Vinci's rule with increasing relative weights of lateral daughter branches. However, this deviation was small for a branching pattern in nature, where empirical measurements were taken under realistic measurement conditions; thus, da Vinci's rule did not critically contradict the biomechanical models in the case of real branching patterns, though the model calculations described the contradiction between da Vinci's rule and the biomechanical models. The field data for Fagus crenata fit the uniform stress model best, indicating that stress uniformity is the key constraint of branch morphology in Fagus crenata rather than elastic similarity or da Vinci's rule. On the other hand, mechanical constraints are not necessarily significant in the morphology of Abies homolepis branches, depending on the number of daughter branches. Rather, these branches were often in agreement with da Vinci's rule. PMID:24714065
Teaching People to Manage Constraints: Effects on Creative Problem-Solving
Peterson, David R.; Barrett, Jamie D.; Hester, Kimberly S.; Robledo, Issac C.; Hougen, Dean F.; Day, Eric A.; Mumford, Michael D.
2013-01-01
Constraints often inhibit creative problem-solving. This study examined the impact of training strategies for managing constraints on creative problem-solving. Undergraduates, 218 in all, were asked to work through 1 to 4 self-paced instructional programs focused on constraint management strategies. The quality, originality, and elegance of…
Randomized Controlled Trial of Problem-Solving Therapy for Minor Depression in Home Care
Gellis, Zvi D.; McGinty, Jean; Tierney, Lynda; Jordan, Cindy; Burton, Jean; Misener, Elizabeth
2008-01-01
Objective: Data are presented from a pilot research program initiated to develop, refine, and test the outcomes of problem-solving therapy that targets the needs of older adults with minor depression in home care settings. Method: A pilot randomized clinical trial compares the impact of problem-solving therapy for home care to treatment as usual…
The Impact of Parental Attitudes on Problem Solving Skills in High School Students
Tösten, Rasim; Han, Bünyamin; Anik, Sabri
2017-01-01
Problem solving skill is one of the important skills which are expected to be gained during the educational programs. In the development of children's skills and shaping the behaviors, parental attitudes are believed to be effective. That means problem-solving skills and behavioral characteristics of individuals are closely related. From that…
Hains, Anthony A.; Hains, Ann Higgins
1987-01-01
Taught social problem-solving skills and self-evaluation to institutionalized delinquent adolescents as part of a cognitive-behavioral therapy program. Demonstrated improvement in problem-solving on the hypothetical dilemmas, however the self-evaluation procedure had little effect on performance. Follow-up data suggest maintenance of treatment…
Wang, Jing; Matthews, Judith T.; Sereika, Susan M.; Chasens, Eileen R.; Ewing, Linda J.; Burke, Lora E.
2013-01-01
Problem solving is a key component of weight loss programs. The Social Problem Solving Inventory-Revised (SPSI-R) has not been evaluated in weight loss studies. The purpose of this study was to evaluate the psychometrics of the SPSI-R. Cronbach's a (0.95 for total score; 0.67-0.92 for subscales) confirmed internal consistency reliability. The…
Clinical considerations of the glandular branch of the lacrimal artery.
Kluckman, Matthew; Fan, Jerry; Balsiger, Heather; Scott, Gabriel; Gest, Thomas
2015-10-01
The lacrimal artery is classically described as a branch of the ophthalmic artery supplied by the internal carotid. In this study, 25 orbits were dissected to identify variations in glandular branching and to compare them to previously published accounts. The glandular branching patterns of the lacrimal artery fall into two categories, those that branch (56%) and those that do not branch (44%). We found the medial and lateral glandular branches to be equal in diameter with a divergence of 2.67-40.58 mm proximal to the gland parenchyma. The long glandular branches run alongside the superolateral aspect of the orbit. The lateral branch runs lateral to the lateral rectus muscle. The medial branch runs superomedial to the lateral rectus muscle and lateral to the superior rectus muscle. In relation to the lacrimal gland, the medial branch enters the superior aspect of the gland parenchyma and the lateral branch enters its inferior aspect. The average branch lengths were 17.88 mm (medial) and 13.51 mm (lateral) as measured with a Mitutoyo Absolute 1/100 mm caliper. We could not confirm the existence of a third branch supplying the lacrimal gland, as posited by other authors. The key finding in this study is that the lacrimal gland is predominantly supplied by two significant arterial branches, both of which must be identified during procedures involving the lateral orbit. © 2015 Wiley Periodicals, Inc.
Sustainability of International Branch Campuses in the United Arab Emirates: A Vision for the Future
Franklin, Angela; Alzouebi, Khadeegha
2014-01-01
The United Arab Emirates is developing higher education institutions that will contribute to an educational sector providing premium degree programs. There was a belief that the recognition and achievements these institutions attained over decades in their native land would be transferable in the implementation of international branch campuses.…
University Acceptance Features in the Open Arab University (Jordan Branch) Amman Jordan
ALmahasneh, Ebtisam Z.; ALhabees, Mahmoud A.
2012-01-01
The objective of this study is to evaluate the experience of the Open Arab University/Jordan branch, in terms of accepted students as well as the graduates from 2002 to 2005, and to conclude on one hand the relation between the students' genders, the majors and the scientific programs, and to study the differences between the number of graduates…
Emmons, Karen
The experimental branch library described in this report was located in the multicultural, economically depressed downtown area of Richmond, California. The library's three and a half years of operation are described including: (1) the criteria for the selection of material, (2) programs aimed at attracting teen-agers and younger children to the…
Community-powered problem solving.
Gouillart, Francis; Billings, Douglas
2013-04-01
Traditionally, companies have managed their constituencies with specific processes: marketing to customers, procuring from vendors, developing HR policies for employees, and so on. The problem is, such processes focus on repeatability and compliance, so they can lead to stagnation. Inviting your constituencies to collectively help you solve problems and exploit opportunities--"co-creation"--is a better approach. It allows you to continually tap the skills and insights of huge numbers of stakeholders and develop new ways to produce value for all. The idea is to provide stakeholders with platforms (physical and digital forums) on which they can interact, get them to start exploring new experiences and connections, and let the system grow organically. A co-creation initiative by a unit of Becton, Dickinson and Company demonstrates how this works. A global leader in syringes, BD set out to deepen its ties with hospital customers and help them reduce the incidence of infections from unsafe injection and syringe disposal practices. The effort began with a cross-functional internal team, brought in the hospital procurement and supply managers BD had relationships with, and then reached out to hospitals' infection-prevention and occupational health leaders. Eventually product designers, nurses, sustainability staffers, and even hospital CFOs were using the platform, contributing data that generated new best practices and reduced infections.
IDEAL Problem Solving dalam Pembelajaran Matematika
Directory of Open Access Journals (Sweden)
Eny Susiana
2012-01-01
Full Text Available Most educators agree that problem solving is among the most meaningful and importantkinds of learning and thingking. That is, the central focus of learning and instructionshould be learning to solve problems. There are several warrants supporting that claims.They are authenticity, relevance, problem solving engages deeper learning angtherefore enhances meaning making, and constructed to represent problems (problemsolving is more meaningful. It is the reason why we must provide teaching and learningto make studentâ€™s problem solving skill in progress. There are many informationprocessingmodels of problem solving, such as simplified model of the problem-solvingprocess by Gicks, Polyaâ€™s problem solving process etc. One of them is IDEAL problemsolving. Each letter of IDEAL is stand for an aspect of thinking that is important forproblem solving. IDEAL is identify problem, Define Goal, Explore possible strategies,Anticipate outcme and Act, and Look back and learn. Using peer interaction andquestion prompt in small group in IDEAL problem solving teaching and Learning canimprove problem solving skill.Kata kunci: IDEAL Problem Solving, Interaksi Sebaya, Pertanyaan Penuntun, KelompokKecil.
Aquatics Systems Branch: transdisciplinary research to address water-related environmental problems
Dong, Quan; Walters, Katie D.
2015-01-01
The Aquatic Systems Branch at the Fort Collins Science Center is a group of scientists dedicated to advancing interdisciplinary science and providing science support to solve water-related environmental issues. Natural resource managers have an increasing need for scientific information and stakeholders face enormous challenges of increasing and competing demands for water. Our scientists are leaders in ecological flows, riparian ecology, hydroscape ecology, ecosystem management, and contaminant biology. The Aquatic Systems Branch employs and develops state-of-the-science approaches in field investigations, laboratory experiments, remote sensing, simulation and predictive modeling, and decision support tools. We use the aquatic experimental laboratory, the greenhouse, the botanical garden and other advanced facilities to conduct unique research. Our scientists pursue research on the ground, in the rivers, and in the skies, generating and testing hypotheses and collecting quantitative information to support planning and design in natural resource management and aquatic restoration.
Elizari, Marcelo V; Baranchuk, Adrian; Chiale, Pablo A
2013-01-01
The so-called 'masquerading' type of right bundle branch block is caused by the simultaneous presence of a high-degree left anterior fascicular block often accompanied with severe left ventricular enlargement and/or fibrotic block in the anterolateral wall of the left ventricle. These conditions tend to reorient the terminal electrical forces of the QRS complex towards the left and upwards, in such a way that the characteristic slurred S wave in lead I becomes smaller or even disappears. In many cases of standard masquerading right bundle branch block, a small Q wave in lead I is present due to the initial forces of the left anterior fascicular block, which are oriented rightwards and inferiorly. However, in some cases, the Q wave in lead I also vanishes, and the mimicking of a left bundle branch block becomes perfect in standard leads. This is commonly associated with an inferior myocardial infarction or severe inferior fibrosis in cardiomyopathies. The typical QRS changes of right bundle branch block may eventually be concealed even in the right precordial leads; under such circumstances, the ECG diagnosis may be mistaken and the right bundle branch block totally missed. The masquerading right bundle branch block carries a poor prognosis, since it always implies the presence of a severe underlying heart disease.
Applying natural evolution for solving computational problems - Lecture 2
CERN. Geneva
2017-01-01
Darwin’s natural evolution theory has inspired computer scientists for solving computational problems. In a similar way to how humans and animals have evolved along millions of years, computational problems can be solved by evolving a population of solutions through generations until a good solution is found. In the first lecture, the fundaments of evolutionary computing (EC) will be described, covering the different phases that the evolutionary process implies. ECJ, a framework for researching in such field, will be also explained. In the second lecture, genetic programming (GP) will be covered. GP is a sub-field of EC where solutions are actual computational programs represented by trees. Bloat control and distributed evaluation will be introduced.
Applying natural evolution for solving computational problems - Lecture 1
CERN. Geneva
2017-01-01
Darwin’s natural evolution theory has inspired computer scientists for solving computational problems. In a similar way to how humans and animals have evolved along millions of years, computational problems can be solved by evolving a population of solutions through generations until a good solution is found. In the first lecture, the fundaments of evolutionary computing (EC) will be described, covering the different phases that the evolutionary process implies. ECJ, a framework for researching in such field, will be also explained. In the second lecture, genetic programming (GP) will be covered. GP is a sub-field of EC where solutions are actual computational programs represented by trees. Bloat control and distributed evaluation will be introduced.
Dielectric response of branched copper phthalocyanine
Hamam, Khalil J.; Al-Amar, Mohammad M.; Mezei, Gellert; Guda, Ramakrishna; Burns, Clement A.
2017-09-01
The dielectric constant of pressed pellets and thin films of branched copper phthalocyanine (CuPc) was investigated as a function of frequency from 0.1 kHz to 1 MHz and temperature from 20 °C to 100 °C. Surface morphology was studied using a scanning electron microscope. The high-frequency values of the dielectric constant of pellets and thin films are ~3.5 and ~5.8, respectively. The response was only weakly dependent on frequency and temperature. The branched structure of the CuPc molecules helped to cancel out the effects of low-frequency polarization mechanisms. A planar delocalized charge system with two-dimensional localization was found using time-resolved photoluminescence measurements.
Branching time, indeterminism and tense logic
DEFF Research Database (Denmark)
Ploug, Thomas; Øhrstrøm, Peter
2012-01-01
This paper deals with the historical and philosophical background of the introduction of the notion of branching time in philosophical logic as it is revealed in the hitherto unpublished mail-correspondence between Saul Kripke and A.N. Prior in the late 1950s. The paper reveals that the idea...... was first suggested by Saul Kripke in a letter to A.N. Prior, dated September 3, 1958, and it is shown how the elaboration of the idea in the course of the correspondence was intimately intervowen with considerations of how to represent indeterminism and of the adequacy of tensed logic in light of special...... relativity. The correspondence underpins the point that Prior’s later development of branching time may be understood as a crucial part of his attempt at the formulating a conceptual framework integrating basic human notions of time and free choice....
Branched standard spines of 3-manifolds
Benedetti, Riccardo
1997-01-01
This book provides a unified combinatorial realization of the categroies of (closed, oriented) 3-manifolds, combed 3-manifolds, framed 3-manifolds and spin 3-manifolds. In all four cases the objects of the realization are finite enhanced graphs, and only finitely many local moves have to be taken into account. These realizations are based on the notion of branched standard spine, introduced in the book as a combination of the notion of branched surface with that of standard spine. The book is intended for readers interested in low-dimensional topology, and some familiarity with the basics is assumed. A list of questions, some of which concerning relations with the theory of quantum invariants, is enclosed.
COELIAC TRUNK BRANCHING PATTERN AND VARIATION
Directory of Open Access Journals (Sweden)
Jude Jose Thomson
2017-01-01
Full Text Available BACKGROUND Anatomical variations involving the visceral arteries are common. However, variations in coeliac trunk are usually asymptomatic, they may become important in patients undergoing diagnostic angiography for gastrointestinal bleeding or prior to an operative procedure. This study was useful for knowing the possible morphological variations before an upper abdominal surgery. MATERIALS AND METHODS This was a descriptive study done by cadaveric dissection, conducted on thirty cadavers. The coeliac trunk being examined for its origin, branching pattern, distribution, and variations. Results were statistically analysed and compared with the previous studies. RESULTS In our study, 60% of the coeliac trunk shows variations and 40% have normal branching pattern. A complete absence of coeliac trunk was observed in one case. In the present study the Right inferior phrenic artery arising from coeliac trunk in 2 cases (6.6% and left inferior phrenic artery arising from coeliac trunk in 3 cases (9.9%. Both inferior phrenic arteries are arising from coeliac trunk in 2 cases (6.6%. The common hepatomesenteric trunk and gastro splenic trunk was found in 1 case (3.3%. Hepatosplenic trunk was found in 2 cases (6.6%. In another 2 cases (6.6% gastric and hepatic artery originate from coeliac trunk but splenic artery has a separate origin from abdominal aorta. An absent trunk was also found in 1 case (3.3%. In 5 cases (16.7% showed trifurcation with variation in the branching pattern. CONCLUSION The branching pattern and extreme degree variability in coeliac trunk as brought out in the observations of the present study make it obvious that the present study almost falls in description with previous studies.
Multiple-Block Ahead Branch Predictors
Seznec, André; Jourdan, Stéphan; Sainrat, Pascal; Michaud, Pierre
1996-01-01
A basic rule in computer architecture is that a processor cannot execute an application faster than it fetches its instructions. To overcome the instruction fetch bottleneck shown in wide-dispatch «brainiac» processors, this paper presents a novel cost-effective mechanism called the multiple-block ahead branch predictor that predicts in an efficient way addresses of multiple basic blocks in a single cycle. Moreover and unlike the previous multiple predictor schemes, the multiple-block ahead b...
CERN. Geneva
2017-01-01
Reactive Programming in gaining a lot of excitement. Many libraries, tools, and frameworks are beginning to make use of reactive libraries. Besides, applications dealing with big data or high frequency data can benefit from this programming paradigm. Come to this presentation to learn about what reactive programming is, what kind of problems it solves, how it solves them. We will take an example oriented approach to learning the programming model and the abstraction.
Assessment of Student Problem Solving Processes
Docktor, Jennifer; Heller, Kenneth
2009-11-01
Problem solving is a complex process important both in itself and as a tool for learning physics. Currently there is no standard way to measure problem solving that is independent of physics topic, pedagogy, and problem characteristics. At Minnesota we have been developing a rubric to evaluate students' written solutions to physics problems that is easy to use and reasonably valid and reliable. The rubric identifies five general problem-solving processes and defines the criteria to attain a score in each: useful description, physics approach, specific application of physics, math procedures, and logical progression. An important test of the instrument is to check whether these categories as represented in students' written solutions correspond to processes students engage in during problem solving. Eight problem-solving interviews were conducted with students enrolled in an introductory university physics course to compare what students write down during problem solving with what they say they were thinking about as determined by their interview statements.
Fabrication and characterization of branched carbon nanostructures
Directory of Open Access Journals (Sweden)
Sharali Malik
2016-09-01
Full Text Available Carbon nanotubes (CNTs have atomically smooth surfaces and tend not to form covalent bonds with composite matrix materials. Thus, it is the magnitude of the CNT/fiber interfacial strength that limits the amount of nanomechanical interlocking when using conventional CNTs to improve the structural behavior of composite materials through reinforcement. This arises from two well-known, long standing problems in this research field: (a inhomogeneous dispersion of the filler, which can lead to aggregation and (b insufficient reinforcement arising from bonding interactions between the filler and the matrix. These dispersion and reinforcement issues could be addressed by using branched multiwalled carbon nanotubes (b-MWCNTs as it is known that branched fibers can greatly enhance interfacial bonding and dispersability. Therefore, the use of b-MWCNTs would lead to improved mechanical performance and, in the case of conductive composites, improved electrical performance if the CNT filler was better dispersed and connected. This will provide major benefits to the existing commercial application of CNT-reinforced composites in electrostatic discharge materials (ESD: There would be also potential usage for energy conversion, e.g., in supercapacitors, solar cells and Li-ion batteries. However, the limited availability of b-MWCNTs has, to date, restricted their use in such technological applications. Herein, we report an inexpensive and simple method to fabricate large amounts of branched-MWCNTs, which opens the door to a multitude of possible applications.
Analog Processor To Solve Optimization Problems
Duong, Tuan A.; Eberhardt, Silvio P.; Thakoor, Anil P.
1993-01-01
Proposed analog processor solves "traveling-salesman" problem, considered paradigm of global-optimization problems involving routing or allocation of resources. Includes electronic neural network and auxiliary circuitry based partly on concepts described in "Neural-Network Processor Would Allocate Resources" (NPO-17781) and "Neural Network Solves 'Traveling-Salesman' Problem" (NPO-17807). Processor based on highly parallel computing solves problem in significantly less time.
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
DEFF Research Database (Denmark)
Fukasawa, R.; Longo, H.; Lysgaard, Jens
2006-01-01
The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an algorithm that combines both approaches: it works over the intersection of two polytopes, one associated...... with a traditional Lagrangean relaxation over q-routes, the other defined by bound, degree and capacity constraints. This is equivalent to a linear program with exponentially many variables and constraints that can lead to lower bounds that are superior to those given by previous methods. The resulting branch...
JPLEX: Java Simplex Implementation with Branch-and-Bound Search for Automated Test Assembly
Park, Ryoungsun; Kim, Jiseon; Dodd, Barbara G.; Chung, Hyewon
2011-01-01
JPLEX, short for Java simPLEX, is an automated test assembly (ATA) program. It is a mixed integer linear programming (MILP) solver written in Java. It reads in a configuration file, solves the minimization problem, and produces an output file for postprocessing. It implements the simplex algorithm to create a fully relaxed solution and…
Applying Cooperative Techniques in Teaching Problem Solving
Directory of Open Access Journals (Sweden)
Krisztina Barczi
2013-12-01
Full Text Available Teaching how to solve problems – from solving simple equations to solving difficult competition tasks – has been one of the greatest challenges for mathematics education for many years. Trying to find an effective method is an important educational task. Among others, the question arises as to whether a method in which students help each other might be useful. The present article describes part of an experiment that was designed to determine the effects of cooperative teaching techniques on the development of problem-solving skills.
Assertiveness and problem solving in midwives.
Yurtsal, Zeliha Burcu; Özdemir, Levent
2015-01-01
Midwifery profession is required to bring solutions to problems and a midwife is expected to be an assertive person and to develop midwifery care. This study was planned to examine the relationship between assertiveness and problem-solving skills of midwives. This cross-sectional study was conducted with 201 midwives between July 2008 and February 2009 in the city center of Sivas. The Rathus Assertiveness Schedule (RAS) and Problem Solving Inventory (PSI) were used to determine the level of assertiveness and problem-solving skills of midwives. Statistical methods were used as mean, standard deviation, percentage, Student's T, ANOVA and Tukey HSD, Kruskal Wallis, Fisher Exact, Pearson Correlation and Chi-square tests and P problem-solving skills training. A statistically significant negative correlation was found between the RAS and PSI scores. The RAS scores decreased while the problem-solving scores increased (r: -0451, P problem solving skills of midwives, and midwives who were assertive solved their problems better than did others. Assertiveness and problem-solving skills training will contribute to the success of the midwifery profession. Midwives able to solve problems, and display assertive behaviors will contribute to the development of midwifery profession.
Preserving the pulmonary vagus nerve branches during thoracoscopic esophagectomy
Weijs, Teus J.; Ruurda, Jelle P.|info:eu-repo/dai/nl/257561021; Luyer, Misha D P; Nieuwenhuijzen, Grard A P; van der Horst, Sylvia; Bleys, Ronald L A W|info:eu-repo/dai/nl/134440455; van Hillegersberg, Richard|info:eu-repo/dai/nl/110706242
Background: Pulmonary vagus branches are transected as part of a transthoracic esophagectomy and lymphadenectomy for cancer. This may contribute to the development of postoperative pulmonary complications. Studies in which sparing of the pulmonary vagus nerve branches during thoracoscopic
Asymmetric Branching in Biological Resource Distribution Networks
Brummer, Alexander Byers
There is a remarkable relationship between an organism's metabolic rate (resting power consumption) and the organism's mass. It may be a universal law of nature that an organism's resting metabolic rate is proportional to its mass to the power of 3/4. This relationship, known as Kleiber's Law, appears to be valid for both plants and animals. This law is important because it implies that larger organisms are more efficient than smaller organisms, and knowledge regarding metabolic rates are essential to a multitude of other fields in ecology and biology. This includes modeling the interactions of many species across multiple trophic levels, distributions of species abundances across large spatial landscapes, and even medical diagnostics for respiratory and cardiovascular pathologies. Previous models of vascular networks that seek to identify the origin of metabolic scaling have all been based on the unrealistic assumption of perfectly symmetric branching. In this dissertation I will present a theory of asymmetric branching in self-similar vascular networks (published by Brummer et al. in [9]). The theory shows that there can exist a suite of vascular forms that result in the often observed 3/4 metabolic scaling exponent of Kleiber's Law. Furthermore, the theory makes predictions regarding major morphological features related to vascular branching patterns and their relationships to metabolic scaling. These predictions are suggestive of evolutionary convergence in vascular branching. To test these predictions, I will present an analysis of real mammalian and plant vascular data that shows: (i) broad patterns in vascular networks across entire animal kingdoms and (ii) within these patterns, plant and mammalian vascular networks can be uniquely distinguished from one another (publication in preparation by Brummer et al.). I will also present results from a computational study in support of point (i). Namely, that asymmetric branching may be the optimal strategy to
A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem
Melab, Nouredine; Chakroun, Imen; Mezmaz, Mohand; Tuyttens, Daniel
2012-01-01
International audience; Branch-and-Bound (B&B) algorithms are time intensive tree-based exploration methods for solving to optimality combinatorial optimization problems. In this paper, we investigate the use of GPU computing as a major complementary way to speed up those methods. The focus is put on the bounding mechanism of B&B algorithms, which is the most time consuming part of their exploration process. We propose a parallel B&B algorithm based on a GPU-accelerated bounding model. The pr...
Symmetrical two dimensional scattering program
Hatfield, J.; Rusch, W. V. T.
1971-01-01
Computer program solves integral equation for currents induced by electric or magnetic plane wave incident upon one or more conducting cylinders with a midplane of symmetry. Program utilizes symmetry of the geometry. Restrictions on the program are given.
Zhang, Songchuan; Xia, Youshen
2018-01-01
Much research has been devoted to complex-variable optimization problems due to their engineering applications. However, the complex-valued optimization method for solving complex-variable optimization problems is still an active research area. This paper proposes two efficient complex-valued optimization methods for solving constrained nonlinear optimization problems of real functions in complex variables, respectively. One solves the complex-valued nonlinear programming problem with linear equality constraints. Another solves the complex-valued nonlinear programming problem with both linear equality constraints and an -norm constraint. Theoretically, we prove the global convergence of the proposed two complex-valued optimization algorithms under mild conditions. The proposed two algorithms can solve the complex-valued optimization problem completely in the complex domain and significantly extend existing complex-valued optimization algorithms. Numerical results further show that the proposed two algorithms have a faster speed than several conventional real-valued optimization algorithms.
A case of 'Masquerading' bundle branch block: a forgotten concept.
Choudhary, Dinesh; Namboodiri, Narayanan; Tharakan, Jaganmohan A
2014-01-01
'Masquerading' bundle branch block (right bundle branch block in the precordial leads with left bundle branch block in frontal leads and left axis deviation) is seen most commonly with coronary artery disease and hypertension. No definite explanation is available so far for these changes. We are presenting a case of rare congenital intranuclear inclusion myopathy with congestive heart failure and 'Masquerading' bundle branch block in ECG. Copyright © 2013 Cardiological Society of India. Published by Elsevier B.V. All rights reserved.
Flight Planning Branch NASA Co-op Tour
Marr, Aja M.
2013-01-01
This semester I worked with the Flight Planning Branch at the NASA Johnson Space Center. I learned about the different aspects of flight planning for the International Space Station as well as the software that is used internally and ISSLive! which is used to help educate the public on the space program. I had the opportunity to do on the job training in the Mission Control Center with the planning team. I transferred old timeline records from the planning team's old software to the new software in order to preserve the data for the future when the software is retired. I learned about the operations of the International Space Station, the importance of good communication between the different parts of the planning team, and enrolled in professional development classes as well as technical classes to learn about the space station.
Q-branch Raman scattering and modern kinetic thoery
Energy Technology Data Exchange (ETDEWEB)
Monchick, L. [The Johns Hopkins Univ., Laurel, MD (United States)
1993-12-01
The program is an extension of previous APL work whose general aim was to calculate line shapes of nearly resonant isolated line transitions with solutions of a popular quantum kinetic equation-the Waldmann-Snider equation-using well known advanced solution techniques developed for the classical Boltzmann equation. The advanced techniques explored have been a BGK type approximation, which is termed the Generalized Hess Method (GHM), and conversion of the collision operator to a block diagonal matrix of symmetric collision kernels which then can be approximated by discrete ordinate methods. The latter method, which is termed the Collision Kernel method (CC), is capable of the highest accuracy and has been used quite successfully for Q-branch Raman scattering. The GHM method, not quite as accurate, is applicable over a wider range of pressures and has proven quite useful.
2013-02-08
... sent to Julie Brewer, Chief, Policy and Program Development Branch, Child Nutrition Division, Food and..., Policy and Program Development Branch, Child Nutrition Division, Food and Nutrition Service, 3101 Park... Standards for Food Sold in Schools in Competition With School Meals Federal child nutrition programs play a...
Energy Technology Data Exchange (ETDEWEB)
Kolka, R.; Nelson, E.A.; Trettin, C.C.
2000-10-01
Development of an assessment framework and indicators can be used to evaluate effectiveness of wetland restoration. Example of these include index of biotic integrity and the hydrogeomorphic method. Both approaches provide qualitative ranks. We propose a new method based on the EPA wetland research program. Similar to other methods, indexes are compared to reference communities; however, the comparisons are quantitative. In this paper we discuss the results of our framework using the Pen Branch riparian wetland system as an example.
Editor's Choice - Effect of Branch Stent Choice on Branch-related Outcomes in Complex Aortic Repair.
Mastracci, T M; Carrell, T; Constantinou, J; Dias, N; Martin-Gonzalez, T; Katsargyris, A; Modarai, B; Resch, T; Verhoeven, E L G; Burnell, M; Haulon, S
2016-04-01
The use of branched stent grafts for the treatment of thoracoabdominal aneurysms [TAAA] is increasing, but mating stent graft choice has not been studied. This study combined experience of five high volume centres to assess a preferred mating stent. Data from five centres were retrospectively combined. Patients were included if they underwent stent graft for treatment of TAAA that used only branches to mate with visceral and renal vessels. All patients with fenestrations in their device were excluded. Perioperative details, reintervention, occlusion, and death were recorded. Outcome of occlusion or reintervention, as well as a composite outcome of any death, occlusion, or reintervention was planned using a per-patient, and per-branch analysis. In 235 included patients, there were 940 vessels available for placement of mating stent. The average age of included patients was 70 years (SD 7.9), and 179 of the 235 were male. Medical comorbidities included diabetes in 29/234 (12.4%), current smoker in 81/233 (34.8%), and COPD in 77/234 (32.9%). The primary stent deployed was self-expanding in 556 branches, balloon expandable in 231 branches, and was unknown in 92 branches. After a mean of 20.7 months (SD 25) follow-up, there have been 44 incidents of occlusion or reintervention, of which 40 culprit stents are known. Where the stent placed is known, the event rate in renal branches (35/437, 8%) is higher than that of visceral branches (8/443, 1.8%). There is no difference in occlusion or reintervention between self-expanding and balloon expandable stents (HR 0.95, p = .91) but there is a statistically significant difference between renal and visceral artery occlusions (HR 3.51, p = 0.001). There appears to be no difference in occlusion or reintervention rate for branch vessels mated with balloon expandable compared with self-expanding stents. Renal events appear to outnumber visceral events in this population. Copyright © 2016 European Society for Vascular Surgery
46 CFR 111.75-5 - Lighting branch circuits.
2010-10-01
... 46 Shipping 4 2010-10-01 2010-10-01 false Lighting branch circuits. 111.75-5 Section 111.75-5...-GENERAL REQUIREMENTS Lighting Circuits and Protection § 111.75-5 Lighting branch circuits. (a) Loads. A lighting distribution panel must not supply branch circuits rated at over 30 amperes. (b) Connected Load...
46 CFR 169.690 - Lighting branch circuits.
2010-10-01
... 46 Shipping 7 2010-10-01 2010-10-01 false Lighting branch circuits. 169.690 Section 169.690... Machinery and Electrical Electrical Installations on Vessels of 100 Gross Tons and Over § 169.690 Lighting branch circuits. Each lighting branch circuit must meet the requirements of § 111.75-5 of this chapter...
Dendrimers and methods of preparing same through proportionate branching
Energy Technology Data Exchange (ETDEWEB)
Yu, Yihua (Bruce); Yue, Xuyi
2015-09-15
The present invention provides for monodispersed dendrimers having a core, branches and periphery ends, wherein the number of branches increases exponentially from the core to the periphery end and the length of the branches increases exponentially from the periphery end to the core, thereby providing for attachment of chemical species at the periphery ends without exhibiting steric hindrance.
Weighted Branching Simulation Distance for Parametric Weighted Kripke Structures
DEFF Research Database (Denmark)
Foshammer, Louise; Larsen, Kim Guldstrand; Mariegaard, Anders
2016-01-01
This paper concerns branching simulation for weighted Kripke structures with parametric weights. Concretely, we consider a weighted extension of branching simulation where a single transitions can be matched by a sequence of transitions while preserving the branching behavior. We relax this notion...
Structural dynamics branch research and accomplishments to FY 1992
Lawrence, Charles
1992-01-01
This publication contains a collection of fiscal year 1992 research highlights from the Structural Dynamics Branch at NASA LeRC. Highlights from the branch's major work areas--Aeroelasticity, Vibration Control, Dynamic Systems, and Computational Structural Methods are included in the report as well as a listing of the fiscal year 1992 branch publications.
A Branch-and-Price Approach to the Feeder Network Design Problem
DEFF Research Database (Denmark)
Santini, Alberto; Plum, Christian Edinger Munk; Røpke, Stefan
2017-01-01
In this paper we consider the problem of designing a container liner shipping feeder network. The designer has to choose which port to serve during many rotations that start and end at a central hub. Many operational characteristics are considered, such as variable leg-by-leg speeds and cargo tra....... These insights were obtained by means of an analysis where scenarios are generated varying internal and external conditions, such as fuel costs and port demands....... transit times. Realistic instances are generated from the LinerLib benchmark suite. The problem is solved with a branch-and-price algorithm, which can solve most instances to optimality within one hour. The results also provide insights on the cost structure and desirable features of optimal routes...
Thermal Neutron Capture Branching Ratio of 209BI Using a Gamma-Ray Technique
Letourneau, A.; Berthoumieux, E.; Deruelle, O.; Fadil, M.; Fioni, G.; Gunsing, F.; Marie, F.; Perrot, L.; Ridikas, D.; Boerner, H.; Faust, H.; Mutti, P.; Simpson, G.; Schillebeeckx, P.
2003-06-01
A new experimental program concerning the measurement of the neutron capture branching ratio of 209Bi as a function of neutron energy has been proposed recently. The preliminary results obtained at the high neutron flux reactor of ILL with a thermal neutron flux are presented in this paper. The neutron capture cross section and the corresponding branching ratio are measured with an on-line gamma-ray spectroscopy method. We find for the capture cross section 35±1.75 mb, what is in a good agreement with existing results. For the partial cross sections we get σ210gs = 17.9±2 mb and σ210m =17.1±2 mb giving a branching ratio of 51%±5%. This value is by 25% smaller than values from evaluated libraries.
Hautmann, F.; Jung, H.; Lelek, A.; Radescu, V.; Žlebčík, R.
2018-01-01
We study parton-branching solutions of QCD evolution equations and present a method to construct both collinear and transverse momentum dependent (TMD) parton densities from this approach. We work with next-to-leading-order (NLO) accuracy in the strong coupling. Using the unitarity picture in terms of resolvable and non-resolvable branchings, we analyze the role of the soft-gluon resolution scale in the evolution equations. For longitudinal momentum distributions, we find agreement of our numerical calculations with existing evolution programs at the level of better than 1% over a range of five orders of magnitude both in evolution scale and in longitudinal momentum fraction. We make predictions for the evolution of transverse momentum distributions. We perform fits to the high-precision deep inelastic scattering (DIS) structure function measurements, and we present a set of NLO TMD distributions based on the parton branching approach.
Distance Measurement Solves Astrophysical Mysteries
2003-08-01
Location, location, and location. The old real-estate adage about what's really important proved applicable to astrophysics as astronomers used the sharp radio "vision" of the National Science Foundation's Very Long Baseline Array (VLBA) to pinpoint the distance to a pulsar. Their accurate distance measurement then resolved a dispute over the pulsar's birthplace, allowed the astronomers to determine the size of its neutron star and possibly solve a mystery about cosmic rays. "Getting an accurate distance to this pulsar gave us a real bonanza," said Walter Brisken, of the National Radio Astronomy Observatory (NRAO) in Socorro, NM. Monogem Ring The Monogem Ring, in X-Ray Image by ROSAT satellite CREDIT: Max-Planck Institute, American Astronomical Society (Click on Image for Larger Version) The pulsar, called PSR B0656+14, is in the constellation Gemini, and appears to be near the center of a circular supernova remnant that straddles Gemini and its neighboring constellation, Monoceros, and is thus called the Monogem Ring. Since pulsars are superdense, spinning neutron stars left over when a massive star explodes as a supernova, it was logical to assume that the Monogem Ring, the shell of debris from a supernova explosion, was the remnant of the blast that created the pulsar. However, astronomers using indirect methods of determining the distance to the pulsar had concluded that it was nearly 2500 light-years from Earth. On the other hand, the supernova remnant was determined to be only about 1000 light-years from Earth. It seemed unlikely that the two were related, but instead appeared nearby in the sky purely by a chance juxtaposition. Brisken and his colleagues used the VLBA to make precise measurements of the sky position of PSR B0656+14 from 2000 to 2002. They were able to detect the slight offset in the object's apparent position when viewed from opposite sides of Earth's orbit around the Sun. This effect, called parallax, provides a direct measurement of
Toward a Design Theory of Problem Solving.
Jonassen, David H.
2000-01-01
Proposes a metatheory of problem solving. Describes differences among problems in terms of their structured ness, domain specificity (abstractness), and complexity; describes individual differences that affect problem solving; and presents a typology of problems, each of which engages different cognitive, affective, and conative process and…
Concept mapping instrumental support for problem solving
Stoyanov, S.; Stoyanov, Slavi; Kommers, Petrus A.M.
2008-01-01
The main theoretical position of this paper is that it is the explicit problem-solving support in concept mapping software that produces a stronger effect in problem-solving performance than the implicit support afforded by the graphical functionality of concept mapping software. Explicit
Measuring Problem Solving Skills in "Portal 2"
Shute, Valerie J.; Wang, Lubin
2013-01-01
This paper examines possible improvement to problem solving skills as a function of playing the video game "Portal 2." Stealth assessment is used in the game to evaluate students' problem solving abilities--specifically basic and flexible rule application. The stealth assessment measures will be validated against commonly accepted…
Some Applications of Algebraic System Solving
Roanes-Lozano, Eugenio
2011-01-01
Technology and, in particular, computer algebra systems, allows us to change both the way we teach mathematics and the mathematical curriculum. Curiously enough, unlike what happens with linear system solving, algebraic system solving is not widely known. The aim of this paper is to show that, although the theory lying behind the "exact…
Solving Cubic Equations by Polynomial Decomposition
Kulkarni, Raghavendra G.
2011-01-01
Several mathematicians struggled to solve cubic equations, and in 1515 Scipione del Ferro reportedly solved the cubic while participating in a local mathematical contest, but did not bother to publish his method. Then it was Cardano (1539) who first published the solution to the general cubic equation in his book "The Great Art, or, The Rules of…
Mathematical problem solving in primary school
Kolovou, A.
2011-01-01
A student is engaged in (non-routine) problem solving when there is no clear pathway to the solution. In contrast to routine problems, non-routine ones cannot be solved through the direct application of a standard procedure. Consider the following problem: In a quiz you get two points for each
Computer-Based Assessment of Problem Solving.
Baker, E. L.; Mayer, R. E.
1999-01-01
Examines the components required to assess student problem solving in technology environments. Discusses the purposes of testing, provides an example demonstrating the difference between retention and transfer, defines and analyzes problem solving, and explores techniques and standards for measuring the quality of student understanding. Contains…
A Multivariate Model of Physics Problem Solving
Taasoobshirazi, Gita; Farley, John
2013-01-01
A model of expertise in physics problem solving was tested on undergraduate science, physics, and engineering majors enrolled in an introductory-level physics course. Structural equation modeling was used to test hypothesized relationships among variables linked to expertise in physics problem solving including motivation, metacognitive planning,…
Cooperative learning, problem solving and mediating artifacts
African Journals Online (AJOL)
PROF.MIREKU
African Journal of Educational Studies in Mathematics and Sciences Vol. 10, 2012. 39. Cooperative learning, problem solving and mediating artifacts. F. Bahmaei6 & N. Nejad Sadeghi. Abstract. The present study deals with the influence of cooperative learning on the ability of students to solve the problems. The study also ...
Strategy Keys as Tools for Problem Solving
Herold-Blasius, Raja
2017-01-01
Problem solving is one of the main competences we seek to teach students at school for use in their future lives. However, when dealing with mathematical problems, teachers encounter a wide variety of difficulties. To foster students' problem-solving skills, the authors developed "strategy keys." Strategy keys can serve as material to…
Metacognition: Student Reflections on Problem Solving
Wismath, Shelly; Orr, Doug; Good, Brandon
2014-01-01
Twenty-first century teaching and learning focus on the fundamental skills of critical thinking and problem solving, creativity and innovation, and collaboration and communication. Metacognition is a crucial aspect of both problem solving and critical thinking, but it is often difficult to get students to engage in authentic metacognitive…
6 Essential Questions for Problem Solving
Kress, Nancy Emerson
2017-01-01
One of the primary expectations that the author has for her students is for them to develop greater independence when solving complex and unique mathematical problems. The story of how the author supports her students as they gain confidence and independence with complex and unique problem-solving tasks, while honoring their expectations with…
Automatic Representation Changes in Problem Solving
1999-06-01
for a student of mathematics. Gestalt psychologists also paid particular attention to reformulation of problems [ Duncker , 1945; Ohlsson, 1984...Driskill and Jaime G. Carbonell. Search control in problem solving: A gapped macro operator approach. Unpublished Manuscript, 1996. [ Duncker , 1945] K... Duncker . On problem solving. Psychological Monographs, 58:1{113, 1945. [Ellman and Giunchiglia, 1998] Tom Ellman and Fausto Giunchiglia, editors
The Process of Solving Complex Problems
Fischer, Andreas; Greiff, Samuel; Funke, Joachim
2012-01-01
This article is about Complex Problem Solving (CPS), its history in a variety of research domains (e.g., human problem solving, expertise, decision making, and intelligence), a formal definition and a process theory of CPS applicable to the interdisciplinary field. CPS is portrayed as (a) knowledge acquisition and (b) knowledge application…
Dynamic Problem Solving: A New Assessment Perspective
Greiff, Samuel; Wustenberg, Sascha; Funke, Joachim
2012-01-01
This article addresses two unsolved measurement issues in dynamic problem solving (DPS) research: (a) unsystematic construction of DPS tests making a comparison of results obtained in different studies difficult and (b) use of time-intensive single tasks leading to severe reliability problems. To solve these issues, the MicroDYN approach is…
Creativity and Insight in Problem Solving
Golnabi, Laura
2016-01-01
This paper analyzes the thought process involved in problem solving and its categorization as creative thinking as defined by psychologist R. Weisberg (2006). Additionally, the notion of insight, sometimes present in unconscious creative thinking and often leading to creative ideas, is discussed in the context of geometry problem solving. In…
Bhimaraj, Arvind; Abusin, Salaheldin; Margeta, Bosko
2008-01-01
Alternating bundle branch block (ABBB) is a less commonly encountered phenomenon with the advent of re-perfusion therapy for acute myocardial infarction. ECGs simulating the appearance of an ABBB need to be carefully analysed. We present an ECG showing a baseline Left Bundle Branch Block(LBBB) progressing to a high grade AV block with escape complexes having a Right Bundle Branch Block (RBBB) morphology. Such an ECG can be mistaken for an ABBB if not analysed carefully. PMID:19116014
Cyanogen in NGC 1851 Red Giant Branch and Asymptotic Giant Branch Stars: Quadrimodal Distributions
DEFF Research Database (Denmark)
Campbell, S. W.; Yong, D.; Wylie-de Boer, E. C.
2012-01-01
The Galactic globular cluster NGC 1851 has raised much interest since Hubble Space Telescope photometry revealed that it hosts a double subgiant branch. Here we report on our homogeneous study into the cyanogen (CN) band strengths in the red giant branch (RGB) population (17 stars) and asymptotic...... giant branch (AGB) population (21 stars) using AAOmega/2dF spectra with R ~ 3000. We discover that NGC 1851 hosts a quadrimodal distribution of CN band strengths in its RGB and AGB populations. This result supports the merger formation scenario proposed for this cluster, such that the CN quadrimodality...... found that the four CN peaks may be paired—the two CN-weaker populations being associated with low Ba and the two CN-stronger populations with high Ba. If true, then s-process abundances would be a good diagnostic for disentangling the two original clusters in the merger scenario. More observations...
DEFF Research Database (Denmark)
Beck, Hans Christian
2005-01-01
Fatty acid biosynthesis by a mutant strain of Staphylococcus carnosus deficient in branched-chain amino acid aminotransferase (IlvE) activity was analysed. This mutant was unable to produce the appropriate branched-chain alpha-ketoacid precursors for branched-chain fatty acid biosynthesis from th...
Organization and targets of the European Branch
Energy Technology Data Exchange (ETDEWEB)
Cataldi, R.
1997-12-01
After a short historical review of the formation, objectives and organization of the International Geothermal Association (IGA), this paper describes the functions, goals and activities of the IGA European Branch. In particular, the paper illustrates the plan of action established for the periods 1993-`95 and 1996-`98, and the issues dealt with by the European Forum as of August 1996. The last section of the paper outlines the main problems to be faced in the near future in order to facilitate the aggregation of efforts, the amalgamation of promotional initiatives and the coordination of the basic activities needed for the consolidation and growth of the geothermal community in Europe. (orig.)
Anomaly matching on the Higgs branch
Shimizu, Hiroyuki; Tachikawa, Yuji; Zafrir, Gabi
2017-12-01
We point out that we can almost always determine by the anomaly matching the full anomaly polynomial of a supersymmetric theory in 2d, 4d or 6d if we assume that its Higgs branch is the one-instanton moduli space of some group G. This method not only provides by far the simplest method to compute the central charges of known theories of this class, e.g. 4d E 6,7,8 theories of Minahan and Nemeschansky or the 6d E-string theory, but also gives us new pieces of information about unknown theories of this class.
Branch Retinal Artery Occlusion following Dental Extraction
Tevfik Oğurel; Zafer Onaran; Reyhan Oğurel; Nurgül Örnek; Nesrin Büyüktortop Gökçınar; Kemal Örnek
2014-01-01
Aim. To describe a case of branch retinal artery occlusion following dental extraction and to point out the ophthalmic complications of dental procedures to ophthalmologists and dentists. Case. A 51-year-old woman was referred to our clinic with painless sudden visual loss in her left eye after tooth extraction two days ago. In her left eye the best corrected visual acuity was 6/30 and fundus examination revealed peripapillary flame-shaped hemorrhages and pale retina in the upper temporal arc...
Power system transient stability analysis based on branch potential characteristics
Han, Huan; Wang, Zengping
2017-09-01
Branch potential function is proposed based on the power system network preserving model. The concept of thermodynamics-entropy, is introduced to describe spatial distribution characteristics of the branch potential energy. Branch potential energy was analysed in time and space domain., with transient stability index proposed accordingly. The larger disturbance energy line fault injected to grid is, the larger branch energy entropy will be, and the more energy accumulated on key branches is, the more prone to lose stability the system will be. Simulation results on IEEE system proved its feasibility.
Aljaberi, Nahil M.; Gheith, Eman
2016-01-01
This study aims to investigate the ability of pre-service class teacher at University of Petrain solving mathematical problems using Polya's Techniques, their level of problem solving skills in daily-life issues. The study also investigates the correlation between their ability to solve mathematical problems and their level of problem solving…
Two versions of the SABOR 4 program, the ’piecewise version’, and the ’executive version’, are included in this report. The former permits examining...remaining computational phases before producing the desired final results (displacements, stress resultants, etc.) in printed or plotted form; the executive version of SABOR 4 is described in Appendix B.
Documentation as Problem Solving for Literacy Outreach Programs
Energy Technology Data Exchange (ETDEWEB)
Girill, T R
2004-07-06
Age-appropriate technical writing lessons for underperforming high-school students can offer them an innovative, ''authentic'' way to improve how they read and write. Thus the techniques and principles of effective technical communication routinely applied at work also provide a positive response to one of today's great educational challenges. This workshop shows participants how to (1) introduce English and science teachers to the value of technical writing as a response to school literacy problems, (2) prepare plausible practice exercises to help students improve their basic literacy, and (3) recognize and respond to known literacy outreach pitfalls. Every effective literacy outreach project based on technical writing needs to address four key problems.
Branching dynamics of viral information spreading
Iribarren, José Luis; Moro, Esteban
2011-10-01
Despite its importance for rumors or innovations propagation, peer-to-peer collaboration, social networking, or marketing, the dynamics of information spreading is not well understood. Since the diffusion depends on the heterogeneous patterns of human behavior and is driven by the participants’ decisions, its propagation dynamics shows surprising properties not explained by traditional epidemic or contagion models. Here we present a detailed analysis of our study of real viral marketing campaigns where tracking the propagation of a controlled message allowed us to analyze the structure and dynamics of a diffusion graph involving over 31 000 individuals. We found that information spreading displays a non-Markovian branching dynamics that can be modeled by a two-step Bellman-Harris branching process that generalizes the static models known in the literature and incorporates the high variability of human behavior. It explains accurately all the features of information propagation under the “tipping point” and can be used for prediction and management of viral information spreading processes.
Synthesis of branched naphthoquinones from castor oil
Directory of Open Access Journals (Sweden)
Adriano Olímpio da Silva
2012-06-01
Full Text Available The naphthoquinones are cyclic aromatic α,β-dienonas with a basic framework derived from naphthalene. They are also found in many higher plants, algae, fungi and as the product of the metabolism of some bacteria having large biologica activity described in the literature such as antibacterial, anti-inflammatory, antitumor, anticancer and trypanocidal [1-3]. Castor oil is an abundant raw material in Brazil of great versatility and, it is present in biodiesel production, surfactants, cosmetics and others. Considering the importance of naphthoquinones and, the availability of the ricinoleic acid from castor oil, the aim of this study was the preparation of new branched naphthoquinones in order to test their trypanocidal activity. Castor oil was submitted to saponification with sodium hydroxide, ethanol and water under reflux for 6 h. We then carried out an acid hydrolysis with hydrochloric acid and the formed ricinoleic acid was extracted with ethyl acetate. Following, through Kochi-Anderson addition reaction it was performed the alkylation of a naphthoquinone 1 and 2, using ammonium persulfate, silver nitrate, acetonitrile and water, under heating at 70-80 ° C during 3 h, to give the branched naphthoquinones 4 and 5 (scheme 1. The naphthoquinone 3 will be similarly submitted to this procedure. The naphthoquinones 4 and 5 were purified by column chromatography on sílica gel using hexane as the eluent. The compounds were characterized by mass spectrometry and 1H and 13CNMR spectroscopy.
Fixman compensating potential for general branched molecules
Energy Technology Data Exchange (ETDEWEB)
Jain, Abhinandan, E-mail: Abhi.Jain@jpl.nasa.gov [Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, California 91109 (United States); Kandel, Saugat; Wagner, Jeffrey; Larsen, Adrien; Vaidehi, Nagarajan, E-mail: nvaidehi@coh.org [Division of Immunology, Beckman Research Institute of the City of Hope, Duarte, California 91010 (United States)
2013-12-28
The technique of constraining high frequency modes of molecular motion is an effective way to increase simulation time scale and improve conformational sampling in molecular dynamics simulations. However, it has been shown that constraints on higher frequency modes such as bond lengths and bond angles stiffen the molecular model, thereby introducing systematic biases in the statistical behavior of the simulations. Fixman proposed a compensating potential to remove such biases in the thermodynamic and kinetic properties calculated from dynamics simulations. Previous implementations of the Fixman potential have been limited to only short serial chain systems. In this paper, we present a spatial operator algebra based algorithm to calculate the Fixman potential and its gradient within constrained dynamics simulations for branched topology molecules of any size. Our numerical studies on molecules of increasing complexity validate our algorithm by demonstrating recovery of the dihedral angle probability distribution function for systems that range in complexity from serial chains to protein molecules. We observe that the Fixman compensating potential recovers the free energy surface of a serial chain polymer, thus annulling the biases caused by constraining the bond lengths and bond angles. The inclusion of Fixman potential entails only a modest increase in the computational cost in these simulations. We believe that this work represents the first instance where the Fixman potential has been used for general branched systems, and establishes the viability for its use in constrained dynamics simulations of proteins and other macromolecules.
Enigma of Runaway Stars Solved
1997-01-01
Supernova Propels Companion Star through Interstellar Space The following success story is a classical illustration of scientific progress through concerted interplay of observation and theory. It concerns a 35-year old mystery which has now been solved by means of exciting observations of a strange double star. An added touch is the successive involvement of astronomers connected to the European Southern Observatory. For many years, astronomers have been puzzled by the fact that, among the thousands of very young, hot and heavy stars which have been observed in the Milky Way, there are some that move with exceptionally high velocities. In some cases, motions well above 100 km/sec, or ten times more than normal for such stars, have been measured. How is this possible? Which mechanism is responsible for the large amounts of energy needed to move such heavy bodies at such high speeds? Could it be that these stars are accelerated during the powerful explosion of a companion star as a supernova? Such a scenario was proposed in 1961 by Adriaan Blaauw [1], but until now, observational proof has been lacking. Now, however, strong supporting evidence for this mechanism has become available from observations obtained at the ESO La Silla observatory. The mysterious runaway stars OB-runaway stars [2] are heavy stars that travel through interstellar space with an anomalously high velocity. They have been known for several decades, but it has always been a problem to explain their high velocities. Although most OB-runaway stars are located at distances of several thousands of lightyears, their high velocity results in a measurable change in position on sky photos taken several years apart. The velocity component in the direction of the Earth can be measured very accurately from a spectrogram. From a combination of such observations, it is possible to measure the space velocity of OB-runaways. Bow shocks reveal runaway stars It has also been found that some OB-runaways display
Discontinuous conduction in mouse bundle branches is caused by bundle-branch architecture
van Veen, Toon A. B.; van Rijen, Harold V. M.; van Kempen, Marjan J. A.; Miquerol, Lucile; Opthof, Tobias; Gros, Daniel; Vos, Marc A.; Jongsma, Habo J.; de Bakker, Jacques M. T.
2005-01-01
Background - Recordings of the electrical activity of mouse bundle branches ( BBs) suggest reduced conduction velocity ( CV) in the midseptal compared with the proximal part of the BB. The present study was performed to elucidate the mechanism responsible for this slowing of conduction. Methods and
Modeling of branching density and branching distribution in low-density polyethylene polymerization
Kim, D.M.; Iedema, P.D.
2008-01-01
Low-density polyethylene (ldPE) is a general purpose polymer with various applications. By this reason, many publications can be found on the ldPE polymerization modeling. However, scission reaction and branching distribution are only recently considered in the modeling studies due to difficulties
Digital literacy and problem solving in technology-rich environments
Directory of Open Access Journals (Sweden)
Vesna Dolničar
2015-07-01
Full Text Available Rapid development and progress, as well as the growing presence of information and communications technologies dictate the need for more highly developed digital skills in individuals. The paper focuses on the concepts of digital skills and problem solving in technology-rich environments. It examines these on the basis of empirical data obtained in the international study PIAAC. The introductory part presents an overview of the literature and the results of previous research in the field of measurement of digital skills, and data on the use of information society services among the EU Member States. The second part of the article refers to the results obtained in the study PIAAC. The results, confirmed by the results of other studies, showed the impact of age and education level on the problem solving in technology-rich environments. Article concludes with suggestions for improving the current state of integration of all population groups in training programs in the field of digital skills.
Leprosy: a problem solved by 2000?
Stearns, A T
2002-09-01
It is now the year 2001, and in many endemic regions leprosy remains a public health problem by any definition. It is clear that defining leprosy purely by prevalence side-steps some of the real issues. There is still much to do to solve the problem of leprosy. Control programmes require better tests for early diagnosis if leprosy is to be reduced much further. Treatment of the infection and of reactions is still far from ideal, whilst an effective vaccine would be valuable in high-risk regions. Research into the true incidence in each endemic area is essential, and control programs of the future will need a more detailed understanding of the transmission of M. leprae to permit new logical interventions. Leprosy remains a devastating disease. Much of the damage that it inflicts is irreversible, and leads to disability and stigmatization. This is perhaps the greatest problem posed. It is easy to dwell on the successes of the elimination campaign, so diverting attention from those populations of 'cured' patients who still suffer from the consequences of infection. Leprosy should be regarded as a problem unsolved so long as patients continue to present with disabilities. WHO has carried out a highly successful campaign in reducing the prevalence of leprosy, and this needs to be acknowledged, but what is happening to the incidence in core endemic areas? Maintaining this success, however, may be an even greater struggle if funding is withdrawn and vertical programmes are absorbed into national health structures. We must take heed of the historian George Santayana, 'those who cannot remember the past are condemned to repeat it'. We should take the example of tuberculosis as a warning of the dangers of ignoring a disease before it has been fully controlled, and strive to continue the leprosy elimination programmes until there are no new cases presenting with disability. The World Health Organisation has shown that leprosy is an eminently treatable disease, and has
Additional chain-branching pathways in the low-temperature oxidation of branched alkanes
Wang, Zhandong
2015-12-31
Chain-branching reactions represent a general motif in chemistry, encountered in atmospheric chemistry, combustion, polymerization, and photochemistry; the nature and amount of radicals generated by chain-branching are decisive for the reaction progress, its energy signature, and the time towards its completion. In this study, experimental evidence for two new types of chain-branching reactions is presented, based upon detection of highly oxidized multifunctional molecules (HOM) formed during the gas-phase low-temperature oxidation of a branched alkane under conditions relevant to combustion. The oxidation of 2,5-dimethylhexane (DMH) in a jet-stirred reactor (JSR) was studied using synchrotron vacuum ultra-violet photoionization molecular beam mass spectrometry (SVUV-PI-MBMS). Specifically, species with four and five oxygen atoms were probed, having molecular formulas of C8H14O4 (e.g., diketo-hydroperoxide/keto-hydroperoxy cyclic ether) and C8H16O5 (e.g., keto-dihydroperoxide/dihydroperoxy cyclic ether), respectively. The formation of C8H16O5 species involves alternative isomerization of OOQOOH radicals via intramolecular H-atom migration, followed by third O2 addition, intramolecular isomerization, and OH release; C8H14O4 species are proposed to result from subsequent reactions of C8H16O5 species. The mechanistic pathways involving these species are related to those proposed as a source of low-volatility highly oxygenated species in Earth\\'s troposphere. At the higher temperatures relevant to auto-ignition, they can result in a net increase of hydroxyl radical production, so these are additional radical chain-branching pathways for ignition. The results presented herein extend the conceptual basis of reaction mechanisms used to predict the reaction behavior of ignition, and have implications on atmospheric gas-phase chemistry and the oxidative stability of organic substances. © 2015 The Combustion Institute.
Quantification of branching in model three-arm star polyethylene
Ramachandran, Ramnath
2012-01-24
The versatility of a novel scaling approach in quantifying the structure of model well-defined 3-arm star polyethylene molecules is presented. Many commercial polyethylenes have long side branches, and the nature and quantity of these branches varies widely among the various forms. For instance, low-density polyethylene (LDPE) is typically a highly branched structure with broad distributions in branch content, branch lengths and branch generation (in hyperbranched structures). This makes it difficult to accurately quantify the structure and the inherent structure-property relationships. To overcome this drawback, model well-defined hydrogenated polybutadiene (HPB) structures have been synthesized via anionic polymerization and hydrogenation to serve as model analogues to long-chain branched polyethylene. In this article, model 3-arm star polyethylene molecules are quantified using the scaling approach. Along with the long-chain branch content in polyethylene, the approach also provides unique measurements of long-chain branch length and hyperbranch content. Such detailed description facilitates better understanding of the effect of branching on the physical properties of polyethylene. © 2012 American Chemical Society.
Directory of Open Access Journals (Sweden)
Saori eOdagiri
2011-10-01
Full Text Available The granular retrosplenial cortex (GRS in the rat has a distinct microcoluimn-type structure. The apical tufts of dendritic bundles at layer I, which are formed by layer II neurons, co-localize with patches of thalamic terminations from anteroventral thalamic nucleus (AV. To further understand this microcolumn-type structure in the GRS, one of remaining questions is whether this structure extends into other layers, such as layers III/IV. Other than layer I, previous tracer injection study showed that AV thalamic nucleus also projects to layer III/IV in the GRS. In this study, we examined the morphology of branches in the GRS from the AV thalamus in single axon branch resolution in order to determine whether AV axon branches in layer III/IV are branches of axons with extensive branch in layer I, and, if so, whether the extent of these arborizations in layer III/IV vertically matches with that in layer I. For this purpose, we used a small volume injection of biotinylated dextran-amine into the AV thalamus and reconstructing labeled single axon branches in the GRS. We found that the AV axons consisted of heterogeneous branching types. Type 1 had extensive arborization occurring only in layer Ia. Type 2 had additional branches in III/IV. Types 1 and 2 had extensive ramifications in layer Ia, with lateral extensions within the previously reported extensions of tufts from single dendritic bundles (i.e., 30-200 µm; mean 78 µm. In type 2 branches, axon arborizations in layer III/IV were just below to layer Ia ramifications, but much wider (148-533 µm: mean, 341 µm than that in layer Ia axon branches and dendritic bundles, suggesting that layer-specific information transmission spacing existed even from the same single axons from the AV to the GRS. Thus, microcolumn-type structure in the upper layer of the GRS was not strictly continuous from layer I to layer IV. How each layer and its components interact each other in different spatial scale should
Deterministic equation solving over finite fields
Woestijne, Christiaan Evert van de
2006-01-01
It is shown how to solve diagonal forms in many variables over finite fields by means of a deterministic efficient algorithm. Applications to norm equations, quadratic forms, and elliptic curves are given.
How to solve applied mathematics problems
Moiseiwitsch, B L
2011-01-01
This workbook bridges the gap between lectures and practical applications, offering students of mathematics, engineering, and physics the chance to practice solving problems from a wide variety of fields. 2011 edition.
Broyden's Method for Solving Fuzzy Nonlinear Equations
National Research Council Canada - National Science Library
Ramli, Amirah; Abdullah, Mohd Lazim; Mamat, Mustafa
2010-01-01
Instead of using standard analytical techniques, like Buckley and Qu method, which are not suitable for solving a system of fuzzy nonlinear equations where the coefficient is fuzzy number, Broyden's...
Environmental problem-solving: Psychosocial factors
Miller, Alan
1982-11-01
This is a study of individual differences in environmental problem-solving, the probable roots of these differences, and their implications for the education of resource professionals. A group of student Resource Managers were required to elaborate their conception of a complex resource issue (Spruce Budworm management) and to generate some ideas on management policy. Of particular interest was the way in which subjects dealt with the psychosocial aspects of the problem. A structural and content analysis of responses indicated a predominance of relatively compartmentalized styles, a technological orientation, and a tendency to ignore psychosocial issues. A relationship between problem-solving behavior and personal (psychosocial) style was established which, in the context of other evidence, suggests that problem-solving behavior is influenced by more deep seated personality factors. The educational implication drawn was that problem-solving cannot be viewed simply as an intellectual-technical activity but one that involves, and requires the education of, the whole person.
Information problem solving and mental effort
Brand-Gruwel, Saskia; Frerejean, Jimmy
2012-01-01
Brand-Gruwel, S., & Frerejean, J. (2012, 5 September). Information problem solving and mental effort. Presentation at the EARLI ASC 2012 "Using eye tracking to design and evaluate education & training methods", Heerlen, The Netherlands.
Indoor Air Quality Problem Solving Tool
Use the IAQ Problem Solving Tool to learn about the connection between health complaints and common solutions in schools. This resource provides an easy, step-by-step process to start identifying and resolving IAQ problems found at your school.
Campbell, Bruce G.; Landmeyer, James E.
2014-01-01
, totaled about 1,117 square miles. Major types of data used as input to the model included groundwater levels, groundwater-use data, and hydrostratigraphic data, along with estimates and measurements of stream base flows made specifically for this study. The groundwater-flow model was calibrated to groundwater-level and stream base-flow conditions from 1900 to 2012 using 39 stress periods. The model was calibrated with an automated parameter-estimation approach using the computer program PEST, and the model used regularized inversion and pilot points. The groundwater-flow model was calibrated using field data that included groundwater levels that had been collected between 1940 and 2012 from 239 wells and base-flow measurements from 44 locations distributed within the study area. To better understand recharge and inter-aquifer interactions, seven wells were equipped with continuous groundwater-level recording equipment during the course of the study, between 2008 and 2012. These water levels were included in the model calibration process. The observed groundwater levels were compared to the simulated ones, and acceptable calibration fits were achieved. Root mean square error for the simulated groundwater levels compared to all observed groundwater levels was 9.3 feet for the Crouch Branch aquifer and 8.6 feet for the McQueen Branch aquifer. The calibrated groundwater-flow model was then used to calculate groundwater budgets for the entire study area and for two sub-areas. The sub-areas are the Alligator Rural Water and Sewer Company well field near McBee, South Carolina, and the Carolina Sandhills National Wildlife Refuge acquisition boundary area. For the overall model area, recharge rates vary from 56 to 1,679 million gallons per day (Mgal/d) with a mean of 737 Mgal/d over the simulation period (1900–2012). The simulated water budget for the streams and rivers varies from 653 to 1,127 Mgal/d with a mean of 944 Mgal/d. The simulated “storage-in term” ranges from 0