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. Branch and Bound Experiments in Convex Nonlinear Integer Programming

    OpenAIRE

    Omprakash K. Gupta; Ravindran, A

    1985-01-01

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

  3. Solving Multistage Influence Diagrams using Branch-and-Bound Search

    OpenAIRE

    Yuan, Changhe; Wu, Xiaojian; Hansen, Eric A.

    2012-01-01

    A branch-and-bound approach to solving influ- ence diagrams has been previously proposed in the literature, but appears to have never been implemented and evaluated - apparently due to the difficulties of computing effective bounds for the branch-and-bound search. In this paper, we describe how to efficiently compute effective bounds, and we develop a practical implementa- tion of depth-first branch-and-bound search for influence diagram evaluation that outperforms existing methods for solvin...

  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. Pebbles and Branching Programs for Tree Evaluation

    CERN Document Server

    Cook, Stephen; Wehr, Dustin; Braverman, Mark; Santhanam, Rahul

    2010-01-01

    We introduce the Tree Evaluation Problem, show that it is in logDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarithmic space lower bound. The input to the problem is a rooted, balanced d-ary tree of height h, whose internal nodes are labeled with d-ary functions on [k] = {1,...,k}, and whose leaves are labeled with elements of [k]. Each node obtains a value in [k] equal to its d-ary function applied to the values of its d children. The output is the value of the root. We show that the standard black pebbling algorithm applied to the binary tree of height h yields a deterministic k-way branching program with Theta(k^h) states solving this problem, and we prove that this upper bound is tight for h=2 and h=3. We introduce a simple semantic restriction called "thrifty" on k-way branching programs solving tree evaluation problems and show that the same state bound of Theta(k^h) is tight (up to a constant factor) for all h >= 2 for deterministic thrift...

  6. Metode Branch and Cut Untuk Menyelesaikan Multi-Objective Integer Programming

    OpenAIRE

    Amalia, Rizkika

    2015-01-01

    Branch and Cut method is a kind of technique for solving linear programming problem which expect integer for its decision variable, but it usually use to solve a single objective integer programming form. In this paper, the author will show how Branch and Cut method can solve a multi-objective integer programming or so-called goal programming. The author also used LINDO (Linear Discrete Optimization). Keywords: Branch and Cut, Multi-Objective Integer Programming, goal programming.

  7. Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring using Zero-Suppressed Binary Decision Diagrams

    OpenAIRE

    Morrison, David R.; Sewell, Edward C.; Sheldon H. Jacobson

    2014-01-01

    Branch-and-price algorithms combine a branch-and-bound search with an exponentially-sized LP formulation that must be solved via column generation. Unfortunately, the standard branching rules used in branch-and-bound for integer programming interfere with the structure of the column generation routine; therefore, most such algorithms employ alternate branching rules to circumvent this difficulty. This paper shows how a zero-suppressed binary decision diagram (ZDD) can be used to solve the pri...

  8. An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming

    OpenAIRE

    Hong-Wei Jiao; Feng-Hui Wang; Yong-Qiang Chen

    2014-01-01

    An effective branch and bound algorithm is proposed for globally solving minimax linear fractional programming problem (MLFP). In this algorithm, the lower bounds are computed during the branch and bound search by solving a sequence of linear relaxation programming problems (LRP) of the problem (MLFP), which can be derived by using a new linear relaxation bounding technique, and which can be effectively solved by the simplex method. The proposed branch and bound algorithm is convergent to the...

  9. Modeling and solving linear programming with R

    OpenAIRE

    Sallán Leyes, José María; Lordan González, Oriol; Fernández Alarcón, Vicenç

    2015-01-01

    Linear programming is one of the most extensively used techniques in the toolbox of quantitative methods of optimization. One of the reasons of the popularity of linear programming is that it allows to model a large variety of situations with a simple framework. Furthermore, a linear program is relatively easy to solve. The simplex method allows to solve most linear programs efficiently, and the Karmarkar interior-point method allows a more efficient solving of some kinds of linear programmin...

  10. A Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming

    OpenAIRE

    Xue-Gang Zhou; Bing-Yuan Cao

    2013-01-01

    A simplicial branch and bound duality-bounds algorithm is presented to globally solving the linear multiplicative programming (LMP). We firstly convert the problem (LMP) into an equivalent programming one by introducing $p$ auxiliary variables. During the branch and bound search, the required lower bounds are computed by solving ordinary linear programming problems derived by using a Lagrangian duality theory. The proposed algorithm proves that it is convergent to a global mini...

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

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

  13. Metode Branch And Bound Untuk Menyelesaikan Program Stokastik Integer Dengan Adanya Resiko

    OpenAIRE

    Pangaribuan, Adil H.

    2011-01-01

    This thesis is addressed to develop branch-and-bound methods, that is to solve multistage stochastic integer programs with risk objectives which is related to wait-and-see problems which could be separated like risk neutral. All model classi_ed to this is overcome by presenting a combination between branch-and-bound algorithm and relaxation of non-anticipativity and constraint branching along non-anticipativity subspaces.

  14. Pebbles and Branching Programs for Tree Evaluation

    OpenAIRE

    Cook, Stephen; McKenzie, Pierre; Wehr, Dustin; Braverman, Mark; Santhanam, Rahul

    2010-01-01

    We introduce the Tree Evaluation Problem, show that it is in logDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarithmic space lower bound. The input to the problem is a rooted, balanced d-ary tree of height h, whose internal nodes are labeled with d-ary functions on [k] = {1,...,k}, and whose leaves are labeled with elements of [k]. Each node obtains a value in [k] equal to its d-ary function applied to the values of its d childre...

  15. Interactive Problem Solving Tutorials Through Visual Programming

    Science.gov (United States)

    Undreiu, Lucian; Schuster, David; Undreiu, Adriana

    2008-10-01

    We have used LabVIEW visual programming to build an interactive tutorial to promote conceptual understanding in physics problem solving. This programming environment is able to offer a web-accessible problem solving experience that enables students to work at their own pace and receive feedback. Intuitive graphical symbols, modular structures and the ability to create templates are just a few of the advantages this software has to offer. The architecture of an application can be designed in a way that allows instructors with little knowledge of LabVIEW to easily personalize it. Both the physics solution and the interactive pedagogy can be visually programmed in LabVIEW. Our physics pedagogy approach is that of cognitive apprenticeship, in that the tutorial guides students to develop conceptual understanding and physical insight into phenomena, rather than purely formula-based solutions. We demonstrate how this model is reflected in the design and programming of the interactive tutorials.

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

    Directory of Open Access Journals (Sweden)

    Osama Abdel Raouf

    2014-08-01

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

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

  18. A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem

    OpenAIRE

    Lin-Peng Yang; Pei-Ping Shen; Yong-Gang Pei

    2014-01-01

    This paper presents a global optimization algorithm for solving globally the generalized nonlinear multiplicative programming (MP) with a nonconvex constraint set. The algorithm uses a branch and bound scheme based on an equivalently reverse convex programming problem. As a result, in the computation procedure the main work is solving a series of linear programs that do not grow in size from iterations to iterations. Further several key strategies are proposed to enhance solution production, ...

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

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

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

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

  3. Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method

    OpenAIRE

    Kolpakov, Roman; Posypkin, Mikhail

    2015-01-01

    We study the computational complexity of one of the particular cases of the knapsack problem: the subset sum problem. For solving this problem we consider one of the basic variants of the Branch-and-Bound method in which any sub-problem is decomposed along the free variable with the maximal weight. By the complexity of solving a problem by the Branch-and-Bound method we mean the number of steps required for solving the problem by this method. In the paper we obtain upper bounds on the complex...

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

  5. Correlates of Problem-Solving in Programming.

    Science.gov (United States)

    Chung, Choi-man

    1988-01-01

    Examines some correlates of programing ability that can predict the computer programing performance of students. Finds that students who score high on mathematics and spatial tests will score high on programing ability tests. Finds that boys perform significantly better than girls in programing ability, as do those who possess home computers. (KO)

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

    International Nuclear Information System (INIS)

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

  7. Fuzzy linear programming problems solved with Fuzzy decisive set method

    OpenAIRE

    Mehmood, Rashid

    2009-01-01

    In the thesis, there are two kinds of fuzzy linear programming problems, one of them is a linear programming problem with fuzzy technological coefficients and the second is linear programming problem in which both the right-hand side and the technological coefficients are fuzzy numbers. I solve the fuzzy linear programming problems with fuzzy decisive set method.

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

  9. A Branch and Bound Approach to Solve the Preemptive Resource Leveling Problem

    OpenAIRE

    Behrouz Afshar-Nadjafi; Zeinab Khalaj; Esmaeil Mehdizadeh

    2013-01-01

    We study resource constrained project scheduling problem with respect to resource leveling as objective function and allowance of preemption in activities. The branch and bound algorithms proposed in previous researches on resource leveling problem do not consider preemption. So, representing a model for the problem, a branch and bound algorithm is proposed. This algorithm can handle preemption in resource leveling problem. Comparing the resource leveling problem and the preemptive resource l...

  10. The Coin Problem  and Pseudorandomness for Branching Programs

    DEFF Research Database (Denmark)

    Brody, Joshua; Verbin, Elad

    The emph{Coin Problem} is the following problem: a coin is given, which lands on head with probability either $1/2 + beta$ or $1/2 - beta$. We are given the outcome of $n$ independent tosses of this coin, and the goal is to guess which way the coin is biased, and to answer correctly with...... the model of emph{read-once width-$w$ branching programs}. We prove that in order to succeed in this model, $beta$ must be at least $1/ (log n)^{Theta(w)}$. For constant $w$ this is tight by considering the recursive tribes function, and for other values of $w$ this is nearly tight by considering...... cannot be distinguished by small-width read-once branching programs. We suggest one application for this kind of theorems: we prove that Nisan's Generator fools width-$w$ read-once emph{regular} branching programs, using seed length $O(w^4 log n log log n + log n log (1/eps))$. For $w=eps=Theta(1)$, this...

  11. Taylor Series Approximation to Solve Neutrosophic Multiobjective Programming Problem

    Directory of Open Access Journals (Sweden)

    Ibrahim M. Hezam

    2015-12-01

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

  12. A fast and simple branching algorithm for solving small scale fixed-charge transportation problem

    OpenAIRE

    Krzysztof Kowalski; Benjamin Lev; Wenjing Shen; Yan Tu

    2014-01-01

    In this paper, we develop a simple algorithm for obtaining the global solution to a small scale fixed-charge transportation problem (FCTP). The procedure itself is very quick. The proposed method solves FCTP by decomposing the problem into series of smaller sub-problems, which is novel and can be useful to researchers solving any size of the problem.

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

    DEFF Research Database (Denmark)

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

    2014-01-01

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

  14. A "feasible direction" search for Lineal Programming problem solving

    Directory of Open Access Journals (Sweden)

    Jaime U Malpica Angarita

    2010-04-01

    Full Text Available The study presents an approach to solve linear programming problems with no artificial variables. A primal linear minimization problem is standard form and its associated dual linear maximization problem are used. Initially, the dual (or a partial dual program is solved by a "feasible direction" search, where the Karush-Kuhn-Tucker conditions help to verify its optimality and then its feasibility. The "feasible direction" search exploits the characteristics of the convex polyhedron (or prototype formed by the dual program constraints to find a starting point and then follows line segments, whose directions are found in afine subspaces defined by boundary hyperplanes of polyhedral faces, to find next points up to the (an optimal one. Them, the remaining dual constraints not satisfaced at that optimal dual point, if there are any, are handled as nonbasic variables of the primal program, which is to be solved by such "feasible direction" search.

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

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

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

    Science.gov (United States)

    Akay, Bahriye; Karaboga, Dervis

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

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

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

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

  1. 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......, and one of the two objectives has only integer variables. The proposed method is able to find the full set of nondominated points. It is tested on a large number of problem instances, from six different classes of MOMIP problems. The results reveal that the developed biobjective branch and bound...

  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. Third annual Walker Branch Watershed research symposium. Program and abstracts

    Energy Technology Data Exchange (ETDEWEB)

    1992-03-01

    The methods and concepts of watershed research, originally applied in an experimental or monitoring mode to relatively small catchments, are increasingly being used at larger scales and for specific applied problems. Research at Oak Ridge National Laboratory, the Tennessee Valley Authority, the US Forest Service, and other agencies and institutions participating in this symposium reflects research over a broad range of spatial scales that is being integrated through large-scale experiments along with computer modeling and graphical interfaces. These research projects address the basic atmospheric, geophysical, biogeochemical, and biological processes that regulate the responses of forested ecosystems to natural environmental variation and anthropogenic stresses. Regional and global issues addressed by presentations include emissions of carbon dioxide, methane, and other hydrocarbons; deposition of sulfate, nitrate, and mercury; land-use changes; biological diversity; droughts; and water quality. The reports presented in this symposium illustrate a wide range of methods and approaches and focus more on concepts and techniques than on a specific physical site. Sites and projects that have contributed research results to this symposium include Walker Branch Watershed (DOE), the Coweeta Hydrologic Laboratory and LTER site (USFS and NSF), Great Smoky Mountains National Park (research funded by NPS, TVA, and EPRI), Imnavait Creek, Alaska (DOE), the TVA-Norris Whole-tree Facility (TVA and EPRI), and DOE`s Biomass Program.

  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. A unified branch-and-bound and cutting plane algorithm for a class of nonconvex optimization problems : application to bilinear programming

    OpenAIRE

    Muu, Lê D.; Oettli, Werner

    1988-01-01

    A unifled approach to branch-and-bound and cutting plane methods for solving a certain class of nonconvex optimization problems is proposed. Based on this approach an implementable algorithm is obtained for programming problems with a bilinear objective function and jointly convex constraints.

  6. 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......, and one of the two objectives has only integer variables. The proposed method is able to find the full set of nondominated points. It is tested on a large number of problem instances, from six different classes of MOMIP problems. The results reveal that the developed biobjective branch and bound...... method performs better on five of the six test problems, compared with a generic two-phase method. At this time, the two-phase method is the most preferred exact method for solving MOMIP problems with two criteria and binary variables....

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

    International Nuclear Information System (INIS)

    The methods and concepts of watershed research, originally applied in an experimental or monitoring mode to relatively small catchments, are increasingly being used at larger scales and for specific applied problems. Research at Oak Ridge National Laboratory, the Tennessee Valley Authority, the US Forest Service, and other agencies and institutions participating in this symposium reflects research over a broad range of spatial scales. These research projects address the basic atmospheric, geophysical, biogeochemical, and biological processes that regulate the responses of forested ecosystems to natural environmental variation and anthropogenic stresses. Regional and global issues addressed by presentations include emissions of carbon dioxide, methane, and other hydrocarbons; deposition of sulfate, nitrate, and mercury; land-use changes; biological diversity; droughts; and water quality. The Department of Energy's local research site, Walker Branch Watershed, is a long-term ecosystem research project initiated on the Oak Ridge Reservation in 1967. Walker Branch provides a well-characterized site where many of these methods can be tested and applied.In addition, other large-scale experiments represented in this symposium include experiments on the effects of clearcutting and burning on forest structure and productivity associated with Coweeta Hydrologic Laboratory, and whole-tree ozone exposure chambers constructed by TVA and ORNL researchers

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

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Bendsøe, Martin P.

    2007-01-01

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

  9. Modified FGP approach and MATLAB program for solving multi-level linear fractional programming problems

    Science.gov (United States)

    Lachhwani, Kailash; Nehra, Suresh

    2015-09-01

    In this paper, we present modified fuzzy goal programming (FGP) approach and generalized MATLAB program for solving multi-level linear fractional programming problems (ML-LFPPs) based on with some major modifications in earlier FGP algorithms. In proposed modified FGP approach, solution preferences by the decision makers at each level are not considered and fuzzy goal for the decision vectors is defined using individual best solutions. The proposed modified algorithm as well as MATLAB program simplifies the earlier algorithm on ML-LFPP by eliminating solution preferences by the decision makers at each level, thereby avoiding difficulties associate with multi-level programming problems and decision deadlock situation. The proposed modified technique is simple, efficient and requires less computational efforts in comparison of earlier FGP techniques. Also, the proposed coding of generalized MATLAB program based on this modified approach for solving ML-LFPPs is the unique programming tool toward dealing with such complex mathematical problems with MATLAB. This software based program is useful and user can directly obtain compromise optimal solution of ML-LFPPs with it. The aim of this paper is to present modified FGP technique and generalized MATLAB program to obtain compromise optimal solution of ML-LFP problems in simple and efficient manner. A comparative analysis is also carried out with numerical example in order to show efficiency of proposed modified approach and to demonstrate functionality of MATLAB program.

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

    OpenAIRE

    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 lower bound. In the first part of this thesis, we analyze promising old and new semidefinite programming (SDP) relaxations. In particular, we focus on their complexity, the strength of the respect...

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

    International Nuclear Information System (INIS)

    The methods and concepts of watershed research, originally applied in an experimental or monitoring mode to relatively small catchments, are increasingly being used at larger scales and for specific applied problems. Research at Oak Ridge National Laboratory, the Tennessee Valley Authority, the US Forest Service, and other agencies and institutions participating in this symposium reflects research over a broad range of spatial scales that is being integrated through large-scale experiments along with computer modeling and graphical interfaces. These research projects address the basic atmospheric, geophysical, biogeochemical, and biological processes that regulate the responses of forested ecosystems to natural environmental variation and anthropogenic stresses. This symposium highlights the use of large-scale ecosystem experiments to address environmental issues of global concern. These experiments provide the only effective way to test models of ecosystem response that are based on the current state of knowledge of hydrology, biogeochemistry, plant physiology, and other ecosystem processes. Major environmental problems that are being addressed include acidic deposition and nitrogen loading (Bear Brook Watershed, Maine; and the Girdsjoen Covered Catchment, Sweden); climate warming (Soil Warming Experiment, Maine); and altered rainfall amounts (Savannah River Loblolly Pine Soil Water Manipulation and the Walker Branch Watershed Throughfall Displacement Experiment)

  12. Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming

    OpenAIRE

    Banbara, Mutsunori; Gebser, Martin; Inoue, Katsumi; Schaub, Torsten; Soh, Takehide; Tamura, Naoyuki; Weise, Matthias

    2013-01-01

    Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We here develop an alternative approach based on ASP. This allows us to use first-order encodings providing us with a high degree of flexibility for easy experimentation with different implementations. The resulting system aspartame re-uses parts of sugar for parsing and normalizing CSPs. The obtained set of facts is ...

  13. A program package for solving nonlinear optimization problems

    International Nuclear Information System (INIS)

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

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

    OpenAIRE

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

    2009-01-01

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

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

    OpenAIRE

    Yuelin Gao; Feifei Li; Siqiao Jin

    2013-01-01

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

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

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

    Energy Technology Data Exchange (ETDEWEB)

    Mahlke, Debora

    2011-07-01

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

  18. Linear Programming by Solving Systems of Differential Equations Using Game Theory

    OpenAIRE

    Ciuiu, Daniel

    2009-01-01

    In this paper we will solve some linear programming problems by solving systems of differential equations using game theory. The linear programming problem must be a classical constraints problem or a classical menu problem, i.e. a maximization/minimization problem in the canonical form with all the coefficients (from objective function, constraints matrix and right sides) positive. Firstly we will transform the linear programming problem such that the new problem and its dual hav...

  19. Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming

    Science.gov (United States)

    Brusco, Michael J.; Stahl, Stephanie

    2005-01-01

    There are two well-known methods for obtaining a guaranteed globally optimal solution to the problem of least-squares unidimensional scaling of a symmetric dissimilarity matrix: (a) dynamic programming, and (b) branch-and-bound. Dynamic programming is generally more efficient than branch-and-bound, but the former is limited to matrices with…

  20. Reconstructing Program Theories: Methods Available and Problems To Be Solved.

    Science.gov (United States)

    Leeuw, Frans L.

    2003-01-01

    Discusses methods for reconstructing theories underlying programs and policies, focusing on three approaches: (1) an empirical approach that focuses on interviews, documents, and argumentational analysis; (2) an approach based on strategic assessment, group dynamics, and dialogue; and (3) an approach based on cognitive and organizational…

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

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

    OpenAIRE

    Nguyen Thien Luan; Vu Thi Thu Huyen

    2012-01-01

    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.

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

  4. Development of C++ Application Program for Solving Quadratic Equation in Elementary School in Nigeria

    Science.gov (United States)

    Bandele, Samuel Oye; Adekunle, Adeyemi Suraju

    2015-01-01

    The study was conducted to design, develop and test a c++ application program CAP-QUAD for solving quadratic equation in elementary school in Nigeria. The package was developed in c++ using object-oriented programming language, other computer program that were also utilized during the development process is DevC++ compiler, it was used for…

  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. The Effects of Teaching Programming via Scratch on Problem Solving Skills: A Discussion from Learners' Perspective

    OpenAIRE

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

    2014-01-01

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

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

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

  9. Genetic Algorithm Based Goal Programming Procedure for Solving Interval-Valued Multilevel Programming Problems

    Directory of Open Access Journals (Sweden)

    Papun Biswas, Bijay Baran Pal, Anirban Mukhopadhyay, Debjani Chakraborti

    2013-03-01

    Full Text Available This article presents goal programming (GPprocedure for solving Interval-valued multilevelprogramming (MLP problems by using geneticalgorithm (GA in a hierarchical decision makingand planning situation of anorganization.Intheproposed approach, first the individual best andleast solutions of the objectives of the decisionmakers (DMs located at different hierarchicallevels are determined by using the GA method.Then, the target intervals of each of the objectivesand decision vectors controlled by the upper-levelDMs are defined in the inexact decisionenvironment.Then, in the model formulation, theintervalvalued objectives and control vectors aretransformed into the conventional form of goal byusing interval arithmetic technique.In the goalachievementfunction, both the aspects of minsumand minmax GP formulations areadopted tominimize the lower bounds of thedefinedregretintervals for goal achievement within the specifiedinterval from the optimistic point ofview of theDMs.The potential use of the approach is illustratedby a numerical example.

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

    OpenAIRE

    Eidelman, S

    1983-01-01

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

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

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

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

  14. BUILDING INTERACTIVITY IN HIGHER EDUCATION TO SUPPORT STUDENT ENGAGEMENT IN SPATIAL PROBLEM SOLVING AND PROGRAMMING

    OpenAIRE

    Gulland, E.-K.; B. Veenendaal; A. G. T. Schut

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

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

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

    Directory of Open Access Journals (Sweden)

    Tao Zhang

    2012-01-01

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

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

  18. Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs

    Czech Academy of Sciences Publication Activity Database

    Šíma, Jiří; Žák, Stanislav

    Berlin : Springer, 2011 - (Kulikov, A.; Vereshchagin, N.), s. 120-133 ISBN 978-3-642-20711-2. ISSN 0302-9743. - (Lecture Notes in Computer Science. 6651). [CSR 2011. International Computer Science Symposium in Russia /6./. St. Petersburg (RU), 14.06.2011-18.06.2011] R&D Projects: GA ČR GAP202/10/1333; GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10300504 Keywords : almost k-wise independent set * hitting set * read-once branching programs * derandomization * bounded width Subject RIV: IN - Informatics, Computer Science

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

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

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

    OpenAIRE

    Hecheng Li; Lei Fang

    2012-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Eghbal Hosseini

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

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

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

    Science.gov (United States)

    Secer, Zarife; Ogelman, Hulya Gulay

    2011-01-01

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

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

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

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

    Directory of Open Access Journals (Sweden)

    S. H. Pakzad-Moghadam

    2012-01-01

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

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

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

  10. A Fortran program (RELAX3D) to solve the 3 dimensional Poisson (Laplace) equation

    International Nuclear Information System (INIS)

    RELAX3D is an efficient, user friendly, interactive FORTRAN program which solves the Poisson (Laplace) equation Λ2=p for a general 3 dimensional geometry consisting of Dirichlet and Neumann boundaries approximated to lie on a regular 3 dimensional mesh. The finite difference equations at these nodes are solved using a successive point-iterative over-relaxation method. A menu of commands, supplemented by HELP facility, controls the dynamic loading of the subroutine describing the problem case, the iterations to converge to a solution, and the contour plotting of any desired slices, etc

  11. Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W

    OpenAIRE

    Bautista Valhondo, Joaquín; Cano Pérez, Alberto; Alfaro Pozo, Rocío; Batalla García, Cristina

    2013-01-01

    n this paper, we propose a hybrid procedure based on Bounded Dynamic Programming ( BDP ) and linear programming to solve the Mixed - Model Se quencing Problem with Workload Minimization ( MMSP - W ), with serial workstations, free interruption of the operations and production mix restrictions. We performed a computational experiment with 225 instances from the literature. The results of our proposal are compared with those obtained through the Guro...

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

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

  14. Bi-population Based on Evolutionary Algorithm for Solving Nonlinear Constrained Programming

    Directory of Open Access Journals (Sweden)

    ZOU Guo-cheng

    2009-06-01

    Full Text Available It is difficult to handle constrained conditions in solving nonlinear constrained programming. In this paper a bi-population based on evolutionary algorithm for solving nonlinear constrained programming is proposed. The algorithm is different from other algorithms in that one difines the voilation based on constrained conditions to measure the individuals, and defines the optimal value based on objective value to measure quality of individuals in population. Firstly, we consider the standard constrained optimization problem and state different methods to handle constraints, then present a different method. For degree of violation, we difine two populations:feasible and infeasible population. Finally, we present the detailed steps of bi-population evolutionary algorithm. The feasibility and effectiveness are verified by comparing other existed algorithms with the same five benchmark functions.

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

    OpenAIRE

    M. ZANGIABADI; 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...

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

    OpenAIRE

    Vichik, Sergey; Borrelli, Francesco

    2013-01-01

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

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

    OpenAIRE

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

    2012-01-01

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

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

    International Nuclear Information System (INIS)

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

  19. Branch and bound based coordinate search filter algorithm for nonsmooth nonconvex mixed-integer nonlinear programming problems

    OpenAIRE

    Fernandes, Florbela P.; Costa, Fernanda P.M.; Fernandes, Edite M.G.P.

    2014-01-01

    A mixed-integer nonlinear programming problem (MINLP) is a problem with continuous and integer variables and at least, one nonlinear function. This kind of problem appears in a wide range of real applications and is very difficult to solve. The difficulties are due to the nonlinearities of the functions in the problem and the integrality restrictions on some variables. When they are nonconvex then they are the most difficult to solve above all. We present a methodology to solve nonsmooth no...

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

  1. Reliability and decomposition techniques to solve certain class of stochastic programming problems

    Energy Technology Data Exchange (ETDEWEB)

    Minguez, R., E-mail: Roberto.Minguez@unican.e [Environmental Hydraulics Institute ' IH Cantabria' , Universidad de Cantabria, Cantabria (Spain); Conejo, A.J.; Garcia-Bertrand, R. [Department of Electrical Engineering, University of Castilla-La Mancha, Ciudad Real (Spain)

    2011-02-15

    Reliability based techniques has been an area of active research in structural design during the last decade, and different methods have been developed. The same has occurred with stochastic programming, which is a framework for modeling optimization problems involving uncertainty. The discipline of stochastic programming has grown and broadened to cover a wide range of applications, such as agriculture, capacity planning, energy, finance, fisheries management, production control, scheduling, transportation, water management, etc., and because of this, techniques for solving stochastic programming models are of great interest for the scientific community. This paper presents a new approach for solving a certain type of stochastic programming problems presenting the following characteristics: (i) the joint probability distributions of random variables are given, (ii) these do not depend on the decisions made, and (iii) random variables only affect the objective function. The method is based on mathematical programming decomposition procedures and first-order reliability methods, and constitutes an efficient method for optimizing quantiles in high-dimensional settings. The solution provided by the method allows us to make informed decisions accounting for uncertainty.

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

    Science.gov (United States)

    Wan, Shui; Wu, Bangxian; Chen, Ningning

    2007-05-01

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

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

  4. Solving seismological problems using SGRAPH program: I-source parameters and hypocentral location

    International Nuclear Information System (INIS)

    SGRAPH program is considered one of the seismological programs that maintain seismic data. SGRAPH is considered unique for being able to read a wide range of data formats and manipulate complementary tools in different seismological subjects in a stand-alone Windows-based application. SGRAPH efficiently performs the basic waveform analysis and solves advanced seismological problems. The graphical user interface (GUI) utilities and the Windows facilities such as, dialog boxes, menus, and toolbars simplified the user interaction with data. SGRAPH supported the common data formats like, SAC, SEED, GSE, ASCII, and Nanometrics Y-format, and others. It provides the facilities to solve many seismological problems with the built-in inversion and modeling tools. In this paper, I discuss some of the inversion tools built-in SGRAPH related to source parameters and hypocentral location estimation. Firstly, a description of the SGRAPH program is given discussing some of its features. Secondly, the inversion tools are applied to some selected events of the Dahshour earthquakes as an example of estimating the spectral and source parameters of local earthquakes. In addition, the hypocentral location of these events are estimated using the Hypoinverse 2000 program operated by SGRAPH.

  5. Solving seismological problems using SGRAPH program: I-source parameters and hypocentral location

    Science.gov (United States)

    Abdelwahed, Mohamed F.

    2012-09-01

    SGRAPH program [1] is considered one of the seismological programs that maintain seismic data. SGRAPH is considered unique for being able to read a wide range of data formats and manipulate complementary tools in different seismological subjects in a stand-alone Windows-based application. SGRAPH efficiently performs the basic waveform analysis and solves advanced seismological problems. The graphical user interface (GUI) utilities and the Windows facilities such as, dialog boxes, menus, and toolbars simplified the user interaction with data. SGRAPH supported the common data formats like, SAC, SEED, GSE, ASCII, and Nanometrics Y-format, and others. It provides the facilities to solve many seismological problems with the built-in inversion and modeling tools. In this paper, I discuss some of the inversion tools built-in SGRAPH related to source parameters and hypocentral location estimation. Firstly, a description of the SGRAPH program is given discussing some of its features. Secondly, the inversion tools are applied to some selected events of the Dahshour earthquakes as an example of estimating the spectral and source parameters of local earthquakes. In addition, the hypocentral location of these events are estimated using the Hypoinverse 2000 program [2] operated by SGRAPH.

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

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

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Svanberg, Krister

    2004-01-01

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

  8. Overview of the USDA-ARS marine finfish reproduction and larviculture research program at Harbor Branch Oceanographic Institution

    Science.gov (United States)

    As is the case with most marine finfish species, development of captive breeding and larval production methods to ensure a consistent and reliable source of seed stock is essential to industry expansion. In 2004, USDA-ARS began work to establish a research program at Harbor Branch Oceanographic Ins...

  9. A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3

    Czech Academy of Sciences Publication Activity Database

    Šíma, Jiří; Žák, Stanislav

    -, subm. 2015 (2016). ISSN 0022-0000 R&D Projects: GA ČR GBP202/12/G061; GA ČR GAP202/10/1333 Institutional support: RVO:67985807 Keywords : derandomization * Hitting Set * read-once branching programs * bounded width Subject RIV: IN - Informatics, Computer Science Impact factor: 1.138, year: 2014

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

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

    Science.gov (United States)

    Myers-Breslin, Linda

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

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

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

    Science.gov (United States)

    Aler, R; Borrajo, D; Isasi, P

    2001-01-01

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

  14. Solving heat radiation problems of FW facilities with the ANSYS program involved

    International Nuclear Information System (INIS)

    Some FW facilities use graphite heaters for creating necessary heat fluxes onto specimen surfaces. The Joule heating-up and radiating heat transfer is realized in such facilities. Graphite heaters are used, for instance, in the RDIPE FW facility (Russia) and FIWATKA (Germany). One of the main problems is a flux nonuniformity on the specimen surface. It may be strongly dependent on heater form, power and facility design. So it is useful to calculate specimen temperature for complex radiation, reradiation and reflection systems. A calculation algorithm for radiation heat transfer was used in RDIPE. It was performed within the finite-element computer code ANSYS 4.4. Some difficult problems of using ANSYS program for radiation tasks in the complex multi-element systems were solved. The first calculations were realized for RDIPE FW facility with graphite heaters. These were preliminary calculation for following experiments. Thanks to FIWATKA measurements it could be verify mentioned algorithm with experimental results

  15. A aplicação do Future Problem Solving Program International em adolescentes : um estudo exploratório

    OpenAIRE

    Azevedo, Ivete; Morais, Maria de Fátima; Jesus, Saul; Ribeiro, Iolanda da Silva; BRANDÃO, Sara

    2012-01-01

    The promotion of creativity has been a concern for decades in the educational context and it is coherent with recent paradigms of giftedness. However, research about this topic is still needed, namely concerning the validation of the programs applied over the world. The Future Problem Solving Program is a creativity training program to adolescents, internationally recognized. Positive results of this program have been found not only about creative skills but also in areas as learning motivati...

  16. Solving multistage stochastic programming models of portfolio selection with outstanding liabilities

    Energy Technology Data Exchange (ETDEWEB)

    Edirisinghe, C. [Univ. of Tennessee, Knoxville, TN (United States)

    1994-12-31

    Models for portfolio selection in the presence of an outstanding liability have received significant attention, for example, models for pricing options. The problem may be described briefly as follows: given a set of risky securities (and a riskless security such as a bond), and given a set of cash flows, i.e., outstanding liability, to be met at some future date, determine an initial portfolio and a dynamic trading strategy for the underlying securities such that the initial cost of the portfolio is within a prescribed wealth level and the expected cash surpluses arising from trading is maximized. While the trading strategy should be self-financing, there may also be other restrictions such as leverage and short-sale constraints. Usually the treatment is limited to binomial evolution of uncertainty (of stock price), with possible extensions for developing computational bounds for multinomial generalizations. Posing as stochastic programming models of decision making, we investigate alternative efficient solution procedures under continuous evolution of uncertainty, for discrete time economies. We point out an important moment problem arising in the portfolio selection problem, the solution (or bounds) on which provides the basis for developing efficient computational algorithms. While the underlying stochastic program may be computationally tedious even for a modest number of trading opportunities (i.e., time periods), the derived algorithms may used to solve problems whose sizes are beyond those considered within stochastic optimization.

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

    International Nuclear Information System (INIS)

    As a condition of the modified National Pollutant Discharge Elimination System (NPDES) permit issued to the Oak Ridge Gaseous Diffusion Plant (ORGDP; now referred to as the Oak Ridge K-25 Site) on September 11, 1986, a Biological Monitoring and Abatement Program (BMAP) was developed for the receiving stream (Mitchell Branch or K-1700 stream). On October 1, 1992, a renewed NPDES permit was issued for the K-25 Site. A biological monitoring plan was submitted for Mitchell Branch, Poplar Creek, Poplar Creek Embayment of the Clinch River and any unnamed tributaries of these streams. The objectives of BMAP are to (1) demonstrate that the effluent limitations established for the Oak Ridge K-25 Site protect and maintain the use of Mitchell Branch for growth and propagation of fish and other aquatic life and (2) document the effects on stream biota resulting from operation of major new pollution abatement facilities, including the Central Neutralization Facility (CNF) and the Toxic Substances Control Act (TSCA) incinerator. The BMAP consists of four tasks: (1) toxicity monitoring; (2) bioaccumulation monitoring; (3) assessment of fish health; and (4) instream monitoring of biological communities, including benthic macroinvertebrates and fish. This document, the third in a series, reports on the results of the Oak Ridge K-25 Site BMAP; it describes studies that were conducted over various periods of time between June 1990 and December 1993, although monitoring conducted outside this time period is included, as appropriate

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

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

  20. Technology-Rich Ethnography for Examining the Transition to Authentic Problem-Solving in a High School Computer Programming Class

    Science.gov (United States)

    Ge, Xun; Thomas, Michael K.; Greene, Barbara A.

    2006-01-01

    This study utilized elements of technology-rich ethnography to create a rich description of a multi-user virtual environment in a high school computer programming class. Of particular interest was the transition that took place in classroom culture from one characterized by a well-defined problem solving approach to one more indicative of open…

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

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

    OpenAIRE

    Degraeve, Zeger; Peeters, Marc

    2000-01-01

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

  3. D3D and D3E - two branches of a FORTRAN program for the solution of the stationary three-dimensional multigroup neutron diffusion equations in rectangular, cylindrical and triangular geometries

    International Nuclear Information System (INIS)

    D3D and D3E, branches of a computer program, solve two- and three-dimensional real and ajoint stationary multigroup neutron diffusion equations by approximating the differential equations by finite difference equations. The discrete grid is a mesh edged one, so that the neutron fluxes are calculated on surfaces separating zones to which different physical conditions apply. Different options allow to treat homogeneous, i.e. eigenvalue problems as well as inhomogeneous, i.e. external source driven problems. The linear algebraic system of the difference equations is solved by the outer and inner iterations method. An outer iteration of the homogeneous problem is the power iteration with the fission source, whereas the outer iteration of the inhomogeneous problem is an iteration with the fission source. Within the process of an outer iteration the group fluxes are determined by inner iterations, either via block overrelaxation or a method of conjugate gradients. (orig./HP)

  4. Development and Validation of a Problem Solving Skill Test in Robot Programming Using Scaffolding Tools

    OpenAIRE

    Supree Purnakanishtha; Praweenya Suwannatthachote; Prachyanun Nilsook

    2014-01-01

    Problem solving is a crucial skill for students who experience learning and living in the 21st century. To enhance this skill, students need to face a situation setting problem, then students solve the problem. After students overcome the obstacles, feelings of pride and success grow in students’ hearts. Successful minds of students will lead the students to become problem solvers and will be embedded into their thought process. It is quite hard to find the right way to...

  5. Unified solution of a non-convex SCUC problem using combination of modified Branch-and-Bound method with Quadratic Programming

    International Nuclear Information System (INIS)

    Highlights: → A hybrid SCUC solution is developed to deal with large-scale, real-time and long-term problems. → New formulations are proposed for considering valve point effect and warmth-dependent start-up cost. → A new algorithm is developed for modeling the AC power flow in SCUC problems. → Using the power flow algorithm both steps in traditional SCUC is done simultaneously. → The proposed method provides better solutions than previous ones with a fast speed. - Abstract: In this paper, a new practical method is presented for solving the non-convex security constraint unit commitment (SCUC) problem in power systems. The accuracy of the proposed method is desirable while the shorter computation time makes it useful for SCUC solution of large-scale power systems, real-time market operation and long-term SCUC problems. The proposed framework allows inclusion of the valve point effects, warmth-dependent start-up costs, ramp rates, minimum up/down time constraints, multiple fuels costs, emission costs, prohibited operating zones and AC power flow limits in normal and contingency conditions. To solve the non-convex problem, combination of a modified Branch-and-Bound method with the Quadratic Programming is used as an optimization tool and a developed AC power flow algorithm is applied for considering the security and contingency concerns using the nonlinear/linear AC model. These modifications improve the convergence speed and solution precision of SCUC problem. In the proposed method, in contrast with traditional SCUC algorithms, unit commitment solution, checking and satisfying the security constraints are managed simultaneously. The obtained results are compared with other reported methods for investigating the effectiveness of the proposed method. Also, the proposed method is applied to an Iranian power system including 493 thermal units.

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

    International Nuclear Information System (INIS)

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

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

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

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

    International Nuclear Information System (INIS)

    A modified National Pollutant Discharge Elimination System permit was issued to the Oak Ridge Gaseous Diffusion Plant (now referred to as the Oak Ridge K-25 Site) on September 11, 1986. The Oak Ridge K-25 Site is a former uranium-enrichment production facility, which is currently managed by Martin Marietta Energy Systems, Inc. for the US Department of Energy. As required in Part III (L) of that permit, a plan for the biological monitoring of Mitchell Branch (K-1700 stream) was prepared and submitted for approval to the US Environmental Protection Agency and the Tennessee Department of Environment and Conservation [formerly the Tennessee Department of Health and Environment (Loar et al. 1992b)]. The K-25 Site Biological Monitoring and Abatement Program (BMAP) described biomonitoring activities that would be conducted over the duration of the permit. Because it was anticipated that the composition of existing effluent streams entering Mitchell Branch would be altered shortly after the modified permit was issued, sampling of the benthic invertebrate and fish communities (Task 4 of BMAP) was initiated in August and September 1986 respectively

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

    CERN Document Server

    Jafarizadeh, Saber

    2010-01-01

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

  11. A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3

    Czech Academy of Sciences Publication Activity Database

    Šíma, Jiří; Žák, Stanislav

    Berlin: Springer, 2012 - (Bieliková, M.; Friedrich, G.; Gottlob, G.; Katzenbeisser, S.; Turán, G.), s. 406-418. (Lecture Notes in Computer Science. 7147). ISBN 978-3-642-27659-0. ISSN 0302-9743. [SOFSEM 2012. Conference on Current Trends in Theory and Practice of Computer Science /38./. Špindlerův Mlýn (CZ), 21.01.2012-27.01.2012] R&D Projects: GA ČR GAP202/10/1333; GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10300504 Keywords : derandomization * hitting set * read-once branching programs * bounded width Subject RIV: IN - Informatics, Computer Science

  12. From Program to Network: The Evaluator's Role in Today's Public Problem-Solving Environment

    Science.gov (United States)

    Benjamin, Lehn M.; Greene, Jennifer C.

    2009-01-01

    Today's public policy discussions increasingly focus on how "networks" of public and private actors collaborate across organizational, sectoral, and geographical boundaries to solve increasingly complex problems. Yet, many of evaluation's key concepts, including the evaluator's role, assume an evaluand that is programmatically or organizationally…

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

    Science.gov (United States)

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

    2007-01-01

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

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

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

    OpenAIRE

    M. Emets

    2012-01-01

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

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

    CERN Document Server

    Nair, Premchand S

    2008-01-01

    While Java texts are plentiful, it's difficult to find one that takes a real-world approach, and encourages novice programmers to build on their Java skills through practical exercise. Written by an expert with 19 experience teaching computer programming, Java Programming Fundamentals presents object-oriented programming by employing examples taken from everyday life. Provides a foundation in object-oriented design principles and UML notation Describes common pitfalls and good programming practicesFurnishes supplemental links, documents, and programs on its companion website, www.premnair.netU

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

    Directory of Open Access Journals (Sweden)

    I. D. Pursitasari

    2012-04-01

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

  18. Program evaluation and incentives for administrators of energy-efficiency programs: Can evaluation solve the principal/agent problem?

    International Nuclear Information System (INIS)

    This paper addresses the nexus between evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes the problems that arise when evaluators are asked to measure program performance by answering the counterfactual question-what would have happened in the absence of the program? Then the paper examines some ways of addressing these problems. Key conclusions are (1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, (2) given the current state of knowledge, the decision to tie all incentives to program outcomes is misguided, and (3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions.

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

    Science.gov (United States)

    Shah, S. N.

    1981-01-01

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

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

    Science.gov (United States)

    Glass, Christopher E.

    1990-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Shengyue Deng

    2014-01-01

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

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

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

    Science.gov (United States)

    BOYER, ROSCOE A.

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

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

  5. An Interactive Method to Solve Infeasibility in Linear Programming Test Assembling Models

    Science.gov (United States)

    Huitzing, Hiddo A.

    2004-01-01

    In optimal assembly of tests from item banks, linear programming (LP) models have proved to be very useful. Assembly by hand has become nearly impossible, but these LP techniques are able to find the best solutions, given the demands and needs of the test to be assembled and the specifics of the item bank from which it is assembled. However,…

  6. Modifications of the Branch-and-Bound Algorithm for Application in Constrained Adaptive Testing. Research Report.

    Science.gov (United States)

    Veldkamp, Bernard P.

    A mathematical programming approach is presented for computer adaptive testing (CAT) with many constraints on the item and test attributes. Because mathematical programming problems have to be solved while the examinee waits for the next item, a fast implementation of the Branch-and-Bound algorithm is needed for this approach. Eight modifications…

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

  8. Materials Test Branch

    Science.gov (United States)

    Gordon, Gail

    2012-01-01

    The Materials Test Branch resides at Marshall Space Flight Center's Materials and Processing laboratory and has a long history of supporting NASA programs from Mercury to the recently retired Space Shuttle. The Materials Test Branch supports its customers by supplying materials testing expertise in a wide range of applications. The Materials Test Branch is divided into three Teams, The Chemistry Team, The Tribology Team and the Mechanical Test Team. Our mission and goal is to provide world-class engineering excellence in materials testing with a special emphasis on customer service.

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

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

    CERN Document Server

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

    2010-01-01

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

  11. Linear programming embedded particle swarm optimization for solving an extended model of dynamic virtual cellular manufacturing systems

    Directory of Open Access Journals (Sweden)

    H. Rezazadeh

    2009-04-01

    Full Text Available The concept of virtual cellular manufacturing system (VCMS is finding acceptance among researchers as an extension to grouptechnology. In fact, in order to realize benefits of cellular manufacturing system in the functional layout, the VCMS createsprovisional groups of resources (machines, parts and workers in the production planning and control system. This paperdevelops a mathematical model to design the VCMS under a dynamic environment with a more integrated approach whereproduction planning, system reconfiguration and workforce requirements decisions are incorporated. The advantages of theproposed model are as follows: considering the operations sequence, alternative process plans for part types, machine timecapacity,worker time‐capacity, cross‐training, lot splitting, maximal cell size, balanced workload for cells and workers. Anefficient linear programming embedded particle swarm optimization algorithm is used to solve the proposed model. Thealgorithm searches over the 0‐1 integer variables and for each 0‐1 integer solution visited; corresponding values of integervariables are determined by solving a linear programming sub‐problem using the simplex algorithm. Numerical examples showthat the proposed method is efficient and effective in searching for near optimal solutions.

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

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

    Indian Academy of Sciences (India)

    ALI EBRAHIMNEJAD

    2016-03-01

    Transportation problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at destinations using available supplies at origins in a crisp environment. In real life situations, the decision maker may not be sure about the precise values of the coefficients belonging to the transportation problem. The aim of this paper is to introduce a formulation of TP involving interval-valued trapezoidal fuzzy numbers for the transportation costs and values of supplies and demands. We propose a fuzzy linear programming approach for solvinginterval-valued trapezoidal fuzzy numbers transportation problem based on comparison of interval-valued fuzzy numbers by the help of signed distance ranking. To illustrate the proposed approach an application example issolved. It is demonstrated that study of interval-valued trapezoidal fuzzy numbers transportation problem gives rise to the same expected results as those obtained for TP with trapezoidal fuzzy numbers.

  14. A linear Fuzzy Goal Programming Method for Solving Optimal Power Generation and Dispatch Problem

    Directory of Open Access Journals (Sweden)

    Bijay Baran Pal, Mousumi Kumar

    2013-03-01

    Full Text Available Thispaperpresents howfuzzy goal programming(FGPmethodcan be efficiently usedmodeling andsolvingpower generation anddispatch(PGDproblems inpower system operation and planninghorizon.In the proposed approach, the objectives ofaprobleminvolvedwith optimal power flowcomputation areconsidered fuzzyin nature in anuncertain decision environment.In the model formulation of the problem,nonlinearin characteristics ofobjective functions are firstconvertedinto their equivalent linear formsbyusing Taylor Series approximationtechnique.Then,the defined fuzzy goals are characterized by theirmembership functions for measuring the degree ofachievementof goallevels ofthe objectivesspecifiedin the decisionsituation.In the solution process,minsumFGPmethodologyisaddressed tominimize the deviations from theaspired goal levels and therebyto reach asatisfactory decision on the basis of needs anddesires of the decision maker (DM in the decisionmaking context.The power generation problem of thestandardIEEE 6-Generator 30-Bus System is considered toillustrate the potential use of the approach.

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

    Science.gov (United States)

    Maddrey, Elizabeth

    Research in academia and industry continues to identify a decline in enrollment in computer science. One major component of this decline in enrollment is a shortage of female students. The primary reasons for the gender gap presented in the research include lack of computer experience prior to their first year in college, misconceptions about the field, negative cultural stereotypes, lack of female mentors and role models, subtle discriminations in the classroom, and lack of self-confidence (Pollock, McCoy, Carberry, Hundigopal, & You, 2004). Male students are also leaving the field due to misconceptions about the field, negative cultural stereotypes, and a lack of self-confidence. Analysis of first year attrition revealed that one of the major challenges faced by students of both genders is a lack of problem-solving skills (Beaubouef, Lucas & Howatt, 2001; Olsen, 2005; Paxton & Mumey, 2001). The purpose of this study was to investigate whether specific, non-mathematical problem-solving instruction as part of introductory programming courses significantly increased computer programming self-efficacy and achievement of students. The results of this study showed that students in the experimental group had significantly higher achievement than students in the control group. While this shows statistical significance, due to the effect size and disordinal nature of the data between groups, care has to be taken in its interpretation. The study did not show significantly higher programming self-efficacy among the experimental students. There was not enough data collected to statistically analyze the effect of the treatment on self-efficacy and achievement by gender. However, differences in means were observed between the gender groups, with females in the experimental group demonstrating a higher than average degree of self-efficacy when compared with males in the experimental group and both genders in the control group. These results suggest that the treatment from this

  16. Using Genetic Programming with Prior Formula Knowledge to Solve Symbolic Regression Problem

    Science.gov (United States)

    Lu, Qiang; Ren, Jun; Wang, Zhiguang

    2016-01-01

    A researcher can infer mathematical expressions of functions quickly by using his professional knowledge (called Prior Knowledge). But the results he finds may be biased and restricted to his research field due to limitation of his knowledge. In contrast, Genetic Programming method can discover fitted mathematical expressions from the huge search space through running evolutionary algorithms. And its results can be generalized to accommodate different fields of knowledge. However, since GP has to search a huge space, its speed of finding the results is rather slow. Therefore, in this paper, a framework of connection between Prior Formula Knowledge and GP (PFK-GP) is proposed to reduce the space of GP searching. The PFK is built based on the Deep Belief Network (DBN) which can identify candidate formulas that are consistent with the features of experimental data. By using these candidate formulas as the seed of a randomly generated population, PFK-GP finds the right formulas quickly by exploring the search space of data features. We have compared PFK-GP with Pareto GP on regression of eight benchmark problems. The experimental results confirm that the PFK-GP can reduce the search space and obtain the significant improvement in the quality of SR. PMID:26819577

  17. Using Genetic Programming with Prior Formula Knowledge to Solve Symbolic Regression Problem.

    Science.gov (United States)

    Lu, Qiang; Ren, Jun; Wang, Zhiguang

    2016-01-01

    A researcher can infer mathematical expressions of functions quickly by using his professional knowledge (called Prior Knowledge). But the results he finds may be biased and restricted to his research field due to limitation of his knowledge. In contrast, Genetic Programming method can discover fitted mathematical expressions from the huge search space through running evolutionary algorithms. And its results can be generalized to accommodate different fields of knowledge. However, since GP has to search a huge space, its speed of finding the results is rather slow. Therefore, in this paper, a framework of connection between Prior Formula Knowledge and GP (PFK-GP) is proposed to reduce the space of GP searching. The PFK is built based on the Deep Belief Network (DBN) which can identify candidate formulas that are consistent with the features of experimental data. By using these candidate formulas as the seed of a randomly generated population, PFK-GP finds the right formulas quickly by exploring the search space of data features. We have compared PFK-GP with Pareto GP on regression of eight benchmark problems. The experimental results confirm that the PFK-GP can reduce the search space and obtain the significant improvement in the quality of SR. PMID:26819577

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

    Science.gov (United States)

    Biswas, Papun; Chakraborti, Debjani

    2010-10-01

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

  19. An Enhanced Branch-and-bound Algorithm for the Talent Scheduling Problem

    OpenAIRE

    Zhang, Zizhen; Qin, Hu; Liang, Xiaocong; Lim, Andrew

    2014-01-01

    The talent scheduling problem is a simplified version of the real-world film shooting problem, which aims to determine a shooting sequence so as to minimize the total cost of the actors involved. In this article, we first formulate the problem as an integer linear programming model. Next, we devise a branch-and-bound algorithm to solve the problem. The branch-and-bound algorithm is enhanced by several accelerating techniques, including preprocessing, dominance rules and caching search states....

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

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

  2. Branching out

    CERN Document Server

    Biggins, J D

    2010-01-01

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

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

    OpenAIRE

    Munari, P.; Gondzio, J.

    2013-01-01

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

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

    OpenAIRE

    AnkurPachauriand Gursaran

    2012-01-01

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

  5. The ACP [Advanced Computer Program] Branch bus and real-time applications of the ACP multiprocessor system

    International Nuclear Information System (INIS)

    The ACP Branchbus, a high speed differential bus for data movement in multiprocessing and data acquisition environments, is described. This bus was designed as the central bus in the ACP multiprocessing system. In its full implementation with 16 branches and a bus switch, it will handle data rates of 160 MByte/sec and allow reliable data transmission over inter rack distances. We also summarize applications of the ACP system in experimental data acquisition, triggering and monitoring, with special attention paid to FASTBUS environments

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

    Science.gov (United States)

    Ismail, Mohd Nasir; Ngah, Nor Azilah; Umar, Irfan Naufal

    2010-01-01

    The purpose of the study is to investigate the effects of mind mapping with cooperative learning (MMCL) and cooperative learning (CL) on: (a) programming performance; (b) problem solving skill; and (c) metacognitive knowledge among computer science students in Malaysia. The moderating variable is the students' logical thinking level with two…

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

    Science.gov (United States)

    Uysal, Murat Pasa

    2014-01-01

    The introductory computer programming (CP) course has been taught for three decades in the faculty. Besides pursuing CP technology, one major goal has been enhancing learners' problem-solving (PS) skills. However, the current situation has implied that this might not be the case. Therefore, a research was conducted to investigate the effects of a…

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

    International Nuclear Information System (INIS)

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

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

    DEFF Research Database (Denmark)

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

    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...... generation process converges slowly for the problem and therefore a stabilization procedure is implemented. Valid inequalities expressed in the original, arc-based variables are added to the LP relaxation to strengthen the lower bound. The proposed algorithm is compared to exact algorithms based on other...

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

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

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

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

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

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

    Science.gov (United States)

    Coalition for Evidence-Based Policy, 2015

    2015-01-01

    The Social Spending Innovation Research (SSIR) proposal seeks to replicate, in social spending, the great success of the Small Business Innovation Research (SBIR) program in technology development. The SBIR program funds technology development by entrepreneurial small companies. The program has spawned breakthrough technologies in diverse areas…

  15. 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. PMID:27219204

  16. PROGS2H4-the program for solving the boundary problem for the system of differential equations

    International Nuclear Information System (INIS)

    The description of the computational scheme and procedure realizing the sweep method for solving the system of two ordinary differential equations with 2nd type boundary conditions at the ends points of given interval is represented. The boundary problem is approximated with the help of the difference scheme of O(h4) precision on the mesh with constant step h. This problem occurs in schemes of linearity of nonlinear boundary problems (for example, in Newtonian iterative schemes), and represented. (author)

  17. Can the Problem of Illiteracy Be Solved? A View Based on AVC Edmonton's Adult Basic Education Program.

    Science.gov (United States)

    Burghardt, F. F.

    An estimated 850,000 Canadian adults lack basic literacy skills. An examination of the profile and achievements of the students enrolled in the literacy education program at the Alberta Vocational Centre in Edmonton indicates that like the many other types in the broad range of adult literacy programs, the highly structured nature of the Edmonton…

  18. Numerical Algorithm for a Class of Linear Fractional Programming Problem

    OpenAIRE

    Hongwei Jiao; Kun Li; Jianping Wang

    2013-01-01

    In this study, a branch and bound algorithm is presented for globally solving a class of linear fractional programming problems. In the algorithm, a linear relaxation method is introduced to generate the linear relaxation programming problem of the investigated linear fractional programming problems. In this study, we pay more attention to the numerical experiments. Several test problems are used to verify the feasibility and computational efficiency of the proposed branch and bound algorithm.

  19. ALPS: A Linear Program Solver

    Science.gov (United States)

    Ferencz, Donald C.; Viterna, Larry A.

    1991-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Aihong Ren

    2013-01-01

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

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

    OpenAIRE

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

    2016-01-01

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

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

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

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

    International Nuclear Information System (INIS)

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

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

    Science.gov (United States)

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

    1987-01-01

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

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

    International Nuclear Information System (INIS)

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

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

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

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

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

    Science.gov (United States)

    Ó Broin, Cathal; Nikolopoulos, L. A. A.

    2014-06-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 AMD 6970 GPU, where the parallel algorithm runs 10 times faster on the GPU than the CPU.

  11. Branched polynomial covering maps

    DEFF Research Database (Denmark)

    Hansen, Vagn Lundsgaard

    1999-01-01

    A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...... set. Particular studies are made of branched polynomial covering maps arising from Riemann surfaces and from knots in the 3-sphere....

  12. Branched polynomial covering maps

    DEFF Research Database (Denmark)

    Hansen, Vagn Lundsgaard

    2002-01-01

    A Weierstrass polynomial with multiple roots in certain points leads to a branched covering map. With this as the guiding example, we formally define and study the notion of a branched polynomial covering map. We shall prove that many finite covering maps are polynomial outside a discrete branch...... set. Particular studies are made of branched polynomial covering maps arising from Riemann surfaces and from knots in the 3-sphere. (C) 2001 Elsevier Science B.V. All rights reserved....

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

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

    DEFF Research Database (Denmark)

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

    2014-01-01

    This paper considers the Capacitated Profitable Tour Problem (CPTP) which is a special case of the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). The CPTP belongs to the group of problems known as traveling salesman problems with profits. In CPTP each customer is associated...... with a profit and a demand and the objective is to find a capacitated tour (rooted in a depot node) that minimizes the total travel distance minus the profit of the visited customers. The CPTP can be recognized as the sub-problem in many column generation applications, where it is traditionally solved...... instances with 800 nodes to optimality where the dynamic programming algorithms cannot solve instances with more than 200 nodes. Moreover dynamic programming and branch-and-cut complement each other well, giving us hope for solving more general problems through hybrid approaches. The paper is intended to...

  15. Penentuan Batas Bawah pada Metode Branch and Price

    OpenAIRE

    Meliana

    2013-01-01

    Integer Programming is a specific linear programming where the variables of decision are integer. There are so many kind of way to finish this integer programming; one of them is Branch and Price method. Like Branch and Bound method, in the step to finish the integer programming in Branch and Price method need the iterations that are too long. To make the iteration to be short then should be given the lower bound.

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

    Science.gov (United States)

    National Center for Education Statistics, 2013

    2013-01-01

    This paper provides Appendix D, Standard Error tables, for the full report, entitled. "Literacy, Numeracy, and Problem Solving in Technology-Rich Environments among U.S. Adults: Results from the Program for the International Assessment of Adult Competencies 2012. First Look. NCES 2014-008." The full report presents results of the Program for the…

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

  18. Bank branches in supermarkets

    OpenAIRE

    Lawrence J. Radecki; John Wenninger; Daniel Orlow

    1996-01-01

    The largest U.S. commercial banks are restructuring their retail operations to reduce the cost disadvantage resulting from a stagnant deposit base and stiffer competition. As part of this effort, some banks are opening "supermarket," or "in-store," branches: a new type of banking office within a large retail outlet. An alternative to the traditional bank office, the supermarket branch enables banks to improve the efficiency of the branch network and offer greater convenience to customers.

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

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

    Science.gov (United States)

    Raja, Muhammad Asif Zahoor; Zameer, Aneela; Khan, Aziz Ullah; Wazwaz, Abdul Majid

    2016-01-01

    In this study, a novel bio-inspired computing approach is developed to analyze the dynamics of nonlinear singular Thomas-Fermi equation (TFE) arising in potential and charge density models of an atom by exploiting the strength of finite difference scheme (FDS) for discretization and optimization through genetic algorithms (GAs) hybrid with sequential quadratic programming. The FDS procedures are used to transform the TFE differential equations into a system of nonlinear equations. A fitness function is constructed based on the residual error of constituent equations in the mean square sense and is formulated as the minimization problem. Optimization of parameters for the system is carried out with GAs, used as a tool for viable global search integrated with SQP algorithm for rapid refinement of the results. The design scheme is applied to solve TFE for five different scenarios by taking various step sizes and different input intervals. Comparison of the proposed results with the state of the art numerical and analytical solutions reveals that the worth of our scheme in terms of accuracy and convergence. The reliability and effectiveness of the proposed scheme are validated through consistently getting optimal values of statistical performance indices calculated for a sufficiently large number of independent runs to establish its significance. PMID:27610319

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

    OpenAIRE

    Cartreine, James A.; Chang, Trina E.; Seville, Janette L.; Luis Sandoval; John B. Moore; Shuai Xu; Hegel, Mark T.

    2012-01-01

    Problem-solving treatment (PST) offers a promising approach to the depression care; however, few PST training opportunities exist. A computer-guided, interactive media program has been developed to deliver PST electronically (ePST), directly to patients. The program is a six-session, weekly intervention modeled on an evidence-based PST protocol. Users are guided through each session by a clinician who is presented via hundreds of branching audio and video clips. Because expert clinician behav...

  2. How Is Health Related to Literacy, Numeracy, and Technological Problem-Solving Skills among U.S. Adults? Evidence from the Program for the International Assessment of Adult Competencies (PIAAC)

    Science.gov (United States)

    Prins, Esther; Monnat, Shannon; Clymer, Carol; Toso, Blaire Wilson

    2015-01-01

    This paper uses data from the Program for the International Assessment of Adult Competencies (PIAAC) to analyze the relationship between U.S. adults' self-reported health and proficiencies in literacy, numeracy, and technological problem solving. Ordinal logistic regression analyses showed that scores on all three scales were positively and…

  3. Design of planar articulated mechanisms using branch and bound

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Kawamoto, Atsushi

    2005-01-01

    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...... convergence of the method, two different types of convex relaxations are derived. The relaxations are strengthened by adding valid inequalities to the feasible set and by solving bound contraction sub-problems. Encouraging computational results indicate that the branch and bound method can reliably solve...

  4. Design of planar articulated mechanisms using branch and bound

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Kawamoto, Atsushi

    2004-01-01

    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...... convergence of the method, two different types of convex relaxations are derived. The relaxations are strengthened by adding valid inequalities to the feasible set and by solving bound contraction sub-problems. Encouraging computational results indicate that the branch and bound method can reliably solve...

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

  6. The Olive Branch Awards.

    Science.gov (United States)

    Harnack, William

    1984-01-01

    The first annual Olive Branch Awards, sponsored by the Writers' and Publishers Alliance and the Editors' Organizing Committee, were given to ten magazines, out of 60 that submitted entries. Winning entries are described briefly. (IM)

  7. Koenigs function and branching processes

    OpenAIRE

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

  8. PERSONALISED DENTURES WITH BRANCHING TECHNIQUE

    Directory of Open Access Journals (Sweden)

    Puneet

    2012-12-01

    Full Text Available ABSTRACT: While the basic process of making dentures has chang ed little over the past several decades, new materials and techniques can help labor atories and clinicians provide functional, esthetic restorations that offer exceptional value t o patients. Unlike the conventional “linear” methods which foll ow specific steps in a cookbook fashion, the Branching Technique is a dynamic conce pt which can be adjusted to meet the clinical needs of each patient. This customized tec hnique allows for a “trial” denture to be worn by each patient that is used to pinpoint and solve th e patient’s denture problems before the final denture is made. This individualized approach helps t o eliminate disappointments or surprises. From the preliminary impressions and the “training” d enture (it’s actually a provisional denture to the functional impressions and porcelain teeth to hold the patient’s vertical dimension, the Branching Technique produces the most esthetically pleasing and functionally stable dentures possible.

  9. Synthesis of branched polysaccharides with tunable degree of branching

    NARCIS (Netherlands)

    Ciric, Jelena; Loos, Katja

    2013-01-01

    An in vitro enzyme-catalyzed tandem reaction using the enzymes phosphorylase b from rabbit muscle and Deinococcus geothermalis glycogen branching enzyme (Dg GBE) to obtain branched polyglucans with tunable degree of branching (2% divided by 13%) is presented. The tunable degree of branching is obtai

  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 in...... men vs. 0.5%/2.3% in women, P <0.001). Significant predictors of newly acquired RBBB were male gender, increasing age, high systolic blood pressure, and presence of IRBBB, whereas predictors of newly acquired IRBBB were male gender, increasing age, and low BMI. Right bundle branch block was associated...... with significantly increased all-cause and cardiovascular mortality in both genders with age-adjusted hazard ratios (HR) of 1.31 [95% confidence interval (CI), 1.11-1.54] and 1.87 (95% CI, 1.48-2.36) in the gender pooled analysis with little attenuation after multiple adjustment. Right bundle branch...

  11. ANALYSIS OF THE FINANCIAL AND ECONOMIC CONDITION OF THE COMPANIES OF THE BUILDING BRANCH OF THE KRASNODAR REGION USING THE FINANCIAL EXPERT PROGRAM

    Directory of Open Access Journals (Sweden)

    Zaikina L. N.

    2015-04-01

    Full Text Available In the article we describe the created automated software complex called “Financial expert” allowing to carry out a financial and economic assessment of the company on the basis of such models as Altman in various options, Springate, Taffler, 2 factor analysis, discriminant analysis, ratio analysis, fuzzy - set analysis method condition of the enterprise and neural network technology. The developed automated complex was created for the analysis of the condition of companies; it can be implemented in the Russian Federation and is used at the solution of problems of an assessment, the analysis and diagnostics of a financial and economic condition of companies. Using the "Financial Expert" software complex in the article we have examined the enterprises of the construction branch of the Krasnodar region (data taken from 2010 to 2012, the comparative analysis of different models and methods was also carried out. It was found that the classical model implemented by Western companies (Altman, Taffler, Springate in less than 50% of cases gave the correct result, whereas the one that was adapted for Russian enterprises (R-accounts model gave reliable results in 63% of cases. From the models and the methods proposed by the author, the weakest one was the method of cluster analysis, 75% of the remaining models showed a higher percentage of certainty

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

  13. Persistence-Based Branch Misprediction Bounds for WCET Analysis

    DEFF Research Database (Denmark)

    Puffitsch, Wolfgang

    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...... dynamic branch predictors. To handle interferences between branch instructions we use the notion of persistence, a concept that is also found in cache analyses. The bounds apply to branches in general, not only to branches that close a loop. Furthermore, the bounds can be easily integrated into integer...... linear programming formulations of the WCET problem. An evaluation on a number of benchmarks shows that with these bounds, dynamic branch prediction does not necessarily lead to higher WCET bounds than static prediction schemes....

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

  15. Towards a taxonomy of parallel branch and bound algorithms

    OpenAIRE

    Trienekens, H.W.J.M.; Bruin, Arie

    1992-01-01

    textabstractIn this paper we present a classification of parallel branch and bound algorithms, and elaborate on the consequences of particular parameter settings. The taxonomy is based upon how the algorithms handle the knowledge about the problem instance to be solved, generated during execution. The starting point of the taxonomy is the generally accepted description of the sequential branch and bound algorithm, as presented in, for example, [Mitten 1970] and [Ibaraki 1976a, 1976b, 1977a, 1...

  16. An ellipsoidal branch and bound algorithm for global optimization

    OpenAIRE

    Hager, William; Phan, Dzung

    2009-01-01

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

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

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

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

    OpenAIRE

    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 example of a system which offers the possibility to incorporate user-provided directives (written in {\\sc C}) to guide the branch-and-bound search. Its main focus, however, remains on mathematical p...

  20. Branching-rate expansion around annihilating random walks.

    Science.gov (United States)

    Benitez, Federico; Wschebor, Nicolás

    2012-07-01

    We present some exact results for branching and annihilating random walks. We compute the nonuniversal threshold value of the annihilation rate for having a phase transition in the simplest reaction-diffusion system belonging to the directed percolation universality class. Also, we show that the accepted scenario for the appearance of a phase transition in the parity conserving universality class must be improved. In order to obtain these results we perform an expansion in the branching rate around pure annihilation, a theory without branching. This expansion is possible because we manage to solve pure annihilation exactly in any dimension. PMID:23005353

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

    DEFF Research Database (Denmark)

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

    2008-01-01

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

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

  3. Holographic Coulomb branch vevs

    CERN Document Server

    Skenderis, K; Skenderis, Kostas; Taylor, Marika

    2006-01-01

    We compute holographically the vevs of all chiral primary operators for supergravity solutions corresponding to the Coulomb branch of N=4 SYM and find exact agreement with the corresponding field theory computation. Using the dictionary between 10d geometries and field theory developed to extract these vevs, we propose a gravity dual of a half supersymmetric deformation of N=4 SYM by certain irrelevant operators.

  4. Modeling branching in cereals

    OpenAIRE

    Jochem B. Evers; Vos, Jan

    2013-01-01

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

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

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

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

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

  10. Thinking and problem solving

    OpenAIRE

    Frensch, Peter; Funke, Joachim

    2005-01-01

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

  11. Thermal Energy Conversion Branch

    Science.gov (United States)

    Bielozer, Matthew C.; Schreiber, Jeffrey, G.; Wilson, Scott D.

    2004-01-01

    The Thermal Energy Conversion Branch (5490) leads the way in designing, conducting, and implementing research for the newest thermal systems used in space applications at the NASA Glenn Research Center. Specifically some of the most advanced technologies developed in this branch can be broken down into four main areas: Dynamic Power Systems, Primary Solar Concentrators, Secondary Solar Concentrators, and Thermal Management. Work was performed in the Dynamic Power Systems area, specifically the Stirling Engine subdivision. Today, the main focus of the 5490 branch is free-piston Stirling cycle converters, Brayton cycle nuclear reactors, and heat rejection systems for long duration mission spacecraft. All space exploring devices need electricity to operate. In most space applications, heat energy from radioisotopes is converted to electrical power. The Radioisotope Thermoelectric Generator (RTG) already supplies electricity for missions such as the Cassini Spacecraft. The focus of today's Stirling research at GRC is aimed at creating an engine that can replace the RTG. The primary appeal of the Stirling engine is its high system efficiency. Because it is so efficient, the Stirling engine will significantly reduce the plutonium fuel mission requirements compared to the RTG. Stirling is also being considered for missions such as the lunar/Mars bases and rovers. This project has focused largely on Stirling Engines of all types, particularly the fluidyne liquid piston engine. The fluidyne was developed by Colin D. West. This engine uses the same concepts found in any type of Stirling engine, with the exception of missing mechanical components. All the working components are fluid. One goal was to develop and demonstrate a working Stirling Fluidyne Engine at the 2nd Annual International Energy Conversion Engineering Conference in Providence, Rhode Island.

  12. Solving Large Quadratic|Assignment Problems in Parallel

    DEFF Research Database (Denmark)

    Clausen, Jens; Perregaard, Michael

    1997-01-01

    Quadratic Assignment problems are in practice among the most difficult to solve in the class of NP-complete problems. The only successful approach hitherto has been Branch-and-Bound-based algorithms, but such algorithms are crucially dependent on good bound functions to limit the size of the space...... and recalculation of bounds between branchings when used in a parallel Branch-and-Bound algorithm. The algorithm has been implemented on a 16-processor MEIKO Computing Surface with Intel i860 processors. Computational results from the solution of a number of large QAPs, including the classical Nugent...

  13. Teaching through Problem Solving

    Science.gov (United States)

    Fi, Cos D.; Degner, Katherine M.

    2012-01-01

    Teaching through Problem Solving (TtPS) is an effective way to teach mathematics "for" understanding. It also provides students with a way to learn mathematics "with" understanding. In this article, the authors present a definition of what it means to teach through problem solving. They also describe a professional development vignette that…

  14. Mathematical Problem Solving.

    Science.gov (United States)

    Mayer, Richard E.

    This chapter examines research on the cognitive processes involved in mathematical problem solving. The introduction includes definitions of key terms and a summary of four cognitive processes used in mathematical problem solving: (1) translating; (2) integrating; (3) planning; and (4) executing. Examples are then provided and exemplary research…

  15. A Branch and Bound Method for the Open Shop Problem

    OpenAIRE

    Brucker, P; Hurink, J.L.; Jurisch, B.; Wöstmann, B.

    1997-01-01

    A fast branch & bound method for the open-shop problem based on a disjunctive graph formulation of the problem is developed. Computational results show that the method yields excellent results. Some benchmark problems from the literature were solved to optimality for the first time.

  16. Design and Calculation of the New Distribution Network Branch

    OpenAIRE

    Frechová, L.

    2015-01-01

    The aim of the project is to provide a summary about design and calculation of the new distribution network branch. It solves the problem of the selection of a suitable transformer and conductor and it shows results of application of base calculation methods.

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

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

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

  1. Maritime Branch Analysis

    DEFF Research Database (Denmark)

    Mougaard, Krestine; Neugebauer, Line Maria; Garcia i Mateu, Adrià;

    after-sales service and have therefore embarked on business development activities that tightly combine product and service offerings in their portfolios. Closer customer contact, commoditisation of goods, total cost of ownership, and product liability are just some of the reasons for this transition......The vast majority of countries in the developed world are now dependent on their service sectors for between 70-80% of their gross domestic product. Even companies with decades of expertise in producing manufactured products are experiencing an increased need to understand before-, during- and...... and influencing a move towards intensified service integration into business- and product development activities. The workbook has been created by condensing the transcripts and the insights we have gained from a wealth of studies across the maritime branch, and it serves to provide a unique insight...

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

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

  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

    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-and-cut-and-price......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......-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 are...... added dynamically to strengthen the relaxations. Some of the previously proposed inequalities for the PDPTW are also shown to be implied by the set partitioning formulation. Computational experiments indicate that the proposed algorithm outperforms a recent branch-and-cut algorithm....

  5. Solving Word Problems.

    Science.gov (United States)

    Karrison, Joan; Carroll, Margaret Kelly

    1991-01-01

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

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

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

  8. Solving Tommy's Writing Problems.

    Science.gov (United States)

    Burdman, Debra

    1986-01-01

    The article describes an approach by which word processing helps to solve some of the writing problems of learning disabled students. Aspects considered include prewriting, drafting, revising, and completing the story. (CL)

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

  11. Can the branching exponent reliably relate the branching indexes?

    Czech Academy of Sciences Publication Activity Database

    Netopilík, Miloš

    2015-01-01

    Roč. 24, č. 2 (2015), s. 80-84. ISSN 1022-1344 R&D Projects: GA ČR(CZ) GA13-02938S Institutional support: RVO:61389013 Keywords : branching exponent * branching indexes * intrinsic viscosity Subject RIV: CD - Macromolecular Chemistry Impact factor: 1.667, year: 2014

  12. On Branching Programs with Bounded Uncertainty

    Czech Academy of Sciences Publication Activity Database

    Jukna, S.; Žák, Stanislav

    Berlin: Springer, 1998 - (Larsen, K.; Skyum, S.; Winskel, G.), s. 259-270. (Lecture Notes in Computer Science. 1443). ISBN 3-540-64781-3. [ICALP'98 International Colloquium /25./. Aalborg (DK), 13.07.1998-17.07.1998] R&D Projects: GA ČR GA201/98/0717 Grant ostatní: MŠMT(CZ) OK 304; COPERNICUS(XE) IP961095 ALTEC-KIT Subject RIV: BA - General Mathematics http://www.springerlink.com/content/n2860047h75g6127/

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

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

    International Nuclear Information System (INIS)

    The RCP01 Monte Carlo program is used to analyze many geometries of interest in nuclear design and analysis of light water moderated reactors such as the core in its pressure vessel with complex piping arrangement, fuel storage arrays, shipping and container arrangements, and neutron detector configurations. Written in FORTRAN and in use on a variety of computers, it is capable of estimating steady state neutron or photon reaction rates and neutron multiplication factors. The energy range covered in neutron calculations is that relevant to the fission process and subsequent slowing-down and thermalization, i.e., 20 MeV to 0 eV. The same energy range is covered for photon calculations

  15. Integrated Networks Branch

    Science.gov (United States)

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

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

  17. Direct Heuristic Algorithm for Linear Programming

    Directory of Open Access Journals (Sweden)

    I. Ramesh Babu

    2013-08-01

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

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

    NARCIS (Netherlands)

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

    2004-01-01

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

  19. Annual report, Materials Science Branch, FY 1992

    Energy Technology Data Exchange (ETDEWEB)

    Padilla, S. [ed.

    1993-10-01

    This report summarizes the progress of the Materials Science Branch of the National Renewable Energy Laboratory (NREL) from October 1, 1991, through September 30, 1992. Six technical sections of the report cover these main areas of NREL`s in-house research: Crystal Growth, Amorphous Silicon, III-V High-Efficiency Photovoltaic Cells, Solid State Theory, Solid State Spectroscopy, and Program Management. Each section explains the purpose and major accomplishments of the work in the context of the US Department of Energy`s National Photovoltaic Research Program plans.

  20. Basis Reduction, and the Complexity of Branch-and-Bound

    OpenAIRE

    Pataki, Gabor; Tural, Mustafa

    2009-01-01

    The classical branch-and-bound algorithm for the integer feasibility problem has exponential worst case complexity. We prove that it is surprisingly efficient on reformulated problems, in which the columns of the constraint matrix are short, and near orthogonal, i.e. a reduced basis of the generated lattice; when the entries of A (the dense part of the constraint matrix) are from {1, ..., M} for a large enough M, branch-and-bound solves almost all reformulated instances at the rootnode. We al...

  1. Branch and peg algorithms for the simple plant location problem

    OpenAIRE

    Goldengorin, Boris; Ghosh, Diptesh; Sierksma, Gerard

    2001-01-01

    The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This problem of ten appears as a subproblem in other combinatorial problems. Several branch and bound techniques have been developed to solve these problems. In this paper we present a few techniques that enhance the performance of branch and bound algorithms. The new algorithms th...

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

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

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

    Institute of Scientific and Technical Information of China (English)

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

    2012-01-01

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

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

    OpenAIRE

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

    1987-01-01

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

  6. Transport equation solving methods

    International Nuclear Information System (INIS)

    This work is mainly devoted to Csub(N) and Fsub(N) methods. CN method: starting from a lemma stated by Placzek, an equivalence is established between two problems: the first one is defined in a finite medium bounded by a surface S, the second one is defined in the whole space. In the first problem the angular flux on the surface S is shown to be the solution of an integral equation. This equation is solved by Galerkin's method. The Csub(N) method is applied here to one-velocity problems: in plane geometry, slab albedo and transmission with Rayleigh scattering, calculation of the extrapolation length; in cylindrical geometry, albedo and extrapolation length calculation with linear scattering. Fsub(N) method: the basic integral transport equation of the Csub(N) method is integrated on Case's elementary distributions; another integral transport equation is obtained: this equation is solved by a collocation method. The plane problems solved by the Csub(N) method are also solved by the Fsub(N) method. The Fsub(N) method is extended to any polynomial scattering law. Some simple spherical problems are also studied. Chandrasekhar's method, collision probability method, Case's method are presented for comparison with Csub(N) and Fsub(N) methods. This comparison shows the respective advantages of the two methods: a) fast convergence and possible extension to various geometries for Csub(N) method; b) easy calculations and easy extension to polynomial scattering for Fsub(N) method

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

  8. Problem Solving with Patents

    Science.gov (United States)

    Moore, Jerilou; Sumrall, William J.

    2008-01-01

    Exploring our patent system is a great way to engage students in creative problem solving. As a result, the authors designed a teaching unit that uses the study of patents to explore one avenue in which scientists and engineers do science. Specifically, through the development of an idea, students learn how science and technology are connected.…

  9. On Solving Linear Recurrences

    Science.gov (United States)

    Dobbs, David E.

    2013-01-01

    A direct method is given for solving first-order linear recurrences with constant coefficients. The limiting value of that solution is studied as "n to infinity." This classroom note could serve as enrichment material for the typical introductory course on discrete mathematics that follows a calculus course.

  10. Simon on problem solving

    DEFF Research Database (Denmark)

    Foss, Kirsten; Foss, Nicolai Juul

    2006-01-01

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

  11. Universal Design Problem Solving

    Science.gov (United States)

    Sterling, Mary C.

    2004-01-01

    Universal design is made up of four elements: accessibility, adaptability, aesthetics, and affordability. This article addresses the concept of universal design problem solving through experiential learning for an interior design studio course in postsecondary education. Students' experiences with clients over age 55 promoted an understanding of…

  12. The use of nuclear energy for district heating. The branch program of activities. NIKIET design efforts on the advanced nuclear co-generation plant with VK-300 reactor, the Ruta nuclear heating plant and small power units

    International Nuclear Information System (INIS)

    Full text: District heating is among the top priorities of the state economic and energy policy of Russia and is the largest and expanding sector of the national power industry. The nuclear sources of energy are regarded as the promising option for this sector of the power industry. The branch program of activities which is being implemented is intended for developing the policy and program of nuclear district heating. The priority task is to provide co-generated heat from the NPPs and nuclear co-generation plants to the amount of 30 mln Gcal/year by 2020 as specified in the Energy Policy of Russia for the period until 2020. NIKIET named after N.A. Dollezhal has been developing the special purpose reactor facilities for the power units of the nuclear co-generation plants and nuclear heating plants. The detailed design of the power unit with the simplified passive boiling water reactor VK-300 has been developed for the nuclear co-generation plant (NCP) intended to be deployed in the large-scale power industry. It has been demonstrated that NCP with VK-300 reactor is competitive with respect to the operating and advanced fossil thermal co-generation plants. It is envisaged to construct the four-unit first of-the-kind NCP with VK-300 reactor in Arkhangelsk region. The nuclear heating plant based on the pool RUTA reactors operating under atmospheric pressure is being developed for the small towns. It is planned to construct the pilot plant of such kind on the site of RF State Research Center FEI, Obninsk. In the frame of conversion of the defense-oriented works NIKIET has developed the UNITHERM reactor facility for a small NPP to be located in the distant and difficult-to access regions of Russia. To provide heat and electricity to the small communities, meteorological observatories, lighthouses and radio navigation stations in a reliable and safe way, it is possible to use non-attended small nuclear power plants based on the self-regulating water-water reactor and

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

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

  15. 75 FR 62692 - Dairy Import Licensing Program

    Science.gov (United States)

    2010-10-13

    ... the historical license reduction provisions of the Dairy Import Licensing Program, 7 CFR part 6, for a... this proposed rule to Ron Lord, Branch Chief, Sugar and Dairy Branch, Import and Trade Support Programs... CONTACT: Ron Lord, Branch Chief, Sugar and Dairy Branch, Import and Trade Support Programs...

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

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

    Institute of Scientific and Technical Information of China (English)

    都成娟; 李和成

    2012-01-01

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

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

  19. A Branch and Cut algorithm for the container shipping network design problem

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Kallehauge, Brian; Pisinger, David

    The network design problem in liner shipping is of increasing importance in a strongly competitive market where potential cost reductions can influence market share and profits significantly. In this paper the network design and fleet assignment problems are combined into a mixed integer linear...... programming model minimizing the overall cost. To better reflect the real-life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependant capacities, and butterfly routes. To the best of our knowledge it is the first time an exact solution method to the problem considers...... transhipment cost. The problem is solved with branch-and-cut using clover and transhipment inequalities. Computational results are reported for instances with up to 15 ports....

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

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

  2. Crossword solving mobile application

    OpenAIRE

    Pencelj, Andraž

    2013-01-01

    The thesis describes development of crossword solving mobile application with PhoneGap framework. The emphasis is on application development for Android platform. Thesis describes only application which runs on mobile devices without server-side part. First part of thesis describes crosswords and their history. It also describes technologies which were used. Emphasis is on describing PhoneGap framework and mobile web browsers. PhoneGap framework is used to develop native applications for m...

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

    Institute of Scientific and Technical Information of China (English)

    王纯子; 郭伟; 张斌

    2013-01-01

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

  4. March dl: Adding Adaptive Heuristics and a New Branching Strategy

    Directory of Open Access Journals (Sweden)

    Marijn J.H. Heule

    2006-03-01

    Full Text Available We introduce the march dl satisfiability (SAT solver, a successor of march eq. The latter was awarded state-of-the-art in two categories during the Sat 2004 competition. The focus lies on presenting those features that are new in march dl. Besides a description, each of these features is illustrated with some experimental results. By extending the pre-processor, using adaptive heuristics, and by using a new branching strategy, march dl is able to solve nearly all benchmarks faster than its predecessor. Moreover, various instances which were beyond the reach of march eq, can now be solved - relatively easily - due to these new features.

  5. A Branch and Bound Method for Stochastic Global Optimization

    OpenAIRE

    V.I. Norkin; G.C. Pflug; Ruszczynski, A.

    1996-01-01

    A stochastic version of the branch and bound method is proposed for solving stochastic global optimization problems. The method, instead of deterministic bounds, uses stochastic upper and lower estimates of the optimal value of subproblems, to guide the partitioning process. Almost sure convergence of the method is proved and random accuracy estimates derived. Methods for constructing random bounds for stochastic global optimization problems are discussed. The theoretical considerations are i...

  6. NASA Glenn Research Center Electrochemistry Branch Overview

    Science.gov (United States)

    Manzo, Michelle A.; Hoberecht, Mark; Reid, Concha

    2010-01-01

    This presentation covers an overview of NASA Glenn's history and heritage in the development of electrochemical systems for aerospace applications. Current programs related to batteries and fuel cells are addressed. Specific areas of focus are Li-ion batteries and Polymer Electrolyte Membrane Fuel cells systems and their development for future Exploration missions. The presentation covers details of current component development efforts for high energy and ultra high energy Li-ion batteries and non-flow-through fuel cell stack and balance of plant development. Electrochemistry Branch capabilities and facilities are also addressed.

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

  8. Solving Equations of Multibody Dynamics

    Science.gov (United States)

    Jain, Abhinandan; Lim, Christopher

    2007-01-01

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

  9. Solving Diophantine Equations

    OpenAIRE

    Cira, Octavian; Smarandache, Florentin

    2016-01-01

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

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

  11. Path integral formulation and Feynman rules for phylogenetic branching models

    International Nuclear Information System (INIS)

    A dynamical picture of phylogenetic evolution is given in terms of Markov models on a state space, comprising joint probability distributions for character types of taxonomic classes. Phylogenetic branching is a process which augments the number of taxa under consideration, and hence the rank of the underlying joint probability state tensor. We point out the combinatorial necessity for a second-quantized, or Fock space setting, incorporating discrete counting labels for taxa and character types, to allow for a description in the number basis. Rate operators describing both time evolution without branching, and also phylogenetic branching events, are identified. A detailed development of these ideas is given, using standard transcriptions from the microscopic formulation of non-equilibrium reaction-diffusion or birth-death processes. These give the relations between stochastic rate matrices, the matrix elements of the corresponding evolution operators representing them, and the integral kernels needed to implement these as path integrals. The 'free' theory (without branching) is solved, and the correct trilinear 'interaction' terms (representing branching events) are presented. The full model is developed in perturbation theory via the derivation of explicit Feynman rules which establish that the probabilities (pattern frequencies of leaf colourations) arising as matrix elements of the time evolution operator are identical with those computed via the standard analysis. Simple examples (phylogenetic trees with two or three leaves), are discussed in detail. Further implications for the work are briefly considered including the role of time reparametrization covariance

  12. Introducing artificial intelligence into structural optimization programs

    International Nuclear Information System (INIS)

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

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

  14. A branch and bound method for the job-shop problem with sequence-dependent setup times

    OpenAIRE

    Artigues, Christian; Feillet, Dominique

    2007-01-01

    This paper deals with the job-shop scheduling problem with sequence-dependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The method is based on iterative solving via branch and bound decisional versions of the problem. At each node of the branch and bound tree, constraint propagation algorithms adapted to setup times are performed for domain filtering and feasibility check. Relaxations based on the traveling salesman problem with time window...

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

  16. Computer simulation of long-chain branching and branching indexes

    Czech Academy of Sciences Publication Activity Database

    Netopilík, Miloš

    Vienna : University of Vienna, 2014. s. 22. [International Conference on Polymer Behaviour /6./. 22.09.2014-26.09.2014, Vienna] R&D Projects: GA ČR(CZ) GA13-02938S Institutional support: RVO:61389013 Keywords : branching indexes * intrinsic viscosity * radius of gyration Subject RIV: CD - Macromolecular Chemistry

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

    Institute of Scientific and Technical Information of China (English)

    薛峰; 陈刚; 高尚

    2011-01-01

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

  18. A Branch and Bound Approach for Truss Topology Design Problems with Valid Inequalities

    International Nuclear Information System (INIS)

    One of the classical problems in the structural optimization field is the Truss Topology Design Problem (TTDP) which deals with the selection of optimal configuration for structural systems for applications in mechanical, civil, aerospace engineering, among others. In this paper we consider a TTDP where the goal is to find the stiffest truss, under a given load and with a bound on the total volume. The design variables are the cross-section areas of the truss bars that must be chosen from a given finite set. This results in a large-scale non-convex problem with discrete variables. This problem can be formulated as a Semidefinite Programming Problem (SDP problem) with binary variables. We propose a branch and bound algorithm to solve this problem. In this paper it is considered a binary formulation of the problem, to take advantage of its structure, which admits a Knapsack problem as subproblem. Thus, trying to improve the performance of the Branch and Bound, at each step, some valid inequalities for the Knapsack problem are included.

  19. Solving Differential Equations in R: Package deSolve

    Science.gov (United States)

    In this paper we present the R package deSolve to solve initial value problems (IVP) written as ordinary differential equations (ODE), differential algebraic equations (DAE) of index 0 or 1 and partial differential equations (PDE), the latter solved using the method of lines appr...

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

    Science.gov (United States)

    Sui, Haiteng; Niu, Wentie

    2016-05-01

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

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

  2. Branching of keratin intermediate filaments.

    Science.gov (United States)

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

    2016-06-01

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

  3. Multi-Level Flow Branching

    Czech Academy of Sciences Publication Activity Database

    Tesař, Václav

    Praha: UTAM AV ČR, 2006 - (Náprstek, J.; Fischer, C.), s. 380-381 ISBN 80-86246-27-2. [Engineering mechanics 2006 : national conference with international participation. Svratka (CZ), 15.05.2006-18.05.2006] Institutional research plan: CEZ:AV0Z20760514 Keywords : branching * respiratory system * aortic system * microfluidics Subject RIV: BK - Fluid Dynamics

  4. 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. PMID:24010026

  5. Fluid Flow at Branching Junctions

    OpenAIRE

    Sochi, Taha

    2013-01-01

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

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

  7. Efficient Implementation Of Branch-And-Bound Method On Desktop Grids

    Directory of Open Access Journals (Sweden)

    Bo Tian

    2014-01-01

    Full Text Available The Berkeley Open Infrastructure for Network Computing (BOINC is an opensource middleware system for volunteer and desktop grid computing. In this paper we propose BNBTEST, a BOINC version of distributed branch and bound method. The crucial issues of distributed branch-and-bound method are traversing the search tree and loading balance. We developed subtaskspackaging method and three dierent subtasks' distribution strategies to solve these.

  8. A Branch and Bound Algorithm for Project Scheduling Problem with Spatial Resource Constraints

    OpenAIRE

    Shicheng Hu; Song Wang; Yonggui Kao; Takao Ito; Xuedong Sun

    2015-01-01

    With respect to the block assembly schedule in a shipbuilding enterprise, a spatial resource constrained project scheduling problem (SRCPSP) is proposed, which aims to minimize the makespan of a project under the constraints of the availability of a two-dimensional spatial resource and the precedence relationship between tasks. In order to solve SRCPSP to the optimum, a branch and bound algorithm (BB) is developed. For the BB-SRCPSP, first, an implicitly enumerative branch scheme is presented...

  9. Efficient Implementation Of Branch-And-Bound Method On Desktop Grids

    OpenAIRE

    Bo Tian; Mikhail Posypkin

    2014-01-01

    The Berkeley Open Infrastructure for Network Computing (BOINC) is an opensource middleware system for volunteer and desktop grid computing. In this paper we propose BNBTEST, a BOINC version of distributed branch and bound method. The crucial issues of distributed branch-and-bound method are traversing the search tree and loading balance. We developed subtaskspackaging method and three dierent subtasks' distribution strategies to solve these.

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    1978-08-01

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

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

    OpenAIRE

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

    2004-01-01

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

  13. Conflict-driven ASP Solving with External Sources

    OpenAIRE

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

    2012-01-01

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

  14. Branch and bound algorithms for rate-distortion optimized media streaming

    OpenAIRE

    Röder, Martin; Cardinal, Jean; Hamzaoui, Raouf

    2006-01-01

    We consider the problem of ratedistortion optimized streaming of packetized multimedia data over a single quality of service network using feedback and retransmissions. For a single data unit, we prove that the problem is NP-hardand provide efficient branch and bound algorithms that are much faster than the previously best solution based on dynamic programming. For a group of interdependent data units, we show how to compute optimal solutions with branch and bound algorithms. The branch and b...

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

  16. Side-branch technique for difficult guidewire placement in coronary bifurcation lesion.

    Science.gov (United States)

    He, Xingwei; Gao, Bo; Liu, Yujian; Li, Zhuxi; Zeng, Hesong

    2016-01-01

    Despite tremendous advances in technology and skills, percutaneous coronary intervention (PCI) of bifurcation lesion (BL) remains a particular challenge for the interventionalist. During bifurcation PCI, safe guidewire placement in the main branch (MB) and the side branch (SB) is the first step for successful procedure. However, in certain cases, the complex pattern of vessel anatomy and the mix of plaque distribution may make target vessel wiring highly challenging. Therefore, specific techniques are required for solving this problem. Hereby, we describe a new use of side-branch technique for difficult guidewire placement in BL. PMID:25842349

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

    International Nuclear Information System (INIS)

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

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

    DEFF Research Database (Denmark)

    Görtz, Simon; Klose, Andreas

    This paper presents a simple branch-and-bound method based on Lagrangean relaxation and subgradient optimization for solving large instances of the capacitated facility location problem (CFLP) to optimality. In order to guess a primal solution to the Lagrangean dual, we average solutions to the...... Lagrangean subproblem. Branching decisions are then based on this estimated (fractional) primal solution. Extensive numerical results reveal that the method is much more faster and robust than other state-of-the-art methods for solving the CFLP exactly....

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

    Institute of Scientific and Technical Information of China (English)

    张莉; 冯大政; 李宏

    2012-01-01

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

  20. Branching processes in disease epidemics

    Science.gov (United States)

    Singh, Sarabjeet

    Branching processes have served as a model for chemical reactions, biological growth processes and contagion (of disease, information or fads). Through this connection, these seemingly different physical processes share some common universalities that can be elucidated by analyzing the underlying branching process. In this thesis, we focus on branching processes as a model for infectious diseases spreading between individuals belonging to different populations. The distinction between populations can arise from species separation (as in the case of diseases which jump across species) or spatial separation (as in the case of disease spreading between farms, cities, urban centers, etc). A prominent example of the former is zoonoses -- infectious diseases that spill from animals to humans -- whose specific examples include Nipah virus, monkeypox, HIV and avian influenza. A prominent example of the latter is infectious diseases of animals such as foot and mouth disease and bovine tuberculosis that spread between farms or cattle herds. Another example of the latter is infectious diseases of humans such as H1N1 that spread from one city to another through migration of infectious hosts. This thesis consists of three main chapters, an introduction and an appendix. The introduction gives a brief history of mathematics in modeling the spread of infectious diseases along with a detailed description of the most commonly used disease model -- the Susceptible-Infectious-Recovered (SIR) model. The introduction also describes how the stochastic formulation of the model reduces to a branching process in the limit of large population which is analyzed in detail. The second chapter describes a two species model of zoonoses with coupled SIR processes and proceeds into the calculation of statistics pertinent to cross species infection using multitype branching processes. The third chapter describes an SIR process driven by a Poisson process of infection spillovers. This is posed as a

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

  2. Branching problems of unitary representations

    OpenAIRE

    Kobayashi, Toshiyuki

    2003-01-01

    The irreducible decomposition of a unitary representation often contains continuous spectrum when restricted to a non-compact subgroup. The author singles out a nice class of branching problems where each irreducible summand occurs discretely with finite multiplicity (admissible restrictions). Basic theory and new perspectives of admissible restrictions are presented from both analytic and algebraic view points. We also discuss some applications of admissible restrictions to modular varieties...

  3. Cash efficiency for bank branches

    OpenAIRE

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

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

  5. Creep of welded branched pipes

    OpenAIRE

    Rayner, Glen

    2004-01-01

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

  6. Interactions between Axillary Branches of Arabidopsis

    Institute of Scientific and Technical Information of China (English)

    Veronica Ongaro; Katherine Bainbridge; Lisa Williamson; Ottoline Leyser

    2008-01-01

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

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

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

  9. Robotics and Children: Science Achievement and Problem Solving.

    Science.gov (United States)

    Wagner, Susan Preston

    1999-01-01

    Compared the impact of robotics (computer-powered manipulative) to a battery-powered manipulative (novelty control) and traditionally taught science class on science achievement and problem solving of fourth through sixth graders. Found that the robotics group had higher scores on programming logic-problem solving than did the novelty control…

  10. Solving Functional Constraints by Variable Substitution

    CERN Document Server

    Zhang, Yuanlin

    2010-01-01

    Functional constraints and bi-functional constraints are an important constraint class in Constraint Programming (CP) systems, in particular for Constraint Logic Programming (CLP) systems. CP systems with finite domain constraints usually employ CSP-based solvers which use local consistency, for example, arc consistency. We introduce a new approach which is based instead on variable substitution. We obtain efficient algorithms for reducing systems involving functional and bi-functional constraints together with other non-functional constraints. It also solves globally any CSP where there exists a variable such that any other variable is reachable from it through a sequence of functional constraints. Our experiments on random problems show that variable elimination can significantly improve the efficiency of solving problems with functional constraints.

  11. Workshop on Branching Processes and Their Applications

    CERN Document Server

    Gonzalez Velasco, Miguel; Martinez, Rodrigo; Molina, Manuel

    2010-01-01

    Contains papers presented at the Workshop on Branching Processes and Their Applications (WBPA09), held in Badajoz, Spain, April 20-23, 2009, which deal with theoretical and practical aspects of branching process theory

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

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

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

  16. The Effects of a Branch Campus

    Science.gov (United States)

    Lien, Donald; Wang, Yaqin

    2012-01-01

    We examine the effects of a branch campus on the social welfare of the host country and the foreign university. Overall, we find that a branch campus increases both the domestic social welfare (measured by the aggregate student utility) and the tuition revenue of the foreign university. The effect of a branch campus on the brain drain is…

  17. Identifying thermal cycling mechanisms in PWR branch line piping

    Energy Technology Data Exchange (ETDEWEB)

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

    2002-07-01

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

  18. On the Applicability of Lower Bounds for Solving Rectilinear

    DEFF Research Database (Denmark)

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

    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. Rec...... Branch-and-Bound code solving large scale QAPs.......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...

  19. FY 1991 Measurements and Characterization Branch annual report

    Energy Technology Data Exchange (ETDEWEB)

    Osterwald, C.R.; Dippo, P.C. [eds.

    1992-11-01

    The Measurements and Characterization Branch of the National Renewable Laboratory (NREL) provides comprehensive photovoltaic (PV) materials, devices, characterization, measurement, fabrication, modeling research, and support for the international PV research community, in the context of the US Department of Energy`s Photovoltaic Research Program goals. This report summarizes the progress of the Branch from 31 January 1991 through 31 January 1992. The eight technical sections present a succinct overview of the capabilities and accomplishments of each group in the Branch. The Branch is comprised of the following groups: Surface and interface Analysis; Materials Characterization; Device Development; Electro-optical Characterization; Advanced PV module Performance and Reliability Research; Cell Performance Characterization; Surface Interactions, Modification, and Stability; and FTIR Spectroscopic Research. The including measurements and tests of PV materials, cells, submodules, and modules. The report contains a comprehensive bibliography of 77 branch originated journal and conference publications, which were authored in collaboration with, or in support of, approximately 135 university, industrial, government, and in-house research groups.

  20. FY 1991 Measurements and Characterization Branch annual report

    Energy Technology Data Exchange (ETDEWEB)

    Osterwald, C.R.; Dippo, P.C. (eds.)

    1992-11-01

    The Measurements and Characterization Branch of the National Renewable Laboratory (NREL) provides comprehensive photovoltaic (PV) materials, devices, characterization, measurement, fabrication, modeling research, and support for the international PV research community, in the context of the US Department of Energy's Photovoltaic Research Program goals. This report summarizes the progress of the Branch from 31 January 1991 through 31 January 1992. The eight technical sections present a succinct overview of the capabilities and accomplishments of each group in the Branch. The Branch is comprised of the following groups: Surface and interface Analysis; Materials Characterization; Device Development; Electro-optical Characterization; Advanced PV module Performance and Reliability Research; Cell Performance Characterization; Surface Interactions, Modification, and Stability; and FTIR Spectroscopic Research. The including measurements and tests of PV materials, cells, submodules, and modules. The report contains a comprehensive bibliography of 77 branch originated journal and conference publications, which were authored in collaboration with, or in support of, approximately 135 university, industrial, government, and in-house research groups.

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

    Institute of Scientific and Technical Information of China (English)

    Cheol Hong Kim; Sung Woo Chung; Chu Shik Jhon

    2005-01-01

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

  2. March dl: Adding Adaptive Heuristics and a New Branching Strategy

    OpenAIRE

    Marijn J.H. Heule; Hans van Maaren

    2006-01-01

    We introduce the march dl satisfiability (SAT) solver, a successor of march eq. The latter was awarded state-of-the-art in two categories during the Sat 2004 competition. The focus lies on presenting those features that are new in march dl. Besides a description, each of these features is illustrated with some experimental results. By extending the pre-processor, using adaptive heuristics, and by using a new branching strategy, march dl is able to solve nearly all benchmarks faster than its ...

  3. Optimal material selection using branch and bound techniques

    Science.gov (United States)

    Sepulveda, A. E.

    1993-01-01

    A methodology for structural synthesis is presented in which the optimal material selection for the structural members is treated in terms of (0,1) variables. Structural member sizes and material selection variables are treated simultaneously as design variables. Optimization is carried out by generating and solving a sequence of explicit approximate problems using a branch and bound strategy. Intermediate design variables and intermediate response quantities are used to enhance the quality of the approximate design problems. Numerical results for example problems are presented to illustrate the efficiency of the design procedure set forth.

  4. Solving complex fisheries management problems

    DEFF Research Database (Denmark)

    Petter Johnsen, Jahn; Eliasen, Søren Qvist

    2011-01-01

    A crucial issue for the new EU common fisheries policy is how to solve the discard problem. Through a study of the institutional set up and the arrangements for solving the discard problem in Denmark, the Faroe Islands, Iceland and Norway, the article identifies the discard problem as related to...

  5. Learning Impasses in Problem Solving

    Science.gov (United States)

    Hodgson, J. P. E.

    1992-01-01

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

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

    OpenAIRE

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

    2002-01-01

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

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

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

    Science.gov (United States)

    Khotimah, Rita Pramujiyanti; Masduki

    2016-01-01

    Differential equations is a branch of mathematics which is closely related to mathematical modeling that arises in real-world problems. Problem solving ability is an essential component to solve contextual problem of differential equations properly. The purposes of this study are to describe contextual teaching and learning (CTL) model in…

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

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

  11. A new branch and bound algorithm for the network design problem

    OpenAIRE

    G. Gallo

    1981-01-01

    A Branch and Bound algorithm is presented to solve the Network Design Problem. This algorithm makes use of new upper and lower bounds which are sharper than the ones used in previous algorithms of the same type. The results of a rather wide numerical experimentation are illustrated.

  12. A branch-and-bound algorithm for stable scheduling in single-machine production systems

    OpenAIRE

    Leus, Roel; Herroelen, Willy

    2004-01-01

    Robust scheduling aims at the construction of a schedule that is protected against uncertain events. A stable schedule is a robust schedule that will change little when variations in the input parameters arise. This paper proposes a branch-and-bound algorithm for optimally solving a single-machine scheduling problem with stability objective, when a single job is anticipated to be disrupted.

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

  14. Facilitating problem solving in high school chemistry

    Science.gov (United States)

    Gabel, Dorothy L.; Sherwood, Robert D.

    The major purpose for conducting this study was to determine whether certain instructional strategies were superior to others in teaching high school chemistry students problem solving. The effectiveness of four instructional strategies for teaching problem solving to students of various proportional reasoning ability, verbal and visual preference, and mathematics anxiety were compared in this aptitude by treatment interaction study. The strategies used were the factor-label method, analogies, diagrams, and proportionality. Six hundred and nine high school students in eight schools were randomly assigned to one of four teaching strategies within each classroom. Students used programmed booklets to study the mole concept, the gas laws, stoichiometry, and molarity. Problem-solving ability was measured by a series of immediate posttests, delayed posttests and the ACS-NSTA Examination in High School Chemistry. Results showed that mathematics anxiety is negatively correlated with science achievement and that problem solving is dependent on students' proportional reasoning ability. The factor-label method was found to be the most desirable method and proportionality the least desirable method for teaching the mole concept. However, the proportionality method was best for teaching the gas laws. Several second-order interactions were found to be significant when mathematics anxiety was one of the aptitudes involved.

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

    International Nuclear Information System (INIS)

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

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

    Science.gov (United States)

    Mitianiec, W.

    2014-08-01

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

  17. A parametric branch and bound approach to suboptimal explicit hybrid MPC

    OpenAIRE

    Axehill, Daniel; Besselmann, Thomas; Martino Raimondo, Davide; Morari, Manfred

    2014-01-01

    In this article we present a parametric branch and bound algorithm for computation of optimal and suboptimal solutions to parametric mixed-integer quadratic programs and parametric mixed-integer linear programs. The algorithm returns an optimal or suboptimal parametric solution with the level of suboptimality requested by the user. An interesting application of the proposed parametric branch and bound procedure is suboptimal explicit MPC for hybrid systems, where the introduced user-defined s...

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

  19. How to solve mathematical problems

    CERN Document Server

    Wickelgren, Wayne A

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

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

  1. Recursive Branching Simulated Annealing Algorithm

    Science.gov (United States)

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

    2012-01-01

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

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

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

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

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

    Science.gov (United States)

    Zhou, Yichao; Wu, Yuexin; Zeng, Jianyang

    2016-06-01

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

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

  7. 3D modelling of branching in plants

    OpenAIRE

    Evers, J.B.

    2011-01-01

    Shoot branching is a key determinant of overall aboveground plant form. During plant development, the number of branches formed strongly influences the amount of light absorbed by the plant, and thus the plant’s competitive strength in terms of light capture in relation to neighbouring plants. Branching is regulated by multiple internal factors which are modulated by different environmental signals. A key environmental signal in the context of a plant population is a low red / far-red intensi...

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

  9. 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. PMID:20420411

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

  11. XML Solving Problem of Expert System

    OpenAIRE

    Yasser A. Nada

    2011-01-01

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

  12. Applying Machine Learning Techniques to ASP Solving

    OpenAIRE

    Maratea, Marco; Pulina, Luca; Ricca, Francesco

    2012-01-01

    Having in mind the task of improving the solving methods for Answer Set Programming (ASP), there are two usual ways to reach this goal: (i) extending state-of-the-art techniques and ASP solvers, or (ii) designing a new ASP solver from scratch. An alternative to these trends is to build on top of state-of-the-art solvers, and to apply machine learning techniques for choosing automatically the “best” available solver on a per-instance basis. In this paper we pursue this latter direction. ...

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

    OpenAIRE

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

    2014-01-01

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

  14. The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints: A Branch-and-Price Approach

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Kolind, Esben; Clausen, Jens

    2009-01-01

    . The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the...... test instances. The main contribution of this article is the addition of synchronization between teams in an exact optimization context....

  15. The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints: A Branch-and-Price Approach - Technical Report

    DEFF Research Database (Denmark)

    Hansen, Anders Dohn; Kolind, Esben; Clausen, Jens

    . The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the...... test instances. The main contribution of this article is the addition of synchronization between teams in an exact optimization context....

  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. Branch mode selection during early lung development.

    Directory of Open Access Journals (Sweden)

    Denis Menshykau

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

  18. Branch mode selection during early lung development.

    Science.gov (United States)

    Menshykau, Denis; Kraemer, Conradin; Iber, Dagmar

    2012-01-01

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

  19. The branch banking boom in Illinois: a byproduct of restrictive branching laws

    OpenAIRE

    Erin Davis; Tara Rice

    2007-01-01

    What’s behind the boom in bank branches across Illinois, particularly in Chicago? The authors explore the history of branch banking within the state and across the nation to help explain this recent trend and discuss its future implications.

  20. Systematic comparison of solved problems as a cooperative learning task

    Science.gov (United States)

    Taconis, Ruurd; van Hout-Wolters, Bernadette

    1999-09-01

    Problem-solving skills and understanding of domain, knowledge (e.g., fighting misconceptions) are important goals in both secondary and tertiary science education. A prototype of an instructional task is presented which aims at improved problem-solving skills based on understanding of domain knowledge. In this task, comparing carefully selected solved problems by groups of students is utilised as a learning activity for the acquisition of adequate problem schemata. The task is designed as a part of the so-called UBP-program (UBP=Understanding Based Problem solving) currently being developed, for education in science. The result of an evaluative study for the field of mechanics is presented. The UBP-task appears apt to improve problem-solving skills at a less advanced level of physics education (e.g., 10th grade), especially for students normally performing poorly—who are often girls.

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

    Science.gov (United States)

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

    2005-02-01

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

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

    Science.gov (United States)

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

    2014-05-01

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

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

  4. Geogebra for Solving Problems of Physics

    Science.gov (United States)

    Kllogjeri, Pellumb; Kllogjeri, Adrian

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

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

  6. Branched-Chain Amino Acids

    Directory of Open Access Journals (Sweden)

    Matteo Ghiringhelli

    2015-07-01

    Full Text Available Our study is focused on evaluation and use of the most effective and correct nutrients. In particular, our attention is directed to the role of certain amino acids in cachectic patients.During parenteral nutrition in humans, physician already associates in the PN-bags different formulations including amino acids, lipids and glucose solutions or essential amino acids solution alone or exclusively branched-chain amino acids (BCAA. Studies investigated the effects of dietary BCAA ingestion on different diseases and conditions such as obesity and metabolic disorders, liver disease, muscle atrophy, cancer, impaired immunity or injuries (surgery, trauma, burns, and sepsis. BCAAs have been shown to affect gene expression, protein metabolism, apoptosis and regeneration of hepatocytes, and insulin resistance. They have also been shown to inhibit the proliferation of liver cancer cells in vitro, and are essential for lymphocyte proliferation and dendritic cell maturation. Oral or parenteral administration of these three amino acids will allow us to evaluate the real efficacy of these compounds during a therapy to treat malnutrition in subjects unable to feed themselves.

  7. AVM branch vibration test equipment

    International Nuclear Information System (INIS)

    An inventory of the test equipment of the AVM Branch ''Acoustic and Vibratory Mechanics Analysis Methods'' group has been undertaken. The purpose of this inventory is to enable better acquaintance with the technical characteristics of the equipment, providing an accurate definition of their functionalities, ad to inform potential users of the possibilities and equipment available in this field. The report first summarizes the various experimental surveys conduced. Then, using the AVM equipment database to draw up an exhaustive list of available equipment, it provides a full-scope picture of the vibration measurement systems (sensors, conditioners and exciters) and data processing resources commonly used on industrial sites and in laboratories. A definition is also given of a mobile test unit, called 'shelter', and a test bench used for the testing and performance rating of the experimental analysis methods developed by the group. The report concludes with a description of two fixed installations: - the calibration bench ensuring the requisite quality level for the vibration measurement systems ; - the training bench, whereby know-how acquired in the field in the field of measurement and experimental analysis processes is made available to others. (author). 27 refs., 15 figs., 2 appends

  8. Branching out Has So Much to Offer

    Science.gov (United States)

    Murray, Joe

    2012-01-01

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

  9. 12 CFR 741.11 - Foreign branching.

    Science.gov (United States)

    2010-01-01

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

  10. Spectral problem for branching chain quantum graph

    International Nuclear Information System (INIS)

    Branching chain of rings as a quantum graph is considered. We use the transfer matrix method to obtain the spectral equation. The existence of bound states is proved. The discrete spectrum of the Schrödinger operator for the system is described. We find the dependence of the eigenvalues positions on the branching angle.

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

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

    DEFF Research Database (Denmark)

    Stolpe, M; Stegmann, Jan

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

  13. Resources in Technology: Problem-Solving.

    Science.gov (United States)

    Technology Teacher, 1986

    1986-01-01

    This instructional module examines a key function of science and technology: problem solving. It studies the meaning of problem solving, looks at techniques for problem solving, examines case studies that exemplify the problem-solving approach, presents problems for the reader to solve, and provides a student self-quiz. (Author/CT)

  14. Optimal calculational schemes for solving multigroup photon transport problem

    International Nuclear Information System (INIS)

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

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

    DEFF Research Database (Denmark)

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

    2016-01-01

    strengthened by cutting planes. In addition, we suggest an extension of the branching strategy "Pareto branching''. Extensive computational results obtained for the bi-objective single source capacitated facility location problem prove the effectiveness of the algorithms....... bound sets that prevents us from solving the bi-objective LP-relaxation of each branching node. To strengthen the lower bound sets, we propose a bi-objective cutting plane algorithm that dynamically adjusts the weights of the objective functions such that different parts of the feasible set are...

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

  17. Students' Problem Solving and Justification

    Science.gov (United States)

    Glass, Barbara; Maher, Carolyn A.

    2004-01-01

    This paper reports on methods of students' justifications of their solution to a problem in the area of combinatorics. From the analysis of the problem solving of 150 students in a variety of settings from high-school to graduate study, four major forms of reasoning evolved: (1) Justification by Cases, (2) Inductive Argument, (3) Elimination…

  18. Problem Solving through Paper Folding

    Science.gov (United States)

    Wares, Arsalan

    2014-01-01

    The purpose of this article is to describe a couple of challenging mathematical problems that involve paper folding. These problem-solving tasks can be used to foster geometric and algebraic thinking among students. The context of paper folding makes some of the abstract mathematical ideas involved relatively concrete. When implemented…

  19. Simon on Problem-Solving

    DEFF Research Database (Denmark)

    Foss, Kirsten; Foss, Nicolai

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

  20. Human Problem Solving in 2008

    OpenAIRE

    Pizlo, Zygmunt

    2009-01-01

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

  1. Human Problem Solving in 2010

    OpenAIRE

    Pizlo, Zygmunt

    2012-01-01

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

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

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

    Science.gov (United States)

    Kaić, Zvonimir; Sain, Snjezana; Gulić, Mirjana; Mahovlić, Vjekoslav; Krznarić, Zeljko

    2014-01-01

    The available literature shows us that "Druztvo ljeciteljah u Zagrebus (the Society of Healers in Zagreb) was founded as far back as the year 1845 by a total of thirteen members. This data allows us to follow the role of doctors and health workers in Zagreb through their everyday profession, research, organizational and social work as well as management through a period of over one hundred to seventy years. The Branch Zagreb was active before the official establishment of subsidiaries of CMA which is evident from the minutes of the regular annual assembly of the Croatian Medical Association on 21 March 1948. Until the end of 1956, there was no clear division of labor, functions and competencies between the Branch and the Main Board. Their actions were instead consolidated and the Branch operated within and under the name of Croatian Medical Association. In that year the Branch became independent. The Branch Zagreb is the largest and one of the most active branches of the Croatian Medical Association. At the moment, the Branch brings together 3621 members, regular members--doctors of medicine (2497), doctors of dental medicine (384), retired physicians (710), and associate members (30 specialists with higher education who are not doctors). The Branch is especially accomplished in its activities in the area of professional development of its members and therefore organizes a series of scientific conferences in the framework of continuous education of physicians, allowing its members to acquire necessary points for the extension of their operating license. The choir "Zagrebacki lijecnici pjevaci" (Zagreb Physicians' Choir) of the Croatian Medical Music Society of the CMA and its activities are inseparable from the Branch Zagreb. The Branch is firmly linked to the parent body, the CMA, and thus has a visible impact on the strategy and the activities of the Association as a whole. Most professional societies of the CMA have their headquarters in Zagreb and this is

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

    Science.gov (United States)

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

    2013-11-01

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

  5. On the Coulomb Branch of a Marginal Deformation of N=4 SUSY Yang-Mills

    CERN Document Server

    Dorey, N; Dorey, Nick; Hollowood, Timothy J.

    2005-01-01

    We determine the exact vacuum structure of a marginal deformation of N=4 SUSY Yang-Mills with gauge group U(N). The Coulomb branch of the theory consists of several sub-branches which are governed by complex curves of the form Sigma_{n_{1}} U Sigma_{n_{2}} U Sigma_{n_{3}} of genus N=n_{1}+n_{2}+n_{3}. Each sub-branch intersects with a family of Higgs and Confining branches permuted by SL(2,Z) transformations. We determine the curve by solving a related matrix model in the planar limit according to the prescription of Dijkgraaf and Vafa, and also by explicit instanton calculations using a form of localization on the instanton moduli space. We find that Sigma_{n} coincides with the spectral curve of the n-body Ruijsenaars-Schneider system. Our results imply that the theory on each sub-branch is holomorphically equivalent to certain five-dimensional gauge theory with eight supercharges. This equivalence also implies the existence of novel confining branches in five dimensions.

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

  7. Mechanisms of Side Branching and Tip Splitting in a Model of Branching Morphogenesis

    Science.gov (United States)

    Guo, Yina; Sun, Mingzhu; Garfinkel, Alan; Zhao, Xin

    2014-01-01

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

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

    Science.gov (United States)

    Osada, Noriyuki; Takeda, Hiroshi

    2003-01-01

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

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

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

  11. Programming

    International Nuclear Information System (INIS)

    The programmer's task is often taken to be the construction of algorithms, expressed in hierarchical structures of procedures: this view underlies the majority of traditional programming languages, such as Fortran. A different view is appropriate to a wide class of problem, perhaps including some problems in High Energy Physics. The programmer's task is regarded as having three main stages: first, an explicit model is constructed of the reality with which the program is concerned; second, this model is elaborated to produce the required program outputs; third, the resulting program is transformed to run efficiently in the execution environment. The first two stages deal in network structures of sequential processes; only the third is concerned with procedure hierarchies. (orig.)

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

  13. Problem Solving in Latino Families

    OpenAIRE

    Torres, Eliza

    2012-01-01

    This study examined parent engagement, child engagement, and quality of problem solving in a sample of families engaged in a trial of parent management training intervention. Data were collected for treatment and control groups at preintervention and 2, 4, and 6 months after the initial assessment. Variables in this study were measured utilizing a global coding scheme used to categorize parent-child behavioral observations. The coding scheme was developed by Forgatch, Knutson, and Mayne. Prel...

  14. On solving stochastic MADM problems

    OpenAIRE

    Văduva Ion; Resteanu Cornel

    2009-01-01

    The paper examines a MADM problem with stochastic attributes. The transformation of a stochastic MADM problem into a cardinal problem is done by the standardization of the probability distribution of each attribute X and calculating the information of each attribute as Shannon's entropy or Onicescu's informational energy. Some well known (performant) methods to solve a cardinal MADM problem are presented and a method for combining results of several methods to give a final MADM solution is di...

  15. Solving Public Transit Scheduling Problems

    OpenAIRE

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

    2008-01-01

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

  16. Human Problem Solving in 2006

    OpenAIRE

    Pizlo, Zygmunt

    2007-01-01

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

  17. Constraints and Logic Programming in Grammars and Language Analysis

    DEFF Research Database (Denmark)

    Christiansen, Henning

    2014-01-01

    analysis. With a tool such as Constraint Handling Rules, CHR, to be ex- plained below, the grammar writer or programmer working with language analysis can define his or her own constraint solvers specifically tailored for the linguistic problems at hand. We concentrate on grammars and lan- guage analysis......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...

  18. Branching processes with immigration and related topics

    OpenAIRE

    Li, Zenghu

    2006-01-01

    This is a survey on 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.

  19. Applied Aeroscience and CFD Branch Overview

    Science.gov (United States)

    LeBeau, Gerald J.; Kirk, Benjamin S.

    2014-01-01

    The principal mission of NASA Johnson Space Center is Human Spaceflight. In support of the mission the Applied Aeroscience and CFD Branch has several technical competencies that include aerodynamic characterization, aerothermodynamic heating, rarefied gas dynamics, and decelerator (parachute) systems.

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

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

  2. Code 672 observational science branch computer networks

    Science.gov (United States)

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

    1988-01-01

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

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

  4. From configurations to branched configurations and beyond

    OpenAIRE

    Magnot, Jean-Pierre

    2013-01-01

    We propose here a geometric and topological setting for the study of branching effects arising in various fields of research, e.g. in statistical mechanics and turbulence theory. We describe various aspects that appear key points to us, and finish with a limit of such a construction which stand in the dynamics on probability spaces where it seems that branching effects can be fully studied without any adaptation of the framework.

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

  6. AGB (asymptotic giant branch): Star evolution

    Energy Technology Data Exchange (ETDEWEB)

    Becker, S.A.

    1987-01-01

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

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

  8. Branch and Bound Algorithm for Multiprocessor Scheduling

    OpenAIRE

    Rahman, Mostafizur

    2009-01-01

    The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound...

  9. AGB [asymptotic giant branch]: Star evolution

    International Nuclear Information System (INIS)

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

  10. Comparative efficiency analysis of Portuguese bank branches

    OpenAIRE

    Portela, Maria; Thanassoulis, Emmanuel

    2006-01-01

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

  11. Comparative performance analysis of portuguese bank branches

    OpenAIRE

    Portela, Maria; Thanassoulis, Emmanuel

    2003-01-01

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

  12. Fiber-Optic Communication Technology Branching Devices

    Science.gov (United States)

    Williams, J. C.

    1985-02-01

    This tutorial review of fiber-optic branching devices covers example uses of branching devices, device types, device-performance characteristics, examples of current technology, and system-design methodology. The discussion is limited to passive single- and multimode devices fabricated from optical fibers or graded-index components. Integrated-optic, wavelength-division-multiplexing, and polarization-selective devices are not specifically addressed.

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

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

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

    DEFF Research Database (Denmark)

    Clausen, Jens; Perregaard, Michael

    1998-01-01

    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 for JSS on a 16-processor MEIKO computing surface with Intel i860 processors and perform extensive computational testing using classical publicly available benchmark problems. The parallel part of one of the implementations is based on a similar parallel code for quadratic assignment problems...

  16. A branch and bound for single machine stochastic scheduling to minimize the maximum lateness ,

    Directory of Open Access Journals (Sweden)

    Hamidreza Haddad

    2012-04-01

    Full Text Available This paper studies the problem of single machine stochastic scheduling with random processing times, deterministic due dates and an independent setup time. The jobs are also deteriorated based on the position, which their processes are done. The objective function is to find a schedule of jobs, which minimizes the expected value of maximum lateness. A branch and bound scheme is presented to solve the problem analytically and a simulated annealing meta-heuristic (SA is also provided for solving the problem in larger scales. Computational experiments demonstrate that the proposed SA is capable of finding near optimal solutions with very low gap.

  17. A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem

    DEFF Research Database (Denmark)

    Jepsen, Mads Kehlet; Spoorendonk, Simon; Røpke, Stefan

    2013-01-01

    This paper presents an exact method for solving the symmetric two-echelon capacitated vehicle routing problem, a transportation problem concerned with the distribution of goods from a depot to a set of customers through a set of satellite locations. The presented method is based on an edge flow m...... model that is a relaxation and provides a valid lower bound. A specialized branching scheme is employed to obtain feasible solutions. Out of a test set of 93 instances the algorithm is able to solve 47 to optimality surpassing previous exact algorithms....

  18. Exact Methods for Solving the Train Departure Matching Problem

    DEFF Research Database (Denmark)

    Haahr, Jørgen Thorlund; Bull, Simon Henry

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

  19. Assessing Student's Ability to Solve Textbook Style Problems

    Science.gov (United States)

    Cummings, Karen

    2015-04-01

    Can We Really Measure Problem Solving Ability? The answer to this question may depend on how we define problem solving ability. But, if we care about students' ability to solve novel textbook style problems, the answer to this question seems to be ``yes.'' In this talk I will discuss a pre-/post- instruction assessment that was recently developed to assess students' ability to solve fairly standard textbook style problems within the domains of Newton's second law, conservation of energy and conservation of momentum. The instrument is designed for large-scale use in typical university classrooms, has already been used in a variety of institutions and appears to be both valid and robust. Data collected with this instrument can help guide curricular improvements and provide important insights relevant to most departments for program review.

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

  1. A Case Study of an Induction Year Teacher's Problem-Solving Using the LIBRE Model Activity

    Science.gov (United States)

    Guerra, Norma S.; Flores, Belinda Bustos; Claeys, Lorena

    2009-01-01

    Background: A federally-funded program at the University of Texas at San Antonio adopted a holistic problem solving mentoring approach for novice teachers participating in an accelerated teacher certification program. Aims/focus of discussion: To investigate a novice teacher's problem-solving activity through self-expression of challenges and…

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

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Stegmann, Jan

    2007-01-01

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

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

  4. Assessing Cognitive Learning of Analytical Problem Solving

    Science.gov (United States)

    Billionniere, Elodie V.

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

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

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

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

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

    Science.gov (United States)

    2013-11-04

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

  9. Emotional Intelligence and Problem Solving

    OpenAIRE

    İşmen, A. Esra

    2013-01-01

    One of the two goals of this study is to investigate relationship between emotional intelligence and perception of problem solving skill and the other is to gather some data for the theories which are using information processing approach to explain the emotional Intelligence.The sample consisted of 225 students (undergraduated and master-without thesis) from the Istanbul University. EQ-NED (Ergin, İşmen, Özabacı, 1999) was applied to sample group to determine their emotional intelligence and...

  10. Solving the Dark Matter Problem

    International Nuclear Information System (INIS)

    Cosmological observations have firmly established that the majority of matter in the universe is of an unknown type, called 'dark matter'. A compelling hypothesis is that the dark matter consists of weakly interacting massive particles (WIMPs) in the mass range around 100 GeV. If the WIMP hypothesis is correct, such particles could be created and studied at accelerators. Furthermore they could be directly detected as the primary component of our galaxy. Solving the dark matter problem requires that the connection be made between the two. We describe some theoretical and experimental avenues that might lead to this connection.

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

  13. Northwestern Branch of Mangala Vallis

    Science.gov (United States)

    2002-01-01

    (Released 12 June 2002) The Science One of the many branches of the Mangala Vallis channel system is seen in this image. The water that likely carved the channels emerged from a huge graben or fracture almost 1000 km to the south. The THEMIS image shows where one of the channels exits the cratered highlands terrain onto the lowland plains. A bright scarp marks the transition between the two terrain types and demonstrates that in this location the highlands terrain is being eroded back. Note how the floor of the main channel appears to be at the same level as the lowland terrain, suggestive of a base level where erosion is no longer effective. Most of the steep slope faces in the image display darker slope streaks that are thought to be dust avalanche scars and indicate that a relatively thick mantle of dust is present in this region. Wind-sculpted ridges known as yardangs cover many of the surfaces throughout the area as shown by images from the Mars Global Surveyor mission. Most of them are at the limit of resolution in the THEMIS image but some are evident on the floor of the main channel at the point at which a smaller side channel enters. In this location they appear to extend right up to the base of the channel wall, giving the appearance that they are emerging from underneath the thick pile of material into which the channel is eroded. This suggests a geologic history in which a preexisting landscape of eroded yardangs was covered over by a thick pile of younger material that is now eroding back down to the original level. Alternatively, it is possible that the yardangs formed more recently at the abrupt transition between the channel floor and wall. More analysis is necessary to sort out the story. The Story This channel system is named 'Mangala,' the word for Mars in Sanskrit, a language of the Hindus of India that goes back more than 4,000 years, with written literature almost as long. Great epic tales have been written in this language, and Odyssey is

  14. Industrial-Strength Formally Certified SAT Solving

    CERN Document Server

    Darbari, Ashish; Marques-Silva, Joao

    2009-01-01

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

  15. Modeling Regular Replacement for String Constraint Solving

    Science.gov (United States)

    Fu, Xiang; Li, Chung-Chih

    2010-01-01

    Bugs in user input sanitation of software systems often lead to vulnerabilities. Among them many are caused by improper use of regular replacement. This paper presents a precise modeling of various semantics of regular substitution, such as the declarative, finite, greedy, and reluctant, using finite state transducers (FST). By projecting an FST to its input/output tapes, we are able to solve atomic string constraints, which can be applied to both the forward and backward image computation in model checking and symbolic execution of text processing programs. We report several interesting discoveries, e.g., certain fragments of the general problem can be handled using less expressive deterministic FST. A compact representation of FST is implemented in SUSHI, a string constraint solver. It is applied to detecting vulnerabilities in web applications

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

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

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

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

  20. The Future of Washington's Branch Campuses. HECB Report on Branch Campus Development Plans-HB 2707

    Science.gov (United States)

    Washington Higher Education Coordinating Board, 2005

    2005-01-01

    Washington's research university branch campuses were created in 1989 to increase opportunities for students in several regions of the state to complete their baccalaureate and graduate-level studies at public universities close to their homes. Currently, the University of Washington operates branch campuses in Bothell and Tacoma. The Bothell…

  1. Maze-solving by chemotaxis

    Science.gov (United States)

    Reynolds, A. M.

    2010-06-01

    Here, we report on numerical simulations showing that chemotaxis will take a body through a maze via the shortest possible route to the source of a chemoattractant. This is a robust finding that does not depend on the geometrical makeup of the maze. The predictions are supported by recent experimental studies which have shown that by moving down gradients in pH , a droplet of organic solvent can find the shortest of multiple possible paths through a maze to an acid-soaked exit. They are also consistent with numerical and experimental evidence that plant-parasitic nematodes take the shortest route through the labyrinth of air-filled pores within soil to preferred host plants that produce volatile chemoattractants. The predictions support the view that maze-solving is a robust property of chemotaxis and is not specific to particular kinds of maze or to the fractal structure of air-filled channels within soils.

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

  3. Measurement of tau lepton branching fractions

    International Nuclear Information System (INIS)

    We present τ- lepton branching fraction measurements based on data from the TPC/Two-Gamma detector at PEP. Using a sample ofτ- → ντK-π+π- events, we examine the resonance structure of the K-π+π- system and obtain the first measurements of branching fractions for τ- → ντK1-(1270) and τ- → ντK1-(1400). We also describe a complete set of branching fraction measurements in which all the decays of the τ- lepton are separated into classes defined by the identities of the charged particles and an estimate of the number of neutrals. This is the first such global measurement with decay classes defined by the four possible charged particle species, e, μ, π, and K

  4. Geometry optimization of branchings in vascular networks

    Science.gov (United States)

    Khamassi, Jamel; Bierwisch, Claas; Pelz, Peter

    2016-06-01

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

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

  6. XML Solving Problem of Expert System

    Directory of Open Access Journals (Sweden)

    Yasser A. Nada

    2011-01-01

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

  7. Problem Solving Applications in Chemistry Laboratory

    OpenAIRE

    Temel, Senar

    2013-01-01

    In the study, it was aimed to examine perception level of problem solving skills of teacher candidates participating in problem solving applications in chemistry laboratory and the effect of these applications on their perception of problem solving skills. Also it has been examined whether there is a significant relationship between perception of problem solving skills of teacher candidates and science process skills and logical thinking abilities. 72 teacher candidates participated in the st...

  8. Solving rational expectations models using Excel

    DEFF Research Database (Denmark)

    Strulik, Holger

    2004-01-01

    Problems of discrete time optimal control can be solved using backward iteration and Microsoft Excel. The author explains the method in general and shows how the basic models of neoclassical growth and real business cycles are solved......Problems of discrete time optimal control can be solved using backward iteration and Microsoft Excel. The author explains the method in general and shows how the basic models of neoclassical growth and real business cycles are solved...

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

    International Nuclear Information System (INIS)

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

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

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

    CERN Document Server

    Bärmann, Andreas

    2016-01-01

    Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. Contents Decomposition for Multi-Period Network Design Solving Network Design Problems via Ag...

  12. Russian Doll Search for solving Constraint Optimization problems

    Energy Technology Data Exchange (ETDEWEB)

    Verfaillie, G.; Lemaitre, M. [CERT/ONERA, Toulouse (France); Schiex, T. [INRA, Castanet Tolosan (France)

    1996-12-31

    If the Constraint Satisfaction framework has been extended to deal with Constraint Optimization problems, it appears that optimization is far more complex than satisfaction. One of the causes of the inefficiency of complete tree search methods, like Depth First Branch and Bound, lies in the poor quality of the lower bound on the global valuation of a partial assignment, even when using Forward Checking techniques. In this paper, we introduce the Russian Doll Search algorithm which replaces one search by n successive searches on nested subproblems (n being the number of problem variables), records the results of each search and uses them later, when solving larger subproblems, in order to improve the lower bound on the global valuation of any partial assignment. On small random problems and on large real scheduling problems, this algorithm yields surprisingly good results, which greatly improve as the problems get more constrained and the bandwidth of the used variable ordering diminishes.

  13. On the accuracy of solving confluent Prony systems

    CERN Document Server

    Batenkov, Dmitry

    2011-01-01

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

  14. King Oedipus and the Problem Solving Process.

    Science.gov (United States)

    Borchardt, Donald A.

    An analysis of the problem solving process reveals at least three options: (1) finding the cause, (2) solving the problem, and (3) anticipating potential problems. These methods may be illustrated by examining "Oedipus Tyrannus," a play in which a king attempts to deal with a problem that appears to be beyond his ability to solve, and applying…

  15. Perspectives on Problem Solving and Instruction

    Science.gov (United States)

    van Merrienboer, Jeroen J. G.

    2013-01-01

    Most educators claim that problem solving is important, but they take very different perspective on it and there is little agreement on how it should be taught. This article aims to sort out the different perspectives and discusses problem solving as a goal, a method, and a skill. As a goal, problem solving should not be limited to well-structured…

  16. ON ALGEBRICO-DIFFERENTIAL EQUATIONS-SOLVING

    Institute of Scientific and Technical Information of China (English)

    WU Wenjun(Wu Wen-tsun)

    2004-01-01

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

  17. LEGO Robotics: An Authentic Problem Solving Tool?

    Science.gov (United States)

    Castledine, Alanah-Rei; Chalmers, Chris

    2011-01-01

    With the current curriculum focus on correlating classroom problem solving lessons to real-world contexts, are LEGO robotics an effective problem solving tool? This present study was designed to investigate this question and to ascertain what problem solving strategies primary students engaged with when working with LEGO robotics and whether the…

  18. Systematic vs. Non-systematic Algorithms for Solving the MPE Task

    OpenAIRE

    Marinescu, Radu; Kask, Kalev; Dechter, Rina

    2012-01-01

    The paper continues the study of partitioning based inference of heuristics for search in the context of solving the Most Probable Explanation task in Bayesian Networks. We compare two systematic Branch and Bound search algorithms, BBBT (for which the heuristic information is constructed during search and allows dynamic variable/value ordering) and its predecessor BBMB (for which the heuristic information is pre-compiled), against a number of popular local search algorithms for the MPE proble...

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

    OpenAIRE

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

    2010-01-01

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

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

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

  2. Medial branch neurotomy in low back pain

    International Nuclear Information System (INIS)

    This study aimed to assess the effectiveness of pulsed radiofrequency medial branch dorsal ramus neurotomy in patients with facet joint syndrome. From January 2008 to April 2010, 92 patients with facet joint syndrome diagnosed by strict inclusion criteria and controlled diagnostic blocks undergone medial branch neurotomy. We did not exclude patients with failed back surgery syndrome (FBSS). Electrodes (20G) with 5-mm active tip were placed under fluoroscopy guide parallel to medial branch. Patients were followed up by physical examination and by Visual Analog Scale and Oswestry Disability Index at 1, 6, and 12 months. In all cases, pain improvement was statistically significant and so quality of life. Three non-FBSS patients had to undergo a second neurotomy because of non-satisfactory pain decrease. Complications were reported in no case. Medial branch radiofrequency neurotomy has confirmed its well-established effectiveness in pain and quality of life improvement as long as strict inclusion criteria be fulfilled and nerve ablation be accomplished by parallel electrode positioning. This statement can be extended also to FBSS patients. (orig.)

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

  4. Measurement of the eta decay branching ratio

    CERN Document Server

    Bargholtz, C; Bogoslawsky, D; Calén, H; Capellaro, F; Clement, H; Demirörs, L; Ekström, C; Fransson, K; Geren, L; Gustafsson, L; Höistad, Bo; Ivanov, G; Jacewicz, M; Jiganov, E; Johansson, T; Keleta, S; Koch, I; Kullander, Sven; Kupsc, A; Kuznetsov, A; Laukhin, I V; Lindberg, K; Marciniewski, P; Meier, R; Morosov, B; Oelert, W; Pauly, C; Pettersson, H; Petukhov, Yu P; Povtorejko, A; Ruber, Roger J M Y; Schönning, K; Scobel, W; Shafigullin, R; Shwartz, B; Skorodko, T Yu; Sopov, V; Stepaniak, J; Chernyshov, V; Tegnér, P E; Engblom, P T; Tikhomirov, V; Turowiecki, A; Wagner, G J; Wolke, M; Yamamoto, A; Zabierowski, J; Zartova, I; Zlomanczuk, Yu; Bargholtz, Chr.

    2007-01-01

    The reaction pd->3He eta at threshold was used to provide a clean source of eta mesons for decay studies with the WASA detector at CELSIUS. The branching ratio of the decay eta->pi+pi-e+e- is measured to be (4.6+/-1.4+/-0.5)x10^-4.

  5. 76 FR 60757 - Executive Branch Qualified Trusts

    Science.gov (United States)

    2011-09-30

    ... qualified trusts provisions for the executive branch in subparts D and E of 5 CFR part 2634 (see 57 FR 11800.... 12674, 54 FR 15159, 3 CFR, 1989 Comp., p. 215, as modified by E.O. 12731, 55 FR 42547, 3 CFR, 1990 Comp... been in business, its policies and philosophy in managing assets, the types of clients it serves,...

  6. Infrared studies of asymptotic giant branch stars

    International Nuclear Information System (INIS)

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

  7. Bit Preservation: A Solved Problem?

    Directory of Open Access Journals (Sweden)

    David S. H. Rosenthal

    2010-07-01

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

  8. Community-powered problem solving.

    Science.gov (United States)

    Gouillart, Francis; Billings, Douglas

    2013-04-01

    Traditionally, companies have managed their constituencies with specific processes: marketing to customers, procuring from vendors, developing HR policies for employees, and so on. The problem is, such processes focus on repeatability and compliance, so they can lead to stagnation. Inviting your constituencies to collectively help you solve problems and exploit opportunities--"co-creation"--is a better approach. It allows you to continually tap the skills and insights of huge numbers of stakeholders and develop new ways to produce value for all. The idea is to provide stakeholders with platforms (physical and digital forums) on which they can interact, get them to start exploring new experiences and connections, and let the system grow organically. A co-creation initiative by a unit of Becton, Dickinson and Company demonstrates how this works. A global leader in syringes, BD set out to deepen its ties with hospital customers and help them reduce the incidence of infections from unsafe injection and syringe disposal practices. The effort began with a cross-functional internal team, brought in the hospital procurement and supply managers BD had relationships with, and then reached out to hospitals' infection-prevention and occupational health leaders. Eventually product designers, nurses, sustainability staffers, and even hospital CFOs were using the platform, contributing data that generated new best practices and reduced infections. PMID:23593769

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

    CERN Document Server

    Ipsilandis, Pandelis G

    2008-01-01

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

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

  11. Haar wavelet operational matrix method for solving constrained nonlinear quadratic optimal control problem

    Science.gov (United States)

    Swaidan, Waleeda; Hussin, Amran

    2015-10-01

    Most direct methods solve finite time horizon optimal control problems with nonlinear programming solver. In this paper, we propose a numerical method for solving nonlinear optimal control problem with state and control inequality constraints. This method used quasilinearization technique and Haar wavelet operational matrix to convert the nonlinear optimal control problem into a quadratic programming problem. The linear inequality constraints for trajectories variables are converted to quadratic programming constraint by using Haar wavelet collocation method. The proposed method has been applied to solve Optimal Control of Multi-Item Inventory Model. The accuracy of the states, controls and cost can be improved by increasing the Haar wavelet resolution.

  12. A Branch-and-Bound Algorithm for Fitting Anti-Robinson Structures to Symmetric Dissimilarity Matrices.

    Science.gov (United States)

    Brusco, Michael J.

    2002-01-01

    Developed a branch-and-bound algorithm that can be used to seriate a symmetric dissimilarity matrix by identifying a reordering of rows and columns of the matrix optimizing an anti-Robinson criterion. Computational results suggest that with respect to computational efficiency, the approach is generally competitive with dynamic programming. (SLD)

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

    CERN Document Server

    Defourny, Boris; Wehenkel, Louis

    2011-01-01

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

  14. Integrating Writing into Mathematics Classroom to Increase Students’ Problem Solving Skills

    OpenAIRE

    Ali Bicer; Robert M. Capraro; CAPRARO, Mary M.

    2013-01-01

    Middle school students lack efficient problem solving skills due to several factors. The writing process has been linked to the development of students' problem solving skills. The present study investigated the impact of the writing process on the mathematical problem solving skills for middle grades students. N = 96 students participated in a six weeks, after school STEM program, and they were randomly assigned into two groups: one focused on the writing process with mathematical problem so...

  15. Investigation of Paramedic Candidates’ Problem Solving Skills and Attitudes towards Internet Usage

    OpenAIRE

    Belgüzar KARA

    2012-01-01

    Objectives: The purpose of this study was to evaluate the problem solving skills of paramedic candidates and their attitudes towards Internet usage, as well as, to determine the factors associated with problem solving skills. Methods: This cross-sectional study included 279 students who attended the Ambulance and First Aid Care Techniquere program at a school in the center of Ankara. Data were collected using a questionnaire, the Problem Solving Inventory (PSI), and the Attitude Scale Towards...

  16. IDEAL Problem Solving dalam Pembelajaran Matematika

    Directory of Open Access Journals (Sweden)

    Eny Susiana

    2012-01-01

    Full Text Available Most educators agree that problem solving is among the most meaningful and importantkinds of learning and thingking. That is, the central focus of learning and instructionshould be learning to solve problems. There are several warrants supporting that claims.They are authenticity, relevance, problem solving engages deeper learning angtherefore enhances meaning making, and constructed to represent problems (problemsolving is more meaningful. It is the reason why we must provide teaching and learningto make student’s problem solving skill in progress. There are many informationprocessingmodels of problem solving, such as simplified model of the problem-solvingprocess by Gicks, Polya’s problem solving process etc. One of them is IDEAL problemsolving. Each letter of IDEAL is stand for an aspect of thinking that is important forproblem solving. IDEAL is identify problem, Define Goal, Explore possible strategies,Anticipate outcme and Act, and Look back and learn. Using peer interaction andquestion prompt in small group in IDEAL problem solving teaching and Learning canimprove problem solving skill.Kata kunci: IDEAL Problem Solving, Interaksi Sebaya, Pertanyaan Penuntun, KelompokKecil.

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

    Directory of Open Access Journals (Sweden)

    María del Consuelo Valle Espinosa

    2007-11-01

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

  18. Nonlinear Programming Method for Dynamic Programming

    OpenAIRE

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

    2013-01-01

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

  19. Distance Measurement Solves Astrophysical Mysteries

    Science.gov (United States)

    2003-08-01

    Location, location, and location. The old real-estate adage about what's really important proved applicable to astrophysics as astronomers used the sharp radio "vision" of the National Science Foundation's Very Long Baseline Array (VLBA) to pinpoint the distance to a pulsar. Their accurate distance measurement then resolved a dispute over the pulsar's birthplace, allowed the astronomers to determine the size of its neutron star and possibly solve a mystery about cosmic rays. "Getting an accurate distance to this pulsar gave us a real bonanza," said Walter Brisken, of the National Radio Astronomy Observatory (NRAO) in Socorro, NM. Monogem Ring The Monogem Ring, in X-Ray Image by ROSAT satellite CREDIT: Max-Planck Institute, American Astronomical Society (Click on Image for Larger Version) The pulsar, called PSR B0656+14, is in the constellation Gemini, and appears to be near the center of a circular supernova remnant that straddles Gemini and its neighboring constellation, Monoceros, and is thus called the Monogem Ring. Since pulsars are superdense, spinning neutron stars left over when a massive star explodes as a supernova, it was logical to assume that the Monogem Ring, the shell of debris from a supernova explosion, was the remnant of the blast that created the pulsar. However, astronomers using indirect methods of determining the distance to the pulsar had concluded that it was nearly 2500 light-years from Earth. On the other hand, the supernova remnant was determined to be only about 1000 light-years from Earth. It seemed unlikely that the two were related, but instead appeared nearby in the sky purely by a chance juxtaposition. Brisken and his colleagues used the VLBA to make precise measurements of the sky position of PSR B0656+14 from 2000 to 2002. They were able to detect the slight offset in the object's apparent position when viewed from opposite sides of Earth's orbit around the Sun. This effect, called parallax, provides a direct measurement of

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

    Science.gov (United States)

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

    2013-01-01

    Constraints often inhibit creative problem-solving. This study examined the impact of training strategies for managing constraints on creative problem-solving. Undergraduates, 218 in all, were asked to work through 1 to 4 self-paced instructional programs focused on constraint management strategies. The quality, originality, and elegance of…