WorldWideScience

Sample records for branching programs solving

  1. Pebbling and Branching Programs Solving the Tree Evaluation Problem

    CERN Document Server

    Wehr, Dustin

    2010-01-01

    We study restricted computation models related to the Tree Evaluation Problem}. The TEP was introduced in earlier work as a simple candidate for the (*very*) long term goal of separating L and LogDCFL. The input to the problem is a rooted, balanced binary tree of height h, whose internal nodes are labeled with binary functions on [k] = {1,...,k} (each given simply as a list of k^2 elements of [k]), and whose leaves are labeled with elements of [k]. Each node obtains a value in [k] equal to its binary function applied to the values of its children, and the output is the value of the root. The first restricted computation model, called Fractional Pebbling, is a generalization of the black/white pebbling game on graphs, and arises in a natural way from the search for good upper bounds on the size of nondeterministic branching programs (BPs) solving the TEP - for any fixed h, if the binary tree of height h has fractional pebbling cost at most p, then there are nondeterministic BPs of size O(k^p) solving the heigh...

  2. Solving a Class of Stochastic Mixed-Integer Programs With Branch and Price

    Science.gov (United States)

    2006-01-01

    with time windows (Desrosiers et al. [26], Ribeiro and Soumis [46]) The vehicle routing problem with time windows (VRPTW) is one important exemplar from...procedures for solving mixed-variables programming problems. Numerische Mathematik 4, 238–252 (1962) 10. Bertsimas, D.J.: A vehicle routing problem with...Oper. Res. 45, 649–661 (1997) 24. Desrochers, M., Desrosiers, J., Solomon, M.: 1992. A new optimization algorithm for the vehicle routing problem with

  3. Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming.

    Science.gov (United States)

    Wu, Z; Zhang, Y

    2008-01-01

    The double digestion problem for DNA restriction mapping has been proved to be NP-complete and intractable if the numbers of the DNA fragments become large. Several approaches to the problem have been tested and proved to be effective only for small problems. In this paper, we formulate the problem as a mixed-integer linear program (MIP) by following (Waterman, 1995) in a slightly different form. With this formulation and using state-of-the-art integer programming techniques, we can solve randomly generated problems whose search space sizes are many-magnitude larger than previously reported testing sizes.

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

  5. One algorithm for branch and bound method for solving concave optimization problem

    Science.gov (United States)

    Andrianova, A. A.; Korepanova, A. A.; Halilova, I. F.

    2016-11-01

    The article describes the algorithm for branch and bound method for solving the concave programming problem, which is based on the idea of similarity the necessary and sufficient conditions of optimum for the original problem and for a convex programming problem with another feasible set and reverse the sign of the objective function. To find the feasible set of the equivalent convex programming problem we construct an algorithm using the idea of the branch and bound method. We formulate various branching techniques and discusses the construction of the lower objective function evaluations for the node of the decision tree. The article discusses the results of experiments of this algorithm for some famous test problems of a particular form.

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

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

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

  9. PSQP: Puzzle Solving by Quadratic Programming.

    Science.gov (United States)

    Andalo, Fernanda A; Taubin, Gabriel; Goldenstein, Siome

    2017-02-01

    In this article we present the first effective method based on global optimization for the reconstruction of image puzzles comprising rectangle pieces-Puzzle Solving by Quadratic Programming (PSQP). The proposed novel mathematical formulation reduces the problem to the maximization of a constrained quadratic function, which is solved via a gradient ascent approach. The proposed method is deterministic and can deal with arbitrary identical rectangular pieces. We provide experimental results showing its effectiveness when compared to state-of-the-art approaches. Although the method was developed to solve image puzzles, we also show how to apply it to the reconstruction of simulated strip-shredded documents, broadening its applicability.

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

    the integrated problem. In the proposed model, the master problem is formulated as a set-partitioning problem, and subproblems to identify columns with negative reduced costs are solved using mixed integer programming. To obtain sub-optimal solutions quickly, a metaheuristic approach based on critical......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 differences in operations between bulk ports and container terminals which highlights the need to devise specific solutions for bulk ports. The objective is to minimize the total service time of vessels berthing at the port. We propose an exact solution algorithm based on a branch and price framework to solve...

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

  12. Solving Integer Programming by Evolutionary Soft Agent

    Institute of Scientific and Technical Information of China (English)

    Yin Jian

    2003-01-01

    Many practical problems in commerce and industry involve finding the best way to allocate scarce resources a mong competing activities. This paper focuses on the problem of integer programming, and describes an evolutionary soft agent model to solve it. In proposed model, agent is composed of three components: goal, environment and behavior. Experirnental shows thne model has the characters of parallel computing and goal driving.

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

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

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

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

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

  18. Multi-branch query tree protocol for solving RFID tag collision problem

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    The technology of anti-collision is a key point in radio frequency identification (RFID) system. To avoid data collision, there are two approaches: ALOHA based algorithm and binary tree (BT) based algorithm. However, these cannot solve the collision problem completely, especially when the tag quantity is big and the tag ID is long. In this article, we present a multi-branch query tree (MBQT) protocol based on balanced incomplete block design (BIBD) code, and use 16-bit vectors derived from the BIBD as query prefix symbols of RFID reader. Compared with the conventional anti-collision algorithm, the theoretic analysis and simulation show that the proposed protocol improves the identification efficiency.

  19. A note on solving large-scale zero-one programming problems

    NARCIS (Netherlands)

    Adema, Jos J.

    1988-01-01

    A heuristic for solving large-scale zero-one programming problems is provided. The heuristic is based on the modifications made by H. Crowder et al. (1983) to the standard branch-and-bound strategy. First, the initialization is modified. The modification is only useful if the objective function valu

  20. Solving a Fully Fuzzy Linear Programming Problem through Compromise Programming

    OpenAIRE

    Haifang Cheng; Weilai Huang; Jianhu Cai

    2013-01-01

    In the current literatures, there are several models of fully fuzzy linear programming (FFLP) problems where all the parameters and variables were fuzzy numbers but the constraints were crisp equality or inequality. In this paper, an FFLP problem with fuzzy equality constraints is discussed, and a method for solving this FFLP problem is also proposed. We first transform the fuzzy equality constraints into the crisp inequality ones using the measure of the similarity, which is interpreted as t...

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

  2. A semidefinite programming approach for solving Multiobjective Linear Programming

    CERN Document Server

    Blanco, Víctor; Ben-Ali, Safae El-Haj

    2011-01-01

    Several algorithms are available in the literature for finding the entire set of Pareto-optimal solutions in MultiObjective Linear Programming (MOLP). However, it has not been proposed so far an interior point algorithm that finds all Pareto-optimal solutions of MOLP. We present an explicit construction, based on a transformation of any MOLP into a finite sequence of SemiDefinite Programs (SDP), the solutions of which give the entire set of Pareto-optimal extreme points solutions of MOLP. These SDP problems are solved by interior point methods; thus our approach provides a pseudo-polynomial interior point methodology to find the set of Pareto-optimal solutions of MOLP.

  3. A program to solve rotating plasma problems

    NARCIS (Netherlands)

    Bakker, M.; Berg, M.S. van den

    1980-01-01

    It is shown that the solution of a rotating plasma problem minimizes a quitably chosen funtional. This variational problem is solved by the Ritz-Galerkin methud using piecewise bilinear functions and applying some Newton-Côtes-like quadrature. The resulting linear system with a sparse nonegative def

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

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

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

  7. Method for solving a convex integer programming problem

    OpenAIRE

    Stefanov, Stefan M.

    2003-01-01

    We consider a convex integer program which is a nonlinear version of the assignment problem. This problem is reformulated as an equivalent problem. An algorithm for solving the original problem is suggested which is based on solving the simple assignment problem via some of known algorithms.

  8. The Environmental Justice Collaborative Problem-Solving Cooperative Agreement Program

    Science.gov (United States)

    The Environmental Justice Collaborative Problem-Solving (CPS) Cooperative Agreement Program provides financial assistance to eligible organizations working on or planning to work on projects to address local environmental and/or public health issues

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

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

  11. DNA computation model to solve 0-1 programming problem.

    Science.gov (United States)

    Zhang, Fengyue; Yin, Zhixiang; Liu, Bo; Xu, Jin

    2004-01-01

    0-1 programming problem is an important problem in opsearch with very widespread applications. In this paper, a new DNA computation model utilizing solution-based and surface-based methods is presented to solve the 0-1 programming problem. This model contains the major benefits of both solution-based and surface-based methods; including vast parallelism, extraordinary information density and ease of operation. The result, verified by biological experimentation, revealed the potential of DNA computation in solving complex programming problem.

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

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

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

  15. Solving bilevel programs with the KKT-approach

    OpenAIRE

    Bouza Allende, Gemayqzel; Still, Georg

    2013-01-01

    Bilevel programs (BL) form a special class of optimization problems. They appear in many models in economics, game theory and mathematical physics. BL programs show a more complicated structure than standard finite problems. We study the so-called KKT-approach for solving bilevel problems, where the lower level minimality condition is replaced by the KKT- or the FJ-condition. This leads to a special structured mathematical program with complementarity constraints. We analyze the KKT-approach ...

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

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

  18. Solving quadratic programming problems by delayed projection neural network.

    Science.gov (United States)

    Yang, Yongqing; Cao, Jinde

    2006-11-01

    In this letter, the delayed projection neural network for solving convex quadratic programming problems is proposed. The neural network is proved to be globally exponentially stable and can converge to an optimal solution of the optimization problem. Three examples show the effectiveness of the proposed network.

  19. Solving linear integer programming problems by a novel neural model.

    Science.gov (United States)

    Cavalieri, S

    1999-02-01

    The paper deals with integer linear programming problems. As is well known, these are extremely complex problems, even when the number of integer variables is quite low. Literature provides examples of various methods to solve such problems, some of which are of a heuristic nature. This paper proposes an alternative strategy based on the Hopfield neural network. The advantage of the strategy essentially lies in the fact that hardware implementation of the neural model allows for the time required to obtain a solution so as not depend on the size of the problem to be solved. The paper presents a particular class of integer linear programming problems, including well-known problems such as the Travelling Salesman Problem and the Set Covering Problem. After a brief description of this class of problems, it is demonstrated that the original Hopfield model is incapable of supplying valid solutions. This is attributed to the presence of constant bias currents in the dynamic of the neural model. A demonstration of this is given and then a novel neural model is presented which continues to be based on the same architecture as the Hopfield model, but introduces modifications thanks to which the integer linear programming problems presented can be solved. Some numerical examples and concluding remarks highlight the solving capacity of the novel neural model.

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

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

  2. EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report.

    Science.gov (United States)

    Jarvis, John J.; And Others

    Designed for student use in solving linear programming problems, the interactive computer program described (EZLP) permits the student to input the linear programming model in exactly the same manner in which it would be written on paper. This report includes a brief review of the development of EZLP; narrative descriptions of program features,…

  3. Deterministic Identity Testing of Read-Once Algebraic Branching Programs

    CERN Document Server

    Jansen, Maurice; Sarma, Jayalal

    2009-01-01

    In this paper we study polynomial identity testing of sums of $k$ read-once algebraic branching programs ($\\Sigma_k$-RO-ABPs), generalizing the work in (Shpilka and Volkovich 2008,2009), who considered sums of $k$ read-once formulas ($\\Sigma_k$-RO-formulas). We show that $\\Sigma_k$-RO-ABPs are strictly more powerful than $\\Sigma_k$-RO-formulas, for any $k \\leq \\lfloor n/2\\rfloor$, where $n$ is the number of variables. We obtain the following results: 1) Given free access to the RO-ABPs in the sum, we get a deterministic algorithm that runs in time $O(k^2n^7s) + n^{O(k)}$, where $s$ bounds the size of any largest RO-ABP given on the input. This implies we have a deterministic polynomial time algorithm for testing whether the sum of a constant number of RO-ABPs computes the zero polynomial. 2) Given black-box access to the RO-ABPs computing the individual polynomials in the sum, we get a deterministic algorithm that runs in time $k^2n^{O(\\log n)} + n^{O(k)}$. 3) Finally, given only black-box access to the polyn...

  4. A goal programming procedure for solving fuzzy multiobjective fractional linear programming problems

    OpenAIRE

    Tunjo Perić; Zoran Babić; Sead Rešić

    2014-01-01

    This paper presents a modification of Pal, Moitra and Maulik's goal programming procedure for fuzzy multiobjective linear fractional programming problem solving. The proposed modification of the method allows simpler solving of economic multiple objective fractional linear programming (MOFLP) problems, enabling the obtained solutions to express the preferences of the decision maker defined by the objective function weights. The proposed method is tested on the production planning example.

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

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

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

  8. Branch-and-price for staff rostering: An efficient implementation using generic programming and nested column generation

    DEFF Research Database (Denmark)

    Dohn, Anders Høeg; Mason, Andrew

    2013-01-01

    We present a novel generic programming implementation of a column-generation algorithm for the generalized staff rostering problem. The problem is represented as a generalized set partitioning model, which is able to capture commonly occurring problem characteristics given in the literature....... Columns of the set partitioning problem are generated dynamically by solving a pricing subproblem, and constraint branching in a branch-and-bound framework is used to enforce integrality. The pricing problem is formulated as a novel three-stage nested shortest path problem with resource constraints...... that exploits the inherent problem structure. A very efficient implementation of this pricing problem is achieved by using generic programming principles in which careful use of the C++ pre-processor allows the generator to be customized for the target problem at compile-time. As well as decreasing run times...

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

  10. Finding Trustworthy Experts to Help Problem Solving on the Programming Learning Forum

    Science.gov (United States)

    Tseng, Shian-Shyong; Weng, Jui-Feng

    2010-01-01

    The most important thing for learners in Programming Language subject is problem solving. During the practical programming project, various problems may occur and learners usually need consultation from the senior programmers (i.e. the experts) to assist them in solving the problems. Thus, the inquiry-based learning with learning forum is applied…

  11. A Rapid Grid Search Method for Solving Dynamic Programming Problems in Economics

    OpenAIRE

    Hui He; Hao Zhang

    2013-01-01

    We introduce a rapid grid search method in solving dynamic programming problems in economics. Compared to mainstream grid search methods, by using local information of the Bellman equation, this method can significantly increase the efficiency in solving dynamic programming problems by reducing the grid points searched in the control space.

  12. A Note on a Rapid Grid Search Method for Solving Dynamic Programming Problems in Economics

    OpenAIRE

    Hui He; Hao Zhang

    2010-01-01

    We introduce a rapid grid search method in solving the dynamic programming problems in economics. Compared to mainstream grid search methods, by using local information of the Bellman equation, this method can significantly increase the efficiency in solving dynamic programming problems by reducing the grid points searched in the control space.

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

    OpenAIRE

    A. Hadi-Vencheh; Z Rezaei; S. Razipour

    2014-01-01

    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.

  14. Creating a Brighter Future: An Update on the Future Problem Solving Program.

    Science.gov (United States)

    Crabbe, Anne Borland

    1982-01-01

    The Future Problem Solving Program is intended to help gifted students (grades 4 through 12) develop richer images of the future and increase creativity, communication, teamwork, research, and problem-solving skills. Procedures for participating in the program and securing materials are explained. (CL)

  15. Restricted dynamic programming: A flexible framework for solving realistic VRP's.

    NARCIS (Netherlands)

    Gromicho, J.; Hoorn, van J.J.; Kok, A.L.; Schutten, J.M.J.

    2012-01-01

    Most solution methods for solving large vehicle routing and scheduling problems are based on local search. A drawback of these approaches is that they are designed and optimized for specific types of vehicle routing problems (VRPs). As a consequence, it is hard to adapt these solution methods to han

  16. Restricted dynamic programming: a flexible framework for solving realistic VRPs

    NARCIS (Netherlands)

    Gromicho, J.; Hoorn, van J.J.; Kok, A.L.; Schutten, J.M.J.

    2009-01-01

    Most solution methods for solving large vehicle routing and schedu- ling problems are based on local search. A drawback of these ap- proaches is that they are designed and optimized for specific types of vehicle routing problems (VRPs). As a consequence, it is hard to adapt these solution methods to

  17. Problem Solving

    Science.gov (United States)

    Kinsella, John J.

    1970-01-01

    Discussed are the nature of a mathematical problem, problem solving in the traditional and modern mathematics programs, problem solving and psychology, research related to problem solving, and teaching problem solving in algebra and geometry. (CT)

  18. A New Method for Solving Fuzzy Linear Programs with Trapezoidal Fuzzy Numbers

    Directory of Open Access Journals (Sweden)

    Jagdeep Kaur

    2011-12-01

    Full Text Available Ganesan and Veeramani [Fuzzy linear programs with trapezoidal fuzzy numbers, Annals of Operations Research 143 (2006 305-315.] proposed a new method for solving a special type of fuzzy linear programming problems. In this paper a new method, named as Mehar's method, is proposed for solving the same type of fuzzy linear programming problems and it is shown that it is easy to apply the Mehar's method as compared to the existing method for solving the same type of fuzzy linear programming problems.

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

  20. A discrete-time Lagrangian network for solving constrained quadratic programs.

    Science.gov (United States)

    Tang, W S; Wang, J

    2000-08-01

    A discrete-time recurrent neural network which is called the discrete-time Lagrangian network is proposed in this letter for solving convex quadratic programs. It is developed based on the classical Lagrange optimization method and solves quadratic programs without using any penalty parameter. The condition for the neural network to globally converge to the optimal solution of the quadratic program is given. Simulation results are presented to illustrate its performance.

  1. Problem-solving of Linear Programming on Add-ins%基于加载宏的线性规划问题求解

    Institute of Scientific and Technical Information of China (English)

    陈秀华

    2011-01-01

    线性规划是运筹学的重要分支,应用十分广泛。本文介绍利用加载宏解决线性规划优化问题求解的详细方法和步骤。该方法可以减少求解线性规划问题的计算量,提高计算速度,并且方便实用。%Linear programming is an important branch of operations research,is widely used.This article describes the use of add-ins to solve linear programming optimization problem-solving methods and procedures in detail.This method can reduce the calculation of solving linear programming problems,improve computing speed, and the convenient and practical.

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

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

    This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... 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...

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

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

  6. SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The solution of quadratic programming problems is an importantissue in the field of mathematical programming and industrial applications. In this paper, we solve convex quadratic programming by a potential-reduction interior-point algorithm. It is proved that the potential-reduction interior-point algorithm is globally convergent. Some numerical experiments were made.

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

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

  9. Problem Solving with an Icon Oriented Programming Tool: A Case Study in Technology Education.

    Science.gov (United States)

    Lavonen, Jari M.; Lattu, Matti; Meisalo, Veijo P.

    2001-01-01

    Finnish eighth graders used computer control software to find creative solutions to technological problems. The learning environment encouraged problem-centered and creative approaches. More systematic teaching of programming skills before problem solving was recommended. (Contains 32 references.) (SK)

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

  11. A Constraint Programming Approach for Solving a Queueing Control Problem

    CERN Document Server

    Terekhov, Daria; 10.1613/jair.2446

    2011-01-01

    In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic customer arrival and service times, we seek a policy for switching workers such that the expected customer waiting time is minimized while the expected back room staffing is sufficient to perform all work. Three novel constraint programming models and several shaving procedures for these models are presented. Experimental results show that a model based on closed-form expressions together with a combination of shaving procedures is the most efficient. This model is able to find and prove optimal solutions for many problem instances within a reasonable run-time. Previously, the only available approach was a heuristic algorithm. Furthermore, a hybrid method combining the heuristic and the best constraint programming method is shown to perform as well as the heuristic in terms of solution quality over time, while achieving the same performanc...

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

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

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

    Science.gov (United States)

    Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza

    2017-05-01

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

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

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

  17. A high-performance feedback neural network for solving convex nonlinear programming problems.

    Science.gov (United States)

    Leung, Yee; Chen, Kai-Zhou; Gao, Xing-Bao

    2003-01-01

    Based on a new idea of successive approximation, this paper proposes a high-performance feedback neural network model for solving convex nonlinear programming problems. Differing from existing neural network optimization models, no dual variables, penalty parameters, or Lagrange multipliers are involved in the proposed network. It has the least number of state variables and is very simple in structure. In particular, the proposed network has better asymptotic stability. For an arbitrarily given initial point, the trajectory of the network converges to an optimal solution of the convex nonlinear programming problem under no more than the standard assumptions. In addition, the network can also solve linear programming and convex quadratic programming problems, and the new idea of a feedback network may be used to solve other optimization problems. Feasibility and efficiency are also substantiated by simulation examples.

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

  19. Interior Point Method for Solving Fuzzy Number Linear Programming Problems Using Linear Ranking Function

    Directory of Open Access Journals (Sweden)

    Yi-hua Zhong

    2013-01-01

    Full Text Available Recently, various methods have been developed for solving linear programming problems with fuzzy number, such as simplex method and dual simplex method. But their computational complexities are exponential, which is not satisfactory for solving large-scale fuzzy linear programming problems, especially in the engineering field. A new method which can solve large-scale fuzzy number linear programming problems is presented in this paper, which is named a revised interior point method. Its idea is similar to that of interior point method used for solving linear programming problems in crisp environment before, but its feasible direction and step size are chosen by using trapezoidal fuzzy numbers, linear ranking function, fuzzy vector, and their operations, and its end condition is involved in linear ranking function. Their correctness and rationality are proved. Moreover, choice of the initial interior point and some factors influencing the results of this method are also discussed and analyzed. The result of algorithm analysis and example study that shows proper safety factor parameter, accuracy parameter, and initial interior point of this method may reduce iterations and they can be selected easily according to the actual needs. Finally, the method proposed in this paper is an alternative method for solving fuzzy number linear programming problems.

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

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

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

  3. Setting goals, solving problems, and seeking social support: developing adolescents' abilities through a life skills program.

    Science.gov (United States)

    Forneris, Tanya; Danish, Steven J; Scott, David L

    2007-01-01

    The Going for the Goal (GOAL) program is designed to teach adolescents life skills. There have been few efforts to assess whether the skills that GOAL is designed to teach are being learned by adolescents involved in the program. The purpose of this study was to examine the impact of GOAL on the acquisition of skills in the areas of setting goals, solving problems, and seeking social support. Interviews were conducted with twenty adolescents. Those who participated in GOAL reported that they had learned how to set goals, to solve problems effectively, and to seek the appropriate type of social support.

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

  5. The Problem-Solving Approach to program evaluation: Development and application in a mathematics context

    Science.gov (United States)

    Costner, Kelly Mitchell

    This study developed and piloted the Problem-Solving Approach to program evaluation, which involves the direct application of the problem-solving process as a metaphor for program evaluation. A rationale for a mathematics-specific approach is presented, and relevant literature in both program evaluation and mathematics education is reviewed. The Problem-Solving Approach was piloted with a high-school level integrated course in mathematics and science that used graphing calculators and data collection devices with the goal of helping students to gain better understanding of relationships between mathematics and science. Twelve students participated in the course, which was co-taught by a mathematics teacher and a science teacher. Data collection for the evaluation included observations, a pre- and posttest, student questionnaires, student interviews, teacher interviews, principal interviews, and a focus group that involved both students and their teachers. Results of the evaluation of the course are presented as an evaluation report. Students showed improvement in their understandings of mathematics-science relationships, but also showed growth in terms of self-confidence, independence, and various social factors that were not expected outcomes. The teachers experienced a unique form of professional development by learning and relearning concepts in each other's respective fields and by gaining insights into each other's teaching strengths. Both the results of the evaluation and the evaluation process itself are discussed in light of the proposed problem-solving approach. The use of problem solving and of specific problem-solving strategies was found to be prevalent among the students and the teachers, as well as in the activities of the evaluator. Specific problem-solving strategies are highlighted for their potential value in program evaluation situations. The resulting Problem-Solving Approach, revised through the pilot application, employs problem solving as a

  6. Oak Ridge Gaseous Diffusion Plant Biological Monitoring and Abatement Program for Mitchell Branch

    Energy Technology Data Exchange (ETDEWEB)

    Loar, J.M.; Adams, S.M.; Kszos, L.A.; Ryon, M.G.; Smith, J.G.; Southworth, G.R.; Stewart, A.J.

    1992-01-01

    A proposed Biological Monitoring and Abatement Program (BMAP) for the Oak Ridge Gaseous Diffusion Plant (ORGDP; currently the Oak Ridge K-25 Site) was prepared in December 1986, as required by the modified National Pollutant Discharge Elimination System (NPDES) permit that was issued on September 11, 1986. The effluent discharges to Mitchell Branch are complex, consisting of trace elements, organic chemicals, and radionuclides in addition to various conventional pollutants. Moreover, the composition of these effluent streams will be changing over time as various pollution abatement measures are implemented over the next several years. Although contaminant inputs to the stream originate primarily as point sources from existing plant operations, area sources, such as the classified burial grounds and the K-1407-C holding pond, can not be eliminated as potential sources of contaminants. The proposed BMAP consists of four tasks. These tasks include (1) ambient toxicity testing, (2) bioaccumulation studies, (3) biological indicator studies, and (4) ecological surveys of the benthic invertebrate and fish communities. BMAP will determine whether the effluent limits established for ORGDP protect the designated use of the receiving stream (Mitchell Branch) for growth and propagation of fish and aquatic life. Another objective of the program is to document the ecological effects resulting from various pollution abatement projects, such as the Central Neutralization Facility.

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

  8. A high performance neural network for solving nonlinear programming problems with hybrid constraints

    Science.gov (United States)

    Tao, Qing; Cao, Jinde; Xue, Meisheng; Qiao, Hong

    2001-09-01

    A continuous neural network is proposed in this Letter for solving optimization problems. It not only can solve nonlinear programming problems with the constraints of equality and inequality, but also has a higher performance. The main advantage of the network is that it is an extension of Newton's gradient method for constrained problems, the dynamic behavior of the network under special constraints and the convergence rate can be investigated. Furthermore, the proposed network is simpler than the existing networks even for solving positive definite quadratic programming problems. The network considered is constrained by a projection operator on a convex set. The advanced performance of the proposed network is demonstrated by means of simulation of several numerical examples.

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

  10. Enhancing Problem-Solving Capabilities Using Object-Oriented Programming Language

    Science.gov (United States)

    Unuakhalu, Mike F.

    2009-01-01

    This study integrated object-oriented programming instruction with transfer training activities in everyday tasks, which might provide a mechanism that can be used for efficient problem solving. Specifically, a Visual BASIC embedded with everyday tasks group was compared to another group exposed to Visual BASIC instruction only. Subjects were 40…

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

  12. The "Best" Algorithm for Solving Stochastic Mixed Integer Programs

    Science.gov (United States)

    2006-01-01

    focuses on solving problems for which all second-stage scenarios can be enu- merated (Klein Haneveld and van der Vlerk 1998, Ahmed 2004). Two exceptions... Haneveld , W. K. and M. H. van der Vlerk. 1998. Stochastic integer programming: state of the art. Available via <http://citeseer.ist.psu. edu

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

  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. Pen Branch fault program: Interim report on the High Resolution, Shallow Seismic Reflection surveys

    Energy Technology Data Exchange (ETDEWEB)

    Stieve, A.L. [Westinghouse Savannah River Co., Aiken, SC (United States)

    1991-01-31

    The Pen Branch fault was identified in the subsurface at the Savannah River Site in 1989 based upon the interpretation of earlier seismic reflection surveys and other geologic investigations. A program was initiated at that time to further define the fault in terms of its capability to release seismic energy. The High-Resolution, Shallow Seismic Reflection survey recently completed at SRS was initiated to determine the shallowest extent of the fault and to demonstrate the presence of flat-lying sediments in the top 300 feet of sediments. Conclusions at this time are based upon this shallow seismic survey and the Conoco deep seismic survey (1988--1989). Deformation related to the Pen Branch fault is at least 200 milliseconds beneath the surface in the Conoco data and at least 150 milliseconds in the shallow seismic reflection data. This corresponds to approximately 300 feet below the surface. Sediments at that depth are lower Tertiary (Danian stage) or over 60 million years old. This indicates that the fault is not capable.

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

  17. Iterative Adaptive Dynamic Programming for Solving Unknown Nonlinear Zero-Sum Game Based on Online Data.

    Science.gov (United States)

    Zhu, Yuanheng; Zhao, Dongbin; Li, Xiangjun

    2017-03-01

    H∞ control is a powerful method to solve the disturbance attenuation problems that occur in some control systems. The design of such controllers relies on solving the zero-sum game (ZSG). But in practical applications, the exact dynamics is mostly unknown. Identification of dynamics also produces errors that are detrimental to the control performance. To overcome this problem, an iterative adaptive dynamic programming algorithm is proposed in this paper to solve the continuous-time, unknown nonlinear ZSG with only online data. A model-free approach to the Hamilton-Jacobi-Isaacs equation is developed based on the policy iteration method. Control and disturbance policies and value are approximated by neural networks (NNs) under the critic-actor-disturber structure. The NN weights are solved by the least-squares method. According to the theoretical analysis, our algorithm is equivalent to a Gauss-Newton method solving an optimization problem, and it converges uniformly to the optimal solution. The online data can also be used repeatedly, which is highly efficient. Simulation results demonstrate its feasibility to solve the unknown nonlinear ZSG. When compared with other algorithms, it saves a significant amount of online measurement time.

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

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

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

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

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

  3. A METHOD FOR SOLVING LINEAR PROGRAMMING PROBLEMS WITH FUZZY PARAMETERS BASED ON MULTIOBJECTIVE LINEAR PROGRAMMING TECHNIQUE

    OpenAIRE

    Zangiabadi, M.; H. R. MALEKI

    2007-01-01

    In the real-world optimization problems, coefficients of the objective function are not known precisely and can be interpreted as fuzzy numbers. In this paper we define the concepts of optimality for linear programming problems with fuzzy parameters based on those for multiobjective linear programming problems. Then by using the concept of comparison of fuzzy numbers, we transform a linear programming problem with fuzzy parameters to a multiobjective linear programming problem. To this end, w...

  4. An Approach for Solving Goal Programming Problems using Interval Type-2 Fuzzy Goals

    Directory of Open Access Journals (Sweden)

    Juan Carlos Figueroa-García

    2015-08-01

    Full Text Available This paper presents a proposal for solving goal problems involving multiple experts opinions and perceptions. In goal programming problems where no statistical data about their goals exist, the use of information coming from experts becomes the last reliable source. This way, we propose an approach to model this kind of goals using Interval Type-2 fuzzy sets, and a simple method for finding an optimal solution based on previous methods that have been proposed for classical fuzzy sets.

  5. Stress-constrained truss topology optimization problems that can be solved by linear programming

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Svanberg, Krister

    2004-01-01

    We consider the problem of simultaneously selecting the material and determining the area of each bar in a truss structure in such a way that the cost of the structure is minimized subject to stress constraints under a single load condition. We show that such problems can be solved by linear...... programming to give the global optimum, and that two different materials are always sufficient in an optimal structure....

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

    Science.gov (United States)

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

    2008-01-01

    Many students experience difficulties in solving applied physics problems. Most programs that want students to improve problem-solving skills are concerned with the development of content knowledge. Physhint is an example of a student-controlled computer program that supports students in developing their strategic knowledge in combination with…

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

  8. Deterministic Black-Box Identity Testing $\\pi$-Ordered Algebraic Branching Programs

    CERN Document Server

    Jansen, Maurice; Sarma, Jayalal

    2010-01-01

    In this paper we study algebraic branching programs (ABPs) with restrictions on the order and the number of reads of variables in the program. Given a permutation $\\pi$ of $n$ variables, for a $\\pi$-ordered ABP ($\\pi$-OABP), for any directed path $p$ from source to sink, a variable can appear at most once on $p$, and the order in which variables appear on $p$ must respect $\\pi$. An ABP $A$ is said to be of read $r$, if any variable appears at most $r$ times in $A$. Our main result pertains to the identity testing problem. Over any field $F$ and in the black-box model, i.e. given only query access to the polynomial, we have the following result: read $r$ $\\pi$-OABP computable polynomials can be tested in $\\DTIME[2^{O(r\\log r \\cdot \\log^2 n \\log\\log n)}]$. Our next set of results investigates the computational limitations of OABPs. It is shown that any OABP computing the determinant or permanent requires size $\\Omega(2^n/n)$ and read $\\Omega(2^n/n^2)$. We give a multilinear polynomial $p$ in $2n+1$ variables ov...

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

  10. Structural Model Development: Branches, Attitudes and Self-Efficacy of Pedagogical Formation Program Pre-Service Teachers

    Science.gov (United States)

    Sivaci, Sadik Yuksel

    2017-01-01

    In this study, the relationship between attitudes of pedagogical formation program pre-service teachers towards teaching profession and their self-efficacies has been examined. In this case, the effect of graduation branches of the pre-service teachers on teacher self-efficacies and the effect of teacher self-efficacies on attitudes towards…

  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. Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems

    Science.gov (United States)

    Kuterin, F. A.; Sumin, M. I.

    2017-01-01

    A convex programming problem in a Hilbert space with an operator equality constraint and a finite number of functional inequality constraints is considered. All constraints involve parameters. The close relation of the instability of this problem and, hence, the instability of the classical Lagrange principle for it to its regularity properties and the subdifferentiability of the value function in the problem is discussed. An iterative nondifferential Lagrange principle with a stopping rule is proved for the indicated problem. The principle is stable with respect to errors in the initial data and covers the normal, regular, and abnormal cases of the problem and the case where the classical Lagrange principle does not hold. The possibility of using the stable sequential Lagrange principle for directly solving unstable optimization problems is discussed. The capabilities of this principle are illustrated by numerically solving the classical ill-posed problem of finding the normal solution of a Fredholm integral equation of the first kind.

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

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

  15. A semidefinite programming based branch-and-bound framework for the quadratic assignment problem

    NARCIS (Netherlands)

    Truetsch, U.

    2014-01-01

    The practical approach to calculate an exact solution for a quadratic assignment problem (QAP) via a branch-and-bound framework depends strongly on a "smart" choice of different strategies within the framework, for example the branching strategy, heuristics for the upper bound or relaxations for the

  16. An Application of Stochastic Programming in Solving Capacity Allocation and Migration Planning Problem under Uncertainty

    Directory of Open Access Journals (Sweden)

    Yin-Yann Chen

    2015-01-01

    Full Text Available The semiconductor packaging and testing industry, which utilizes high-technology manufacturing processes and a variety of machines, belongs to an uncertain make-to-order (MTO production environment. Order release particularly originates from customer demand; hence, demand fluctuation directly affects capacity planning. Thus, managing capacity allocation is a difficult endeavor. This study aims to determine the best capacity allocation with limited resources to maximize the net profit. Three bottleneck stations in the semiconductor packaging and testing process are mainly investigated, namely, die bond (DB, wire bond (WB, and molding (MD stations. Deviating from previous studies that consider the deterministic programming model, customer demand in the current study is regarded as an uncertain parameter in formulating a two-stage scenario-based stochastic programming (SP model. The SP model seeks to respond to sharp demand fluctuations. Even if future demand is uncertain, migration decision for machines and tools will still obtain better robust results for various demand scenarios. A hybrid approach is proposed to solve the SP model. Moreover, two assessment indicators, namely, the expected value of perfect information (EVPI and the value of the stochastic solution (VSS, are adopted to compare the solving results of the deterministic planning model and stochastic programming model. Sensitivity analysis is performed to evaluate the effects of different parameters on net profit.

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

  18. Neuro-Oncology Branch

    Science.gov (United States)

    ... tumors of the brain and spinal cord. Neuro-Oncology Clinical Fellowship This is a joint program with ... NCINeuroOncology@mail.nih.gov . Our News The Neuro-Oncology Branch Welcomes Dr. Mark Gilbert as New Branch ...

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

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

  1. UPDATED USER-FRIENDLY COMPUTER PROGRAMS FOR SOLVING SAMPLING AND STATISTICAL PROBLEMS (FOR MICROCOMPUTERS) (DATE OF COVERAGE: 1993). - SOFTWARE.

    Science.gov (United States)

    The product contains user-friendly computer programs for solving sampling and related statistical problems. All have been updated as well and more programs have been added. Specific, detailed written instructions and examples built into the programs are provided so that the user ...

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

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

  4. A new gradient-based neural network for solving linear and quadratic programming problems.

    Science.gov (United States)

    Leung, Y; Chen, K Z; Jiao, Y C; Gao, X B; Leung, K S

    2001-01-01

    A new gradient-based neural network is constructed on the basis of the duality theory, optimization theory, convex analysis theory, Lyapunov stability theory, and LaSalle invariance principle to solve linear and quadratic programming problems. In particular, a new function F(x, y) is introduced into the energy function E(x, y) such that the function E(x, y) is convex and differentiable, and the resulting network is more efficient. This network involves all the relevant necessary and sufficient optimality conditions for convex quadratic programming problems. For linear programming and quadratic programming (QP) problems with unique and infinite number of solutions, we have proven strictly that for any initial point, every trajectory of the neural network converges to an optimal solution of the QP and its dual problem. The proposed network is different from the existing networks which use the penalty method or Lagrange method, and the inequality constraints are properly handled. The simulation results show that the proposed neural network is feasible and efficient.

  5. Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming.

    Science.gov (United States)

    Schmid, Verena

    2012-06-16

    Emergency service providers are supposed to locate ambulances such that in case of emergency patients can be reached in a time-efficient manner. Two fundamental decisions and choices need to be made real-time. First of all immediately after a request emerges an appropriate vehicle needs to be dispatched and send to the requests' site. After having served a request the vehicle needs to be relocated to its next waiting location. We are going to propose a model and solve the underlying optimization problem using approximate dynamic programming (ADP), an emerging and powerful tool for solving stochastic and dynamic problems typically arising in the field of operations research. Empirical tests based on real data from the city of Vienna indicate that by deviating from the classical dispatching rules the average response time can be decreased from 4.60 to 4.01 minutes, which corresponds to an improvement of 12.89%. Furthermore we are going to show that it is essential to consider time-dependent information such as travel times and changes with respect to the request volume explicitly. Ignoring the current time and its consequences thereafter during the stage of modeling and optimization leads to suboptimal decisions.

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

  7. Error bounds of adaptive dynamic programming algorithms for solving undiscounted optimal control problems.

    Science.gov (United States)

    Liu, Derong; Li, Hongliang; Wang, Ding

    2015-06-01

    In this paper, we establish error bounds of adaptive dynamic programming algorithms for solving undiscounted infinite-horizon optimal control problems of discrete-time deterministic nonlinear systems. We consider approximation errors in the update equations of both value function and control policy. We utilize a new assumption instead of the contraction assumption in discounted optimal control problems. We establish the error bounds for approximate value iteration based on a new error condition. Furthermore, we also establish the error bounds for approximate policy iteration and approximate optimistic policy iteration algorithms. It is shown that the iterative approximate value function can converge to a finite neighborhood of the optimal value function under some conditions. To implement the developed algorithms, critic and action neural networks are used to approximate the value function and control policy, respectively. Finally, a simulation example is given to demonstrate the effectiveness of the developed algorithms.

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

    ZhuDetong

    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.

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

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

  11. A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations.

    Science.gov (United States)

    Xia, Youshen; Feng, Gang; Wang, Jun

    2004-09-01

    This paper presents a recurrent neural network for solving strict convex quadratic programming problems and related linear piecewise equations. Compared with the existing neural networks for quadratic program, the proposed neural network has a one-layer structure with a low model complexity. Moreover, the proposed neural network is shown to have a finite-time convergence and exponential convergence. Illustrative examples further show the good performance of the proposed neural network in real-time applications.

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

  13. A Computer Program for Solving a Set of Conditional Maximum Likelihood Equations Arising in the Rasch Model for Questionnaires.

    Science.gov (United States)

    Andersen, Erling B.

    A computer program for solving the conditional likelihood equations arising in the Rasch model for questionnaires is described. The estimation method and the computational problems involved are described in a previous research report by Andersen, but a summary of those results are given in two sections of this paper. A working example is also…

  14. An Alternative Evaluation Approach for the Problem-Solving Training Program: A Utilization-Focused Evaluation Process.

    Science.gov (United States)

    Patton, Michael Quinn

    1984-01-01

    A utilization-focused approach in evaluating a problem-solving skills training program (see TM 510 179) would have placed more emphasis on identifying evaluation users, their information needs, and likely use of findings. Other methods options are also discussed, along with how to prepare decision makers for utilization. (Author/BW)

  15. An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming

    Science.gov (United States)

    Buchheim, Christoph; Caprara, Alberto; Lodi, Andrea

    We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumeration tree, corresponding to the fixing of a subset of the variables, a lower bound is given by the continuous minimum of the restricted objective function. We improve this bound by exploiting the integrality of the variables using suitably-defined lattice-free ellipsoids. Experiments show that our approach is very fast on both unconstrained problems and problems with box constraints. The main reason is that all expensive calculations can be done in a preprocessing phase, while a single node in the enumeration tree can be processed in linear time in the problem dimension.

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

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

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

  19. A quasi-Newton approach to optimization problems with probability density constraints. [problem solving in mathematical programming

    Science.gov (United States)

    Tapia, R. A.; Vanrooy, D. L.

    1976-01-01

    A quasi-Newton method is presented for minimizing a nonlinear function while constraining the variables to be nonnegative and sum to one. The nonnegativity constraints were eliminated by working with the squares of the variables and the resulting problem was solved using Tapia's general theory of quasi-Newton methods for constrained optimization. A user's guide for a computer program implementing this algorithm is provided.

  20. The NOx Budget Trading Program: A Collaborative, Innovative Approach to Solving a Regional Air Pollution Problem

    Science.gov (United States)

    This article examines the development and implementation of the NOx Budget Trading Program (NBP) and the lessons the Environmental Protection Agency has learned from this seasonal emissions cap-and-trade program.

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

    Science.gov (United States)

    Lončar, Vladimir; Balaž, Antun; Bogojević, Aleksandar; Škrbić, Srdjan; Muruganandam, Paulsamy; Adhikari, Sadhan K.

    2016-03-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 (Kishor Kumar et al., 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-25, depending on the program and input size.

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

  3. Surfkin: A program to solve transient and steady state heterogeneous reaction kinetics

    Energy Technology Data Exchange (ETDEWEB)

    COLTRIN,MICHAEL E.; WIXOM,RYAN R.; DANDY,DAVID S.

    2000-05-01

    Heterogeneous chemical reactions occurring at a gas/surface interface are fundamental in a variety of important applications, such as combustion, catalysis, chemical vapor deposition and plasma processing. Detailed simulation of these processes may involve complex, coupled fluid flow, heat transfer, gas-phase chemistry, in addition to heterogeneous reaction chemistry. This report documents the Surfkin program, which simulates the kinetics of heterogeneous chemical reactions. The program is designed for use with the Chemkin and Surface Chemkin (heterogeneous chemistry) programs. It calculates time-dependent or steady state surface site fractions and bulk-species production/destruction rates. The surface temperature may be specified as a function of time to simulate a temperature-programmed desorption experiment, for example. This report serves as a user's manual for the program, explaining the required input and format of the output. Two detailed example problems are included to further illustrate the use of this program.

  4. 利用LINDO求解目标规划%Solve object programming with LINDO

    Institute of Scientific and Technical Information of China (English)

    洪文

    2001-01-01

    通过引入“优先乘子”概念,将目标规划按一定规则转化为线性规划,再利用LINDO求解。从而使得目标规划的求解变得简单易行。%In this paper, priority-multiplier being introduced, it is possible to counterchange object programming into linear programming, so that it is easy to search for the answer of object programming with LINDO.

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

  6. A class of finite-time dual neural networks for solving quadratic programming problems and its k-winners-take-all application.

    Science.gov (United States)

    Li, Shuai; Li, Yangming; Wang, Zheng

    2013-03-01

    This paper presents a class of recurrent neural networks to solve quadratic programming problems. Different from most existing recurrent neural networks for solving quadratic programming problems, the proposed neural network model converges in finite time and the activation function is not required to be a hard-limiting function for finite convergence time. The stability, finite-time convergence property and the optimality of the proposed neural network for solving the original quadratic programming problem are proven in theory. Extensive simulations are performed to evaluate the performance of the neural network with different parameters. In addition, the proposed neural network is applied to solving the k-winner-take-all (k-WTA) problem. Both theoretical analysis and numerical simulations validate the effectiveness of our method for solving the k-WTA problem.

  7. Integrating Gene Expression Programming and Geographic Information Systems for Solving a Multi Site Land Use Allocation Problem

    Directory of Open Access Journals (Sweden)

    Khalid A. Eldrandaly

    2009-01-01

    Full Text Available Problem statement: Land use planning may be defined as the process of allocating different activities or uses to specific units of area within a region. Multi sites Land Use Allocation Problems (MLUA refer to the problem of allocating more than one land use type in an area. MLUA problem is one of the truly NP Complete (combinatorial optimization problems. Approach: To cope with this type of problems, intelligent techniques such as genetic algorithms and simulated annealing, have been used. In this study a new approach for solving MLUA problems was proposed by integrating Gene Expression Programming (GEP and GIS. The feasibility of the proposed approach in solving MLUA problems was checked using a fictive case study. Results: The results indicated clearly that the proposed approach gives good and satisfactory results. Conclusion/Recommendation: Integrating GIS and GEP is a promising and efficient approach for solving MLUA problems. This research focused on minimizing the development costs and maximizing the compactness of the allocated land use. The optimization model can be extended in the future to maximize also the spatial contiguity of the allocated land use.

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

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

  10. A revised version of Graphic Normative Analysis Program (GNAP) with examples of petrologic problem solving

    Science.gov (United States)

    Stuckless, J.S.; VanTrump, G.

    1979-01-01

    A revised version of Graphic Normative Analysis Program (GNAP) has been developed to allow maximum flexibility in the evaluation of chemical data by the occasional computer user. GNAP calculates ClPW norms, Thornton and Tuttle's differentiation index, Barth's cations, Niggli values and values for variables defined by the user. Calculated values can be displayed graphically in X-Y plots or ternary diagrams. Plotting can be done on a line printer or Calcomp plotter with either weight percent or mole percent data. Modifications in the original program give the user some control over normative calculations for each sample. The number of user-defined variables that can be created from the data has been increased from ten to fifteen. Plotting and calculations can be based on the original data, data adjusted to sum to 100 percent, or data adjusted to sum to 100 percent without water. Analyses for which norms were previously not computable are now computed with footnotes that show excesses or deficiencies in oxides (or volatiles) not accounted for by the norm. This report contains a listing of the computer program, an explanation of the use of the program, and the two sample problems.

  11. Strange Behaviors of Interior-point Methods for Solving Semidefinite Programming Problems in Polynomial Optimization

    NARCIS (Netherlands)

    Nakata, M.; Muramatsu, M.; Waki, H.

    2008-01-01

    We observe that in a simple one-dimensional polynomial optimization problem (POP), the `optimal' values of semidefinite programming (SDP) relaxation problems reported by the standard SDP solvers converge to the optimal value of the POP, while the true optimal values of SDP relaxation problems are st

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

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

  14. Alaska Problem Resource Manual: Alaska Future Problem Solving Program. Alaska Problem 1985-86.

    Science.gov (United States)

    Gorsuch, Marjorie, Ed.

    "Alaska's Image in the Lower 48," is the theme selected by a Blue Ribbon panel of state and national leaders who felt that it was important for students to explore the relationship between Alaska's outside image and the effect of that image on the federal programs/policies that impact Alaska. An overview of Alaska is presented first in…

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

  16. A Difference-Index Based Ranking Bilinear Programming Approach to Solving Bimatrix Games with Payoffs of Trapezoidal Intuitionistic Fuzzy Numbers

    Directory of Open Access Journals (Sweden)

    Deng-Feng Li

    2013-01-01

    Full Text Available The aim of this paper is to develop a bilinear programming method for solving bimatrix games in which the payoffs are expressed with trapezoidal intuitionistic fuzzy numbers (TrIFNs, which are called TrIFN bimatrix games for short. In this method, we define the value index and ambiguity index for a TrIFN and propose a new order relation of TrIFNs based on the difference index of value index to ambiguity index, which is proven to be a total order relation. Hereby, we introduce the concepts of solutions of TrIFN bimatrix games and parametric bimatrix games. It is proven that any TrIFN bimatrix game has at least one satisfying Nash equilibrium solution, which is equivalent to the Nash equilibrium solution of corresponding parametric bimatrix game. The latter can be obtained through solving the auxiliary parametric bilinear programming model. The method proposed in this paper is demonstrated with a real example of the commerce retailers’ strategy choice problem.

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

  18. A Mixed Integer Programming Model Formulation for Solving the Lot-Sizing Problem

    CERN Document Server

    Mohammadi, Maryam

    2012-01-01

    This paper addresses a mixed integer programming (MIP) formulation for the multi-item uncapacitated lot-sizing problem that is inspired from the trailer manufacturer. The proposed MIP model has been utilized to find out the optimum order quantity, optimum order time, and the minimum total cost of purchasing, ordering, and holding over the predefined planning horizon. This problem is known as NP-hard problem. The model was presented in an optimal software form using LINGO 13.0.

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

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

  1. Solving the Fully Fuzzy Bilevel Linear Programming Problem through Deviation Degree Measures and a Ranking Function Method

    Directory of Open Access Journals (Sweden)

    Aihong Ren

    2016-01-01

    Full Text Available This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solution of the problem, we apply deviation degree measures to deal with the fuzzy constraints and use a ranking function method of fuzzy numbers to rank the upper and lower level fuzzy objective functions. Then the fully fuzzy bilevel linear programming problem can be transformed into a deterministic bilevel programming problem. Considering the overall balance between improving objective function values and decreasing allowed deviation degrees, the computational procedure for finding a fuzzy optimal solution is proposed. Finally, a numerical example is provided to illustrate the proposed approach. The results indicate that the proposed approach gives a better optimal solution in comparison with the existing method.

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

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

    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......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...... of enhancements is employed. The problem instance is reduced by variable pegging using a Lagrangean relaxation from which also a flow augmentation scheme is derived. Additionally a reduction in the search space is employed along with a variable transformation which generalizes a transformation known from...

  4. Damage Tolerance Assessment Branch

    Science.gov (United States)

    Walker, James L.

    2013-01-01

    The Damage Tolerance Assessment Branch evaluates the ability of a structure to perform reliably throughout its service life in the presence of a defect, crack, or other form of damage. Such assessment is fundamental to the use of structural materials and requires an integral blend of materials engineering, fracture testing and analysis, and nondestructive evaluation. The vision of the Branch is to increase the safety of manned space flight by improving the fracture control and the associated nondestructive evaluation processes through development and application of standards, guidelines, advanced test and analytical methods. The Branch also strives to assist and solve non-aerospace related NDE and damage tolerance problems, providing consultation, prototyping and inspection services.

  5. On large-scale nonlinear programming techniques for solving optimal control problems

    Energy Technology Data Exchange (ETDEWEB)

    Faco, J.L.D.

    1994-12-31

    The formulation of decision problems by Optimal Control Theory allows the consideration of their dynamic structure and parameters estimation. This paper deals with techniques for choosing directions in the iterative solution of discrete-time optimal control problems. A unified formulation incorporates nonlinear performance criteria and dynamic equations, time delays, bounded state and control variables, free planning horizon and variable initial state vector. In general they are characterized by a large number of variables, mostly when arising from discretization of continuous-time optimal control or calculus of variations problems. In a GRG context the staircase structure of the jacobian matrix of the dynamic equations is exploited in the choice of basic and super basic variables and when changes of basis occur along the process. The search directions of the bound constrained nonlinear programming problem in the reduced space of the super basic variables are computed by large-scale NLP techniques. A modified Polak-Ribiere conjugate gradient method and a limited storage quasi-Newton BFGS method are analyzed and modifications to deal with the bounds on the variables are suggested based on projected gradient devices with specific linesearches. Some practical models are presented for electric generation planning and fishery management, and the application of the code GRECO - Gradient REduit pour la Commande Optimale - is discussed.

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

  7. Solving a bi-objective vehicle routing problem under uncertainty by a revised multi-choice goal programming approach

    Directory of Open Access Journals (Sweden)

    Hossein Yousefi

    2017-06-01

    Full Text Available A vehicle routing problem with time windows (VRPTW is an important problem with many real applications in a transportation problem. The optimum set of routes with the minimum distance and vehicles used is determined to deliver goods from a central depot, using a vehicle with capacity constraint. In the real cases, there are other objective functions that should be considered. This paper considers not only the minimum distance and the number of vehicles used as the objective function, the customer’s satisfaction with the priority of customers is also considered. Additionally, it presents a new model for a bi-objective VRPTW solved by a revised multi-choice goal programming approach, in which the decision maker determines optimistic aspiration levels for each objective function. Two meta-heuristic methods, namely simulated annealing (SA and genetic algorithm (GA, are proposed to solve large-sized problems. Moreover, the experimental design is used to tune the parameters of the proposed algorithms. The presented model is verified by a real-world case study and a number of test problems. The computational results verify the efficiency of the proposed SA and GA.

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

  9. LEVEL: A computer program for solving the radial Schrödinger equation for bound and quasibound levels

    Science.gov (United States)

    Le Roy, Robert J.

    2017-01-01

    This paper describes program LEVEL, which can solve the radial or one-dimensional Schrödinger equation and automatically locate either all of, or a selected number of, the bound and/or quasibound levels of any smooth single- or double-minimum potential, and calculate inertial rotation and centrifugal distortion constants and various expectation values for those levels. It can also calculate Franck-Condon factors and other off-diagonal matrix elements, either between levels of a single potential or between levels of two different potentials. The potential energy function may be defined by any one of a number of analytic functions, or by a set of input potential function values which the code will interpolate over and extrapolate beyond to span the desired range.

  10. A fast and simple program for solving local Schrödinger equations in two and three dimensions

    Science.gov (United States)

    Janecek, S.; Krotscheck, E.

    2008-06-01

    We describe a simple and rapidly converging code for solving local Schrödinger equations in two and three dimensions. Our method utilizes a fourth-order factorization of the imaginary time evolution operator which improves the convergence rate by one to two orders of magnitude compared with a second-order Trotter factorization. We present the theory behind the method and strategies for assessing convergence and accuracy. Our code requires one user defined function which specifies the local external potential. We describe the definition of this function as well as input and output functionalities. Program summaryProgram title: 3dsch/2dsch Catalogue identifier: AEAQ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAQ_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 40 085 No. of bytes in distributed program, including test data, etc.: 285 957 Distribution format: tar.gz Programming language: Fortran 90 Computer: Tested on x86, amd64, Itanium2, and MIPS architectures. Should run on any architecture providing a Fortran 90 compiler Operating system: So far tested under UNIX/Linux and Irix. Any OS with a Fortran 90 compiler available should suffice RAM: 2 MB to 16 GB, depending on system size Classification: 6.10, 7.3 External routines: FFTW3 ( http://www.fftw.org/), Lapack ( http://www.netlib.org/lapack/) Nature of problem: Numerical calculation of low-lying states of 2D and 3D local Schrödinger equations in configuration space. Solution method: 4th order factorization of the diffusion operator. Restrictions: The code is at this time designed for up to 152 states in 3D and for up to 100 states in 2D. This number can easily be increased by generating more trial states in the initialization routine. Additional comments: Sample input files for the 2D and the 3D

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

  12. Maximum-likelihood detection based on branch and bound algorithm for MIMO systems

    Institute of Scientific and Technical Information of China (English)

    LI Zi; CAI YueMing

    2008-01-01

    Maximum likelihood detection for MIMO systems can be formulated as an integer quadratic programming problem. In this paper, we introduce depth-first branch and bound algorithm with variable dichotomy into MIMO detection. More nodes may be pruned with this structure. At each stage of the branch and bound algorithm, active set algorithm is adopted to solve the dual subproblem. In order to reduce the com- plexity further, the Cholesky factorization update is presented to solve the linear system at each iteration of active set algorithm efficiently. By relaxing the pruning conditions, we also present the quasi branch and bound algorithm which imple- ments a good tradeoff between performance and complexity. Numerical results show that the complexity of MIMO detection based on branch and bound algorithm is very low, especially in low SNR and large constellations.

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

  14. The Effect of Montessori Method Supported by Social Skills Training Program on Turkish Kindergarten Children's Skills of Understanding Feelings and Social Problem Solving

    Science.gov (United States)

    Kayili, Gökhan; Ari, Ramazan

    2016-01-01

    The current research was conducted with the purpose of analyzing the effect of Montessori method supported by Social Skills Training Program on kindergarten children's skills of understanding feelings and social problem solving. 53 children attending Ihsan Dogramaci Applied Nursery School affiliated to Selcuk University, Faculty of Health Sciences…

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

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

  17. 基于LINGO的优化问题动态规划法求解%Solving Optimization Problem by Dynamic Programming Method Using LINGO

    Institute of Scientific and Technical Information of China (English)

    度巍; 曾飞

    2014-01-01

    The paper describes the use of LINGO,pointing outing that LINGO can solve dynamic programming problems with-out the objective function.The shortest path problem and lotsizing problem are solved by dynamic programming method, Cor-responding LINGO codes are provided. The teaching of LINGO enhances the students' understanding of the dynamic program-ming while increasing the ability to use optimization software programming to solve the problem.%介绍了LINGO优化软件的使用,指出LINGO在求解动态规划问题时可以不需要目标函数。基于LINGO分别对最短路问题和生产批量计划问题使用动态规划法进行了求解,给出了相应的LINGO求解代码,增强了学生对动态规划法的理解同时提高了使用优化软件编程解决问题的能力。

  18. 利用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.

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

    OpenAIRE

    Zhao, Yingfeng; Liu, Sanyang

    2016-01-01

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

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

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

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

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

    Science.gov (United States)

    Lončar, Vladimir; Young-S., Luis E.; Škrbić, Srdjan; Muruganandam, Paulsamy; Adhikari, Sadhan K.; Balaž, Antun

    2016-12-01

    We present new versions of the previously published C and CUDA programs for solving the dipolar Gross-Pitaevskii equation in one, two, and three spatial dimensions, which calculate stationary and non-stationary solutions by propagation in imaginary or real time. Presented programs are improved and parallelized versions of previous programs, divided into three packages according to the type of parallelization. First package contains improved and threaded version of sequential C programs using OpenMP. Second package additionally parallelizes three-dimensional variants of the OpenMP programs using MPI, allowing them to be run on distributed-memory systems. Finally, previous three-dimensional CUDA-parallelized programs are further parallelized using MPI, similarly as the OpenMP programs. We also present speedup test results obtained using new versions of programs in comparison with the previous sequential C and parallel CUDA programs. The improvements to the sequential version yield a speedup of 1.1-1.9, depending on the program. OpenMP parallelization yields further speedup of 2-12 on a 16-core workstation, while OpenMP/MPI version demonstrates a speedup of 11.5-16.5 on a computer cluster with 32 nodes used. CUDA/MPI version shows a speedup of 9-10 on a computer cluster with 32 nodes.

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

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

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

  7. Multiple Problem-Solving Strategies Provide Insight into Students' Understanding of Open-Ended Linear Programming Problems

    Science.gov (United States)

    Sole, Marla A.

    2016-01-01

    Open-ended questions that can be solved using different strategies help students learn and integrate content, and provide teachers with greater insights into students' unique capabilities and levels of understanding. This article provides a problem that was modified to allow for multiple approaches. Students tended to employ high-powered, complex,…

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

  9. A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives

    NARCIS (Netherlands)

    de Klerk, E.; Sotirov, R.; Truetsch, U.

    2015-01-01

    Recent progress in solving quadratic assignment problems (QAPs) from the QAPLIB (Quadratic Assignment Problem Library) test set has come from mixed-integer linear or quadratic programming models that are solved in a branch-and-bound framework. Semidefinite programming (SDP) bounds for QAPs have also

  10. Algorithm for solving of two-level hierarchical minimax program control problem in discrete-time dynamical system with incomplete information

    Science.gov (United States)

    Shorikov, A. F.

    2016-12-01

    This article discusses the discrete-time dynamical system consisting from two controlled objects and described by a linear recurrent vector equations in the presence of uncertain perturbations. This dynamical system has two levels of a control: dominant level (the first level or the level I) and subordinate level (the second level or the level II) and both have different linear terminal criterions of functioning and united a priori by determined information and control connections. It is assumed that the sets constraining all a priori undefined parameters are known and they are a finite sets or convex, closed and bounded polyhedrons in the corresponding finite-dimensional vector spaces. For the dynamical system in question, we propose a mathematical formalization in the form of solving two-level hierarchical minimax program control problem with incomplete information. In this article for solving of the investigated problem is proposed the algorithm that has a form of a recurrent procedure of solving a linear programming and a finite optimization problems. The results obtained in this article can be used for computer simulation of an actual dynamical processes and for designing controlling and navigation systems.

  11. A new recurrent neural network for solving convex quadratic programming problems with an application to the k-winners-take-all problem.

    Science.gov (United States)

    Hu, Xiaolin; Zhang, Bo

    2009-04-01

    In this paper, a new recurrent neural network is proposed for solving convex quadratic programming (QP) problems. Compared with existing neural networks, the proposed one features global convergence property under weak conditions, low structural complexity, and no calculation of matrix inverse. It serves as a competitive alternative in the neural network family for solving linear or quadratic programming problems. In addition, it is found that by some variable substitution, the proposed network turns out to be an existing model for solving minimax problems. In this sense, it can be also viewed as a special case of the minimax neural network. Based on this scheme, a k-winners-take-all ( k-WTA) network with O(n) complexity is designed, which is characterized by simple structure, global convergence, and capability to deal with some ill cases. Numerical simulations are provided to validate the theoretical results obtained. More importantly, the network design method proposed in this paper has great potential to inspire other competitive inventions along the same line.

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

  13. An overview of solution methods for multi-objective mixed integer linear programming programs

    DEFF Research Database (Denmark)

    Andersen, Kim Allan; Stidsen, Thomas Riis

    Multiple objective mixed integer linear programming (MOMIP) problems are notoriously hard to solve to optimality, i.e. finding the complete set of non-dominated solutions. We will give an overview of existing methods. Among those are interactive methods, the two phases method and enumeration...... methods. In particular we will discuss the existing branch and bound approaches for solving multiple objective integer programming problems. Despite the fact that branch and bound methods has been applied successfully to integer programming problems with one criterion only a few attempts has been made...

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

  15. An improved dual neural network for solving a class of quadratic programming problems and its k-winners-take-all application.

    Science.gov (United States)

    Hu, Xiaolin; Wang, Jun

    2008-12-01

    This paper presents a novel recurrent neural network for solving a class of convex quadratic programming (QP) problems, in which the quadratic term in the objective function is the square of the Euclidean norm of the variable. This special structure leads to a set of simple optimality conditions for the problem, based on which the neural network model is formulated. Compared with existing neural networks for general convex QP, the new model is simpler in structure and easier to implement. The new model can be regarded as an improved version of the dual neural network in the literature. Based on the new model, a simple neural network capable of solving the k-winners-take-all ( k-WTA) problem is formulated. The stability and global convergence of the proposed neural network is proved rigorously and substantiated by simulation results.

  16. Design of planar articulated mechanisms using branch and bound

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Kawamoto, Atsushi

    2005-01-01

    This paper considers an optimization model and a solution method for the design of two-dimensional mechanical mechanisms. The mechanism design problem is modeled as a nonconvex mixed integer program which allows the optimal topology and geometry of the mechanism to be determined simultaneously...... and that buckling is prevented. The feasible set of the design problem is described by nonlinear differentiable and non-differentiable constraints as well as nonlinear matrix inequalities. To solve the mechanism design problem a branch and bound method based on convex relaxations is developed. To guarantee...... mechanism design problems of realistic size to global optimality....

  17. Branch-and-cut-and-price for the traveling salesman problem with time windows

    DEFF Research Database (Denmark)

    Røpke, Stefan; Madsen, Oli B.G.

    distance traveled by the salesman. The TSPTW is formulated as a set-partitioning problem which is solved by using combined cut and column generation. The pricing sub problem in the column generation procedure is a shortest path problem with time window constraints and 2-cycle elimination. A standard column...... paradigms such as branch-and-cut, dynamic programming and constraint programming. We cannot conclude that the branch-and-cut-and-price approach always is superior to the others paradigms, but several instances are reported solved to optimality for the rst time and bounds are strengthened for other, still......In the traveling salesman problem with time windows (TSPTW) one is given a depot and a set of nodes to be visited by a salesman. The salesman starts his trip at the depot and must visit all nodes while respecting time windows at the nodes. The objective of the problem is to minimize the total...

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

  19. ALGORITHM FOR SOLVING EXTREME SCHEDULING PROBLEMS

    OpenAIRE

    Gennady A. Berketov

    2015-01-01

    The article considers the original algorithmfor solving the generalized problem ofscheduling theory, based on the branch and bound method. Task schedulingperform works (operations) and restrictions on resources used often occur with scheduling discrete manufacturing operations, optimizing network implementationschedules of scientific, economic or technical projects. Tools to solve suchproblems are included in the decisionsupport system ACS in many businesses.The effectiveness of the proposed ...

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

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

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

  3. Predictors of body mass index in female parents whose children participate in a competitive, creative, problem-solving program

    Directory of Open Access Journals (Sweden)

    Naima Moustaid-Moussa

    2012-08-01

    Full Text Available Background: Recent findings from our research indicate that children participating in a creative afterschool program exhibit overall healthier lifestyle practices compared to the average US pediatric population. This observation led us to investigate the prevalence of overweight/obesity and lifestyle practices of their parents. Objective: To determine the strongest predictors of weight status for female parents whose children were participating in such creative afterschool program. Design: Surveyed subjects were parents of children who competed in the 2008 and 2009 Destination ImagiNation® Global Finals in Knoxville, Tennessee. A total of 4,608 children participated in data collection, with parental consent. For the combined 2 years, 1,118 parents, 87% of whom were females (n=1,032 completed online questionnaires, which were based on the Behavioral Risk Factor Surveillance System and included self-reported height, weight, dietary intake, physical activity, and socioeconomic status. The majority of this population was white, and less than 5% were African American or Hispanic. Results: We report here results obtained for the female parents. Only 45.2% of these female parents were overweight/obese, compared to a national average of 64.1% reported by the National Health Nutrition Examination Surveys for 2007—2008. Furthermore, this population was significantly more physically active compared to national average. Most parents (76% had completed a college degree and reported high incomes. Parents with the lowest income were the most obese in this population. Finally, we found a significant association between parent and child weight status. Conclusions: These studies demonstrate that female parents of children who have healthy lifestyles were physically active, which likely accounts for the parents’ lower overweight/obesity rates. In addition to physical activity, income and percentage of calories from fat were all predictors of weight status.

  4. 基于Python求解偏微分方程的有限差分法%Python programmed finite difference method for solving partial differential equations

    Institute of Scientific and Technical Information of China (English)

    王登岳; 张宏伟

    2016-01-01

    偏微分方程的求解是很多科学技术问题的关键难点。随着计算机性能的不断提高,数值解法能够解复杂的偏微分方程并将计算结果图形化。相对于昂贵的科学计算软件,Python是一种免费的面向对象、动态的程序设计语言。有限差分法以其概念清晰,方法简单、直观等特点在偏微分方程的求解中得到了广泛的应用。文章对矩形区域的拉普拉斯方程进行数值求解,采用Numpy对有限差分法进行计算,运用Matplotlib绘制等值线,输出迭代次数以及误差。%To solve the partial differential equations (PDE) is a key difficult point in many scientific and technical problems. With the development of computer performance, numeric solution can solve many sophisticated PDE and visualize the numeric results. Rather than the expensive science computing software, Python is a free object-oriented language, dynamic programming language. Finite difference method (FDM) is widely used for its clear, simple and intuitive. Laplace problem in a rectangular area is solved numerically in the article, computed through FDM with the Numpy library, visualized through plotting the contour by the Matplotlib library, and the number of iteration and the error are given.

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

  6. A Parallel and Concurrent Implementation of Lin-Kernighan Heuristic (LKH-2 for Solving Traveling Salesman Problem for Multi-Core Processors using SPC3 Programming Model

    Directory of Open Access Journals (Sweden)

    Muhammad Ali Ismail

    2011-08-01

    Full Text Available With the arrival of multi-cores, every processor has now built-in parallel computational power and that can be fully utilized only if the program in execution is written accordingly. This study is a part of an on-going research for designing of a new parallel programming model for multi-core processors. In this paper we have presented a combined parallel and concurrent implementation of Lin-Kernighan Heuristic (LKH-2 for Solving Travelling Salesman Problem (TSP using a newly developed parallel programming model, SPC3 PM, for general purpose multi-core processors. This implementation is found to be very simple, highly efficient, scalable and less time consuming in compare to the existing LKH-2 serial implementations in multi-core processing environment. We have tested our parallel implementation of LKH-2 with medium and large size TSP instances of TSBLIB. And for all these tests our proposed approach has shown much improved performance and scalability.

  7. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Fukasawa, R.; Longo, H.; Lysgaard, Jens

    2006-01-01

    The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an algorithm that combines both approaches: it works over the intersection of two polytopes, one associated...... with a traditional Lagrangean relaxation over q-routes, the other defined by bound, degree and capacity constraints. This is equivalent to a linear program with exponentially many variables and constraints that can lead to lower bounds that are superior to those given by previous methods. The resulting branch......-and-cut-and-price algorithm can solve to optimality all instances from the literature with up to 135 vertices. This more than doubles the size of the instances that can be consistently solved....

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

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

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

  11. Linear programming methodology for solving trapezoidal fuzzy matrix games%求解梯形模糊矩阵对策的线性规划方法

    Institute of Scientific and Technical Information of China (English)

    杨洁; 李登峰

    2015-01-01

    针对传统模糊支付矩阵对策求解方法不能保证局中人的模糊值始终相同且求解复杂的问题,通过引入��-矩阵对策的概念,提出一种求解支付为梯形模糊数的矩阵对策线性规划方法。该方法中局中人双方的对策值始终相同,且此对策值的任意��-截集的上下界和局中人的最优策略容易通过求解导出的4个线性规划问题获得,特别地,可得到模糊对策值的显式表示。通过与其他方法的比较,表明了所提出的方法更具有效性和实用性。%For the problem of major solution methods for matrix games with fuzzy payoffs, an effective methodology is developed to solve matrix games with payoffs expressed by trapezoidal fuzzy numbers. In this methodology, the concept of��-matrix games is introduced and players’ fuzzy values are always identical. The upper and lower bounds of any��-cut of the fuzzy value and players’ optimal strategies are easily obtained through solving the derived four linear programming problems with the upper and lower bounds of��-cuts of the fuzzy payoffs. Particularly, the fuzzy value can be explicitly estimated. Compared with other methods, the effectiveness and feasibility of the proposed method are illurstrated.

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

  13. Efficient methods for solving discrete topology design problems in the PLATO-N project

    DEFF Research Database (Denmark)

    Canh, Nam Nguyen; Stolpe, Mathias

    This paper considers the general multiple load structural topology design problems in the framework of the PLATO-N project. The problems involve a large number of discrete design variables and were modeled as a non-convex mixed 0–1 program. For the class of problems considered, a global...... optimization method based on the branch-and-cut concept was developed and implemented. In the method a large number of continuous relaxations were solved. We also present an algorithm for generating cuts to strengthen the quality of the relaxations. Several heuristics were also investigated to obtain efficient...... algorithms. The branch and cut method is used to solve benchmark examples which can be used to validate other methods and heuristics....

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

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

  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. Collis-Romberg Mathematical Problem Solving Profiles.

    Science.gov (United States)

    Collis, K. F.; Romberg, T. A.

    Problem solving has become a focus of mathematics programs in Australia in recent years, necessitating the assessment of students' problem-solving abilities. This manual provides a problem-solving assessment and teaching resource package containing four elements: (1) profiles assessment items; (2) profiles diagnostic forms for recording individual…

  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. Branched Polymer Revisited

    CERN Document Server

    Aoki, H; Kawai, H; Kitazawa, Y; Aoki, Hajime; Iso, Satoshi; Kawai, Hikaru; Kitazawa, Yoshihisa

    2000-01-01

    We show that correlation functions for branched polymers correspond to those for $\\phi^3$ theory with a single mass insertion, not those for the $\\phi^3$ theory themselves, as has been widely believed. In particular, the two-point function behaves as 1/p^4, not as 1/p^2. This behavior is consistent with the fact that the Hausdorff dimension of the branched polymer is four.

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

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

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

  4. Branch-and-Cut-and-Price for the Pickup and Delivery Problem with Time Windows

    DEFF Research Database (Denmark)

    Røpke, Stefan; Cordeau, Jean-Francois

    2009-01-01

    -and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear programming relaxation of a set partitioning formulation. Two pricing subproblems are considered in the column generation algorithm: an elementary and a non-elementary shortest path problem. Valid inequalities......In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch...

  5. Variable and Value Ordering When Solving Balanced Academic Curriculum Problems

    OpenAIRE

    Castro, Carlos; Manzano, Sebastian

    2001-01-01

    In this paper we present the use of Constraint Programming for solving balanced academic curriculum problems. We discuss the important role that heuristics play when solving a problem using a constraint-based approach. We also show how constraint solving techniques allow to very efficiently solve combinatorial optimization problems that are too hard for integer programming techniques.

  6. Modeling and Power Flow Analysis for Herringbone Gears Power Dual-Branching Transmission System

    Science.gov (United States)

    Yang, Xiaofang; Zhu, Yanxiang; Fang, Zongde; Gu, Jiangong

    Based on power dual-branching transmission system of herringbone gears, the mechanical structural model was established. This study represented the simplified algorithm to obtain its power flow situations through formulating the deformation compatibility condition for the linear relationship between the torque and transverse deformation of tooth surface and the torque equilibrium condition. Besides, the effects on the power flow of system were calculated under all kinds of the installation error and processing error of gear pairs. Finally, the power flow situations of dual branches were solved via Programming. A numerical example that illustrated the developed theory was provided. The research results can be applied to analyze the actual application of herringbone gears power split-path transmission system.

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

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

  9. Techniques for Solving Sudoku Puzzles

    CERN Document Server

    Chi, Eric C

    2012-01-01

    Solving Sudoku puzzles is one of the most popular pastimes in the world. Puzzles range in difficulty from easy to very challenging; the hardest puzzles tend to have the most empty cells. The current paper compares the performance of three computer algorithms in solving puzzles. Backtracking, simulated annealing, and alternating projections are generic methods for attacking combinatorial optimization problems. Our results favor backtracking. It infallibly solves Sudoku puzzles or deduces that a unique solution does not exist. However, backtracking does not scale well in high-dimensional combinatorial optimization. Hence, it is useful to expose statistics students to the other two solution techniques in a concrete setting. Simulated annealing shares a common structure with MCMC (Markov chain Monte Carlo) and enjoys wide applicability. The method of alternating projections solves the feasibility problem in convex programming. Converting a discrete optimization problem into a continuous optimization problem opens...

  10. 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.......60-1.62). The presence of IRBBB was not associated with any adverse outcome.ConclusionIn this cohort study, RBBB and IRBBB were two to three times more common among men than women. Right bundle branch block was associated with increased cardiovascular risk and all-cause mortality, whereas IRBBB was not. Contrary...

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

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

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

  14. 线性约束非凸二次规划的有限分支定界算法%A Finite Branch-and-bound Algorithm for Non-convex Quadratic Programming with Linear Constraints

    Institute of Scientific and Technical Information of China (English)

    田朝薇; 宋海洲

    2012-01-01

    针对线性约束非凸二次规划问题,从其KKT点出发得到它的一个线性松弛规划,并递归地向该松弛规划中加入原问题的互补松弛条件的线性等式,从而得到一个有限分支定界算法,并对其收敛性进行了证明,经数值实验表明该算法是有效的.%In this paper,we obtain a linear programming relaxation from Karush-Kuhn-Tucker(KKT) point for non-convex quadratic programming with linear constraints.Thus we propose a finite branch-and-bound algorithm by adding recursively the linear equations of the complementarity constraints of the primal problem to the relaxation programming.Therefore,the convergence of the algorithm is proved and the numerical computations show that the proposed algorithm is effective.

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

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

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

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

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

  20. A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles

    Directory of Open Access Journals (Sweden)

    İsmail Karaoğlan

    2015-06-01

    Full Text Available This paper addresses the vehicle routing problem with multiple use of vehicles (VRPMUV, an important variant of the classic vehicle routing problem (VRP. Unlike the classical VRP, vehicles are allowed to use more than one route in the VRPMUV. We propose a branch-and-cut algorithm for solving the VRPMUV. The proposed algorithm includes several valid inequalities from the literature for the purpose of improving its lower bounds, and a heuristic algorithm based on simulated annealing and a mixed integer programming-based intensification procedure for obtaining the upper bounds. The algorithm is evaluated in terms of the test problems derived from the literature. The computational results which follow show that, if there were 120 customers on the route (in the simulation, the problem would be solved optimally in a reasonable amount of time.

  1. Bi-objective branch-and-cut algorithms

    DEFF Research Database (Denmark)

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

    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...... bound sets that prevents us from solving the bi-objective LP-relaxation of each branching node. To strengthen the lower bound sets, we propose a bi-objective cutting plane algorithm that dynamically adjusts the weights of the objective functions such that different parts of the feasible set...

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

  3. A branch-and-bound methodology within algebraic modelling systems

    NARCIS (Netherlands)

    Bisschop, J.J.; Heerink, J.B.J.; Kloosterman, G.

    1998-01-01

    Through the use of application-specific branch-and-bound directives it is possible to find solutions to combinatorial models that would otherwise be difficult or impossible to find by just using generic branch-and-bound techniques within the framework of mathematical programming. {\\sc Minto} is an e

  4. An Experimental Evaluation of Programed Instruction as One of Two Review Techniques for Two-Year College Students Concerned with Solving Acid-Base Chemical Equilibrium Problems.

    Science.gov (United States)

    Sharon, Jared Bear

    The major purpose of this study was to design and evaluate a programed instructional unit for a first year college chemistry course. The topic of the unit was the categorization and solution of acid-base equilibria problems. The experimental programed instruction text was used by 41 students and the fifth edition of Schaum's Theory and Problems of…

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

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

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

  8. Critical branching neural networks.

    Science.gov (United States)

    Kello, Christopher T

    2013-01-01

    It is now well-established that intrinsic variations in human neural and behavioral activity tend to exhibit scaling laws in their fluctuations and distributions. The meaning of these scaling laws is an ongoing matter of debate between isolable causes versus pervasive causes. A spiking neural network model is presented that self-tunes to critical branching and, in doing so, simulates observed scaling laws as pervasive to neural and behavioral activity. These scaling laws are related to neural and cognitive functions, in that critical branching is shown to yield spiking activity with maximal memory and encoding capacities when analyzed using reservoir computing techniques. The model is also shown to account for findings of pervasive 1/f scaling in speech and cued response behaviors that are difficult to explain by isolable causes. Issues and questions raised by the model and its results are discussed from the perspectives of physics, neuroscience, computer and information sciences, and psychological and cognitive sciences.

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

  10. Generalized Markov branching models

    OpenAIRE

    Li, Junping

    2005-01-01

    In this thesis, we first considered a modified Markov branching process incorporating both state-independent immigration and resurrection. After establishing the criteria for regularity and uniqueness, explicit expressions for the extinction probability and mean extinction time are presented. The criteria for recurrence and ergodicity are also established. In addition, an explicit expression for the equilibrium distribution is presented.\\ud \\ud We then moved on to investigate the basic proper...

  11. Generalized Markov branching models

    OpenAIRE

    Li, Junping

    2005-01-01

    In this thesis, we first considered a modified Markov branching process incorporating both state-independent immigration and resurrection. After establishing the criteria for regularity and uniqueness, explicit expressions for the extinction probability and mean extinction time are presented. The criteria for recurrence and ergodicity are also established. In addition, an explicit expression for the equilibrium distribution is presented. We then moved on to investigate the basic proper...

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

  13. Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem

    DEFF Research Database (Denmark)

    Gamst, Mette; Petersen, Bjørn

    2012-01-01

    -Protocol Label Switching. The problem has previously been solved to optimality through branch-and-price. In this paper we propose two exact solution methods both based on an alternative decomposition. The two methods differ in their branching strategy. The first method, which branches on forbidden edge sequences...

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

  15. Cookie branching random walks

    CERN Document Server

    Bartsch, Christian; Kochler, Thomas; Müller, Sebastian; Popov, Serguei

    2011-01-01

    We consider a branching random walk on $\\Z$, where the particles behave differently in visited and unvisited sites. Informally, each site on the positive half-line contains initially a cookie. On the first visit of a site its cookie is removed and particles at positions with a cookie reproduce and move differently from particles on sites without cookies. Therefore, the movement and the reproduction of the particles depend on the previous behaviour of the population of particles. We study the question if the process is recurrent or transient, i.e., whether infinitely many particles visit the origin or not.

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

  17. A Computer-Assisted Instructional Software Program in Mathematical Problem-Solving Skills for Medication Administration for Beginning Baccalaureate Nursing Students at San Jose State University.

    Science.gov (United States)

    Wahl, Sharon C.

    Nursing educators and administrators are concerned about medication errors made by students which jeopardize patient safety. The inability to conceptualize and calculate medication dosages, often related to math anxiety, is implicated in such errors. A computer-assisted instruction (CAI) program is seen as a viable method of allowing students to…

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

  19. 约束条件含模糊数的线性规划的一种求解方法%A method for solving linear programming with fuzzy numbers in restricted condition

    Institute of Scientific and Technical Information of China (English)

    朱志平; 曹炳元

    2012-01-01

    讨论了约束条件中系数是模糊数的模糊线性规划的一种解法,利用Roubens的模糊数比较的概念,把系数是模糊数的线性规划问题转化为经典的线性规划问题,从而利用求解线性规划的单纯形法求解此类模糊线性规划.最后给出此种方法在实际中的应用.%This paper discusses a method for fuzzy linear programming with fuzzy numbers in restricted condi- tion. By utilizing comparison of fuzzy numbers by Rouben' s method, fuzzy linear programming with fuzzy num- bers in restricted condition is reduced to a classical linear programming problems. By using the method for sol- ving linear programming, we can solve fuzzy linear programming with fuzzy numbers in restricted condition. At last, the application of this method is given.

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

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

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

  3. Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers

    OpenAIRE

    Liang, Jia Hui; Ganesh, Vijay; Zulkoski, Ed; Zaman, Atulan; Czarnecki, Krzysztof

    2015-01-01

    Conflict-Driven Clause-Learning SAT solvers crucially depend on the Variable State Independent Decaying Sum (VSIDS) branching heuristic for their performance. Although VSIDS was proposed nearly fifteen years ago, and many other branching heuristics for SAT solving have since been proposed, VSIDS remains one of the most effective branching heuristics. In this paper, we advance our understanding of VSIDS by answering the following key questions. The first question we pose is "what is special ab...

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

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

  6. 求解二层规划的一种模糊交互式方法%A Fuzzy Interactive Approach for Solving Bilevel Programming

    Institute of Scientific and Technical Information of China (English)

    何炬林; 万仲平; 王广民; 吕一兵

    2006-01-01

    In this paper, we focus on bilevel programming problem with a common decision variable in the upper level and lower level programming. After introducing fuzzy goals for objective functions, a fuzzy interactive decision making methed is presented to derive a satisfactory solution for decision makers by consulting the ratios of satisfaction between the leader at the upper level and the follower at the lower level. A numerical exampleillustrates the proposed method.%主要讨论上下层具有共同决策变量的一类二层规划问题的求解方法.在引入目标函数的模糊目标,并充分考虑上层与下层决策者的满意度后,构造了一个模糊交互式决策方法,从而使得上下层决策者对最后的求解结果都能满意.数值结果表明此法可行有效.

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

  8. Method for solving fuzzy linear programming with intuitionistic fuzzy elastic constraints%含直觉模糊弹性约束的模糊线性规划求解

    Institute of Scientific and Technical Information of China (English)

    刘云志; 郭嗣琮

    2013-01-01

    In this paper,a class of new fuzzy linear programming problem with intuitionistic fuzzy elastic constraints is constructed and discussed based on the fuzzy structured element method.By introducing the basic principle of the weighted characteristic number (WCN),the authors define an order relation and expand the Verdegay's method of the fuzzy linear programming.Then,the authors transform the new fuzzy linear programming problem into two equivalent and clear linear programming models with parameter constrains.The compared optimal feasible solution of the two equivalent and clear linear programming models is given.Finally,the authors give a numerical example to illustrate the general method for solving the proposed fuzzy linear programming problem.%本文基于模糊结构元方法构建并讨论了一类含有直觉模糊弹性约束的新型模糊线性规划问题.通过引入模糊数的加权特征数,定义了一种序关系并拓展了Verdegay的模糊线性规划方法,将新型模糊线性规划问题转化成两个等价的含参数约束条件的清晰线性规划模型,给出了此类线性规划模型对比最优可行解的求法.最后通过一个数值实例来说明此类问题的一般求解方法.

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

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

  11. 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的模糊线性规划方法及模糊数的加权特征数将此类多目标模糊线性规划问题转化成一类含参数约束条件的清晰多目标线性规划模型,并应用一种基于线性加权函数的规划算法求其α-拟最优可行解.最后,给出了一个数值实例来说明如何求解此类多目标模糊线性规划问题.

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

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

  14. 求解一类新的二次规划问题的时滞投影神经网络方法%A Delayed Projection Neural Network for Solving a New Quadratic Programming Problems

    Institute of Scientific and Technical Information of China (English)

    刘德友; 牛九肖

    2013-01-01

    把Q为正定矩阵或半正定矩阵推广到Q为亚正定矩阵,利用时滞投影神经网络模型和李亚普诺夫函数的特性,给出判断这种特殊二次优化最优解的充分条件.最后通过数值仿真说明了该网络的有效性.%In this paper, we studied the stability of the optimal solution of a new quadratic programming problem which is the promotion of the convex quadratic programming. We give the sufficient condition to determine the stability of the e-quilibrium point and propose a delayed projection neural network to solve this quadratic programming. By constructing a suitable Lyapunov function, the proposed neural network is proved to be globally stable. Simulation results with some applications show the efficient of the proposed neural network.

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

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

  17. Applying Lakatos' Theory to the Theory of Mathematical Problem Solving.

    Science.gov (United States)

    Nunokawa, Kazuhiko

    1996-01-01

    The relation between Lakatos' theory and issues in mathematics education, especially mathematical problem solving, is investigated by examining Lakatos' methodology of a scientific research program. (AIM)

  18. Solving tooth sensitivity.

    Science.gov (United States)

    Miller, Michael B

    2010-01-01

    Solving tooth sensitivity requires both you and the patients to be resilient and to understand that if one approach doesn't work, you can try another one that is non-invasive or, at worst, minimally invasive. Much like the clinician who posted the original question, I strongly believe that it is our responsibility to convince patients that jumping to a radical solution could be totally unnecessary--and expensive-- and still might not solve the problem.

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

  20. An investigation on solving cooperative problem solving

    Directory of Open Access Journals (Sweden)

    Masoumeh Sadat Abtahi

    2014-03-01

    Full Text Available One of the most important techniques to improve teaching skills is to use cooperative problem solving (CPS approach. Implementing CPS techniques in elementary schools helps us train more creative generations. This paper presents an empirical investigation to find out how much elementary teachers use CPS techniques at different schools located in city of Zanjan, Iran. The study designs a questionnaire and distributes it among 90 volunteers out of 120 teachers who were enrolled in elementary schools. The study analyzes the data using some basic statistics and the result indicates that teachers maintain an average CPS score of 39.37, which is well above the average level. The study provides some guidelines for exploring teachers CPS’s capabilities.

  1. Systems Training for Emotional Predictability and Problem Solving (STEPPS): program efficacy and personality features as predictors of drop-out -- an Italian study.

    Science.gov (United States)

    Alesiani, Roberta; Boccalon, Silvia; Giarolli, Laura; Blum, Nancee; Fossati, Andrea

    2014-05-01

    In this study we present a clinical application of the STEPPS model in an Italian sample of severely affected patients with borderline personality disorder (BPD) or personality disorder (PD) with prominent borderline features in comorbidity with a mood disorder. The aims of this work are: 1) to confirm our preliminary results in a larger sample and at a 12-month follow-up, and 2) to identify predictors of drop-out vs completion of STEPPS in order to understand which characteristics of patients make them suitable or not for this treatment. The sample is composed of 32 subjects recruited from a population of inpatients of the Mood Disorders Center, Department of Clinical Neurosciences, Hospital San Raffaele-Turro, Milan. To confirm STEPPS efficacy at 12-month follow-up, we selected the following outcome criteria: reduction in the number of hospitalizations related to self-harm acts; reduction in the number of suicidal attempts; reduction of perceived emotional intensity levels; changes in cognitive filter scores; changes in the scores on self-report questionnaires. To identify predictors of drop-out vs completion, we analysed the following variables: demographic features (sex, marital status, school level achieved, and job status); Axis-I diagnosis; Axis-II categorical and dimensional diagnosis; and personality features. Seventeen (53%) subjects completed the treatment successfully. The drop-out rate was 47%. Patients who completed the program show a significant decrease in the number of hospitalizations, both at the end of the treatment and at 12-month follow-up. Friedman ANOVA test shows a significant decrease in suicidal attempts during and after STEPPS, and at 12-month follow-up. Analysis of drop-outs showed no significant differences with regard to sex, marital status, school level and job status between the two groups. Axis-I and Axis-II categorical diagnoses did not discriminate between the two groups. Those patients who dropped differ significantly from

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

  3. SVM for Solving Forward Problems of EIT.

    Science.gov (United States)

    Wu, Youxi; Li, Ying; Guo, Lei; Yan, Weili; Shen, Xueqin; Fu, Kun

    2005-01-01

    Support Vector Machine (SVM) can be seen as a new machine learning way which is based on the idea of VC dimensions and the principle of structural risk minimization rather than empirical risk minimization. SVM can be used for classification and regression. Support Vector Regression (SVR) is a very important branch of Support Vector Machine. Partial Differential Equations (PDEs) have been successfully treated by using SVR in previous works. The forward problems of EIT are the basis of EIT inverse problems. The forward problem's essence is to solve PDEs. The method has been successfully tested on the forward problems of EIT and has yielded accurate results.

  4. On the Optimization and Parallelizing Little Algorithm for Solving the Traveling Salesman Problem

    Directory of Open Access Journals (Sweden)

    V. V. Vasilchikov

    2016-01-01

    Full Text Available The paper describes some ways to accelerate solving the NP-complete Traveling Salesman Problem. The classic Little algorithm belonging to the category of ”branch and bound methods” can solve it both for directed and undirected graphs. However, for undirected graphs its operation can be accelerated by eliminating the consideration of branches examined earlier. The paper proposes changes to be made in the key operations of the algorithm to speed up its execution. It also describes the results of an experiment that demonstrated a significant acceleration of solving the problem by using an advanced algorithm. Another way to speed up the work is to parallelize the algorithm. For problems of this kind it is difficult to break the task into a sufficient number of subtasks having comparable complexity. Their parallelism arises dynamically during the execution. For such problems, it seems reasonable to use parallel-recursive algorithms. In our case the use of the library RPM ParLib developed by the author was a good choice. It allows us to develop effective applications for parallel computing on a local network using any .NET-compatible programming language. We used C# to develop the programs. Parallel applications were developed as for basic and modified algorithms, the comparing of their speed was made. Experiments were performed for the graphs with the number of vertexes up to 45 and with the number of network computers up to 16. We also investigated the acceleration that can be achieved by parallelizing the basic Little algorithm for directed graphs. The results of these experiments are also presented in the paper. 

  5. Solving recurrence relations supported by Wolfram Mathematica

    Directory of Open Access Journals (Sweden)

    Enrique Vílchez-Quesada

    2015-01-01

    Full Text Available This paper introduces some algorithms for solving linear relationships, homogeneous and non-homogeneous recurrence with constant and non-constant coefficients, using software as the main resource in solving processes. The Mathematica commercial application has provided the technical support necessary for the implementation of the methods used. It also presents other examples of recurrence relations, showing the effectiveness and limitations of the algorithms created by the author and programmed in Mathematica environment that provides.

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

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

  8. Scaling Behaviors of Branched Polymers

    CERN Document Server

    Aoki, H; Kawai, H; Kitazawa, Y; Aoki, Hajime; Iso, Satoshi; Kawai, Hikaru; Kitazawa, Yoshihisa

    2000-01-01

    We study the thermodynamic behavior of branched polymers. We first study random walks in order to clarify the thermodynamic relation between the canonical ensemble and the grand canonical ensemble. We then show that correlation functions for branched polymers are given by those for $\\phi^3$ theory with a single mass insertion, not those for the $\\phi^3$ theory themselves. In particular, the two-point function behaves as $1/p^4$, not as $1/p^2$, in the scaling region. This behavior is consistent with the fact that the Hausdorff dimension of the branched polymer is four.

  9. 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...... methods that combine constraints with logic grammars such as Definite Clause Grammars and CHR Grammars, and show also a direct relationship to abductive reasoning....

  10. 等式约束凸二次规划解析的新型神经网络方法%Method of new neural network for solving convex quadratic programming with equality constraints

    Institute of Scientific and Technical Information of China (English)

    易称福; 陈宇环; 张小红

    2011-01-01

    针对不同于传统基于梯度法的递归神经网络定义一种基于标量范数取值的非负能量函数,通过定义一种基于向量取值的不定无界的误差函数,构建了一种能实时求解具有线性等式约束的凸二次规划问题.基于Simulink仿真平台的计算机实验结果表明,该新型神经网络模型能够准确有效地求解此类二次规划问题.%Differing from the conventional gradient-based recurrent neural networks, which associated with scalar-valued norm-based nonnegative energy function, by defining an indefinite error function based on the vector-valued, presented a new neural network for the online solution of the convex quadratic programming problem with equality constrains. Computer simulation results based on the Simulink show that the new neural networks can solve such quadratic programming with effectiveness and accuracy.

  11. Parallel Branch-and-Bound Methods for the Job Shop Scheduling

    DEFF Research Database (Denmark)

    Clausen, Jens; Perregaard, Michael

    1998-01-01

    Job-shop scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been branch-and-bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions...... for the JSS problem, but with limited success. Even with recent methods, it is still not possible to solve problems substantially larger than 10 machines and 10 jobs. In the current study, we focus on parallel methods for solving JSS problems. We implement two different parallel branch-and-bound algorithms...

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

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

  14. Novel side branch ostial stent.

    Science.gov (United States)

    Chen, Shao-Liang; Lv, Shu-Zheng; Kwan, Tak W

    2009-04-01

    Bifurcation lesions are technically challenging and plagued by a high incidence of restenosis, especially at the side branch orifice, which results in a more frequent need for revascularization during the follow-up period. This report discusses two clinical experiences with a novel side branch ostial stent, the BIGUARD stent, designed for the treatment of bifurcation lesions; procedural success with no in-hospital complications was observed in types IVb and Ia lesions.

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

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

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

  18. Problem Solving Techniques Seminar.

    Science.gov (United States)

    Massachusetts Career Development Inst., Springfield.

    This booklet is one of six texts from a workplace literacy curriculum designed to assist learners in facing the increased demands of the workplace. Six problem-solving techniques are developed in the booklet to assist individuals and groups in making better decisions: problem identification, data gathering, data analysis, solution analysis,…

  19. Solving Problems through Circles

    Science.gov (United States)

    Grahamslaw, Laura; Henson, Lisa H.

    2015-01-01

    Several problem-solving interventions that utilise a "circle" approach have been applied within the field of educational psychology, for example, Circle Time, Circle of Friends, Sharing Circles, Circle of Adults and Solution Circles. This research explored two interventions, Solution Circles and Circle of Adults, and used thematic…

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

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

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

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

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

  5. A New Approach: Computer-Assisted Problem-Solving Systems

    Science.gov (United States)

    Gok, Tolga

    2010-01-01

    Computer-assisted problem solving systems are rapidly growing in educational use and with the advent of the Internet. These systems allow students to do their homework and solve problems online with the help of programs like Blackboard, WebAssign and LON-CAPA program etc. There are benefits and drawbacks of these systems. In this study, the…

  6. Appreciative Problem Solving

    DEFF Research Database (Denmark)

    Hansen, David

    2012-01-01

    employee strengths in continuou simprovements of the work system. The research question was: “How can Lean problem solving and Appreciative Inquiry be combined for optimized work system innovation?” The research project was carried out as a co-creation process with close cooperation between researcher......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...... 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. 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.

  8. Appreciative Problem Solving

    OpenAIRE

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

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

  10. Creativity and Problem Solving

    DEFF Research Database (Denmark)

    Vidal, Rene Victor Valqui

    2004-01-01

    This paper presents some modern and interdisciplinary concepts about creativity and creative processes of special relevance for Operational Research workers. Central publications in the area Creativity-Operational Research are shortly reviewed. Some creative tools and the Creative Problem Solving...... approach are also discussed. Finally, some applications of these concepts and tools are outlined. Some central references are presented for further study of themes related to creativity or creative tools....

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

  12. 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.%为了减少有限推力作用下月球探测器软着陆所需的燃料消耗,提出了应用非线性规划方法来求解该最优控制问题。首先,将有限推力作用下月球软着陆问题转化为数学上的两点边值问题;在考虑边界条件的前提下,利用拉格朗日原理将该两点边值问题转化为针对控制变量的优化问题;然后应用非线性规划方法求解所形成的参数优化问题。实验仿真结果显示,该方法能够成功实现月面软着陆,表明提出的设计方法简单有效。

  13. Bifurcation method for solving multiple positive solutions to Henon equation

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Three algorithms based on the bifurcation method are applied to solving the D4 symmetric positive solutions to the boundary value problem of Henon equation. Taking r in Henon equation as a bi- furcation parameter, the D4-Σd(D4-Σ1, D4-Σ2) symmetry-breaking bifurcation points on the branch of the D4 symmetric positive solutions are found via the extended systems. Finally, Σd(Σ1, Σ2) sym- metric positive solutions are computed by the branch switching method based on the Liapunov-Schmidt reduction.

  14. 求解一类半无限多目标规划的神经网络算法%A Neural Network for Solving a Class of Semi-infinite Multiple Objective Programming

    Institute of Scientific and Technical Information of China (English)

    杨红梅

    2011-01-01

    考虑了一类半无限多目标规划问题.根据极大熵方法,先将其转化为半无限单目标可微凸优化问题.再由原问题和对偶问题之间的关系,提出了求解它的能量函数和神经网络模型,并证明该神经网络模型的解是一致渐近稳定的.该模型结构简单,规模小.%Considering a class of semi-infinite multiple objective programming problem, it bases on the maximum entropy method. It translates into semi-infinite differentiable convex optimization problem. Then according to the relationship between original problem and dual problem, energy function and neural network model are proposed to solve it, and proved that the solution of neural network model is uniformly asymptotically stable. The model is simple and small.

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

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

  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. 30 CFR 56.6403 - Branch circuits.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Branch circuits. 56.6403 Section 56.6403... Blasting § 56.6403 Branch circuits. (a) If electric blasting includes the use of branch circuits, each branch shall be equipped with a safety switch or equivalent method to isolate the circuits to be used....

  19. 30 CFR 57.6403 - Branch circuits.

    Science.gov (United States)

    2010-07-01

    ... 30 Mineral Resources 1 2010-07-01 2010-07-01 false Branch circuits. 57.6403 Section 57.6403... Blasting-Surface and Underground § 57.6403 Branch circuits. (a) If electric blasting includes the use of branch circuits, each branch shall be equipped with a safety switch or equivalent method to isolate...

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

  1. Planning and Problem Solving

    Science.gov (United States)

    1982-10-01

    Artificial Intelig ~ence (Vol. III, edited by Paul R. Cohen and’ Edward A.. Feigenbaum)’, The chapter was written B’ Paul Cohen, with contributions... Artificial Intelligence (Vol. III, edited by Paul R. Cohen and EdWard A. Feigenbaum). The chapter was written by Paul R. Cohen, with contributions by Stephen...Wheevoats"EntermdI’ Planning and Problem ’Solving by Paul R. Cohen Chaptb-rXV-of Volumec III’of the Handbook of Artificial Intelligence edited by Paul R

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

  3. Branch dependent shear coefficients and their influence on the free vibration of Mindlin plates

    Science.gov (United States)

    Lakawicz, Joseph M.; Bottega, William J.

    2017-02-01

    The effect of the shear correction coefficient on the branches of the frequency spectrum for the free vibrations of Mindlin plates is studied. Each of the three branches of the frequency spectrum for the Mindlin plate is associated with its corresponding branch of the frequency spectrum of the infinite elastodynamic plate through direct comparison. The use of branch dependent shear correction coefficients is proposed, and is utilized to bring each of the three branches of the Mindlin plate into best agreement with their corresponding elastodynamic branches. Conclusions with respect to the accuracy and range of applicability of the Mindlin frequency spectrum are drawn, with emphasis on the second flexural (Mindlin w2) frequency branch. For the plate that is simply-supported on all of its edges, each of the three frequency branches contributes to the motion of the plate independently of the other two branches. Hence, only one of the branches is active for a given vibration mode, which allows one to solve for unique natural frequencies for each of the branches and to quantify their accuracy as well as to study the motion of each branch separately. This is not, however, the case for plates with other support conditions. In these cases, the vibrational motion corresponding to each of the branches of the frequency spectrum contributes to a given vibration mode. This, in turn, alters the implementation of Mindlin theory for these plates. Results for natural frequency predictions are compared to those of other studies in the literature as well as to those of the classical case when a single shear correction coefficient is employed. It is shown that natural frequency predictions are improved for the plate with all of its edges simply-supported, while the accuracy of the mode shape is improved for other boundary conditions.

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

  5. Linear and Branching Formats in Culture Assimilator Training

    Science.gov (United States)

    Malpass, Roy S.; Salancik, Gerald R.

    1977-01-01

    Defines the "branching format" of training materials as materials not requiring an absolute judgement of appropriateness of alternatives and the "linear format" as materials requiring an independent evaluation of each alternative. Tests these contrasting formats for effectiveness in cross cultural training programs. Available from: International…

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

  7. On the Branch and Cut Method for Multidimentional Mixed Integer Knapsack Problem

    OpenAIRE

    Mostafa Khorramizadeh; Zahra Rakhshandehroo

    2014-01-01

    In this paper, we examine the effect of the feasibility pump (FP) method on the branch and cut method for solving the multidimentional mixed integer knapsack problem. The feasibility pump is a heuristic method, trying to compute a feasible solution for mixed integer pro- gramming problems. Moreover, we consider two efficient strategies for using the feasibility pump in a branch and cut method and present some tables of numerical results, concerning the application and comparison of using thes...

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

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

  10. Strigolactone inhibition of shoot branching

    NARCIS (Netherlands)

    Gomez-Roldan, M.V.; Fermas, S.; Brewer, P.B.; Puech-Pages, V.; Dun, E.A.; Pillot, J.P.; Letisse, F.; Matusova, R.; Danoun, S.; Portais, J.C.; Bouwmeester, H.J.; Becard, G.; Beveridge, C.A.; Rameau, C.; Rochange, S.F.

    2008-01-01

    A carotenoid-derived hormonal signal that inhibits shoot branching in plants has long escaped identification. Strigolactones are compounds thought to be derived from carotenoids and are known to trigger the germination of parasitic plant seeds and stimulate symbiotic fungi. Here we present evidence

  11. Cash efficiency for bank branches.

    Science.gov (United States)

    Cabello, Julia García

    2013-01-01

    Bank liquidity management has become a major issue during the financial crisis as liquidity shortages have intensified and have put pressure on banks to diversity and improve their liquidity sources. While a significant strand of the literature concentrates on wholesale liquidity generation and on the alternative to deposit funding, the management of an inventory of cash holdings within the banks' branches is also a relevant issue as any significant improvement in cash management at the bank distribution channels may have a positive effect in reducing liquidity tensions. In this paper, we propose a simple programme of cash efficiency for the banks' branches, very easy to implement, which conform to a set of instructions to be imposed from the bank to their branches. This model proves to significantly reduce cash holdings at branches thereby providing efficiency improvements in liquidity management. The methodology we propose is based on the definition of some stochastic processes combined with renewal processes, which capture the random elements of the cash flow, before applying suitable optimization programmes to all the costs involved in cash movements. The classical issue of the Transaction Demand for the Cash and some aspects of Inventory Theory are also present. Mathematics Subject Classification (2000) C02, C60, E50.

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

  13. A second-order Mehrotra-type predictor-corrector algorithm for solving convex quadratic programming%求解凸二次规划的一种二阶Mehrotra型预估-校正算法

    Institute of Scientific and Technical Information of China (English)

    胡强; 张明望; 李卫滑

    2011-01-01

    A second-order Mehrotra-type predictor-corrector algorithm for solving convex quadratic programming is presented. Based on the work of Salahi et al., a safe strategy is introduced in the algorithm, which guarantees a positive desirable lower bound for the maximum feasible step in the corrector step and subsequently polynomial complexity.Since the search directions of the algorithm are not orthogonal, the way of computing the barrier parameter, as well as the complexity analysis is different from that in the linear case. Finally, through some technical lemmas, it is shown that the iteration complexity of the algorithm is O( n3/2 log (x0)TS0/ε ) in the worst case.%给出了求解凸二次规划的一种二阶Mehrotra型预估-校正算法.该算法受Salahi等人对线性规划提出的相应算法启发,引入了安全步策略,保证了校正步步长有适当下界,从而具有多项式复杂性.由于算法迭代方向不正交,算法在罚参数的校正和复杂性的分析上有别于线性规划的情形.最后,通过一些新的技术性引理,证明了算法在最坏情况下的迭代复杂性为O(n3/2log(x0)TS0/ε).

  14. On the Applicability of Lower Bounds for Solving Rectilinear

    DEFF Research Database (Denmark)

    Clausen, Jens; Karisch, Stefan E.; Perregaard, M.;

    1998-01-01

    The quadratic assignment problem (QAP) belongs to the hard core of NP-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not sufficient....... Recently, lower bounds based on decomposition were proposed for the so called rectilinear QAP that proved to be the strongest for a large class of problem instances. We investigate the strength of these bounds when applied not only at the root node of a search tree but as the bound function used...... in a Branch-and-Bound code solving large scale QAPs....

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

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

  17. Solved problems in electromagnetics

    CERN Document Server

    Salazar Bloise, Félix; Bayón Rojo, Ana; Gascón Latasa, Francisco

    2017-01-01

    This book presents the fundamental concepts of electromagnetism through problems with a brief theoretical introduction at the beginning of each chapter. The present book has a strong  didactic character. It explains all the mathematical steps and the theoretical concepts connected with the development of the problem. It guides the reader to understand the employed procedures to learn to solve the exercises independently. The exercises are structured in a similar way: The chapters begin with easy problems increasing progressively in the level of difficulty. This book is written for students of physics and engineering in the framework of the new European Plans of Study for Bachelor and Master and also for tutors and lecturers. .

  18. Development of generic Windows application for solving the tasks of the theory of graphs on design documentation stage

    Directory of Open Access Journals (Sweden)

    Klashanov Fedor Konstantinovich

    Full Text Available The discrete analysis methods, in particular the theory of graphs, are widely recognized as a tool for building mathematical model, including in construction. In the process of design documentation formation there always appears the necessity to plan project networks. At the present moment there is no reasonable generic program, which helps the designer to rapidly solve this task. The authors present the possibilities of using the generic program for Windows developed by them. The program allows solving key tasks of the theory of graphs. These tasks include the search (calculation of the critical (project network planning or optimal (resources delivery variant path in the graph. The process (user interface of graph formation corresponding to the target network in frames of the program is described. On the stage of construction project development there always appears a task of visual image of workflow process as a graph. So the project network is an image of an object erection. At that the events are depicted as rings, and works - as branches (arrows. The general view of the dialog box with the description of the possibilities of editing (adding and deleting vertexes and edges, saving the document, reading the document from file as well as optimal and critical paths are presented.

  19. Faster Algorithms on Branch and Clique Decompositions

    Science.gov (United States)

    Bodlaender, Hans L.; van Leeuwen, Erik Jan; van Rooij, Johan M. M.; Vatshelle, Martin

    We combine two techniques recently introduced to obtain faster dynamic programming algorithms for optimization problems on graph decompositions. The unification of generalized fast subset convolution and fast matrix multiplication yields significant improvements to the running time of previous algorithms for several optimization problems. As an example, we give an O^{*}(3^{ω/2k}) time algorithm for Minimum Dominating Set on graphs of branchwidth k, improving on the previous O *(4 k ) algorithm. Here ω is the exponent in the running time of the best matrix multiplication algorithm (currently ω< 2.376). For graphs of cliquewidth k, we improve from O *(8 k ) to O *(4 k ). We also obtain an algorithm for counting the number of perfect matchings of a graph, given a branch decomposition of width k, that runs in time O^{*}(2^{ω/2k}). Generalizing these approaches, we obtain faster algorithms for all so-called [ρ,σ]-domination problems on branch decompositions if ρ and σ are finite or cofinite. The algorithms presented in this paper either attain or are very close to natural lower bounds for these problems.

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

  1. 12 CFR 211.4 - Permissible activities and investments of foreign branches of member banks.

    Science.gov (United States)

    2010-01-01

    ... foreign branches of member banks. 211.4 Section 211.4 Banks and Banking FEDERAL RESERVE SYSTEM BOARD OF... powers, and to the extent consistent with its charter, a foreign branch of a member bank may engage in... been improved; (5) Insurance. Act as insurance agent or broker; (6) Employee benefits program. Pay...

  2. Local Strategy Improvement for Parity Game Solving

    Directory of Open Access Journals (Sweden)

    Oliver Friedmann

    2010-06-01

    Full Text Available The problem of solving a parity game is at the core of many problems in model checking, satisfiability checking and program synthesis. Some of the best algorithms for solving parity game are strategy improvement algorithms. These are global in nature since they require the entire parity game to be present at the beginning. This is a distinct disadvantage because in many applications one only needs to know which winning region a particular node belongs to, and a witnessing winning strategy may cover only a fractional part of the entire game graph. We present a local strategy improvement algorithm which explores the game graph on-the-fly whilst performing the improvement steps. We also compare it empirically with existing global strategy improvement algorithms and the currently only other local algorithm for solving parity games. It turns out that local strategy improvement can outperform these others by several orders of magnitude.

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

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

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

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

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

  11. (Eds.). Resource-bounded problem solving (Dagstuhl Seminar 14341)

    NARCIS (Netherlands)

    Haxhimusa, Y.; Rooij, I.J.E.I. van; Varma, S.; Wareham, H.T.

    2014-01-01

    This report documents the program and the outcomes of Dagstuhl Seminar 14341 'Resource-bounded Problem Solving'. This seminar is a successor to Dagstuhl Seminar 11351: 'Computer Science & Problem Solving: New Foundations', held in August 2011, which was the first Dagstuhl event to bring together com

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

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

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

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

  17. Hardness and Methods to Solve CLIQUE

    Institute of Scientific and Technical Information of China (English)

    ZHU Daming; LUAN Junfeng; MA Shaohan

    2001-01-01

    The paper briefly reviews NP-hard optimization problems and their inapproximability. The hardness of solving CLIQUE problem is specifically discussed. A dynamic-programming algorithm and its improved version for CLIQUE are reviewed and some additional analysis is presented. The analysis implies that the improved algorithm, HEWN (hierarchical edge-weighted network), only provides a heuristic or useful method, but cannot be called a polynomial algorithm.

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

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

  20. Cycle expansions with pruned orbits have branch points

    CERN Document Server

    Mainieri, R

    1994-01-01

    Cycle expansions are an efficient scheme for computing the properties of chaotic systems. When enumerating the orbits for a cycle expansion not all orbits that one would expect at first are present --- some are pruned. This pruning leads to convergence difficulties when computing properties of chaotic systems. In numerical schemes, I show that pruning reduces the number of reliable eigenvalues when diagonalizing quantum mechanical operators, and that pruning slows down the convergence rate of cycle expansion calculations. I then exactly solve a diffusion model that displays chaos and show that its cycle expansion develops a branch point.

  1. Implementing entangling gates via quantum walks through branching graphs

    Science.gov (United States)

    Solenov, Dmitry; Cavin, Thomas

    Efficient quantum gates are essential to quantum computing. It was found recently that quantum walks can enhance performance of quantum gates. We investigate how the propagation of a complicated, branching system can be solved analytically by first mapping it to linear chain. We found that certain types of systems, including systems of n qubits, can be algorithmically mapped to a system of disjoint linear chains. In particular, we found a solution for the 3 qubit system that performs either a trivial return walk or a return walk with a phase of pi introduced.

  2. Depression and social problem solving.

    Science.gov (United States)

    Marx, E M; Williams, J M; Claridge, G C

    1992-02-01

    Twenty depressed patients with major depressive disorder, 20 nondepressed matched control subjects, and 17 patients with anxiety disorders were compared in different measures of social problem solving. Problem solving was assessed with the Means-Ends Problem-Solving Test (Study 1), the solution of personal problems, and a problem-solving questionnaire (Study 2). Results showed that, as predicted, depressed subjects suffered from a deficit in problem solving in all three measures. The majority of these deficits were also displayed by the clinical control group rather than being specific to a diagnosis of depression. However, depressed subjects produced less effective solutions than did normal and clinical control subjects. The results suggest that depressed and anxious patients may have difficulties at different stages of the problem-solving process.

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

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

  6. A subgradient-based branch-and-bound algorithm for the capacitated facility location problem

    DEFF Research Database (Denmark)

    Görtz, Simon; Klose, Andreas

    This paper presents a simple branch-and-bound method based on Lagrangean relaxation and subgradient optimization for solving large instances of the capacitated facility location problem (CFLP) to optimality. In order to guess a primal solution to the Lagrangean dual, we average solutions...

  7. 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...... problem. Computational results are reported....

  8. Modelling of non-equilibrium flow in the branched pipeline systems

    Science.gov (United States)

    Sumskoi, S. I.; Sverchkov, A. M.; Lisanov, M. V.; Egorov, A. F.

    2016-09-01

    This article presents a mathematical model and a numerical method for solving the task of water hammer in the branched pipeline system. The task is considered in the onedimensional non-stationary formulation taking into account the realities such as the change in the diameter of the pipeline and its branches. By comparison with the existing analytic solution it has been shown that the proposed method possesses good accuracy. With the help of the developed model and numerical method the task has been solved concerning the transmission of the compression waves complex in the branching pipeline system when several shut down valves operate. It should be noted that the offered model and method may be easily introduced to a number of other tasks, for example, to describe the flow of blood in the vessels.

  9. Chiral methyl-branched pheromones.

    Science.gov (United States)

    Ando, Tetsu; Yamakawa, Rei

    2015-07-01

    Insect pheromones are some of the most interesting natural products because they are utilized for interspecific communication between various insects, such as beetles, moths, ants, and cockroaches. A large number of compounds of many kinds have been identified as pheromone components, reflecting the diversity of insect species. While this review deals only with chiral methyl-branched pheromones, the chemical structures of more than one hundred non-terpene compounds have been determined by applying excellent analytical techniques. Furthermore, their stereoselective syntheses have been achieved by employing trustworthy chiral sources and ingenious enantioselective reactions. The information has been reviewed here not only to make them available for new research but also to understand the characteristic chemical structures of the chiral pheromones. Since biosynthetic studies are still limited, it might be meaningful to examine whether the structures, particularly the positions and configurations of the branched methyl groups, are correlated with the taxonomy of the pheromone producers and also with the function of the pheromones in communication systems.

  10. A simple algorithm for solving the cable equation in dendritic trees of arbitrary geometry.

    Science.gov (United States)

    Koch, C; Poggio, T

    1985-02-01

    We present an efficient algorithm for solving the one-dimensional cable equation in the Laplace (frequency) domain for an arbitrary linear membrane. This method, a reformulation and extension of the geometrical calculus developed by Butz and Cowan (1974), solves for the transfer impedance between any two points in a branched cable structure of arbitrary geometry (but without loops) by the repetitive application of four simple equations. Such an algorithm is used to analyze the electrical behaviour of nerve cells with highly branched dendritic trees. The algorithm can be implemented using a language such as C, PASCAL or LISP and runs on small machines.

  11. Les Representations Graphiques Dans La Resolution De Problemes: Une Experience D'Entrainement D'Etudiants Dans Un Club Mathematique (Graphic Representations in Problem Solving: A Training Program for Students in a Mathematical Club).

    Science.gov (United States)

    Callejo, Maria Luz

    1994-01-01

    Reports, in French, an investigation on the use of graphic representations in problem-solving tasks of the type in Spanish Mathematical Olympiads. Analysis showed that the choice and interpretation of the first graphic representation played a decisive role in the discovery of the solution. (34 references) (Author/MKR)

  12. Crime Solving Techniques: Training Bulletin.

    Science.gov (United States)

    Sands, Jack M.

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

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

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

  15. Solving Nonlinear Euler Equations with Arbitrary Accuracy

    Science.gov (United States)

    Dyson, Rodger W.

    2005-01-01

    A computer program that efficiently solves the time-dependent, nonlinear Euler equations in two dimensions to an arbitrarily high order of accuracy has been developed. The program implements a modified form of a prior arbitrary- accuracy simulation algorithm that is a member of the class of algorithms known in the art as modified expansion solution approximation (MESA) schemes. Whereas millions of lines of code were needed to implement the prior MESA algorithm, it is possible to implement the present MESA algorithm by use of one or a few pages of Fortran code, the exact amount depending on the specific application. The ability to solve the Euler equations to arbitrarily high accuracy is especially beneficial in simulations of aeroacoustic effects in settings in which fully nonlinear behavior is expected - for example, at stagnation points of fan blades, where linearizing assumptions break down. At these locations, it is necessary to solve the full nonlinear Euler equations, and inasmuch as the acoustical energy is of the order of 4 to 5 orders of magnitude below that of the mean flow, it is necessary to achieve an overall fractional error of less than 10-6 in order to faithfully simulate entropy, vortical, and acoustical waves.

  16. New software to compute branched canal networks. KANET program system for the flow engineering and mechanical structure computation of canal networks; Neue Software zur Berechnung verzweigter Kanalnetze. KANET-Programmsystem zur stroemungstechnischen und strukturmechanischen Berechnung von Kanalnetzen

    Energy Technology Data Exchange (ETDEWEB)

    Kammel, C. [RWTH Aachen (Germany). Lehrstuhl fuer Stahlbau; Gruss, J. [Stadtwerke AG Duisburg (Germany); Gruss, W. [Deutsche Babcock AG, Kempen (Germany)

    1998-03-01

    The sector overlapping, modular designed KANET computation program is presented, a high-grade technical aid for the design and subsequent computation of canal systems with regard to the flow mechanism and mechanical structure. (orig.) [Deutsch] Vorgestellt wird das im Berechnungsumfang bereichsuebergreifende modular aufgebaute KANET-Programmsystem, ein technisch hochwertiges Arbeitsmittel fuer die Planung und Nachrechnung von Kanalsystemen hinsichtlich der Stroemungs- und Strukturmechanik. (orig.)

  17. Stabilization of Branching Queueing Networks

    CERN Document Server

    Brázdil, Tomáš

    2011-01-01

    Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a job at server i may result in the creation of a new job for server j. We propose to extend Jackson networks by "branching" and by "control" features. Both extensions are new and substantially expand the modelling power of Jackson networks. On the other hand, the extensions raise computational questions, particularly concerning the stability of the networks, i.e, the ergodicity of the underlying Markov chain. We show for our extended model that it is decidable in polynomial time if there exists a controller that achieves stability. Moreover, if such a controller exists, one can efficiently compute a static randomized controller which stabilizes the network in a very strong sense; in particular, all moments of the queue sizes are finite.

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

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

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

  2. Interior point algorithm for linear programming used in transmission network synthesis

    Energy Technology Data Exchange (ETDEWEB)

    Sanchez, I.G.; Romero, R.; Mantovani, J.R.S. [Electrical Engineering Department, UNESP, CEP 15385000, Ilha Solteira, SP (Brazil); Garcia, A. [Power Systems Department, University of Campinas, UNICAMP, CEP 13083970, Campinas, SP (Brazil)

    2005-09-15

    This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), or a branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithms used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (author) [Transmission network synthesis; Interior point method; Relaxed optimization models; Network expansion planning; Transportation model; Constructive heuristic algorithms].

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

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

  5. Controlled Electronic Transport through Branched Molecular Conductors

    OpenAIRE

    2008-01-01

    Abstract The conductance through a branched conductor placed between two electrodes is analyzed using the Landauer transport formulation within the framework of the single electron, and the tight binding approximations. Terminal side chains are expressed as self energy terms which map the branched conductor onto an effective linear chain Hamiltonian. The effect of uniform side branches on resonant zero-bias conductance is shown to be analytically solvable and particularly simple, w...

  6. Solving the selective multi-category parallel-servicing problem

    DEFF Research Database (Denmark)

    Range, Troels Martin; Lusby, Richard Martin; Larsen, Jesper

    2015-01-01

    In this paper, we present a new scheduling problem and describe a shortest path-based heuristic as well as a dynamic programming-based exact optimization algorithm to solve it. The selective multi-category parallel-servicing problem arises when a set of jobs has to be scheduled on a server (machine...... interval of a given planning horizon, while respecting the server capacity and scheduling requirements. We compare the proposed solution methods with a Mixed Integer Linear Programming (MILP) formulation and show that the dynamic programming approach is faster when the number of categories is large......, whereas the MILP can be solved faster when the number of categories is small....

  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. Branched silver nanowires as controllable plasmon routers.

    Science.gov (United States)

    Fang, Yurui; Li, Zhipeng; Huang, Yingzhou; Zhang, Shunping; Nordlander, Peter; Halas, Naomi J; Xu, Hongxing

    2010-05-12

    Using polarization dependent scattering spectroscopy, we investigate plasmon propagation on branched silver nanowires. By controlling the polarization of the incident laser light, the wire plasmons can be routed into different wire branches and result in light emission from the corresponding wire ends. This routing behavior is found to be strongly dependent on the wavelength of light. Thus for certain incident polarizations, light of different wavelength will be routed into different branches. The branched nanowire can thus serve as a controllable router and multiplexer in integrated plasmonic circuits.

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

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

  12. Problem Solving with General Semantics.

    Science.gov (United States)

    Hewson, David

    1996-01-01

    Discusses how to use general semantics formulations to improve problem solving at home or at work--methods come from the areas of artificial intelligence/computer science, engineering, operations research, and psychology. (PA)

  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. Solving Optimal Timing Problems Elegantly

    OpenAIRE

    Todorova, Tamara

    2013-01-01

    Few textbooks in mathematical economics cover optimal timing problems. Those which cover them do it scantly or in a rather clumsy way, making it hard for students to understand and apply the concept of optimal time in new contexts. Discussing the plentiful illustrations of optimal timing problems, we present an elegant and simple method of solving them. Whether the present value function is exponential or logarithmic, a convenient way to solve it is to convert the base to the exponential numb...

  15. Publications and Presentations of the Ophthalmology Branch, U.S. Air Force School of Aerospace Medicine, 2006-2010

    Science.gov (United States)

    2013-12-01

    AFRL-SA-WP-SR-2013-0015 Publications and Presentations of the Ophthalmology Branch, U.S. Air Force School of Aerospace Medicine, 2006...Aerospace Medicine Aerospace Medicine Department Ophthalmology Branch 2510 Fifth St. Wright-Patterson AFB, OH 45433-7913 Distribution A: Approved... Ophthalmology Branch, U.S. Air Force School of Aerospace Medicine, 2006-2010 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER

  16. 基于问题求解思维能力培养的程序设计教学实践--以累加求和问题为例%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 .

  17. Stochastic transition between turbulent branch and thermodynamic branch of an inhomogeneous plasma

    Energy Technology Data Exchange (ETDEWEB)

    Kawasaki, Mitsuhiro; Itoh, Sanae-I.; Yagi, Masatoshi [Kyushu Univ., Research Institute for Applied Mechanics, Kasuga, Fukuoka (Japan); Itoh, Kimitaka [National Inst. for Fusion Science, Toki, Gifu (Japan)

    2002-05-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 and linear stability boundary. (author)

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

  19. A column generation approach for solving the patient admission scheduling problem

    DEFF Research Database (Denmark)

    Range, Troels Martin; Lusby, Richard Martin; Larsen, Jesper

    2014-01-01

    , different variants of this problem. In this paper we consider one such variant and propose an optimization-based heuristic building on branch-and-bound, column generation, and dynamic constraint aggregation to solve it. We achieve tighter lower bounds than previously reported in the literature and...

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

    NARCIS (Netherlands)

    de Mast, J.

    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. An archetypal mechanism for branching organogenesis.

    Science.gov (United States)

    Clément, Raphaël; Mauroy, Benjamin

    2014-02-01

    Branched structures are ubiquitous in nature, both in living and non-living systems. While the functional benefits of branching organogenesis are straightforward, the developmental mechanisms leading to the repeated branching of epithelia in surrounding mesoderm remain unclear. Both molecular and physical aspects of growth control seem to play a critical role in shape emergence and maintenance. On the molecular side, the existence of a gradient of growth-promoting ligand between epithelial tips and distal mesenchyme seems to be common to branched organs. On the physical side, the branching process seems to require a mechanism of real-time adaptation to local geometry, as suggested by the self-avoiding nature of branching events. In this paper, we investigate the outcomes of a general three-dimensional growth model, in which epithelial growth is implemented as a function of ligand income, while the mesenchyme is considered as a proliferating viscous medium. Our results suggest that the existence of a gradient of growth-promoting ligand between distal and proximal mesenchyme implies a growth instability of the epithelial sheet, resulting in spontaneous self-avoiding branching morphogenesis. While the general nature of the model prevents one from fitting the development of specific organs, it suggests that few ingredients are actually required to achieve branching organogenesis.

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

  3. Quasiconvex Programming

    OpenAIRE

    Eppstein, David

    2004-01-01

    We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either numerically or via generalizations of the dual simplex method from linear programming, and describe varied applications of this geometric optimization technique in meshing, scientific computation, information visualization, automated algorithm analysis, an...

  4. Improved Monkey-King Genetic Algorithm for Solving Large Winner Determination in Combinatorial Auction

    Science.gov (United States)

    Li, Yuzhong

    Using GA solve the winner determination problem (WDP) with large bids and items, run under different distribution, because the search space is large, constraint complex and it may easy to produce infeasible solution, would affect the efficiency and quality of algorithm. This paper present improved MKGA, including three operator: preprocessing, insert bid and exchange recombination, and use Monkey-king elite preservation strategy. Experimental results show that improved MKGA is better than SGA in population size and computation. The problem that traditional branch and bound algorithm hard to solve, improved MKGA can solve and achieve better effect.

  5. Implementasi Metode Branch and Bound untuk Mengoptimalkan Keuntungan Produksi pada PT. Pabrik ES Siantar

    OpenAIRE

    Simanjuntak, Daniel TS

    2016-01-01

    Linear program is an optimal completion technique on a decision problem by determining in advance the objective function and constraints that exist in the mathematical models of linear equations. Branch and Bound method is a common method to find optimal solutions of various optimization problems. Branch and Bound approach based on the principle that the total set of feasible solutions can be partitioned into smaller subsets of the solution. The purpose of this study was to ...

  6. Legislative Branch: FY2014 Appropriations

    Science.gov (United States)

    2013-11-25

    absence of appropriations, and pursuant to opinions issued in 1980 and early 1981 by then- Attorney General Benjamin Civiletti further clarifying the...future years. The Committees look forward to a report of progress being made by the Center’s fundraising program prior to hearings on its fiscal year

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

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

  10. 2008+ solved problems in electromagnetics

    CERN Document Server

    Nasar, Syed

    2007-01-01

    SciTech Publishing is reissuing this extremely valuable learning resource, originally published in 1992 in the Schaum's Problem-Solving Series for students of electromagnetics and those who wish to refresh and solidify their understanding of its challenging applications. Problem-solving drill helps develop confidence, but few textbooks offer the answers, never mind the complete solutions, to their chapter exercises. Here noted author Professor Syed Nasar has divided the book's problems into topic areas similar to a textbook and presented a wide array of problems, followed immediately by their

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

  12. Mechanisms of side branching and tip splitting in a model of branching morphogenesis.

    Directory of Open Access Journals (Sweden)

    Yina Guo

    Full Text Available Recent experimental work in lung morphogenesis has described an elegant pattern of branching phenomena. Two primary forms of branching have been identified: side branching and tip splitting. In our previous study of lung branching morphogenesis, we used a 4 variable partial differential equation (PDE, due to Meinhardt, as our mathematical model to describe the reaction and diffusion of morphogens creating those branched patterns. By altering key parameters in the model, we were able to reproduce all the branching styles and the switch between branching modes. Here, we attempt to explain the branching phenomena described above, as growing out of two fundamental instabilities, one in the longitudinal (growth direction and the other in the transverse direction. We begin by decoupling the original branching process into two semi-independent sub-processes, 1 a classic activator/inhibitor system along the growing stalk, and 2 the spatial growth of the stalk. We then reduced the full branching model into an activator/inhibitor model that embeds growth of the stalk as a controllable parameter, to explore the mechanisms that determine different branching patterns. We found that, in this model, 1 side branching results from a pattern-formation instability of the activator/inhibitor subsystem in the longitudinal direction. This instability is far from equilibrium, requiring a large inhomogeneity in the initial conditions. It successively creates periodic activator peaks along the growing stalk, each of which later on migrates out and forms a side branch; 2 tip splitting is due to a Turing-style instability along the transversal direction, that creates the spatial splitting of the activator peak into 2 simultaneously-formed peaks at the growing tip, the occurrence of which requires the widening of the growing stalk. Tip splitting is abolished when transversal stalk widening is prevented; 3 when both instabilities are satisfied, tip bifurcation occurs

  13. Solving the Selective Multi-Category Parallel-Servicing Problem

    DEFF Research Database (Denmark)

    Range, Troels Martin; Lusby, Richard Martin; Larsen, Jesper

    In this paper we present a new scheduling problem and describe a shortest path based heuristic as well as a dynamic programming based exact optimization algorithm to solve it. The Selective Multi-Category Parallel-Servicing Problem (SMCPSP) arises when a set of jobs has to be scheduled on a server...... in each time interval of a given planning horizon while respecting the server capacity and scheduling requirements. We compare the proposed solution methods with a MILP formulation and show that the dynamic programming approach is faster when the number of categories is large, whereas the MILP can...... be solved faster when the number of categories is small....

  14. Solving PDEs in Python the FEniCS tutorial I

    CERN Document Server

    Langtangen, Hans Petter

    2016-01-01

    This book offers a concise and gentle introduction to finite element programming in Python based on the popular FEniCS software library. Using a series of examples, including the Poisson equation, the equations of linear elasticity, the incompressible Navier–Stokes equations, and systems of nonlinear advection–diffusion–reaction equations, it guides readers through the essential steps to quickly solving a PDE in FEniCS, such as how to define a finite variational problem, how to set boundary conditions, how to solve linear and nonlinear systems, and how to visualize solutions and structure finite element Python programs. This book is open access under a CC BY license.

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

  16. Tillering and panicle branching genes in rice.

    Science.gov (United States)

    Liang, Wei-hong; Shang, Fei; Lin, Qun-ting; Lou, Chen; Zhang, Jing

    2014-03-01

    Rice (Oryza sativa L.) is one of the most important staple food crops in the world, and rice tillering and panicle branching are important traits determining grain yield. Since the gene MONOCULM 1 (MOC 1) was first characterized as a key regulator in controlling rice tillering and branching, great progress has been achieved in identifying important genes associated with grain yield, elucidating the genetic basis of yield-related traits. Some of these important genes were shown to be applicable for molecular breeding of high-yielding rice. This review focuses on recent advances, with emphasis on rice tillering and panicle branching genes, and their regulatory networks.

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

  18. The return branch of viscous fingers

    CERN Document Server

    Vera, F

    2005-01-01

    We report a simple experiment of two-dimensional pattern formation in a circular Hele-Shaw cell, showing the appearance of a return branch that is equivalent to the upward-connecting leader of lightning. Injecting water from the center into a foam filled cell, we obtained patterns similar to dendrites of two-dimensional dielectric breakdown experiments. When we repeat this experiment allowing the presence of water in the outer (low pressure) region, dendrites grow initially as in a normal experiment, but when a branch is near the outer boundary, the low pressure water begins to penetrate the foam against the pressure field, forming several return branches.

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

  20. Problem-Solving Test: Pyrosequencing

    Science.gov (United States)

    Szeberenyi, Jozsef

    2013-01-01

    Terms to be familiar with before you start to solve the test: Maxam-Gilbert sequencing, Sanger sequencing, gel electrophoresis, DNA synthesis reaction, polymerase chain reaction, template, primer, DNA polymerase, deoxyribonucleoside triphosphates, orthophosphate, pyrophosphate, nucleoside monophosphates, luminescence, acid anhydride bond,…

  1. Reasoning, Problem Solving, and Intelligence.

    Science.gov (United States)

    1980-04-01

    is a markted adjective, the subject takeS additional time in seriating the relation spatially in the nonpreferCA" (usually bottom-up) direction. If...PROBLE4 SOLVING, AND INTELLIGENCE I have reviewed in this chapter only a small segment of the literature that could sensibly be viewed as dealing with

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

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

  4. On transfer during problem solving

    NARCIS (Netherlands)

    Hamel, R.; Jakab, E.

    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

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

  6. Robot computer problem solving system

    Science.gov (United States)

    Becker, J. D.; Merriam, E. W.

    1974-01-01

    The conceptual, experimental, and practical aspects of the development of a robot computer problem solving system were investigated. The distinctive characteristics were formulated of the approach taken in relation to various studies of cognition and robotics. Vehicle and eye control systems were structured, and the information to be generated by the visual system is defined.

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

  8. Teaching Employees to Solve Problems.

    Science.gov (United States)

    Miller, Lauren E.; Feggestad, Kurt

    1987-01-01

    John Deere's systematic problem-solving training for its employees is applicable in the vocational classroom. The process includes stating the problem, writing its specifications, identifying distinctions, determining changes that occurred at the time, identifying possible causes, testing the possibilities, verifying the most probable cause, and…

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

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

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

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

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

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

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

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

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

  18. Surgical repair of pulmonary artery branches.

    Science.gov (United States)

    Ghez, Olivier; Saeed, Imran; Serrato, Maria; Quintero, Diana Bernal; Kreitmann, Bernard; Fraisse, Alain; Uemura, Hideki; Seale, Anna; Daubeney, Piers; McCarthy, Karen; Ho, S Yen

    2013-01-01

    Surgical repair of pulmonary artery (PA) branches encompasses many different clinical scenarios and technical challenges. The most common, such as bifurcation and central PA reconstruction, are described, as well as the challenges of complex and peripheral reconstruction.

  19. Counting Tensor Model Observables and Branched Covers of the 2-Sphere

    CERN Document Server

    Geloun, Joseph Ben

    2013-01-01

    Lattice gauge theories of permutation groups with a simple topological action (henceforth permutation-TFTs) have recently found several applications in the combinatorics of quantum field theories (QFTs). They have been used to solve counting problems of Feynman graphs in QFTs and ribbon graphs of large $N$, often revealing inter-relations between different counting problems. In another recent development, tensor theories generalizing matrix theories have been actively developed as models of random geometry in three or more dimensions. Here, we apply permutation-TFT methods to count gauge invariants for tensor models (colored as well as non-colored), exhibiting a relationship with counting problems of branched covers of the 2-sphere, where the rank $d$ of the tensor gets related to a number of branch points. We give explicit generating functions for the relevant counting and describe algorithms for the enumeration of the invariants. As well as the classic count of Hurwitz equivalence classes of branched covers...

  20. Soils of Walker Branch Watershed

    Energy Technology Data Exchange (ETDEWEB)

    Lietzke, D.A.

    1994-01-01

    The soil survey of Walker Branch Watershed (WBW) utilized the most up-to-date knowledge of soils, geology, and geohydrology in building the soils data base needed to reinterpret past research and to begin new research in the watershed. The soils of WBW were also compared with soils mapped elsewhere along Chestnut Ridge on the Oak Ridge Reservation to (1) establish whether knowledge obtained elsewhere could be used within the watershed, (2) determine whether there were any soils restricted to the watershed, and (3) evaluate geologic formation lateral variability. Soils, surficial geology, and geomorphology were mapped at a scale of 1:1200 using a paper base map having 2-ft contour intervals. Most of the contours seemed to reasonably represent actual landform configurations, except for dense wooded areas. For example, the very large dolines or sinkholes were shown on the contour base map, but numerous smaller ones were not. In addition, small drainageways and gullies were often not shown. These often small but important features were located approximately as soil mapping progressed. WBW is underlain by dolostones of the Knox Group, but only a very small part of the surface area contains outcroppings of rock and most outcrops were located in the lower part. Soil mapping revealed the presence of both ancient alluvium and ancient colluvium deposits, not recognized in previous soil surveys, that have been preserved in high-elevation stable portions of present-day landforms. An erosional geomorphic process of topographic inversion requiring several millions of years within the Pleistocene is necessary to bring about the degree of inversion that is expressed in the watershed. Indeed, some of these ancient alluvial and colluvial remnants may date back into the Tertiary. Also evident in the watershed, and preserved in the broad, nearly level bottoms of dolines, are multiple deposits of silty material either devoid or nearly devoid of coarse fragments. Recent research

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

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

  3. $\\tau$ hadronic branching ratios at DELPHI

    CERN Document Server

    Humble, Stephen

    1999-01-01

    Using data collected in the DELPHI detector at LEP1, we have measured the exclusive branching ratios in modes with several hadrons. Both classical cuts and neural network methods have been performed to make the best use of the DELPHI neutral particle identification capability. In addition, a measurement of inclusive branching ratios for tau decays containing one or three charged particles has been performed. (4 refs).

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

  5. 利用动态规划求解最优生产策略问题及Lingo实现%Using a Dynamic Programming Method to Solve the Optimization Problem of Production Strategy and Its Lingo Realization

    Institute of Scientific and Technical Information of China (English)

    蔡鸣晶

    2015-01-01

    This article discusses the optimization problem of production strategy. This is a multi-stages decision problem,which develops production models with the lowest cost of production. A dynamic programming model is established,and Lingo programming is used to obtain the optimal production strategy under the restriction of resources.%讨论了生产策略的优化问题。这是一个多阶段决策的生产问题,要求制定生产策略使得生产总成本最低。建立了动态规划模型,利用Lingo编程求解得到了在资源限制条件下的最优化的生产策略。

  6. The Novel Y-Branch With Two Reflectors

    Institute of Scientific and Technical Information of China (English)

    Ruei-Chang Lu; Yu-Pin Liao

    2003-01-01

    A novel Y-branch waveguide with two reflectors is proposed. The normalized transmitted power for the branching angle of 50°is greater than 70%, which is higher than conventional Y-branch with such wide angle.

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

  8. Terminal Branch of Recurrent Human Laryngeal Nerve

    Directory of Open Access Journals (Sweden)

    Andréa Aparecida Ferreira Pascoal

    2014-01-01

    Full Text Available The importance of the recurrent laryngeal nerve in surgery on the anterior region of the neck has motivated many published papers on critical points of its pathway, relationship with the inferior thyroid artery, penetration in the larynx, division outside the larynx, and branches communicating with the internal branch of the superior laryngeal nerve. We analyze the terminal branches of the recurrent laryngeal nerve and their distribution through the laryngeal muscles. 44 laryngeal nerves had been dissected. Most frequently, the recurrent laryngeal nerve presents a division below or at the level of the lower margin of the cricoid cartilage (outside the larynx. One of these branches forms the communication with the internal branch of the superior laryngeal nerve, and the other penetrates the laryngeal space. Above the lower margin of the cricoid cartilage, the inferior laryngeal nerve issues a variable number of branches to muscles (3 to 7: to the posterior cricoarytenoid muscle; to the oblique and transversal arytenoid muscles; and to the lateral cricoarytenoid muscle and the thyroarytenoid muscle.

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

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

  11. Exact Methods for Solving the Train Departure Matching Problem

    DEFF Research Database (Denmark)

    Haahr, Jørgen Thorlund; Bull, Simon Henry

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

  12. Solving higher curvature gravity theories

    Energy Technology Data Exchange (ETDEWEB)

    Chakraborty, Sumanta [IUCAA, Pune (India); SenGupta, Soumitra [Indian Association for the Cultivation of Science, Theoretical Physics Department, Kolkata (India)

    2016-10-15

    Solving field equations in the context of higher curvature gravity theories is a formidable task. However, in many situations, e.g., in the context of f(R) theories, the higher curvature gravity action can be written as an Einstein-Hilbert action plus a scalar field action. We show that not only the action but the field equations derived from the action are also equivalent, provided the spacetime is regular. We also demonstrate that such an equivalence continues to hold even when the gravitational field equations are projected on a lower-dimensional hypersurface. We have further addressed explicit examples in which the solutions for Einstein-Hilbert and a scalar field system lead to solutions of the equivalent higher curvature theory. The same, but on the lower-dimensional hypersurface, has been illustrated in the reverse order as well. We conclude with a brief discussion on this technique of solving higher curvature field equations. (orig.)

  13. Solving Limited Memory Influence Diagrams

    CERN Document Server

    Mauá, Denis Deratani; Zaffalon, Marco

    2011-01-01

    We present a new algorithm for exactly solving decision making problems represented as influence diagrams. We do not require the usual assumptions of no forgetting and regularity; this allows us to solve problems with simultaneous decisions and limited information. The algorithm is empirically shown to outperform a state-of-the-art algorithm on randomly generated problems of up to 150 variables and $10^{64}$ solutions. We show that the problem is NP-hard even if the underlying graph structure of the problem has small treewidth and the variables take on a bounded number of states, but that a fully polynomial time approximation scheme exists for these cases. Moreover, we show that the bound on the number of states is a necessary condition for any efficient approximation scheme.

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

  16. Mathematical problem solving by analogy.

    Science.gov (United States)

    Novick, L R; Holyoak, K J

    1991-05-01

    We report the results of 2 experiments and a verbal protocol study examining the component processes of solving mathematical word problems by analogy. College students first studied a problem and its solution, which provided a potential source for analogical transfer. Then they attempted to solve several analogous problems. For some problems, subjects received one of a variety of hints designed to reduce or eliminate the difficulty of some of the major processes hypothesized to be involved in analogical transfer. Our studies yielded 4 major findings. First, the process of mapping the features of the source and target problems and the process of adapting the source solution procedure for use in solving the target problem were clearly distinguished: (a) Successful mapping was found to be insufficient for successful transfer and (b) adaptation was found to be a major source of transfer difficulty. Second, we obtained direct evidence that schema induction is a natural consequence of analogical transfer. The schema was found to co-exist with the problems from which it was induced, and both the schema and the individual problems facilitated later transfer. Third, for our multiple-solution problems, the relation between analogical transfer and solution accuracy was mediated by the degree of time pressure exerted for the test problems. Finally, mathematical expertise was a significant predictor of analogical transfer, but general analogical reasoning ability was not. The implications of the results for models of analogical transfer and for instruction were considered.

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

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

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

  20. A Newton method for solving continuous multiple material minimum compliance problems

    DEFF Research Database (Denmark)

    Stolpe, M; Stegmann, Jan

    This paper presents an implementation of an active-set line-search Newton method intended for solving large-scale instances of a class of multiple material minimum compliance problems. The problem is modeled with a convex objective function and linear constraints. At each iteration of the Newton....... Computational experiments with a branch and bound method indicate that the proposed Newton method can, on most instances in the test-set, take advantage of the available starting point information in an enumeration tree and resolve the relaxations after branching with few additional function evaluations...

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

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

  3. Problem Solving in the Borderland between Mathematics and Physics

    Science.gov (United States)

    Jensen, Jens Højgaard; Niss, Martin; Jankvist, Uffe Thomas

    2017-01-01

    The article addresses the problématique of where mathematization is taught in the educational system, and who teaches it. Mathematization is usually not a part of mathematics programs at the upper secondary level, but we argue that physics teaching has something to offer in this respect, if it focuses on solving so-called unformalized problems,…

  4. IMMEX Problem-Solving Software: Integrating Curriculum into Technology.

    Science.gov (United States)

    Underdahl, Jennifer

    2002-01-01

    Explains the history of IMMEX (Interactive Multi-Media Exercises) and its evolution into a Web-delivered, interactive software program, which assesses student understanding of curriculum in K-16 classrooms by tracking its application in real-world, problem-solving scenarios. Discusses performance feedback for teachers and students, and offers…

  5. Structure-Property Relationships for Branched Worm-Like Micelles

    Science.gov (United States)

    Beaucage, Gregory; Rai, Durgesh

    2013-03-01

    Micellar solutions can display a wide range of phase structure as a function of counter ion content, surfactant concentration, and the presence of ternary components. Under some conditions, common to consumer products, extended cylindrical structures that display persistence and other chain features of polymers are produced. These worm-like micelles (WLMs) can form branched structures that dynamically change under shear and even in quiescent conditions. The rheology of these branched WLMs is strongly dependent on migration of the branch points, and the dynamics of branch formation and removal. Persistence and other polymer-based descriptions are also of importance. We have recently developed a scattering model for branched polyolefins and other topologically complex materials that can quantify the branching density, branch length, branch functionality and the hyperbranch (branch-on-branch) content of polymers. This work is being extended to study branching in WLMs in work coupled with Ron Larson at UMich to predict rheological properties.

  6. 高层电梯系统运行方案的建模与求解%Modeling and Solving of the Running Programs of High-rise Elevator System

    Institute of Scientific and Technical Information of China (English)

    孟佶贤; 徐凤; 吕新忠

    2014-01-01

    随着社会的发展,运用垂直交通系统的高层建筑和智能化建筑不断出现。而有效的电梯交通配置,是垂直交通系统高效运行的基本保证。本文针对高层商务建筑中的电梯运行管理方案设计问题,分析了影响电梯耗能和用户满意度的主要因素。分别建立了电梯数目已知和电梯数目未知情况下的电梯调度优化模型,并设计相应动态规划算法和遗传算法。结合算例,求解算例中的电梯优化调度方案,以验证模型的合理性。最后根据我们建立的电梯调度模型,借助VC++作出可视化的电梯调度示意界面,将本文的研究结果用于实际的电梯调度中。%With the development of society , the high-rise buildings and intelligent buildings with vertical trans-portation systems continue to emerge .Meanwhile , optimum dispatching of elevator banks is essential to elevator traffic system.In view of the elevators in high rise commercial building operation and management program de-sign issues , we analyze the main factors of the impact of the elevator energy consumption and customer satisfac -tion.Then we respectively establish two optimization models which are the number of elevators known and un -known by dynamic programming algorithm and genetic algorithm .With an example of a high-rise building , we can get the optimization scheduling programs to verify the rationality of the model .Finally, VC++can be used to make the visualization of elevator scheduling beckoned to the interface .The research result of this paper will be used for the real architectures .

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

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

  9. Branching structure of uniform recursive trees

    Institute of Scientific and Technical Information of China (English)

    FENG; Qunqiang; SU; Chun; HU; Zhishui

    2005-01-01

    The branching structure of uniform recursive trees is investigated in this paper.Using the method of sums for a sequence of independent random variables, the distribution law of ηn, the number of branches of the uniform recursive tree of size n are given first. It is shown that the strong law of large numbers, the central limit theorem and the law of iterated logarithm for ηn follow easily from this method. Next it is shown that ηn and ξn, the depth of vertex n, have the same distribution, and the distribution law of ζn,m, the number of branches of size m, is also given, whose asymptotic distribution is the Poisson distribution with parameter λ = 1/m. In addition, the joint distribution and the asymptotic joint distribution of the numbers of various branches are given. Finally, it is proved that the size of the biggest branch tends to infinity almost sure as n -→∞.

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

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

  12. Reactive Programming in Java

    CERN Document Server

    CERN. Geneva

    2017-01-01

    Reactive Programming in gaining a lot of excitement. Many libraries, tools, and frameworks are beginning to make use of reactive libraries. Besides, applications dealing with big data or high frequency data can benefit from this programming paradigm. Come to this presentation to learn about what reactive programming is, what kind of problems it solves, how it solves them. We will take an example oriented approach to learning the programming model and the abstraction.

  13. Cyanogen in NGC 1851 Red Giant Branch and Asymptotic Giant Branch Stars: Quadrimodal Distributions

    DEFF Research Database (Denmark)

    Campbell, S. W.; Yong, D.; Wylie-de Boer, E. C.;

    2012-01-01

    The Galactic globular cluster NGC 1851 has raised much interest since Hubble Space Telescope photometry revealed that it hosts a double subgiant branch. Here we report on our homogeneous study into the cyanogen (CN) band strengths in the red giant branch (RGB) population (17 stars) and asymptotic...

  14. 46 CFR 169.690 - Lighting branch circuits.

    Science.gov (United States)

    2010-10-01

    ... 46 Shipping 7 2010-10-01 2010-10-01 false Lighting branch circuits. 169.690 Section 169.690... branch circuits. Each lighting branch circuit must meet the requirements of § 111.75-5 of this chapter... to a lighting distribution panelboard; and (b) Branch circuits in excess of 30 amperes may...

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

  16. Nature of branching in disordered materials

    Science.gov (United States)

    Kulkarni, Amit S.

    The phenomenon of structural branching is ubiquitous in a wide array of materials such as polymers, ceramic aggregates, networks and gels. These materials with structural branching are a unique class of disordered materials and often display complex architectures. Branching has a strong influence over the structure-property relationships of these materials. Despite the generic importance across a wide spectrum of materials, our physical understanding of the scientific nature of branching and the analytic description and quantification of branching is at an early stage, though many decades of effort have been made. For polymers, branching is conventionally characterized by hydrodynamic radius (size exclusion chromatography, SEC, rheology) or by counting branch sites (nuclear magnetic resonance spectroscopy, NMR). SEC and rheology are, at best, qualitative; and quantitative characterization techniques like NMR and transmission electron microscopy (TEM) (for ceramic nanoparticulate aggregates) have limitations in providing routine quantification. Effective structure characterization, though an important step in understanding these materials, remains elusive. For ceramic aggregates, theoretical work has dominated and only a few publications on analytic studies exist to support theory. A new generic scaling model is proposed in Chapter I, which encompasses the critical structural features associated with these complex architectures. The central theme of this work is the application of this model to describe a variety of disordered structures like aggregated nano-particulates, long chain branched polymers like polyethylene, hyperbranched polymers, multi-arm star polymers, and cyclic macromolecules. The application of the proposed model to these materials results in a number of fundamental structural parameters, like the mass-fractal dimension, df, the minimum path dimension, dmin, connectivity dimension, c, and the mole fraction branch content, φbr. These dimensions

  17. Bayesian long branch attraction bias and corrections.

    Science.gov (United States)

    Susko, Edward

    2015-03-01

    Previous work on the star-tree paradox has shown that Bayesian methods suffer from a long branch attraction bias. That work is extended to settings involving more taxa and partially resolved trees. The long branch attraction bias is confirmed to arise more broadly and an additional source of bias is found. A by-product of the analysis is methods that correct for biases toward particular topologies. The corrections can be easily calculated using existing Bayesian software. Posterior support for a set of two or more trees can thus be supplemented with corrected versions to cross-check or replace results. Simulations show the corrections to be highly effective.

  18. Crack branching in carbon steel. Fracture mechanisms

    Science.gov (United States)

    Syromyatnikova, A. S.; Alekseev, A. A.; Levin, A. I.; Lyglaev, A. V.

    2010-04-01

    The fracture surfaces of pressure vessels made of carbon steel that form during crack branching propagation are examined by fractography. Crack branching is found to occur at a crack velocity higher than a certain critical value V > V c . In this case, the material volume that is involved in fracture and depends on the elastoplastic properties of the material and the sample width has no time to dissipate the energy released upon crack motion via the damage mechanisms intrinsic in the material under given deformation conditions (in our case, via cracking according to intragranular cleavage).

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

  20. Branching model for vegetation. [polarimetric remote sensing

    Science.gov (United States)

    Yueh, Simon H.; Kong, J. A.; Jao, Jen K.; Shin, Robert T.; Le Toan, Thuy

    1992-01-01

    In the present branching model for remote sensing of vegetation, the frequency and angular responses of a two-scale cylinder cluster are calculated to illustrate the importance of vegetation architecture. Attention is given to the implementation of a two-scale branching model for soybeans, where the relative location of soybean plants is described by a pair of distribution functions. Theoretical backscattering coefficients evaluated by means of hole-correction pair distribution are in agreement with extensive data collected from soybean fields. The hole-correction approximation is found to be the more realistic.

  1. A Newton method for solving continuous multiple material minimum compliance problems

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Stegmann, Jan

    2007-01-01

    method, one or two linear saddle point systems are solved. These systems involve the Hessian of the objective function, which is both expensive to compute and completely dense. Therefore, the linear algebra is arranged such that the Hessian is not explicitly formed. The main concern is to solve......This paper presents an implementation of an active-set line-search Newton method intended for solving large-scale instances of a class of multiple material minimum compliance problems. The problem is modeled with a convex objective function and linear constraints. At each iteration of the Newton...... a sequence of closely related problems appearing as the continuous relaxations in a nonlinear branch and bound framework for solving discrete minimum compliance problems. A test-set consisting of eight discrete instances originating from the design of laminated composite structures is presented...

  2. Numerical methods for solving terminal optimal control problems

    Science.gov (United States)

    Gornov, A. Yu.; Tyatyushkin, A. I.; Finkelstein, E. A.

    2016-02-01

    Numerical methods for solving optimal control problems with equality constraints at the right end of the trajectory are discussed. Algorithms for optimal control search are proposed that are based on the multimethod technique for finding an approximate solution of prescribed accuracy that satisfies terminal conditions. High accuracy is achieved by applying a second-order method analogous to Newton's method or Bellman's quasilinearization method. In the solution of problems with direct control constraints, the variation of the control is computed using a finite-dimensional approximation of an auxiliary problem, which is solved by applying linear programming methods.

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

  4. Branch and price for the time-dependent vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Dabia, Said; Van Woensel, Tom; De Kok, Ton

    2013-01-01

    solution methods to the DM-TDVRPTW are based on (meta-)heuristics. The decomposition of an arc-based formulation leads to a setpartitioning problem as the master problem, and a time-dependent shortest path problem with resource constraints as the pricing problem. The master problem is solved by means...... of column generation, and a tailored labeling algorithm is used to solve the pricing problem. We introduce new dominance criteria that allow more label dominance. For our numerical results, we modified Solomon's data sets by adding time dependency. Our algorithm is able to solve about 63% of the instances......This paper presents a branch-and-price algorithm for the time-dependent vehicle routing problem with time windows (TDVRPTW). We capture road congestion by considering time-dependent travel times, i.e., depending on the departure time to a customer, a different travel time is incurred. We consider...

  5. Heisenberg Honeycombs Solve Veneziano Puzzle

    CERN Document Server

    Kholodenko, A L

    2006-01-01

    In this paper we reformulate some results obtained by Heisenberg into modern mathematical language of honeycombs. This language was developed in connection with complete solution of the Horn conjecture problem. Such a reformulation is done with the purpose of posing and solving the following problem. Is by analysing the (spectroscopic) experimental data it possible to restore the underlying microscopic physical model generating these data? Development of Heisenberg's ideas happens to be the most useful for this purpose. Solution is facilitated by our earlier developed string-theoretic formalism. In this paper only qualitative arguments are presented (with few exceptions). These arguments provide enough evidence that the underelying microscopic model compatible with Veneziano-type amplitudes is the standard (i.e. non supersymmetric!) QCD. In addition, usefulness of the formalism is illustrated on numerous examples such as physically motivated solution of the saturation conjecture, derivation of the Yang-Baxter...

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

  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. Sustainability of International Branch Campuses in the United Arab Emirates: A Vision for the Future

    Science.gov (United States)

    Franklin, Angela; Alzouebi, Khadeegha

    2014-01-01

    The United Arab Emirates is developing higher education institutions that will contribute to an educational sector providing premium degree programs. There was a belief that the recognition and achievements these institutions attained over decades in their native land would be transferable in the implementation of international branch campuses.…

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

  10. Detonation Structure Under Chain Branching Kinetics

    Science.gov (United States)

    Liang, Z.; Bauwens, L.

    2006-07-01

    Hydrogen-oxygen chemistry is characterized by a chain branching mechanism that yields three explosion limits. While a detailed kinetic scheme appropriate for hydrogen-oxygen should produce correct results, in many circumstances, a simpler yet reasonably realistic model will be warranted. In particular, it is easier to develop a clear understanding of the reaction zone structure using a simpler model, that includes only the key mechanisms. To that effect, we consider a four-step chain branching scheme that exhibits an explosion behavior with three limits, which behaves at least qualitatively like hydrogen chemistry. We focus in particular on the structure of the initiation and chain branching zones, using a combination between numerical simulation and analysis. Numerical simulations using this chemical model show distinctive keystone figures in the flow field, close to observations in hydrogen-oxygen detonation experiments. The structure of the chain branching zone is resolved using a perturbation analysis, which clarifies the differences between explosion and no-explosion regions and allows for an evaluation of the induction length in the steady wave. The analysis assumes both high activation energy and a slow initiation. Three cases are identified, respectively, with pressure and temperature located within the explosion region, close to the explosion limit and within the no-explosion region. The induction length is shorter and the reaction rate is faster by several orders of magnitude in the explosion region.

  11. Delayed evolutionary branching in small populations

    NARCIS (Netherlands)

    Claessen, D.; Andersson, J.; Persson, L.; de Roos, A.M.

    2007-01-01

    Abstract: Question: How is the process of evolutionary branching influenced by demographic stochasticity? Mathematical methods: Adaptive dynamics of (i) a simple consumer-resource model and (ii) an analogous but individual-based model with finite population size. Key assumptions: Consumers have acce

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

  13. Heavy metal contamination in TIMS Branch sediments

    Energy Technology Data Exchange (ETDEWEB)

    Pickett, J.B.

    1990-06-25

    The objective of this memorandum is to summarize results of previous sediment studies on Tims Branch and Steed's Pond conducted by Health Protection (HP) and by the Savannah River Laboratory (SRL) in conjunction with Reactor Materials Engineering Technology (RMET). The results for other heavy metals, such as lead, nickel, copper, mercury, chromium, cadmium, zinc, and thorium are also summarized.

  14. Heavy metal contamination in TIMS Branch sediments

    Energy Technology Data Exchange (ETDEWEB)

    Pickett, J.B.

    1990-06-25

    The objective of this memorandum is to summarize results of previous sediment studies on Tims Branch and Steed`s Pond conducted by Health Protection (HP) and by the Savannah River Laboratory (SRL) in conjunction with Reactor Materials Engineering & Technology (RMET). The results for other heavy metals, such as lead, nickel, copper, mercury, chromium, cadmium, zinc, and thorium are also summarized.

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

  16. Higgs Branching Ratio Study in CEPC

    Institute of Scientific and Technical Information of China (English)

    HU; Shou-yang; LIANG; Hao; ZHOU; Jing; LI; Xiao-mei; LI; Xing-long; ZHOU; Shu-hua

    2015-01-01

    Higgs branching ratio(BR)measurement is one of the important issue of the Circular Electron Positron Collider(CEPC)project,which is strongly related to the coupling strength with particles and reveal their mass generation mechanism.The Large Hadron Collider(LHC)has discovered the Higgs boson in 2012,CEPC can confirm whether that is the standard model(SM)

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

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

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

  20. The Social Education Program to ]. L. Vives during the Age of the Renaissance

    Directory of Open Access Journals (Sweden)

    Carmen LABRADOR HERRÁIZ

    2013-11-01

    Full Text Available My objective in this paper consist to present the Social EducationProgram to J. L. Vives during the Age of the Renaissance. His experiences were gained in the society governing rank, to which by birth he belonged. Now it is to be remembered that the claim to respect which we make for the work of a pionner in any new branch of human to Renaissance: Education in Social Values, to charity, justice, peace, concord, understanding among the peoples. In this important respect, Vives suggest a new and significant subject to solve the social problems to Europe of modern times.