WorldWideScience

Sample records for branching programs solving

  1. Branch and Bound Experiments in Convex Nonlinear Integer Programming

    OpenAIRE

    Omprakash K. Gupta; Ravindran, A

    1985-01-01

    The branch and bound principle has long been established as an effective computational tool for solving mixed integer linear programming problems. This paper investigates the computational feasibility of branch and bound methods in solving convex nonlinear integer programming problems. The efficiency of a branch and bound method often depends on the rules used for selecting the branching variables and branching nodes. Among others, the concepts of pseudo-costs and estimations are implemented ...

  2. Program Transformation by Solving Equations

    Institute of Scientific and Technical Information of China (English)

    朱鸿

    1991-01-01

    Based on the theory of orthogonal program expansion[8-10],the paper proposes a method to transform programs by solving program equations.By the method,transformation goals are expressed in program equations,and achieved by solving these equations.Although such equations are usually too complicated to be solved directly,the orthogonal expansion of programs makes it possible to reduce such equations into systems of equations only containing simple constructors of programs.Then,the solutions of such equations can be derived by a system of solving and simplifying rules,and algebraic laws of programs.The paper discusses the methods to simplify and solve equations and gives some examples.

  3. A BRANCH AND BOUND ALGORITHM FOR SEPARABLE CONCAVE PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    Hong-gang Xue; Cheng-xian; Feng-min Xu

    2004-01-01

    In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB)technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved that the LDB method is a normal rectangle subdivision(NRS). Numerical tests on problems with dimensions from 100 to 10000 show that the proposed branch and bound algorithm is efficient for solving large scale separable concave programming problems, and convergence rate is faster than ω-subdivision method.

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

  5. The Problem-Solving Skills of the Teachers in Various Branches

    Science.gov (United States)

    Temel, Veysel

    2015-01-01

    The aim of this study was to determine the problem-solving skills of the teachers in various branches in Çat town of Erzurum Province in Turkey, using some variables. A total of 153 teachers (84 females, 69 males and age: 1.6536±0.72837) from different departments participated in the study. Problem Solving Inventory, developed by Heppner and…

  6. An Improved Chaotic Bat Algorithm for Solving Integer Programming Problems

    Directory of Open Access Journals (Sweden)

    Osama Abdel Raouf

    2014-08-01

    Full Text Available Bat Algorithm is a recently-developed method in the field of computational intelligence. In this paper is presented an improved version of a Bat Meta-heuristic Algorithm, (IBACH, for solving integer programming problems. The proposed algorithm uses chaotic behaviour to generate a candidate solution in behaviors similar to acoustic monophony. Numerical results show that the IBACH is able to obtain the optimal results in comparison to traditional methods (branch and bound, particle swarm optimization algorithm (PSO, standard Bat algorithm and other harmony search algorithms. However, the benefits of this proposed algorithm is in its ability to obtain the optimal solution within less computation, which save time in comparison with the branch and bound algorithm (exact solution method.

  7. A Novel Approach for Solving Semidefinite Programs

    Directory of Open Access Journals (Sweden)

    Hong-Wei Jiao

    2014-01-01

    Full Text Available A novel linearizing alternating direction augmented Lagrangian approach is proposed for effectively solving semidefinite programs (SDP. For every iteration, by fixing the other variables, the proposed approach alternatively optimizes the dual variables and the dual slack variables; then the primal variables, that is, Lagrange multipliers, are updated. In addition, the proposed approach renews all the variables in closed forms without solving any system of linear equations. Global convergence of the proposed approach is proved under mild conditions, and two numerical problems are given to demonstrate the effectiveness of the presented approach.

  8. Programming languages for business problem solving

    CERN Document Server

    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

  9. Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound

    Science.gov (United States)

    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.

  10. A New Approach to Solving Nonlinear Programming

    Institute of Scientific and Technical Information of China (English)

    SHEN Jie; CHEN Ling

    2002-01-01

    A method for solving nonlinear programming using genetic algorithm is presented. In the operations of crossover and mutation in each generation, to ensure the new solutions are all feasible, we present a method in which the bounds of every variable in the solution are estimated beforehand according to the constrained conditions. For the operation of mutation, we present two methods of cube bounding and variable bounding. The experimental results are given and analyzed. They show that the method is efficient and can obtain the results in less generation.

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

  12. Decision Condition for Solving Bilevel Linear Programming by Corresponding Single Level Linear Programming

    Institute of Scientific and Technical Information of China (English)

    LiliHan; RongshengLi

    2004-01-01

    This paper proposes a sufficient condition, if the properties of the bilevel programming satisfied the condition, we can solve the bilevel programming by solving single level programming. It becomes easy and simple to solve the bilevel programming.

  13. Algorithms for Quantum Branching Programs Based on Fingerprinting

    Directory of Open Access Journals (Sweden)

    Farid Ablayev

    2009-11-01

    Full Text Available In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs. Our method is based on fingerprinting technique and representation of Boolean functions by their characteristic polynomials. We use circuit notation for branching programs for desired algorithms presentation. For several known functions our approach provides optimal QOBDDs. Namely we consider such functions as Equality, Palindrome, and Permutation Matrix Test. We also propose a generalization of our method and apply it to the Boolean variant of the Hidden Subgroup Problem.

  14. Algorithms for Quantum Branching Programs Based on Fingerprinting

    CERN Document Server

    Ablayev, Farid; 10.4204/EPTCS.9.1

    2009-01-01

    In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on fingerprinting technique and representation of Boolean functions by their characteristic polynomials. We use circuit notation for branching programs for desired algorithms presentation. For several known functions our approach provides optimal QOBDDs. Namely we consider such functions as Equality, Palindrome, and Permutation Matrix Test. We also propose a generalization of our method and apply it to the Boolean variant of the Hidden Subgroup Problem.

  15. VOR programe package for calculating hydraulic shock in generally branched coolant circuit

    International Nuclear Information System (INIS)

    Using program VOR 1 it is possible to make steady-state hydraulic calcualtions of a generally branched pipe network. This program is used to solve initial conditions for the actual non-steady state calculation of hydraulic shock using program VOR 2. The physical flow model is one-dimensional, single-phase, pressure losses are concentrated at points of fictitious diaphragms. For numerical solution, the fictitious diaphragm method is used, which is an analogy of the graphic Schnyder-Bergeron method and the method of characteristics. A failure due to a shock may be modeled by changes in pressure, flow rate and the adjustment of the fitting at any arbitrary point in the circuit. The calculation will determine the time course of the pressure and flow rate at all points in the circuit. Selected as an example was seizing of the main circulating pump in one branch of the WWER primary circuit. (B.S.)

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

  17. A Branch and Bound Reduced Algorithm for Quadratic Programming Problems with Quadratic Constraints

    Directory of Open Access Journals (Sweden)

    Yuelin Gao

    2013-01-01

    Full Text Available We propose a branch and bound reduced algorithm for quadratic programming problems with quadratic constraints. In this algorithm, we determine the lower bound of the optimal value of original problem by constructing a linear relaxation programming problem. At the same time, in order to improve the degree of approximation and the convergence rate of acceleration, a rectangular reduction strategy is used in the algorithm. Numerical experiments show that the proposed algorithm is feasible and effective and can solve small- and medium-sized problems.

  18. An Integer Programming Approach to Solving Tantrix on Fixed Boards

    Directory of Open Access Journals (Sweden)

    Yushi Uno

    2012-03-01

    Full Text Available Tantrix (Tantrix R ⃝ is a registered trademark of Colour of Strategy Ltd. in New Zealand, and of TANTRIX JAPAN in Japan, respectively, under the license of M. McManaway, the inventor. is a puzzle to make a loop by connecting lines drawn on hexagonal tiles, and the objective of this research is to solve it by a computer. For this purpose, we first give a problem setting of solving Tantrix as making a loop on a given fixed board. We then formulate it as an integer program by describing the rules of Tantrix as its constraints, and solve it by a mathematical programming solver to have a solution. As a result, we establish a formulation that can solve Tantrix of moderate size, and even when the solutions are invalid only by elementary constraints, we achieved it by introducing additional constraints and re-solve it. By this approach we succeeded to solve Tantrix of size up to 60.

  19. A Trust Region Algorithm for Solving Bilevel Programming Problems

    Institute of Scientific and Technical Information of China (English)

    Guo-shan LIU; Shi-qin XU; Ji-ye HAN

    2013-01-01

    In this paper,we present a new trust region algorithm for a nonlinear bilevel programming problem by solving a series of its linear or quadratic approximation subproblems.For the nonlinear bilevel programming problem in which the lower level programming problem is a strongly convex programming problem with linear constraints,we show that each accumulation point of the iterative sequence produced by this algorithm is a stationary point of the bilevel programming problem.

  20. Taylor Series Approximation to Solve Neutrosophic Multiobjective Programming Problem

    Directory of Open Access Journals (Sweden)

    Ibrahim M. Hezam

    2015-12-01

    Full Text Available In this paper, Taylor series is used to solve neutrosophic multi-objective programming problem (NMOPP. In the proposed approach, the truth membership, Indeterminacy membership, falsity membership functions associated with each objective of multi-objective programming problems are transformed into a single objective linear programming problem by using a first order Taylor polynomial series. Finally, to illustrate the efficiency of the proposed method, a numerical experiment for supplier selection is given as an application of Taylor series method for solving neutrosophic multi-objective programming problem at end of this paper.

  1. A ROBUST TRUST REGION ALGORITHM FOR SOLVING GENERAL NONLINEAR PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    Xin-wei Liu; Ya-xiang Yuan

    2001-01-01

    The trust region approach has been extended to solving nonlinear constrained optimization. Most of these extensions consider only equality constraints and require strong global regularity assumptions. In this paper, a trust region algorithm for solving general nonlinear programming is presented, which solves an unconstrained piecewise quadratic trust region subproblem and a quadratic programming trust region subproblem at each iteration. A new technique for updating the penalty parameter is introduced. Under very mild conditions, the global convergence results are proved. Some local convergence results are also proved. Preliminary numerical results are also reported.

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

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

  3. NEWTON METHOD FOR SOLVING A CLASS OF SMOOTH CONVEX PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    YAO Yi-rong; ZHANG Lian-sheng; HAN Bo-shun

    2005-01-01

    An algorithm for solving a class of smooth convex programming is given. Using smooth exact multiplier penalty function,a smooth convex programming is minimized to a minimizing strongly convex function on the compact set was reduced. Then the strongly convex function with a Newton method on the given compact set was minimized.

  4. Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower's functions are separable with respect to the follower's variables, and the other is that the follower's functions are convex if the follower's variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader's variable x, it is proved that the optimal solution y of the follower's mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower's programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter A, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust.

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

  6. Solving Integer Programming Problems by Using Artificial Bee Colony Algorithm

    Science.gov (United States)

    Akay, Bahriye; Karaboga, Dervis

    This paper presents a study that applies the Artificial Bee Colony algorithm to integer programming problems and compares its performance with those of Particle Swarm Optimization algorithm variants and Branch and Bound technique presented to the literature. In order to cope with integer programming problems, in neighbour solution production unit, solutions are truncated to the nearest integer values. The experimental results show that Artificial Bee Colony algorithm can handle integer programming problems efficiently and Artificial Bee Colony algorithm can be considered to be very robust by the statistics calculated such as mean, median, standard deviation.

  7. Enhancing Digital Fluency through a Training Program for Creative Problem Solving Using Computer Programming

    Science.gov (United States)

    Kim, SugHee; Chung, KwangSik; Yu, HeonChang

    2013-01-01

    The purpose of this paper is to propose a training program for creative problem solving based on computer programming. The proposed program will encourage students to solve real-life problems through a creative thinking spiral related to cognitive skills with computer programming. With the goal of enhancing digital fluency through this proposed…

  8. An adaptive genetic algorithm for solving bilevel linear programming problem

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems.Various methods are proposed for solving this problem. Of all the algorithms, the genetic algorithm is an alternative to conventional approaches to find the solution of the bilevel linear programming. In this paper, we describe an adaptive genetic algorithm for solving the bilevel linear programming problem to overcome the difficulty of determining the probabilities of crossover and mutation. In addition, some techniques are adopted not only to deal with the difficulty that most of the chromosomes may be infeasible in solving constrained optimization problem with genetic algorithm but also to improve the efficiency of the algorithm. The performance of this proposed algorithm is illustrated by the examples from references.

  9. An Approach for Solving Linear Fractional Programming Problems

    Directory of Open Access Journals (Sweden)

    Andrew Oyakhobo Odior

    2012-08-01

    Full Text Available Linear fractional programming problems are useful tools in production planning, financial and corporate planning, health care and hospital planning and as such have attracted considerable research interest. 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 and partial fractions and an example is given to clarify the developed method.

  10. Improve Problem Solving Skills through Adapting Programming Tools

    Science.gov (United States)

    Shaykhian, Linda H.; Shaykhian, Gholam Ali

    2007-01-01

    There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.

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

  12. Modified Filled Function to Solve NonlinearProgramming Problem

    Institute of Scientific and Technical Information of China (English)

    2015-01-01

    Filled function method is an approach to find the global minimum of nonlinear functions. Many Problems, such as computing,communication control, and management, in real applications naturally result in global optimization formulations in a form ofnonlinear global integer programming. This paper gives a modified filled function method to solve the nonlinear global integerprogramming problem. The properties of the proposed modified filled function are also discussed in this paper. The results ofpreliminary numerical experiments are also reported.

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

  14. Neural network for solving convex quadratic bilevel programming problems.

    Science.gov (United States)

    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.

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

  16. A recurrent neural network for solving bilevel linear programming problem.

    Science.gov (United States)

    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.

  17. An exercise in transformational programming: Backtracking and Branch-and-Bound

    NARCIS (Netherlands)

    Fokkinga, M.M.

    1991-01-01

    We present a formal derivation of program schemes that are usually called Backtracking programs and Branch-and-Bound programs. The derivation consists of a series of transformation steps, specifically algebraic manipulations, on the initial specification until the desired programs are obtained. The

  18. Third annual Walker Branch watershed research symposium: Programs and abstracts

    International Nuclear Information System (INIS)

    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. 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 Department of Energy's local research site, Walker Branch Watershed, is a long-term ecosystem research project initiated on the Oak Ridge Reservation in 1967. Walker Branch provides a well-characterized site where many of these methods can be tested and applied.In addition, other large-scale experiments represented in this symposium include experiments on the effects of clearcutting and burning on forest structure and productivity associated with Coweeta Hydrologic Laboratory, and whole-tree ozone exposure chambers constructed by TVA and ORNL researchers

  19. A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Bendsøe, Martin P.

    2007-01-01

    finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities...

  20. An exercise in transformational programming: Backtracking and Branch-and-Bound

    OpenAIRE

    Fokkinga, M.M.

    1991-01-01

    We present a formal derivation of program schemes that are usually called Backtracking programs and Branch-and-Bound programs. The derivation consists of a series of transformation steps, specifically algebraic manipulations, on the initial specification until the desired programs are obtained. The well-known notions of linear recursion and tail recursion are extended, for structures, to elementwise linear recursion and elementwise tail recursion; and a transformation between them is derived ...

  1. Fourth annual Walker Branch Watershed research symposium: Program and abstracts

    International Nuclear Information System (INIS)

    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. This symposium highlights the use of large-scale ecosystem experiments to address environmental issues of global concern. These experiments provide the only effective way to test models of ecosystem response that are based on the current state of knowledge of hydrology, biogeochemistry, plant physiology, and other ecosystem processes. Major environmental problems that are being addressed include acidic deposition and nitrogen loading (Bear Brook Watershed, Maine; and the Girdsjoen Covered Catchment, Sweden); climate warming (Soil Warming Experiment, Maine); and altered rainfall amounts (Savannah River Loblolly Pine Soil Water Manipulation and the Walker Branch Watershed Throughfall Displacement Experiment)

  2. SEQUENTIAL CONVEX PROGRAMMING METHODS FOR SOLVING LARGE TOPOLOGY OPTIMIZATION PROBLEMS: IMPLEMENTATION AND COMPUTATIONAL RESULTS

    Institute of Scientific and Technical Information of China (English)

    Qin Ni; Ch. Zillober; K. Schittkowski

    2005-01-01

    In this paper, we describe a method to solve large-scale structural optimization problems by sequential convex programming (SCP). A predictor-corrector interior point method is applied to solve the strictly convex subproblems. The SCP algorithm and the topology optimization approach are introduced. Especially, different strategies to solve certain linear systems of equations are analyzed. Numerical results are presented to show the efficiency of the proposed method for solving topology optimization problems and to compare different variants.

  3. A program package for solving nonlinear optimization problems

    International Nuclear Information System (INIS)

    For the solution of nonlinear optimization problems, sixteen programs have been prepared and tested on FACOM M200 computer. A set of auxiliary programs has also been equipped to facilitate the use of this program package, with the main stress on the reduction of the effort that is required for the preparation of the main program. An attempt has been made to unify the input/output format as far as possible throughout the auxiliary programs. The programs have been classified broadly into two categories according to whether it can treat the problems with constraints or not. Moreover, from the viewpoint of the characteristics of the solution techniques, the programs that can be used only for the problems without constraints have been sub-divided into the following three classes; the first class involves only the objective function values themselves, the second involves the values of the objective function and their first partial derivatives, and the last involves the second partial derivatives as well. In order to make this program package available to various users, the explanation on the calculational procedure, the meaning of the arguments in the calling sequence of each program and the instructions about input data requirements of each auxiliary program have been presented together with the sample input/output listings. (author)

  4. A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

    DEFF Research Database (Denmark)

    Robenek, Tomáš; Umang, Nitish; Bierlaire, Michel;

    2014-01-01

    In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight the diffe......In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight......-shaking neighborhood search is presented. The proposed algorithms are tested and validated through numerical experiments based on instances inspired from real bulk port data. The results indicate that the algorithms can be successfully used to solve instances containing up to 40 vessels within reasonable computational...

  5. UNITE and Management Training Program for Workplace Communication & Problem Solving.

    Science.gov (United States)

    Kaufman, Sanda

    This curriculum provides materials for a training program designed to enable front-line supervisors and union stewards to minimize production disruptions stemming from ongoing, unresolved conflicts among production workers. The program accomplishes this goal by giving participants the tools and confidence to design, implement, and run a process…

  6. Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound

    OpenAIRE

    Artigues, Christian; Gendreau, Michel; Rousseau, Louis-Martin; Vergnaud, Adrien

    2009-01-01

    We propose exact hybrid methods based on integer linear programming and constraint programming for an integrated employee timetabling and job-shop scheduling problem. Each method we investigate uses a constraint programming (CP) formulation associated with a linear programming (LP) relaxation. Under a CP framework, the LP-relaxation is integrated into a global constraint using in addition reduced cost-based filtering techniques. We propose two CP formulations of the problem yielding two diffe...

  7. Approximate Dynamic Programming Solving the Curses of Dimensionality

    CERN Document Server

    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

  8. A scenario tree-based decomposition for solving multistage stochastic programs. With application in energy production

    Energy Technology Data Exchange (ETDEWEB)

    Mahlke, Debora

    2011-07-01

    This thesis is concerned with the development and implementation of an optimization method for the solution of multistage stochastic mixed-integer programs arising in energy production. Motivated by the strong increase in electricity produced from wind energy, we investigate the question of how energy storages may contribute to integrate the strongly fluctuating wind power into the electric power network. In order to study the economics of energy storages, we consider a power generation system which consists of conventional power plants, different types of energy storages, and an offshore wind park which supplies a region of certain dimension with electrical energy. On this basis, we aim at optimizing the commitment of the facilities over several days minimizing the overall costs. We formulate the problem as a mixed-integer optimization program concentrating on the combinatorial and stochastic aspects. The nonlinearities arising from partial load efficiencies of the units are approximated by piece-wise linear functions. In order to account for the uncertainty regarding the fluctuations of the available wind power and of the prices for electricity purchased on the spot market, we describe the affected data via a scenario tree. Altogether, we obtain a stochastic multistage mixed-integer problem (SMIP) of high complexity whose solution is algorithmically and computationally challenging. The main focus of this thesis is on the development of a scenario tree-based decomposition approach combined with a branch-and-bound method (SD-BB) for solution of the SMIP described above. This novel method relies on the decomposition of the original formulation into several subproblems based on the splitting of the scenario tree into subtrees. Using a branch-and-bound framework which we extend by Lagrangian relaxation, we can solve the problem to global optimality. In order to support the solution process, we investigate the polyhedral substructure which results from the description

  9. A Novel Tabular Form of the Simplex Method for Solving Linear Programming Problems

    Directory of Open Access Journals (Sweden)

    Akaninyene Obot

    2016-01-01

    Full Text Available A new tabular form of the simplex method for solving linear programming problems is presented in this paper. There are many variants of the simplex method. The existing different tabular forms of the simplex method are difficult to comprehend, boring, not straight forward, confusing and tedious. The results obtained based on the proposed method are simpler and computationally more efficient for calculations of linear programs, than other competing simplex methods by other writers. The proposed method could be applied to solve Operations Research based problems in fuzzy linear programming, goal programming, transportation and assignment problems, game problems, and for carrying out sensitivity analysis in linear programming.

  10. Learning Problem-Solving through Making Games at the Game Design and Learning Summer Program

    Science.gov (United States)

    Akcaoglu, Mete

    2014-01-01

    Today's complex and fast-evolving world necessitates young students to possess design and problem-solving skills more than ever. One alternative method of teaching children problem-solving or thinking skills has been using computer programming, and more recently, game-design tasks. In this pre-experimental study, a group of middle school…

  11. Approximate dynamic programming solving the curses of dimensionality

    CERN Document Server

    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.

  12. How Does Early Feedback in an Online Programming Course Change Problem Solving?

    Science.gov (United States)

    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…

  13. The Expansion of Dynamic Solving Process About a Class of Non-linear Programming Problems

    Institute of Scientific and Technical Information of China (English)

    ZANG Zhen-chun

    2001-01-01

    In this paper, we research non-linear programming problems which have a given specialstructure, some simple forms of this kind structure have been solved in some papers, here we focus on othercomplex ones.

  14. The Effects of Teaching Programming via Scratch on Problem Solving Skills: A Discussion from Learners' Perspective

    OpenAIRE

    The Effects of Teaching Programming via Scratch on Problem Solving Skills: A Discussion from Learners' Perspective; GÜLBAHAR, Yasemin

    2014-01-01

    Computer programming is perceived as an important competence for the development of problem solving skills in addition to logical reasoning. Hence, its integration throughout all educational levels, as well as the early ages, is considered valuable and research studies are carried out to explore the phenomenon in more detail. In light of these facts, this study is an exploratory effort to investigate the effect of Scratch programming on 5th grade primary school students' problem solving skill...

  15. Solving fully fuzzy multiple objective linear programming problems: A new perspective

    Directory of Open Access Journals (Sweden)

    A. Hadi-Vencheh

    2014-08-01

    Full Text Available In this paper a systematic process has been proposed to solve a fully fuzzy multi objective linear programming problem (FFMOLPP. Using the utility vector the MOLPP is transferred to a single objective programming and this single fuzzy object problem is simply solved by one of the fuzzy approaches.A numerical example is then given to show applicability of the proposed approach.

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

  17. A FORTRAN program for solving two-dimensional Euler equations with Godunov methods-user's manual

    OpenAIRE

    Eidelman, S

    1983-01-01

    A description is given of a program which solves the two-dimensional Euler equations using Godunov Methods. The program was recoded in Fortran from Pascal and accomodates either cascade" or channel flow boundary conditions. The equa - tions, boundary conditions and numerical method are outlined and the structure of the program is given. Results using the Fortran and Pascal versions are briefly compared. The documentation describes a program undergoing development and is not a f...

  18. Comparing Mixed & Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems

    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.

  19. Developing Student Programming and Problem-Solving Skills with Visual Basic

    Science.gov (United States)

    Siegle, Del

    2009-01-01

    Although most computer users will never need to write a computer program, many students enjoy the challenge of creating one. Computer programming enhances students' problem solving by forcing students to break a problem into its component pieces and reassemble it in a generic format that can be understood by a nonsentient entity. It promotes…

  20. Developing a pedagogical problem solving view for mathematics teachers with two reflection programs

    Directory of Open Access Journals (Sweden)

    Bracha KRAMARSKI

    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.

  1. The Comparative Relation and Its Application in solving Fuzzy Linear Programming Problem

    Directory of Open Access Journals (Sweden)

    Nguyen Thien Luan

    2012-07-01

    Full Text Available This paper considers linear programming problem whose objective function is fuzzy numbers vector. In order to solve this problem, we first present a new definition of comparative relation on the set of fuzzy numbers. Based on this definition, we state a method to compare fuzzy numbers directly and then, by the related theorems and lemmas, we build an algorithm to solve fuzzy presented problem.

  2. GLOBAL CONVERGENCE AND IMPLEMENTATION OF NGTN METHOD FOR SOLVING LARGE-SCALE SPARSE NONLINEAR PROGRAMMING PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Qin Ni

    2001-01-01

    An NGTN method was proposed for solving large-scale sparse nonlinear programming (NLP) problems. This is a hybrid method of a truncated Newton direction and a modified negative gradient direction, which is suitable for handling sparse data structure and possesses Q-quadratic convergence rate. The global convergence of this new method is proved,the convergence rate is further analysed, and the detailed implementation is discussed in this paper. Some numerical tests for solving truss optimization and large sparse problems are reported. The theoretical and numerical results show that the new method is efficient for solving large-scale sparse NLP problems.

  3. Solving Bilevel Multiobjective Programming Problem by Elite Quantum Behaved Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Tao Zhang

    2012-01-01

    Full Text Available An elite quantum behaved particle swarm optimization (EQPSO algorithm is proposed, in which an elite strategy is exerted for the global best particle to prevent premature convergence of the swarm. The EQPSO algorithm is employed for solving bilevel multiobjective programming problem (BLMPP in this study, which has never been reported in other literatures. Finally, we use eight different test problems to measure and evaluate the proposed algorithm, including low dimension and high dimension BLMPPs, as well as attempt to solve the BLMPPs whose theoretical Pareto optimal front is not known. The experimental results show that the proposed algorithm is a feasible and efficient method for solving BLMPPs.

  4. The Effects of Teaching Programming via Scratch on Problem Solving Skills: A Discussion from Learners' Perspective

    Directory of Open Access Journals (Sweden)

    The Effects of Teaching Programming via Scratch on Problem Solving Skills: A Discussion from Learners' Perspective

    2014-04-01

    Full Text Available Computer programming is perceived as an important competence for the development of problem solving skills in addition to logical reasoning. Hence, its integration throughout all educational levels, as well as the early ages, is considered valuable and research studies are carried out to explore the phenomenon in more detail. In light of these facts, this study is an exploratory effort to investigate the effect of Scratch programming on 5th grade primary school students' problem solving skills. Moreover, the researchers wondered what 5th grade primary school students think about programming. This study was carried out in an explanatory sequential mixed methods design with the participation of 49 primary school students. According to the quantitative results, programming in Scratch platform did not cause any significant differences in the problem solving skills of the primary school students. There is only a non-significant increase in the mean of the factor of "self- confidence in their problem solving ability". When the thoughts of the primary students were considered, it can be clearly stated that all the students liked programming and wanted to improve their programming. Finally, most of the students found the Scratch platform easy to use.

  5. Method for solving fully fuzzy linear programming problems using deviation degree measure

    Institute of Scientific and Technical Information of China (English)

    Haifang Cheng; Weilai Huang; Jianhu Cai

    2013-01-01

    A new ful y fuzzy linear programming (FFLP) prob-lem with fuzzy equality constraints is discussed. Using deviation degree measures, the FFLP problem is transformed into a crispδ-parametric linear programming (LP) problem. Giving the value of deviation degree in each constraint, the δ-fuzzy optimal so-lution of the FFLP problem can be obtained by solving this LP problem. An algorithm is also proposed to find a balance-fuzzy optimal solution between two goals in conflict: to improve the va-lues of the objective function and to decrease the values of the deviation degrees. A numerical example is solved to il ustrate the proposed method.

  6. The Strengthening Families Program 10-14: influence on parent and youth problem-solving skill.

    Science.gov (United States)

    Semeniuk, Y; Brown, R L; Riesch, S K; Zywicki, M; Hopper, J; Henriques, J B

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

  7. An Evolutionary Algorithm for Solving Bilevel Programming Problems Using Duality Conditions

    OpenAIRE

    Hecheng Li; Lei Fang

    2012-01-01

    Bilevel programming is characterized by two optimization problems located at different levels, in which the constraint region of the upper level problem is implicitly determined by the lower level problem. This paper is focused on a class of bilevel programming with a linear lower level problem and presents a new algorithm for solving this kind of problems by combining an evolutionary algorithm with the duality principle. First, by using the prime-dual conditions of the lower level problem, t...

  8. Analysis of the Effect of a Social Problem-Solving Program on the Aggression of Children

    Science.gov (United States)

    Secer, Zarife; Ogelman, Hulya Gulay

    2011-01-01

    The aim of this research was to establish the effect of a social problem-solving training program for 8th grade students. In the experimental group, 14 students were 14 years old and 1 student was 15 years old. In the control group, 13 students were 14 years old and 2 students were 15 years old. The Aggression Questionnaire (AQ) was administered…

  9. The Effects of Teaching Programming via Scratch on Problem Solving Skills: A Discussion from Learners' Perspective

    Science.gov (United States)

    Kalelioglu, Filiz; Gülbahar, Yasemin

    2014-01-01

    Computer programming is perceived as an important competence for the development of problem solving skills in addition to logical reasoning. Hence, its integration throughout all educational levels, as well as the early ages, is considered valuable and research studies are carried out to explore the phenomenon in more detail. In light of these…

  10. Taylor Approach for Solving Non-Linear Bi-level Programming Problem

    Directory of Open Access Journals (Sweden)

    Eghbal Hosseini

    Full Text Available In recent years the bi-level programming problem (BLPP is interested by many researchers and it is known as an appropriate tool to solve the real problems in several areas such as computer science, engineering, economic, traffic, finance, management and ...

  11. Students' Usability Evaluation of a Web-Based Tutorial Program for College Biology Problem Solving

    Science.gov (United States)

    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…

  12. A New Global Optimization Algorithm for Solving a Class of Nonconvex Programming Problems

    Directory of Open Access Journals (Sweden)

    Xue-Gang Zhou

    2014-01-01

    Full Text Available A new two-part parametric linearization technique is proposed globally to a class of nonconvex programming problems (NPP. Firstly, a two-part parametric linearization method is adopted to construct the underestimator of objective and constraint functions, by utilizing a transformation and a parametric linear upper bounding function (LUBF and a linear lower bounding function (LLBF of a natural logarithm function and an exponential function with e as the base, respectively. Then, a sequence of relaxation lower linear programming problems, which are embedded in a branch-and-bound algorithm, are derived in an initial nonconvex programming problem. The proposed algorithm is converged to global optimal solution by means of a subsequent solution to a series of linear programming problems. Finally, some examples are given to illustrate the feasibility of the presented algorithm.

  13. etas_solve: A robust program to estimate the ETAS parameters

    Science.gov (United States)

    Yagi, Y.; Kasahara, A.

    2015-12-01

    The epidemic-type aftershock sequence (ETAS) model introduced by Ogata (1988) has been widely used to quantitatively describe seismicity (e.g. Ogata, 1992; Llenos et al., 2009). However, only a few programs for estimation of the ETAS parameters are publicly available, and it is difficult to automatically apply some of them to observed data due to initial value dependence (e.g. Ogata, 2006). A robust ETAS estimation program is required to meet the recent enhancement of earthquake catalogs. In this study, we developed a new program, etas_solve, that is based on Newton's method and calculates exact gradient and Hessian by using the automatic differentiation technique (Griewank, 1989). The program also supports auxiliary window in time and magnitude (Wang et al., 2010).To demonstrate robustness of the developed program, we tested the dependence of estimated parameters on the choice of initial value by running the program from 1,024 randomly chosen initial values, and then compared the results with that of SAPP (Ogata 2006). We used aftershock data of 26th July 2003 earthquake of M6.2 at the northern Miyagi japan, which is shipped with SAPP, as a testing data. We found that estimation values with etas_solve were independent of the initial value for the testing data, while that with SAPP were varied with the initial value. Although there was initial value dependence in the SAPP's results, the estimated values by SAPP with small (≤10-5) gradient coincided with the solution by etas_solve. etas_solve took longer computation time per iteration than SAPP due to the exact Hessian calculation, but total execution time was comparable to that of SAPP since less number of iterations for convergence was required. In addition, etas_solve was faster than SAPP on multicore machines (around 8-fold speed up with a 16 core machine) since etas_solve is parallelized by OpenMP.etas_solve is written in Fortran and distributed under GNU General Public License at https

  14. Programmed cell death during terminal bud senescence in a sympodial branching tree,Eucommia ulmoides

    Institute of Scientific and Technical Information of China (English)

    XU Wenjie; Kalima-N'Koma MWANGE; CUI Keming

    2004-01-01

    Eucommia ulmoides Oliv. is a typical sympodial branching tree. The apical bud of the branch ages and dies every year, replaced by the nearby axillary bud in the second year. Structural assays and a series of biochemical analyses were performed to analyze the senescence mechanism in the apical bud. It was revealed that most cells of the apical bud underwent the programmed cell death (PCD) during the senescence: the chromosomes were congregated and the nuclear contents were condensed, as shown by 4′,6-diamidino-2-phenylindole (DAPI) fluorescence. DNA fragmentation was detected during senescence using the terminal deoxynucleotidyl transferase (TdT)-mediated dUTP nick end in situ labeling (TUNEL) method, coincident with the appearance of a DNA ladder. Moreover, a 20 kD DNase related to fragmentation was found. PCD was initiated first in the young leaves, leaf primordia and peripheral zone cells, then in the central mother cells and initial layer cells in the apical meristem. The terminal buds remain in vegetative growth during senescence, in contrast to buds of many annual plants.

  15. A Low-Order Knowledge-Based Algorithm (LOKBA to Solve Binary Integer Programming Problems

    Directory of Open Access Journals (Sweden)

    S. H. Pakzad-Moghadam

    2012-01-01

    Full Text Available In this paper a novel and very fast low order knowledge-based algorithm (called LOKBA is presented to solve binary integer programming (BIP problems. The factors in the objective function and the constraints of any BIP problem contains specific knowledge and information that can be used to better search the solution space of the problem. In this work many new definitions are introduced to elaborate on this information and extract necessary knowledge for creating and improving solutions. Found solutions are improved further and further until there is no new knowledge that can be extracted and there are no more possible improvements. The proposed algorithm has many major credentials. It produces promising results within amazingly short run times even for very large problems such as problems with one million variables. Also, it is extendable to solve integer programming and binary quadratic programming problems. Furthermore, it can be combined with heuristic or meta heuristic algorithms.

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

  17. Intuitionistic Fuzzy Goal Programming Technique for Solving Non-Linear Multi-objective Structural 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.

  18. Regular Splitting and Potential Reduction Method for Solving Quadratic Programming Problem with Box Constraints

    Institute of Scientific and Technical Information of China (English)

    Zi-Luan Wei

    2002-01-01

    A regular splitting and potential reduction method is presented for solving a quadratic programming problem with box constraints (QPB) in this paper. A general algorithm is designed to solve the QPB problem and generate a sequence of iterative points. We show that the number of iterations to generate an e-minimum solution or an e-KKT solution by the algorithm is bounded by O O(n2/∈log1/∈+nlong(1+√2n) and the total running time is bounded by O(n2(n + logn +log1/∈ )(n/∈log1/∈ + logn) ) arithmetic operations.

  19. Approximation-Exact Penalty Function Method for Solving a Class of Stochastic Programming

    Institute of Scientific and Technical Information of China (English)

    Wang Guang-min; Wan Zhong-ping

    2003-01-01

    We present an approximation-exact penalty function method for solving the single stage stochastic programming problem with continuous random variable. The original problem is transformed into a determinate nonlinear programming problem with a discrete random variable sequence, which is obtained by some discrete method. We construct an exact penalty function and obtain an unconstrained optimization. It avoids the difficulty in solution by the rapid growing of the number of constraints for discrete precision. Under lenient conditions, we prove the equivalence of the minimum solution of penalty function and the solution of the determinate programming, and prove that the solution sequences of the discrete problem converge to a solution to the original problem.

  20. Potential function methods for approximately solving linear programming problems theory and practice

    CERN Document Server

    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.

  1. Solving Bilevel Multiobjective Programming Problem by Elite Quantum Behaved Particle Swarm Optimization

    OpenAIRE

    Tao Zhang; Tiesong Hu; Jia-wei Chen; Zhongping Wan; Xuning Guo

    2012-01-01

    An elite quantum behaved particle swarm optimization (EQPSO) algorithm is proposed, in which an elite strategy is exerted for the global best particle to prevent premature convergence of the swarm. The EQPSO algorithm is employed for solving bilevel multiobjective programming problem (BLMPP) in this study, which has never been reported in other literatures. Finally, we use eight different test problems to measure and evaluate the proposed algorithm, including low dimension and high dimension ...

  2. A Novel Method of Solving Linear Programs with an Analog Circuit

    OpenAIRE

    Vichik, Sergey; Borrelli, Francesco

    2013-01-01

    We present the design of an analog circuit which solves linear programming (LP) problems. In particular, the steady-state circuit voltages are the components of the LP optimal solution. The paper shows how to construct the circuit and provides a proof of equivalence between the circuit and the LP problem. The proposed method is used to implement a LP-based Model Predictive Controller by using an analog circuit. Simulative and experimental results show the effectiveness of the proposed approach.

  3. Second-order cone programming for solving unit commitment strategy of thermal generators

    International Nuclear Information System (INIS)

    Highlights: • Second-order cone programming (SOCP) is proposed to solve unit commitment. • Unit commitment is transformed to SOCP model with tight lower bounds. • Conic quadratic constraints representation of UC problem is suggested. • Effectiveness of the proposed method is verified with different test systems. • SOCP is expanded to solve large-scale mixed integer nonlinear optimization problem. - Abstract: The short-term unit commitment (UC) problem of hydrothermal generation systems is a mixed-integer nonlinear programming (MINLP), which is difficult to solve efficiently, especially for large-scale instances. The perspective relaxation (PR) is an effective approach to constructing tight approximations to MINLP with semi-continuous variables. In this paper, the PR of UC problem is formulated as a mixed integer second-order cone programming (SOCP) model because the quadratic polynomial cost function of the UC problem is SOCP-representable. The proposed model is implemented by using the commercial optimization software IBM CPLEX 12.4. Extensive numerical studies have been conducted to verify the advantages of our proposed method. Instances of the test system vary from 10 to 1000 units. Our results indicate that the proposed method performs better than the existing methods in terms of production cost savings and faster computational times, especially for large systems

  4. The Effect of Hints and Model Answers in a Student-Controlled Problem-Solving Program for Secondary Physics Education

    NARCIS (Netherlands)

    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

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

  6. Application of program generation technology in solving heat and flow problems

    Science.gov (United States)

    Wan, Shui; Wu, Bangxian; Chen, Ningning

    2007-05-01

    Based on a new DIY concept for software development, an automatic program-generating technology attached on a software system called as Finite Element Program Generator (FEPG) provides a platform of developing programs, through which a scientific researcher can submit his special physico-mathematical problem to the system in a more direct and convenient way for solution. For solving flow and heat problems by using finite element method, the stabilization technologies and fraction-step methods are adopted to overcome the numerical difficulties caused mainly due to the dominated convection. A couple of benchmark problems are given in this paper as examples to illustrate the usage and the superiority of the automatic program generation technique, including the flow in a lid-driven cavity, the starting flow in a circular pipe, the natural convection in a square cavity, and the flow past a circular cylinder, etc. They are also shown as the verification of the algorithms.

  7. Application of Program Generation Technology in Solving Heat and Flow Problems

    Institute of Scientific and Technical Information of China (English)

    Shui Wan; Bangxian Wu; Ningning Chen

    2007-01-01

    Based on a new DIY concept for software development, an automatic program-generating technology attached on a software system called as Finite Element Program Generator (FEPG) provides a platform of developing programs, through which a scientific researcher can submit his special physico-mathematical problem to the system in a more direct and convenient way for solution. For solving flow and heat problems by using finite element method, the stabilization technologies and fraction-step methods are adopted to overcome the numerical difficulties caused mainly due to the dominated convection. A couple of benchmark problems are given in this paper as examples to illustrate the usage and the superiority of the automatic program generation technique, including the flow in a lid-driven cavity, the starting flow in a circular pipe, the natural convection in a square cavity, and the flow past a circular cylinder, etc. They are also shown as the verification of the algorithms.

  8. Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization

    Indian Academy of Sciences (India)

    DEEPAK KUMAR; A G RAMAKRISHNAN

    2016-03-01

    Particle swarm optimization (PSO) is used in several combinatorial optimization problems. In this work, particle swarms are used to solve quadratic programming problems with quadratic constraints. The central idea is to use PSO to move in the direction towards optimal solution rather than searching the entire feasibleregion. Binary classification is posed as a quadratically constrained quadratic problem and solved using the proposed method. Each class in the binary classification problem is modeled as a multidimensional ellipsoid to forma quadratic constraint in the problem. Particle swarms help in determining the optimal hyperplane or classification boundary for a data set. Our results on the Iris, Pima, Wine, Thyroid, Balance, Bupa, Haberman, and TAE datasets show that the proposed method works better than a neural network and the performance is close to that of a support vector machine

  9. Racing Sampling Based Microimmune Optimization Approach Solving Constrained Expected Value Programming

    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.

  10. 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 prog...... programming to give the global optimum, and that two different materials are always sufficient in an optimal structure.......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...

  11. Approximation-Exact Penalty Function Method for Solving a Class of Stochastic Programming

    Institute of Scientific and Technical Information of China (English)

    WangGuang-min; WanZhong-ping

    2003-01-01

    We present an approximation-exact penalty function method for solving the single stage stochastic programming problem with continuous random variable. The original problem is transformed into a determinate nonlinear programming problem with a discrete random variable sequence, which is obtained by some discrete method. We construct an exact penalty function and obtain an unconstrained optimization. It avoids the difficulty in solution by the rapid growing of the number of constraints for discrete precision.Under lenient conditions, we prove the equivalence of the minimum solution of penalty function and the solution of the determinate programming, and prove that the solution sequences of the discrete problem converge to a solution to the original problem.

  12. Administrative Problem-Solving for Writing Programs and Writing Centers: Scenarios in Effective Program Management.

    Science.gov (United States)

    Myers-Breslin, Linda

    Addressing the issues and problems faced by writing program administrators (WPAs) and writing center directors (WCDs), and how they can most effectively resolve the political, pedagogical, and financial questions that arise, this book presents essays from experienced WPAs and WCDs at a wide variety of institutions that offer scenarios and case…

  13. A NEW SQP-FILTER METHOD FOR SOLVING NONLINEAR PROGRAMMING PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Duoquan Li

    2006-01-01

    In [4],Fletcher and Leyffer present a new method that solves nonlinear programming problems without a penalty function by SQP-Filter algorithm. It has attracted much attention due to its good numerical results. In this paper we propose a new SQP-Filter method which can overcome Maratos effect more effectively. We give stricter acceptant criteria when the iterative points are far from the optimal points and looser ones vice-versa. About this new method,the proof of global convergence is also presented under standard assumptions. Numerical results show that our method is efficient.

  14. Genetic Algorithm Combination of Boolean Constraint Programming for Solving Course of Action Optimization in Influence Nets

    Directory of Open Access Journals (Sweden)

    Yanguang Zhu

    2011-06-01

    Full Text Available A military decision maker is typically confronted by the task of determining optimal course of action under some constraints in complex uncertain situation. Thus, a new class of Combinational Constraint Optimization Problem (CCOP is formalized, that is utilized to solve this complex Operation Optimization Problem. The object function of CCOP is modeled by Influence net, and the constraints of CCOP relate to resource and collaboration. These constraints are expressed by Pseudo-Boolean and Boolean constraints. Thus CCOP holds a complex mathematical configuration, which is expressed as a 0 1 integer optimization problem with compositional constraints and unobvious optimal object function. A novel method of Genetic Algorithm (GA combination of Boolean Constraint Programming (BCP is proposed to solve CCOP. The constraints of CCOP can be easily reduced and transformed into Disjunctive Normal Form (DNF by BCP. The DNF representation then can be used to drive GA so as to solve CCOP. Finally, a numerical experiment is given to demonstrate the effectiveness of above method.

  15. A DUAL-RELAX PENALTY FUNCTION APPROACH FOR SOLVING NONLINEAR BILEVEL PROGRAMMING WITH LINEAR LOWER LEVEL PROBLEM

    Institute of Scientific and Technical Information of China (English)

    Wan Zhongping; Wang Guangrain; Lv Yibing

    2011-01-01

    The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.

  16. Increasing self-efficacy in learning to program: exploring the benefits of explicit instruction for problem solving

    NARCIS (Netherlands)

    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 o

  17. Building Interactivity in Higher Education to Support Student Engagement in Spatial Problem Solving and Programming

    Science.gov (United States)

    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

  18. Learning to solve planning problems efficiently by means of genetic programming.

    Science.gov (United States)

    Aler, R; Borrajo, D; Isasi, P

    2001-01-01

    Declarative problem solving, such as planning, poses interesting challenges for Genetic Programming (GP). There have been recent attempts to apply GP to planning that fit two approaches: (a) using GP to search in plan space or (b) to evolve a planner. In this article, we propose to evolve only the heuristics to make a particular planner more efficient. This approach is more feasible than (b) because it does not have to build a planner from scratch but can take advantage of already existing planning systems. It is also more efficient than (a) because once the heuristics have been evolved, they can be used to solve a whole class of different planning problems in a planning domain, instead of running GP for every new planning problem. Empirical results show that our approach (EvoCK) is able to evolve heuristics in two planning domains (the blocks world and the logistics domain) that improve PRODIGY4.0 performance. Additionally, we experiment with a new genetic operator --Instance-Based Crossover--that is able to use traces of the base planner as raw genetic material to be injected into the evolving population.

  19. Learning to solve planning problems efficiently by means of genetic programming.

    Science.gov (United States)

    Aler, R; Borrajo, D; Isasi, P

    2001-01-01

    Declarative problem solving, such as planning, poses interesting challenges for Genetic Programming (GP). There have been recent attempts to apply GP to planning that fit two approaches: (a) using GP to search in plan space or (b) to evolve a planner. In this article, we propose to evolve only the heuristics to make a particular planner more efficient. This approach is more feasible than (b) because it does not have to build a planner from scratch but can take advantage of already existing planning systems. It is also more efficient than (a) because once the heuristics have been evolved, they can be used to solve a whole class of different planning problems in a planning domain, instead of running GP for every new planning problem. Empirical results show that our approach (EvoCK) is able to evolve heuristics in two planning domains (the blocks world and the logistics domain) that improve PRODIGY4.0 performance. Additionally, we experiment with a new genetic operator --Instance-Based Crossover--that is able to use traces of the base planner as raw genetic material to be injected into the evolving population. PMID:11709102

  20. A Hybrid Dynamic Programming for Solving Fixed Cost Transportation with Discounted Mechanism

    Directory of Open Access Journals (Sweden)

    Farhad Ghassemi Tari

    2016-01-01

    Full Text Available The problem of allocating different types of vehicles for transporting a set of products from a manufacturer to its depots/cross docks, in an existing transportation network, to minimize the total transportation costs, is considered. The distribution network involves a heterogeneous fleet of vehicles, with a variable transportation cost and a fixed cost in which a discount mechanism is applied on the fixed part of the transportation costs. It is assumed that the number of available vehicles is limited for some types. A mathematical programming model in the form of the discrete nonlinear optimization model is proposed. A hybrid dynamic programming algorithm is developed for finding the optimal solution. To increase the computational efficiency of the solution algorithm, several concepts and routines, such as the imbedded state routine, surrogate constraint concept, and bounding schemes, are incorporated in the dynamic programming algorithm. A real world case problem is selected and solved by the proposed solution algorithm, and the optimal solution is obtained.

  1. Third report on the Oak Ridge K-25 Site Biological Monitoring and Abatement Program for Mitchell Branch

    International Nuclear Information System (INIS)

    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

  2. Third report on the Oak Ridge K-25 Site Biological Monitoring and Abatement Program for Mitchell Branch

    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.

  3. A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem

    Science.gov (United States)

    Montoya, Justin Vincent; Wood, Zachary Paul; Rathinam, Sivakumar; Malik, Waqar Ahmad

    2010-01-01

    Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.

  4. Solving Square Jigsaw Puzzles Using Dynamic Programming and the Hungarian Procedure

    Directory of Open Access Journals (Sweden)

    Naif Alajlan

    2009-01-01

    Full Text Available Problem statement: To design, implement, and test an algorithm for solving the square jigsaw puzzle problem, which has many applications in image processing, pattern recognition, and computer vision such as restoration of archeological artifacts and image descrambling. Approach: The algorithm used the gray level profiles of border pixels for local matching of the puzzle pieces, which was performed using dynamic programming to facilitate non-rigid alignment of pixels of two gray level profiles. Unlike the classical best-first search, the algorithm simultaneously located the neighbors of a puzzle piece during the search using the well-known Hungarian procedure, which is an optimal assignment procedure. To improve the search for a global solution, every puzzle piece was considered as starting piece at various starting locations. Results: Experiments using four well-known images demonstrated the effectiveness of the proposed approach over the classical piece-by-piece matching approach. The performance evaluation was based on a new precision performance measure. For all four test images, the proposed algorithm achieved 100% precision rate for puzzles up to 8×8. Conclusion: The proposed search mechanism based on simultaneous allocation of puzzle pieces using the Hungarian procedure provided better performance than piece-by-piece used in classical methods.

  5. Solving the Linear Programming Relaxation of Cutting and Packing Problems: A Hybrid Simplex Method/Subgradient Optimization Procedure

    OpenAIRE

    Degraeve, Zeger; Peeters, Marc

    2000-01-01

    In this paper we present a new method for solving the linear programming relaxation of the Cutting Stock Problem. The method is based on the relationship between column generation and Lagrange relaxation. We have called our method the Hybrid Simplex Method/Subgradient Optimization Procedure. We test our procedure on generated data sets and compare it with the classical column generation approach.

  6. Problem Solving by 5-6 Years Old Kindergarten Children in a Computer Programming Environment: A Case Study

    Science.gov (United States)

    Fessakis, G.; Gouli, E.; Mavroudi, E.

    2013-01-01

    Computer programming is considered an important competence for the development of higher-order thinking in addition to algorithmic problem solving skills. Its horizontal integration throughout all educational levels is considered worthwhile and attracts the attention of researchers. Towards this direction, an exploratory case study is presented…

  7. Using MATLAB to Solve Logistics Linear Programming Problem%物流线性规划问题的MATLAB求解

    Institute of Scientific and Technical Information of China (English)

    魏杰羽

    2012-01-01

    对线性规划问题的图解法、单纯形解法,以及MATLAB的函数linprog求解方法进行了对比分析,并结合实例,采用linprog函数对产销平衡和产销不平衡的两类物流运输问题进行了求解.%The paper compares the graphic method, simplex solution and linprog function of MATLAB in solving the linear programming problem and, in connection with a practical example, solves the logistics transportation problems with balanced and unbalanced production and sales respectively using the linprog function.

  8. Future on the ITER program. On a branch of research on nuclear fusion

    International Nuclear Information System (INIS)

    As a huge cost for research and development of nuclear fusion is required, some international cooperative research such as ITER program have been intended to promote, to which Japanese response is required. As the program can be understood on its meaning at a viewpoint of promotion of basic science, concept on a key of energy problem is not insufficient yet And, its effect on technical problems and environment cannot be neglected Here was shown some proposals necessity for discussion on how the program had to be promoted under consideration of these problems. When a large scale program consuming national budget will be carried out, it is natural that agreement of national peoples must be obtained. Regretfully, in Japan discussion on science program above all nuclear policy has scarcely been experienced at citizens' levels, and some bitter experiences, where the concerned have promoted it in one side under a concept without any change once decided, have been pressured without any response to scientific advancements and social changes. Therefore, future plan on the nuclear fusion must be carried out a number of thorough discussion at a wide range from various viewpoints such as its realizing feasibility, safety, economics, and so forth, to promote careful adaptabilities. And, the concerned under promotion of the program and the relatives in the academic community seem to have a responsibility to easily explain present condition and scope of the plan to not only scientists but also citizens to awake them to promote its discussion with them. (G.K.)

  9. First report on the Oak Ridge K-25 Site Biological Monitoring and Abatement Program for Mitchell Branch

    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.

  10. Second report on the Oak Ridge K-25 Site Biological Monitoring and Abatement Program for Mitchell Branch

    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.

  11. First report on the Oak Ridge K-25 Site Biological Monitoring and Abatement Program for Mitchell Branch

    International Nuclear Information System (INIS)

    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

  12. NIMH clinical research branch collaborative program on the psychobiology of depression.

    Science.gov (United States)

    Katz, M M; Secunda, S K; Hirschfeld, R M; Koslow, S H

    1979-07-01

    This is a report on the history and implications of the collaborative effort that evolved from the 1969 National Institute of Mental Health conference on the psychobiology of depression. The major issues identified at that time were the need to (1) assess relative validities of current systems of nosology and (2) retest critical biological hypotheses concerning the etiology and nature of the depressive disorders. Research was required that would be multidisciplinary and involve clinical settings treating diverse types of depression. The objectives and the nature of the biological and clinical collaborative programs that were designed to address these problems are described. These unique programs, initiated in the early 1970s, currently span research on nosology, genetics, neurochemistry, neuroendocrinology, and psychosocial factors. Although these studies are still in the early stages, they have resulted in significant methodologic developments in diagnosis, descriptive psychopathology, and biological measurements.

  13. Optimal Weights of Certain Branches of an Arbitrary Connected Network for Fastest Distributed Consensus Averaging Problem

    CERN Document Server

    Jafarizadeh, Saber

    2010-01-01

    Solving fastest distributed consensus averaging problem over networks with different topologies has been an active area of research for a number of years. The main purpose of distributed consensus averaging is to compute the average of the initial values, via a distributed algorithm, in which the nodes only communicate with their neighbors. In the previous works full knowledge about the network's topology was required for finding optimal weights and convergence rate of network, but here in this work for the first time the optimal weights are determined analytically for the edges of certain types of branches, namely path branch, lollipop branch, semi-complete Branch and Ladder branch independent of the rest of network. The solution procedure consists of stratification of associated connectivity graph of branch and Semidefinite Programming (SDP), particularly solving the slackness conditions, where the optimal weights are obtained by inductive comparing of the characteristic polynomials initiated by slackness c...

  14. A regularized Newton method for solving equilibrium programming problems with an inexactly specified set

    Science.gov (United States)

    Antipin, A. S.; Vasil'Ev, F. P.; Stukalov, A. S.

    2007-01-01

    Unstable equilibrium problems are examined in which the objective function and the set where the equilibrium point is sought are specified inexactly. A regularized Newton method, combined with penalty functions, is proposed for solving such problems, and its convergence is analyzed. A regularizing operator is constructed.

  15. Federal goal-oriented programs of Russia: the problem of coordination and the ways to solve it

    OpenAIRE

    M. Emets

    2012-01-01

    An effective solution of the tasks in Federal target programs (FTP) is relevant at the present stage of public administration development in the Russian Federation. As there arise some difficulties in implementing FTPs, the fate of this instrument for solving complex tasks of the state is questionable so far. However, the absence of similar or better means in Russias practice is the ground for its further development. The analysis revealed that one of the main reasons of FTP low efficiency is...

  16. Java programming fundamentals problem solving through object oriented analysis and design

    CERN Document Server

    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

  17. ANALISIS PEMAHAMAN KONSEP DAN KESULITAN MAHASISWA UNTUK PENGEMBANGAN PROGRAM PERKULIAHAN DASAR-DASAR KIMIA ANALITIK BERBASIS PROBLEM SOLVING

    Directory of Open Access Journals (Sweden)

    I. D. Pursitasari

    2012-04-01

    Full Text Available Tujuan penelitian adalah menentukan pemahaman konsep mahasiswa serta menggali kesulitan dan pandangan mahasiswa selama mengikuti perkuliahan Dasar-dasar Kimia Analitik (DKA. Pandangan mahasiswa terhadap perkuliahan DKA menyatakan penjelasan dosen kurang terlalu cepat (25,81%; dosen menggunakan metode diskusi informasi dan latihan soal dalam perkuliahan (87,16%; praktikum dilakukan untuk memverifikasi teori (87,10%; dan fasilitas laboritorium cukup memadai (80,65%. Berdasarkan hasil penelitian perlu dilakukan pengembangan program perkuliahan untuk memfasilitasi kemampuan problem solving sehingga dapat memperbaiki pemahaman konsep.The purposes of this research are to define the students’ conceptual understanding and to find out their difficulty and opinion of Analytic Basic Chemistry-Problem Solving Based lecturing. Students opinion tell that the lecturer speaks fast in explaining the material (25,81%; the lecturer uses discussion-information method and gives exercise (87,16%; the lecturer uses practicum to verify the theory (87,10%; and the laboratory facility is quite satisfactory (80,65%. Based on the research it can be suggested to develop the lecture program to facilitate the problem solving ability to fix the conceptual understanding.

  18. Computer program to solve two-dimensional shock-wave interference problems with an equilibrium chemically reacting air model

    Science.gov (United States)

    Glass, Christopher E.

    1990-01-01

    The computer program EASI, an acronym for Equilibrium Air Shock Interference, was developed to calculate the inviscid flowfield, the maximum surface pressure, and the maximum heat flux produced by six shock wave interference patterns on a 2-D, cylindrical configuration. Thermodynamic properties of the inviscid flowfield are determined using either an 11-specie, 7-reaction equilibrium chemically reacting air model or a calorically perfect air model. The inviscid flowfield is solved using the integral form of the conservation equations. Surface heating calculations at the impingement point for the equilibrium chemically reacting air model use variable transport properties and specific heat. However, for the calorically perfect air model, heating rate calculations use a constant Prandtl number. Sample calculations of the six shock wave interference patterns, a listing of the computer program, and flowcharts of the programming logic are included.

  19. STAR adaptation of QR algorithm. [program for solving over-determined systems of linear equations

    Science.gov (United States)

    Shah, S. N.

    1981-01-01

    The QR algorithm used on a serial computer and executed on the Control Data Corporation 6000 Computer was adapted to execute efficiently on the Control Data STAR-100 computer. How the scalar program was adapted for the STAR-100 and why these adaptations yielded an efficient STAR program is described. Program listings of the old scalar version and the vectorized SL/1 version are presented in the appendices. Execution times for the two versions applied to the same system of linear equations, are compared.

  20. Solving the Fuzzy BiLevel Linear Programming with Multiple Followers through Structured Element Method

    Directory of Open Access Journals (Sweden)

    Shengyue Deng

    2014-01-01

    Full Text Available The optimal solution of fuzzy bilevel linear programming with multiple followers (MFFBLP model is shown to be equivalent to the optimal solution of the bilevel linear programming with multiple followers by using fuzzy structured element theory. The optimal solution to this model is found out by adopting the Kuhn-Tucker approach. Finally, an illustrative numerical example for this model is also provided to demonstrate the feasibility and efficiency of the proposed method.

  1. Biological component of the NIMH clinical research branch collaborative program on the psychobiology of depression: I. Background and theoretical considerations.

    Science.gov (United States)

    Maas, J W; Koslow, S H; Davis, J M; Katz, M M; Mendels, J; Robins, E; Stokes, P E; Bowden, C L

    1980-11-01

    There are many reports which suggest that patients with effective illness (mania and/or depression) have abnormalities in the functioning of one or more neurobiological systems. At a conference convened by the Clinical Research Branch, Division of Extramural Research Programs, National Institute of Mental Health, these findings were reviewed and some of the factors impeding movement towards a more complete and integrated view of the functioning of neurobiological systems in patients with mania or depression were identified. As a result, a multi-research centre, collaborative approach to the study of the psychobiology of affective disorders was developed. In this collaborative programme, which has now been underway for several years, the focus has been upon: (a) the assessment of the functioning of several different types of biological systems in the same patient, both before and during treatment; (b) obtaining a reasonably large number of patients and comparison subjects; and (c) the use within and across centres of standardized diagnostic categories and behavioural rating methodologies. In this paper the history, background, and rationale for this collaborative effort are reviewed. Those biological systems chosen for study are noted, and issues such as reliability and validity of diagnoses, measurement of state variables, assessment of change with treatment, and logistical and coordinating problems are discussed.

  2. Model-based problem solving through symbolic regression via pareto genetic programming

    NARCIS (Netherlands)

    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 m

  3. THE USE OF MATHEMATICAL PROGRAMING TO SOLVE CERTAIN PROBLEMS IN PUBLIC SCHOOL TRANSPORTATION.

    Science.gov (United States)

    BOYER, ROSCOE A.

    A PROGRAM THAT WOULD DEVISE OPTIMAL ROUTES FOR SCHOOL BUSES WAS DEVELOPED. ONE OF THE TWO MODELS DEVELOPED FOR THIS STUDY, CALLED THE HEURISTIC MODEL, WAS A HAND PROCEDURE BASED ON THE ASSUMPTION THAT, IN AN EFFICIENT SCHOOL BUS SYSTEM, STUDENT MILES SHOULD BE MINIMIZED RATHER THAN BUS MILES. THE OTHER MODEL WAS DESIGNED TO BE USED WITH HIGH SPEED…

  4. Using a Problem Solving Model To Revise the Teacher Education Program.

    Science.gov (United States)

    Vanderbilt Univ., Nashville, TN. Peabody Coll.

    The Department of Teaching and Learning of Peabody College of Vanderbilt University developed a project to strengthen field experiences for elementary/early childhood teacher education students. The project was designed to use current research to revise the laboratory and practica programs, incorporating technology and simulated classroom…

  5. Solving inverse problems with the unfolding program TRUEE: Examples in astroparticle physics

    CERN Document Server

    Milke, Natalie; Klepser, Stefan; Mazin, Daniel; Blobel, Volker; Rhode, Wolfgang; 10.1016/j.nima.2012.08.105

    2012-01-01

    The unfolding program TRUEE is a software package for the numerical solution of inverse problems. The algorithm was fi?rst applied in the FORTRAN77 program RUN. RUN is an event-based unfolding algorithm which makes use of the Tikhonov regularization. It has been tested and compared to di?fferent unfolding applications and stood out with notably stable results and reliable error estimation. TRUEE is a conversion of RUN to C++, which works within the powerful ROOT framework. The program has been extended for more user-friendliness and delivers unfolding results which are identical to RUN. Beside the simplicity of the installation of the software and the generation of graphics, there are new functions, which facilitate the choice of unfolding parameters and observables for the user. In this paper, we introduce the new unfolding program and present its performance by applying it to two exemplary data sets from astroparticle physics, taken with the MAGIC telescopes and the IceCube neutrino detector, respectively.

  6. Feasibility study of an interactive multimedia electronic problem solving treatment program for depression: a preliminary uncontrolled trial.

    Science.gov (United States)

    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.

  7. Materials Test Branch

    Science.gov (United States)

    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.

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

  9. Solving the Frequency Assignment Problem by Site Availability and Constraint Programming

    CERN Document Server

    Linhares, Andrea Carneiro; Peinl, Peter; Michelon, Philippe

    2010-01-01

    The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of Constraint Programming and integrate the site availability concept. Numerical simulations conducted on scenarios provided by CELAR are very promising.

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

  11. A fuzzy goal programming approach to solve multi-objective supply chain network design problems

    Directory of Open Access Journals (Sweden)

    Zahra Azadi

    2013-06-01

    Full Text Available The design of supply chain networks has attracted more attention in recent years according to business and environmental factors.in this paper a multi objective supply chain network design model aims to minimize network costs while satisfying the desired service level, is presented. A fuzzy goal programming (FGP solution approach based on fuzzy membership function concept is developed to minimize costs and amount of investment while obtain maximum service level. Numerical experiments are conducted to test the efficiency of proposed solution method.

  12. C programs for solving the time-dependent Gross-Pitaevskii equation in a fully anisotropic trap

    Science.gov (United States)

    Vudragović, Dušan; Vidanović, Ivana; Balaž, Antun; Muruganandam, Paulsamy; Adhikari, Sadhan K.

    2012-09-01

    . Program obtainable from: CPC Program Library, Queen's University of 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.: 180 583. No. of bytes in distributed program, including test data, etc.: 1 188 688. Distribution format: tar.gz. Programming language: C and C/OpenMP. Computer: Any modern computer with C language compiler installed. Operating system: Linux, Unix, Mac OS, Windows. RAM: Memory used with the supplied input files: 2-4 MB (i, iv, ix, x, xiii, xvi, xvii, xviii), 8 MB (xi, xii), 32 MB (vii, viii), 80 MB (ii, iii), 700 MB (xiv, xv), 1.2 GB (v, vi). Number of processors used: For threaded (OpenMP parallelized) programs, all available CPU cores on the computer. Classification: 2.9, 4.3, 4.12. Catalogue identifier of previous version: AEDU_v1_0. Journal reference of previous version: Comput. Phys. Commun. 180 (2009) 1888. Does the new version supersede the previous version?: No. Nature of problem: These programs are designed to solve the time-dependent Gross-Pitaevskii (GP) nonlinear partial differential equation in one-, two- or three-space dimensions with a harmonic, circularly-symmetric, spherically-symmetric, axially-symmetric or fully anisotropic trap. The GP equation describes the properties of a dilute trapped Bose-Einstein condensate. Solution method: The time-dependent GP equation is solved by the split-step Crank-Nicolson method by discretizing in space and time. The discretized equation is then solved by propagation, in either imaginary or real time, over small time steps. The method yields solutions of stationary and/or non-stationary problems. Reasons for the new version: Previous Fortran programs [1] are used within the ultra-cold atoms [2-11] and nonlinear optics [12,13] communities, as well as in various other fields [14-16]. This new version represents translation of all programs to the C programming language, which will make

  13. Fuzzy linear programming approach for solving transportation problems with interval-valued trapezoidal fuzzy numbers

    Indian Academy of Sciences (India)

    ALI EBRAHIMNEJAD

    2016-03-01

    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 destinations using available supplies at origins in a crisp environment. In real life situations, the decision maker may not be sure about the precise values of the coefficients belonging to the transportation problem. The aim of this paper is to introduce a formulation of TP involving interval-valued trapezoidal fuzzy numbers for the transportation costs and values of supplies and demands. We propose a fuzzy linear programming approach for solvinginterval-valued trapezoidal fuzzy numbers transportation problem based on comparison of interval-valued fuzzy numbers by the help of signed distance ranking. To illustrate the proposed approach an application example issolved. It is demonstrated that study of interval-valued trapezoidal fuzzy numbers transportation problem gives rise to the same expected results as those obtained for TP with trapezoidal fuzzy numbers.

  14. CUDA programs for solving the time-dependent dipolar Gross-Pitaevskii equation in an anisotropic trap

    CERN Document Server

    Loncar, Vladimir; Bogojevic, Aleksandar; Skrbic, Srdjan; Muruganandam, Paulsamy; Adhikari, Sadhan K

    2016-01-01

    In this paper we present new versions of previously published numerical programs for solving the dipolar Gross-Pitaevskii (GP) equation including the contact interaction in two and three spatial dimensions in imaginary and in real time, yielding both stationary and non-stationary solutions. New versions of programs were developed using CUDA toolkit and can make use of Nvidia GPU devices. The algorithm used is the same split-step semi-implicit Crank-Nicolson method as in the previous version (R. Kishor Kumar et al., Comput. Phys. Commun. 195, 117 (2015)), which is here implemented as a series of CUDA kernels that compute the solution on the GPU. In addition, the Fast Fourier Transform (FFT) library used in the previous version is replaced by cuFFT library, which works on CUDA-enabled GPUs. We present speedup test results obtained using new versions of programs and demonstrate an average speedup of 12 to 25, depending on the program and input size.

  15. The Effect of Problem-Solving Instruction on the Programming Self-efficacy and Achievement of Introductory Computer Science Students

    Science.gov (United States)

    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

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

  17. A Fuzzy Goal Programming Procedure for Solving Multiobjective Load Flow Problems via Genetic Algorithm

    Science.gov (United States)

    Biswas, Papun; Chakraborti, Debjani

    2010-10-01

    This paper describes how the genetic algorithms (GAs) can be efficiently used to fuzzy goal programming (FGP) formulation of optimal power flow problems having multiple objectives. In the proposed approach, the different constraints, various relationships of optimal power flow calculations are fuzzily described. In the model formulation of the problem, the membership functions of the defined fuzzy goals are characterized first for measuring the degree of achievement of the aspiration levels of the goals specified in the decision making context. Then, the achievement function for minimizing the regret for under-deviations from the highest membership value (unity) of the defined membership goals to the extent possible on the basis of priorities is constructed for optimal power flow problems. In the solution process, the GA method is employed to the FGP formulation of the problem for achievement of the highest membership value (unity) of the defined membership functions to the extent possible in the decision making environment. In the GA based solution search process, the conventional Roulette wheel selection scheme, arithmetic crossover and random mutation are taken into consideration to reach a satisfactory decision. The developed method has been tested on IEEE 6-generator 30-bus System. Numerical results show that this method is promising for handling uncertain constraints in practical power systems.

  18. Development of a Positive Youth Development Program: Promoting the Mental Health of Stressful Adolescents Using Principles of Problem Solving Therapy

    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.

  19. Solving a mixed-integer linear programming model for a multi-skilled project scheduling problem by simulated annealing

    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.

  20. The Effect of Scratch- and Lego Mindstorms Ev3-Based Programming Activities on Academic Achievement, Problem-Solving Skills and Logical-Mathematical Thinking Skills of Students

    Science.gov (United States)

    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…

  1. Branching out

    CERN Document Server

    Biggins, J D

    2010-01-01

    Results on the behaviour of the rightmost particle in the $n$th generation in the branching random walk are reviewed and the phenomenon of anomalous spreading speeds, noticed recently in related deterministic models, is considered. The relationship between such results and certain coupled reaction-diffusion equations is indicated.

  2. PROGRAM TEST DATA GENERATION FOR BRANCH COVERAGE WITH GENETIC ALGORITHM: COMPARATIVE EVALUATION OF A MAXIMIZATION AND MINIMIZATION APPROACH

    OpenAIRE

    AnkurPachauriand Gursaran

    2012-01-01

    In search based test data generation, the problem of test data generation is reduced to that of function minimization or maximization.Traditionally, for branch testing, the problem of test data generation has been formulated as a minimization problem. In this paper we define an alternate maximization formulation and experimentally compare it with the minimization formulation. We use a genetic algorithm as the search technique and in addition to the usual genetic algorithm opera...

  3. Using the primal-dual interior point algorithm within the branch-price-and-cut method

    OpenAIRE

    Munari, P.; Gondzio, J.

    2013-01-01

    Branch-price-and-cut has proven to be a powerful method for solving integer programming problems. It combines decomposition techniques with the generation of both columns and valid inequalities and relies on strong bounds to guide the search in the branch-and-bound tree. In this paper, we present how to improve the performance of a branch-price-and-cut method by using the primal-dual interior point algorithm. We discuss in detail how to deal with the challenges of using the interior point alg...

  4. 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 of the capac...... of the capacitated vehicle routing problem and the latter is for the split delivery version....

  5. A new decision-making model for solving multi-objective large-scale programming problems with a block angular structure

    Directory of Open Access Journals (Sweden)

    Meghdad Salimi

    2014-05-01

    Full Text Available This paper presents a model based on a novel compromised solution method to solve the multi-objective large-scale nonlinear programming (MOLSNLP problems with block angular structure. In this method, an aggregating function that is developed from TOPSIS and VIKOR is proposed based on the particular measure of "closeness" to the "ideal" solution. The decomposition algorithm is utilized to reduce the large-dimensional objective space into a two-dimensional space. Furthermore, two independent solution methods are proposed to solve each nonlinear sub problem respectively. In the last step of proposed method, Single objective nonlinear programming problem is solved to find the final solution. Finally, to justify the proposed method, an illustrative example is provided. Then, the sensitivity analysis is described.

  6. The Effects of Mind Mapping with Cooperative Learning on Programming Performance, Problem Solving Skill and Metacognitive Knowledge among Computer Science Students

    Science.gov (United States)

    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…

  7. Improving First Computer Programming Experiences: The Case of Adapting a Web-Supported and Well-Structured Problem-Solving Method to a Traditional Course

    Science.gov (United States)

    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…

  8. CTBC. A program to solve the collinear three-body Coulomb problem. Bound states and scattering below the three-body disintegration threshold

    International Nuclear Information System (INIS)

    A program to solve the quantum-mechanical collinear three-body Coulomb problem is described and illustrated by calculations for a number of representative systems and processes. In the internal region, the Schroedinger equation is solved in hyperspherical coordinates using the slow/smooth variable discretization method. In asymptotic regions, the solution is obtained in Jacobi coordinates using the asymptotic package GAILIT from the CPC library. Only bound states and scattering processes below the three-body disintegration threshold are considered here; resonances and fragmentation processes will be discussed in subsequent parts of this series. (author)

  9. Electrochemical Energy Storage Branch

    Science.gov (United States)

    1985-01-01

    The activities of the Electrochemical Energy Storage Branch are highlighted, including the Technology Base Research and the Exploratory Technology Development and Testing projects within the Electrochemical Energy Storage Program for the 1984 fiscal year. General Headquarters activities are presented first; and then, a summary of the Director Controlled Milestones, followed by other major accomplishments. A listing of the workshops and seminars held during the year is also included.

  10. 利用EXCEL2010求解线性规划问题%Skillfully Use EXCEL 2010 to Solve Linear Programming Problems

    Institute of Scientific and Technical Information of China (English)

    李丽颖

    2014-01-01

    该文讨论了使用EXCEL2010求解运筹学中比较重要的线性规划特定问题的求解方法,从而大大简化了变量比较多的线性规划问题的求解方法。%The solvation of the specific problem of linear programming is important in operational research method, this article discussed the solvation that using EXCEL2010, which greatly simplifies the variable more methods of solving the linear program-ming problem.

  11. OpenMP Fortran and C programs for solving the time-dependent Gross-Pitaevskii equation in an anisotropic trap

    CERN Document Server

    Young-S., Luis E; Muruganandam, Paulsamy; Adhikari, Sadhan K; Balaz, Antun

    2016-01-01

    We present new version of previously published Fortran and C programs for solving the Gross-Pitaevskii equation for a Bose-Einstein condensate with contact interaction in one, two and three spatial dimensions in imaginary and real time, yielding both stationary and non-stationary solutions. To reduce the execution time on multicore processors, new versions of parallelized programs are developed using Open Multi-Processing (OpenMP) interface. The input in the previous versions of programs was the mathematical quantity nonlinearity for dimensionless form of Gross-Pitaevskii equation, whereas in the present programs the inputs are quantities of experimental interest, such as, number of atoms, scattering length, oscillator length for the trap, etc. New output files for some integrated one- and two-dimensional densities of experimental interest are given. We also present speedup test results for the new programs.

  12. OpenMP Fortran and C programs for solving the time-dependent Gross-Pitaevskii equation in an anisotropic trap

    Science.gov (United States)

    Young-S., Luis E.; Vudragović, Dušan; Muruganandam, Paulsamy; Adhikari, Sadhan K.; Balaž, Antun

    2016-07-01

    We present new version of previously published Fortran and C programs for solving the Gross-Pitaevskii equation for a Bose-Einstein condensate with contact interaction in one, two and three spatial dimensions in imaginary and real time, yielding both stationary and non-stationary solutions. To reduce the execution time on multicore processors, new versions of parallelized programs are developed using Open Multi-Processing (OpenMP) interface. The input in the previous versions of programs was the mathematical quantity nonlinearity for dimensionless form of Gross-Pitaevskii equation, whereas in the present programs the inputs are quantities of experimental interest, such as, number of atoms, scattering length, oscillator length for the trap, etc. New output files for some integrated one- and two-dimensional densities of experimental interest are given. We also present speedup test results for the new programs.

  13. Raising a Thinking Preteen: The "I Can Problem Solve" Program for 8- to 12-Year-Olds.

    Science.gov (United States)

    Shure, Myrna B.

    Aimed at parents of early adolescents, this book helps parents provide the skills teens need to cope with life's everyday frustrations and to make informed decisions about problems such as the stresses of homework, friendship, contending with peer pressure, and dealing with bullies. The foundation of the book is the "I Can Problem Solve" (ICPS)…

  14. Proposed Social Spending Innovation Research (SSIR) Program: Harnessing American Entrepreneurial Talent to Solve Major U.S. Social Problems

    Science.gov (United States)

    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…

  15. OpenMP, OpenMP/MPI, and CUDA/MPI C programs for solving the time-dependent dipolar Gross-Pitaevskii equation

    CERN Document Server

    Loncar, Vladimir; Skrbic, Srdjan; Muruganandam, Paulsamy; Adhikari, Sadhan K; Balaz, Antun

    2016-01-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 to 1.9, depen...

  16. Measuring conflict management, emotional self-efficacy, and problem solving confidence in an evaluation of outdoor programs for inner-city youth in Baltimore, Maryland.

    Science.gov (United States)

    Caldas, Stephanie V; Broaddus, Elena T; Winch, Peter J

    2016-08-01

    Substantial evidence supports the value of outdoor education programs for promoting healthy adolescent development, yet measurement of program outcomes often lacks rigor. Accurately assessing the impacts of programs that seek to promote positive youth development is critical for determining whether youth are benefitting as intended, identifying best practices and areas for improvement, and informing decisions about which programs to invest in. We generated brief, customized instruments for measuring three outcomes among youth participants in Baltimore City Outward Bound programs: conflict management, emotional self-efficacy, and problem solving confidence. Measures were validated through exploratory and confirmatory factor analyses of pilot-testing data from two groups of program participants. We describe our process of identifying outcomes for measurement, developing and adapting measurement instruments, and validating these instruments. The finalized measures support evaluations of outdoor education programs serving urban adolescent youth. Such evaluations enhance accountability by determining if youth are benefiting from programs as intended, and strengthen the case for investment in programs with demonstrated success.

  17. Warped branches of flux compactifications

    CERN Document Server

    Lim, Yen-Kheng

    2012-01-01

    We consider Freund-Rubin-type compactifications which are described by (p+q)-dimensional Einstein gravity with a positive cosmological constant and a q-form flux. Using perturbative expansions of Kinoshita's ansatz for warped dS_pxS^q and AdS_pxS^q spacetimes, we obtain analytical solutions describing the warped branches and their respective phase spaces. These equations are given by inhomogeneous Gegenbauer differential equations which can be solved by the Green's function method. The requirement that the Green's functions are regular provides constraints which determine the structure of the phase space of the warped branches. We apply the perturbation results to calculate the thermodynamic variables for the warped dS_pxS^q branch. In particular, the first law of thermodynamics can be reproduced using this method.

  18. Coping modeling problem solving versus mastery modeling: effects on adherence, in-session process, and skill acquisition in a residential parent-training program.

    Science.gov (United States)

    Cunningham, C E; Davis, J R; Bremner, R; Dunn, K W; Rzasa, T

    1993-10-01

    This trial compared two approaches used to introduce parenting skills in a residential staff training program. Fifty staff were randomly assigned to: mastery modelling in which videotaped models demonstrated new skills, coping modelling problem solving (CMPS) in which participants formulated their own solutions to the errors depicted by videotaped models, or a waiting-list control group. In both, leaders used modelling, role playing, and homework projects to promote mastery and transfer of new skills. The skills of all groups improved, but CMPS participants attended more sessions, were late to fewer sessions, completed more homework, engaged in more cooperative in-session interaction, rated the program more positively, and reported higher job accomplishment scores. These data suggest that CMPS allowing participants to formulate their own solutions may enhance adherence and reduce the resistance observed in more didactic programs.

  19. A Hybrid Estimation of Distribution Algorithm and Nelder-Mead Simplex Method for Solving a Class of Nonlinear Bilevel Programming Problems

    Directory of Open Access Journals (Sweden)

    Aihong Ren

    2013-01-01

    Full Text Available We propose a hybrid algorithm based on estimation of distribution algorithm (EDA and Nelder-Mead simplex method (NM to solve a class of nonlinear bilevel programming problems where the follower’s problem is linear with respect to the lower level variable. The bilevel programming is an NP-hard optimization problem, for which EDA-NM is applied as a new tool aiming at obtaining global optimal solutions of such a problem. In fact, EDA-NM is very easy to be implementedsince it does not require gradients information. Moreover, the hybrid algorithm intends to produce faster and more accurate convergence. In the proposed approach, for fixed upper level variable, we make use of the optimality conditions of linear programming to deal with the follower’s problem and obtain its optimal solution. Further, the leader’s objective function is taken as the fitness function. Based on these schemes, the hybrid algorithm is designed by combining EDA with NM. To verify the performance of EDA-NM, simulations on some test problems are made, and the results demonstrate that the proposed algorithm has a better performance than the compared algorithms. Finally, the proposed approach is used to solve a practical example about pollution charges problem.

  20. Effect of Value Education Program Applied in Life Studies Lesson on Self-Esteem, Social Problem-Solving Skills and Empathy Levels of Students

    OpenAIRE

    Uzunkol, Ebru; Sakarya Üniversitesi, Eğitim Fakültesi, İlköğretim Bölümü; Yel, Selma; Gazi Üniversitesi, Eğitim Fakültesi, İlköğretim Bölümü

    2016-01-01

    The aim of this research was to examine the effects of value education program, which was based on respect and responsibility, on self-esteem levels, social problem-solving skills and empathy levels of primary school 3rd grade students. “Pretest-posttest design with nonequivalent control groups” from quasi experimental designs was used for this purpose. Participants were 34 students for experimental group and 33 students for control group with total of 67 students. “The school short-form Coop...

  1. On-the-Spot Problem Solving of Airline Professionals: A Case Study of Sky Business School Personnel Training Program

    Science.gov (United States)

    Nara, Jun

    2010-01-01

    This research explores how chief cabin crew members of major airlines made their decisions on-the-spot when they had unexpected problems. This research also presents some insights that may improve personnel training programs for future stewardesses and stewards based on the investigation of their decision-making styles. The theoretical framework…

  2. MORSE-C: a CDC-7600 program designed to solve nuclear criticality problems by using the Monte-Carlo method

    International Nuclear Information System (INIS)

    This user's manual covers this latest version of the MORSE-C code which solves the multiple energy group form of the Boltzmann transport equation in order to obtain the eigenvalue (multiplication) when fissionable materials are present. Cross sections for up to 100 energy groups may be employed. The angular scattering is treated by the usual Legendre expansion as used in the discrete ordinates codes. Upscattering may be specified. The geometry is defined by relationships to general 1st or 2nd degree surfaces. Array units may be specified. Output includes, besides the usual values of input quantities, plots of the geometry, calculated volumes and masses, and graphs of results to assist the user in determining the correctness of the problem's solution. Appendix II of this report contains the code listing with its numerous comments which should simplify finding an answer to any specific question the reader might have about MORSE-C. The remaining sections of this report explain how to obtain the code, how to set-up the input for a specific problem, how to understand the output, and then illustrates two typical problems run with the code

  3. Documentation of computer program VS2D to solve the equations of fluid flow in variably saturated porous media

    Science.gov (United States)

    Lappala, E.G.; Healy, R.W.; Weeks, E.P.

    1987-01-01

    This report documents FORTRAN computer code for solving problems involving variably saturated single-phase flow in porous media. The flow equation is written with total hydraulic potential as the dependent variable, which allows straightforward treatment of both saturated and unsaturated conditions. The spatial derivatives in the flow equation are approximated by central differences, and time derivatives are approximated either by a fully implicit backward or by a centered-difference scheme. Nonlinear conductance and storage terms may be linearized using either an explicit method or an implicit Newton-Raphson method. Relative hydraulic conductivity is evaluated at cell boundaries by using either full upstream weighting, the arithmetic mean, or the geometric mean of values from adjacent cells. Nonlinear boundary conditions treated by the code include infiltration, evaporation, and seepage faces. Extraction by plant roots that is caused by atmospheric demand is included as a nonlinear sink term. These nonlinear boundary and sink terms are linearized implicitly. The code has been verified for several one-dimensional linear problems for which analytical solutions exist and against two nonlinear problems that have been simulated with other numerical models. A complete listing of data-entry requirements and data entry and results for three example problems are provided. (USGS)

  4. Parallel Branch and Bound Algorithm - A comparison between serial, OpenMP and MPI implementations

    International Nuclear Information System (INIS)

    This paper presents a comparison of an extended version of the regular Branch and Bound algorithm previously implemented in serial with a new parallel implementation, using both MPI (distributed memory parallel model) and OpenMP (shared memory parallel model). The branch-and-bound algorithm is an enumerative optimization technique, where finding a solution to a mixed integer programming (MIP) problem is based on the construction of a tree where nodes represent candidate problems and branches represent the new restrictions to be considered. Through this tree all integer solutions of the feasible region of the problem are listed explicitly or implicitly ensuring that all the optimal solutions will be found. A common approach to solve such problems is to convert sub-problems of the mixed integer problem to linear programming problems, thereby eliminating some of the integer constraints, and then trying to solve that problem using an existing linear program approach. The paper describes the general branch and bound algorithm used and provides details on the implementation and the results of the comparison.

  5. NCI: DCTD: Biometric Research Branch

    Science.gov (United States)

    The Biometric Research Branch (BRB) is the statistical and biomathematical component of the Division of Cancer Treatment, Diagnosis and Centers (DCTDC). Its members provide statistical leadership for the national and international research programs of the division in developmental therapeutics, developmental diagnostics, diagnostic imaging and clinical trials.

  6. 3rd Workshop on Branching Processes and their Applications

    CERN Document Server

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

  7. Combustion Branch Website Development

    Science.gov (United States)

    Bishop, Eric

    2004-01-01

    The NASA combustion branch is a leader in developing and applying combustion science to focused aerospace propulsion systems concepts. It is widely recognized for unique facilities, analytical tools, and personnel. In order to better communicate the outstanding research being done in this Branch to the public and other research organization, a more substantial website was desired. The objective of this project was to build an up-to-date site that reflects current research in a usable and attractive manner. In order to accomplish this, information was requested from all researchers in the Combustion branch, on their professional skills and on the current projects. This information was used to fill in the Personnel and Research sections of the website. A digital camera was used to photograph all personnel and these photographs were included in the personnel section as well. The design of the site was implemented using the latest web standards: xhtml and external css stylesheets. This implementation conforms to the guidelines recommended by the w3c. It also helps to ensure that the web site is accessible by disabled users, and complies with Section 508 Federal legislation (which mandates that all Federal websites be accessible). Graphics for the new site were generated using the gimp (www.gimp.org) an open-source graphics program similar to Adobe Photoshop. Also, all graphics on the site were of a reasonable size (less than 20k, most less than 2k) so that the page would load quickly. Technologies such as Macromedia Flash and Javascript were avoided, as these only function on some clients which have the proper software installed or enabled. The website was tested on different platforms with many different browsers to ensure there were no compatibility issues. The website was tested on windows with MS IE 6, MSIE 5 , Netscape 7, Mozilla and Opera. On a Mac, the site was tested with MS IE 5 , Netscape 7 and Safari.

  8. A GPGPU based program to solve the TDSE in intense laser fields through the finite difference approach

    CERN Document Server

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

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

  10. Strategy of Irrigation Branch in Russia

    Science.gov (United States)

    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

  11. Arkansas State University Beebe Branch Faculty Handbook.

    Science.gov (United States)

    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…

  12. BDC 500 branch driver controller

    CERN Document Server

    Dijksman, A

    1981-01-01

    This processor has been designed for very fast data acquisition and date pre-processing. The dataway and branch highway speeds have been optimized for approximately 1.5 mu sec. The internal processor cycle is approximately 0.8 mu sec. The standard version contains the following functions (slots): crate controller type A1; branch highway driver including terminator; serial I/O port (TTY, VDU); 24 bit ALU and 24 bit program counter; 16 bit memory address counter and 4 word stack; 4k bit memory for program and/or data; battery backup for the memory; CNAFD and crate LAM display; request/grant logic for time- sharing operation of several BDCs. The free slots can be equipped with e.g. extra RAM, computer interfaces, hardware multiplier/dividers, etc. (0 refs).

  13. Branching processes and neutral evolution

    CERN Document Server

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

  14. A new numerical approach to solve Thomas-Fermi model of an atom using bio-inspired heuristics integrated with sequential quadratic programming.

    Science.gov (United States)

    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. PMID:27610319

  15. Convergence of the standard RLS method and UDUT factorisation of covariance matrix for solving the algebraic Riccati equation of the DLQR via heuristic approximate dynamic programming

    Science.gov (United States)

    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.

  16. Melons are branched polymers

    CERN Document Server

    Gurau, Razvan

    2013-01-01

    Melonic graphs constitute the family of graphs arising at leading order in the 1/N expansion of tensor models. They were shown to lead to a continuum phase, reminiscent of branched polymers. We show here that they are in fact precisely branched polymers, that is, they possess Hausdorff dimension 2 and spectral dimension 4/3.

  17. Cellular and physical mechanisms of branching morphogenesis

    Science.gov (United States)

    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

  18. The effect of the timing of instructional support in a computer-supported problem-solving program for students in secondary physics education

    NARCIS (Netherlands)

    Pol, Henk J.; Harskamp, Egbert G.; Suhre, Cor J. M.

    2008-01-01

    Many students experience difficulties in solving applied physics problems. Researchers claim that the development of strategic knowledge (analyze, explore, plan, implement, verify) is just as necessary for solving problems as the development of content knowledge. In order to improve these problem-so

  19. Using Self-Guided Treatment Software (ePST) to Teach Clinicians How to Deliver Problem-Solving Treatment for Depression

    OpenAIRE

    Cartreine, James A.; Chang, Trina E.; Seville, Janette L.; Luis Sandoval; John B. Moore; Shuai Xu; 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 behav...

  20. Branching processes in biology

    CERN Document Server

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

  1. Koenigs function and branching processes

    CERN Document Server

    Chikilev, O G

    2001-01-01

    An explicit solution of time-homogeneous pure birth branching processes is described. It gives alternative extensions for the negative binomial distribution (branching processes with immigration) and for the Furry-Yule distribution (branching processes without immigration).

  2. Synthesis of branched polysaccharides with tunable degree of branching

    NARCIS (Netherlands)

    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 obtai

  3. Fuzzy branching temporal logic.

    Science.gov (United States)

    Moon, Seong-ick; Lee, Kwang H; Lee, Doheon

    2004-04-01

    Intelligent systems require a systematic way to represent and handle temporal information containing uncertainty. In particular, a logical framework is needed that can represent uncertain temporal information and its relationships with logical formulae. Fuzzy linear temporal logic (FLTL), a generalization of propositional linear temporal logic (PLTL) with fuzzy temporal events and fuzzy temporal states defined on a linear time model, was previously proposed for this purpose. However, many systems are best represented by branching time models in which each state can have more than one possible future path. In this paper, fuzzy branching temporal logic (FBTL) is proposed to address this problem. FBTL adopts and generalizes concurrent tree logic (CTL*), which is a classical branching temporal logic. The temporal model of FBTL is capable of representing fuzzy temporal events and fuzzy temporal states, and the order relation among them is represented as a directed graph. The utility of FBTL is demonstrated using a fuzzy job shop scheduling problem as an example. PMID:15376850

  4. Right bundle branch block

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

  5. Building a research program in rehabilitation sciences, Part II: case studies: University of Texas Medical Branch, Boston University, University of Pittsburgh, and University of Washington.

    Science.gov (United States)

    Chan, Leighton; Jette, Alan M; Ottenbacher, Kenneth J; Robinson, Lawrence R; Tietsworth, Monica L; Ricker, Joseph H; Boninger, Michael L

    2009-08-01

    This article presents four case studies of rehabilitation science programs that have created enduring research efforts: one in physical therapy, one in interdisciplinary rehabilitation sciences, and two in physical medicine and rehabilitation. Several themes emerge from these case studies. First, building an enduring research program takes time and significant foundational work. Most importantly, it is crucial to have the support of the dean, academic institution, and medical center. This seems to be a prerequisite for success in this area.

  6. Radioiodinated branched carbohydrates

    Science.gov (United States)

    Goodman, Mark M.; Knapp, Jr., Furn F.

    1989-01-01

    A radioiodinated branched carbohydrate for tissue imaging. Iodine-123 is stabilized in the compound by attaching it to a vinyl functional group that is on the carbohydrate. The compound exhibits good uptake and retention and is promising in the development of radiopharmaceuticals for brain, heart and tumor imaging.

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

  8. Multimode geodesic branching components

    Science.gov (United States)

    Schulz, D.; Voges, E.

    1983-01-01

    Geodesic branching components are investigated for multimode guided wave optics. Geodesic structures with particular properties, e.g. focussing star couplers, are derived by a synthesis technique based on a theorem of Toraldo di Francia. Experimentally, the geodesic surfaces are printed on acrylic glass and are spin-coated with organic film waveguides.

  9. Alternative Method for Solving Traveling Salesman Problem by Evolutionary Algorithm

    Directory of Open Access Journals (Sweden)

    Zuzana Čičková

    2008-06-01

    Full Text Available This article describes the application of Self Organizing Migrating Algorithm (SOMA to the well-known optimization problem - Traveling Salesman Problem (TSP. SOMA is a relatively new optimization method that is based on Evolutionary Algorithms that are originally focused on solving non-linear programming problems that contain continuous variables. The TSP has model character in many branches of Operation Research because of its computational complexity; therefore the use of Evolutionary Algorithm requires some special approaches to guarantee feasibility of solutions. In this article two concrete examples of TSP as 8 cities set and 25 cities set are given to demonstrate the practical use of SOMA. Firstly, the penalty approach is applied as a simple way to guarantee feasibility of solution. Then, new approach that works only on feasible solutions is presented.

  10. An ellipsoidal branch and bound algorithm for global optimization

    OpenAIRE

    Hager, William; Phan, Dzung

    2009-01-01

    A branch and bound algorithm is developed for global optimization. Branching in the algorithm is accomplished by subdividing the feasible set using ellipses. Lower bounds are obtained by replacing the concave part of the objective function by an affine underestimate. A ball approximation algorithm, obtained by generalizing of a scheme of Lin and Han, is used to solve the convex relaxation of the original problem. The ball approximation algorithm is compared to SEDUMI as well as to gradient pr...

  11. Flight Planning Branch Space Shuttle Lessons Learned

    Science.gov (United States)

    Price, Jennifer B.; Scott, Tracy A.; Hyde, Crystal M.

    2011-01-01

    Planning products and procedures that allow the mission flight control teams and the astronaut crews to plan, train and fly every Space Shuttle mission have been developed by the Flight Planning Branch at the NASA Johnson Space Center. As the Space Shuttle Program ends, lessons learned have been collected from each phase of the successful execution of these Shuttle missions. Specific examples of how roles and responsibilities of console positions that develop the crew and vehicle attitude timelines will be discussed, as well as techniques and methods used to solve complex spacecraft and instrument orientation problems. Additionally, the relationships and procedural hurdles experienced through international collaboration have molded operations. These facets will be explored and related to current and future operations with the International Space Station and future vehicles. Along with these important aspects, the evolution of technology and continual improvement of data transfer tools between the shuttle and ground team has also defined specific lessons used in the improving the control teams effectiveness. Methodologies to communicate and transmit messages, images, and files from Mission Control to the Orbiter evolved over several years. These lessons have been vital in shaping the effectiveness of safe and successful mission planning that have been applied to current mission planning work in addition to being incorporated into future space flight planning. The critical lessons from all aspects of previous plan, train, and fly phases of shuttle flight missions are not only documented in this paper, but are also discussed as how they pertain to changes in process and consideration for future space flight planning.

  12. BILEVEL PROGRAMS WITH MULTIPLE FOLLOWERS

    Institute of Scientific and Technical Information of China (English)

    WANG Qian; YANG Fengmei; WANG Shouyang; LIU Yi-Hsin

    2000-01-01

    In this paper, we are concerned with bilevel programs with multiple followers. Three new solution concepts are introduced for a bilevel programming problem with multiple followers. First, one sufficient condition for the existence of a Nash equilibrium reaction is presented and the continuity of the reaction set is discussed. Next, we show that a class of bilevel programs with multiple followers can be solved via solving a corresponding bilevel program with a single follower. Finally, on the basis of a theorem proved via applying the Kuhn-Tucker conditions to the inner game problem, a branch and bound technique is developed for bilevel program with multiple followers. Two numerical examples are also given to illustrate the algorithm.

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

  14. Interactive problem solving using LOGO

    CERN Document Server

    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

  15. A branch-and-cut algorithm for the capacitated profitable tour problem

    DEFF Research Database (Denmark)

    Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon;

    2014-01-01

    This paper considers the Capacitated Profitable Tour Problem (CPTP) which is a special case of the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). The CPTP belongs to the group of problems known as traveling salesman problems with profits. In CPTP each customer is associated...... with a profit and a demand and the objective is to find a capacitated tour (rooted in a depot node) that minimizes the total travel distance minus the profit of the visited customers. The CPTP can be recognized as the sub-problem in many column generation applications, where it is traditionally solved through...... dynamic programming. In this paper we present an alternative framework based on a formulation for the undirected CPTP and solved through branch-and-cut. Valid inequalities are presented among which we introduce a new family of inequalities for the CPTP denoted rounded multistar inequalities and we prove...

  16. Global optimization of discrete truss topology design problems using a parallel cut-and-branch method

    DEFF Research Database (Denmark)

    Rasmussen, Marie-Louise Højlund; Stolpe, Mathias

    2008-01-01

    physics, and the cuts (Combinatorial Benders’ and projected Chvátal–Gomory) come from an understanding of the particular mathematical structure of the reformulation. The impact of a stronger representation is investigated on several truss topology optimization problems in two and three dimensions.......The subject of this article is solving discrete truss topology optimization problems with local stress and displacement constraints to global optimum. We consider a formulation based on the Simultaneous ANalysis and Design (SAND) approach. This intrinsically non-convex problem is reformulated to a...... mixed-integer linear program, which is solved with a parallel implementation of branch-and-bound. Additional valid inequalities and cuts are introduced to give a stronger representation of the problem, which improves convergence and speed up of the parallel method. The valid inequalities represent the...

  17. Tau leptonic branching ratios

    CERN Document Server

    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.

  18. Modeling branching in cereals

    OpenAIRE

    Jochem B. Evers; Vos, Jan

    2013-01-01

    Cereals and grasses adapt their structural development to environmental conditions and the resources available. The primary adaptive response is a variable degree of branching, called tillering in cereals. Especially for heterogeneous plant configurations the degree of tillering varies per plant. Functional–structural plant modeling (FSPM) is a modeling approach allowing simulation of the architectural development of individual plants, culminating in the emergent behavior at the canopy level....

  19. A primer on scientific programming with Python

    CERN Document Server

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

  20. A primer on scientific programming with Python

    CERN Document Server

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

  1. Investigating the Role of Computer-Supported Annotation in Problem-Solving-Based Teaching: An Empirical Study of a Scratch Programming Pedagogy

    Science.gov (United States)

    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…

  2. Healing the Earth: Through Programs in Environmental Restoration and Waste Management, the Tribal Colleges Are Working Together to Solve the Nation's Most Pressing Environmental Needs.

    Science.gov (United States)

    Cordero, Carlos

    1992-01-01

    Describes "Promoting Environmental Restoration/Management for American Indians" (PERMA), a joint effort of all Indian controlled colleges to create certificate programs in environmental and waste management. PERMA includes a summer bridge program to build science/math skills; a core academic transfer curriculum; a vocationally oriented two-year…

  3. Planeación de sistemas secundarios de distribución usando el algoritmo Branch and Bound Secondary distribution system planning using branch and bound

    Directory of Open Access Journals (Sweden)

    Ricardo Alberto Hincapie-Isaza

    2011-06-01

    Full Text Available En este trabajo se plantea una metodología para la solución del problema delplaneamiento de sistemas secundarios de distribución considerando un modelode programación lineal entero mixto (PLEM, el cual considera la ubicación y dimensionamiento de transformadores de distribución, el dimensionamientoy rutas de circuitos secundarios y sus costos variables. Para la solución delproblema se emplea el algoritmo Branch and Bound. Los resultados obtenidosen un sistema de prueba empleado en la literatura especializada muestran lavalidez y efectividad de la metodología propuesta.This paper presents a methodology for solving secondary distribution systems planning problem as a mixed integer linear programming problem (MILP. The algorithm takes into account several design issues such as the capacity and location of distribution transformers and secondary feeders. Variable costs of secondary feeders are also considered. The problem is solved using branch and bound algorithm. Numerical results show that the mathematical model and the solution technique are effective for this kind of problems.

  4. Thermal Energy Conversion Branch

    Science.gov (United States)

    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.

  5. Branch formation during organ development

    Science.gov (United States)

    Gjorevski, Nikolce; Nelson, Celeste M.

    2010-01-01

    Invertebrates and vertebrates use branching morphogenesis to build epithelial trees to maximize the surface area of organs within a given volume. Several molecular regulators of branching have recently been discovered, a number of which are conserved across different organs and species. Signals that control branching at the cellular and tissue levels are also starting to emerge, and are rapidly unveiling the physical nature of branch development. Here we discuss the molecular, cellular and physical processes that govern branch formation and highlight the major outstanding questions in the field. PMID:20890968

  6. Group Problem Solving

    CERN Document Server

    Laughlin, Patrick R

    2011-01-01

    Experimental research by social and cognitive psychologists has established that cooperative groups solve a wide range of problems better than individuals. Cooperative problem solving groups of scientific researchers, auditors, financial analysts, air crash investigators, and forensic art experts are increasingly important in our complex and interdependent society. This comprehensive textbook--the first of its kind in decades--presents important theories and experimental research about group problem solving. The book focuses on tasks that have demonstrably correct solutions within mathematical

  7. Thinking and problem solving

    OpenAIRE

    Frensch, Peter; Funke, Joachim

    2005-01-01

    Human thinking, and in particular, the human ability to solve complex, real-life problems contributes more than any other human ability to the development of human culture and the growth and development of human life on earth. However, the human ability to solve complex problems is still not well understood, partly because it has for a long time been largely ignored by traditional problem-solving research in the field of psychology. In this article, we present a definition of complex problem ...

  8. Hybrid OpenMP/MPI programs for solving the time-dependent Gross-Pitaevskii equation in a fully anisotropic trap

    Science.gov (United States)

    Satarić, Bogdan; Slavnić, Vladimir; Belić, Aleksandar; Balaž, Antun; Muruganandam, Paulsamy; Adhikari, Sadhan K.

    2016-03-01

    We present hybrid OpenMP/MPI (Open Multi-Processing/Message Passing Interface) parallelized versions of earlier published C programs (Vudragović et al. 2012) for calculating both stationary and non-stationary solutions of the time-dependent Gross-Pitaevskii (GP) equation in three spatial dimensions. The GP equation describes the properties of dilute Bose-Einstein condensates at ultra-cold temperatures. Hybrid versions of programs use the same algorithms as the C ones, involving real- and imaginary-time propagation based on a split-step Crank-Nicolson method, but consider only a fully-anisotropic three-dimensional GP equation, where algorithmic complexity for large grid sizes necessitates parallelization in order to reduce execution time and/or memory requirements per node. Since distributed memory approach is required to address the latter, we combine MPI programming paradigm with existing OpenMP codes, thus creating fully flexible parallelism within a combined distributed/shared memory model, suitable for different modern computer architectures. The two presented C/OpenMP/MPI programs for real- and imaginary-time propagation are optimized and accompanied by a customizable makefile. We present typical scalability results for the provided OpenMP/MPI codes and demonstrate almost linear speedup until inter-process communication time starts to dominate over calculation time per iteration. Such a scalability study is necessary for large grid sizes in order to determine optimal number of MPI nodes and OpenMP threads per node.

  9. Path-valued branching processes and nonlocal branching superprocesses

    CERN Document Server

    Li, Zenghu

    2012-01-01

    A family of continuous-state branching processes with immigration are constructed as the solution flow of a stochastic equation system driven by time-space noises. The family can be regarded as an inhomogeneous increasing path-valued branching process with immigration. Two nonlocal branching immigration superprocesses can be defined from the flow. We identify explicitly the branching and immigration mechanisms of those processes. The results provide new perspectives into the tree-valued Markov processes of Aldous and Pitman [Ann. Inst. H. Poincare Probab. Statist. 34 (1998), 637--686] and Abraham and Delmas [Ann. Probab. To appear].

  10. Linear circuit analysis program for IBM 1620 Monitor 2, 1311/1443 data processing system /CIRCS/

    Science.gov (United States)

    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.

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

  12. Geometric weighting method for solving multi-objective programming problems%几何加权法求解多目标规划问题

    Institute of Scientific and Technical Information of China (English)

    乔辰; 张国立

    2011-01-01

    多目标规划的目标函数相互冲突,一般不存在最优解,因此求其非劣解具有重要意义.采用几何加权法提出了一种新的评价函数,通过这种评价函数将多目标规划的目标函数转化为单目标函数,并证明了该方法得到的最优解是多目标规划问题的非劣解.通过算例,比较了线性加权法,极大极小法,几何加权法.结果表明,几何加权法是可行的;通过几何加权法能够得到原问题的非劣解,而且当权重变化时,几何加权法的结果比线性加权法更符合实际.%The objective functions of multi-objective programming are conflict, there is generally has no optimized solution , so how to get its non-inferior solutions is of great importance. Using geometric weighting method proposed a new evaluation function, with this evaluation function can turn the multi-objective programming to the single objective programming, and It has proved that the solution obtained on geometric weighting method is non-inferior solution on multi-objective programming. Comparing three methods, that the linear weighting method, min-max method and the geometric weighting method, through an example. The results show that geometric weighting method is feasible and using geometric weighting method can obtain non-inferior solutions of the original problem, and when the weights change, the geometric weighting results more practical than the linear weighting method.

  13. Solving the drift control problem

    Directory of Open Access Journals (Sweden)

    Melda Ormeci Matoglu

    2015-12-01

    Full Text Available We model the problem of managing capacity in a build-to-order environment as a Brownian drift control problem. We formulate a structured linear program that models a practical discretization of the problem and exploit a strong relationship between relative value functions and dual solutions to develop a functional lower bound for the continuous problem from a dual solution to the discrete problem. Refining the discretization proves a functional strong duality for the continuous problem. The linear programming formulation is so badly scaled, however, that solving it is beyond the capabilities of standard solvers. By demonstrating the equivalence between strongly feasible bases and deterministic unichain policies, we combinatorialize the pivoting process and by exploiting the relationship between dual solutions and relative value functions, develop a mechanism for solving the LP without ever computing its coefficients. Finally, we exploit the relationship between relative value functions and dual solutions to develop a scheme analogous to column generation for refining the discretization so as to drive the gap between the discrete approximation and the continuous problem to zero quickly while keeping the LP small. Computational studies show our scheme is much faster than simply solving a regular discretization of the problem both in terms of finding a policy with a low average cost and in terms of providing a lower bound on the optimal average cost.

  14. Methods and Technologies Branch (MTB)

    Science.gov (United States)

    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.

  15. The AFCRL Lunar amd Planetary Research Branch

    Science.gov (United States)

    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

  16. Direct Heuristic Algorithm for Linear Programming

    Directory of Open Access Journals (Sweden)

    I. Ramesh Babu

    2013-08-01

    Full Text Available Many applications in business and economics involve a process called optimization, in which we will be required to find the minimum cost, the maximum profit, or the minimum use of resources, where a decision maker may want to utilize limited available resources in the best possible manner. The limited resources may include material, money, manpower, space and time. Linear Programming provides various methods of solving such problems. The formulation of linear programming problem as a mathematical model is one type of optimization problem called linear programming. There are various methods for solving the linear programming problems. Some of them are approximation algorithm , branch and bound methods, cutting plane method etc. Other than Gomory’s cutting plane method, Branch and bound method LPP along with the DHALP (Direct heuristic algorithm for linear programming algorithm which is more efficient than these existing methods will be used for solving linear programming problems. An optimality test will also be included in this. Numerical experiments will depict the utility/scope of such a procedure.

  17. Improving Strategies via SMT Solving

    CERN Document Server

    Gawlitza, Thomas Martin

    2011-01-01

    We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widening operators for enforcing convergence within a finite number of iterations (ii) the use of merge operations (often, convex hulls) at the merge points of the control flow graph. It instead computes the least inductive invariant expressible in the domain at a restricted set of program points, and analyzes the rest of the code en bloc. We emphasize that we compute this inductive invariant precisely. For that we extend the strategy improvement algorithm of [Gawlitza and Seidl, 2007]. If we applied their method directly, we would have to solve an exponentially sized system of abstract semantic equations, resulting in memory exhaustion. Instead, we keep the system implicit and discover strategy improvements using SAT modulo real linear arithmetic (SMT). For evaluating strategies we use linear programming. Our algorithm has low polynomial s...

  18. Problem Solving and Learning

    CERN Document Server

    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.

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

  20. Solving Word Problems.

    Science.gov (United States)

    Karrison, Joan; Carroll, Margaret Kelly

    1991-01-01

    Students with language and learning disabilities may have difficulty solving mathematics word problems. Use of a sequential checklist, identifying clues and keywords, and illustrating a problem can all help the student identify and implement the correct computational process. (DB)

  1. Creative Problem Solving

    Institute of Scientific and Technical Information of China (English)

    岳科来

    2016-01-01

    There have considerable number of design philosophies and design methods in this world,but today I’d like to intorduce a new design problem solving system which comes from Chinese traditonal religion Dao.

  2. RCPO1 - A Monte Carlo program for solving neutron and photon transport problems in three dimensional geometry with detailed energy description and depletion capability

    International Nuclear Information System (INIS)

    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

  3. RCPO1 - A Monte Carlo program for solving neutron and photon transport problems in three dimensional geometry with detailed energy description and depletion capability

    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.

  4. Integrated Networks Branch

    Science.gov (United States)

    INB supports the National Outreach Network, the Geographic Management of Cancer Health Disparities Program, and advises on women’s health and sexual and gender minority opportunities within and across NCI.

  5. Annual report, Materials Science Branch, FY 1992

    Energy Technology Data Exchange (ETDEWEB)

    Padilla, S. [ed.

    1993-10-01

    This report summarizes the progress of the Materials Science Branch of the National Renewable Energy Laboratory (NREL) from October 1, 1991, through September 30, 1992. Six technical sections of the report cover these main areas of NREL`s in-house research: Crystal Growth, Amorphous Silicon, III-V High-Efficiency Photovoltaic Cells, Solid State Theory, Solid State Spectroscopy, and Program Management. 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.

  6. Tau hadronic branching ratios

    CERN Document Server

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

  7. Development and initial evaluation of a telephone-delivered, behavioral activation, and problem-solving treatment program to address functional goals of breast cancer survivors.

    Science.gov (United States)

    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.

  8. A Lagrangean Relaxtion Based Algorithm for Solving Set Partitioning Problems

    NARCIS (Netherlands)

    van Krieken, M.G.C.; Fleuren, H.A.; Peeters, M.J.P.

    2004-01-01

    In this paper we discuss a solver that is developed to solve set partitioning problems.The methods used include problem reduction techniques, lagrangean relaxation and primal and dual heuristics.The optimal solution is found using a branch and bound approach.In this paper we discuss these techniques

  9. Method for Solving Multi-objective Fuzzy Linear Programming with Elastic Constraints%含弹性约束的多目标模糊线性规划求解

    Institute of Scientific and Technical Information of China (English)

    刘云志; 郭嗣琮

    2013-01-01

    In this paper,a class of multi-objective fuzzy linear programming problem with elastic constraints is discussed.The authors introduce the concept of the weighted characteristic number and an order relation based on the fuzzy structured element method,apply Verdegay' s method of the fuzzy linear programming and the weighted characteristic number in the model transformation.Then,such multi-objective fuzzy linear programming problem is transformed into a class of clear multi-objective linear programming model with parameter constrains.The authors calculate the α quasi-optimal feasible solution of the above model by the method based on a class of linear weighted function.Finally,a numerical example is given to illustrate the general method for solving such multi-objective fuzzy linear programming problem.%本文讨论了一类含弹性约束的多目标模糊线性规划问题.利用模糊结构元方法引入模糊数的加权特征数概念和序关系,应用Verdegay的模糊线性规划方法及模糊数的加权特征数将此类多目标模糊线性规划问题转化成一类含参数约束条件的清晰多目标线性规划模型,并应用一种基于线性加权函数的规划算法求其α-拟最优可行解.最后,给出了一个数值实例来说明如何求解此类多目标模糊线性规划问题.

  10. An Integer Programming Approach and Implementation for an Electric Utility Capacity Planning Problem with Renewable Energy Sources

    OpenAIRE

    Hanif D. Sherali; Konstantin Staschus; Jorge M. Huacuz

    1987-01-01

    This paper presents an integer programming model and algorithm for an electric utility capacity expansion problem which considers the option of investing in nondispatchable or renewable energy sources. A branch-and-bound algorithm is proposed for this problem in which the continuous relaxation of the subproblem associated with each node in the enumeration tree is solved via an efficient two-phase procedure. This procedure solves a deterministic approximation of the problem in the first phase ...

  11. An Open Environment for Cooperative Equational Solving

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    We describe a system called CFLP which aims at the integration ofthe best featu res of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed computing. FLP provides support for defining one's own abstract ions over a constraint domain in an easy and comfortable way, whereas CCS is emp loyed to solve systems of mixed constraints by iterating specialized constraint solving methods in accordance with a well defined strategy. The system is a di s tributed implementation of a cooperative constraint functional logic programming scheme that combines higher-order lazy narrowing with cooperative constraint s o lving. The model takes advantage of the existence of several constraint solving resources located in a distributed environment (e.g., a network of computers), w hich communicate asynchronously via message passing. To increase the openness of the system, we are redesigning CFLP based on CORBA. We discuss some design and implementation issues of the system.

  12. 求解二次锥规划问题的非精确光滑算法%Inexact Smoothing Algorithm for Solving Second-Order Cone Programming Problems

    Institute of Scientific and Technical Information of China (English)

    于桃艳; 刘三阳; 蔡晓娜; 张菲

    2012-01-01

    针对大规模二次锥规划问题提出一种非精确光滑算法.该算法允许搜索方向有一定的误差,在选择步长时采用非单调线性搜索策略.证明了从任意点出发能得到算法的局部二次收敛速率.%A new inexact smoothing algorithm for solving large-scale second-order cone programming problems (SOCP) was proposed. This algorithm allows the search direction to have the certain error, and the non-monotone linear strategy is used to select the step length. The algorithm can get its local quadratic convergence from any point.

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

  14. Continuous-state branching processes

    CERN Document Server

    Li, Zenghu

    2012-01-01

    These notes were used in a short graduate course on branching processes the author gave in Beijing Normal University. The following main topics are covered: scaling limits of Galton--Watson processes, continuous-state branching processes, extinction probabilities, conditional limit theorems, decompositions of sample paths, martingale problems, stochastic equations, Lamperti's transformations, independent and dependent immigration processes. Some of the results are simplified versions of those in the author's book "Measure-valued branching Markov processes" (Springer, 2011). We hope these simplified results will set out the main ideas in an easy way and lead the reader to a quick access of the subject.

  15. ALGORITHMIC LOGIC TO SOLVE COMPUTATIONAL PROGRAMMING PROBLEMS: A DIDACTIC PROPOSAL / LÓGICA ALGORÍTMICA PARA LA RESOLUCIÓN DE PROBLEMAS DE PROGRAMACIÓN COMPUTACIONAL: UNA PROPUESTA DIDÁCTICA

    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

  16. 多下层分式双层规划问题的改进遗传算法%Genetic algorithm for solving a class of multi-follower fractional bi-level programming problems

    Institute of Scientific and Technical Information of China (English)

    都成娟; 李和成

    2012-01-01

    针对一类具有多个线性下层问题的分式双层规划,提出一种基于新编码方式的遗传算法.首先,利用对偶理论,将问题化为单层非线性规划;接着,利用下层对偶问题的可行基编码,针对任意编码个体,解出对偶变量值,使得单层规划变为线性分式规划;最后,求解产生的线性分式规划,其目标值作为个体的适应度值.这种编码方式及适应度的计算有效提高了遗传算法的效率.通过对4个算例的计算,验证了算法的有效性.%For a kind of fractional bi-level programming problems with more than one linear follower, a genetic algorithm based on a new encoding scheme was proposed. Firstly, the dual theory was applied to transform the original problem to a single-level nonlinear programming;secondly, all individuals were encoded by considering feasible base of the follower's dual problem. For any individual given, the dual variables can be solved, which makes the nonlinear problem become a linear fractional programming;finally, the resulting linear fractional programming was resolved and the objective value was taken as the fitness of this individual. Based on the encoding scheme and fitness evaluation, the efficiency of the genetic algorithm is improved, which is also illustrated by the simulation of four examples.

  17. A TRUST REGION ALGORITHM VIA BILEVEL LINEAR PROGRAMMING FOR SOLVING THE GENERAL MULTICOMMODITY MINIMAL COST FLOW PROBLEMS%双水平线性规划的信赖域算法解广义多品种最小费用流问题

    Institute of Scientific and Technical Information of China (English)

    朱德通

    2004-01-01

    This paper proposes a nonmonotonic backtracking trust region algorithm via bilevel linear programming for solving the general multicommodity minimal cost flow problems. Using the duality theory of the linear programming and convex theory, the generalized directional derivative of the general multicommodity minimal cost flow problems is derived. The global convergence and superlinear convergence rate of the proposed algorithm are established under some mild conditions.

  18. On Solving Linear Recurrences

    Science.gov (United States)

    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.

  19. Mathematics as Problem Solving.

    Science.gov (United States)

    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)

  20. Electric Current Solves Mazes

    Science.gov (United States)

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

  1. Left bundle-branch block

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

  2. The Effect of Learning Environments Based on Problem Solving on Students’ Achievements of Problem Solving

    Directory of Open Access Journals (Sweden)

    Ilhan KARATAS

    2013-07-01

    Full Text Available Problem solving is recognized as an important life skill involving a range of processes including analyzing, interpreting, reasoning, predicting, evaluating and reflecting. For that reason educatingstudents as efficient problem solvers is an important role of mathematics education. Problem solving skill is the centre of mathematics curriculum. Students’ gaining of that skill in school mathematics is closely related with the learning environment to beformed and the roles given to the students. The aim of this study is to create a problem solving based learning environment to enhance the students’ problem solving skill. Within this scope, students’practiced activities and problems that provide them to proceed in Polya (1945’s problem solving phases and throughout the study, students’ success in problem solving have been evaluated. While experimental group students received problem solving based learning environment performed, control group students have continued their present program in this quise1experimental study. Eleven problem solving activities were given to the students at the beginning, middle and end of the study and the students’ performances wereanalyzed based on problem solving phases. The findings illustrated that the experimental group students’ success in problem solving activities has increased while the control group students’ success has not changed significantly.

  3. Algorithm Design and Simulation of Solving Nonlinear Mixed Integer Programming Problem%求解非线性混合整数规划的算法设计与仿真

    Institute of Scientific and Technical Information of China (English)

    王纯子; 郭伟; 张斌

    2013-01-01

    For the nonlinear mixed integer programming problem with multi-peak objective function and large-scale variables,this paper designs a sequentially selected extended time Petri net (ETPN) model,and proposes its modeling algorithm.This paper also improves the traditional ant colony algorithm and designs partial and overall evolution operators by combining with genetic algorithm,then proposes the optimal searching algorithm based on nonlinear mixed integer programming problem,which solves the evolution problem of both discrete variables and continuous variables,as well as ensures the search range and convergence rate.The result of simulation shows that the new solving algorithm of nonlinear mixed integer programming has better accuracy,universality,stability and high convergence rate,which is suitable for complicated and large-scale questions.%针对目标函数具有多峰值、变量规模较大的非线性混合整数规划问题,设计了一种序贯选择式的扩展时间Petri网模型,并给出了该模型的构建算法.改进了传统的蚁群算法,并引入遗传演化的思想,设计了局部和全局演化算子,提出了基于非线性混合整数规划问题的最优解搜索算法.该算法解决了离散变量和连续变量的进化问题,同时保证了搜索广度和收敛速度.仿真结果表明,该算法在求解准确性、普适性、稳定性以及收敛速度方面具有更好的性能,适应于解决复杂的大规模非线性混合整数规划问题.

  4. Radiation effects on branched polysilanes

    Energy Technology Data Exchange (ETDEWEB)

    Maeda, K.; Seki, S.; Tagawa, S. [Osaka Univ., Ibaraki (Japan). Inst. of Scientific and Industrial Research; Shibata, H.; Iwai, T. [Tokyo Univ. (Japan). Research Center for Nuclear Science and Technology

    2000-03-01

    We observed crosslinking and scission caused by gamma radiation in linear and branched polysilanes which have from 5% to 33% of the branching points. The crosslinking reactions become predominant for the irradiation with branching density increasing. The cleavage did not take place exclusively at the branching points and branching polysilanes are sensitive to radiation extraordinary as compared with linear polysilane from a careful study of the radiolysis products of a series of polysilanes. This is due to the increasing Si {center_dot} contributing to the crosslinking reaction and that they are not resonance-stabilized by double bonds as the reaction mechanism in the irradiated polysilanes. However, the gelation curve in linear PMPS irradiated by 2 MeV He{sup +} is almost consistent with that in branching PMPS, indicating that the size of chemical track is responsible for the gel fraction. The crosslinking G value for high molecular weight PMPS irradiated by 2 MeV He{sup +} was drastically decreased as compared with that for low molecular weight. It suggests that there are a large number of intramolecular crosslinking points for high molecular weight PMPS. (author)

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

  6. Appreciative Problem Solving

    DEFF Research Database (Denmark)

    Hansen, David

    2012-01-01

    Many industrial production work systems have increased in complexity, and their new business model scompete on innovation, rather than low cost.At a medical device production facility committed to Lean Production, a research project was carried out to use Appreciative Inquiry to better engage...... 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...

  7. Creativity and problem Solving

    Directory of Open Access Journals (Sweden)

    René Victor Valqui Vidal

    2004-12-01

    Full Text Available 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.

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

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

  10. NETWORK MODEL AND ALGORITHM FOR SOLVING PROBLEM PERTAINING TO OPTIMUM DISTRIBUTION OF CAPITAL INVESTMENT WHILE MODERNIZING ENTERPRISES OF HEATING SYSTEMS

    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. 

  11. Constraints and Logic Programming in Grammars and Language Analysis

    DEFF Research Database (Denmark)

    Christiansen, Henning

    2014-01-01

    Constraints are an important notion in grammars and language analysis, and constraint programming techniques have been developed concurrently for solving a variety of complex problems. In this chapter we consider the synthesis of these branches into practical and effective methods for language an...... methods that combine constraints with logic grammars such as Definite Clause Grammars and CHR Grammars, and show also a direct relationship to abductive reasoning....

  12. Introducing artificial intelligence into structural optimization programs

    International Nuclear Information System (INIS)

    Artificial Intelligence /AI/ is defined as the branch of the computer science concerned with the study of the ideas that enable computers to be intelligent. The main purpose of the application of AI in engineering is to develop computer programs which function better as tools for engineers and designers. Many computer programs today have properties which make them inconvenient to their final users and the research carried within the field of AI provides tools and techniques so that these restriction can be removed. The continuous progress in computer technology has lead to developing efficient computer systems which can be applied to more than simple solving sets of equations. (orig.)

  13. Solving Equations of Multibody Dynamics

    Science.gov (United States)

    Jain, Abhinandan; Lim, Christopher

    2007-01-01

    Darts++ is a computer program for solving the equations of motion of a multibody system or of a multibody model of a dynamic system. It is intended especially for use in dynamical simulations performed in designing and analyzing, and developing software for the control of, complex mechanical systems. Darts++ is based on the Spatial-Operator- Algebra formulation for multibody dynamics. This software reads a description of a multibody system from a model data file, then constructs and implements an efficient algorithm that solves the dynamical equations of the system. The efficiency and, hence, the computational speed is sufficient to make Darts++ suitable for use in realtime closed-loop simulations. Darts++ features an object-oriented software architecture that enables reconfiguration of system topology at run time; in contrast, in related prior software, system topology is fixed during initialization. Darts++ provides an interface to scripting languages, including Tcl and Python, that enable the user to configure and interact with simulation objects at run time.

  14. Learning Matlab a problem solving approach

    CERN Document Server

    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.

  15. Solving Diophantine Equations

    OpenAIRE

    Cira, Octavian; Smarandache, Florentin

    2016-01-01

    In this book a multitude of Diophantine equations and their partial or complete solutions are presented. How should we solve, for example, the equation {\\eta}({\\pi}(x)) = {\\pi}({\\eta}(x)), where {\\eta} is the Smarandache function and {\\pi} is Riemann function of counting the number of primes up to x, in the set of natural numbers? If an analytical method is not available, an idea would be to recall the empirical search for solutions. We establish a domain of searching for the solutions and th...

  16. Simon on problem solving

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

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

  18. The Functional Equivalence of Problem Solving Skills

    Science.gov (United States)

    Simon, Herbert A.

    1975-01-01

    This analysis of solutions to the Tower of Hanoi Problem underscores the importance of subject-by-subject analysis of "What is learned" in understanding human behavior in problem-solving situations, and provides a technique for describing subjects' task performance programs in detail. (Author/BJG)

  19. GIS Live and Web Problem Solving

    Science.gov (United States)

    Hagevik, R.; Hales, D.; Harrell, J.

    2007-01-01

    GIS Live is a live, interactive, web problem-solving (WPS) program that partners Geographic Information Systems (GIS) professionals with educators to implement geospatial technologies as curriculum-learning tools. It is a collaborative effort of many government agencies, educational institutions, and professional organizations. Problem-based…

  20. Solving Wicked Problems through Action Learning

    Science.gov (United States)

    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…

  1. Method of branch ariflow for calculatinga complicated mine ventilation networks

    Institute of Scientific and Technical Information of China (English)

    LIU Ze-gong

    2001-01-01

    The solutions widely used at preeent for calculating complicated mine ventilation networks are ones in which resistance of the branches and characteristic parameters of the fans are taken as basic input data. But it is time-and-energy-consuming to obtain the branch resistance values. A new solution is developed in this peper in which the branch reeistance values are obtained through measuring and evaluating the airflow of the whole ventilation network. Theoretical analysis is made of the establishment of a linear equation series with branch resistance as unknown numbers, an equation series for which one, and only one, result of solutions exists. This solution is programmed in C language and passed on a personal computer. The programmed solution programmed proves of practical use, as demonstrated by specific examples. Being different from other solutions, the method takes the branch airflow and fan working points as basic input data, and the present solution is of greater advantage for calculating ventilation networks of mines in operation.

  2. Applying Nonlinear Programming to Solve Optimal Control for Soft Landing of Lunar Probe%应用非线性规划求解月球探测器着陆轨道最优控制

    Institute of Scientific and Technical Information of China (English)

    肖刚

    2015-01-01

    In order to decrease the fuel consumption under a finite thrust, a method of nonlinear program-ming is presented to solve the optimal control problem on the soft landing of a lunar probe.The lunar soft land-ing problem is transformed into a two point boundary value problem in mathematics.In consideration of the bound condition, applying on Lagrang principle, the two-point boundary value problem is converted into a pa-rameter optimization problem.The simulated result demonstrates that the proposed method leads to a success-ful implementation of the lunar soft landing, which shows that the proposed design scheme is effective.%为了减少有限推力作用下月球探测器软着陆所需的燃料消耗,提出了应用非线性规划方法来求解该最优控制问题。首先,将有限推力作用下月球软着陆问题转化为数学上的两点边值问题;在考虑边界条件的前提下,利用拉格朗日原理将该两点边值问题转化为针对控制变量的优化问题;然后应用非线性规划方法求解所形成的参数优化问题。实验仿真结果显示,该方法能够成功实现月面软着陆,表明提出的设计方法简单有效。

  3. 求解0-1整数规划的混合粒子群优化算法%Solving 0-1 Integer Programming Problem by Hybrid Particle Swarm Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    薛峰; 陈刚; 高尚

    2011-01-01

    The classical particle swarm optimization is a powerful method to find the minimum of a numerical function,on a continuous definition domain. The particle swarm optimization algorithm combine the ideal of the genetic algorithm is recommended to solve 0-1 integer programming problem. All the 6 hybrid particle swarm optimization algorithms are proved effective. Especially the hybrid particle swarm optimization algorithm with across strategy A and mutation strategy C is a simple and effective better algorithm than others. It can easily be modified for any combinatorial problem for which we have no good specialized algorithm.%经典的粒子群是一个有效的寻找连续函数极值的方法,结合遗传算法的思想提出的混合粒子群算法来解决0-1整数规划问题,经过比较测试,6种混合粒子群算法的效果都比较好,特别交叉策略A和变异策略C的混合粒子群算法是最好的且简单有效的算法.对于目前还没有好的解法的组合优化问题,很容易地修改此算法就可解决.

  4. Branch-pipe-routing approach for ships using improved genetic algorithm

    Science.gov (United States)

    Sui, Haiteng; Niu, Wentie

    2016-09-01

    Branch-pipe routing plays fundamental and critical roles in ship-pipe design. The branch-pipe-routing problem is a complex combinatorial optimization problem and is thus difficult to solve when depending only on human experts. A modified genetic-algorithm-based approach is proposed in this paper to solve this problem. The simplified layout space is first divided into threedimensional (3D) grids to build its mathematical model. Branch pipes in layout space are regarded as a combination of several two-point pipes, and the pipe route between two connection points is generated using an improved maze algorithm. The coding of branch pipes is then defined, and the genetic operators are devised, especially the complete crossover strategy that greatly accelerates the convergence speed. Finally, simulation tests demonstrate the performance of proposed method.

  5. Branch-pipe-routing approach for ships using improved genetic algorithm

    Science.gov (United States)

    Sui, Haiteng; Niu, Wentie

    2016-05-01

    Branch-pipe routing plays fundamental and critical roles in ship-pipe design. The branch-pipe-routing problem is a complex combinatorial optimization problem and is thus difficult to solve when depending only on human experts. A modified genetic-algorithm-based approach is proposed in this paper to solve this problem. The simplified layout space is first divided into threedimensional (3D) grids to build its mathematical model. Branch pipes in layout space are regarded as a combination of several two-point pipes, and the pipe route between two connection points is generated using an improved maze algorithm. The coding of branch pipes is then defined, and the genetic operators are devised, especially the complete crossover strategy that greatly accelerates the convergence speed. Finally, simulation tests demonstrate the performance of proposed method.

  6. RCP01: a Monte Carlo program for solving neutron and photon transport problems in three-dimensional geometry with detailed energy description (LWBR development program). [For CDC-6600 and -7600, in FORTRAN

    Energy Technology Data Exchange (ETDEWEB)

    Candelore, N R; Gast, R C; Ondis, II, L A

    1978-08-01

    The RCP01 Monte Carlo program for the CDC-7600 and CDC-6600 performs fixed source or eigenfunction neutron reaction rate calculations, or photon reaction rate calculations, for complex geometries. The photon calculations may be linked to the neutron reaction rate calculations. For neutron calculations, the full energy range is treated as required for neutron birth by the fission process and the subsequent neutron slowing down and thermalization, i.e., 10 MeV to 0 eV; for photon calculations the same energy range is treated. The detailed cross sections required for the neutron or photon collision processes are provided by RCPL1. This report provides details of the various types of neutron and photon starts and collisions, the common geometry tracking, and the input required. 37 figures, 1 table.

  7. Solving Differential Equations in R: Package deSolve

    Science.gov (United States)

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

  8. Solving Differential Equations in R: Package deSolve

    NARCIS (Netherlands)

    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 differenti

  9. Branching of keratin intermediate filaments.

    Science.gov (United States)

    Nafeey, Soufi; Martin, Ines; Felder, Tatiana; Walther, Paul; Felder, Edward

    2016-06-01

    Keratin intermediate filaments (IFs) are crucial to maintain mechanical stability in epithelial cells. Since little is known about the network architecture that provides this stiffness and especially about branching properties of filaments, we addressed this question with different electron microscopic (EM) methods. Using EM tomography of high pressure frozen keratinocytes, we investigated the course of several filaments in a branching of a filament bundle. Moreover we found several putative bifurcations in individual filaments. To verify our observation we also visualized the keratin network in detergent extracted keratinocytes with scanning EM. Here bifurcations of individual filaments could unambiguously be identified additionally to bundle branchings. Interestingly, identical filament bifurcations were also found in purified keratin 8/18 filaments expressed in Escherichia coli which were reassembled in vitro. This excludes that an accessory protein contributes to the branch formation. Measurements of the filament cross sectional areas showed various ratios between the three bifurcation arms. This demonstrates that intermediate filament furcation is very different from actin furcation where an entire new filament is attached to an existing filament. Instead, the architecture of intermediate filament bifurcations is less predetermined and hence consistent with the general concept of IF formation. PMID:27039023

  10. Risk Factor Assessment Branch (RFAB)

    Science.gov (United States)

    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.

  11. Fluid Flow at Branching Junctions

    OpenAIRE

    Sochi, Taha

    2013-01-01

    The flow of fluids at branching junctions plays important kinematic and dynamic roles in most biological and industrial flow systems. The present paper highlights some key issues related to the flow of fluids at these junctions with special emphasis on the biological flow networks particularly blood transportation vasculature.

  12. High-Speed Rail Train Timetabling Problem: A Time-Space Network Based Method with an Improved Branch-and-Price Algorithm

    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.

  13. Critical evaluation of branch polarity and apical dominance as dictators of colony astogeny in a branching coral.

    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.

  14. A Perspective on the Future of Branch Campuses

    Science.gov (United States)

    Bird, Charles

    2011-01-01

    Branch campuses can thrive in the extremely competitive environment of higher education, because of their commitment to access and their relatively low cost of operation. Success, however, depends on understanding the preferences of adult learners and other place bound students. With targeted programs, focused services, careful financial…

  15. Conflict-driven ASP Solving with External Sources

    OpenAIRE

    Eiter, Thomas; Fink, Michael; Krennwallner, Thomas; Redl, Christoph

    2012-01-01

    Answer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs and efficient solvers. To enable access to external information, HEX-programs extend programs with external atoms, which allow for a bidirectional communication between the logic program and external sources of computation (e.g., description logic reasoners and Web resources). Current solvers evaluate HEX-programs by a translation to ASP itself, in which values of external atoms are gues...

  16. The computer program 'TOBAS' for nuclear fuel production and power generation industry optimization

    International Nuclear Information System (INIS)

    The program TOBAS aims at optimizing the activities in separate industry branches which are functionally linked. It generates in an automatic mode the models of industries of any configuration (nuclear power generation, uranium ore mining and enrichment, uranium inversion and separation of its isotopes, fuel rods and assemblies fabrication, chemical treatment of irradiated materials, etc.). The parameters describing the problem are introduced as input data and an optimum decision based on the given input data is generated as output data, namely the technology intensities, technology and resources costs. The algorithms included in TOBAS are able to solve very sophisticated optimization task, as for instance, nonlinear, partly integer dynamic task of non convex mathematical programming. An optimization task is illustrated by the case of nuclear fuel industry. All the branches of the fuel industry are described by complicate nonlinear models and include: the branch of mining and natural U ore enrichment, the branch of U isotope separation, the branch of fuel, shielding elements and assemblies fabrication and the branch of chemical reprocessing of irradiated materials which are unloaded from nuclear reactors. If, in designing a new mechanism or creating a new technology, the designer has the optimum system prices of all the resources involved in the project, the market induced risks will be avoided. At present the program TOBAS is used for accumulation of data base containing the optimum plans of Russian and foreign power industries and of database for optimum system prices of resources. (author)

  17. A Lagrangean Relaxtion Based Algorithm for Solving Set Partitioning Problems

    OpenAIRE

    Krieken, M.G.C. van; Fleuren, H.A.; Peeters, M.J.P.

    2004-01-01

    In this paper we discuss a solver that is developed to solve set partitioning problems.The methods used include problem reduction techniques, lagrangean relaxation and primal and dual heuristics.The optimal solution is found using a branch and bound approach.In this paper we discuss these techniques.Furthermore, we present the results of several computational experiments and compare the performance of our solver with the well-known mathematical optimization solver Cplex.

  18. Discrete PSO combined with the orthogonal crossover for solving integer nonlinear programming%求解整数非线性规划结合正交杂交的离散PSO算法

    Institute of Scientific and Technical Information of China (English)

    张莉; 冯大政; 李宏

    2012-01-01

    针对整数非线性规划问题,提出一种结合正交杂交的离散粒子群优化(PSO)算法.首先采用舍入取整方法,为了减少舍入误差,对PSO中的每个粒子到目前为止的最好位置进行随机修正,将基于正交实验设计的正交杂交算子引入离散PSO算法,以增强搜索性能;然后对PSO算法中的惯性权重和收缩因子采用动态调整策略,以提高算法的搜索效率;最后对一些不同维数的整数非线性规划问题进行数值仿真实验,实验结果表明了所提出算法的有效性.%For solving the integer nonlinear programming problems,a discrete particle swarm optimization(PSO) algorithm combined with the orthogonal crossover is proposed. In the PSO algorithm,each particle of the swarm is truncated to the nearest integer after the determination of its new position,and then each particle's best position till now is repaired by using a stochastic method to reduce the rounding error. The orthogonal crossover operator based on the orthogonal experimental design is integrated into discrete PSO algorithm to make a systematic and rational exploration. The inertia weight and constriction factor are dynamically adjusted to improve the efficiency of PSO algorithm. Some numerical examples with different dimensions are carried out and the experimental results show the effectiveness of the proposed algorithm.

  19. Branching processes in disease epidemics

    Science.gov (United States)

    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

  20. A branch-and-cut approach to physical mapping of chromosomes by unique end-probes.

    Science.gov (United States)

    Christof, T; Jünger, M; Kececioglu, J; Mutzel, P; Reinelt, G

    1997-01-01

    A fundamental problem in computational biology is the construction of physical maps of chromosomes from hybridization experiments between unique probes and clones of chromosome fragments in the presence of error. Alizadeh, Karp, Weisser and Zweig (Algorithmica 13:1/2, 52-76, 1995) first considered a maximum-likelihood model of the problem that is equivalent to finding an ordering of the probes that minimizes a weighted sum of errors and developed several effective heuristics. We show that by exploiting information about the end-probes of clones, this model can be formulated as a Weighted Betweenness Problem. This affords the significant advantage of allowing the well-developed tools of integer linear-programming and branch-and-cut algorithms to be brought to bear on physical mapping, enabling us for the first time to solve small mapping instances to optimality even in the presence of high error. We also show that by combining the optimal solution of many small overlapping Betweenness Problems, one can effectively screen errors from larger instances and solve the edited instance to optimality as a Hamming-Distance Traveling Salesman Problem. This suggests a new approach, a Betweenness-Traveling Salesman hybrid, for constructing physical maps.

  1. A branch-and-cut approach to physical mapping with end-probes

    Energy Technology Data Exchange (ETDEWEB)

    Christof, T.; Reinelt, G. [Universitaet Heidelberg (Germany); Juenger, M. [Universitaet zu Koeln (Germany)] [and others

    1997-12-01

    A fundamental problem in computational biology is the construction of physical maps of chromosomes from hybridization experiments between unique probes and clones of chromosome fragments in the presence of error. Alizadeh, Karp, Weisser and Zweig [AKWZ94] first considered a maximum-likelihood model of the problem that is equivalent to finding an ordering of the probes that minimizes a weighted sum of errors, and developed several effective heuristics. We show that by exploiting information about the end-probes of clones, this model can be formulated as a weighted Betweenness Problem. This affords the significant advantage of allowing the well-developed tools of integer linear-programming and branch-and-cut algorithms to be brought to bear on physical mapping, enabling us for the first time to solve small mapping instances to optimality even in the presence of high error. We also show that by combining the optimal solution of many small overlapping Betweenness Problems, one can effectively screen errors from larger instances, and solve the edited instance to optimality as a Hamming-Distance Traveling Salesman Problem. This suggests a new combined approach to physical map construction. 18 refs., 13 figs.

  2. A Virtual Branch Method for Branch Power Flow Off-limit Analysis%支路潮流越限控制的虚拟支路法

    Institute of Scientific and Technical Information of China (English)

    苗峰显; 白雪峰; 郭志忠

    2009-01-01

    为解决支路潮流越限问题,提出了支路潮流越限控制的虚拟支路法.通过对潮流越限支路并联虚拟支路法,使原潮流越限支路的电流降低到目标电流水平.虚拟支路导纳参数由目标分流系数、潮流越限支路导纳及戴维南等效阻抗共同确定.基于置换定理,将虚拟支路用含参数的虚拟功率源置换,将虚拟支路的切除问题转化为虚拟支路两端点注入功率的增长问题.根据支路视在功率对节点功率的灵敏度,逐步计算最小代价的控制方案.IEEE算例仿真显示该方法可将越限支路电流降低到目标电流水平,验证了其可行性和有效性.%A virtual branch control method is proposed to solve the branch power flow off-limit problem. By adding a shunt virtual branch to the branch experiencing branch power flow off-limit, the original off-limit current of the branch can be reduced to a target level of branch current. The admittance of the virtual branch can be obtained by target shunting coefficient,Thevenin's equivalent impedance and admittance of the branch of power flow off-limit. Based on substitution theorem, the virtual branch is replaced by a parameterized virtual power source. Thus, the remove problem of virtual branch is turned to injection power increase problem on the two buses connected by the virtual branch. Based on sensitivity of the apparent power of the branch with respect to bus injection power, the minimum cost control scheme for branch of power flow off-limit can be obtained. The simulation results of the New England 39-bus test system show that the current of the branch of power flow off-limit descends to target level of current. The feasibility and efficiency of the proposed algorithm are validated.

  3. Branching in current-voltage characteristics of intrinsic Josephson junctions

    Energy Technology Data Exchange (ETDEWEB)

    Shukrinov, Yu M [BLTP, JINR, Dubna, Moscow Region, 141980 (Russian Federation); Mahfouzi, F [Institute for Advanced Studies in Basic Sciences, PO Box 45195-1159, Zanjan (Iran, Islamic Republic of)

    2007-02-15

    We study branching in the current-voltage characteristics of the intrinsic Josephson junctions of high-temperature superconductors in the framework of the capacitively coupled Josephson junction model with diffusion current. A system of dynamical equations for the gauge-invariant phase differences between superconducting layers for a stack of ten intrinsic junctions has been numerically solved. We have obtained a total branch structure in the current-voltage characteristics. We demonstrate the existence of a 'breakpoint region' on the current-voltage characteristics and explain it as a result of resonance between Josephson and plasma oscillations. The effect of the boundary conditions is investigated. The existence of two outermost branches and correspondingly two breakpoint regions for the periodic boundary conditions is shown. One branch, which is observed only at periodic boundary conditions, corresponds to the propagating of the plasma mode. The second one corresponds to the situation when the charge oscillations on the superconducting layers are absent, excluding the breakpoint. A time dependence of the charge oscillations at breakpoints is presented.

  4. Branching in current voltage characteristics of intrinsic Josephson junctions

    Science.gov (United States)

    Shukrinov, Yu M.; Mahfouzi, F.

    2007-02-01

    We study branching in the current-voltage characteristics of the intrinsic Josephson junctions of high-temperature superconductors in the framework of the capacitively coupled Josephson junction model with diffusion current. A system of dynamical equations for the gauge-invariant phase differences between superconducting layers for a stack of ten intrinsic junctions has been numerically solved. We have obtained a total branch structure in the current-voltage characteristics. We demonstrate the existence of a 'breakpoint region' on the current-voltage characteristics and explain it as a result of resonance between Josephson and plasma oscillations. The effect of the boundary conditions is investigated. The existence of two outermost branches and correspondingly two breakpoint regions for the periodic boundary conditions is shown. One branch, which is observed only at periodic boundary conditions, corresponds to the propagating of the plasma mode. The second one corresponds to the situation when the charge oscillations on the superconducting layers are absent, excluding the breakpoint. A time dependence of the charge oscillations at breakpoints is presented.

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

  6. Creep of welded branched pipes

    OpenAIRE

    Rayner, Glen

    2004-01-01

    Creep failure of welds in high-temperature power plant steam piping systems is known to be a potential cause of plant failure. Creep behaviour of plain pipes with circumferential welds and cross-weld specimens have received fairly extensive attention. However, research into the creep behaviour of welded thick-walled branched steam pipes has received less attention. Consequently, this thesis addresses improving the understanding of the creep behaviour for this type of geometry. Numerical and a...

  7. Interactions between Axillary Branches of Arabidopsis

    Institute of Scientific and Technical Information of China (English)

    Veronica Ongaro; Katherine Bainbridge; Lisa Williamson; Ottoline Leyser

    2008-01-01

    Studies of apical dominance have benefited greatly from two-branch assays in pea and bean,in which the shoot system is trimmed back to leave only two active cotyledonary axillary branches.In these two-branch shoots,a large body of evidence shows that one actively growing branch is able to inhibit the growth of the other,prompting studies on the nature of the inhibitory signals,which are still poorly understood.Here,we describe the establishment of two-branch assays in Arabidopsis,using consecutive branches on the bolting stem.As with the classical studies in pea and bean,these consecutive branches are able to inhibit one another's growth.Not only can the upper branch inhibit the lower branch,but also the lower branch can inhibit the upper branch,illustrating the bi-directional action of the inhibitory signals.Using mutants,we show that the inhibition is partially dependent on the MAX pathway and that while the inhibition is clearly transmitted across the stem from the active to the inhibited branch,the vascular connectivity of the two branches is weak,and the MAX pathway is capable of acting unilaterally in the stem.

  8. A Simulation of Blood Cells in Branching Capillaries

    CERN Document Server

    Isfahani, Amir H G; Freund, Jonathan B

    2008-01-01

    The multi-cellular hydrodynamic interactions play a critical role in the phenomenology of blood flow in the microcirculation. A fast algorithm has been developed to simulate large numbers of cells modeled as elastic thin membranes. For red blood cells, which are the dominant component in blood, the membrane has strong resistance to surface dilatation but is flexible in bending. Our numerical method solves the boundary integral equations built upon Green's functions for Stokes flow in periodic domains. This fluid dynamics video is an example of the capabilities of this model in handling complex geometries with a multitude of different cells. The capillary branch geometries have been modeled based upon observed capillary networks. The diameter of the branches varies between 10-20 mum. A constant mean pressure gradient drives the flow. For the purpose of this fluid dynamics video, the red blood cells are initiated as biconcave discs and white blood cells and platelets are initiated as spheres and ellipsoids resp...

  9. Mechanical properties of branched actin filaments

    CERN Document Server

    Razbin, Mohammadhosein; Benetatos, Panayotis; Zippelius, Annette

    2015-01-01

    Cells moving on a two dimensional substrate generate motion by polymerizing actin filament networks inside a flat membrane protrusion. New filaments are generated by branching off existing ones, giving rise to branched network structures. We investigate the force-extension relation of branched filaments, grafted on an elastic structure at one end and pushing with the free ends against the leading edge cell membrane. Single filaments are modeled as worm-like chains, whose thermal bending fluctuations are restricted by the leading edge cell membrane, resulting in an effective force. Branching can increase the stiffness considerably; however the effect depends on branch point position and filament orientation, being most pronounced for intermediate tilt angles and intermediate branch point positions. We describe filament networks without cross-linkers to focus on the effect of branching. We use randomly positioned branch points, as generated in the process of treadmilling, and orientation distributions as measur...

  10. Basic Sciences Branch annual report, FY 1990

    Energy Technology Data Exchange (ETDEWEB)

    1991-12-01

    This report summarizes the progress of the Basic Sciences Branch of the National Renewable Energy Laboratory (NREL) from October 1, 1989, through September 30, 1990. Six 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, and Solid-State Spectroscopy. Each section of the report was written by the group leader principally in charge of the work. The task in each case was to explain the purpose and major accomplishments of the work in the context of the US Department of Energy's National Photovoltaic Research Program plans.

  11. Basic Sciences Branch annual report, FY 1990

    Energy Technology Data Exchange (ETDEWEB)

    1991-12-01

    This report summarizes the progress of the Basic Sciences Branch of the National Renewable Energy Laboratory (NREL) from October 1, 1989, through September 30, 1990. Six 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, and Solid-State Spectroscopy. Each section of the report was written by the group leader principally in charge of the work. The task in each case was to explain the purpose and major accomplishments of the work in the context of the US Department of Energy`s National Photovoltaic Research Program plans.

  12. Designing Computer Software for Problem-Solving Instruction.

    Science.gov (United States)

    Duffield, Judith A.

    1991-01-01

    Discusses factors that might influence the effectiveness of computer software designed to teach problem solving. Topics discussed include the structure of knowledge; transfer of training; computers and problem solving instruction; human-computer interactions; and types of software, including drill and practice programs, tutorials, instructional…

  13. Improving Mathematical Problem Solving Skills: The Journey to Success

    Science.gov (United States)

    Rousseau, Donna

    2009-01-01

    The purpose of this study was to determine if problem solving skills can be improved through the use of an interdisciplinary program incorporating reading, music, and mathematics. The study was conducted in seven fifth grade classrooms, and addresses the need to teach problem solving strategies in elementary school and the importance of problem…

  14. Artificial Intelligence Research Branch future plans

    Science.gov (United States)

    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.

  15. Identifying thermal cycling mechanisms in PWR branch line piping

    Energy Technology Data Exchange (ETDEWEB)

    Rosinski, S.T. [EPRI, Charlotte, NC (United States); Keller, J.D.; Bilanin, A.J. [Continuum Dynamics, Inc., Ewing, NJ (United States)

    2002-07-01

    Predicting the onset and the characteristics of thermal cycling in pressurized water reactor (PWR) branch line piping systems is critical to formulation of thermal fatigue screening tools. The complex nature of the underlying thermal-hydraulic phenomena, however, significantly complicates prediction using analytical models or direct numerical simulations. Instead, it is necessary to perform scaled experiments to identify the physical mechanisms and to gather data for formulation of semi-empirical models for the thermal cycling phenomena. Through the EPRI Materials Reliability Program a test program is underway to identify and develop semi-empirical correlations for the physical thermalhydraulic mechanisms that cause thermal cycling in dead-ended PWR branch line piping systems. Three series of tests are being performed in this test program: configuration tests on a representative up-horizontal (UH) branch line piping geometry, configuration tests on a representative down-horizontal (DH) branch line piping geometry, and high Reynolds number tests to assess penetration of secondary flow structures into a dead-ended branch line. Results from UH and DH configuration tests indicate that random turbulence penetration is not sufficient for thermal cycling to occur. Rather a swirling flow structure, representative of a large, 'corkscrew' vortical structure, is required for thermal cycling. Scale tests on the UH configuration have simulated cycling phenomena observed in full-scale plant data and have been used to determine parametric sensitivities in formulating a predictive model for the thermal cycling. Data indicate that the mechanism for thermal cycling in UH configurations is stochastic but scales with the leak rate from the valve. The critical dependent variables are reduced to several non-dimensional scaling curves, resulting in a semiempirical predictive model. This paper discusses the test program and the results obtained to date. Application of these

  16. Solve the partitioning problem by sticker model in DNA computing

    Institute of Scientific and Technical Information of China (English)

    QU Huiqin; LU Mingming; ZHU Hong

    2004-01-01

    The aim of this work is to solve the partitioning problem, the most canonical NP-complete problem containing numerical parameters, within the sticker model of DNA computing. We firstly design a parallel program for addition, and then give a program to calculate the subset sums of a set. At last, a program for partitioning is given, which contains the former programs. Furthermore, the correctness of each program is proved in this paper.

  17. The Effects of a Branch Campus

    Science.gov (United States)

    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…

  18. Programs.

    Science.gov (United States)

    Community College Journal, 1996

    1996-01-01

    Includes a collection of eight short articles describing model community college programs. Discusses a literacy program, a mobile computer classroom, a support program for at-risk students, a timber-harvesting program, a multimedia presentation on successful women graduates, a career center, a collaboration with NASA, and an Israeli engineering…

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

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

  1. A Power-Aware Branch Predictor by Accessing the BTB Selectively

    Institute of Scientific and Technical Information of China (English)

    Cheol Hong Kim; Sung Woo Chung; Chu Shik Jhon

    2005-01-01

    Microarchitects should consider power consumption, together with accuracy, when designing a branch predictor,especially in embedded processors. This paper proposes a power-aware branch predictor, which is based on the gshare predictor, by accessing the BTB (Branch Target Buffer) selectively. To enable the selective access to the BTB, the PHT (Pattern History Table) in the proposed branch predictor is accessed one cycle earlier than the traditional PHT if the program is executed sequentially without branch instructions. As a side effect, two predictions from the PHT are obtained through one access to the PHT, resulting in more power savings. In the proposed branch predictor, if the previous instruction was not a branch and the prediction from the PHT is untaken, the BTB is not accessed to reduce power consumption. If the previous instruction was a branch, the BTB is always accessed, regardless of the prediction from the PHT, to prevent the additional delay/accuracy decrease. The proposed branch predictorreduces the power consumption with little hardware overhead, not incurring additional delay and never harming prediction accuracy. The simulation results show that the proposed branch predictor reduces the power consumption by 29-47%.

  2. Automated test assembly using lp_solve version 5.5 in R

    NARCIS (Netherlands)

    Diao, Qi; Linden, van der 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.

  3. A UV-decomposed method for solving an MPEC problem

    Institute of Scientific and Technical Information of China (English)

    SHAN Feng; PANG Li-ping; ZHU Li-mei; XIA Zun-quan

    2008-01-01

    A UV-decomposition method for solving a mathematical program with equilibrium constraints(MPEC)problem with linear complementarity constraints is presented.The problem is first converted into a nonlinear programming one.The structure of subdifierential a corresponding penalty function and refults of its UV-decomposition are given.A conceptual algorithm for solving this problem with a superlinear convergence rate is then constructed in terms of the obtained results.

  4. Secondary School Teachers’ Perceptions about Their Problem Solving Abilities

    Directory of Open Access Journals (Sweden)

    Hasan DEMİRTAŞ

    2008-01-01

    Full Text Available The purpose of the study is to determine the perceptions of high school teachers abouttheir level of problem solving skills and to find out whether their perceptions differaccording to gender, seniority, branch, marital status, how many children they have, thelast school of graduation, their mothers’ and fathers’ the level of education. Theresearch was conducted on 445 high school teachers working in Malatya city centerduring 2005-2006 academic year. The data were collected using Problem SolvingInventory, Form-A (PSI-A. In order to analyze the data, t-test, One-Way Anova, LSD,Kruskal Wallis H-test, and Mann Whitney U-test were used. Research results revealedthat high school teachers perceived their problem solving skill levels as “medium”.Results also showed that there were statistically significant differences among teachers’perceptions according to their seniority, the last school of graduation, and theeducation level of teachers’ mothers and fathers.

  5. Stochastic Transition between Turbulent Branch and Thermodynamic Branch of an Inhomogeneous Plasma

    OpenAIRE

    Kawasaki, Mitsuhiro; Itoh, Sanae-I.; Yagi, Masatoshi; Itoh, Kimitaka

    2002-01-01

    Transition phenomena between thermodynamic branch and turbulent branch in submarginal turbulent plasma are analyzed with statistical theory. Time-development of turbulent fluctuation is obtained by numerical simulations of Langevin equation which contains submarginal characteristics. Probability density functions and transition rates between two states are analyzed. Transition from turbulent branch to thermodynamic branch occurs in almost entire region between subcritical bifurcation point an...

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

  7. Problem Solving vis Soap Bubbles

    Science.gov (United States)

    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)

  8. Combinatorial reasoning to solve problems

    NARCIS (Netherlands)

    Coenen, Tom; Hof, Frits; Verhoef, Nellie

    2016-01-01

    This study reports combinatorial reasoning to solve problems. We observed the mathematical thinking of students aged 14-16. We study the variation of the students’ solution strategies in the context of emergent modelling. The results show that the students are tempted to begin the problem solving pr

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

  10. Learning Impasses in Problem Solving

    Science.gov (United States)

    Hodgson, J. P. E.

    1992-01-01

    Problem Solving systems customarily use backtracking to deal with obstacles that they encounter in the course of trying to solve a problem. This paper outlines an approach in which the possible obstacles are investigated prior to the search for a solution. This provides a solution strategy that avoids backtracking.

  11. Difficulties in Genetics Problem Solving.

    Science.gov (United States)

    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)

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

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

  14. On estimating workload in branch-and-bound global optimization algorithms

    NARCIS (Netherlands)

    Berenguel, J.L.; Casado, L.G.; Garcia, I.; Hendrix, E.M.T.

    2013-01-01

    In general, solving Global Optimization (GO) problems by Branch-and-Bound (B&B) requires a huge computational capacity. Parallel execution is used to speed up the computing time. As in this type of algorithms, the foreseen computational workload (number of nodes in the B&B tree) changes dyna

  15. Determination of thermodynamic gas parameters in branched pipes in internal combustion engines

    Science.gov (United States)

    Mitianiec, W.

    2014-08-01

    The paper presents theoretical and experimental results of calculation of basic gas parameters in the branched pipes. These parameters are required in one-dimensional computer models for prediction of non-steady gas flow in complicated multi-cylinder engine ducts. The gas flow near the junction is described with assumption of compressed and unsteady flow. Mathematical equations describing the gas flow are given in the paper on basis of mass, energy balance in the junction, pressure drop between pipes and conservation of energy in the section of supplied pipe. Equation systems enable to solve values of pressure, gas velocity, sound speed, density and concentration of gas components in every pipe connected to the joint. The different cases of the flow area are considered. The obtained parameters at the junction outflow are needed as initial values for calculation of unsteady gas flow in the outflow pipes. Verification of the method was conducted experimentally and pressure loss coefficients are given in the paper. Additionally by using Fluent program with high mesh density of the T-pipe junction the thermodynamic parameters (pressure, velocity, temperature) are compared with those obtained from 0D model. The model enables calculation the thermodynamic parameters of inflow and outflow systems in multi-cylinder IC engines in computer program.

  16. Determination of thermodynamic gas parameters in branched pipes in internal combustion engines

    International Nuclear Information System (INIS)

    The paper presents theoretical and experimental results of calculation of basic gas parameters in the branched pipes. These parameters are required in one-dimensional computer models for prediction of non-steady gas flow in complicated multi-cylinder engine ducts. The gas flow near the junction is described with assumption of compressed and unsteady flow. Mathematical equations describing the gas flow are given in the paper on basis of mass, energy balance in the junction, pressure drop between pipes and conservation of energy in the section of supplied pipe. Equation systems enable to solve values of pressure, gas velocity, sound speed, density and concentration of gas components in every pipe connected to the joint. The different cases of the flow area are considered. The obtained parameters at the junction outflow are needed as initial values for calculation of unsteady gas flow in the outflow pipes. Verification of the method was conducted experimentally and pressure loss coefficients are given in the paper. Additionally by using Fluent program with high mesh density of the T-pipe junction the thermodynamic parameters (pressure, velocity, temperature) are compared with those obtained from 0D model. The model enables calculation the thermodynamic parameters of inflow and outflow systems in multi-cylinder IC engines in computer program.

  17. Improving Teaching Quality and Problem Solving Ability through Contextual Teaching and Learning in Differential Equations: A Lesson Study Approach

    Science.gov (United States)

    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…

  18. Pulsating Star Mystery Solved

    Science.gov (United States)

    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

  19. Branching diffusions in random environment

    CERN Document Server

    Böinghoff, Christian

    2011-01-01

    We consider the diffusion approximation of branching processes in random environment (BPREs). This diffusion approximation is similar to and mathematically more tractable than BPREs. We obtain the exact asymptotic behavior of the survival probability. As in the case of BPREs, there is a phase transition in the subcritical regime due to different survival opportunities. In addition, we characterize the process conditioned to never go extinct and establish a backbone construction. In the strongly subcritical regime, mean offspring numbers are increased but still subcritical in the process conditioned to never go extinct. Here survival is solely due to an immortal individual, whose offspring are the ancestors of additional families. In the weakly subcritical regime, the mean offspring number is supercritical in the process conditioned to never go extinct. Thus this process survives with positive probability even if there was no immortal individual.

  20. Recursive Branching Simulated Annealing Algorithm

    Science.gov (United States)

    Bolcar, Matthew; Smith, J. Scott; Aronstein, David

    2012-01-01

    This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal

  1. Branching process models of cancer

    CERN Document Server

    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.

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

  3. Computational Protein Design Using AND/OR Branch-and-Bound Search.

    Science.gov (United States)

    Zhou, Yichao; Wu, Yuexin; Zeng, Jianyang

    2016-06-01

    The computation of the global minimum energy conformation (GMEC) is an important and challenging topic in structure-based computational protein design. In this article, we propose a new protein design algorithm based on the AND/OR branch-and-bound (AOBB) search, a variant of the traditional branch-and-bound search algorithm, to solve this combinatorial optimization problem. By integrating with a powerful heuristic function, AOBB is able to fully exploit the graph structure of the underlying residue interaction network of a backbone template to significantly accelerate the design process. Tests on real protein data show that our new protein design algorithm is able to solve many problems that were previously unsolvable by the traditional exact search algorithms, and for the problems that can be solved with traditional provable algorithms, our new method can provide a large speedup by several orders of magnitude while still guaranteeing to find the global minimum energy conformation (GMEC) solution. PMID:27167301

  4. Floral bud damage compensation by branching and biomass allocation in genotypes of Brassica napus with different architecture and branching potential.

    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.

  5. 3D modelling of branching in plants

    OpenAIRE

    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. Branching is regulated by multiple internal factors which are modulated by different environmental signals. A key environmental signal in the context of a plant population is a low red / far-red intensi...

  6. How to solve mathematical problems

    CERN Document Server

    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.

  7. Supercritical branching diffusions in random environment

    CERN Document Server

    Hutzenthaler, Martin

    2011-01-01

    Supercritical branching processes in constant environment conditioned on eventual extinction are known to be subcritical branching processes. The case of random environment is more subtle. A supercritical branching diffusion in random environment (BDRE) conditioned on eventual extinction of the population is not a BDRE. However the quenched law of the population size of a supercritical BDRE conditioned on eventual extinction is equal to the quenched law of the population size of a subcritical BDRE. As a consequence, supercritical BDREs have a phase transition which is similar to a well-known phase transition of subcritical branching processes in random environment.

  8. Current perspectives on shoot branching regulation

    Directory of Open Access Journals (Sweden)

    Cunquan YUAN,Lin XI,Yaping KOU,Yu ZHAO,Liangjun ZHAO

    2015-03-01

    Full Text Available Shoot branching is regulated by the complex interactions among hormones, development, and environmental factors. Recent studies into the regulatory mecha-nisms of shoot branching have focused on strigolactones, which is a new area of investigation in shoot branching regulation. Elucidation of the function of the D53 gene has allowed exploration of detailed mechanisms of action of strigolactones in regulating shoot branching. In addition, the recent discovery that sucrose is key for axillary bud release has challenged the established auxin theory, in which auxin is the principal agent in the control of apical dominance. These developments increase our understan-ding of branching control and indicate that regulation of shoot branching involves a complex network. Here, we first summarize advances in the systematic regulatory network of plant shoot branching based on current information. Then we describe recent developments in the synthesis and signal transduction of strigolactones. Based on these considerations, we further summarize the plant shoot branching regulatory network, including long distance systemic signals and local gene activity mediated by strigolactones following perception of external envi-ronmental signals, such as shading, in order to provide a comprehensive overview of plant shoot branching.

  9. Clinical and Translational Epidemiology Branch (CTEB)

    Science.gov (United States)

    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.

  10. Networks of companies and branches in Poland

    CERN Document Server

    Chmiel, A M; Sienkiewicz, J; Suchecki, K; Chmiel, Anna M.; Holyst, Janusz A.; Sienkiewicz, Julian; Suchecki, Krzysztof

    2006-01-01

    In this study we consider relations between companies in Poland taking into account common branches they belong to. It is clear that companies belonging to the same branch compete for similar customers, so the market induces correlations between them. On the other hand two branches can be related by companies acting in both of them. To remove weak, accidental links we shall use a concept of threshold filtering for weighted networks where a link weight corresponds to a number of existing connections (common companies or branches) between a pair of nodes.

  11. Tangram solved? Prefrontal cortex activation analysis during geometric problem solving.

    Science.gov (United States)

    Ayaz, Hasan; Shewokis, Patricia A; Izzetoğlu, Meltem; Çakır, Murat P; Onaral, Banu

    2012-01-01

    Recent neuroimaging studies have implicated prefrontal and parietal cortices for mathematical problem solving. Mental arithmetic tasks have been used extensively to study neural correlates of mathematical reasoning. In the present study we used geometric problem sets (tangram tasks) that require executive planning and visuospatial reasoning without any linguistic representation interference. We used portable optical brain imaging (functional near infrared spectroscopy--fNIR) to monitor hemodynamic changes within anterior prefrontal cortex during tangram tasks. Twelve healthy subjects were asked to solve a series of computerized tangram puzzles and control tasks that required same geometric shape manipulation without problem solving. Total hemoglobin (HbT) concentration changes indicated a significant increase during tangram problem solving in the right hemisphere. Moreover, HbT changes during failed trials (when no solution found) were significantly higher compared to successful trials. These preliminary results suggest that fNIR can be used to assess cortical activation changes induced by geometric problem solving. Since fNIR is safe, wearable and can be used in ecologically valid environments such as classrooms, this neuroimaging tool may help to improve and optimize learning in educational settings. PMID:23366983

  12. Schoenfeld's problem solving theory in a student controlled learning environment

    NARCIS (Netherlands)

    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

  13. ANALYZING SKILLS OF PROBLEM SOLVING OF PHYSICAL EDUCATION TEACHER CANDIDATES FROM DIFFERENT ANGLES CONSIDERING VARIABLES

    Directory of Open Access Journals (Sweden)

    Ebru Olcay KARABULUT

    2009-12-01

    Full Text Available The aim of this survey is; students’ studying in Physical Education and Sport Department of AEÜ and GÜ through problem solving test and to specify whether students differentiate according to independent variables obtained from personal variables and to reveal relation between students’ ability of problem solving. Totally, 304 students, whom were selected randomly among the students studying in Physical Education and Sport Department of AEÜ and GÜ voluntarily participated in this survey. In this survey, Personal Data Form and Problem Solving Inventory (PÇE were used as a means of data collection. The research indicated that the skills of problem solving and approaches of problem solving generally the university students is medium level. The average point of the sub-dimensions and its total of the skill of problem solving didn’t change in a meaningful level accordingly class and national but it changed in a meaningful level depending on the university, sex, branches of sports.

  14. Branch mode selection during early lung development.

    Directory of Open Access Journals (Sweden)

    Denis Menshykau

    Full Text Available Many organs of higher organisms, such as the vascular system, lung, kidney, pancreas, liver and glands, are heavily branched structures. The branching process during lung development has been studied in great detail and is remarkably stereotyped. The branched tree is generated by the sequential, non-random use of three geometrically simple modes of branching (domain branching, planar and orthogonal bifurcation. While many regulatory components and local interactions have been defined an integrated understanding of the regulatory network that controls the branching process is lacking. We have developed a deterministic, spatio-temporal differential-equation based model of the core signaling network that governs lung branching morphogenesis. The model focuses on the two key signaling factors that have been identified in experiments, fibroblast growth factor (FGF10 and sonic hedgehog (SHH as well as the SHH receptor patched (Ptc. We show that the reported biochemical interactions give rise to a Schnakenberg-type Turing patterning mechanisms that allows us to reproduce experimental observations in wildtype and mutant mice. The kinetic parameters as well as the domain shape are based on experimental data where available. The developed model is robust to small absolute and large relative changes in the parameter values. At the same time there is a strong regulatory potential in that the switching between branching modes can be achieved by targeted changes in the parameter values. We note that the sequence of different branching events may also be the result of different growth speeds: fast growth triggers lateral branching while slow growth favours bifurcations in our model. We conclude that the FGF10-SHH-Ptc1 module is sufficient to generate pattern that correspond to the observed branching modes.

  15. Branch mode selection during early lung development.

    Science.gov (United States)

    Menshykau, Denis; Kraemer, Conradin; Iber, Dagmar

    2012-01-01

    Many organs of higher organisms, such as the vascular system, lung, kidney, pancreas, liver and glands, are heavily branched structures. The branching process during lung development has been studied in great detail and is remarkably stereotyped. The branched tree is generated by the sequential, non-random use of three geometrically simple modes of branching (domain branching, planar and orthogonal bifurcation). While many regulatory components and local interactions have been defined an integrated understanding of the regulatory network that controls the branching process is lacking. We have developed a deterministic, spatio-temporal differential-equation based model of the core signaling network that governs lung branching morphogenesis. The model focuses on the two key signaling factors that have been identified in experiments, fibroblast growth factor (FGF10) and sonic hedgehog (SHH) as well as the SHH receptor patched (Ptc). We show that the reported biochemical interactions give rise to a Schnakenberg-type Turing patterning mechanisms that allows us to reproduce experimental observations in wildtype and mutant mice. The kinetic parameters as well as the domain shape are based on experimental data where available. The developed model is robust to small absolute and large relative changes in the parameter values. At the same time there is a strong regulatory potential in that the switching between branching modes can be achieved by targeted changes in the parameter values. We note that the sequence of different branching events may also be the result of different growth speeds: fast growth triggers lateral branching while slow growth favours bifurcations in our model. We conclude that the FGF10-SHH-Ptc1 module is sufficient to generate pattern that correspond to the observed branching modes. PMID:22359491

  16. The histone-fold complex MHF is remodeled by FANCM to recognize branched DNA and protect genome stability

    OpenAIRE

    Fox, David; Yan, Zhijiang; Ling, Chen; Zhao, Ye; Lee, Duck-Yeon; Fukagawa, Tatsuo; Yang, Wei; Wang, Weidong

    2014-01-01

    Histone-fold proteins typically assemble in multiprotein complexes to bind duplex DNA. However, one histone-fold complex, MHF, associates with Fanconi anemia (FA) protein FANCM to form a branched DNA remodeling complex that senses and repairs stalled replication forks and activates FA DNA damage response network. How the FANCM-MHF complex recognizes branched DNA is unclear. Here, we solved the crystal structure of MHF and its complex with the MHF-interaction domain (referred to as MID) of FAN...

  17. Experimental investigation of shock wave propagation in a 90 $(°) $ ∘ branched duct

    Science.gov (United States)

    Biamino, L.; Jourdan, G.; Igra, O.; Mariani, C.; Tosello, R.; Leriche, D.; Houas, L.

    2014-05-01

    An experimental investigation was conducted examining the option of using branched duct geometry for shock wave attenuation. Experiments were done in an 80 mm 80 mm square section shock tube to which a 20-mm diameter pipe was added vertically. Pressures were recorded along the shock tube wall (static pressure) and at the branched pipe end wall (stagnation pressure). Experiments were repeated with a constant incident shock wave Mach number () and with different pipe lengths. It was found that the length of the branched pipe has a significant effect on the flow inside the branched pipe and that in the present experimental configuration, the stagnation pressure recorded at the branched pipe end wall surpasses the pressure in the main channel behind the original incident shock wave. Finally, simulations were carried out using a commercial program, Star-CCM+, to complete the description of the flow studied here. The computed pressure profiles and shock wave locations agree quite well with the present experimental data.

  18. XML Solving Problem of Expert System

    OpenAIRE

    Yasser A. Nada

    2011-01-01

    The Extensible Markup Language (XML) is a subset of SGML that is completely described in this paper. Its goal is to enable generic SGML to be served, received, and processed on the Web in the way that is now possible with HTML. XML has been designed for ease of implementation and for interoperability with both SGML and HTML. An expert system is a computer program designed to simulate the problem-solving behavior of a human who is an expert in a narrow domain or discipline. Expert Systems (E...

  19. ECONOMIC ISSUES OF BRANCH PRODUCTION

    Directory of Open Access Journals (Sweden)

    Shamrov K. N.

    2015-05-01

    Full Text Available The article deals with topical questions of economy industry production of rice grain. The need for improving the business efficiency of rice today is dictated by political and economic sanctions, the needs of our society in full substitution of this important product. State stimulation of rice development today is carried out through a complex of economic and administrative activities. The economic measures of the state include: price control on rice price and processing products, support of agricultural producers’ incomes, leasing involving the state, marketing of products, and infrastructure development of the grain market. The system of public administrative measures also includes standardization and certification of grain products, control quality of grain and products of its processing, the quarantine protection, licensing activities organizations, and mandatory statistical account of the rice market. These measures are intended to ensure equal conditions of competition between local and imported rice, to spur investment and expansion of domestic production, increase profitability of rice, allowing the rice enterprises to carry out expensive irrigation systems repairs and capital inputs in lot lend. The article suggests that rice branch industry remains competitive and with abolition of import customs barriers within frameworks WTO. It is necessary to invest more heavily in infrastructure with the aim of improving business efficiency of rice

  20. The tactical use of constraints and structure in diagnostic problem solving

    NARCIS (Netherlands)

    J. de Mast

    2011-01-01

    This paper presents a prescriptive account of diagnostic problem solving, or diagnosis, in quality and process control. This paper identifies a general strategy, named branch-and-prune, whose manifestations can be found in disciplines such as medical diagnosis, troubleshooting of devices, and model-

  1. Randomized controlled trial of a family problem-solving intervention.

    Science.gov (United States)

    Drummond, Jane; Fleming, Darcy; McDonald, Linda; Kysela, Gerard M

    2005-02-01

    Adaptive problem solving contributes to individual and family health and development. In this article, the effect of the cooperative family learning approach (CFLA) on group family problem solving and on cooperative parenting communication is described. A pretest or posttest experimental design was used. Participant families were recruited from Head Start programs and exhibited two or more risk factors. Participant preschool children were screened to have two or more developmental delays. Direct behavioral observation measures were used to determine group family problem solving and cooperative parenting communication outcomes. Few group family problem-solving behaviors were coded, and they displayed little variability. However, intervention parents increased the length of time they played and extended the cooperative parent-child interactions. The evidence shows that CFLA has the potential to enhance parental-modeling of cooperative behavior while engaged in play activities with preschoolers. Direct measurement of group family problem solving was difficult. Solutions are suggested. PMID:15604228

  2. 12 CFR 741.11 - Foreign branching.

    Science.gov (United States)

    2010-01-01

    ...) Contents of Business Plan. The written business plan must address the following: (1) Analysis of market... regarding the branch (shares, lending, capital, charge-offs, collections); (6) The field of membership or... for branch operations (balance sheet and income and expense projections) for the first and second...

  3. Branching out Has So Much to Offer

    Science.gov (United States)

    Murray, Joe

    2012-01-01

    In 1989 there were thirty ATM branches nationally. In January 2012 there were just twelve ATM branches with another three "proposed". How can that happen? How did it happen? Maybe the most pertinent question is: Why did it happen? There is no single answer to the last question, but perhaps it was something to do with the changes that were sweeping…

  4. Optimal Planning and Problem-Solving

    Science.gov (United States)

    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.

  5. Geogebra for Solving Problems of Physics

    Science.gov (United States)

    Kllogjeri, Pellumb; Kllogjeri, Adrian

    Today is highly speed progressing the computer-based education, which allowes educators and students to use educational programming language and e-tutors to teach and learn, to interact with one another and share together the results of their work. In this paper we will be concentrated on the use of GeoGebra programme for solving problems of physics. We have brought an example from physics of how can be used GeoGebra for finding the center of mass(centroid) of a picture(or system of polygons). After the problem is solved graphically, there is an application of finding the center of a real object(a plate)by firstly, scanning the object and secondly, by inserting its scanned picture into the drawing pad of GeoGebra window and lastly, by finding its centroid. GeoGebra serve as effective tool in problem-solving. There are many other applications of GeoGebra in the problems of physics, and many more in different fields of mathematics.

  6. 基于问题求解思维能力培养的程序设计教学实践--以累加求和问题为例%The Programming Teaching Practice Based on Thinking Ability of Solving Problem:Take Cumulative Summation Problem for Example

    Institute of Scientific and Technical Information of China (English)

    童键; 刘卫国

    2014-01-01

    问题求解思维是程序设计的重要特点,也是计算思维的重要形式。以累加求和问题为例,呈现了课堂教学的组织方式,详细分析了算法形成过程,有助于学生掌握问题求解的思维规律和方法,培养计算思维能力。%Problem solving thinking is an important feature of programming ,and is also an important form of computation-al thinking .Take common cumulative summation problem for example ,presents the organization of classroom teaching , detailed analyzes the formation process of the algorithm ,to help students understand the law s and methods of thinking to solve problems ,and train computational thinking ability .

  7. Problem Solving and Complex Systems

    CERN Document Server

    Guinand, Frédéric

    2008-01-01

    The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models reusable to solve other problems. For instance, Genetic Algorithms or Ant Colony Optimizations are inspired from natural CSs to solve optimization problems. This paper proposes the use of ant-based systems to solve various problems with a non assessing approach. This means that solutions to some problem are not evaluated. They appear as resultant structures from the activity of the system. Problems are modeled with graphs and such structures are observed directly on these graphs. Problems of Multiple Sequences Alignment and Natural Language Processing are addressed with this approach.

  8. Optimal calculational schemes for solving multigroup photon transport problem

    International Nuclear Information System (INIS)

    A scheme of complex algorithm for solving multigroup equation of radiation transport is suggested. The algorithm is based on using the method of successive collisions, the method of forward scattering and the spherical harmonics method, and is realized in the FORAP program (FORTRAN, BESM-6 computer). As an example the results of calculating reactor photon transport in water are presented. The considered algorithm being modified may be used for solving neutron transport problems

  9. Aging and skilled problem solving.

    Science.gov (United States)

    Charness, N

    1981-03-01

    Information-processing models of problem solving too often are based on restrictive age ranges. On the other hand, gerontologists have investigated few problem-solving tasks and have rarely generated explicit models. As this article demonstrates, both fields can benefit by closer collaboration. One major issue in gerontology is whether aging is associated with irreversible decrement or developmental plasticity. If both processes occur, then an appropriate strategy for investigating aging is to equate age groups for molar problem-solving performance and search for differences in the underlying components. This strategy was adopted to examine the relation of age and skill to problem solving in chess. Chess players were selected to vary widely in age and skill such that these variables were uncorrelated. Problem-solving and memory tasks were administered. Skill level was the only significant predictor for accuracy in both a choose-a-move task and a speeded end-game evaluation task. Age (negatively) and skill (positively) jointly determined performance in an unexpected recall task. Efficient chunking in recall was positively related to skill, though negatively related to age. Recognition confidence, though not accuracy, was negatively related to age. Thus despite age-related declines in encoding and retrieval of information, older players match the problem-solving performance of equivalently skilled younger players. Apparently, they can search the problem space more efficiently, as evidenced by taking less time to select an equally good move. Models of chess skill that stress that role of encoding efficiency, as indexed by chunking in recall, need to be modified to account for performance over the life span.

  10. Simon on Problem-Solving

    DEFF Research Database (Denmark)

    Foss, Kirsten; Foss, Nicolai

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

  11. [Croatian Medical Association--Branch Zagreb].

    Science.gov (United States)

    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

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

  13. Vibration analysis of pipelines with arbitrary branches by absorbing transfer matrix method

    Science.gov (United States)

    Liu, Gongmin; Li, Shuaijun; Li, Yanhua; Chen, Hao

    2013-11-01

    Branched pipes of arbitrary shapes are prevalent in pipe systems. Considering fluid-structure interaction (FSI), an absorbing transfer matrix method in frequency domain for fluid-filled pipelines with any branched pipes is proposed in this paper. A dominant chain of pipeline would be selected, and the point transfer matrix of each junction on the dominant chain would be determined. Here, the point transfer matrix, representing the influence of branched pipes at the junction on the dominant pipeline, was "absorbed" by the dominant chain. Based on these, with transfer matrixes of other elements, the fluid and structure dynamics problem could be solved following the chain transfer matrix method process. Several numerical examples with different constraints are presented to illustrate the application of the proposed method. Moreover, the experiment of cross-shaped pipes with various boundary conditions was carried out. And results from the present approach were validated by measured and numerical data. Then, the forced vibrations of branched pipes were analyzed by considering the effects of various parameters, which shows the fluid pressure and vibrations can be optimized by changing the branch angles and positions. Through these examples, it is shown that the proposed method is efficient and can be used to calculate branched pipes of any shape.

  14. Human Problem Solving in 2008

    OpenAIRE

    Pizlo, Zygmunt

    2009-01-01

    This paper presents a bibliography of more than 200 references related to human problem solving, arranged by subject matter. The references were taken from PsycInfo database. Journal papers, book chapters, books and dissertations are included. The topics include human development, education, neuroscience, research in applied settings, as well as animal studies.

  15. Human Problem Solving in 2010

    OpenAIRE

    Pizlo, Zygmunt

    2012-01-01

    This paper presents a bibliography of 100 references related to human problem solving, arranged by subject matter. The references were taken from PsycInfo database. Journal papers, book chapters, and dissertations are included. The topics include human development, education, neuroscience, and research in applied settings, as well as animal studies.

  16. Common Core: Solve Math Problems

    Science.gov (United States)

    Strom, Erich

    2012-01-01

    The new common core standards for mathematics demand that students (and teachers!) exhibit deeper conceptual understanding. That's music to the ears of education professor John Tapper, who says teachers have overemphasized teaching procedures--and getting right answers. In his new book, "Solving for Why," he makes a powerful case for moving beyond…

  17. Students' Problem Solving and Justification

    Science.gov (United States)

    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…

  18. Promote Problem-Solving Discourse

    Science.gov (United States)

    Bostic, Jonathan; Jacobbe, Tim

    2010-01-01

    Fourteen fifth-grade students gather at the front of the classroom as their summer school instructor introduces Jonathan Bostic as the mathematics teacher for the week. Before examining any math problems, Bostic sits at eye level with the students and informs them that they will solve problems over the next four days by working individually as…

  19. On transfer during problem solving

    NARCIS (Netherlands)

    R. Hamel; E. Jakab

    2013-01-01

    A puzzle is equally new for everyone who is presented with it for the first time. However, it is not if we take one’s previous knowledge into account. Some knowledge may be utilised while working on the puzzle. If this is the case, problem solving as well as the development of knowledge about the pu

  20. Human Problem Solving in 2006

    Science.gov (United States)

    Pizlo, Zygmunt

    2007-01-01

    This paper presents a bibliography of a little more than 100 references related to human problem solving, arranged by subject matter. The references were taken from PsycInfo and Compendex databases. Only journal papers, books and dissertations are included. The topics include human development, education, neuroscience, research in applied…

  1. Genetics problem solving and worldview

    Science.gov (United States)

    Dale, Esther

    The research goal was to determine whether worldview relates to traditional and real-world genetics problem solving. Traditionally, scientific literacy emphasized content knowledge alone because it was sufficient to solve traditional problems. The contemporary definition of scientific literacy is, "The knowledge and understanding of scientific concepts and processes required for personal decision-making, participation in civic and cultural affairs and economic productivity" (NRC, 1996). An expanded definition of scientific literacy is needed to solve socioscientific issues (SSI), complex social issues with conceptual, procedural, or technological associations with science. Teaching content knowledge alone assumes that students will find the scientific explanation of a phenomenon to be superior to a non-science explanation. Formal science and everyday ways of thinking about science are two different cultures (Palmer, 1999). Students address this rift with cognitive apartheid, the boxing away of science knowledge from other types of knowledge (Jedege & Aikenhead, 1999). By addressing worldview, cognitive apartheid may decrease and scientific literacy may increase. Introductory biology students at the University of Minnesota during fall semester 2005 completed a written questionnaire-including a genetics content-knowledge test, four genetic dilemmas, the Worldview Assessment Instrument (WAI) and some items about demographics and religiosity. Six students responded to the interview protocol. Based on statistical analysis and interview data, this study concluded the following: (1) Worldview, in the form of metaphysics, relates to solving traditional genetic dilemmas. (2) Worldview, in the form of agency, relates to solving traditional genetics problems. (3) Thus, worldview must be addressed in curriculum, instruction, and assessment.

  2. Branch architecture, light interception and crown development in saplings of a plagiotropically branching tropical tree, Polyalthia jenkinsii (Annonaceae).

    Science.gov (United States)

    Osada, Noriyuki; Takeda, Hiroshi

    2003-01-01

    To investigate crown development patterns, branch architecture, branch-level light interception, and leaf and branch dynamics were studied in saplings of a plagiotropically branching tree species, Polyalthia jenkinsii Hk. f. & Thoms. (Annonaceae) in a Malaysian rain forest. Lengths of branches and parts of the branches lacking leaves ('bare' branches) were smaller in upper branches than in lower branches within crowns, whereas lengths of 'leafy' parts and the number of leaves per branch were larger in intermediate than in upper and lower branches. Maximum diffuse light absorption (DLA) of individual leaves was not related to sapling height or branch position within crowns, whereas minimum DLA was lower in tall saplings. Accordingly, branch-level light interception was higher in intermediate than in upper and lower branches. The leaf production rate was higher and leaf loss rate was smaller in upper than in intermediate and lower branches. Moreover, the branch production rate of new first-order branches was larger in the upper crowns. Thus, leaf and branch dynamics do not correspond to branch-level light interception in the different canopy zones. As a result of architectural constraints, branches at different vertical positions experience predictable light microenvironments in plagiotropic species. Accordingly, this pattern of carbon allocation among branches might be particularly important for growth and crown development in plagiotropic species. PMID:12495920

  3. Measurement of Prominent eta Decay Branching Fractions

    CERN Document Server

    López, A; Méndez, H; Ramírez, J; Ge, J Y; Miller, D H; Sanghi, B; Shipsey, I P J; Xin, B; Adams, G S; Anderson, M; Cummings, J P; Danko, I; Hu, D; Moziak, B; Napolitano, J; He, Q; Insler, J; Muramatsu, H; Park, C S; Thorndike, E H; Yang, F; Artuso, M; Blusk, S; Khalil, S; Li, J; Menaa, N; Mountain, R; Nisar, S; Randrianarivony, K; Sia, R; Skwarnicki, T; Stone, S; Wang, J C; Bonvicini, G; Cinabro, D; Dubrovin, M; Lincoln, A; Asner, D M; Edwards, K W; Naik, P; Briere, R A; Ferguson, T; Tatishvili, G; Vogel, H; Watkins, M E; Rosner, J L; Adam, N E; Alexander, J P; Cassel, D G; Duboscq, J E; Ehrlich, R; Fields, L; Galik, R S; Gibbons, L; Gray, R; Gray, S W; Hartill, D L; Heltsley, B K; Hertz, D; Jones, C D; Kandaswamy, J; Kreinick, D L; Kuznetsov, V E; Mahlke-Krüger, H; Mohapatra, D; Onyisi, P U E; Patterson, J R; Peterson, D; Riley, D; Ryd, A; Sadoff, A J; Shi, X; Stroiney, S; Sun, W M; Wilksen, T; Athar, S B; Patel, R; Yelton, J; Rubin, P; Eisenstein, B I; Karliner, I; Lowrey, N; Selen, M; White, E J; Wiss, J; Mitchell, R E; Shepherd, M R; Besson, D; Pedlar, T K; Cronin-Hennessy, D; Gao, K Y; Hietala, J; Kubota, Y; Klein, T; Lang, B W; Poling, R; Scott, A W; Zweber, P; Dobbs, S; Metreveli, Z; Seth, K K; Tomaradze, A G; Ernst, J; Ecklund, K M; Severini, H; Love, W; Savinov, V

    2007-01-01

    The decay psi(2S) --> eta J/psi is used to measure, for the first time, all prominent eta-meson branching fractions with the same experiment in the same dataset, thereby providing a consistent treatment of systematics across branching fractions. We present results for eta decays to gamma gamma, pi+pi-pi0, 3 pi0, pi+ pi- gamma, and e+ e- gamma, accounting for 99.9% of all eta decays. The precisions for several of the branching fractions and their ratios are improved. Two channels, pi+ pi- gamma and e+ e- gamma, show results that differ at the level of three standard deviations from those previously determined.

  4. Agents in branching space-times

    Institute of Scientific and Technical Information of China (English)

    Nuel; Belnap

    2003-01-01

    The aim of this essay Is to make some brief suggestions on the beginnings of a theory of agentsand agency In branching spacetlmes.foe thought Is to combine the ideas of agency as developed agalnst the relatively simple background of branching time with the richer notions of Indetermlnlsm asstructured In the theory of branching space-times.My plan Is to say a little about agency In branchingtime and a little about branchlg spacetlmes,and then ask how the two can be brought together.Atthe end there Is an ...

  5. 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 infl 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 specifi es classroom practices that are fundamentally foreign to culturally embedded pedagogical traditions, and hence

  6. Literacy, Numeracy, and Problem Solving in Technology-Rich Environments among U.S. Adults: Results from the Program for the International Assessment of Adult Competencies 2012. First Look. NCES 2014-008

    Science.gov (United States)

    Goodman, Madeline; Finnegan, Robert; Mohadjer, Leyla; Krenzke, Tom; Hogan, Jacquie

    2013-01-01

    The Program for the International Assessment of Adult Competencies (PIAAC) is a cyclical, large scale study of adult skills and life experience focusing on education and employment that was developed and organized by the Organization for Economic Cooperation and Development (OECD). In the United States, the study was conducted in 2011-12 with a…

  7. Design of Hierarchical Ring Networks Using Branch-and-Price

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2004-01-01

    We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed...... link establishment costs and the link capacity costs into account. The hierarchical two layer ring network design problem is solved in two stages: First the bottom layer, i.e. the metro-rings are designed, implicitly taking into account the capacity cost of the federal-ring. Then the federal......-ring is designed connecting the metro-rings, minimizing fixed link establishment costs of the federal-ring. A branch-and-price algorithm is presented for the design of the bottom layer and it is suggested that existing methods are used for the design of the federal-ring. Computational results are given...

  8. Hierarchical Ring Network Design Using Branch-and-Price

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2005-01-01

    We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed...... 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....

  9. Damping by branching: a bioinspiration from trees

    CERN Document Server

    Theckes, Benoit; Boutillon, Xavier

    2011-01-01

    Man-made slender structures are known to be sensitive to high levels of vibration, due to their flexibility, which often cause irreversible damage. In nature, trees repeatedly endure large amplitudes of motion, mostly caused by strong climatic events, yet with minor or no damage in most cases. A new damping mechanism inspired by the architecture of trees is here identified and characterized in the simplest tree-like structure, a Y-shape branched structure. Through analytical and numerical analyses of a simple two-degree-of-freedom model, branching is shown to be the key ingredient in this protective mechanism that we call damping-by-branching. It originates in the geometrical nonlinearities so that it is specifically efficient to damp out large amplitudes of motion. A more realistic model, using flexible beam approximation, shows that the mechanism is robust. Finally, two bioinspired architectures are analyzed, showing significant levels of damping achieved via branching with typically 30% of the energy being...

  10. Code 672 observational science branch computer networks

    Science.gov (United States)

    Hancock, D. W.; Shirk, H. G.

    1988-01-01

    In general, networking increases productivity due to the speed of transmission, easy access to remote computers, ability to share files, and increased availability of peripherals. Two different networks within the Observational Science Branch are described in detail.

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

  12. Residence times of branching diffusion processes

    Science.gov (United States)

    Dumonteil, E.; Mazzolo, A.

    2016-07-01

    The residence time of a branching Brownian process is the amount of time that the mother particle and all its descendants spend inside a domain. Using the Feynman-Kac formalism, we derive the residence-time equation as well as the equations for its moments for a branching diffusion process with an arbitrary number of descendants. This general approach is illustrated with simple examples in free space and in confined geometries where explicit formulas for the moments are obtained within the long time limit. In particular, we study in detail the influence of the branching mechanism on those moments. The present approach can also be applied to investigate other additive functionals of branching Brownian process.

  13. 78 FR 65890 - National School Lunch Program and School Breakfast Program: Eliminating Applications Through...

    Science.gov (United States)

    2013-11-04

    ... William Wagoner, Policy and Program Development Branch, Child Nutrition Division, Food and Nutrition... programs: Supplemental Nutrition Assistance Program (SNAP); Temporary Assistance to Needy Families (TANF... for multiple purposes, including funding formulas for Federal and State education programs....

  14. Methods of solving nonstandard problems

    CERN Document Server

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

  15. Parton Branching in Color Mutation Model

    CERN Document Server

    Hwa, R C

    1999-01-01

    The soft production problem in hadronic collisions as described in the eikonal color mutation branching model is improved in the way that the initial parton distribution is treated. Furry branching of the partons is considered as a means of describing the nonperturbative process of parton reproduction in soft interaction. The values of all the moments, and $C_q$, for q=2,...,5, as well as their energy dependences can be correctly determined by the use of only two parameters.

  16. CAST Xi'an Branch Established

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    @@ China Academy of Space Technology (CAST) Xi'an Branch was established on April 8,2008.The new branch consists of the headquarters of the former Xi'an Institute of Space Radio Technology (XISRT) of CAST and five former subsidiaries of the XISRT,i.e.the Institute of Space Electronic Technology,the Institute of Microwave Technology,the Institute of Space Antenna Technology,the Manufacturing Center for Space Electronics and Civilian High-tech Company.

  17. Comparative efficiency analysis of Portuguese bank branches

    OpenAIRE

    Portela, Maria; Thanassoulis, Emmanuel

    2006-01-01

    The advent of Internet banking and phone banking is changing the role of bank branches from a predominantly transaction- based one to a sales-oriented role. This paper reports on an assessment of the branches of a Portuguese bank in terms of their performance in their new roles in three different areas: Their efficiency in fostering the use of new transaction channels, their efficiency in increasing sales and their customer base, and their efficiency in generating profits. Service qu...

  18. Comparative performance analysis of portuguese bank branches

    OpenAIRE

    Portela, Maria; Thanassoulis, Emmanuel

    2003-01-01

    The advent of Internet banking and phone banking is changing the role of bank branches from a predominantly transaction-based one to a sales-oriented role. This paper reports on an assessment of the branches of a Portuguese bank in terms of their performance in their new roles in three different areas: Their effectiveness in fostering the use of new transaction channels such as the internet and the telephone, their effectiveness in increasing sales and their customer base, and the...

  19. AGB [asymptotic giant branch]: Star evolution

    International Nuclear Information System (INIS)

    Asymptotic giant branch stars are red supergiant stars of low-to-intermediate mass. This class of stars is of particular interest because many of these stars can have nuclear processed material brought up repeatedly from the deep interior to the surface where it can be observed. A review of recent theoretical and observational work on stars undergoing the asymptotic giant branch phase is presented. 41 refs

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

  1. Human Problem Solving in 2006

    OpenAIRE

    Pizlo, Zygmunt

    2007-01-01

    This paper presents a bibliography of a little more than 100 references related to human problem solving, arranged by subject matter. The references were taken from PsycInfo and Compendex databases. Only journal papers, books and dissertations are included. The topics include human development, education, neuroscience, research in applied settings, as well as animal studies. A few references from artificial intelligence are also given.

  2. Solving Public Transit Scheduling Problems

    OpenAIRE

    Mesquita, Marta; Moz, Margarida; Paias, Ana; Paixão, José; Pato, Margarida Vaz; Respício, Ana

    2008-01-01

    Operational planning within public transit companies has been extensively tackled but still remains a challenging area for operations research models and techniques. This phase of the planning process comprises vehicle scheduling, crew scheduling and rostering problems. In this paper, a new integer mathematical formulation to describe the integrated vehicle-crew-rostering problem is presented. The method proposed to solve this multi-objective problem is a sequential algorithm considered withi...

  3. Cosmological Simulations of Normal-Branch Braneworld Gravity

    CERN Document Server

    Schmidt, Fabian

    2009-01-01

    We introduce a cosmological model based on the normal branch of DGP braneworld gravity with a smooth dark energy component on the brane. The expansion history in this model is identical to LambdaCDM, thus evading all geometric constraints on the DGP cross-over scale r_c. This model can serve as a first approximation to more general braneworld models whose cosmological solutions have not been obtained yet. We study the formation of large scale structure in this model in the linear and non-linear regime using N-body simulations for different values of r_c. The simulations use the code presented in (F.S., arXiv:0905.0858) and solve the full non-linear equation for the brane-bending mode in conjunction with the usual gravitational dynamics. The brane-bending mode is attractive rather than repulsive in the DGP normal branch, hence the sign of the modified gravity effects is reversed compared to those presented in arXiv:0905.0858. We compare the simulation results with those of ordinary LambdaCDM simulations run us...

  4. All change at the CERN UBS branch

    CERN Multimedia

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

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

  6. Markov Karar Süreci İle Modellenen Stokastik ve Çok Amaçlı Üretim/Envanter Problemlerinin Hedef Programlama Yaklaşımı İle Çözülmesi (Solving Stochastic and Multi-Objective Production/Inventory Problems Modeled By MARKOV Decision Process with Goal Programming Approach

    Directory of Open Access Journals (Sweden)

    Aslı ÖZDEMİR

    2009-07-01

    Full Text Available To make decisions involving uncertainty while making future plans, Markov Decision Process (MDP, one of the stochastic approaches, may provide assistance to managers. Methods such as value iteration, policy iteration or linear programming can be used in the solution of MDPs when only one objective such as profit maximization or cost minimization is considered. However the decisions made by business while operating in a competition environment require considering multiple and usually conflicting objectives simultaneously. Goal programming (GP, can be used to solve such problems. The aim of this study is to provide an integrated perspective involving the utilization of MDP and GP approaches together for the solution of stochastic multi-objective decision problems. To this end the production/inventory system of a business operating in the automotive supplier industry is considered.

  7. A Generalized Fluid System Simulation Program to Model Flow Distribution in Fluid Networks

    Science.gov (United States)

    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.

  8. Exact Methods for Solving the Train Departure Matching Problem

    DEFF Research Database (Denmark)

    Haahr, Jørgen Thorlund; Bull, Simon Henry

    In this paper we consider the train departure matching problem which is an important subproblem of the Rolling Stock Unit Management on Railway Sites problem introduced in the ROADEF/EURO Challenge 2014. The subproblem entails matching arriving train units to scheduled departing trains at a railway...... site while respecting multiple physical and operational constraints. In this paper we formally define that subproblem, prove its NP- hardness, and present two exact method approaches for solving the problem. First, we present a compact Mixed Integer Program formulation which we solve using a MIP solver....... Second, we present a formulation with an exponential number of variables which we solve using column generation. Our results show that both approaches have difficulties solving the ROADEF problem instances to optimality. The column generation approach is however able to generate good quality solutions...

  9. Journey toward Teaching Mathematics through Problem Solving

    Science.gov (United States)

    Sakshaug, Lynae E.; Wohlhuter, Kay A.

    2010-01-01

    Teaching mathematics through problem solving is a challenge for teachers who learned mathematics by doing exercises. How do teachers develop their own problem solving abilities as well as their abilities to teach mathematics through problem solving? A group of teachers began the journey of learning to teach through problem solving while taking a…

  10. Anticipating Student Responses to Improve Problem Solving

    Science.gov (United States)

    Wallace, Ann H.

    2007-01-01

    This article illustrates how problem solving can be enhanced through careful planning and problem presentation. Often, students shut down or are turned off when presented with a problem to solve. The author describes how to motivate students to embrace a problem to be solved and provides helpful prompts to further the problem-solving process.…

  11. Assessing Algebraic Solving Ability: A Theoretical Framework

    Science.gov (United States)

    Lian, Lim Hooi; Yew, Wun Thiam

    2012-01-01

    Algebraic solving ability had been discussed by many educators and researchers. There exists no definite definition for algebraic solving ability as it can be viewed from different perspectives. In this paper, the nature of algebraic solving ability in terms of algebraic processes that demonstrate the ability in solving algebraic problem is…

  12. Absolute branching intensities in the decay of 92Rb to 92Sr

    CERN Document Server

    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

    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.

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

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

  15. Using Self-Guided Treatment Software (ePST to Teach Clinicians How to Deliver Problem-Solving Treatment for Depression

    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.

  16. Using Self-Guided Treatment Software (ePST) to Teach Clinicians How to Deliver Problem-Solving Treatment for Depression.

    Science.gov (United States)

    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.

  17. A modified priority list-based MILP method for solving large-scale unit commitment problems

    Energy Technology Data Exchange (ETDEWEB)

    Ke, Xinda; Lu, Ning; Wu, Di; Kintner-Meyer, Michael CW

    2015-07-26

    This paper studies the typical pattern of unit commitment (UC) results in terms of generator’s cost and capacity. A method is then proposed to combine a modified priority list technique with mixed integer linear programming (MILP) for UC problem. The proposed method consists of two steps. At the first step, a portion of generators are predetermined to be online or offline within a look-ahead period (e.g., a week), based on the demand curve and generator priority order. For the generators whose on/off status is predetermined, at the second step, the corresponding binary variables are removed from the UC MILP problem over the operational planning horizon (e.g., 24 hours). With a number of binary variables removed, the resulted problem can be solved much faster using the off-the-shelf MILP solvers, based on the branch-and-bound algorithm. In the modified priority list method, scale factors are designed to adjust the tradeoff between solution speed and level of optimality. It is found that the proposed method can significantly speed up the UC problem with minor compromise in optimality by selecting appropriate scale factors.

  18. Assessing Cognitive Learning of Analytical Problem Solving

    Science.gov (United States)

    Billionniere, Elodie V.

    Introductory programming courses, also known as CS1, have a specific set of expected outcomes related to the learning of the most basic and essential computational concepts in computer science (CS). However, two of the most often heard complaints in such courses are that (1) they are divorced from the reality of application and (2) they make the learning of the basic concepts tedious. The concepts introduced in CS1 courses are highly abstract and not easily comprehensible. In general, the difficulty is intrinsic to the field of computing, often described as "too mathematical or too abstract." This dissertation presents a small-scale mixed method study conducted during the fall 2009 semester of CS1 courses at Arizona State University. This study explored and assessed students' comprehension of three core computational concepts---abstraction, arrays of objects, and inheritance---in both algorithm design and problem solving. Through this investigation students' profiles were categorized based on their scores and based on their mistakes categorized into instances of five computational thinking concepts: abstraction, algorithm, scalability, linguistics, and reasoning. It was shown that even though the notion of computational thinking is not explicit in the curriculum, participants possessed and/or developed this skill through the learning and application of the CS1 core concepts. Furthermore, problem-solving experiences had a direct impact on participants' knowledge skills, explanation skills, and confidence. Implications for teaching CS1 and for future research are also considered.

  19. MODELING AND SOLVING SELF-REFERENTIAL PUZZLES

    Directory of Open Access Journals (Sweden)

    Maja Bubalo

    2012-07-01

    Full Text Available The so-called self-referential puzzles are a very interesting kind of logic puzzles,aiming at developing the skill of logical thinking. A self-referential puzzle consists of asequence of questions about the puzzle itself. In this paper, we shall show some selfreferentialpuzzles, demonstrate how to model and solve them as propositional logicproblems, and how to mechanically generate new puzzles. For this, we shall make use ofthe specific advantages of Mozart/Oz system – the finite domain constraint programminglanguage and environment.We shall also show some new puzzles, according to our best knowledge not yet publishedelsewhere. The program in Mozart/Oz using our method generated these puzzles.

  20. Modeling Regular Replacement for String Constraint Solving

    Science.gov (United States)

    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

  1. Industrial-Strength Formally Certified SAT Solving

    CERN Document Server

    Darbari, Ashish; Marques-Silva, Joao

    2009-01-01

    Boolean Satisfiability (SAT) solvers are now routinely used in the verification of large industrial problems. However, their application in safety-critical domains such as the railways, avionics, and automotive industries requires some form of assurance for the results, as the solvers can (and sometimes do) have bugs. Unfortunately, the complexity of modern, highly optimized SAT solvers renders impractical the development of direct formal proofs of their correctness. This paper presents an alternative approach where an untrusted, industrial-strength, SAT solver is plugged into a trusted, formally certified, SAT proof checker to provide industrial-strength certified SAT solving. The key novelties and characteristics of our approach are (i) that the checker is automatically extracted from the formal development, (ii), that the combined system can be used as a standalone executable program independent of any supporting theorem prover, and (iii) that the checker certifies any SAT solver respecting the agreed form...

  2. Problem solving through recreational mathematics

    CERN Document Server

    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

  3. Problem Solving Abilities and Perceptions in Alternative Certification Mathematics Teachers

    Science.gov (United States)

    Evans, Brian R.

    2012-01-01

    It is important for teacher educators to understand new alternative certification middle and high school teachers' mathematical problem solving abilities and perceptions. Teachers in an alternative certification program in New York were enrolled in a proof-based algebra course. At the beginning and end of a semester participants were given a…

  4. Learning Styles and Problem Solving Skills of Turkish Prospective Teachers

    Science.gov (United States)

    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…

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

  6. 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...... the quality of linear relaxations. The method is evaluated on generated and real-world instances containing up to 193 transportation requests. Instances with up to 87 customers are solved to optimality within a computation time of one hour....

  7. Algorithms in Solving Polynomial Inequalities

    Directory of Open Access Journals (Sweden)

    Christopher M. Cordero

    2015-11-01

    Full Text Available A new method to solve the solution set of polynomial inequalities was conducted. When −1 −2 >0 ℎ 1,2∈ ℝ 10 if n is even. Then, the solution set is ∈ ℝ ∈ −∞,1 ∪ ,+∞ ∪ ,+1 : }. Thus, when −1−2…−≥0, the solution is ∈ ℝ ∈−∞, 1∪ ,+∞∪, +1: }. If is odd, then the solution set is ∈ ℝ ∈ ,+∞ ∪ ,+1 : }. Thus, when −1 −2…−≥0, the solution set is ∈ ℝ ∈ ,+∞∪, +1: }. Let −1−2…−<0 if n is even. Then, the solution set is ∈ ℝ ∈ ,+1 ∶ }. Thus, when −1 −2…−≤0, then the solution set is ∈ ℝ ∈, +1: }. If is an odd, then the solution set is ∈ ℝ ∈ −∞,1 ∪ ,+1 : }. Thus, when −1 −2 … − ≤0, the solution set is ∈ ℝ ∈ −∞,1 ∪ ,+1 : }. This research provides a novel method in solving the solution set of polynomial inequalities, in addition to other existing methods.

  8. Pesticides and Asbestos Programs and Enforcement Branch Case Tracking System

    Data.gov (United States)

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

  9. The Coin Problem  and Pseudorandomness for Branching Programs

    DEFF Research Database (Denmark)

    Brody, Joshua; Verbin, Elad

    2010-01-01

    The emph{Coin Problem} is the following problem: a coin is given, which lands on head with probability either $1/2 + beta$ or $1/2 - beta$. We are given the outcome of $n$ independent tosses of this coin, and the goal is to guess which way the coin is biased, and to answer correctly...... with probability $ge 2/3$. When our computational model is unrestricted, the majority function is optimal, and succeeds when $beta ge c /sqrt{n}$ for a large enough constant $c$. The coin problem is open and interesting in models that cannot compute the majority function. In this paper we study the coin problem......-once AND-OR trees. We generalize this to a emph{Dice Problem}, where instead of independent tosses of a coin we are given independent tosses of one of two $m$-sided dice. We prove that if the distributions are too close and the mass of each side of the dice is not too small, then the dice cannot...

  10. Bi-objective branch-and-cut algorithms: Applications to the single source capacitated facility location problem

    DEFF Research Database (Denmark)

    Gadegaard, Sune Lauth; Ehrgott, Matthias; Nielsen, Lars Relund

    2016-01-01

    Most real-world optimization problems are of a multi-objective nature, involving objectives which are conflicting and incomparable. Solving a multi-objective optimization problem requires a method which can generate the set of rational compromises between the objectives. In this paper, we propose...... two distinct bound set based branch-and-cut algorithms for bi-objective combinatorial optimization problems, based on implicitly and explicitly stated lower bound sets, respectively. The algorithm based on explicitly given lower bound sets computes for each branching node a lower bound set...... and compares it to an upper bound set. The implicit bound set based algorithm, on the other hand, fathoms branching nodes by generating a single point on the lower bound set for each local nadir point. We outline several approaches for fathoming branching nodes and we propose an updating scheme for the lower...

  11. Branch structure of IV-characteristics in the capacitively coupled Josephson junctions model with the diffusion current

    Energy Technology Data Exchange (ETDEWEB)

    Shukrinov, Yu.M. [Joint Institute for Nuclear Research, 141980 Dubna (Russian Federation); Physical Technical Institute, Dushanbe 734063 (Tajikistan)], E-mail: shukrinv@theor.jinr.ru; Mahfouzi, F. [Institute for Advanced Studies in Basic Sciences, P.O. Box 45195-1159, Zanjan (Iran, Islamic Republic of); Seidel, P. [Institut fuer Festkorperphysik, Friedrich-Schiller-Universitaet Jena, D-07743 Jena (Germany)

    2007-09-01

    We have solved numerically a system of dynamical equations for the gauge-invariant phase differences between superconducting layers for a stack of N intrinsic junctions and obtained a total branch structure in the current-voltage characteristics (IVC) of the stack. The coupling dependence of the branch's slopes is investigated and demonstrated that the equidistance of the branch structure in capacitively coupled Josephson junctions (CCJJ) model is broken at small values of coupling parameter. Changes in the parameters of the boundary conditions and the use of periodic boundary conditions do not affect this result. In the framework of the CCJJ model with the diffusion current we simulate an experiment and obtain the IV-characteristic with equidistant branch structure at different values of model parameters.

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

    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......-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......, shows some performance difficulty due to large search trees. The second method, which branches on forbidden and forced edge sequences, demonstrates much better performance. The latter also outperforms a leading exact solution method from the literature. Furthermore, a heuristic algorithm is presented...

  13. Measurement of tau lepton branching fractions

    International Nuclear Information System (INIS)

    We present τ- lepton branching fraction measurements based on data from the TPC/Two-Gamma detector at PEP. Using a sample ofτ- → ντK-π+π- events, we examine the resonance structure of the K-π+π- system and obtain the first measurements of branching fractions for τ- → ντK1-(1270) and τ- → ντK1-(1400). We also describe a complete set of branching fraction measurements in which all the decays of the τ- 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, μ, π, and K

  14. Geometry optimization of branchings in vascular networks

    Science.gov (United States)

    Khamassi, Jamel; Bierwisch, Claas; Pelz, Peter

    2016-06-01

    Progress has been made in developing manufacturing technologies which enable the fabrication of artificial vascular networks for tissue cultivation. However, those networks are rudimentary designed with respect to their geometry. This restricts long-term biological functionality of vascular cells which depends on geometry-related fluid mechanical stimuli and the avoidance of vessel occlusion. In the present work, a bioinspired geometry optimization for branchings in artificial vascular networks has been conducted. The analysis could be simplified by exploiting self-similarity properties of the system. Design rules in the form of two geometrical parameters, i.e., the branching angle and the radius ratio of the daughter branches, are derived using the wall shear stress as command variable. The numerical values of these parameters are within the range of experimental observations. Those design rules are not only beneficial for tissue engineering applications. Moreover, they can be used as indicators for diagnoses of vascular diseases or for the layout of vascular grafts.

  15. Heterogeneity of coronary arterial branching geometry

    Science.gov (United States)

    Wan, Shu-Yen; Reyes, Denise A.; Higgins, William E.; Ritman, Erik L.

    2000-04-01

    Past measurements of arterial branching geometry have indicated that the branching geometry is somewhat consistent with an optimal trade-off between the work needed to build and maintain the arterial tree and the work needed to operate the tree as a transport system. The branching geometry is also consistent with the mechanism that acutely adjusts the lumen diameter by way of maintaining a constant shear stress by dilating (or constricting) the arteries via the nitric oxide mechanism. However, those observations also indicate that there is considerable variation about the predicted optimization, both within any one individual and between individuals. Possible causes for this variation include: (1) measurement noise -- both due to the imprecision of the method but also the preparation of the specimen for applying the measurement technique, (2) the fact that the measurement task presents a major logistic problem, which increases as the vessel size decreases (but the number of branches correspondingly doubles at each branching) and results in progressive under-sampling as the vessel size decreases, (3) because of the logistic task involved the number of arterial trees analyzed is also greatly limited, and (4) there may indeed be actual heterogeneity in the geometry which is due to slight variation in implementation of the 'rules' used to construct a vascular tree. Indeed, it is this latter possibility that is of considerable physiological interest as it could result in the observed heterogeneity of organ perfusion and also provide some insight into the relative importance of 'initial ' conditions (i.e., how the vascular tree initially develops during embryogenesis) and the adaptive mechanisms operative in the maturing individual. The use of micro-CT imaging to provide 3D images of the intact vascular tree within the intact organ overcomes or minimizes the logistic problems listed above. It is the purpose of this study to examine whether variability in the branching

  16. The branching channel network in the Yangtze Estuary

    NARCIS (Netherlands)

    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

  17. General collision branching processes with two parameters

    Institute of Scientific and Technical Information of China (English)

    CHEN AnYue; LI JunPing

    2009-01-01

    A new class of branching models, the general collision branching processes with two parameters, is considered in this paper. For such models, it is necessary to evaluate the absorbing probabilities and mean extinction times for both absorbing states. Regularity and uniqueness criteria are firstly established. Explicit expressions are then obtained for the extinction probability vector, the mean extinction times and the conditional mean extinction times. The explosion behavior of these models is investigated and an explicit expression for mean explosion time is established. The mean global holding time is also obtained. It is revealed that these properties are substantially different between the super-explosive and sub-explosive cases.

  18. Logic, planning agency and branching time

    Directory of Open Access Journals (Sweden)

    Ricardo Souza Silvestre

    2010-12-01

    Full Text Available The purpose of this paper is to give a formal account of a kind of agency so far neglected in the field of philosophical modal logic of action: planning agency. In doing this we follow the standard approach of modal logics of agency exemplified by the works of Belnap, Chellas and Pörn. Since we believe there is a close relation between planning, time and indeterminism, we use the theory of branching time as a conceptual framework for investigating the basic features of planning agency. Besides introducing a branching-time semantics, we also provide a calculus sound and complete with respect to this semantics.

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

  20. Optimization of energy supply systems by MILP branch and bound method in consideration of hierarchical relationship between design and operation

    International Nuclear Information System (INIS)

    Highlights: • A hierarchical MILP method for optimal design of energy supply systems is proposed. • Lower bounds for the optimal value of the objective function are evaluated. • Bounding operations using the lower bounds are proposed. • The proposed method is implemented into open and commercial MILP solvers. • Validity and effectiveness of the proposed method are clarified by case studies. - Abstract: To attain the highest performance of energy supply systems, it is necessary to rationally determine types, capacities, and numbers of equipment in consideration of their operational strategies corresponding to seasonal and hourly variations in energy demands. In the combinatorial optimization method based on the mixed-integer linear programming (MILP), integer variables are used to express the selection, numbers, and on/off status of operation of equipment, and the number of these variables increases with those of equipment and periods for variations in energy demands, and affects the computation efficiency significantly. In this paper, a MILP method utilizing the hierarchical relationship between design and operation variables is proposed to solve the optimal design problem of energy supply systems efficiently: At the upper level, the optimal values of design variables are searched by the branch and bound method; At the lower level, the values of operation variables are optimized independently at each period by the branch and bound method under the values of design variables given tentatively during the search at the upper level; Lower bounds for the optimal value of the objective function to be minimized are evaluated, and are utilized for the bounding operations at both the levels. This method is implemented into open and commercial MILP solvers. Illustrative and practical case studies on the optimal design of cogeneration systems are conducted, and the validity and effectiveness of the proposed method are clarified

  1. XML Solving Problem of Expert System

    Directory of Open Access Journals (Sweden)

    Yasser A. Nada

    2011-01-01

    Full Text Available The Extensible Markup Language (XML is a subset of SGML that is completely described in this paper. Its goal is to enable generic SGML to be served, received, and processed on the Web in the way that is now possible with HTML. XML has been designed for ease of implementation and for interoperability with both SGML and HTML. An expert system is a computer program designed to simulate the problem-solving behavior of a human who is an expert in a narrow domain or discipline. Expert Systems (ES, also called Knowledge Based System (KBS, are computer application programs that take the knowledge of one or more human experts in a field and computerize it so that it is readily available for use. The main objective of this paper was to investigate the usage of different refinement methodologies for different layers of knowledge base modeling and investigate the possibility of building an expert system development and refinement tool. In our work we used XML as a knowledge representation to represent the knowledge base. Therefore we used the mathematical model to refinement of a knowledge base.

  2. Effect of left bundle branch block on TIMI frame count

    OpenAIRE

    Hatice Tolunay; Ahmet Kasapkara; İsa Öner Yüksel; Nurcan Başar; Ayşe Saatcı Yaşar; Mehmet Bilge

    2010-01-01

    Aim: Left bundle branch block is an independent risk factorfor cardiac mortality. In this study we aimed to evaluatecoronary blood flow with TIMI frame count in patients with left bundle branch block and angiographically proven normal coronary arteries.Materials and methods: We retrospectively studied 17 patients with left bundle branch block and as a control group 16 patients without left bundle branch block. All patientshad angiographically proven normal coronary arteries.Left bundle branch...

  3. The unique branching patterns of Deinococcus glycogen branching enzymes are determined by their N-terminal domains.

    NARCIS (Netherlands)

    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 radiodu

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

  5. On the red giant branch mass loss in 47 Tucanae: Constraints from the horizontal branch morphology

    CERN Document Server

    Salaris, Maurizio; Pietrinferni, Adriano

    2016-01-01

    We obtain stringent constraints on the actual efficiency of mass loss for red giant branch stars in the Galactic globular cluster 47 Tuc, by comparing synthetic modeling based on stellar evolution tracks with the observed distribution of stars along the horizontal branch in the colour-magnitude-diagram. We confirm that the observed, wedge-shaped distribution of the horizontal branch can be reproduced only by accounting for a range of initial He abundances --in agreement with inferences from the analysis of the main sequence-- and a red giant branch mass loss with a small dispersion. We have carefully investigated several possible sources of uncertainty that could affect the results of the horizontal branch modeling, stemming from uncertainties in both stellar model computations and the cluster properties such as heavy element abundances, reddening and age. We determine a firm lower limit of ~0.17$Mo for the mass lost by red giant branch stars, corresponding to horizontal branch stellar masses between ~0.65Mo ...

  6. Medial branch neurotomy in low back pain

    International Nuclear Information System (INIS)

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

  7. Branching Processes with Immigration and Related Topics

    Institute of Scientific and Technical Information of China (English)

    LI Zeng-hu

    2006-01-01

    This is a survey on the recent progresses in the study of branching processes with immigration,generalized Ornstein-Uhlenbeck processes,and affine Markov processes.We mainly focus on the applications of skew convolution semigroups and the connections in those processes.

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

  9. Infrared studies of asymptotic giant branch stars

    International Nuclear Information System (INIS)

    In this thesis studies are presented of asymptotic giant branch stars, which are thought to be an important link in the evolution of the galaxy. The studies were performed on the basis of data collected by the IRAS, the infrared astronomical satelite. 233 refs.; 33 figs.; 16 tabs

  10. 76 FR 60757 - Executive Branch Qualified Trusts

    Science.gov (United States)

    2011-09-30

    ... portfolio must meet the diversification requirements of Sec. 2634.406(b)(2) of this subpart. (2) In the case... of the trust's portfolio would be materially enhanced. Additionally, as with the blind trust, the... qualified trusts provisions for the executive branch in subparts D and E of 5 CFR part 2634 (see 57 FR...

  11. Branch II : Neutrino Oscillations at Low Energies

    Energy Technology Data Exchange (ETDEWEB)

    Cabrera, A., E-mail: anatael@in2p3.fr [CNRS/IN2P3. Laboratoire d' Astro-Particule et Cosmologie. 10 rue Alice Domont et Leonie Duquet. Paris. 75205. Cedex 13 (France); Volpe, C., E-mail: volpe@ipno.in2p3.fr [Institut de Physique Nucleaire Orsay and University of Paris XI,CNRS/IN2P3, F-91406 Orsay cedex (France)

    2011-08-15

    We summarize here briefly the experimental and theoretical results presented at the NOW2010 workshop during the parallel session Branch II 'Oscillations at low energies'. The topics have covered open problems and recent advances in solar neutrinos, reactor and geo-neutrinos, as well as neutrinos from core-collapse supernovae.

  12. Solving network design problems via decomposition, aggregation and approximation

    CERN Document Server

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

  13. On the accuracy of solving confluent Prony systems

    CERN Document Server

    Batenkov, Dmitry

    2011-01-01

    In this paper we consider several nonlinear systems of algebraic equations which can be called "Prony-type". These systems arise in various reconstruction problems in several branches of theoretical and applied mathematics. Usually, the underlying models exhibit some kind of discontinuities, and the said systems happen to capture their discontinuous nature in geometric terms. Consequently, the question of stability of solution with respect to errors in the right-hand side becomes critical for the success of any particular application. We investigate the question of "maximal possible accuracy" of solving Prony-type systems, putting stress on the "local" behaviour which approximates situations with low absolute measurement error. The accuracy estimates are formulated in very simple geometric terms, shedding some light on the structure of the problem. A comparison with recurrence-based "global" solution method is also provided.

  14. Problem Solving Appraisal of Delinquent Adolescents.

    Science.gov (United States)

    Perez, Ruperto M.; And Others

    The study investigated the following: (1) the relationship of problem solving appraisal to narcissistic vulnerability, locus of control, and depression; (2) the differences in problem solving appraisal, locus of control, and depression in first-time and repeat offenders; and (3) the prediction of problem solving appraisal by narcissistic…

  15. Perspectives on Problem Solving and Instruction

    Science.gov (United States)

    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…

  16. ON ALGEBRICO-DIFFERENTIAL EQUATIONS-SOLVING

    Institute of Scientific and Technical Information of China (English)

    WU Wenjun(Wu Wen-tsun)

    2004-01-01

    The char-set method of polynomial equations-solving is naturally extended to the differential case which gives rise to an algorithmic method of solving arbitrary systems of algebrico-differential equations. As an illustration of the method, the Devil's Problem of Pommaret is solved in details.

  17. Developing Creativity through Collaborative Problem Solving

    Science.gov (United States)

    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…

  18. LEGO Robotics: An Authentic Problem Solving Tool?

    Science.gov (United States)

    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…

  19. Automated test data generation for branch testing using incremental genetic algorithm

    Indian Academy of Sciences (India)

    T MANIKUMAR; A JOHN SANJEEV KUMAR; R MARUTHAMUTHU

    2016-09-01

    Cost of software testing can be reduced by automated test data generation to find a minimal set of data that has maximum coverage. Search-based software testing (SBST) is one of the techniques recently used for automated testing task. SBST makes use of control flow graph (CFG) and meta-heuristic search algorithms to accomplish the process. This paper focuses on test data generation for branch coverage. A major drawback in using meta-heuristic techniques is that the CFG paths have to be traversed from the starting node to end node for each automated test data. This kind of traversal could be improved by branch ordering, together with elitism. But still the population size and the number of iterations are maintained as the same to keep all the branches alive. In this paper, we present an incremental genetic algorithm (IGA) for branch coverage testing. Initially, a classical genetic algorithm (GA) is used to construct the population with the best parents for each branch node, and the IGA is started with these parents as the initial population. Hence, it is not necessary to maintain a huge population size and large number of iterations to cover all the branches. The performance is analyzed with five benchmark programs studied from the literature. The experimental results indicate that the proposed IGA search technique outperforms the other meta-heuristic search techniques in terms of memory usage and scalability.

  20. Nonlinear Programming Method for Dynamic Programming

    OpenAIRE

    Yongyang Cai; Judd, Kenneth L; Lontzek, Thomas S.; Valentina Michelangeli; Che-Lin Su

    2013-01-01

    A nonlinear programming formulation is introduced to solve infinite horizon dynamic programming problems. This extends the linear approach to dynamic programming by using ideas from approximation theory to avoid inefficient discretization. Our numerical results show that this nonlinear programming method is efficient and accurate.

  1. The Branching Bifurcation of Adaptive Dynamics

    Science.gov (United States)

    Della Rossa, Fabio; Dercole, Fabio; Landi, Pietro

    2015-06-01

    We unfold the bifurcation involving the loss of evolutionary stability of an equilibrium of the canonical equation of Adaptive Dynamics (AD). The equation deterministically describes the expected long-term evolution of inheritable traits — phenotypes or strategies — of coevolving populations, in the limit of rare and small mutations. In the vicinity of a stable equilibrium of the AD canonical equation, a mutant type can invade and coexist with the present — resident — types, whereas the fittest always win far from equilibrium. After coexistence, residents and mutants effectively diversify, according to the enlarged canonical equation, only if natural selection favors outer rather than intermediate traits — the equilibrium being evolutionarily unstable, rather than stable. Though the conditions for evolutionary branching — the joint effect of resident-mutant coexistence and evolutionary instability — have been known for long, the unfolding of the bifurcation has remained a missing tile of AD, the reason being related to the nonsmoothness of the mutant invasion fitness after branching. In this paper, we develop a methodology that allows the approximation of the invasion fitness after branching in terms of the expansion of the (smooth) fitness before branching. We then derive a canonical model for the branching bifurcation and perform its unfolding around the loss of evolutionary stability. We cast our analysis in the simplest (but classical) setting of asexual, unstructured populations living in an isolated, homogeneous, and constant abiotic environment; individual traits are one-dimensional; intra- as well as inter-specific ecological interactions are described in the vicinity of a stationary regime.

  2. Scenario trees and policy selection for multistage stochastic programming using machine learning

    CERN Document Server

    Defourny, Boris; Wehenkel, Louis

    2011-01-01

    We propose a hybrid algorithmic strategy for complex stochastic optimization problems, which combines the use of scenario trees from multistage stochastic programming with machine learning techniques for learning a policy in the form of a statistical model, in the context of constrained vector-valued decisions. Such a policy allows one to run out-of-sample simulations over a large number of independent scenarios, and obtain a signal on the quality of the approximation scheme used to solve the multistage stochastic program. We propose to apply this fast simulation technique to choose the best tree from a set of scenario trees. A solution scheme is introduced, where several scenario trees with random branching structure are solved in parallel, and where the tree from which the best policy for the true problem could be learned is ultimately retained. Numerical tests show that excellent trade-offs can be achieved between run times and solution quality.

  3. Cosmological simulations of normal-branch braneworld gravity

    Science.gov (United States)

    Schmidt, Fabian

    2009-12-01

    We introduce a cosmological model based on the normal branch of Dvali-Gabadadze-Porrati (DGP) braneworld gravity with a smooth dark energy component on the brane. The expansion history in this model is identical to ΛCDM, thus evading all geometric constraints on the DGP crossover scale rc. This well-defined model can serve as a first approximation to more general braneworld models whose cosmological solutions have not been obtained yet. We study the formation of large-scale structure in this model in the linear and nonlinear regime using N-body simulations for different values of rc. The simulations use the code presented in and solve the full nonlinear equation for the brane-bending mode in conjunction with the usual gravitational dynamics. The brane-bending mode is attractive rather than repulsive in the DGP normal branch, hence the sign of the modified gravity effects is reversed compared to those presented in . We compare the simulation results with those of ordinary ΛCDM simulations run using the same code and initial conditions. We find that the matter power spectrum in this model shows a characteristic enhancement peaking at k˜0.7h/Mpc. We also find that the abundance of massive halos is significantly enhanced. Other results presented here include the density profiles of dark matter halos, and signatures of the brane-bending mode self-interactions (Vainshtein mechanism) in the simulations. Independently of the expansion history, these results can be used to place constraints on the DGP model and future generalizations through their effects on the growth of cosmological structure.

  4. Solving equations through particle dynamics

    Science.gov (United States)

    Edvardsson, S.; Neuman, M.; Edström, P.; Olin, H.

    2015-12-01

    The present work evaluates a recently developed particle method (DFPM). The basic idea behind this method is to utilize a Newtonian system of interacting particles that through dissipation solves mathematical problems. We find that this second order dynamical system results in an algorithm that is among the best methods known. The present work studies large systems of linear equations. Of special interest is the wide eigenvalue spectrum. This case is common as the discretization of the continuous problem becomes dense. The convergence rate of DFPM is shown to be in parity with that of the conjugate gradient method, both analytically and through numerical examples. However, an advantage with DFPM is that it is cheaper per iteration. Another advantage is that it is not restricted to symmetric matrices only, as is the case for the conjugate gradient method. The convergence properties of DFPM are shown to be superior to the closely related approach utilizing only a first order dynamical system, and also to several other iterative methods in numerical linear algebra. The performance properties are understood and optimized by taking advantage of critically damped oscillators in classical mechanics. Just as in the case of the conjugate gradient method, a limitation is that all eigenvalues (spring constants) are required to be of the same sign. DFPM has no other limitation such as matrix structure or a spectral radius as is common among iterative methods. Examples are provided to test the particle algorithm's merits and also various performance comparisons with existent numerical algorithms are provided.

  5. Bit Preservation: A Solved Problem?

    Directory of Open Access Journals (Sweden)

    David S. H. Rosenthal

    2010-07-01

    Full Text Available For years, discussions of digital preservation have routinely featured comments such as “bit preservation is a solved problem; the real issues are ...”. Indeed, current digital storage technologies are not just astoundingly cheap and capacious, they are astonishingly reliable. Unfortunately, these attributes drive a kind of “Parkinson’s Law” of storage, in which demands continually push beyond the capabilities of systems implementable at an affordable price. This paper is in four parts:Claims, reviewing a typical claim of storage system reliability, showing that it provides no useful information for bit preservation purposes.Theory, proposing “bit half-life” as an initial, if inadequate, measure of bit preservation performance, expressing bit preservation requirements in terms of it, and showing that the requirements being placed on bit preservation systems are so onerous that the experiments required to prove that a solution exists are not feasible.Practice, reviewing recent research into how well actual storage systems preserve bits, showing that they fail to meet the requirements by many orders of magnitude.Policy, suggesting ways of dealing with this unfortunate situation.

  6. Community-powered problem solving.

    Science.gov (United States)

    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. PMID:23593769

  7. Voila: A visual object-oriented iterative linear algebra problem solving environment

    Energy Technology Data Exchange (ETDEWEB)

    Edwards, H.C.; Hayes, L.J. [Univ. of Texas, Austin, TX (United States)

    1994-12-31

    Application of iterative methods to solve a large linear system of equations currently involves writing a program which calls iterative method subprograms from a large software package. These subprograms have complex interfaces which are difficult to use and even more difficult to program. A problem solving environment specifically tailored to the development and application of iterative methods is needed. This need will be fulfilled by Voila, a problem solving environment which provides a visual programming interface to object-oriented iterative linear algebra kernels. Voila will provide several quantum improvements over current iterative method problem solving environments. First, programming and applying iterative methods is considerably simplified through Voila`s visual programming interface. Second, iterative method algorithm implementations are independent of any particular sparse matrix data structure through Voila`s object-oriented kernels. Third, the compile-link-debug process is eliminated as Voila operates as an interpreter.

  8. Spreadsheet modelling for solving combinatorial problems: The vendor selection problem

    CERN Document Server

    Ipsilandis, Pandelis G

    2008-01-01

    Spreadsheets have grown up and became very powerful and easy to use tools in applying analytical techniques for solving business problems. Operations managers, production managers, planners and schedulers can work with them in developing solid and practical Do-It-Yourself Decision Support Systems. Small and Medium size organizations, can apply OR methodologies without the presence of specialized software and trained personnel, which in many cases cannot afford anyway. This paper examines an efficient approach in solving combinatorial programming problems with the use of spreadsheets. A practical application, which demonstrates the approach, concerns the development of a spreadsheet-based DSS for the Multi Item Procurement Problem with Fixed Vendor Cost. The DSS has been build using exclusively standard spreadsheet feature and can solve real problems of substantial size. The benefits and limitations of the approach are also discussed.

  9. Hyphal Branching during Arbuscule Development Requires Reduced Arbuscular Mycorrhiza1.

    Science.gov (United States)

    Park, Hee-Jin; Floss, Daniela S; Levesque-Tremblay, Veronique; Bravo, Armando; Harrison, Maria J

    2015-12-01

    During arbuscular mycorrhizal symbiosis, arbuscule development in the root cortical cell and simultaneous deposition of the plant periarbuscular membrane generate the interface for symbiotic nutrient exchange. The transcriptional changes that accompany arbuscule development are extensive and well documented. By contrast, the transcriptional regulators that control these programs are largely unknown. Here, we provide a detailed characterization of an insertion allele of Medicago truncatula Reduced Arbuscular Mycorrhiza1 (RAM1), ram1-3, which reveals that RAM1 is not necessary to enable hyphopodium formation or hyphal entry into the root but is essential to support arbuscule branching. In ram1-3, arbuscules consist only of the arbuscule trunk and in some cases, a few initial thick hyphal branches. ram1-3 is also insensitive to phosphate-mediated regulation of the symbiosis. Transcript analysis of ram1-3 and ectopic expression of RAM1 indicate that RAM1 regulates expression of EXO70I and Stunted Arbuscule, two genes whose loss of function impacts arbuscule branching. Furthermore, RAM1 regulates expression of a transcription factor Required for Arbuscule Development (RAD1). RAD1 is also required for arbuscular mycorrhizal symbiosis, and rad1 mutants show reduced colonization. RAM1 itself is induced in colonized root cortical cells, and expression of RAM1 and RAD1 is modulated by DELLAs. Thus, the data suggest that DELLAs regulate arbuscule development through modulation of RAM1 and RAD1 and that the precise transcriptional control essential to place proteins in the periarbuscular membrane is controlled, at least in part, by RAM1.

  10. Solving the Policy Implementation Problem

    Directory of Open Access Journals (Sweden)

    Gregg A. Garn

    1999-08-01

    Full Text Available When Republican legislators in Arizona failed to approve educational vouchers in four consecutive legislative sessions, a charter school program was approved as a compromise. The charter school policy was written during a special summer session and within three years, over 30,000 students were enrolled in 260 charter schools across the state. Republican policy makers, who failed to enact voucher legislation, proclaimed the charter school program to be an overwhelming success and protected it from amendments by Democrats and potential actions of bureaucrats that could have altered the policy intent. Research on the implementation of policy indicates that state and local implementors frequently undermine or alter legislative intentions. However, when Arizona policy makers approved the charter school policy, they overcame this persistent implementation phenomenon and, in fact, succeeded in preserving the legislative intentions in the working program. This policy study analyzes how they were able to achieve this elusive result. Key policy makers attended to four significant features of policy implementation in creating the charter school policy: communication, financial resources, implementor attitudes, and bureaucratic structure. Manipulating these key variables allowed policy makers to reduce implementation slippage.

  11. Fort Collins Science Center Ecosystem Dynamics Branch

    Science.gov (United States)

    Wilson, Jim; Melcher, C.; Bowen, Z.

    2009-01-01

    Complex natural resource issues require understanding a web of interactions among ecosystem components that are (1) interdisciplinary, encompassing physical, chemical, and biological processes; (2) spatially complex, involving movements of animals, water, and airborne materials across a range of landscapes and jurisdictions; and (3) temporally complex, occurring over days, weeks, or years, sometimes involving response lags to alteration or exhibiting large natural variation. Scientists in the Ecosystem Dynamics Branch of the U.S. Geological Survey, Fort Collins Science Center, investigate a diversity of these complex natural resource questions at the landscape and systems levels. This Fact Sheet describes the work of the Ecosystems Dynamics Branch, which is focused on energy and land use, climate change and long-term integrated assessments, herbivore-ecosystem interactions, fire and post-fire restoration, and environmental flows and river restoration.

  12. Branch management into micropipeline joint dot

    Directory of Open Access Journals (Sweden)

    Dimitar Tyanev

    2011-11-01

    Full Text Available This paper considers problems related to hardware implementation of computational process with conditional jumps. Hardware refers to asynchronous pipeline organization at microoperational level. Exploration is dedicated to one of the tasks presented in (Tyanev, D., 2009 concerning to micropipeline controller design to control micropipeline stage into joint dot of branch algorithm. Joint dot is the point at which few preceding branches are combined. It appears inevitably into conditional jump structures and this is the reason for the actuality of its problem. Analysis of this new task is presented and request arbitration functioning principles are formulated for the incoming to joint dot requests. The arbiter is responsible for the fair choice on which depends steady peformance of separate pipeline brances. Paper also describes pipeline controller synthesis and analysis of its operation in two variants: about 2-phase and 4-phase data transfer protocol. The synthesized asynchronous arbiter scheme is invariant to the type of pipeline protocol.

  13. Branching Dynamics of Viral Information Spreading

    CERN Document Server

    Iribarren, José Luis

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

  14. General collision branching processes with two parameters

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    A new class of branching models,the general collision branching processes with two parameters,is considered in this paper.For such models,it is necessary to evaluate the absorbing probabilities and mean extinction times for both absorbing states.Regularity and uniqueness criteria are firstly established.Explicit expressions are then obtained for the extinction probability vector,the mean extinction times and the conditional mean extinction times.The explosion behavior of these models is investigated and an explicit expression for mean explosion time is established.The mean global holding time is also obtained.It is revealed that these properties are substantially different between the super-explosive and sub-explosive cases.

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

  16. Computers in Some Branches of Applied Physiology .

    Directory of Open Access Journals (Sweden)

    S.S. Verma

    1994-04-01

    Full Text Available This paper reviews the applications of computers in the evaluation of different types of problems occuring in some branches of applied physiology. The recent applications of computers to perform advanced multivariate regression analysis for developing regression models in applied physiology are also highlighted. The regression models are practical significance for screening personnel in defence services, mines, industrial works, sports and the like.

  17. Minimum disparity estimation in controlled branching processes

    OpenAIRE

    Gonzalez, Miguel; Minuesa, Carmen; del Puerto, Ines

    2015-01-01

    Minimum disparity estimation in controlled branching processes is dealt with by assuming that the offspring law belongs to a general parametric family. Under some regularity conditions it is proved that the minimum disparity estimators proposed -based on the nonparametric maximum likelihood estimator of the offspring law when the entire family tree is observed- are consistent and asymptotic normally distributed. Moreover, it is discussed the robustness of the estimators proposed. Through a si...

  18. Branch Retinal Vein Occlusion and Its Management

    Institute of Scientific and Technical Information of China (English)

    Desmond; Archer

    1992-01-01

    The natural course of Branch Retinal Vein Occlusion is determined by the site and completeness of the occlusion, the integrity of arterial perfusion to the affected sector and the efficiency of the developing collateral circulation. Most patients with tributary vein occlusion have some capillary fall out and microvascular incompetence in the distribution of the affected retina and vision is significantly compromised in over 50% of patients who have either chronic macular oedema or ischemia involving the...

  19. Recursive algorithms, branching coefficients and applications

    CERN Document Server

    Lyakhovsky, Vladimir

    2010-01-01

    Recurrent relations for branching coefficients in affine Lie algebras integrable highest weight modules are studied. The decomposition algorithm based on the injection fan technique is adopted to the situation where the Weyl denominator becomes singular with respect to a reductive subalgebra. We study some modifications of the injection fan technique and demonstrate that it is possible to define the "subtracted fans" that play the role similar to the original ones. Possible applications of subtracted fans in CFT models are considered.

  20. Teaching People to Manage Constraints: Effects on Creative Problem-Solving

    Science.gov (United States)

    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…

  1. Enhancing and Evaluating Mathematical and Scientific Problem- Solving Skills of African American College Freshmen.

    Science.gov (United States)

    Good, Jennifer M.; Halpin, Glennelle; Halpin, Gerald

    2002-01-01

    Examined the outcomes of academic support programs designed to enhance mathematical and scientific problem solving skills among African American pre-engineering college students. Interventions included weekly scientific reasoning and mathematical critical thinking and problem solving workshops, mentoring by upper-class students, and an interactive…

  2. Effects of Team-Initiated Problem Solving on Decision Making by Schoolwide Behavior Support Teams

    Science.gov (United States)

    Todd, Anne W.; Horner, Robert H.; Newton, J. Stephen; Algozzine, Robert F.; Algozzine, Kate M.; Frank, Jennifer L.

    2011-01-01

    The authors examined the problem-solving practices of school teams engaged in implementing and improving schoolwide behavior support implementation. A multiple baseline design across 4 elementary school teams was used to assess the effects of the Team-Initiated Problem Solving (TIPS) training program (1 day of team training plus 2 coached…

  3. General Problem Solving Strategies Employed in the Mexican Mathematical Olympiad

    Directory of Open Access Journals (Sweden)

    María del Consuelo Valle Espinosa

    2007-11-01

    Full Text Available This article describes the general strategies applied to problem solving in the State Math Olympiad selection test, in Puebla, Mexico. It analyzes the answers of 91 participants, ages 14 to 17, from junior high school and high school. Whether participants reached a problem solution or not, they rendered their results in one answer sheet and the arguments for those results in other. These answer sheets were used to form a database with 546 results. The sheets selected for the database were those in which participants identified the unknown factor, data and condition of the problem, in addition to have offered one or several solution strategies. Then, strategies were verbally described, their usage frequency calculated, and their effect on the different branches of mathematics depending on the problem analyzed. The strategy or strategies provided by participants were examined to identify stages of problem solving. The results showed that only 5% of the answer sheets had complete solutions. That emphasizes the need to systematize the State training courses for the National Olympiad. The importance of the training course is directly related to its purpose: to prepare young people for the National Olympiad and to enrich the Higher Education System of Puebla with students interested in doing science careers, with the ability to develop their hypothetical–deductive reasoning successfully.

  4. What should be done to improve employee motivation at Lammin Osuuspankki branches in Lahti?

    OpenAIRE

    Castren, Satu; Muhammad, Kaleem Ullah

    2008-01-01

    Abstract Date 12th June, 2008 Course Name Master Thesis EFO 705 Program MIMA‐International Marketing Group Satu Kristiina Castren 821118‐P147 Kaleem Ullah Muhammad 801202‐P310 Tutor Tobias Eltebrandt Title What should be done to improve employee motivation at Lammin Osuuspankki branches in Lahti? Problem Statement What should be done to improve the motivation of employees by the management at the branches of Lammin Osuuspankki in Lahti? Purpose of the Research The purpose of the research is t...

  5. [Geometry and algebra of branches of the middle cerebral artery].

    Science.gov (United States)

    Blinkov, S M

    1986-01-01

    A classification of the cortical branches of the middle cerebral artery (MCA) is suggested by means of which each branch in any hemisphere can be qualified and identified in any variant of MCA branching. The principle of the classification consists in grouping the branches into arteries and trunks of the second, third, etc. order. Branches supplying blood to a certain sector of the lateral surface of the hemisphere are designated arteries. Their number and zone of branching are constant. Branches giving rise to 2 and more arteries are named trunks. Branching of the trunks, the number of trunks of the second, third, etc. order, and the site and type of origin of the arteries are extremely variable. Each trunk can be designated by a formula stating its order and the name of the artery supplied by this trunk. The arrangement of the MCA branches on the surface of the gyri and deep in the sulci, represented on the map of the lateral surface of the hemisphere, is designated conditionally as geometry of MCA branches. The order of branching of the trunks and the type of origin of the arteries, represented on abstract maps of the lateral surface of the hemisphere, are designated conditionally as algebra of the MCA branches. The variability of the geometry and algebra of the MCA branches must be taken into consideration in operations for extra-intracranial microanastomosis and in endovasal intervention on the MCA. PMID:3811741

  6. Measurements of $\\Xi_c^{+}$ Branching Ratios

    CERN Document Server

    Link, J M; Anjos, J C; Bediaga, I; Göbel, C; Magnin, J; Massafferri, A; De Miranda, J M; Pepe, I M; Polycarpo, E; Dos Reis, A C; Carrillo, S; Casimiro, E; Cuautle, E; Sánchez-Hernández, A; Uribe, C; Vázquez, F; Agostino, L; Cinquini, L; Cumalat, J P; O'Reilly, B; Segoni, I; Wahl, M; Butler, J N; Cheung, H W K; Chiodini, G; Gaines, I; Garbincius, P H; Garren, L A; Gottschalk, E E; Kasper, P H; Kreymer, A E; Kutschke, R; Wang, M; Benussi, L; Bertani, M; Bianco, S; Fabbri, Franco Luigi; Zallo, A; Reyes, M; Cawlfield, C; Kim, D Y; Rahimi, A; Wiss, J; Gardner, R; Kryemadhi, A; Chung, Y S; Kang, J S; Ko, B R; Kwak, J W; Lee, K B; Cho, K; Park, H; Alimonti, G; Barberis, S; Boschini, M; Cerutti, A; D'Angelo, P; Di Corato, M; Dini, P; Edera, L; Erba, S; Giammarchi, M; Inzani, P; Leveraro, F; Malvezzi, S; Menasce, D; Mezzadri, M; Moroni, L; Pedrini, D; Pontoglio, C; Prelz, F; Rovere, M; Sala, S; Davenport, T F; Arena, V; Boca, G; Bonomi, G; Gianini, G; Liguori, G; Lopes-Pegna, D; Merlo, M M; Pantea, D; Ratti, S P; Riccardi, C; Vitulo, P; Hernández, H; López, A M; Luiggi, E; Méndez, H; Paris, A; Quinones, J; Ramírez, J E; Zhang, Y; Wilson, J R; Handler, T; Mitchell, R; Engh, D; Hosack, M; Johns, W E; Nehring, M S; Sheldon, P D; Stenson, K; Vaandering, E W; Webster, M; Sheaff, M

    2003-01-01

    Using data collected by the fixed target Fermilab experiment FOCUS, we measure the branching ratios of the Cabibbo favored decays $\\Xi_c^+ \\to \\Sigma^+K^-\\pi^+$, $\\Xi_c^+ \\to \\Sigma^+ \\bar{K}^{*}(892)^0$, and $\\Xi_c^+ \\to \\Lambda^0K^-\\pi^+\\pi^+$ relative to $\\Xi_c^+ \\to \\Xi^-\\pi^+\\pi^+$ to be $0.91\\pm0.11\\pm0.04$, $0.78\\pm0.16\\pm0.06$, and $0.28\\pm0.06\\pm0.06$, respectively. We report the first observation of the Cabibbo suppressed decay $\\Xi_c^+ \\to \\Sigma^+K^+K^-$ and we measure the branching ratio relative to $\\Xi_c^+ \\to \\Sigma^+K^-\\pi^+$ to be $0.16\\pm0.06\\pm0.01$. We also set 90% confidence level upper limits for $\\Xi_c^+ \\to \\Sigma^+ \\phi$ and $\\Xi_c^+ \\to \\Xi^*(1690)^0(\\Sigma^+ K^-) K^+$ relative to $\\Xi_c^+ \\to \\Sigma^+K^-\\pi^+$ to be 0.12 and 0.05, respectively. We find an indication of the decays $\\Xi_c^+ \\to \\Omega^-K^{+}\\pi^+$ and $\\Xi_c^+ \\to \\Sigma^{*}(1385)^+ \\bar{K}^0$ and set 90% confidence level upper limits for the branching ratios with respect to $\\Xi_c^+ \\to \\Xi^-\\pi^+\\pi^+$ to be 0.12 a...

  7. Solving the geologic issues in nuclear waste disposal

    International Nuclear Information System (INIS)

    Technical problems with nuclear waste disposal are largely geological. If these are not solved, curtailment of nuclear power development may follow, resulting in loss of an important element in the national energy supply. Present knowledge and credible advances are capable of solving these problems provided a systems view is preserved and a national development plan is followed. This requires identification of the critical controllable elements and a systematic underground test program to prove those critical elements. Waste migration can be understood and controlled by considering the key elements in the system: the system geometry, the hydrology, and the waste-rock-water chemistry. The waste program should: (1) identify and attack the critical problems first; (2) provide tests and demonstration at real disposal sites; and (3) schedule elements with long lead-times for early start and timely completion

  8. Determination of alpha_s and W boson leptonic branching ratio from the W and Z cross sections

    CERN Document Server

    Xiao, Weichen

    2016-01-01

    We try to determine the strong coupling alpha_s and the W boson leptonic branching ratio from the W and Z boson production cross section through pp collisions in the LHC. We run the MCFM program together with LHAPDF or HERAPDF les to extract the theoretical prediction of cross sections at different alpha_s in different experiments. We compare the predicted values and the experimental results to do a precise measurement of alpha_s and the branching ratio.

  9. SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING

    Institute of Scientific and Technical Information of China (English)

    Liu Xikui; Li Yan; Xu Jin

    2005-01-01

    Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a fixed code length. According to the characteristics of the problem, a DNA algorithm solving the minimum spanning tree problem is given. The effectiveness of the proposed method is verified by simulation. The advantages and disadvantages of this algorithm are discussed.

  10. A proposed method for solving fuzzy system of linear equations.

    Science.gov (United States)

    Kargar, Reza; Allahviranloo, Tofigh; Rostami-Malkhalifeh, Mohsen; Jahanshaloo, Gholam Reza

    2014-01-01

    This paper proposes a new method for solving fuzzy system of linear equations with crisp coefficients matrix and fuzzy or interval right hand side. Some conditions for the existence of a fuzzy or interval solution of m × n linear system are derived and also a practical algorithm is introduced in detail. The method is based on linear programming problem. Finally the applicability of the proposed method is illustrated by some numerical examples.

  11. A Proposed Method for Solving Fuzzy System of Linear Equations

    OpenAIRE

    Reza Kargar; Tofigh Allahviranloo; Mohsen Rostami-Malkhalifeh; Gholam Reza Jahanshaloo

    2014-01-01

    This paper proposes a new method for solving fuzzy system of linear equations with crisp coefficients matrix and fuzzy or interval right hand side. Some conditions for the existence of a fuzzy or interval solution of m × n linear system are derived and also a practical algorithm is introduced in detail. The method is based on linear programming problem. Finally the applicability of the proposed method is illustrated by some numerical examples.

  12. Application of FEM for solving various issues in material engineering

    OpenAIRE

    L.A. Dobrzański; A. Pusz; A. J. Nowak; M. Górniak

    2010-01-01

    Purpose: The aim of this work is to present selected problems concerning the application of Finite Element Method in materials engineering on the example of chosen program which makes the most of this method to simulation.Design/methodology/approach: Application of Finite Element Method was discussed and essential advantages resulting from application of it are pointed.Findings: Description of the importance and the utility of FEM during solving of problems dealing with very complicated geome...

  13. Neural network method for solving elastoplastic finite element problems

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    A basic optimization principle of Artificial Neural Network-the Lagrange Programming Neural Network (LPNN) model for solving elastoplastic finite element problems is presented. The nonlinear problems of mechanics are represented as a neural network based optimization problem by adopting the nonlinear function as nerve cell transfer function. Finally, two simple elastoplastic problems are numerically simulated. LPNN optimization results for elastoplastic problem are found to be comparable to traditional Hopfield neural network optimization model.

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

  15. Distance Measurement Solves Astrophysical Mysteries

    Science.gov (United States)

    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

  16. A branch-and-price algorithm for the capacitated facility location problem

    DEFF Research Database (Denmark)

    Klose, Andreas; Görtz, Simon

    2007-01-01

    operating and transportation costs. A number of solution approaches based on Lagrangean relaxation and subgradient optimization has been proposed for this problem. Subgradient optimization does not provide a primal (fractional) optimal solution to the corresponding master problem. However, in order...... to compute optimal solutions to large or difficult problem instances by means of a branch-and-bound procedure information about such a primal fractional solution can be advantageous. In this paper, a (stabilized) column generation method is, therefore, employed in order to solve a corresponding master...... problem exactly. The column generation procedure is then employed within a branch-and-price algorithm for computing optimal solutions to the CFLP. Computational results are reported for a set of larger and difficult problem instances....

  17. Reformulation linearization technique based branch-and-reduce approach applied to regional water supply system planning

    Science.gov (United States)

    Lan, Fujun; Bayraksan, Güzin; Lansey, Kevin

    2016-03-01

    A regional water supply system design problem that determines pipe and pump design parameters and water flows over a multi-year planning horizon is considered. A non-convex nonlinear model is formulated and solved by a branch-and-reduce global optimization approach. The lower bounding problem is constructed via a three-pronged effort that involves transforming the space of certain decision variables, polyhedral outer approximations, and the Reformulation Linearization Technique (RLT). Range reduction techniques are employed systematically to speed up convergence. Computational results demonstrate the efficiency of the proposed algorithm; in particular, the critical role range reduction techniques could play in RLT based branch-and-bound methods. Results also indicate using reclaimed water not only saves freshwater sources but is also a cost-effective non-potable water source in arid regions. Supplemental data for this article can be accessed at http://dx.doi.org/10.1080/0305215X.2015.1016508.

  18. A Lamperti type representation of Continuous-State Branching Processes with Immigration

    CERN Document Server

    Caballero, Ma Emilia; Bravo, Gerónimo Uribe

    2010-01-01

    Guided by the relationship between the breadth-first walk of a rooted tree and its sequence of generation sizes, we extend the Lamperti representation of continuous-state branching processes to allow immigration. The representation is obtained by solving a random ordinary differential equation defined by a pair of independent L\\'evy processes. Stability of the solutions is studied and gives, in particular, limit theorems (of a type previously studied by Grimvall, Kawazu and Watanabe, and Li) and a simulation scheme for continuous-state branching processes with immigration. We further apply our stability analysis to extend Pitman's limit theorem concerning Galton-Watson processes conditioned on total population size to more general offspring laws.

  19. Large Scale Structure Formation of normal branch in DGP brane world model

    CERN Document Server

    Song, Yong-Seon

    2007-01-01

    In this paper, we study the large scale structure formation of the normal branch in DGP model (Dvail, Gabadadze and Porrati brane world model) by applying the scaling method developed by Sawicki, Song and Hu for solving the coupled perturbed equations of motion of on-brane and off-brane. There is detectable departure of perturbed gravitational potential from LCDM even at the minimal deviation of the effective equation of state w_eff below -1. The modified perturbed gravitational potential weakens the integrated Sachs-Wolfe effect which is strengthened in the self-accelerating branch DGP model. Additionally, we discuss the validity of the scaling solution in the de Sitter limit at late times.

  20. Differentiation of crack branching types in fractured glass

    Science.gov (United States)

    Rabinovitch, A.; Bahat, D.

    2011-07-01

    The influence of different physical factors on the fracture branching phenomenon was investigated on a fractured brittle (glass) bottle. A fully branched fracture tree consisting of 144 initiation sites was induced. Branching sites were concentrated in two zones: close to the fracture origin and further away from it along the bottle axis, which was shown to be related to reflection of transverse acoustic waves from the bottle's shoulder. Two types of branching formed, complete full branches (FB), and attempted branching (AB) when one branch was shorter than 5 mm. Branching in the first zone was shown to be regulated by both the distribution of flaw lengths and the distances from each FB to its nearest fracture neighbor. Fracture spacing was found to be proportional to the stress at the propagating fracture tips.

  1. Evaluation of allowable external pressure for branch pipe connections

    International Nuclear Information System (INIS)

    Although the allowable external pressure for branch pipe connections is estimated by evaluation procedure for straight pipe, the applicability of this procedure has not been clear. That was discussed in this study. The buckling pressure of branch pipe connections was estimated by linear eigenvalue analysis with FEA (Finite Element Analysis). The types of branch pipe connections were T-joints and T-pipes. The ranges of configurations in branch pipe connections for FEA were determined by survey of branch pipe connections in the Japanese nuclear power plants. The results of the FEA showed that the buckling strength of branch pipe was found sufficiently to be superior to that of straight piping from comparisons of estimations by FEA for branch pipe connections and those by formula for straight pipe in the design code. It was concluded that the formula for straight pipe is applicable for the evaluation of allowable external pressure for branch pipe connections. (author)

  2. Geometric constraint solving with geometric transformation

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    This paper proposes two algorithms for solving geometric constraint systems. The first algorithm is for constrained systems without loops and has linear complexity. The second algorithm can solve constraint systems with loops. The latter algorithm is of quadratic complexity and is complete for constraint problems about simple polygons. The key to it is to combine the idea of graph based methods for geometric constraint solving and geometric transformations coming from rule-based methods.

  3. IDEAL Problem Solving dalam Pembelajaran Matematika

    OpenAIRE

    Eny Susiana

    2012-01-01

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

  4. Flight Planning Branch NASA Co-op Tour

    Science.gov (United States)

    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.

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

  6. Mobile serious games for collaborative problem solving.

    Science.gov (United States)

    Sanchez, Jaime; Mendoza, Claudia; Salinas, Alvaro

    2009-01-01

    This paper presents the results obtained from the implementation of a series of learning activities based on mobile serious games (MSG) for the development of problem-solving and collaborative skills in Chilean 8th grade students. Three MSGs were developed and played by teams of four students, who had to solve the problems posed by the game collaboratively. The data shows that the experimental group had a higher perception of their own skills of collaboration and of the plan execution dimension of problem solving than the control group, providing empirical evidence regarding the contribution of MSGs to the development of collaborative problem-solving skills.

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

  8. Fibonacci's Triangle: A Vehicle for Problem Solving.

    Science.gov (United States)

    Ouellette, Hugh

    1979-01-01

    A method for solving certain types of problems is illustrated by problems related to Fibonacci's triangle. The method involves pattern recognition, generalizing, algebraic manipulation, and mathematical induction. (MP)

  9. Calcium as a branching signal in Neurospora crassa.

    OpenAIRE

    Reissig, J L; Kinney, S G

    1983-01-01

    The divalent cation ionophore A23187 was found to induce apical branching in Neurospora crassa. Optimal effects were obtained by treatment with 0.1 mM ionophore for 30 min. Branching first became manifest during or shortly after treatment; successive rounds of branching could be observed at later times. Calcium starvation of the mycelium markedly reduced its subsequent response to the ionophore, whereas starvation for other divalent cations had no detectable effect. The branching response was...

  10. Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics

    OpenAIRE

    Fülöp, Zoltán; Vogler, Heiko

    2012-01-01

    We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that weighted monadic second order logics on trees is equivalent to the definability by formulas which start with one of the following operators: (i) a branching transitive closure or (ii) an existential second-order quantifier followed by one universal first-ord...

  11. Statistics of branched flow in a weak correlated random potential

    OpenAIRE

    Kaplan, Lev

    2002-01-01

    Recent images of electron flow through a two-dimensional electron gas (2DEG) device show branching behavior that is reproduced in numerical simulations of motion in a correlated random potential [cond-mat/0010348]. We show how such branching naturally arises from caustics in the classical flow and find a simple scaling behavior of the branching under variation of the random potential strength. Analytic results describing the statistical properties of the branching are confirmed by classical a...

  12. Neural network error correction for solving coupled ordinary differential equations

    Science.gov (United States)

    Shelton, R. O.; Darsey, J. A.; Sumpter, B. G.; Noid, D. W.

    1992-01-01

    A neural network is presented to learn errors generated by a numerical algorithm for solving coupled nonlinear differential equations. The method is based on using a neural network to correctly learn the error generated by, for example, Runge-Kutta on a model molecular dynamics (MD) problem. The neural network programs used in this study were developed by NASA. Comparisons are made for training the neural network using backpropagation and a new method which was found to converge with fewer iterations. The neural net programs, the MD model and the calculations are discussed.

  13. Theoretical prediction of side branch compromise after main branch stenting in coronary bifurcation

    Institute of Scientific and Technical Information of China (English)

    Dobrin Vassilev; Robert Gil

    2008-01-01

    One of the main problems of treatment of bifurcation lesions is side branch (SB) stenosis appearing after stent placement in the main vessel.The aim of this study was to create quantitative method for prediction of side branch compromise extent.We accepted that the main mechanism for SB ostial stenosis is flow divider (FD) displacement from stent struts after stent implantation in the main vessel.Using easily measurable parameters from coronary angiography,as SB diameter,angle α (initial angle between axes of parent vessel and SB axis) and angle α' (angle between above mentioned axes after stent placement) we can calculate percentage diameter stenosis at branch ostium (%DS):%DS = sin (α - α')/(tan α).In boundary condition of full FD displacement %DS = cos α.We tested our theoretical predictions with fluoroscopic observation of elastic wall model of bifurcation (45°distal angle between branches)permitting wall deformations with stent.There is full coincidence of values of %DS and percentage area stenosis (%AS).The regular formulas for calculations of %DS and %AS overestimate stenosis severity between 10% and 25%.Our model tests have shown full coincidence between predicted values for %DS and observed values.We demonstrate that part of the SB ostium is not visible in regular angiography and contributes to ostial lumen area.This is a method that permits quantitative prediction of side branch compromise.

  14. 40 CFR 721.10094 - Decene, branched and linear.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 30 2010-07-01 2010-07-01 false Decene, branched and linear. 721.10094... Substances § 721.10094 Decene, branched and linear. (a) Chemical substance and significant new uses subject to reporting. (1) The chemical substance identified as decene, branched and linear (PMN P-03-272;...

  15. Catalytic production of branched small alkanes from biohydrocarbons.

    Science.gov (United States)

    Oya, Shin-ichi; Kanno, Daisuke; Watanabe, Hideo; Tamura, Masazumi; Nakagawa, Yoshinao; Tomishige, Keiichi

    2015-08-10

    Squalane, C30 algae-derived branched hydrocarbon, was successfully converted to smaller hydrocarbons without skeletal isomerization and aromatization over ruthenium on ceria (Ru/CeO2 ). The internal CH2 CH2 bonds located between branches are preferably dissociated to give branched alkanes with very simple distribution as compared with conventional methods using metal-acid bifunctional catalysts.

  16. Structural dynamics branch research and accomplishments to FY 1992

    Science.gov (United States)

    Lawrence, Charles

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

  17. JPLEX: Java Simplex Implementation with Branch-and-Bound Search for Automated Test Assembly

    Science.gov (United States)

    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…

  18. Engineering neural systems for high-level problem solving.

    Science.gov (United States)

    Sylvester, Jared; Reggia, James

    2016-07-01

    There is a long-standing, sometimes contentious debate in AI concerning the relative merits of a symbolic, top-down approach vs. a neural, bottom-up approach to engineering intelligent machine behaviors. While neurocomputational methods excel at lower-level cognitive tasks (incremental learning for pattern classification, low-level sensorimotor control, fault tolerance and processing of noisy data, etc.), they are largely non-competitive with top-down symbolic methods for tasks involving high-level cognitive problem solving (goal-directed reasoning, metacognition, planning, etc.). Here we take a step towards addressing this limitation by developing a purely neural framework named galis. Our goal in this work is to integrate top-down (non-symbolic) control of a neural network system with more traditional bottom-up neural computations. galis is based on attractor networks that can be "programmed" with temporal sequences of hand-crafted instructions that control problem solving by gating the activity retention of, communication between, and learning done by other neural networks. We demonstrate the effectiveness of this approach by showing that it can be applied successfully to solve sequential card matching problems, using both human performance and a top-down symbolic algorithm as experimental controls. Solving this kind of problem makes use of top-down attention control and the binding together of visual features in ways that are easy for symbolic AI systems but not for neural networks to achieve. Our model can not only be instructed on how to solve card matching problems successfully, but its performance also qualitatively (and sometimes quantitatively) matches the performance of both human subjects that we had perform the same task and the top-down symbolic algorithm that we used as an experimental control. We conclude that the core principles underlying the galis framework provide a promising approach to engineering purely neurocomputational systems for problem-solving

  19. Engineering neural systems for high-level problem solving.

    Science.gov (United States)

    Sylvester, Jared; Reggia, James

    2016-07-01

    There is a long-standing, sometimes contentious debate in AI concerning the relative merits of a symbolic, top-down approach vs. a neural, bottom-up approach to engineering intelligent machine behaviors. While neurocomputational methods excel at lower-level cognitive tasks (incremental learning for pattern classification, low-level sensorimotor control, fault tolerance and processing of noisy data, etc.), they are largely non-competitive with top-down symbolic methods for tasks involving high-level cognitive problem solving (goal-directed reasoning, metacognition, planning, etc.). Here we take a step towards addressing this limitation by developing a purely neural framework named galis. Our goal in this work is to integrate top-down (non-symbolic) control of a neural network system with more traditional bottom-up neural computations. galis is based on attractor networks that can be "programmed" with temporal sequences of hand-crafted instructions that control problem solving by gating the activity retention of, communication between, and learning done by other neural networks. We demonstrate the effectiveness of this approach by showing that it can be applied successfully to solve sequential card matching problems, using both human performance and a top-down symbolic algorithm as experimental controls. Solving this kind of problem makes use of top-down attention control and the binding together of visual features in ways that are easy for symbolic AI systems but not for neural networks to achieve. Our model can not only be instructed on how to solve card matching problems successfully, but its performance also qualitatively (and sometimes quantitatively) matches the performance of both human subjects that we had perform the same task and the top-down symbolic algorithm that we used as an experimental control. We conclude that the core principles underlying the galis framework provide a promising approach to engineering purely neurocomputational systems for problem-solving

  20. Precision Branching Ratio Measurement for the Superallowed &+circ; Emitter ^62Ga

    Science.gov (United States)

    Finlay, Paul; Svensson, C. E.; Austin, R. A. E.; Ball, G. C.; Bandyopadhyay, D.; Chaffey, A.; Chakrawarthy, R. S.; Garrett, P. E.; Grinyer, G. F.; Hackman, G.; Hyland, B.; Kanungo, R.; Leslie, J. R.; Mattoon, C.; Morton, A. C.; Pearson, C. J.; Ressler, J. J.; Sarazin, F.; Savajols, H.

    2007-10-01

    A high-precision branching ratio measurement for the superallowed &+circ; emitter ^62Ga has been made using the 8π γ-ray spectrometer in conjunction with the SCintillating Electron-Positron Tagging ARray (SCEPTAR) as part of an ongoing experimental program in superallowed Fermi beta decay studies at the Isotope Separator and Accelerator (ISAC) facility at TRIUMF in Vancouver, Canada, which delivered a high-purity beam of ˜10^4 ^62Ga/s in December 2005. The present work represents the highest statistics measurement of the ^62Ga superallowed branching ratio to date. 25 γ rays emitted following non-superallowed decay branches of ^62Ga have been identified and their intensities determined. These data yield a superallowed branching ratio with 10-4 precision, and our observed branch to the first nonanalogue 0^+ state sets a new upper limit on the isospin-mixing correction δC1^1. By comparing our ft value with the world average Ft, we make stringent tests of the different calculations for the isospin-symmetry-breaking correction δC, which is predicted to be large for ^62Ga.