Emotion Oriented Programming: Computational Abstractions for AI Problem Solving

OpenAIRE

Darty , Kevin; Sabouret , Nicolas

2012-01-01

International audience; In this paper, we present a programming paradigm for AI problem solving based on computational concepts drawn from Affective Computing. It is believed that emotions participate in human adaptability and reactivity, in behaviour selection and in complex and dynamic environments. We propose to define a mechanism inspired from this observation for general AI problem solving. To this purpose, we synthesize emotions as programming abstractions that represent the perception ...

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

Logo Programming, Problem Solving, and Knowledge-Based Instruction.

Science.gov (United States)

Swan, Karen; Black, John B.

The research reported in this paper was designed to investigate the hypothesis that computer programming may support the teaching and learning of problem solving, but that to do so, problem solving must be explicitly taught. Three studies involved students in several grades: 4th, 6th, 8th, 11th, and 12th. Findings collectively show that five…

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

DEFF Research Database (Denmark)

Canh, Nam Nguyen; Stolpe, Mathias

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

An Integer Programming Approach to Solving Tantrix on Fixed Boards

Directory of Open Access Journals (Sweden)

Yushi Uno

2012-03-01

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

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.

On а Recursive-Parallel Algorithm for Solving the Knapsack Problem

Directory of Open Access Journals (Sweden)

Vladimir V. Vasilchikov

2018-01-01

Full Text Available In this paper, we offer an efficient parallel algorithm for solving the NP-complete Knapsack Problem in its basic, so-called 0-1 variant. To find its exact solution, algorithms belonging to the category ”branch and bound methods” have long been used. To speed up the solving with varying degrees of efficiency, various options for parallelizing computations are also used. We propose here an algorithm for solving the problem, based on the paradigm of recursive-parallel computations. We consider it suited well for problems of this kind, when it is difficult to immediately break up the computations into a sufficient number of subtasks that are comparable in complexity, since they appear dynamically at run time. We used the RPM ParLib library, developed by the author, as the main tool to program the algorithm. This library allows us to develop effective applications for parallel computing on a local network in the .NET Framework. Such applications have the ability to generate parallel branches of computation directly during program execution and dynamically redistribute work between computing modules. Any language with support for the .NET Framework can be used as a programming language in conjunction with this library. For our experiments, we developed some C# applications using this library. The main purpose of these experiments was to study the acceleration achieved by recursive-parallel computing. A detailed description of the algorithm and its testing, as well as the results obtained, are also given in the paper.

Entanglement branching operator

Science.gov (United States)

Harada, Kenji

2018-01-01

We introduce an entanglement branching operator to split a composite entanglement flow in a tensor network which is a promising theoretical tool for many-body systems. We can optimize an entanglement branching operator by solving a minimization problem based on squeezing operators. The entanglement branching is a new useful operation to manipulate a tensor network. For example, finding a particular entanglement structure by an entanglement branching operator, we can improve a higher-order tensor renormalization group method to catch a proper renormalization flow in a tensor network space. This new method yields a new type of tensor network states. The second example is a many-body decomposition of a tensor by using an entanglement branching operator. We can use it for a perfect disentangling among tensors. Applying a many-body decomposition recursively, we conceptually derive projected entangled pair states from quantum states that satisfy the area law of entanglement entropy.

Problem solving and Program design using the TI-92

NARCIS (Netherlands)

Ir.ing. Ton Marée; ir Martijn van Dongen

2000-01-01

This textbook is intended for a basic course in problem solving and program design needed by scientists and engineers using the TI-92. The TI-92 is an extremely powerful problem solving tool that can help you manage complicated problems quickly. We assume no prior knowledge of computers or

Bricolage Programming and Problem Solving Ability in Young Children : an Exploratory Study

OpenAIRE

Rose, Simon

2016-01-01

Visual programming environments, such as Scratch, are increasingly being used by schools to teach problem solving and computational thinking skills. However, academic research is divided on the effect that visual programming has on problem solving in a computational context. This paper focuses on the role of bricolage programming in this debate; a bottom-up programming approach that arises when using block-style programming interfaces. Bricolage programming was a term originally used to descr...

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

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.

A branch-and-price algorithm for solving the cutting strips problem

NARCIS (Netherlands)

Chen, Zhiping; Hurkens, C.A.J.; Jong, de J.L.

1997-01-01

After giving a suitable model for the cutting strips problem, we present a branch-and-price algorithm for it by combining the column generation technique and the branch-and-bound method with LP relaxations. Some theoretical issues and implementation details about the algorithm are discussed,

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.

Solving a class of generalized fractional programming problems using the feasibility of linear programs.

Science.gov (United States)

Shen, Peiping; Zhang, Tongli; Wang, Chunfeng

2017-01-01

This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve this problem, the algorithm solves an equivalent optimization problem (Q) via an exploration of a suitably defined nonuniform grid. The main work of the algorithm involves checking the feasibility of linear programs associated with the interesting grid points. It is proved that the proposed algorithm is a fully polynomial time approximation scheme as the ratio terms are fixed in the objective function to problem (P), based on the computational complexity result. In contrast to existing results in literature, the algorithm does not require the assumptions on quasi-concavity or low-rank of the objective function to problem (P). Numerical results are given to illustrate the feasibility and effectiveness of the proposed algorithm.

Neuro-Oncology Branch

Science.gov (United States)

... BTTC are experts in their respective fields. Neuro-Oncology Clinical Fellowship This is a joint program with ... can increase survival rates. Learn more... The Neuro-Oncology Branch welcomes Dr. Mark Gilbert as new Branch ...

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

Science.gov (United States)

Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza

2017-05-01

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

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

Science.gov (United States)

Zhao, Yingfeng; Liu, Sanyang

2016-01-01

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

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

DEFF Research Database (Denmark)

Clausen, Jens; Perregaard, Michael

1998-01-01

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

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

Science.gov (United States)

Sui, Haiteng; Niu, Wentie

2016-09-01

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

MULTI-CRITERIA PROGRAMMING METHODS AND PRODUCTION PLAN OPTIMIZATION PROBLEM SOLVING IN METAL INDUSTRY

Directory of Open Access Journals (Sweden)

Tunjo Perić

2017-09-01

Full Text Available This paper presents the production plan optimization in the metal industry considered as a multi-criteria programming problem. We first provided the definition of the multi-criteria programming problem and classification of the multicriteria programming methods. Then we applied two multi-criteria programming methods (the STEM method and the PROMETHEE method in solving a problem of multi-criteria optimization production plan in a company from the metal industry. The obtained results indicate a high efficiency of the applied methods in solving the problem.

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.

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

Directory of Open Access Journals (Sweden)

Yi-hua Zhong

2013-01-01

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

Design of planar articulated mechanisms using branch and bound

DEFF Research Database (Denmark)

Stolpe, Mathias; Kawamoto, Atsushi

2004-01-01

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

Developing Student Programming and Problem-Solving Skills with Visual Basic

Science.gov (United States)

Siegle, Del

2009-01-01

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

Bi-objective branch-and-cut algorithms

DEFF Research Database (Denmark)

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

Most real-world optimization problems are of a multi-objective nature, involving objectives which are conflicting and incomparable. Solving a multi-objective optimization problem requires a method which can generate the set of rational compromises between the objectives. In this paper, we propose...... are strengthened by cutting planes. In addition, we suggest an extension of the branching strategy "Pareto branching''. Extensive computational results obtained for the bi-objective single source capacitated facility location problem prove the effectiveness of the algorithms....... and compares it to an upper bound set. The implicit bound set based algorithm, on the other hand, fathoms branching nodes by generating a single point on the lower bound set for each local nadir point. We outline several approaches for fathoming branching nodes and we propose an updating scheme for the lower...

An improved cut-and-solve algorithm for the single-source capacitated facility location problem

DEFF Research Database (Denmark)

Gadegaard, Sune Lauth; Klose, Andreas; Nielsen, Lars Relund

2018-01-01

In this paper, we present an improved cut-and-solve algorithm for the single-source capacitated facility location problem. The algorithm consists of three phases. The first phase strengthens the integer program by a cutting plane algorithm to obtain a tight lower bound. The second phase uses a two......-level local branching heuristic to find an upper bound, and if optimality has not yet been established, the third phase uses the cut-and-solve framework to close the optimality gap. Extensive computational results are reported, showing that the proposed algorithm runs 10–80 times faster on average compared...

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

DEFF Research Database (Denmark)

Görtz, Simon; Klose, Andreas

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

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…

An Improved Particle Swarm Optimization for Solving Bilevel Multiobjective Programming Problem

Directory of Open Access Journals (Sweden)

Tao Zhang

2012-01-01

Full Text Available An improved particle swarm optimization (PSO algorithm is proposed for solving bilevel multiobjective programming problem (BLMPP. For such problems, the proposed algorithm directly simulates the decision process of bilevel programming, which is different from most traditional algorithms designed for specific versions or based on specific assumptions. The BLMPP is transformed to solve multiobjective optimization problems in the upper level and the lower level interactively by an improved PSO. And a set of approximate Pareto optimal solutions for BLMPP is obtained using the elite strategy. This interactive procedure is repeated until the accurate Pareto optimal solutions of the original problem are found. Finally, some numerical examples are given to illustrate the feasibility of the proposed algorithm.

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…

VD-411 branch driver

International Nuclear Information System (INIS)

Gorbunov, N.V.; Karev, A.G.; Mal'tsev, Eh.I.; Morozov, B.A.

1985-01-01

The VD-411 branch driver for CAMAC moduli control by the SM-4 computer is described. The driver realizes data exchange with moduli disposed in 28 crates grouped in 4 branches. Data exchange can be carried out either in the program regime or in the regime of direct access to the memory. Fulfilment of 11 block regimes and one program regime is provided for. A possibility of individual programming of exchange methods in block regimes is left for users for organisation of quicker and most flexible data removal from the CAMAC moduli. In the regime of direct access the driver provides data transmission at the size up to 64 Kwords placing it in the computer memory of 2 M byte. High rate of data transmission and the developed system of interruptions ensure efficient utilization of the VD-411 branch driver at data removal from facilities in high energy physics experiments

Analysis of problem solving on project based learning with resource based learning approach computer-aided program

Science.gov (United States)

Kuncoro, K. S.; Junaedi, I.; Dwijanto

2018-03-01

This study aimed to reveal the effectiveness of Project Based Learning with Resource Based Learning approach computer-aided program and analyzed problem-solving abilities in terms of problem-solving steps based on Polya stages. The research method used was mixed method with sequential explanatory design. The subject of this research was the students of math semester 4. The results showed that the S-TPS (Strong Top Problem Solving) and W-TPS (Weak Top Problem Solving) had good problem-solving abilities in each problem-solving indicator. The problem-solving ability of S-MPS (Strong Middle Problem Solving) and (Weak Middle Problem Solving) in each indicator was good. The subject of S-BPS (Strong Bottom Problem Solving) had a difficulty in solving the problem with computer program, less precise in writing the final conclusion and could not reflect the problem-solving process using Polya’s step. While the Subject of W-BPS (Weak Bottom Problem Solving) had not been able to meet almost all the indicators of problem-solving. The subject of W-BPS could not precisely made the initial table of completion so that the completion phase with Polya’s step was constrained.

3rd Workshop on Branching Processes and their Applications

CERN Document Server

González, Miguel; Gutiérrez, Cristina; Martínez, Rodrigo; Minuesa, Carmen; Molina, Manuel; Mota, Manuel; Ramos, Alfonso; WBPA15

2016-01-01

This volume gathers papers originally presented at the 3rd Workshop on Branching Processes and their Applications (WBPA15), which was held from 7 to 10 April 2015 in Badajoz, Spain (http://branching.unex.es/wbpa15/index.htm). The papers address a broad range of theoretical and practical aspects of branching process theory. Further, they amply demonstrate that the theoretical research in this area remains vital and topical, as well as the relevance of branching concepts in the development of theoretical approaches to solving new problems in applied fields such as Epidemiology, Biology, Genetics, and, of course, Population Dynamics. The topics covered can broadly be classified into the following areas: 1. Coalescent Branching Processes 2. Branching Random Walks 3. Population Growth Models in Varying and Random Environments 4. Size/Density/Resource-Dependent Branching Models 5. Age-Dependent Branching Models 6. Special Branching Models 7. Applications in Epidemiology 8. Applications in Biology and Genetics Offer...

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

Directory of Open Access Journals (Sweden)

Irene Govender

2014-07-01

Full Text Available The difficulty of learning to program has long been identified amongst novices. This study explored the benefits of teaching a problem solving strategy by comparing students’ perceptions and attitudes towards problem solving before and after the strategy was implemented in secondary schools. Based on self-efficacy theory, students’ problem solving self-efficacy as well as teachers’ self-efficacy were investigated, showing that both students’ and teachers’ self-efficacy may have benefited from the explicit instruction. This would imply that teaching problem solving explicitly should be encouraged to increase self-efficacy to program.

Development and adjustment of programs for solving systems of linear equations

International Nuclear Information System (INIS)

Fujimura, Toichiro

1978-03-01

Programs for solving the systems of linear equations have been adjusted and developed in expanding the scientific subroutine library SSL. The principal programs adjusted are based on the congruent method, method of product form of the inverse, orthogonal method, Crout's method for sparse system, and acceleration of iterative methods. The programs developed are based on the escalator method, direct parallel residue method and block tridiagonal method for band system. Described are usage of the programs developed and their future improvement. FORTRAN lists with simple examples in tests of the programs are also given. (auth.)

A New Method for Solving Multiobjective Bilevel Programs

Directory of Open Access Journals (Sweden)

Ying Ji

2017-01-01

Full Text Available We study a class of multiobjective bilevel programs with the weights of objectives being uncertain and assumed to belong to convex and compact set. To the best of our knowledge, there is no study about this class of problems. We use a worst-case weighted approach to solve this class of problems. Our “worst-case weighted multiobjective bilevel programs” model supposes that each player (leader or follower has a set of weights to their objectives and wishes to minimize their maximum weighted sum objective where the maximization is with respect to the set of weights. This new model gives rise to a new Pareto optimum concept, which we call “robust-weighted Pareto optimum”; for the worst-case weighted multiobjective optimization with the weight set of each player given as a polytope, we show that a robust-weighted Pareto optimum can be obtained by solving mathematical programing with equilibrium constraints (MPEC. For an application, we illustrate the usefulness of the worst-case weighted multiobjective optimization to a supply chain risk management under demand uncertainty. By the comparison with the existing weighted approach, we show that our method is more robust and can be more efficiently applied to real-world problems.

Thermoelectric effects in disordered branched nanowires

Science.gov (United States)

Roslyak, Oleksiy; Piriatinskiy, Andrei

2013-03-01

We shall develop formalism of thermal and electrical transport in Si1 - x Gex and BiTe nanowires. The key feature of those nanowires is the possibility of dendrimer type branching. The branching tree can be of size comparable to the short wavelength of phonons and by far smaller than the long wavelength of conducting electrons. Hence it is expected that the branching may suppress thermal and let alone electrical conductance. We demonstrate that the morphology of branches strongly affects the electronic conductance. The effect is important to the class of materials known as thermoelectrics. The small size of the branching region makes large temperature and electrical gradients. On the other hand the smallness of the region would allow the electrical transport being ballistic. As usual for the mesoscopic systems we have to solve macroscopic (temperature) and microscopic ((electric potential, current)) equations self-consistently. Electronic conductance is studied via NEGF formalism on the irreducible electron transfer graph. We also investigate the figure of merit ZT as a measure of the suppressed electron conductance.

Solving stochastic programs with integer recourse by enumeration : a framework using Gröbner basis reductions

NARCIS (Netherlands)

Schultz, R.; Stougie, L.; Vlerk, van der M.H.

1998-01-01

In this paper we present a framework for solving stochastic programs with complete integer recourse and discretely distributed right-hand side vector, using Gröbner basis methods from computational algebra to solve the numerous second-stage integer programs. Using structural properties of the

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

DEFF Research Database (Denmark)

Gamst, Mette; Petersen, Bjørn

2012-01-01

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

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.

High profile students’ growth of mathematical understanding in solving linier programing problems

Science.gov (United States)

Utomo; Kusmayadi, TA; Pramudya, I.

2018-04-01

Linear program has an important role in human’s life. This linear program is learned in senior high school and college levels. This material is applied in economy, transportation, military and others. Therefore, mastering linear program is useful for provision of life. This research describes a growth of mathematical understanding in solving linear programming problems based on the growth of understanding by the Piere-Kieren model. Thus, this research used qualitative approach. The subjects were students of grade XI in Salatiga city. The subjects of this study were two students who had high profiles. The researcher generally chose the subjects based on the growth of understanding from a test result in the classroom; the mark from the prerequisite material was ≥ 75. Both of the subjects were interviewed by the researcher to know the students’ growth of mathematical understanding in solving linear programming problems. The finding of this research showed that the subjects often folding back to the primitive knowing level to go forward to the next level. It happened because the subjects’ primitive understanding was not comprehensive.

Personalized Computer-Assisted Mathematics Problem-Solving Program and Its Impact on Taiwanese Students

Science.gov (United States)

Chen, Chiu-Jung; Liu, Pei-Lin

2007-01-01

This study evaluated the effects of a personalized computer-assisted mathematics problem-solving program on the performance and attitude of Taiwanese fourth grade students. The purpose of this study was to determine whether the personalized computer-assisted program improved student performance and attitude over the nonpersonalized program.…

Library of problem-oriented programs for solving problems of atomic and nuclear physics

International Nuclear Information System (INIS)

Kharitonov, Yu.I.

1976-01-01

The Data Centre of the Leningrad Institute of Nuclear Physics (LIYaF) is working on the establishment of a library of problem-oriented computer programs for solving problems of atomic and nuclear physics. This paper lists and describes briefly the programs presently available to the Data Centre. The descriptions include the program code numbers, the program language, the translator for which the program is designed, and the program scope

The role of metacognitive skills in solving object-oriented programming problems: a case study

Directory of Open Access Journals (Sweden)

Marietjie Havenga

2015-07-01

Full Text Available This article reports on the role of metacognitive skills when solving object-oriented programming problems as part of a case study. The research was constructivist-based within an interpretivist approach to explore how four students constructed their own thinking when solving programming problems. A qualitative methodology was employed. Both concept-driven coding and data-driven coding were applied. Two main issues emerged from the findings. Participating students had fragmented knowledge of the object-oriented approach and shortcomings regarding the implementation thereof, and they experienced problems with metacognitive control during all the steps of program development. Based on the findings the use of metacognitive critical control points (MCCPs is proposed to be used as a mechanism to facilitate students in their programming efforts and to prevent loss of control during program development.

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.

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

Directory of Open Access Journals (Sweden)

V. V. Vasilchikov

2016-01-01

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

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.

Corporate Social Responsibility Program Impacts the Customer Loyalty of Bank Rakyat Indonesia Branch Manado

OpenAIRE

Mekel, Peggy A.; Talumepa, Gary C.

2014-01-01

The successfulness of a firm is not just determined by its financial metrics. Corporate social responsibility (CSR) lately becomes one major concern in businesses which are indicating whether the company goes well or not. CSR program is the major concern that will be elaborate in this research. The aim of this research is to know if CSR programs of BRI branch Manado impact its customer loyalty and what are the factors that influence. This study is conducted by quantitative technique with asso...

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.

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

EDEF: a program for solving the neutron diffusion equation using microcomputers

International Nuclear Information System (INIS)

Fernandes, A.; Maiorino, J.R.

1990-01-01

This work presents the development of a program to solve the two-group two-dimensional diffusion equation (with a buckling option to simulate axial leakage) applying the finite element method. It has been developed to microcomputers compatibles to the IBM-PC. Among the facilities of the program, we can mention the simplicity to represent two-dimensional complex domains, the input through a pre-processor and the output in which the fluxes are presented graphically. The program also calculates the multiplication factor, the peaking factor and the power distribution. (author) [pt

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

Solving a bi-objective mathematical programming model for bloodmobiles location routing problem

Directory of Open Access Journals (Sweden)

Masoud Rabbani

2017-01-01

Full Text Available Perishability of platelets, uncertainty of donors’ arrival and conflicting views in platelet supply chain have made platelet supply chain planning a problematic issue. In this paper, mobile blood collection system for platelet production is investigated. Two mathematical models are presented to cover the bloodmobile collection planning problem. The first model is a multi-objective fuzzy mathematical programming in which the bloodmobiles locations are considered with the aim of maximizing potential amount of blood collection and minimizing the operational cost. The second model is a vehicle routing problem with time windows which studies the shuttles routing problem. To tackle the first model, it is reformulated as a crisp multi objective linear programming model and then solved through a fuzzy multi objective programming approach. Several sensitivity analysis are conducted on important parameters to demonstrate the applicability of the proposed model. The proposed model is then solved by using a tailored Simulated Annealing (SA algorithm. The numerical results demonstrate promising efficiency of the proposed solution method.

MULTI-CRITERIA PROGRAMMING METHODS AND PRODUCTION PLAN OPTIMIZATION PROBLEM SOLVING IN METAL INDUSTRY

OpenAIRE

Tunjo Perić; Željko Mandić

2017-01-01

This paper presents the production plan optimization in the metal industry considered as a multi-criteria programming problem. We first provided the definition of the multi-criteria programming problem and classification of the multicriteria programming methods. Then we applied two multi-criteria programming methods (the STEM method and the PROMETHEE method) in solving a problem of multi-criteria optimization production plan in a company from the metal industry. The obtained resul...

Solving seismological problems using sgraph program: II-waveform modeling

International Nuclear Information System (INIS)

Abdelwahed, Mohamed F.

2012-01-01

One of the seismological programs to manipulate seismic data is SGRAPH program. It consists of integrated tools to perform advanced seismological techniques. SGRAPH is considered a new system for maintaining and analyze seismic waveform data in a stand-alone Windows-based application that manipulate a wide range of data formats. SGRAPH was described in detail in the first part of this paper. In this part, I discuss the advanced techniques including in the program and its applications in seismology. Because of the numerous tools included in the program, only SGRAPH is sufficient to perform the basic waveform analysis and to solve advanced seismological problems. In the first part of this paper, the application of the source parameters estimation and hypocentral location was given. Here, I discuss SGRAPH waveform modeling tools. This paper exhibits examples of how to apply the SGRAPH tools to perform waveform modeling for estimating the focal mechanism and crustal structure of local earthquakes.

Experiences in solving the challenges of on-site degree programs

International Nuclear Information System (INIS)

Christenson, J.M.; Eckart, L.E.

1987-01-01

The University of Cincinnati (UC) Nuclear Engineering Program Faculty has now had six years of experience in delivering on-site educational programs to nuclear power plant technical personnel. Programs of this type present a variety of challenges to the faculty, the management of the client utility and to the students who become involved in a particular program. This paper describes how each of these groups can identify and successfully solve these challenges. The solutions the authors describe are drawn from their own experiences which have been described in some detail elsewhere. Other solutions to those challenges are certainly possible. They make no claim for the particular ones they offer, beyond the fact that they have worked over a sustained period of time and that results they have produced have left all three parties mutually satisfied

Branch and bound algorithms to solve semiring constraint satisfaction problems

CSIR Research Space (South Africa)

Leenen, L

2008-12-01

Full Text Available The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. Considerable research has been done in solving SCSPs, but limited work has been done in building...

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.

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

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

International Nuclear Information System (INIS)

Abdelwahed, Mohamed F.

2012-01-01

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.

A Hybrid Programming Framework for Modeling and Solving Constraint Satisfaction and Optimization Problems

OpenAIRE

Sitek, Paweł; Wikarek, Jarosław

2016-01-01

This paper proposes a hybrid programming framework for modeling and solving of constraint satisfaction problems (CSPs) and constraint optimization problems (COPs). Two paradigms, CLP (constraint logic programming) and MP (mathematical programming), are integrated in the framework. The integration is supplemented with the original method of problem transformation, used in the framework as a presolving method. The transformation substantially reduces the feasible solution space. The framework a...

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

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

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…

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

A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem

DEFF Research Database (Denmark)

Görtz, Simon; Klose, Andreas

2012-01-01

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

Markovian Monte Carlo program EvolFMC v.2 for solving QCD evolution equations

Science.gov (United States)

Jadach, S.; Płaczek, W.; Skrzypek, M.; Stokłosa, P.

2010-02-01

We present the program EvolFMC v.2 that solves the evolution equations in QCD for the parton momentum distributions by means of the Monte Carlo technique based on the Markovian process. The program solves the DGLAP-type evolution as well as modified-DGLAP ones. In both cases the evolution can be performed in the LO or NLO approximation. The quarks are treated as massless. The overall technical precision of the code has been established at 5×10. This way, for the first time ever, we demonstrate that with the Monte Carlo method one can solve the evolution equations with precision comparable to the other numerical methods. New version program summaryProgram title: EvolFMC v.2 Catalogue identifier: AEFN_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFN_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including binary test data, etc.: 66 456 (7407 lines of C++ code) No. of bytes in distributed program, including test data, etc.: 412 752 Distribution format: tar.gz Programming language: C++ Computer: PC, Mac Operating system: Linux, Mac OS X RAM: Less than 256 MB Classification: 11.5 External routines: ROOT ( http://root.cern.ch/drupal/) Nature of problem: Solution of the QCD evolution equations for the parton momentum distributions of the DGLAP- and modified-DGLAP-type in the LO and NLO approximations. Solution method: Monte Carlo simulation of the Markovian process of a multiple emission of partons. Restrictions:Limited to the case of massless partons. Implemented in the LO and NLO approximations only. Weighted events only. Unusual features: Modified-DGLAP evolutions included up to the NLO level. Additional comments: Technical precision established at 5×10. Running time: For the 10 6 events at 100 GeV: DGLAP NLO: 27s; C-type modified DGLAP NLO: 150s (MacBook Pro with Mac OS X v.10

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.

The Effect of TMPT Program on Pre-School Children's Social Problem Solving Skills

Science.gov (United States)

Gur, Cagla; Kocak, Nurcan

2018-01-01

Purpose: Starting Thinking Training at an early age is important. However, few studies were found regarding Thinking Training programs for pre-school children and the contributions of these programs to children's social problem-solving. In this context, the TMPT Program was developed for pre-school children and the effect of the program on 5-6…

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

NARCIS (Netherlands)

Govender, I.; Govender, D.; Havenga, M.; Mentz, E.; Breed, B.; Dignum, F.; Dignum, V.

2014-01-01

The difficulty of learning to program has long been identified amongst novices. This study explored the benefits of teaching a problem solving strategy by comparing students’ perceptions and attitudes towards problem solving before and after the strategy was implemented in secondary schools. Based

Racing Sampling Based Microimmune Optimization Approach Solving Constrained Expected Value Programming

Directory of Open Access Journals (Sweden)

Kai Yang

2016-01-01

Full Text Available This work investigates a bioinspired microimmune optimization algorithm to solve a general kind of single-objective nonlinear constrained expected value programming without any prior distribution. In the study of algorithm, two lower bound sample estimates of random variables are theoretically developed to estimate the empirical values of individuals. Two adaptive racing sampling schemes are designed to identify those competitive individuals in a given population, by which high-quality individuals can obtain large sampling size. An immune evolutionary mechanism, along with a local search approach, is constructed to evolve the current population. The comparative experiments have showed that the proposed algorithm can effectively solve higher-dimensional benchmark problems and is of potential for further applications.

Maze solving algorithm and its programs using Z-80 assembler language for a robot

Energy Technology Data Exchange (ETDEWEB)

Takeno, J; Mukaidono, M

1982-01-01

In the first part the formation of a maze problem is introduced and the outline of this algorithm to solve a maze is explained in the second part. The third part describes the detail of this program, and the final part shows the program which has been developed using Z-80 assembler language. This program has portability for other robots using Z-80 microprocessors. 7 references.

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

Directory of Open Access Journals (Sweden)

İsmail Karaoğlan

2015-06-01

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

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

Czech Academy of Sciences Publication Activity Database

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

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

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

On Solving Aircraft Conflict Avoidance Using Deterministic Global Optimization (sBB) Codes

OpenAIRE

Cafieri , Sonia; Messine , Frédéric; Touhami , Ahmed

2016-01-01

International audience; In this paper, some improvements of spatial Branch and Bound (sBB) algorithms are discussed to solve aircraft conflict avoidance problems formulated as MINLP. We propose a new quadratic convex relaxation technique based on affine arithmetic. Moreover, a branching strategy is also proposedfor the considered problem. Preliminary numerical results validates the proposed approach

The profile of students’ problem-solving skill in physics across interest program in the secondary school

Science.gov (United States)

Jua, S. K.; Sarwanto; Sukarmin

2018-05-01

Problem-solving skills are important skills in physics. However, according to some researchers, the problem-solving skill of Indonesian students’ problem in physics learning is categorized still low. The purpose of this study was to identify the profile of problem-solving skills of students who follow the across the interests program of physics. The subjects of the study were high school students of Social Sciences, grade X. The type of this research was descriptive research. The data which used to analyze the problem-solving skills were obtained through student questionnaires and the test results with impulse materials and collision. From the descriptive analysis results, the percentage of students’ problem-solving skill based on the test was 52.93% and indicators respectively. These results indicated that students’ problem-solving skill is categorized low.

Persistence-Based Branch Misprediction Bounds for WCET Analysis

DEFF Research Database (Denmark)

Puffitsch, Wolfgang

2015-01-01

Branch prediction is an important feature of pipelined processors to achieve high performance. However, it can lead to overly pessimistic worst-case execution time (WCET) bounds when being modeled too conservatively. This paper presents bounds on the number of branch mispredictions for local...... 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....

Solving cyclical nurse scheduling problem using preemptive goal programming

Science.gov (United States)

Sundari, V. E.; Mardiyati, S.

2017-07-01

Nurse scheduling system in a hospital is being modeled as a preemptive goal programming problem that is solved by using LINGO software with the objective function to minimize deviation variable at each goal. The scheduling is done cyclically, so every nurse is treated fairly since they have the same work shift portion with the other nurses. By paying attention to the hospital's rules regarding nursing work shift cyclically, it can be obtained that numbers of nurse needed in every ward are 18 nurses and the numbers of scheduling periods are 18 periods where every period consists of 21 days.

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

International Nuclear Information System (INIS)

Cerveira, Adelaide; Agra, Agostinho; Bastos, Fernando; Varum, Humberto

2010-01-01

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.

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

DEFF Research Database (Denmark)

Klose, Andreas; Görtz, Simon

2007-01-01

to compute optimal solutions to large or difficult problem instances by means of a branch-and-bound procedure information about such a primal fractional solution can be advantageous. In this paper, a (stabilized) column generation method is, therefore, employed in order to solve a corresponding master...... problem exactly. The column generation procedure is then employed within a branch-and-price algorithm for computing optimal solutions to the CFLP. Computational results are reported for a set of larger and difficult problem instances....

A Hybrid Programming Framework for Modeling and Solving Constraint Satisfaction and Optimization Problems

Directory of Open Access Journals (Sweden)

Paweł Sitek

2016-01-01

Full Text Available This paper proposes a hybrid programming framework for modeling and solving of constraint satisfaction problems (CSPs and constraint optimization problems (COPs. Two paradigms, CLP (constraint logic programming and MP (mathematical programming, are integrated in the framework. The integration is supplemented with the original method of problem transformation, used in the framework as a presolving method. The transformation substantially reduces the feasible solution space. The framework automatically generates CSP and COP models based on current values of data instances, questions asked by a user, and set of predicates and facts of the problem being modeled, which altogether constitute a knowledge database for the given problem. This dynamic generation of dedicated models, based on the knowledge base, together with the parameters changing externally, for example, the user’s questions, is the implementation of the autonomous search concept. The models are solved using the internal or external solvers integrated with the framework. The architecture of the framework as well as its implementation outline is also included in the paper. The effectiveness of the framework regarding the modeling and solution search is assessed through the illustrative examples relating to scheduling problems with additional constrained resources.

Assessment of students' critical-thinking and problem-solving abilities across a 6-year doctor of pharmacy program.

Science.gov (United States)

Gleason, Brenda L; Gaebelein, Claude J; Grice, Gloria R; Crannage, Andrew J; Weck, Margaret A; Hurd, Peter; Walter, Brenda; Duncan, Wendy

2013-10-14

To determine the feasibility of using a validated set of assessment rubrics to assess students' critical-thinking and problem-solving abilities across a doctor of pharmacy (PharmD) curriculum. Trained faculty assessors used validated rubrics to assess student work samples for critical-thinking and problem-solving abilities. Assessment scores were collected and analyzed to determine student achievement of these 2 ability outcomes across the curriculum. Feasibility of the process was evaluated in terms of time and resources used. One hundred sixty-one samples were assessed for critical thinking, and 159 samples were assessed for problem-solving. Rubric scoring allowed assessors to evaluate four 5- to 7-page work samples per hour. The analysis indicated that overall critical-thinking scores improved over the curriculum. Although low yield for problem-solving samples precluded meaningful data analysis, it was informative for identifying potentially needed curricular improvements. Use of assessment rubrics for program ability outcomes was deemed authentic and feasible. Problem-solving was identified as a curricular area that may need improving. This assessment method has great potential to inform continuous quality improvement of a PharmD program.

A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes

DEFF Research Database (Denmark)

Masson, Renaud; Røpke, Stefan; Lehuédé, Fabien

2014-01-01

for the PDPS and a branch-and-cut-and-price algorithm to solve it. The pricing sub-problem, an Elementary Shortest Path Problem with Resource Constraints (ESPPRC), is solved with a labeling algorithm enhanced with efficient dominance rules. Three families of valid inequalities are used to strengthen...

FMCEIR: a Monte Carlo program for solving the stationary neutron and gamma transport equation

International Nuclear Information System (INIS)

Taormina, A.

1978-05-01

FMCEIR is a three-dimensional Monte Carlo program for solving the stationary neutron and gamma transport equation. It is used to study the problem of neutron and gamma streaming in the GCFR and HHT reactor channels. (G.T.H.)

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

International Nuclear Information System (INIS)

Houtman, H.; Kost, C.J.

1983-09-01

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

Branching in current-voltage characteristics of intrinsic Josephson junctions

International Nuclear Information System (INIS)

Shukrinov, Yu M; Mahfouzi, F

2007-01-01

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

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

International Nuclear Information System (INIS)

Shafie-khah, M.; Parsa Moghaddam, M.; Sheikh-El-Eslami, M.K.

2011-01-01

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.

Problem Solving on a Monorail.

Science.gov (United States)

Barrow, Lloyd H.; And Others

1994-01-01

This activity was created to address a lack of problem-solving activities for elementary children. A "monorail" activity from the Evening Science Program for K-3 Students and Parents program is presented to illustrate the problem-solving format. Designed for performance at stations by groups of two students. (LZ)

Fuzzy linear programming approach for solving transportation ...

Indian Academy of Sciences (India)

ALI EBRAHIMNEJAD

Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran e-mail: ..... est grade of membership at x are μ ˜AL (x) and μ ˜AU (x), respectively. ..... trapezoidal fuzzy numbers transportation problem (12) are.

BDC 500 branch driver controller

CERN Document Server

Dijksman, A

1981-01-01

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

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

Science.gov (United States)

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

2010-06-01

The aim of this paper is to report the results of a preliminary examination of the efficacy of the Strengthening Families Program (SFP) 10-14 in improving parent and youth problem-solving skill. The Hypotheses in this paper include: (1) youth and parents who participated in SFP would have lower mean scores immediately (T2) and 6 months (T3) post intervention on indicators of hostile and negative problem-solving strategies; (2) higher mean scores on positive problem-solving strategies; and (3) youth who participated in SFP would have higher mean scores at T2 and at T3 on indicators of individual problem solving and problem-solving efficacy than youth in the comparison group. The dyads were recruited from elementary schools that had been stratified for race and assigned randomly to intervention or comparison conditions. Mean age of youth was 11 years (SD = 1.04). Fifty-seven dyads (34-intervention&23-control) were videotaped discussing a frequently occurring problem. The videotapes were analysed using the Iowa Family Interaction Rating Scale (IFIRS) and data were analysed using Dyadic Assessment Intervention Model. Most mean scores on the IFIRS did not change. One score changed as predicted: youth hostility decreased at T3. Two scores changed contrary to prediction: parent hostility increased T3 and parent positive problem solving decreased at T2. SFP demonstrated questionable efficacy for problem-solving skill in this study.

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

Science.gov (United States)

Zhu, Yuanheng; Zhao, Dongbin; Li, Xiangjun

2017-03-01

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

The transportation management division institutional program: Networking and problem solving

International Nuclear Information System (INIS)

McGinnis, K.A.; Peterson, J.M.

1989-06-01

The US Department of Energy (DOE) has several programs related to transportation. While these programs may have differing missions and legislative authority, the required activities are frequently similar. To ensure a DOE-wide perspective in developing transportation policies and procedures, a DOE Transportation Institutional Task Force (Task Force) has been formed, which is the primary focus of this paper. The Task Force, composed of representatives from each of the major DOE transportation programs, meets periodically to exchange experiences and insights on institutional issues related to Departmental shipping. The primary purpose of the group is to identify opportunities for productive interactions with the transportation community, including interested and affected members of the public. This paper will also focus sharply on the networking of DOE with the State, Tribal, and local officials in fostering better understanding and in solving problems. An example of such activity is the DOE's cooperative agreement with the Energy Task Force of the Urban Consortium. A major effort is to encourage cooperative action in identifying, addressing, and resolving issues that could impede the transportation of radioactive materials

Partial branch and bound algorithm for improved data association in multiframe processing

Science.gov (United States)

Poore, Aubrey B.; Yan, Xin

1999-07-01

A central problem in multitarget, multisensor, and multiplatform tracking remains that of data association. Lagrangian relaxation methods have shown themselves to yield near optimal answers in real-time. The necessary improvement in the quality of these solutions warrants a continuing interest in these methods. These problems are NP-hard; the only known methods for solving them optimally are enumerative in nature with branch-and-bound being most efficient. Thus, the development of methods less than a full branch-and-bound are needed for improving the quality. Such methods as K-best, local search, and randomized search have been proposed to improve the quality of the relaxation solution. Here, a partial branch-and-bound technique along with adequate branching and ordering rules are developed. Lagrangian relaxation is used as a branching method and as a method to calculate the lower bound for subproblems. The result shows that the branch-and-bound framework greatly improves the resolution quality of the Lagrangian relaxation algorithm and yields better multiple solutions in less time than relaxation alone.

Neural network for solving convex quadratic bilevel programming problems.

Science.gov (United States)

He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie

2014-03-01

In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.

Constraints and Logic Programming in Grammars and Language Analysis

DEFF Research Database (Denmark)

Christiansen, Henning

2014-01-01

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

A recurrent neural network for solving bilevel linear programming problem.

Science.gov (United States)

He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian

2014-04-01

In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.

Space plasma branch at NRL

Science.gov (United States)

The Naval Research Laboratory (Washington, D.C.) formed the Space Plasma Branch within its Plasma Physics Division on July 1. Vithal Patel, former Program Director of Magnetospheric Physics, National Science Foundation, also joined NRL on the same date as Associate Superintendent of the Plasma Physics Division. Barret Ripin is head of the newly organized branch. The Space Plasma branch will do basic and applied space plasma research using a multidisciplinary approach. It consolidates traditional rocket and satellite space experiments, space plasma theory and computation, with laboratory space-related experiments. About 40 research scientists, postdoctoral fellows, engineers, and technicians are divided among its five sections. The Theory and Computation sections are led by Joseph Huba and Joel Fedder, the Space Experiments section is led by Paul Rodriguez, and the Pharos Laser Facility and Laser Experiments sections are headed by Charles Manka and Jacob Grun.

Multi-objective genetic algorithm for solving N-version program design problem

Energy Technology Data Exchange (ETDEWEB)

Yamachi, Hidemi [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan) and Department of Production and Information Systems Engineering, Tokyo Metropolitan Institute of Technology, Hino, Tokyo 191-0065 (Japan)]. E-mail: yamachi@nit.ac.jp; Tsujimura, Yasuhiro [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan)]. E-mail: tujimr@nit.ac.jp; Kambayashi, Yasushi [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan)]. E-mail: yasushi@nit.ac.jp; Yamamoto, Hisashi [Department of Production and Information Systems Engineering, Tokyo Metropolitan Institute of Technology, Hino, Tokyo 191-0065 (Japan)]. E-mail: yamamoto@cc.tmit.ac.jp

2006-09-15

N-version programming (NVP) is a programming approach for constructing fault tolerant software systems. Generally, an optimization model utilized in NVP selects the optimal set of versions for each module to maximize the system reliability and to constrain the total cost to remain within a given budget. In such a model, while the number of versions included in the obtained solution is generally reduced, the budget restriction may be so rigid that it may fail to find the optimal solution. In order to ameliorate this problem, this paper proposes a novel bi-objective optimization model that maximizes the system reliability and minimizes the system total cost for designing N-version software systems. When solving multi-objective optimization problem, it is crucial to find Pareto solutions. It is, however, not easy to obtain them. In this paper, we propose a novel bi-objective optimization model that obtains many Pareto solutions efficiently. We formulate the optimal design problem of NVP as a bi-objective 0-1 nonlinear integer programming problem. In order to overcome this problem, we propose a Multi-objective genetic algorithm (MOGA), which is a powerful, though time-consuming, method to solve multi-objective optimization problems. When implementing genetic algorithm (GA), the use of an appropriate genetic representation scheme is one of the most important issues to obtain good performance. We employ random-key representation in our MOGA to find many Pareto solutions spaced as evenly as possible along the Pareto frontier. To pursue improve further performance, we introduce elitism, the Pareto-insertion and the Pareto-deletion operations based on distance between Pareto solutions in the selection process. The proposed MOGA obtains many Pareto solutions along the Pareto frontier evenly. The user of the MOGA can select the best compromise solution among the candidates by controlling the balance between the system reliability and the total cost.

Multi-objective genetic algorithm for solving N-version program design problem

International Nuclear Information System (INIS)

Yamachi, Hidemi; Tsujimura, Yasuhiro; Kambayashi, Yasushi; Yamamoto, Hisashi

2006-01-01

N-version programming (NVP) is a programming approach for constructing fault tolerant software systems. Generally, an optimization model utilized in NVP selects the optimal set of versions for each module to maximize the system reliability and to constrain the total cost to remain within a given budget. In such a model, while the number of versions included in the obtained solution is generally reduced, the budget restriction may be so rigid that it may fail to find the optimal solution. In order to ameliorate this problem, this paper proposes a novel bi-objective optimization model that maximizes the system reliability and minimizes the system total cost for designing N-version software systems. When solving multi-objective optimization problem, it is crucial to find Pareto solutions. It is, however, not easy to obtain them. In this paper, we propose a novel bi-objective optimization model that obtains many Pareto solutions efficiently. We formulate the optimal design problem of NVP as a bi-objective 0-1 nonlinear integer programming problem. In order to overcome this problem, we propose a Multi-objective genetic algorithm (MOGA), which is a powerful, though time-consuming, method to solve multi-objective optimization problems. When implementing genetic algorithm (GA), the use of an appropriate genetic representation scheme is one of the most important issues to obtain good performance. We employ random-key representation in our MOGA to find many Pareto solutions spaced as evenly as possible along the Pareto frontier. To pursue improve further performance, we introduce elitism, the Pareto-insertion and the Pareto-deletion operations based on distance between Pareto solutions in the selection process. The proposed MOGA obtains many Pareto solutions along the Pareto frontier evenly. The user of the MOGA can select the best compromise solution among the candidates by controlling the balance between the system reliability and the total cost

Results of Four Studies on Logo Programming, Problem Solving, and Knowledge-Based Instructional Design.

Science.gov (United States)

Swan, Karen; Black, John B.

The results of four research studies conducted with subjects ranging in age and ability from elementary to graduate school students demonstrate that Logo programming environments can be instrumental in the development of five particular problem solving strategies: (1) subgoals formation; (2) forward chaining; (3) systematic trial and error; (4)…

Enhancing creative problem solving in an integrated visual art and geometry program: A pilot study

NARCIS (Netherlands)

Schoevers, E.M.; Kroesbergen, E.H.; Pitta-Pantazi, D.

2017-01-01

This article describes a new pedagogical method, an integrated visual art and geometry program, which has the aim to increase primary school students' creative problem solving and geometrical ability. This paper presents the rationale for integrating visual art and geometry education. Furthermore

Component analysis of a school-based substance use prevention program in Spain: contributions of problem solving and social skills training content.

Science.gov (United States)

Espada, José P; Griffin, Kenneth W; Pereira, Juan R; Orgilés, Mireia; García-Fernández, José M

2012-02-01

The objective of the present research was to examine the contribution of two intervention components, social skills training and problem solving training, to alcohol- and drug-related outcomes in a school-based substance use prevention program. Participants included 341 Spanish students from age 12 to 15 who received the prevention program Saluda in one of four experimental conditions: full program, social skills condition, problem solving condition, and a wait-list control group. Students completed self-report surveys at the pretest, posttest and 12-month follow-up assessments. Compared to the wait-list control group, the three intervention conditions produced reductions in alcohol use and intentions to use other substances. The intervention effect size for alcohol use was greatest in magnitude for the full program with all components. Problem-solving skills measured at the follow-up were strongest in the condition that received the full program with all components. We discuss the implications of these findings, including the advantages and disadvantages of implementing tailored interventions to students by selecting intervention components after a skills-based needs assessment.

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

Novel methods for Solving Economic Dispatch of Security-Constrained Unit Commitment Based on Linear Programming

Science.gov (United States)

Guo, Sangang

2017-09-01

There are two stages in solving security-constrained unit commitment problems (SCUC) within Lagrangian framework: one is to obtain feasible units’ states (UC), the other is power economic dispatch (ED) for each unit. The accurate solution of ED is more important for enhancing the efficiency of the solution to SCUC for the fixed feasible units’ statues. Two novel methods named after Convex Combinatorial Coefficient Method and Power Increment Method respectively based on linear programming problem for solving ED are proposed by the piecewise linear approximation to the nonlinear convex fuel cost functions. Numerical testing results show that the methods are effective and efficient.

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.

DENBRAN: A basic program for a significance test for multivariate normality of clusters from branching patterns in dendrograms

Science.gov (United States)

Sneath, P. H. A.

A BASIC program is presented for significance tests to determine whether a dendrogram is derived from clustering of points that belong to a single multivariate normal distribution. The significance tests are based on statistics of the Kolmogorov—Smirnov type, obtained by comparing the observed cumulative graph of branch levels with a graph for the hypothesis of multivariate normality. The program also permits testing whether the dendrogram could be from a cluster of lower dimensionality due to character correlations. The program makes provision for three similarity coefficients, (1) Euclidean distances, (2) squared Euclidean distances, and (3) Simple Matching Coefficients, and for five cluster methods (1) WPGMA, (2) UPGMA, (3) Single Linkage (or Minimum Spanning Trees), (4) Complete Linkage, and (5) Ward's Increase in Sums of Squares. The program is entitled DENBRAN.

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

DEFF Research Database (Denmark)

Stolpe, Mathias; Svanberg, Krister

2004-01-01

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

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

Directory of Open Access Journals (Sweden)

Farhad Ghassemi Tari

2016-01-01

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

Introducing artificial intelligence into structural optimization programs

International Nuclear Information System (INIS)

Jozwiak, S.F.

1987-01-01

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

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.

Branching structure and strain hardening of branched metallocene polyethylenes

International Nuclear Information System (INIS)

Torres, Enrique; Li, Si-Wan; Costeux, Stéphane; Dealy, John M.

2015-01-01

There have been a number of studies of a series of branched metallocene polyethylenes (BMPs) made in a solution, continuous stirred tank reactor (CSTR) polymerization. The materials studied vary in branching level in a systematic way, and the most highly branched members of the series exhibit mild strain hardening. An outstanding question is which types of branched molecules are responsible for strain hardening in extension. This question is explored here by use of polymerization and rheological models along with new data on the extensional flow behavior of the most highly branched members of the set. After reviewing all that is known about the effects of various branching structures in homogeneous polymers and comparing this with the structures predicted to be present in BMPs, it is concluded that in spite of their very low concentration, treelike molecules with branch-on-branch structure provide a large number of deeply buried inner segments that are essential for strain hardening in these polymers

Branching structure and strain hardening of branched metallocene polyethylenes

Energy Technology Data Exchange (ETDEWEB)

Torres, Enrique; Li, Si-Wan; Costeux, Stéphane; Dealy, John M., E-mail: john.dealy@mcgill.ca [Department of Chemical Engineering, McGill University, Montreal, Quebec H3A 0C4 (Canada)

2015-09-15

There have been a number of studies of a series of branched metallocene polyethylenes (BMPs) made in a solution, continuous stirred tank reactor (CSTR) polymerization. The materials studied vary in branching level in a systematic way, and the most highly branched members of the series exhibit mild strain hardening. An outstanding question is which types of branched molecules are responsible for strain hardening in extension. This question is explored here by use of polymerization and rheological models along with new data on the extensional flow behavior of the most highly branched members of the set. After reviewing all that is known about the effects of various branching structures in homogeneous polymers and comparing this with the structures predicted to be present in BMPs, it is concluded that in spite of their very low concentration, treelike molecules with branch-on-branch structure provide a large number of deeply buried inner segments that are essential for strain hardening in these polymers.

Fast multiprogrammable branch driver for Micral mini-computer

International Nuclear Information System (INIS)

Kaiser, J.; Lacroix, J.

1975-01-01

This branch driver allows in association with the stack memories of the minicomputer Micral, very fast exchanges with the 7 crates of a CAMAC branch. A CAMAC program (read, write and control commands) is loaded in the IK stack memory of the Micral and executed in sequence at a rate of 1,6μs per CAMAC command. After programm execution, data may be transferred directly on a magnetic tape

Program for Analyzing Flows in a Complex Network

Science.gov (United States)

Majumdar, Alok Kumar

2006-01-01

Generalized Fluid System Simulation Program (GFSSP) version 4 is a general-purpose computer program for analyzing steady-state and transient flows in a complex fluid network. The program is capable of modeling compressibility, fluid transients (e.g., water hammers), phase changes, mixtures of chemical species, and such externally applied body forces as gravitational and centrifugal ones. A graphical user interface enables the user to interactively develop a simulation of a fluid network consisting of nodes and branches. The user can also run the simulation and view the results in the interface. The system of equations for conservation of mass, energy, chemical species, and momentum is solved numerically by a combination of the Newton-Raphson and successive-substitution methods.

An evolutionary programming based simulated annealing method for solving the unit commitment problem

Energy Technology Data Exchange (ETDEWEB)

Christober Asir Rajan, C. [Department of EEE, Pondicherry Engineering College, Pondicherry 605014 (India); Mohan, M.R. [Department of EEE, Anna University, Chennai 600 025 (India)

2007-09-15

This paper presents a new approach to solve the short-term unit commitment problem using an evolutionary programming based simulated annealing method. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for the next H hours. Evolutionary programming, which happens to be a global optimisation technique for solving unit commitment Problem, operates on a system, which is designed to encode each unit's operating schedule with regard to its minimum up/down time. In this, the unit commitment schedule is coded as a string of symbols. An initial population of parent solutions is generated at random. Here, each schedule is formed by committing all the units according to their initial status (''flat start''). Here the parents are obtained from a pre-defined set of solution's, i.e. each and every solution is adjusted to meet the requirements. Then, a random recommitment is carried out with respect to the unit's minimum down times. And SA improves the status. The best population is selected by evolutionary strategy. The Neyveli Thermal Power Station (NTPS) Unit-II in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different power systems consists of 10, 26, 34 generating units. Numerical results are shown comparing the cost solutions and computation time obtained by using the Evolutionary Programming method and other conventional methods like Dynamic Programming, Lagrangian Relaxation and Simulated Annealing and Tabu Search in reaching proper unit commitment. (author)

MODLP program description: A program for solving linear optimal hydraulic control of groundwater contamination based on MODFLOW simulation. Version 1.0

International Nuclear Information System (INIS)

Ahlfeld, D.P.; Dougherty, D.E.

1994-11-01

MODLP is a computational tool that may help design capture zones for controlling the movement of contaminated groundwater. It creates and solves linear optimization programs that contain constraints on hydraulic head or head differences in a groundwater system. The groundwater domain is represented by USGS MODFLOW groundwater flow simulation model. This document describes the general structure of the computer program, MODLP, the types of constraints that may be imposed, detailed input instructions, interpretation of the output, and the interaction with the MODFLOW simulation kernel

Effects of an explicit problem-solving skills training program using a metacomponential approach for outpatients with acquired brain injury.

Science.gov (United States)

Fong, Kenneth N K; Howie, Dorothy R

2009-01-01

We investigated the effects of an explicit problem-solving skills training program using a metacomponential approach with 33 outpatients with moderate acquired brain injury, in the Hong Kong context. We compared an experimental training intervention with this explicit problem-solving approach, which taught metacomponential strategies, with a conventional cognitive training approach that did not have this explicit metacognitive training. We found significant advantages for the experimental group on the Metacomponential Interview measure in association with the explicit metacomponential training, but transfer to the real-life problem-solving measures was not evidenced in statistically significant findings. Small sample size, limited time of intervention, and some limitations with these tools may have been contributing factors to these results. The training program was demonstrated to have a significantly greater effect than the conventional training approach on metacomponential functioning and the component of problem representation. However, these benefits were not transferable to real-life situations.

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

Science.gov (United States)

Li, Yuzhong

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

Electronic problem-solving treatment: description and pilot study of an interactive media treatment for depression.

Science.gov (United States)

Cartreine, James Albert; Locke, Steven E; Buckey, Jay C; Sandoval, Luis; Hegel, Mark T

2012-09-25

Computer-automated depression interventions rely heavily on users reading text to receive the intervention. However, text-delivered interventions place a burden on persons with depression and convey only verbal content. The primary aim of this project was to develop a computer-automated treatment for depression that is delivered via interactive media technology. By using branching video and audio, the program simulates the experience of being in therapy with a master clinician who provides six sessions of problem-solving therapy. A secondary objective was to conduct a pilot study of the program's usability, acceptability, and credibility, and to obtain an initial estimate of its efficacy. The program was produced in a professional multimedia production facility and incorporates video, audio, graphics, animation, and text. Failure analyses of patient data are conducted across sessions and across problems to identify ways to help the user improve his or her problem solving. A pilot study was conducted with persons who had minor depression. An experimental group (n = 7) used the program while a waitlist control group (n = 7) was provided with no treatment for 6 weeks. All of the experimental group participants completed the trial, whereas 1 from the control was lost to follow-up. Experimental group participants rated the program high on usability, acceptability, and credibility. The study was not powered to detect clinical improvement, although these pilot data are encouraging. Although the study was not powered to detect treatment effects, participants did find the program highly usable, acceptable, and credible. This suggests that the highly interactive and immersive nature of the program is beneficial. Further clinical trials are warranted. ClinicalTrials.gov NCT00906581; http://clinicaltrials.gov/ct2/show/NCT00906581 (Archived by WebCite at http://www.webcitation.org/6A5Ni5HUp).

A new methodological development for solving linear bilevel integer programming problems in hybrid fuzzy environment

Directory of Open Access Journals (Sweden)

Animesh Biswas

2016-04-01

Full Text Available This paper deals with fuzzy goal programming approach to solve fuzzy linear bilevel integer programming problems with fuzzy probabilistic constraints following Pareto distribution and Frechet distribution. In the proposed approach a new chance constrained programming methodology is developed from the view point of managing those probabilistic constraints in a hybrid fuzzy environment. A method of defuzzification of fuzzy numbers using ?-cut has been adopted to reduce the problem into a linear bilevel integer programming problem. The individual optimal value of the objective of each DM is found in isolation to construct the fuzzy membership goals. Finally, fuzzy goal programming approach is used to achieve maximum degree of each of the membership goals by minimizing under deviational variables in the decision making environment. To demonstrate the efficiency of the proposed approach, a numerical example is provided.

Mathematical programming models for solving in equal-sized facilities layout problems. A genetic search method

International Nuclear Information System (INIS)

Tavakkoli-Moghaddam, R.

1999-01-01

This paper present unequal-sized facilities layout solutions generated by a genetic search program. named Layout Design using a Genetic Algorithm) 9. The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computational results on test problems are reported as compared with layout solutions generated by the branch - and bound algorithm a hybrid method merging simulated annealing and local search techniques, and an optimization process of an enveloped block

OpenMP GNU and Intel Fortran programs for solving the time-dependent Gross-Pitaevskii equation

Science.gov (United States)

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

2017-11-01

We present Open Multi-Processing (OpenMP) version of Fortran 90 programs for solving the Gross-Pitaevskii (GP) equation for a Bose-Einstein condensate in one, two, and three spatial dimensions, optimized for use with GNU and Intel compilers. We use the split-step Crank-Nicolson algorithm for imaginary- and real-time propagation, which enables efficient calculation of stationary and non-stationary solutions, respectively. The present OpenMP programs are designed for computers with multi-core processors and optimized for compiling with both commercially-licensed Intel Fortran and popular free open-source GNU Fortran compiler. The programs are easy to use and are elaborated with helpful comments for the users. All input parameters are listed at the beginning of each program. Different output files provide physical quantities such as energy, chemical potential, root-mean-square sizes, densities, etc. We also present speedup test results for new versions of the programs. Program files doi:http://dx.doi.org/10.17632/y8zk3jgn84.2 Licensing provisions: Apache License 2.0 Programming language: OpenMP GNU and Intel Fortran 90. Computer: Any multi-core personal computer or workstation with the appropriate OpenMP-capable Fortran compiler installed. Number of processors used: All available CPU cores on the executing computer. Journal reference of previous version: Comput. Phys. Commun. 180 (2009) 1888; ibid.204 (2016) 209. Does the new version supersede the previous version?: Not completely. It does supersede previous Fortran programs from both references above, but not OpenMP C programs from Comput. Phys. Commun. 204 (2016) 209. Nature of problem: The present Open Multi-Processing (OpenMP) Fortran programs, optimized for use with commercially-licensed Intel Fortran and free open-source GNU Fortran compilers, solve the time-dependent nonlinear partial differential (GP) equation for a trapped Bose-Einstein condensate in one (1d), two (2d), and three (3d) spatial dimensions for

Determination of total flow rate and flow rate of every operating branch in commissioning of heavy water loop for ARR-2

International Nuclear Information System (INIS)

Han Yan

1997-01-01

The heavy water loop (i,e, RCS) for ARR-2 in Algeria is a complex loop. Flow regulating means are not provided by the design in order to operate the reactor safely and simplify operating processes. How to determine precisely the orifice diameters of resistance parts for the loop is a key point for decreasing deviation between practical and design flow rates. Commissioning tests shall ensure that under every one of combined operating modes for the pumps, total coolant flow rate is about the same (the number of pumps operating in parallel is the same) and is consistent with design requirement, as well as the distribution of coolant flow rate to every branch is uniform. The flow Determination is divided into two steps. First and foremost, corresponding resistance part at each pump outlet is determined in commissioning test of shorted heavy water loop with light water, so that the problem about uniform distribution of the flow rate to each branch is solved, Secondly, resistance part at the reactor inlet is determined in commissioning test of heavy water loop connected with the vessel, so that the problem about that total heavy water flow rate is within optimal range is solved. According to practical requirements of the project, a computer program of hydraulic calculation and analysis for heavy water loop has been developed, and hydraulic characteristics test for a part of loop has been conducted in order to correct calculation error. By means of program calculation combining with tests in site, orifice diameters of 9 resistance parts has been determined rapidly and precisely and requirements of design and operation has been met adequately

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.

A duality approach for solving bounded linear programming problems with fuzzy variables based on ranking functions and its application in bounded transportation problems

Science.gov (United States)

Ebrahimnejad, Ali

2015-08-01

There are several methods, in the literature, for solving fuzzy variable linear programming problems (fuzzy linear programming in which the right-hand-side vectors and decision variables are represented by trapezoidal fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings a new method based on the bounded dual simplex method is proposed to determine the fuzzy optimal solution of that kind of fuzzy variable linear programming problems in which some or all variables are restricted to lie within lower and upper bounds. To illustrate the proposed method, an application example is solved and the obtained results are given. The advantages of the proposed method over existing methods are discussed. Also, one application of this algorithm in solving bounded transportation problems with fuzzy supplies and demands is dealt with. The proposed method is easy to understand and to apply for determining the fuzzy optimal solution of bounded fuzzy variable linear programming problems occurring in real-life situations.

Path integral formulation and Feynman rules for phylogenetic branching models

Energy Technology Data Exchange (ETDEWEB)

Jarvis, P D; Bashford, J D; Sumner, J G [School of Mathematics and Physics, University of Tasmania, GPO Box 252C, 7001 Hobart, TAS (Australia)

2005-11-04

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.

Path integral formulation and Feynman rules for phylogenetic branching models

International Nuclear Information System (INIS)

Jarvis, P D; Bashford, J D; Sumner, J G

2005-01-01

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

Computational results with a branch and cut code for the capacitated vehicle routing problem

Energy Technology Data Exchange (ETDEWEB)

Augerat, P.; Naddef, D. [Institut National Polytechnique, 38 - Grenoble (France); Belenguer, J.M.; Benavent, E.; Corberan, A. [Valencia Univ. (Spain); Rinaldi, G. [Consiglio Nazionale delle Ricerche, Rome (Italy)

1995-09-01

The Capacitated Vehicle Routing Problem (CVRP) we consider in this paper consists in the optimization of the distribution of goods from a single depot to a given set of customers with known demand using a given number of vehicles of fixed capacity. There are many practical routing applications in the public sector such as school bus routing, pick up and mail delivery, and in the private sector such as the dispatching of delivery trucks. We present a Branch and Cut algorithm to solve the CVRP which is based in the partial polyhedral description of the corresponding polytope. The valid inequalities used in our method can ne found in Cornuejols and Harche (1993), Harche and Rinaldi (1991) and in Augerat and Pochet (1995). We concentrated mainly on the design of separation procedures for several classes of valid inequalities. The capacity constraints (generalized sub-tour eliminations inequalities) happen to play a crucial role in the development of a cutting plane algorithm for the CVRP. A large number of separation heuristics have been implemented and compared for these inequalities. There has been also implemented heuristic separation algorithms for other classes of valid inequalities that also lead to significant improvements: comb and extended comb inequalities, generalized capacity inequalities and hypo-tour inequalities. The resulting cutting plane algorithm has been applied to a set of instances taken from the literature and the lower bounds obtained are better than the ones previously known. Some branching strategies have been implemented to develop a Branch an Cut algorithm that has been able to solve large CVRP instances, some of them which had never been solved before. (authors). 32 refs., 3 figs., 10 tabs.

Analysis of the efficiency of the linearization techniques for solving multi-objective linear fractional programming problems by goal programming

Directory of Open Access Journals (Sweden)

Tunjo Perić

2017-01-01

Full Text Available This paper presents and analyzes the applicability of three linearization techniques used for solving multi-objective linear fractional programming problems using the goal programming method. The three linearization techniques are: (1 Taylor’s polynomial linearization approximation, (2 the method of variable change, and (3 a modification of the method of variable change proposed in [20]. All three linearization techniques are presented and analyzed in two variants: (a using the optimal value of the objective functions as the decision makers’ aspirations, and (b the decision makers’ aspirations are given by the decision makers. As the criteria for the analysis we use the efficiency of the obtained solutions and the difficulties the analyst comes upon in preparing the linearization models. To analyze the applicability of the linearization techniques incorporated in the linear goal programming method we use an example of a financial structure optimization problem.

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…

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.

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

International Nuclear Information System (INIS)

Hinzman, R.L.

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

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.

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

International Nuclear Information System (INIS)

Smith, J.G.; 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

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…

Program to solve the multigroup discrete ordinates transport equation in (x,y,z) geometry

International Nuclear Information System (INIS)

Lathrop, K.D.

1976-04-01

Numerical formulations and programming algorithms are given for the THREETRAN computer program which solves the discrete ordinates, multigroup transport equation in (x,y,z) geometry. An efficient, flexible, and general data-handling strategy is derived to make use of three hierarchies of storage: small core memory, large core memory, and disk file. Data management, input instructions, and sample problem output are described. A six-group, S 4 , 18 502 mesh point, 2 800 zone, k/sub eff/ calculation of the ZPPR-4 critical assembly required 144 min of CDC-7600 time to execute to a convergence tolerance of 5 x 10 -4 and gave results in good qualitative agreement with experiment and other calculations. 6 references

Solving Environmental Problems

DEFF Research Database (Denmark)

Ørding Olsen, Anders; Sofka, Wolfgang; Grimpe, Christoph

2017-01-01

for Research and Technological Development (FP7), our results indicate that the problem-solving potential of a search strategy increases with the diversity of existing knowledge of the partners in a consortium and with the experience of the partners involved. Moreover, we identify a substantial negative effect...... dispersed. Hence, firms need to collaborate. We shed new light on collaborative search strategies led by firms in general and for solving environmental problems in particular. Both topics are largely absent in the extant open innovation literature. Using data from the European Seventh Framework Program...

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

OpenAIRE

Aihong Ren

2016-01-01

This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solut...

Algebraic Thinking in Solving Linier Program at High School Level: Female Student’s Field Independent Cognitive Style

Science.gov (United States)

Hardiani, N.; Budayasa, I. K.; Juniati, D.

2018-01-01

The aim of this study was to describe algebraic thinking of high school female student’s field independent cognitive style in solving linier program problem by revealing deeply the female students’ responses. Subjects in this study were 7 female students having field independent cognitive style in class 11. The type of this research was descriptive qualitative. The method of data collection used was observation, documentation, and interview. Data analysis technique was by reduction, presentation, and conclusion. The results of this study showed that the female students with field independent cognitive style in solving the linier program problem had the ability to represent algebraic ideas from the narrative question that had been read by manipulating symbols and variables presented in tabular form, creating and building mathematical models in two variables linear inequality system which represented algebraic ideas, and interpreting the solutions as variables obtained from the point of intersection in the solution area to obtain maximum benefit.

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.

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

CERN Document Server

Lhersonneau, G; Rizzi, V; Alyakrinskiy, O; Lanchais, A; Volkov, Yu.M; Barzakh, A.E; Fedorov, D.V; Ionan, A.M; Ivanov, V.S; Mezilev, K.A; Moroz, F.V; Orlov, S.Yu; Panteleev, V.N; Lau, C; Bajeat, O; Essabaa, S; Leroy, R; Jardin, P; Stroe, L; 10.1103/PhysRevC.74.017308

2006-01-01

The branching of the 2+ to 0+ transition in 92Sr has been measured to 0.032(4) per 92Rb decay. It confirms an earlier measurement however discarded in nuclear data evaluations since in contradiction with accepted lower logft limits. The conflict could be solved assuming that close to half of the decay intensity, mostly as high-energy ground-state transitions, is missing in th edecay scheme.

Simulated annealing approach for solving economic load dispatch ...

African Journals Online (AJOL)

user

thermodynamics to solve economic load dispatch (ELD) problems. ... evolutionary programming algorithm has been successfully applied for solving the ... concept behind the simulated annealing (SA) optimization is discussed in Section 3.

Solving applied mathematical problems with Matlab

CERN Document Server

Xue, Dingyu

2008-01-01

Computer Mathematics Language-An Overview. Fundamentals of MATLAB Programming. Calculus Problems. MATLAB Computations of Linear Algebra Problems. Integral Transforms and Complex Variable Functions. Solutions to Nonlinear Equations and Optimization Problems. MATLAB Solutions to Differential Equation Problems. Solving Interpolations and Approximations Problems. Solving Probability and Mathematical Statistics Problems. Nontraditional Solution Methods for Mathematical Problems.

Branches of the Facial Artery.

Science.gov (United States)

Hwang, Kun; Lee, Geun In; Park, Hye Jin

2015-06-01

The aim of this study is to review the name of the branches, to review the classification of the branching pattern, and to clarify a presence percentage of each branch of the facial artery, systematically. In a PubMed search, the search terms "facial," AND "artery," AND "classification OR variant OR pattern" were used. The IBM SPSS Statistics 20 system was used for statistical analysis. Among the 500 titles, 18 articles were selected and reviewed systematically. Most of the articles focused on "classification" according to the "terminal branch." Several authors classified the facial artery according to their terminal branches. Most of them, however, did not describe the definition of "terminal branch." There were confusions within the classifications. When the inferior labial artery was absent, 3 different types were used. The "alar branch" or "nasal branch" was used instead of the "lateral nasal branch." The angular branch was used to refer to several different branches. The presence as a percentage of each branch according to the branches in Gray's Anatomy (premasseteric, inferior labial, superior labial, lateral nasal, and angular) varied. No branch was used with 100% consistency. The superior labial branch was most frequently cited (95.7%, 382 arteries in 399 hemifaces). The angular branch (53.9%, 219 arteries in 406 hemifaces) and the premasseteric branch were least frequently cited (53.8%, 43 arteries in 80 hemifaces). There were significant differences among each of the 5 branches (P < 0.05) except between the angular branch and the premasseteric branch and between the superior labial branch and the inferior labial branch. The authors believe identifying the presence percentage of each branch will be helpful for surgical procedures.

A Rubric for Assessing Students' Experimental Problem-Solving Ability

Science.gov (United States)

Shadle, Susan E.; Brown, Eric C.; Towns, Marcy H.; Warner, Don L.

2012-01-01

The ability to couple problem solving both to the understanding of chemical concepts and to laboratory practices is an essential skill for undergraduate chemistry programs to foster in our students. Therefore, chemistry programs must offer opportunities to answer real problems that require use of problem-solving processes used by practicing…

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.

FGP Approach for Solving Multi-level Multi-objective Quadratic Fractional Programming Problem with Fuzzy parameters

Directory of Open Access Journals (Sweden)

m. s. osman

2017-09-01

Full Text Available In this paper, we consider fuzzy goal programming (FGP approach for solving multi-level multi-objective quadratic fractional programming (ML-MOQFP problem with fuzzy parameters in the constraints. Firstly, the concept of the ?-cut approach is applied to transform the set of fuzzy constraints into a common deterministic one. Then, the quadratic fractional objective functions in each level are transformed into quadratic objective functions based on a proposed transformation. Secondly, the FGP approach is utilized to obtain a compromise solution for the ML-MOQFP problem by minimizing the sum of the negative deviational variables. Finally, an illustrative numerical example is given to demonstrate the applicability and performance of the proposed approach.

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

Directory of Open Access Journals (Sweden)

E.-K. Gulland

2012-07-01

Full Text Available Problem-solving knowledge and skills are an important attribute of spatial sciences graduates. The challenge of higher education is to build a teaching and learning environment that enables students to acquire these skills in relevant and authentic applications. This study investigates the effectiveness of traditional face-to-face teaching and online learning technologies in supporting the student learning of problem-solving and computer programming skills, techniques and solutions. The student cohort considered for this study involves students in the surveying as well as geographic information science (GISc disciplines. Also, students studying across a range of learning modes including on-campus, distance and blended, are considered in this study. Student feedback and past studies reveal a lack of student interest and engagement in problem solving and computer programming. Many students do not see such skills as directly relevant and applicable to their perceptions of what future spatial careers hold. A range of teaching and learning methods for both face-to-face teaching and distance learning were introduced to address some of the perceived weaknesses of the learning environment. These included initiating greater student interaction in lectures, modifying assessments to provide greater feedback and student accountability, and the provision of more interactive and engaging online learning resources. The paper presents and evaluates the teaching methods used to support the student learning environment. Responses of students in relation to their learning experiences were collected via two anonymous, online surveys and these results were analysed with respect to student pass and retention rates. The study found a clear distinction between expectations and engagement of surveying students in comparison to GISc students. A further outcome revealed that students who were already engaged in their learning benefited the most from the interactive

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

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.

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

Backtrack Programming: A Computer-Based Approach to Group Problem Solving.

Science.gov (United States)

Scott, Michael D.; Bodaken, Edward M.

Backtrack problem-solving appears to be a viable alternative to current problem-solving methodologies. It appears to have considerable heuristic potential as a conceptual and operational framework for small group communication research, as well as functional utility for the student group in the small group class or the management team in the…

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.

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.

A Comparison of Students in Physical Education and Sports College and the Students in Other Departments in Terms of Problem Solving Skills

Science.gov (United States)

Görücü, Alpaslan; Cantav, Erkan

2017-01-01

In this research, it is aimed to analyze the problem solving skills of university students in terms of different variables and to analyze the differences among the levels of perceived problem solving skill of the students of Physical Education and Sports College and other branch students. The sample consists of the university students from the…

Aquatics Systems Branch: transdisciplinary research to address water-related environmental problems

Science.gov (United States)

Dong, Quan; Walters, Katie D.

2015-01-01

The Aquatic Systems Branch at the Fort Collins Science Center is a group of scientists dedicated to advancing interdisciplinary science and providing science support to solve water-related environmental issues. Natural resource managers have an increasing need for scientific information and stakeholders face enormous challenges of increasing and competing demands for water. Our scientists are leaders in ecological flows, riparian ecology, hydroscape ecology, ecosystem management, and contaminant biology. The Aquatic Systems Branch employs and develops state-of-the-science approaches in field investigations, laboratory experiments, remote sensing, simulation and predictive modeling, and decision support tools. We use the aquatic experimental laboratory, the greenhouse, the botanical garden and other advanced facilities to conduct unique research. Our scientists pursue research on the ground, in the rivers, and in the skies, generating and testing hypotheses and collecting quantitative information to support planning and design in natural resource management and aquatic restoration.

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

Directory of Open Access Journals (Sweden)

Deng-Feng Li

2013-01-01

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

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 addition, we are able to produce new best known solutions for five out of twelve instances from a publicly available repository. © 2013 Elsevier B.V. All rights reserved....

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

DEFF Research Database (Denmark)

Stolpe, Mathias; Bendsøe, Martin P.

2007-01-01

This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities...

Improving mathematical problem solving : A computerized approach

NARCIS (Netherlands)

Harskamp, EG; Suhre, CJM

Mathematics teachers often experience difficulties in teaching students to become skilled problem solvers. This paper evaluates the effectiveness of two interactive computer programs for high school mathematics problem solving. Both programs present students with problems accompanied by instruction

Third annual Walker Branch watershed research symposium: Programs and abstracts

International Nuclear Information System (INIS)

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

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

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

DEFF Research Database (Denmark)

Stolpe, Mathias; Bendsøe, Martin P.

2007-01-01

This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities......) and cuts....

Knowledge-Based Instruction: Teaching Problem Solving in a Logo Learning Environment.

Science.gov (United States)

Swan, Karen; Black, John B.

1993-01-01

Discussion of computer programming and knowledge-based instruction focuses on three studies of elementary and secondary school students which show that five particular problem-solving strategies can be developed in students explicitly taught the strategies and given practice applying them to solve LOGO programming problems. (Contains 53…

Solving Disparities Through Payment And Delivery System Reform: A Program To Achieve Health Equity.

Science.gov (United States)

DeMeester, Rachel H; Xu, Lucy J; Nocon, Robert S; Cook, Scott C; Ducas, Andrea M; Chin, Marshall H

2017-06-01

Payment systems generally do not directly encourage or support the reduction of health disparities. In 2013 the Finding Answers: Solving Disparities through Payment and Delivery System Reform program of the Robert Wood Johnson Foundation sought to understand how alternative payment models might intentionally incorporate a disparities-reduction component to promote health equity. A qualitative analysis of forty proposals to the program revealed that applicants generally did not link payment reform tightly to disparities reduction. Most proposed general pay-for-performance, global payment, or shared savings plans, combined with multicomponent system interventions. None of the applicants proposed making any financial payments contingent on having successfully reduced disparities. Most applicants did not address how they would optimize providers' intrinsic and extrinsic motivation to reduce disparities. A better understanding of how payment and care delivery models might be designed and implemented to reduce health disparities is essential. Project HOPE—The People-to-People Health Foundation, Inc.

The Effects of Computer Programming on High School Students' Reasoning Skills and Mathematical Self-Efficacy and Problem Solving

Science.gov (United States)

Psycharis, Sarantos; Kallia, Maria

2017-01-01

In this paper we investigate whether computer programming has an impact on high school student's reasoning skills, problem solving and self-efficacy in Mathematics. The quasi-experimental design was adopted to implement the study. The sample of the research comprised 66 high school students separated into two groups, the experimental and the…

On Central Branch/Reinsurance Risk Networks: Exact Results and Heuristics

Directory of Open Access Journals (Sweden)

Florin Avram

2018-04-01

Full Text Available Modeling the interactions between a reinsurer and several insurers, or between a central management branch (CB and several subsidiary business branches, or between a coalition and its members, are fascinating problems, which suggest many interesting questions. Beyond two dimensions, one cannot expect exact answers. Occasionally, reductions to one dimension or heuristic simplifications yield explicit approximations, which may be useful for getting qualitative insights. In this paper, we study two such problems: the ruin problem for a two-dimensional CB network under a new mathematical model, and the problem of valuation of two-dimensional CB networks by optimal dividends. A common thread between these two problems is that the one dimensional reduction exploits the concept of invariant cones. Perhaps the most important contribution of the paper is the questions it raises; for that reason, we have found it useful to complement the particular examples solved by providing one possible formalization of the concept of a multi-dimensional risk network, which seems to us an appropriate umbrella for the kind of questions raised here.

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

Mixed-integer programming methods for transportation and power generation problems

Science.gov (United States)

Damci Kurt, Pelin

This dissertation conducts theoretical and computational research to solve challenging problems in application areas such as supply chain and power systems. The first part of the dissertation studies a transportation problem with market choice (TPMC) which is a variant of the classical transportation problem in which suppliers with limited capacities have a choice of which demands (markets) to satisfy. We show that TPMC is strongly NP-complete. We consider a version of the problem with a service level constraint on the maximum number of markets that can be rejected and show that if the original problem is polynomial, its cardinality-constrained version is also polynomial. We propose valid inequalities for mixed-integer cover and knapsack sets with variable upper bound constraints, which appear as substructures of TPMC and use them in a branch-and-cut algorithm to solve this problem. The second part of this dissertation studies a unit commitment (UC) problem in which the goal is to minimize the operational cost of power generators over a time period subject to physical constraints while satisfying demand. We provide several exponential classes of multi-period ramping and multi-period variable upper bound inequalities. We prove the strength of these inequalities and describe polynomial-time separation algorithms. Computational results show the effectiveness of the proposed inequalities when used as cuts in a branch-and-cut algorithm to solve the UC problem. The last part of this dissertation investigates the effects of uncertain wind power on the UC problem. A two-stage robust model and a three-stage stochastic program are compared.

BranchAnalysis2D/3D automates morphometry analyses of branching structures.

Science.gov (United States)

Srinivasan, Aditya; Muñoz-Estrada, Jesús; Bourgeois, Justin R; Nalwalk, Julia W; Pumiglia, Kevin M; Sheen, Volney L; Ferland, Russell J

2018-01-15

Morphometric analyses of biological features have become increasingly common in recent years with such analyses being subject to a large degree of observer bias, variability, and time consumption. While commercial software packages exist to perform these analyses, they are expensive, require extensive user training, and are usually dependent on the observer tracing the morphology. To address these issues, we have developed a broadly applicable, no-cost ImageJ plugin we call 'BranchAnalysis2D/3D', to perform morphometric analyses of structures with branching morphologies, such as neuronal dendritic spines, vascular morphology, and primary cilia. Our BranchAnalysis2D/3D algorithm allows for rapid quantification of the length and thickness of branching morphologies, independent of user tracing, in both 2D and 3D data sets. We validated the performance of BranchAnalysis2D/3D against pre-existing software packages using trained human observers and images from brain and retina. We found that the BranchAnalysis2D/3D algorithm outputs results similar to available software (i.e., Metamorph, AngioTool, Neurolucida), while allowing faster analysis times and unbiased quantification. BranchAnalysis2D/3D allows inexperienced observers to output results like a trained observer but more efficiently, thereby increasing the consistency, speed, and reliability of morphometric analyses. Copyright © 2017 Elsevier B.V. All rights reserved.

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)

Tolstikhin, Oleg I.; Namba, Chusei

2003-08-01

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)

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.

Bundle Branch Block

Science.gov (United States)

... known cause. Causes can include: Left bundle branch block Heart attacks (myocardial infarction) Thickened, stiffened or weakened ... myocarditis) High blood pressure (hypertension) Right bundle branch block A heart abnormality that's present at birth (congenital) — ...

Behaviors of Problem-Solving Groups

National Research Council Canada - National Science Library

Bennis, Warren G

1958-01-01

The results of two studies are contained in this report in summary form. They represent the first parts of a program of research designed to study the effects of change and history on the on the behaviors of problem-solving Groups...

CTD: a computer program to solve the three dimensional multi-group diffusion equation in X, Y, Z, and triangular Z geometries

Energy Technology Data Exchange (ETDEWEB)

Fletcher, J K

1973-05-01

CTD is a computer program written in Fortran 4 to solve the multi-group diffusion theory equations in X, Y, Z and triangular Z geometries. A power print- out neutron balance and breeding gain are also produced. 4 references. (auth)

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

Poisson branching point processes

International Nuclear Information System (INIS)

Matsuo, K.; Teich, M.C.; Saleh, B.E.A.

1984-01-01

We investigate the statistical properties of a special branching point process. The initial process is assumed to be a homogeneous Poisson point process (HPP). The initiating events at each branching stage are carried forward to the following stage. In addition, each initiating event independently contributes a nonstationary Poisson point process (whose rate is a specified function) located at that point. The additional contributions from all points of a given stage constitute a doubly stochastic Poisson point process (DSPP) whose rate is a filtered version of the initiating point process at that stage. The process studied is a generalization of a Poisson branching process in which random time delays are permitted in the generation of events. Particular attention is given to the limit in which the number of branching stages is infinite while the average number of added events per event of the previous stage is infinitesimal. In the special case when the branching is instantaneous this limit of continuous branching corresponds to the well-known Yule--Furry process with an initial Poisson population. The Poisson branching point process provides a useful description for many problems in various scientific disciplines, such as the behavior of electron multipliers, neutron chain reactions, and cosmic ray showers

Programs of the Materials and Radiation Effects Branch

International Nuclear Information System (INIS)

Dalder, E.N.C.

1976-01-01

This report describes specific efforts devoted to resolving fusion reactor materials needs as they relate to major fusion power program objectives and construction of major fusion facilities. Summaries of ERDA-sponsored research being conducted on the following areas are given: surface program, bulk irradiation program, dosimetry program, materials selection and development program, and neutron source development program

Branches of the landscape

International Nuclear Information System (INIS)

Dine, Michael; O'Neil, Deva; Sun Zheng

2005-01-01

With respect to the question of supersymmetry breaking, there are three branches of the flux landscape. On one of these, if one requires small cosmological constant, supersymmetry breaking is predominantly at the fundamental scale; on another, the distribution is roughly flat on a logarithmic scale; on the third, the preponderance of vacua are at very low scale. A priori, as we will explain, one can say little about the first branch. The vast majority of these states are not accessible even to crude, approximate analysis. On the other two branches one can hope to do better. But as a result of the lack of access to branch one, and our poor understanding of cosmology, we can at best conjecture about whether string theory predicts low energy supersymmetry or not. If we hypothesize that are on branch two or three, distinctive predictions may be possible. We comment of the status of naturalness within the landscape, deriving, for example, the statistics of the first branch from simple effective field theory reasoning

Module for the organization of a branch of the universal branch driver in the CAMAC standard

International Nuclear Information System (INIS)

Nguen Fuk; Smirnov, V.A.; Khmelevski, E.

1976-01-01

A module is elaborated for the organization of a branch of the universal branch driver in the CAMAC standard for the conjugation of a control crate trunk with a branch trunk. A block diagram of the module is described; its principal specifications are given. The universal branch driver system may accomodate up to 10 branch organization modules with one control source module

Expected value based fuzzy programming approach to solve integrated supplier selection and inventory control problem with fuzzy demand

Science.gov (United States)

Sutrisno; Widowati; Sunarsih; Kartono

2018-01-01

In this paper, a mathematical model in quadratic programming with fuzzy parameter is proposed to determine the optimal strategy for integrated inventory control and supplier selection problem with fuzzy demand. To solve the corresponding optimization problem, we use the expected value based fuzzy programming. Numerical examples are performed to evaluate the model. From the results, the optimal amount of each product that have to be purchased from each supplier for each time period and the optimal amount of each product that have to be stored in the inventory for each time period were determined with minimum total cost and the inventory level was sufficiently closed to the reference level.

Optimal chiller sequencing by branch and bound method for saving energy

International Nuclear Information System (INIS)

Chang, Y.-C.; Lin, F.-A.; Lin, C.H.

2005-01-01

This paper proposes a method for using the branch and bound (B and B) method to solve the optimal chiller sequencing (OCS) problem and to eliminate the deficiencies of conventional methods. The coefficient of performance (COP) of the chiller is adopted as the objective function because it is concave. The Lagrangian method determines the optimal chiller loading (OCL) in each feasible state. The potential performance of the proposed method is examined with reference to an example system. The proposed method consumes much less power than the conventional method and is very appropriate for application in air conditioning systems

Assessing Leadership and Problem-Solving Skills and Their Impacts in the Community.

Science.gov (United States)

Rohs, F. Richard; Langone, Christine A.

1993-01-01

A pretest-posttest control group design was used to assess the leadership and problem-solving skills of 281 participants and 110 controls in a statewide community leadership development program. Quantitative and qualitative data demonstrate that the program has been a catalyst to influence leadership and problem-solving skills for community…

Do Branch Lengths Help to Locate a Tree in a Phylogenetic Network?

Science.gov (United States)

Gambette, Philippe; van Iersel, Leo; Kelk, Steven; Pardi, Fabio; Scornavacca, Celine

2016-09-01

Phylogenetic networks are increasingly used in evolutionary biology to represent the history of species that have undergone reticulate events such as horizontal gene transfer, hybrid speciation and recombination. One of the most fundamental questions that arise in this context is whether the evolution of a gene with one copy in all species can be explained by a given network. In mathematical terms, this is often translated in the following way: is a given phylogenetic tree contained in a given phylogenetic network? Recently this tree containment problem has been widely investigated from a computational perspective, but most studies have only focused on the topology of the phylogenies, ignoring a piece of information that, in the case of phylogenetic trees, is routinely inferred by evolutionary analyses: branch lengths. These measure the amount of change (e.g., nucleotide substitutions) that has occurred along each branch of the phylogeny. Here, we study a number of versions of the tree containment problem that explicitly account for branch lengths. We show that, although length information has the potential to locate more precisely a tree within a network, the problem is computationally hard in its most general form. On a positive note, for a number of special cases of biological relevance, we provide algorithms that solve this problem efficiently. This includes the case of networks of limited complexity, for which it is possible to recover, among the trees contained by the network with the same topology as the input tree, the closest one in terms of branch lengths.

Deciding Full Branching Time Logic by Program Transformation

Science.gov (United States)

Pettorossi, Alberto; Proietti, Maurizio; Senni, Valerio

We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL*) properties of finite state reactive systems. The finite state systems and the CTL* properties we want to verify, are encoded as logic programs on infinite lists. Our verification method consists of two steps. In the first step we transform the logic program that encodes the given system and the given property, into a monadic ω -program, that is, a stratified program defining nullary or unary predicates on infinite lists. This transformation is performed by applying unfold/fold rules that preserve the perfect model of the initial program. In the second step we verify the property of interest by using a proof method for monadic ω-programs.

Solving large mixed linear models using preconditioned conjugate gradient iteration.

Science.gov (United States)

Strandén, I; Lidauer, M

1999-12-01

Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.

Two pricing methods for solving an integrated commercial fishery ...

African Journals Online (AJOL)

In this paper, we develop two novel pricing methods for solving an integer program. We demonstrate the methods by solving an integrated commercial fishery planning model (IFPM). In this problem, a fishery manager must schedule fishing trawlers (determine when and where the trawlers should go fishing, and when the ...

[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

Inference rule and problem solving

Energy Technology Data Exchange (ETDEWEB)

Goto, S

1982-04-01

Intelligent information processing signifies an opportunity of having man's intellectual activity executed on the computer, in which inference, in place of ordinary calculation, is used as the basic operational mechanism for such an information processing. Many inference rules are derived from syllogisms in formal logic. The problem of programming this inference function is referred to as a problem solving. Although logically inference and problem-solving are in close relation, the calculation ability of current computers is on a low level for inferring. For clarifying the relation between inference and computers, nonmonotonic logic has been considered. The paper deals with the above topics. 16 references.

Solving the pre-marshalling problem to optimality with A* and IDA*

DEFF Research Database (Denmark)

Tierney, Kevin; Pacino, Dario; Voß, Stefan

2017-01-01

We present a novel solution approach to the container pre-marshalling problem using the A* and IDA* algorithms combined with several novel branching and symmetry breaking rules that significantly increases the number of pre-marshalling instances that can be solved to optimality. A* and IDA......* are graph search algorithms that use heuristics combined with a complete graph search to find optimal solutions to problems. The container pre-marshalling problem is a key problem for container terminals seeking to reduce delays of inter-modal container transports. The goal of the container pre...

Spiral branches and star formation

International Nuclear Information System (INIS)

Zasov, A.V.

1974-01-01

Origin of spiral branches of galaxies and formation of stars in them are considered from the point of view of the theory of the gravitational gas condensation, one of comparatively young theories. Arguments are presented in favour of the stellar condensation theory. The concept of the star formation of gas is no longer a speculative hypothesis. This is a theory which assumes quantitative verification and explains qualitatively many facts observed. And still our knowledge on the nature of spiral branches is very poor. It still remains vague what processes give origin to spiral branches, why some galaxies have spirals and others have none. And shapes of spiral branches are diverse. Some cases are known when spiral branches spread outside boundaries of galaxies themselves. Such spirals arise exclusively in the region where there are two or some interacting galaxies. Only first steps have been made in the explanation of the galaxy spiral branches, and it is necessary to carry out new observations and new theoretical calculations

Current perspectives on shoot branching regulation

Directory of Open Access Journals (Sweden)

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

2015-03-01

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

Problem solving strategies integrated into nursing process to promote clinical problem solving abilities of RN-BSN students.

Science.gov (United States)

Wang, Jing-Jy; Lo, Chi-Hui Kao; Ku, Ya-Lie

2004-11-01

A set of problem solving strategies integrated into nursing process in nursing core courses (PSNP) was developed for students enrolled in a post-RN baccalaureate nursing program (RN-BSN) in a university in Taiwan. The purpose of this study, therefore, was to evaluate the effectiveness of PSNP on students' clinical problem solving abilities. The one-group post-test design with repeated measures was used. In total 114 nursing students with 47 full-time students and 67 part-time students participated in this study. The nursing core courses were undertaken separately in three semesters. After each semester's learning, students would start their clinical practice, and were asked to submit three written nursing process recordings during each clinic. Assignments from the three practices were named post-test I, II, and III sequentially, and provided the data for this study. The overall score of problem solving indicated that score on the post-test III was significantly better than that on post-test I and II, meaning both full-time and part-time students' clinical problem solving abilities improved at the last semester. In conclusion, problem-solving strategies integrated into nursing process designed for future RN-BSN students are recommendable.

Characterization of the Diameter, branch angle and longevity of axial branches of Nothofagusobliqua

Directory of Open Access Journals (Sweden)

Patricio Corvalán Vera

2017-08-01

Full Text Available The lack of knowledge about grow dynamics of the living tree crown of Nothofagusobliqua secondary growth forests strongly limits the objective formulation of silvicultural schemes oriented to the industrial production of high quality wood. Therefore, in this work, we described basic relationships between tree size, age and angle branches insertion and the crown. Considering a sample data of 59 dominant trees, distributed in different age conditions, we applied a combined analysis technique of stem analysis, steam taper analysis and thickest branch measurement in each decile of the total height. This approach allowed us to determine that there is a significant relationship between the steam diameter, the angle insertion and the age of the branch, as well as the size and age of the trees. Also, the thicker branches tend to have lower insertion angles, to be older, to be located at lower relative heights and to be located in larger diameter sections. Taking into consideration these relationships, it is possible to build new predicted branch models as tools for the development of silvicultural schemes to suit different log grade.

New approach to solve fully fuzzy system of linear equations using ...

Indian Academy of Sciences (India)

Known example problems are solved to illustrate the efficacy and ... The concept of fuzzy set and fuzzy number were first introduced by Zadeh .... (iii) Fully fuzzy linear systems can be solved by linear programming approach, Gauss elim-.

Branch prediction in the pentium family

DEFF Research Database (Denmark)

Fog, Agner

1998-01-01

How the branch prediction mechanism in the Pentium has been uncovered with all its quirks, and the incredibly more effective branch prediction in the later versions.......How the branch prediction mechanism in the Pentium has been uncovered with all its quirks, and the incredibly more effective branch prediction in the later versions....

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…

Local Strategy Improvement for Parity Game Solving

OpenAIRE

Friedmann, Oliver; Lange, Martin

2010-01-01

The problem of solving a parity game is at the core of many problems in model checking, satisfiability checking and program synthesis. Some of the best algorithms for solving parity game are strategy improvement algorithms. These are global in nature since they require the entire parity game to be present at the beginning. This is a distinct disadvantage because in many applications one only needs to know which winning region a particular node belongs to, and a witnessing winning strategy may...

A program package for solving linear optimization problems

International Nuclear Information System (INIS)

Horikami, Kunihiko; Fujimura, Toichiro; Nakahara, Yasuaki

1980-09-01

Seven computer programs for the solution of linear, integer and quadratic programming (four programs for linear programming, one for integer programming and two for quadratic programming) have been prepared and tested on FACOM M200 computer, and auxiliary programs have been written to make it easy to use the optimization program package. The characteristics of each program are explained and the detailed input/output descriptions are given in order to let users know how to use them. (author)

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

Directory of Open Access Journals (Sweden)

Aihong Ren

2016-01-01

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

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

Renal Branch Artery Stenosis

DEFF Research Database (Denmark)

Andersson, Zarah; Thisted, Ebbe; Andersen, Ulrik Bjørn

2017-01-01

Renovascular hypertension is a common cause of pediatric hypertension. In the fraction of cases that are unrelated to syndromes such as neurofibromatosis, patients with a solitary stenosis on a branch of the renal artery are common and can be diagnostically challenging. Imaging techniques...... that perform well in the diagnosis of main renal artery stenosis may fall short when it comes to branch artery stenosis. We report 2 cases that illustrate these difficulties and show that a branch artery stenosis may be overlooked even by the gold standard method, renal angiography....

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.

Development of nonlinear dynamic analysis program for nuclear piping systems

International Nuclear Information System (INIS)

Kamichika, Ryoichi; Izawa, Masahiro; Yamadera, Masao

1980-01-01

In the design for nuclear power piping, pipe-whip protection shall be considered in order to keep the function of safety related system even when postulated piping rupture occurs. This guideline was shown in U.S. Regulatory Guide 1.46 for the first time and has been applied in Japanese nuclear power plants. In order to analyze the dynamic behavior followed by pipe rupture, nonlinear analysis is required for the piping system including restraints which play the role of an energy absorber. REAPPS (Rupture Effective Analysis of Piping Systems) has been developed for this purpose. This program can be applied to general piping systems having branches etc. Pre- and post- processors are prepared in this program in order to easily input the data for the piping engineer and show the results optically by use of a graphic display respectively. The piping designer can easily solve many problems in his daily work by use of this program. This paper describes about the theoretical background and functions of this program and shows some examples. (author)

Supporting Organizational Problem Solving with a Workstation.

Science.gov (United States)

1982-07-01

G. [., and Sussman, G. J. AMORD: Explicit Control or Reasoning. In Proceedings of the Symposium on Artificial Intellignece and Programming Languagues...0505 9. PERFORMING ORGANIZATION NAME AND ADDRESS 10. PROGRAM ELEMENT. PROJECT. TASK Artificial Intelligence Laboratory AREA& WORK UNIT NUMBERS 545...extending ideas from the field of Artificial Intelligence (A), we describ office work as a problem solving activity. A knowledge embedding language called

Linear programming computation

CERN Document Server

PAN, Ping-Qi

2014-01-01

With emphasis on computation, this book is a real breakthrough in the field of LP. In addition to conventional topics, such as the simplex method, duality, and interior-point methods, all deduced in a fresh and clear manner, it introduces the state of the art by highlighting brand-new and advanced results, including efficient pivot rules, Phase-I approaches, reduced simplex methods, deficient-basis methods, face methods, and pivotal interior-point methods. In particular, it covers the determination of the optimal solution set, feasible-point simplex method, decomposition principle for solving large-scale problems, controlled-branch method based on generalized reduced simplex framework for solving integer LP problems.

Solving PDEs in Python the FEniCS tutorial I

CERN Document Server

Langtangen, Hans Petter

2016-01-01

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

Advanced endografting techniques: snorkels, chimneys, periscopes, fenestrations, and branched endografts.

Science.gov (United States)

Kansagra, Kartik; Kang, Joseph; Taon, Matthew-Czar; Ganguli, Suvranu; Gandhi, Ripal; Vatakencherry, George; Lam, Cuong

2018-04-01

The anatomy of aortic aneurysms from the proximal neck to the access vessels may create technical challenges for endovascular repair. Upwards of 30% of patients with abdominal aortic aneurysms (AAA) have unsuitable proximal neck morphology for endovascular repair. Anatomies considered unsuitable for conventional infrarenal stent grafting include short or absent necks, angulated necks, conical necks, or large necks exceeding size availability for current stent grafts. A number of advanced endovascular techniques and devices have been developed to circumvent these challenges, each with unique advantages and disadvantages. These include snorkeling procedures such as chimneys, periscopes, and sandwich techniques; "homemade" or "back-table" fenestrated endografts as well as manufactured, customized fenestrated endografts; and more recently, physician modified branched devices. Furthermore, new devices in the pipeline under investigation, such as "off-the-shelf" fenestrated stent grafts, branched stent grafts, lower profile devices, and novel sealing designs, have the potential of solving many of the aforementioned problems. The treatment of aortic aneurysms continues to evolve, further expanding the population of patients that can be treated with an endovascular approach. As the technology grows so do the number of challenging aortic anatomies that endovascular specialists take on, further pushing the envelope in the arena of aortic repair.

Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation

DEFF Research Database (Denmark)

Uchoa, Eduardo; Fukasawa, Ricardo; Lysgaard, Jens

2008-01-01

-polynomial time. Traditional inequalities over the arc formulation, like Capacity Cuts, are also used. Moreover, a novel feature is introduced in such kind of algorithms: powerful new cuts expressed over a very large set of variables are added, without increasing the complexity of the pricing subproblem......This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arborescence problem in order to make it solvable in pseudo...... or the size of the LPs that are actually solved. Computational results on benchmark instances from the OR-Library show very significant improvements over previous algorithms. Several open instances could be solved to optimality....

Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain

Science.gov (United States)

Anbuudayasankar, S. P.; Ganesh, K.; Lenny Koh, S. C.; Mohandas, K.

2010-03-01

A reverse logistics problem, motivated by many real-life applications, is examined where bottles/cans in which products are delivered from a processing depot to customers in one period are available for return to the depot in the following period. The picked-up bottles/cans need to be adjusted in the place of delivery load. This problem is termed as simultaneous delivery and pick-up problem with constrained capacity (SDPC). We develop three unified heuristics based on extended branch and bound heuristic, genetic algorithm and simulated annealing to solve SDPC. These heuristics are also designed to solve standard travelling salesman problem (TSP) and TSP with simultaneous delivery and pick-up (TSDP). We tested the heuristics on standard, derived and randomly generated datasets of TSP, TSDP and SDPC and obtained satisfying results with high convergence in reasonable time.

A Game-Theoretic Approach to Branching Time Abstract-Check-Refine Process

Science.gov (United States)

Wang, Yi; Tamai, Tetsuo

2009-01-01

Since the complexity of software systems continues to grow, most engineers face two serious problems: the state space explosion problem and the problem of how to debug systems. In this paper, we propose a game-theoretic approach to full branching time model checking on three-valued semantics. The three-valued models and logics provide successful abstraction that overcomes the state space explosion problem. The game style model checking that generates counter-examples can guide refinement or identify validated formulas, which solves the system debugging problem. Furthermore, output of our game style method will give significant information to engineers in detecting where errors have occurred and what the causes of the errors are.

Annual report, Basic Sciences Branch, FY 1991

Energy Technology Data Exchange (ETDEWEB)

1993-04-01

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

Annual report, Basic Sciences Branch, FY 1991

Energy Technology Data Exchange (ETDEWEB)

1993-04-01

This report summarizes the progress of the Basic Sciences Branch of the National Renewable Energy Laboratory (NREL) from October 1, 1990, through September 30, 1991. Seven technical sections of the report cover these main areas of NREL's in-house research: Semiconductor Crystal Growth, Amorphous Silicon Research, Polycrystalline Thin Films, III-V High-Efficiency Photovoltaic Cells, Solid-State Theory, Solid-State Spectroscopy, and Superconductivity. Each section explains the purpose and major accomplishments of the work in the context of the US Department of Energy's National Photovoltaic Research Program plans.

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.

FLUORINE ABUNDANCES IN GALACTIC ASYMPTOTIC GIANT BRANCH STARS

International Nuclear Information System (INIS)

Abia, C.; Cristallo, S.; DomInguez, I.; Cunha, K.; Hinkle, K.; Smith, V. V.; De Laverny, P.; Recio-Blanco, A.; Eriksson, K.; Wahlin, R.; Gialanella, L.; Imbriani, G.; Straniero, O.

2010-01-01

An analysis of the fluorine abundance in Galactic asymptotic giant branch (AGB) carbon stars (24 N-type, 5 SC-type, and 5 J-type) is presented. This study uses the state-of-the-art carbon-rich atmosphere models and improved atomic and molecular line lists in the 2.3 μm region. Significantly lower F abundances are obtained in comparison to previous studies in the literature. This difference is mainly due to molecular blends. In the case of carbon stars of SC-type, differences in the model atmospheres are also relevant. The new F enhancements are now in agreement with the most recent theoretical nucleosynthesis models in low-mass AGB stars, solving the long-standing problem of F in Galactic AGB stars. Nevertheless, some SC-type carbon stars still show larger F abundances than predicted by stellar models. The possibility that these stars are of larger mass is briefly discussed.

A tabu-search heuristic for solving the multi-depot vehicle scheduling problem

Directory of Open Access Journals (Sweden)

Gilmar D'Agostini Oliveira Casalinho

2014-08-01

Full Text Available Currently the logistical problems are relying quite significantly on Operational Research in order to achieve greater efficiency in their operations. Among the problems related to the vehicles scheduling in a logistics system, the Multiple Depot Vehicle Scheduling Problem (MDVSP has been addressed in several studies. The MDVSP presupposes the existence of depots that affect the planning of sequences to which travel must be performed. Often, exact methods cannot solve large instances encountered in practice and in order to take them into account, several heuristic approaches are being developed. The aim of this study was thus to solve the MDVSP using a meta-heuristic based on tabu-search method. The main motivation for this work came from the indication that only recently the use of meta-heuristics is being applied to MDVSP context (Pepin et al. 2008 and, also, the limitations listed by Rohde (2008 in his study, which used the branch-and-bound in one of the steps of the heuristic presented to solve the problem, which has increased the time resolution. The research method for solving this problem was based on adaptations of traditional techniques of Operational Research, and provided resolutions presenting very competitive results for the MDVSP such as the cost of the objective function, number of vehicles used and computational time.

The efficiency of bank branches

OpenAIRE

Omid Takbiri; Mohammad Mohammadi; Bahman Naderi

2015-01-01

Banking industry has significant contribution in development of economies of developing countries. Most banks execute their operations through different branches. Therefore it is important to measure the relative efficiencies of these branches. Data envelopment analysis (DEA) is one of the most useful tools in measuring banks’ performance. The present paper aims to extract ranking pattern of banks based on performance evaluation using DEA analysis. In the present research, 120 bank branches o...

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

Science.gov (United States)

Kayili, Gökhan; Ari, Ramazan

2016-01-01

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

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

DEFF Research Database (Denmark)

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

2014-01-01

In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight the diffe...

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…

[Branches of the National Institute of Hygiene].

Science.gov (United States)

Gromulska, Marta

2008-01-01

National Epidemiological Institute (National Institute of Hygiene, from 7th September 1923) was established in 1918 in Warsaw and acted at national level. Its actions in the field of diseases combat were supported by bacteriological stations and vaccine production in voivodeship cities, which were taken charge of by the state, and names "National Epidemiological Institutes". According to the ministers resolution from 6th July 1921,Epidemiological Institutes were merged to National Central Epidemiological Institutes (PZH), the epidemiological institutes outside Warsaw were named branches, which were to be located in every voivodeship city, according to the initial organizational resolutions. There were country branches of NCEI in: Cracow, Lwów, Lódź, Toruń, Lublin, and Wilno in the period 1919-1923. New branches in Poznań (1925), Gdynia(1934), Katowice (Voivodeship Institute of Hygiene (1936), Luck (1937), Stanisławów (1937), Kielce(1938), and Brześć/Bug (Municipal Station acting as branch of National Central Epidemiological Institute. Branches were subordinated to NCEI-PZH) in Warsaw where action plans and unified research and diagnostic method were established and annual meeting of the country branches managers took place. All branches cooperated with hospitals, national health services, district general practitioners and administration structure in control of infectious diseases. In 1938, the post of branch inspector was established, the first of whom was Feliks Przesmycki PhD. Branches cooperated also with University of Cracow, University of Lwów and University of Wilno. In 1935, National Institutes of Food Research was incorporated in PZH, Water Department was established, and these areas of activity began to develop in the branches accordingly. In 1938 there were 13 branches of PZH, and each had three divisions: bacteriological, food research and water research. Three branches in Cracow, Kielce and Lublin worked during World War II under German

Applying natural evolution for solving computational problems - Lecture 1

CERN Multimedia

CERN. Geneva

2017-01-01

Darwin’s natural evolution theory has inspired computer scientists for solving computational problems. In a similar way to how humans and animals have evolved along millions of years, computational problems can be solved by evolving a population of solutions through generations until a good solution is found. In the first lecture, the fundaments of evolutionary computing (EC) will be described, covering the different phases that the evolutionary process implies. ECJ, a framework for researching in such field, will be also explained. In the second lecture, genetic programming (GP) will be covered. GP is a sub-field of EC where solutions are actual computational programs represented by trees. Bloat control and distributed evaluation will be introduced.

Applying natural evolution for solving computational problems - Lecture 2

CERN Multimedia

CERN. Geneva

2017-01-01

Darwin’s natural evolution theory has inspired computer scientists for solving computational problems. In a similar way to how humans and animals have evolved along millions of years, computational problems can be solved by evolving a population of solutions through generations until a good solution is found. In the first lecture, the fundaments of evolutionary computing (EC) will be described, covering the different phases that the evolutionary process implies. ECJ, a framework for researching in such field, will be also explained. In the second lecture, genetic programming (GP) will be covered. GP is a sub-field of EC where solutions are actual computational programs represented by trees. Bloat control and distributed evaluation will be introduced.

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

Directory of Open Access Journals (Sweden)

Hossein Yousefi

2017-06-01

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

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

In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks....... Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an IP-model for the problem, which is decomposed using Dantzig-Wolfe decomposition....... 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...

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

NARCIS (Netherlands)

Harskamp, E.; Suhre, C.

2007-01-01

This paper evaluates the effectiveness of a student controlled computer program for high school mathematics based on instruction principles derived from Schoenfeld's theory of problem solving. The computer program allows students to choose problems and to make use of hints during different episodes

An Effectiveness Analysis of the U.S. Federal Government Executive Branch Ethics Policy and Program

National Research Council Canada - National Science Library

Stewart, Chanet

2003-01-01

.... As public servants, whether elected or non-elected, Executive Branch employees are expected to make decisions and spend tax-payer dollars in ways that promote the overall interests of the American public...

Improved Genetic and Simulating Annealing Algorithms to Solve the Traveling Salesman Problem Using Constraint Programming

Directory of Open Access Journals (Sweden)

M. Abdul-Niby

2016-04-01

Full Text Available The Traveling Salesman Problem (TSP is an integer programming problem that falls into the category of NP-Hard problems. As the problem become larger, there is no guarantee that optimal tours will be found within reasonable computation time. Heuristics techniques, like genetic algorithm and simulating annealing, can solve TSP instances with different levels of accuracy. Choosing which algorithm to use in order to get a best solution is still considered as a hard choice. This paper suggests domain reduction as a tool to be combined with any meta-heuristic so that the obtained results will be almost the same. The hybrid approach of combining domain reduction with any meta-heuristic encountered the challenge of choosing an algorithm that matches the TSP instance in order to get the best results.

[Effects on Stress, Problem Solving Ability and Quality of Life of as a Stress Management Program for Hospitalized Schizophrenic Patients: Based on the Stress, Appraisal-Coping Model of Lazarus & Folkman].

Science.gov (United States)

Park, Sun Ah; Sung, Kyung Mi

2016-08-01

The study was done to evaluate the effects a Stress Management Program (SMP) on stress, problem solving skills, and quality of life for hospitalized patients with Schizophrenia. A mixed method design was used: a combination of a repeated-measure design with a non-equivalent control group and qualitative data collection. The participants were 40 patients with schizophrenia admitted in three psychiatric hospitals. The experimental group (n=20) received the SMP twice a week for a total of 8 weeks. Study results revealed that the SMP was effective for stress (F=321.02, pproblem solving ability (F=246.28, peffective strategy to reduce patients' hospitalization stress, and improve problem solving skills and quality of life. Therefore, it is recommended that mental health nurses use this stress management program in clinical practice to assist adaptation to hospitalization for persons with schizophrenia.

Complexity of chemical graphs in terms of size, branching, and cyclicity.

Science.gov (United States)

Balaban, A T; Mills, D; Kodali, V; Basak, S C

2006-08-01

Chemical graph complexity depends on many factors, but the main ones are size, branching, and cyclicity. Some molecular descriptors embrace together all these three parameters, which cannot then be disentangled. The topological index J (and its refinements that include accounting for bond multiplicity and the presence of heteroatoms) was designed to compensate in a significant measure for graph size and cyclicity, and therefore it contains information mainly on branching. In order to separate these factors, two new indices (F and G) related with J are proposed, which allow to group together graphs with the same size into families of constitutional formulas differing in their branching and cyclicity. A comparison with other topological indices revealed that a few other topological indices vary similarly with index G, notably DN2S4 among the triplet indices, and TOTOP among the indices contained in the Molconn-Z program. This comparison involved all possible chemical graphs (i.e. connected planar graphs with vertex degrees not higher than four) with four through six vertices, and all possible alkanes with four through nine carbon atoms.

Turing mechanism underlying a branching model for lung morphogenesis.

Science.gov (United States)

Xu, Hui; Sun, Mingzhu; Zhao, Xin

2017-01-01

The mammalian lung develops through branching morphogenesis. Two primary forms of branching, which occur in order, in the lung have been identified: tip bifurcation and side branching. However, the mechanisms of lung branching morphogenesis remain to be explored. In our previous study, a biological mechanism was presented for lung branching pattern formation through a branching model. Here, we provide a mathematical mechanism underlying the branching patterns. By decoupling the branching model, we demonstrated the existence of Turing instability. We performed Turing instability analysis to reveal the mathematical mechanism of the branching patterns. Our simulation results show that the Turing patterns underlying the branching patterns are spot patterns that exhibit high local morphogen concentration. The high local morphogen concentration induces the growth of branching. Furthermore, we found that the sparse spot patterns underlie the tip bifurcation patterns, while the dense spot patterns underlies the side branching patterns. The dispersion relation analysis shows that the Turing wavelength affects the branching structure. As the wavelength decreases, the spot patterns change from sparse to dense, the rate of tip bifurcation decreases and side branching eventually occurs instead. In the process of transformation, there may exists hybrid branching that mixes tip bifurcation and side branching. Since experimental studies have reported that branching mode switching from side branching to tip bifurcation in the lung is under genetic control, our simulation results suggest that genes control the switch of the branching mode by regulating the Turing wavelength. Our results provide a novel insight into and understanding of the formation of branching patterns in the lung and other biological systems.

Study of elasticity and limit analysis of joints and branch pipe tee connections

International Nuclear Information System (INIS)

Plancq, David

1997-01-01

The industrial context of this study is the behaviour and sizing the pipe joints in PWR and fast neutron reactors. Two aspects have been approached in this framework. The first issue is the elastic behaviour of the pipe joining with a plane or spherical surface or with another pipe in order to get a better understanding of this components usually modelled in classical calculations in a very simplified way. We focused our search on the bending of an intersecting pipe. In the case of the intersection with a plane surface we have conducted our study on the basis of literature results. In the case of intersection on a spherical surface we have also solved entirely the problem by using a sphere shell description different from that usually utilized. Finally, we give an approach to obtain a simple result for the bending of branch pipe tee joints allowing the formulation of a specific finite element. The second issue approached is the limit analysis which allows characterising the plastic failure of this structures and defining reference constraints. This constraints are used in numerous applications. We mention here the rules of pipe sizing and analyzing under primary load, the mechanics of cracks and the definition of global plasticity criteria. To solve this problem we concentrated our studies on the development of a new calculation techniques for the limit load called elastic compensation method (ECM). We have tested it on a large number of classical structures and on the branch pipe tee connections. We propose also a very simple result regarding the lower limit of the bending of a tee junction

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

Optimal calculational schemes for solving multigroup photon transport problem

International Nuclear Information System (INIS)

Dubinin, A.A.; Kurachenko, Yu.A.

1987-01-01

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

Solving Differential Equations in R: Package deSolve

NARCIS (Netherlands)

Soetaert, K.E.R.; Petzoldt, T.; Setzer, R.W.

2010-01-01

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

Dynamic Crack Branching - A Photoelastic Evaluation,

Science.gov (United States)

1982-05-01

0.41 mPai and a 0.18 MPa, and predicted a theoretical kinking angle of 84°whichagreed well with experimentally measured angle. After crack kinking...Consistent crack branching’at KIb = 2.04 MPaI -i- and r = 1.3 mm verified this crack branching criterion. The crack branching angle predicted by--.’ DD

Solving Wicked Problems through Action Learning

Science.gov (United States)

Crul, Liselore

2014-01-01

This account of practice outlines the Oxyme Action Learning Program which was conducted as part of the Management Challenge in my final year of the MSc in Coaching and Behavioral Change at Henley Business School. The central research questions were: (1) how action learning can help to solve wicked problems and (2) what the effect of an action…

Wolff-Parkinson-White syndrome type B and left bundle-branch block: electrophysiologic and radionuclide study

Energy Technology Data Exchange (ETDEWEB)

Rakovec, P.; Kranjec, I.; Fettich, J.J.; Jakopin, J.; Fidler, V.; Turk, J.

1985-01-01

Coinciding left bundle-branch block and Wolff-Parkinson-White syndrome type B, a very rare electrocardiographic occurrence, was found in a patient with dilated cardiomyopathy. Electrophysiologic study revealed eccentric retrograde atrial activation during ventricular pacing, suggesting right-sided accessory pathway. At programmed atrial pacing, effective refractory period of the accessory pathway was 310 ms; at shorter pacing coupling intervals, normal atrioventricular conduction with left bundle-branch block was seen. Left bundle-branch block was seen also with His bundle pacing. Radionuclide phase imaging demonstrated right ventricular phase advance and left ventricular phase delay; both right and left ventricular phase images revealed broad phase distribution histograms. Combined electrophysiologic and radionuclide investigations are useful to disclose complex conduction abnormalities and their mechanical correlates.

Wolff-Parkinson-White syndrome type B and left bundle-branch block: electrophysiologic and radionuclide study

International Nuclear Information System (INIS)

Rakovec, P.; Kranjec, I.; Fettich, J.J.; Jakopin, J.; Fidler, V.; Turk, J.

1985-01-01

Coinciding left bundle-branch block and Wolff-Parkinson-White syndrome type B, a very rare electrocardiographic occurrence, was found in a patient with dilated cardiomyopathy. Electrophysiologic study revealed eccentric retrograde atrial activation during ventricular pacing, suggesting right-sided accessory pathway. At programmed atrial pacing, effective refractory period of the accessory pathway was 310 ms; at shorter pacing coupling intervals, normal atrioventricular conduction with left bundle-branch block was seen. Left bundle-branch block was seen also with His bundle pacing. Radionuclide phase imaging demonstrated right ventricular phase advance and left ventricular phase delay; both right and left ventricular phase images revealed broad phase distribution histograms. Combined electrophysiologic and radionuclide investigations are useful to disclose complex conduction abnormalities and their mechanical correlates

The Search for a Non-Superallowed Branch in the β decay of ^38mK

Science.gov (United States)

Leach, Kyle; Bandyopadhyay, D.; Finlay, P.; Garrett, P. E.; Grinyer, G. F.; Phillips, A. A.; Schumaker, M. A.; Svensson, C. E.; Wong, J.; Ball, G. C.; Bassiachvilli, E.; Ettenauer, S.; Hackman, G.; Morton, A. C.; Mythili, S.; Newman, O.; Pearson, C. J.; Pearson, M. R.; Savajols, H.; Leslie, J. R.; Melconian, D.; Austin, R. A. E.; Barton, C.

2007-10-01

The study presented is part of an experimental program exploring the properties of superallowed Fermi β decays conducted at the Isotope Separator and Accelerator (ISAC) facility at TRIUMF in Vancouver, B.C. Canada. Using the 8π γ-ray spectrometer and the Scintillating Electron Positron Tagging Array (SCEPTAR), it was possible to set a new upper limit on an unobserved non-analogue branch in the decay of ^38mK. This branch is expected to be extremely weak, and the removal of contaminant isobaric decays and background radiation in the spectra was thus exceedingly important during the analysis. Our work has reduced the previous upper limit by approximately a factor of two and is approaching the theoretically predicted branching ratio.

Restricted dynamic programming: a flexible framework for solving realistic VRPs

NARCIS (Netherlands)

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

2009-01-01

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

Solving crystal structures from neutron diffraction data

International Nuclear Information System (INIS)

Wilson, C.C.

1987-07-01

In order to pursue crystal structure determination using neutron diffraction data, and given the wide experience available of solving structures using X-ray data, the codes used in X-ray structural analysis should be adapted to the different requirements of a neutron experiment. Modifications have been made to a direct methods program MITHRIL and to a Patterson methods program PATMET to incorporate into these the features of neutron rather than X-ray diffraction. While to date these modifications have been fairly straightforward and many sophistications remain to be exploited, results obtained from the neutron versions of both programs are promising. (author)

Solving the geologic issues in nuclear waste disposal

International Nuclear Information System (INIS)

Towse, D.

1979-01-01

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

VENTURE: a code block for solving multigroup neutronics problems applying the finite-difference diffusion-theory approximation to neutron transport, version II

International Nuclear Information System (INIS)

Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.

1977-11-01

The report documents the computer code block VENTURE designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P 1 ) in up to three-dimensional geometry. It uses and generates interface data files adopted in the cooperative effort sponsored by the Reactor Physics Branch of the Division of Reactor Research and Development of the Energy Research and Development Administration. Several different data handling procedures have been incorporated to provide considerable flexibility; it is possible to solve a wide variety of problems on a variety of computer configurations relatively efficiently

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

DEFF Research Database (Denmark)

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

2006-01-01

with a traditional Lagrangean relaxation over q-routes, the other defined by bound, degree and capacity constraints. This is equivalent to a linear program with exponentially many variables and constraints that can lead to lower bounds that are superior to those given by previous methods. The resulting branch-and-cut-and-price...

Tree Branching: Leonardo da Vinci's Rule versus Biomechanical Models

Science.gov (United States)

Minamino, Ryoko; Tateno, Masaki

2014-01-01

This study examined Leonardo da Vinci's rule (i.e., the sum of the cross-sectional area of all tree branches above a branching point at any height is equal to the cross-sectional area of the trunk or the branch immediately below the branching point) using simulations based on two biomechanical models: the uniform stress and elastic similarity models. Model calculations of the daughter/mother ratio (i.e., the ratio of the total cross-sectional area of the daughter branches to the cross-sectional area of the mother branch at the branching point) showed that both biomechanical models agreed with da Vinci's rule when the branching angles of daughter branches and the weights of lateral daughter branches were small; however, the models deviated from da Vinci's rule as the weights and/or the branching angles of lateral daughter branches increased. The calculated values of the two models were largely similar but differed in some ways. Field measurements of Fagus crenata and Abies homolepis also fit this trend, wherein models deviated from da Vinci's rule with increasing relative weights of lateral daughter branches. However, this deviation was small for a branching pattern in nature, where empirical measurements were taken under realistic measurement conditions; thus, da Vinci's rule did not critically contradict the biomechanical models in the case of real branching patterns, though the model calculations described the contradiction between da Vinci's rule and the biomechanical models. The field data for Fagus crenata fit the uniform stress model best, indicating that stress uniformity is the key constraint of branch morphology in Fagus crenata rather than elastic similarity or da Vinci's rule. On the other hand, mechanical constraints are not necessarily significant in the morphology of Abies homolepis branches, depending on the number of daughter branches. Rather, these branches were often in agreement with da Vinci's rule. PMID:24714065

Tree branching: Leonardo da Vinci's rule versus biomechanical models.

Science.gov (United States)

Minamino, Ryoko; Tateno, Masaki

2014-01-01

This study examined Leonardo da Vinci's rule (i.e., the sum of the cross-sectional area of all tree branches above a branching point at any height is equal to the cross-sectional area of the trunk or the branch immediately below the branching point) using simulations based on two biomechanical models: the uniform stress and elastic similarity models. Model calculations of the daughter/mother ratio (i.e., the ratio of the total cross-sectional area of the daughter branches to the cross-sectional area of the mother branch at the branching point) showed that both biomechanical models agreed with da Vinci's rule when the branching angles of daughter branches and the weights of lateral daughter branches were small; however, the models deviated from da Vinci's rule as the weights and/or the branching angles of lateral daughter branches increased. The calculated values of the two models were largely similar but differed in some ways. Field measurements of Fagus crenata and Abies homolepis also fit this trend, wherein models deviated from da Vinci's rule with increasing relative weights of lateral daughter branches. However, this deviation was small for a branching pattern in nature, where empirical measurements were taken under realistic measurement conditions; thus, da Vinci's rule did not critically contradict the biomechanical models in the case of real branching patterns, though the model calculations described the contradiction between da Vinci's rule and the biomechanical models. The field data for Fagus crenata fit the uniform stress model best, indicating that stress uniformity is the key constraint of branch morphology in Fagus crenata rather than elastic similarity or da Vinci's rule. On the other hand, mechanical constraints are not necessarily significant in the morphology of Abies homolepis branches, depending on the number of daughter branches. Rather, these branches were often in agreement with da Vinci's rule.

Solving discretely-constrained MPEC problems with applications in electric power markets

International Nuclear Information System (INIS)

Gabriel, Steven A.; Leuthold, Florian U.

2010-01-01

Many of the European energy markets are characterized by dominant players that own a large share of their respective countries' generation capacities. In addition to that, there is a significant lack of cross-border transmission capacity. Combining both facts justifies the assumption that these dominant players are able to influence the market outcome of an internal European energy market due to strategic behavior. In this paper, we present a mathematical formulation in order to solve a Stackelberg game for a network-constrained energy market using integer programming. The strategic player is the Stackelberg leader and the independent system operator (including the decisions of the competitive fringe firms) acts as follower. We assume that there is one strategic player which results in a mathematical program with equilibrium constraints (MPEC). This MPEC is reformulated as mixed-integer linear program (MILP) by using disjunctive constraints and linearization. The MILP formulation gives the opportunity to solve the problems reliably and paves the way to add discrete constraints to the original MPEC formulation which can be used in order to solve discretely-constrained mathematical programs with equilibrium constraints (DC-MPECs). We report computational results for a small illustrative network as well as a stylized Western European grid with realistic data. (author)

Solving discretely-constrained MPEC problems with applications in electric power markets

Energy Technology Data Exchange (ETDEWEB)

Gabriel, Steven A. [1143 Glenn L. Martin Hall, Department of Civil and Environmental Engineering, University of Maryland, College Park, MD 20742-3021 (United States); Leuthold, Florian U. [Chair of Energy Economics and Public Sector Management, Dresden University of Technology, 01069 Dresden (Germany)

2010-01-15

Many of the European energy markets are characterized by dominant players that own a large share of their respective countries' generation capacities. In addition to that, there is a significant lack of cross-border transmission capacity. Combining both facts justifies the assumption that these dominant players are able to influence the market outcome of an internal European energy market due to strategic behavior. In this paper, we present a mathematical formulation in order to solve a Stackelberg game for a network-constrained energy market using integer programming. The strategic player is the Stackelberg leader and the independent system operator (including the decisions of the competitive fringe firms) acts as follower. We assume that there is one strategic player which results in a mathematical program with equilibrium constraints (MPEC). This MPEC is reformulated as mixed-integer linear program (MILP) by using disjunctive constraints and linearization. The MILP formulation gives the opportunity to solve the problems reliably and paves the way to add discrete constraints to the original MPEC formulation which can be used in order to solve discretely-constrained mathematical programs with equilibrium constraints (DC-MPECs). We report computational results for a small illustrative network as well as a stylized Western European grid with realistic data. (author)

Cravity modulation of the moss Tortula modica branching

Science.gov (United States)

Khorkavtsiv, Yaroslava; Kit, Nadja

Among various abiotic factors the sensor system of plants constantly perceives light and gravitation impulses and reacts on their action by photo- and gravitropisms. Tropisms play fundamental part in ontogenesis and determination of plant forms. Essentially important question is how light initiating phototropic bending modulates gravitropism. In contrast to flower plants, red light is phototropically active for mosses, and phytochromic system controls initiation of apical growth, branching and photomorphogenesis of mosses. The aim of this investigation was to analyse cell branching of protonemata Tortula modica Zander depending on the direction of light and gravitation vector. The influence of light and gravitation on the form of protonemal turf T. modica, branching and the angle of lateral branches relative to axis of mother cell growth has been investigated. As moss protonemata is not branched in the darkness, light is necessary for branching activation. Minimally low intensity of the red light (0.2 mmol (.) m (-2) ({) .}sec (-1) ) induced branching without visual display of phototropic growth. It has been established that unidirectional action of light and gravitation intensifies branching, and, on the contrary, perpendicularly oriented vectors of factors weaken branches formation. Besides, parallel oriented vectors initiated branching from both cell sides, but oppositely directed vectors initiated branching only from one side. Clinostate rotation the change of the vector gravity and causes uniform cell branching, hence, light and gravitation mutually influence the branching system form of the protonemata cell. It has been shown that the angle of lateral branches in darkness does not depend on the direction of light and gravitation action. After lighting the local growth of the cell wall took place mainly under the angle 90 (o) to the axes of mother cell growth. Then the angle gradually decreased and in 3-4 cell divisions the lateral branch grew under the angle

Additional chain-branching pathways in the low-temperature oxidation of branched alkanes

KAUST Repository

Wang, Zhandong

2015-12-31

Chain-branching reactions represent a general motif in chemistry, encountered in atmospheric chemistry, combustion, polymerization, and photochemistry; the nature and amount of radicals generated by chain-branching are decisive for the reaction progress, its energy signature, and the time towards its completion. In this study, experimental evidence for two new types of chain-branching reactions is presented, based upon detection of highly oxidized multifunctional molecules (HOM) formed during the gas-phase low-temperature oxidation of a branched alkane under conditions relevant to combustion. The oxidation of 2,5-dimethylhexane (DMH) in a jet-stirred reactor (JSR) was studied using synchrotron vacuum ultra-violet photoionization molecular beam mass spectrometry (SVUV-PI-MBMS). Specifically, species with four and five oxygen atoms were probed, having molecular formulas of C8H14O4 (e.g., diketo-hydroperoxide/keto-hydroperoxy cyclic ether) and C8H16O5 (e.g., keto-dihydroperoxide/dihydroperoxy cyclic ether), respectively. The formation of C8H16O5 species involves alternative isomerization of OOQOOH radicals via intramolecular H-atom migration, followed by third O2 addition, intramolecular isomerization, and OH release; C8H14O4 species are proposed to result from subsequent reactions of C8H16O5 species. The mechanistic pathways involving these species are related to those proposed as a source of low-volatility highly oxygenated species in Earth\\'s troposphere. At the higher temperatures relevant to auto-ignition, they can result in a net increase of hydroxyl radical production, so these are additional radical chain-branching pathways for ignition. The results presented herein extend the conceptual basis of reaction mechanisms used to predict the reaction behavior of ignition, and have implications on atmospheric gas-phase chemistry and the oxidative stability of organic substances. © 2015 The Combustion Institute.

Optimization of multi-branch switched diversity systems

KAUST Repository

Nam, Haewoon

2009-10-01

A performance optimization based on the optimal switching threshold(s) for a multi-branch switched diversity system is discussed in this paper. For the conventional multi-branch switched diversity system with a single switching threshold, the optimal switching threshold is a function of both the average channel SNR and the number of diversity branches, where computing the optimal switching threshold is not a simple task when the number of diversity branches is high. The newly proposed multi-branch switched diversity system is based on a sequence of switching thresholds, instead of a single switching threshold, where a different diversity branch uses a different switching threshold for signal comparison. Thanks to the fact that each switching threshold in the sequence can be optimized only based on the number of the remaining diversity branches, the proposed system makes it easy to find these switching thresholds. Furthermore, some selected numerical and simulation results show that the proposed switched diversity system with the sequence of optimal switching thresholds outperforms the conventional system with the single optimal switching threshold. © 2009 IEEE.

THE BUDGET PROGRAM: ECONOMIC CONTENT AND PRACTICE OF IMPLEMENTATION

Directory of Open Access Journals (Sweden)

Iryna Shevchenko

2017-09-01

Full Text Available The aim of the article is to analyse the practice of the economic content of budget programs’ implementation in Ukraine. The definition of the budget program is given. It is noted that, in the Ukrainian legislative area, there is a wide range of programs, namely: programs of economic and social development of Ukraine; Government activity programs; state target programs; local programs for the socio-economic and cultural development. The author reviews in more detail the differences between the budget program and the state target program since it is these types of programs that are most confusing. It is emphasized that there is a certain interconnection between budget and state target programs and a strategic document. Thus, in order to achieve the corresponding goal and fulfil the tasks set out in the paper and aim at solving urgent problems of development, it is necessary to develop concrete ways in the context of branches of the economy. Methodology. The study of the indicators of planned and fully financed state budget programs, planned and spent expenditures for the financing of budget programs for 2011– 2015, as well as the polynomial trend of planned expenditures for the financialization of budget programs for 2011– 2017, is conducted. The interrelation between elements of budget programs and their characteristic features is studied. Indicators of the implementation of budget programs applied in international practice are considered and analysed, namely: Great Britain, Australia, New Zealand, USA. Results. The author systematized the views of scientists on the performance indicators of budget programs. The analysis of the professional literature on this issue allowed generalizing the main classification features, which, according to the author, should be fixed at the legislative level. Practical implication. The author proposed an additional classification mark “Depending on the degree of risk of non-fulfilment of the program�

Modified task-based learning program promotes problem-solving capacity among Chinese medical postgraduates: a mixed quantitative survey.

Science.gov (United States)

Tian, Yanping; Li, Chengren; Wang, Jiali; Cai, Qiyan; Wang, Hanzhi; Chen, Xingshu; Liu, Yunlai; Mei, Feng; Xiao, Lan; Jian, Rui; Li, Hongli

2017-09-07

Despite great advances, China's postgraduate education faces many problems, for example traditional lecture-based learning (LBL) method provides fewer oppotunities to apply knowledge in a working situation. Task-based learning (TBL) is an efficient strategy for increasing the connections among skills, knowledge and competences. This study aimed to evaluate the effect of a modified TBL model on problem-solving abilities among postgraduate medical students in China. We allocated 228 first-year postgraduate students at Third Military Medical University into two groups: the TBL group and LBL group. The TBL group was taught using a TBL program for immunohistochemistry. The curriculum consisted of five phases: task design, self-learning, experimental operations, discussion and summary. The LBL group was taught using traditional LBL. After the course, learning performance was assessed using theoretical and practical tests. The students' preferences and satisfaction of TBL and LBL were also evaluated using questionnaires. There were notable differences in the mean score rates in the practical test (P 80) in the TBL group was higher than that in the LBL group. We observed no substantial differences in the theoretical test between the two groups (P > 0.05). The questionnaire results indicated that the TBL students were satisfied with teaching content, teaching methods and experiment content. The TBL program was also beneficial for the postgraduates in completing their research projects. Furthermore, the TBL students reported positive effects in terms of innovative thinking, collaboration, and communication. TBL is a powerful educational strategy for postgraduate education in China. Our modified TBL imparted basic knowledge to the students and also engaged them more effectively in applying knowledge to solve real-world issues. In conclusion, our TBL established a good foundation for the students' future in both medical research and clinical work.

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. Copyright © 2016 Elsevier Ltd. All rights reserved.

Auxin transport in the evolution of branching forms.

Science.gov (United States)

Harrison, C Jill

2017-07-01

Contents 545 I. 545 II. 546 III. 546 IV. 548 V. 548 VI. 549 VII. 549 Acknowledgements 549 References 549 SUMMARY: Branching is one of the most striking aspects of land plant architecture, affecting resource acquisition and yield. Polar auxin transport by PIN proteins is a primary determinant of flowering plant branching patterns regulating both branch initiation and branch outgrowth. Several lines of experimental evidence suggest that PIN-mediated polar auxin transport is a conserved regulator of branching in vascular plant sporophytes. However, the mechanisms of branching and auxin transport and relationships between the two are not well known outside the flowering plants, and the paradigm for PIN-regulated branching in flowering plants does not fit bryophyte gametophytes. The evidence reviewed here suggests that divergent auxin transport routes contributed to the diversification of branching forms in distinct land plant lineages. © 2016 The Authors. New Phytologist © 2016 New Phytologist Trust.

Branch Width and Height Influence the Incorporation of Branches into Foraging Trails and Travel Speed in Leafcutter Ants Atta cephalotes (L.) (Hymenoptera: Formicidae).

Science.gov (United States)

Freeman, B M; Chaves-Campos, J

2016-06-01

Fallen branches are often incorporated into Atta cephalotes (L.) foraging trails to optimize leaf tissue transport rates and economize trail maintenance. Recent studies in lowlands show laden A. cephalotes travel faster across fallen branches than on ground, but more slowly ascending or descending a branch. The latter is likely because (1) it is difficult to travel up or downhill and (2) bottlenecks occur when branches are narrower than preceding trail. Hence, both branch height and width should determine whether branches decrease net travel times, but no study has evaluated it yet. Laden A. cephalotes were timed in relation to branch width and height across segments preceding, accessing, across, and departing a fallen branch in the highlands of Costa Rica. Ants traveled faster on branches than on cleared segments of trunk-trail, but accelerated when ascending or descending the branch-likely because of the absence of bottlenecks during the day in the highlands. Branch size did not affect ant speed in observed branches; the majority of which (22/24) varied from 11 to 120 mm in both height and width (average 66 mm in both cases). To determine whether ants exclude branches outside this range, ants were offered the choice between branches within this range and branches that were taller/wider than 120 mm. Ants strongly preferred the former. Our results indicate that A. cephalotes can adjust their speed to compensate for the difficulty of traveling on branch slopes. More generally, branch size should be considered when studying ant foraging efficiency.

Progress in research and regulatory development by the Materials Engineering Branch, RES Engineering Division

International Nuclear Information System (INIS)

Serpan, C.Z. Jr.

1988-01-01

Much activity has been underway In NRC this past year on definition of aging Issues for nuclear power plants that will be applicable to the regulatory considerations of applications for license renewals following the Initial 40-year operating period. The Materials Engineering Branch has been reviewing its program to assure that aging Issues are prominent, and to identify regulatory documents that will have to be validated or revised to provide a proper basis for license renewal safety evaluation. A report on the branch plan for aging and needs for extended life review is under preparation and should be available early in 1988

Changes in body composition in heart failure patients after a resistance exercise program and branched chain amino acid supplementation.

Science.gov (United States)

Pineda-Juárez, Juan Antonio; Sánchez-Ortiz, Néstor Alonso; Castillo-Martínez, Lilia; Orea-Tejeda, Arturo; Cervantes-Gaytán, Rocío; Keirns-Davis, Candace; Pérez-Ocampo, Carlos; Quiroz-Bautista, Karla; Tenorio-Dupont, Mónica; Ronquillo-Martínez, Alberto

2016-02-01

Heart Failure (HF) is a complex syndrome, which can include the physiological, neural hormonal and metabolic complications known as "Cardiac Cachexia" (CC). In the development of CC there is a release of catabolic cytokines (Tumor Necrosis Factor-α, interleukins 1 and 6) that cause a decrease of fat free mass and fat mass. These changes in body composition might be reversed with a therapeutic combination of resistance exercise and branched chain amino acid supplementation (BCAA). Evaluate changes in body composition after a resistance exercise program and BCAA supplementation in patients with HF. In a randomized clinical trial with 3 month of follow-up anthropometric body composition analysis and stress tests were evaluated at the beginning and in the end of the study. Patients were divided into two groups; the experimental group performed the resistance exercise program and received 10 g/day BCAA supplementation, and the control group only performed the resistance exercise program. Both groups were provided with individualized diets and conventional medical treatment. Changes were found in hip circumference between the groups (p = 0.02), and muscle strength was increased in the experimental group (8%) and the control group (11.4%) with no difference between them. METS and VO2Max also increased in experimental and control groups (16.6% and 50.1% respectively). Regarding changes in symptoms, improvements in fatigue (45.4%), decubitus intolerance (21.8%) and dyspnea (25.4%) were observed in the overall sample. Improvements in physical and functional capacities are attributed to resistance exercise program but not to the BCAA supplementation. NCT02240511. Copyright © 2015 Elsevier Ltd and European Society for Clinical Nutrition and Metabolism. All rights reserved.

High-precision half-life and branching-ratio measurements for superallowed Fermi β+ emitters at TRIUMF - ISAC

Science.gov (United States)

Laffoley, A. T.; Dunlop, R.; Finlay, P.; Grinyer, G. F.; Andreoiu, C.; Austin, R. A. E.; Ball, G. C.; Bandyopadhyay, D.; Blank, B.; Bouzomita, H.; Chagnon-Lessard, S.; Chester, A.; Cross, D. S.; Demand, G.; Diaz Varela, A.; Djongolov, M.; Ettenauer, S.; Garnsworthy, A. B.; Garrett, P. E.; Giovinazzo, J.; Glister, J.; Green, K. L.; Hackman, G.; Hadinia, B.; Jamieson, D. S.; Ketelhut, S.; Leach, K. G.; Leslie, J. R.; Pearson, C. J.; Phillips, A. A.; Rand, E. T.; Starosta, K.; Sumithrarachchi, C. S.; Svensson, C. E.; Tardiff, E. R.; Thomas, J. C.; Towner, I. S.; Triambak, S.; Unsworth, C.; Williams, S. J.; Wong, J.; Yates, S. W.; Zganjar, E. F.

2014-03-01

A program of high-precision half-life and branching-ratio measurements for superallowed Fermi β emitters is being carried out at TRIUMF's Isotope Separator and Accelerator (ISAC) radioactive ion beam facility. Recent half-life measurements for the superallowed decays of 14O, 18Ne, and 26Alm, as well as branching-ratio measurements for 26Alm and 74Rb are reported. These results provide demanding tests of the Standard Model and the theoretical isospin symmetry breaking (ISB) corrections in superallowed Fermi β decays.

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

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)

Toward Solving the Problem of Problem Solving: An Analysis Framework

Science.gov (United States)

Roesler, Rebecca A.

2016-01-01

Teaching is replete with problem solving. Problem solving as a skill, however, is seldom addressed directly within music teacher education curricula, and research in music education has not examined problem solving systematically. A framework detailing problem-solving component skills would provide a needed foundation. I observed problem solving…

Branched-chain fatty acid biosynthesis in a branched-chain amino acid aminotransferase mutant of Staphylococcus carnosus

DEFF Research Database (Denmark)

Beck, Hans Christian

2005-01-01

Fatty acid biosynthesis by a mutant strain of Staphylococcus carnosus deficient in branched-chain amino acid aminotransferase (IlvE) activity was analysed. This mutant was unable to produce the appropriate branched-chain alpha-ketoacid precursors for branched-chain fatty acid biosynthesis from...... in rich medium and growth in defined medium supplemented with 2-methylpropanoic acid lead to extensive alteration of the fatty acid composition in the cell membrane. In rich medium, a change from 51.7% to 17.1% anteiso-C15:0, and from 3.6% to 33.9% iso-C14:0 fatty acids as compared to the wild-type strain...... for 2-methylpropanoic acid production, revealing that the IlvE protein plays an important, but not essential role in the biosynthesis of branched-chain fatty acids and secondary metabolites in S. carnosus....

A Branch-and-Price approach to find optimal decision trees

NARCIS (Netherlands)

Firat, M.; Crognier, Guillaume; Gabor, Adriana; Zhang, Y.

2018-01-01

In Artificial Intelligence (AI) field, decision trees have gained certain importance due to their effectiveness in solving classification and regression problems. Recently, in the literature we see finding optimal decision trees are formulated as Mixed Integer Linear Programming (MILP) models. This

VENTURE: a code block for solving multigroup neutronics problems applying the finite-difference diffusion-theory approximation to neutron transport, version II. [LMFBR

Energy Technology Data Exchange (ETDEWEB)

Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.

1977-11-01

The report documents the computer code block VENTURE designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P/sub 1/) in up to three-dimensional geometry. It uses and generates interface data files adopted in the cooperative effort sponsored by the Reactor Physics Branch of the Division of Reactor Research and Development of the Energy Research and Development Administration. Several different data handling procedures have been incorporated to provide considerable flexibility; it is possible to solve a wide variety of problems on a variety of computer configurations relatively efficiently.

Wind-Induced Reconfigurations in Flexible Branched Trees

Science.gov (United States)

Ojo, Oluwafemi; Shoele, Kourosh

2017-11-01

Wind induced stresses are the major mechanical cause of failure in trees. We know that the branching mechanism has an important effect on the stress distribution and stability of a tree in the wind. Eloy in PRL 2011, showed that Leonardo da Vinci's original observation which states the total cross section of branches is conserved across branching nodes is the best configuration for resisting wind-induced fracture in rigid trees. However, prediction of the fracture risk and pattern of a tree is also a function of their reconfiguration capabilities and how they mitigate large wind-induced stresses. In this studies through developing an efficient numerical simulation of flexible branched trees, we explore the role of the tree flexibility on the optimal branching. Our results show that the probability of a tree breaking at any point depends on both the cross-section changes in the branching nodes and the level of tree flexibility. It is found that the branching mechanism based on Leonardo da Vinci's original observation leads to a uniform stress distribution over a wide range of flexibilities but the pattern changes for more flexible systems.

The Pen Branch Project: Restoration of a Forested Wetland in South Carolina

Science.gov (United States)

Randall K. Kolka; Eric A. Nelson; Ronald E. Bonar; Neil C. Dulohery; David Gartner

1998-01-01

The Pen Branch Project is a program to restore a forested riparian wetland that has been subject to thermal disturbance caused by nuclear reactor operations at the Department of Energy's (DOE) Savannah River Site (SRS), an 80,200-hectare nuclear facility located in South Carolina. Various levels of thermal discharges to streams located across the US. have occurred...

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

Prebiotic branched galacto-oligosaccharides (gos)

NARCIS (Netherlands)

Lammerts van Bueren-Brandt, Alica; Dijkhuizen, Lubbert

2018-01-01

The invention relates to galacto-oligosaccharide (GOS) compositions and the use thereof. Provided is the use of a GOS composition comprising branched and linear GOS species having a degree of polymerization (DP) of 3, wherein the branched DP3 GOS species are present in excess of linear DP3 GOS

Solving Component Structural Dynamic Failures Due to Extremely High Frequency Structural Response on the Space Shuttle Program

Science.gov (United States)

Frady, Greg; Nesman, Thomas; Zoladz, Thomas; Szabo, Roland

2010-01-01

For many years, the capabilities to determine the root-cause failure of component failures have been limited to the analytical tools and the state of the art data acquisition systems. With this limited capability, many anomalies have been resolved by adding material to the design to increase robustness without the ability to determine if the design solution was satisfactory until after a series of expensive test programs were complete. The risk of failure and multiple design, test, and redesign cycles were high. During the Space Shuttle Program, many crack investigations in high energy density turbomachines, like the SSME turbopumps and high energy flows in the main propulsion system, have led to the discovery of numerous root-cause failures and anomalies due to the coexistences of acoustic forcing functions, structural natural modes, and a high energy excitation, such as an edge tone or shedding flow, leading the technical community to understand many of the primary contributors to extremely high frequency high cycle fatique fluid-structure interaction anomalies. These contributors have been identified using advanced analysis tools and verified using component and system tests during component ground tests, systems tests, and flight. The structural dynamics and fluid dynamics communities have developed a special sensitivity to the fluid-structure interaction problems and have been able to adjust and solve these problems in a time effective manner to meet budget and schedule deadlines of operational vehicle programs, such as the Space Shuttle Program over the years.

Local Strategy Improvement for Parity Game Solving

Directory of Open Access Journals (Sweden)

Oliver Friedmann

2010-06-01

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

Generalized Fluid System Simulation Program, Version 6.0

Science.gov (United States)

Majumdar, A. K.; LeClair, A. C.; Moore, R.; Schallhorn, P. A.

2016-01-01

The Generalized Fluid System Simulation Program (GFSSP) is a general purpose computer program for analyzing steady state and time-dependent flow rates, pressures, temperatures, and concentrations in a complex flow network. The program is capable of modeling real fluids with phase changes, compressibility, mixture thermodynamics, conjugate heat transfer between solid and fluid, fluid transients, pumps, compressors, and external body forces such as gravity and centrifugal. The thermofluid system to be analyzed is discretized into nodes, branches, and conductors. The scalar properties such as pressure, temperature, and concentrations are calculated at nodes. Mass flow rates and heat transfer rates are computed in branches and conductors. The graphical user interface allows users to build their models using the 'point, drag, and click' method; the users can also run their models and post-process the results in the same environment. Two thermodynamic property programs (GASP/WASP and GASPAK) provide required thermodynamic and thermophysical properties for 36 fluids: helium, methane, neon, nitrogen, carbon monoxide, oxygen, argon, carbon dioxide, fluorine, hydrogen, parahydrogen, water, kerosene (RP-1), isobutene, butane, deuterium, ethane, ethylene, hydrogen sulfide, krypton, propane, xenon, R-11, R-12, R-22, R-32, R-123, R-124, R-125, R-134A, R-152A, nitrogen trifluoride, ammonia, hydrogen peroxide, and air. The program also provides the options of using any incompressible fluid with constant density and viscosity or ideal gas. The users can also supply property tables for fluids that are not in the library. Twenty-four different resistance/source options are provided for modeling momentum sources or sinks in the branches. These options include pipe flow, flow through a restriction, noncircular duct, pipe flow with entrance and/or exit losses, thin sharp orifice, thick orifice, square edge reduction, square edge expansion, rotating annular duct, rotating radial duct

Branching trajectory continual integral

International Nuclear Information System (INIS)

Maslov, V.P.; Chebotarev, A.M.

1980-01-01

Heuristic definition of the Feynman continual integral over branching trajectories is suggested which makes it possible to obtain in the closed form the solution of the Cauchy problem for the model Hartree equation. A number of properties of the solution is derived from an integral representation. In particular, the quasiclassical asymptotics, exact solution in the gaussian case and perturbation theory series are described. The existence theorem for the simpliest continual integral over branching trajectories is proved [ru

Human vagus nerve branching in the cervical region.

Directory of Open Access Journals (Sweden)

Niels Hammer

Full Text Available Vagus nerve stimulation is increasingly applied to treat epilepsy, psychiatric conditions and potentially chronic heart failure. After implanting vagus nerve electrodes to the cervical vagus nerve, side effects such as voice alterations and dyspnea or missing therapeutic effects are observed at different frequencies. Cervical vagus nerve branching might partly be responsible for these effects. However, vagus nerve branching has not yet been described in the context of vagus nerve stimulation.Branching of the cervical vagus nerve was investigated macroscopically in 35 body donors (66 cervical sides in the carotid sheath. After X-ray imaging for determining the vertebral levels of cervical vagus nerve branching, samples were removed to confirm histologically the nerve and to calculate cervical vagus nerve diameters and cross-sections.Cervical vagus nerve branching was observed in 29% of all cases (26% unilaterally, 3% bilaterally and proven histologically in all cases. Right-sided branching (22% was more common than left-sided branching (12% and occurred on the level of the fourth and fifth vertebra on the left and on the level of the second to fifth vertebra on the right side. Vagus nerves without branching were significantly larger than vagus nerves with branches, concerning their diameters (4.79 mm vs. 3.78 mm and cross-sections (7.24 mm2 vs. 5.28 mm2.Cervical vagus nerve branching is considerably more frequent than described previously. The side-dependent differences of vagus nerve branching may be linked to the asymmetric effects of the vagus nerve. Cervical vagus nerve branching should be taken into account when identifying main trunk of the vagus nerve for implanting electrodes to minimize potential side effects or lacking therapeutic benefits of vagus nerve stimulation.

Branch-Based Centralized Data Collection for Smart Grids Using Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Kwangsoo Kim

2015-05-01

Full Text Available A smart grid is one of the most important applications in smart cities. In a smart grid, a smart meter acts as a sensor node in a sensor network, and a central device collects power usage from every smart meter. This paper focuses on a centralized data collection problem of how to collect every power usage from every meter without collisions in an environment in which the time synchronization among smart meters is not guaranteed. To solve the problem, we divide a tree that a sensor network constructs into several branches. A conflict-free query schedule is generated based on the branches. Each power usage is collected according to the schedule. The proposed method has important features: shortening query processing time and avoiding collisions between a query and query responses. We evaluate this method using the ns-2 simulator. The experimental results show that this method can achieve both collision avoidance and fast query processing at the same time. The success rate of data collection at a sink node executing this method is 100%. Its running time is about 35 percent faster than that of the round-robin method, and its memory size is reduced to about 10% of that of the depth-first search method.

Branch-based centralized data collection for smart grids using wireless sensor networks.

Science.gov (United States)

Kim, Kwangsoo; Jin, Seong-il

2015-05-21

A smart grid is one of the most important applications in smart cities. In a smart grid, a smart meter acts as a sensor node in a sensor network, and a central device collects power usage from every smart meter. This paper focuses on a centralized data collection problem of how to collect every power usage from every meter without collisions in an environment in which the time synchronization among smart meters is not guaranteed. To solve the problem, we divide a tree that a sensor network constructs into several branches. A conflict-free query schedule is generated based on the branches. Each power usage is collected according to the schedule. The proposed method has important features: shortening query processing time and avoiding collisions between a query and query responses. We evaluate this method using the ns-2 simulator. The experimental results show that this method can achieve both collision avoidance and fast query processing at the same time. The success rate of data collection at a sink node executing this method is 100%. Its running time is about 35 percent faster than that of the round-robin method, and its memory size is reduced to about 10% of that of the depth-first search method.

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

In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks....... Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an IP-model for the problem, which is decomposed using Dantzig-Wolfe decomposition....... 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...

The USSR long-term energy program in action

International Nuclear Information System (INIS)

Troitskij, A.A.; Shamrayev, N.G.; Makarov, A.A.; Volfberg, D.B.; Pravednikov, N.K.

1989-09-01

Five years have passed since the adoption of the USSR Energy Program developed up to the end of the 20th century. The present report covers main results of this Program. Fuel production and extraction has grown up, substantial increases have been achieved in electricity production, improvements have been made in the energy balance structure and energy efficiency of public production. The arrears in oil and coal production which became apparent in the early 80s were caught up, and losses of associated petroleum gases were lowered. The actual production of natural gas has turned out to be higher as compared with the level stipulated in the Program. The Chernobyl accident has contributed to a certain limitation in the scale of growth of nuclear electricity production. Nevertheless, the nuclear power industry remains to be the most dynamically developing branch in electricity production. Of paramount importance in the USSR Energy Program is the role played by the progress of science and technology - the major means of raising efficiency of the fuel-and-energy complex and achieving the targets in the field of energy conservation. It is also planned to show the role of the USSR Energy Program in solving energy problems in CMEA member countries, in developing mutually beneficial international cooperation in the field of energy. 2 tabs

Solving nonlinear nonstationary problem of heat-conductivity by finite element method

Directory of Open Access Journals (Sweden)

Антон Янович Карвацький

2016-11-01

Full Text Available Methodology and effective solving algorithm of non-linear dynamic problems of thermal and electric conductivity with significant temperature dependence of thermal and physical properties are given on the basis of finite element method (FEM and Newton linearization method. Discrete equations system FEM was obtained with the use of Galerkin method, where the main function is the finite element form function. The methodology based on successive solving problems of thermal and electrical conductivity has been examined in the work in order to minimize the requirements for calculating resources (RAM. in particular. Having used Mathcad software original programming code was developed to solve the given problem. After investigation of the received results, comparative analyses of accurate solution data and results of numerical solutions, obtained with the use of Matlab programming products, was held. The geometry of one fourth part of the finite sized cylinder was used to test the given numerical model. The discretization of the calculation part was fulfilled using the open programming software for automated Gmsh nets with tetrahedral units, while ParaView, which is an open programming code as well, was used to visualize the calculation results. It was found out that the maximum value violation of potential and temperature determination doesn`t exceed 0,2-0,83% in the given work according to the problem conditions

Quantification of branching in model three-arm star polyethylene

KAUST Repository

Ramachandran, Ramnath; Beaucage, Gregory B.; Rai, Durgesh K.; Lohse, David J.; Sun, Thomas; Tsou, Andy; Norman, Alexander Iain; Hadjichristidis, Nikolaos

2012-01-01

The versatility of a novel scaling approach in quantifying the structure of model well-defined 3-arm star polyethylene molecules is presented. Many commercial polyethylenes have long side branches, and the nature and quantity of these branches varies widely among the various forms. For instance, low-density polyethylene (LDPE) is typically a highly branched structure with broad distributions in branch content, branch lengths and branch generation (in hyperbranched structures). This makes it difficult to accurately quantify the structure and the inherent structure-property relationships. To overcome this drawback, model well-defined hydrogenated polybutadiene (HPB) structures have been synthesized via anionic polymerization and hydrogenation to serve as model analogues to long-chain branched polyethylene. In this article, model 3-arm star polyethylene molecules are quantified using the scaling approach. Along with the long-chain branch content in polyethylene, the approach also provides unique measurements of long-chain branch length and hyperbranch content. Such detailed description facilitates better understanding of the effect of branching on the physical properties of polyethylene. © 2012 American Chemical Society.

Quantification of branching in model three-arm star polyethylene

KAUST Repository

Ramachandran, Ramnath

2012-01-24

The versatility of a novel scaling approach in quantifying the structure of model well-defined 3-arm star polyethylene molecules is presented. Many commercial polyethylenes have long side branches, and the nature and quantity of these branches varies widely among the various forms. For instance, low-density polyethylene (LDPE) is typically a highly branched structure with broad distributions in branch content, branch lengths and branch generation (in hyperbranched structures). This makes it difficult to accurately quantify the structure and the inherent structure-property relationships. To overcome this drawback, model well-defined hydrogenated polybutadiene (HPB) structures have been synthesized via anionic polymerization and hydrogenation to serve as model analogues to long-chain branched polyethylene. In this article, model 3-arm star polyethylene molecules are quantified using the scaling approach. Along with the long-chain branch content in polyethylene, the approach also provides unique measurements of long-chain branch length and hyperbranch content. Such detailed description facilitates better understanding of the effect of branching on the physical properties of polyethylene. © 2012 American Chemical Society.

Geology of the Cane Branch and Helton Branch watershed areas, McCreary County, Kentucky

Science.gov (United States)

Lyons, Erwin J.

1957-01-01

Cane Branch and Helton Branch in McCreary County, Kentucky, are about 1.4 miles apart (fig. 1). Can Branch, which is about 2.1 miles long, emptied into Hughes Fork of Beaver Creek. Its watershed area of about 1.5 square miles lies largely in the Wiborf 7 1/2-minute quadrangle (SW/4 Cumberland Falls 15-minute quadrangle), but the downstream part of the area extends northward into the Hail 7 1/2-minute quadrangle (NW/4 Cumberland Falls 15-minute quadrangle). Helton Branch, which is about 1.1 miles long, has two tributaries and empties into Little Hurricane Fork of Beaver Creek. It drains an area of about 0.8 square mile of while about 0.5 square mile is in the Hail quadrangle and the remainder in the Wilborg quadrangle. The total relief in the Can Branch area is about 500 feet and in the Helton Branch area about 400 feet. Narrow, steep-sided to canyon-like valley and winding ridges, typical of the Pottsville escarpment region, are characteristic of both areas. Thick woods and dense undergrowth cover much of the two areas. Field mapping was done on U.S. Geological Survey 7 1/2-minute maps having a scale of 1:24,000 and a contour interval of 20 feet. Elevations of lithologic contacts were determined with a barometer and a hand level. Aerial photographs were used principally to trace the cliffs formed by sandstone and conglomerate ledges. Exposures, except for those of the cliff- and ledge-forming sandstone and conglomerates, are not abundant. The most complete stratigraphic sections (secs. 3 and 4, fig. 2) in the two areas are exposed in cuts of newly completed Forest Service roads, but the rick in the upper parts of the exposures is weathered. To supplement these sections, additional sections were measured in cuts along the railroad and main highways in nor near the watersheds.

Web-Based Problem-Solving Assignment and Grading System

Science.gov (United States)

Brereton, Giles; Rosenberg, Ronald

2014-11-01

In engineering courses with very specific learning objectives, such as fluid mechanics and thermodynamics, it is conventional to reinforce concepts and principles with problem-solving assignments and to measure success in problem solving as an indicator of student achievement. While the modern-day ease of copying and searching for online solutions can undermine the value of traditional assignments, web-based technologies also provide opportunities to generate individualized well-posed problems with an infinite number of different combinations of initial/final/boundary conditions, so that the probability of any two students being assigned identical problems in a course is vanishingly small. Such problems can be designed and programmed to be: single or multiple-step, self-grading, allow students single or multiple attempts; provide feedback when incorrect; selectable according to difficulty; incorporated within gaming packages; etc. In this talk, we discuss the use of a homework/exam generating program of this kind in a single-semester course, within a web-based client-server system that ensures secure operation.

Self-Assessment of Problem Solving Disposition in Medical Students

Directory of Open Access Journals (Sweden)

Silvia Lizett Olivares-Olivares

2014-01-01

Full Text Available Medical schools are committed to both students and society to develop capabilities required to succeed in health care environments. Present diagnosis and treatment methods become obsolete faster, demanding that medical schools incorporate competency-based education to keep pace with future demands. This study was conducted to assess the problem solving disposition of medical students. A three-subcategory model of the skill is proposed. The instrument was validated on content by a group of 17 experts in medical education and applied to 135 registered students on the sixth year of the M.D. Physician Surgeon program at a private medical school. Cronbach’s alpha indicated an internal consistency of 0.751. The findings suggest that selected items have both homogeneity and validity. The factor analysis resulted in components that were associated with three problem-solving subcategories. The students’ perceptions are higher in the pattern recognition and application of general strategies for problem solving subcategories of the Problem solving disposition model.

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

[The application of new technologies to solving maths problems for students with learning disabilities: the 'underwater school'].

Science.gov (United States)

Miranda-Casas, A; Marco-Taverner, R; Soriano-Ferrer, M; Melià de Alba, A; Simó-Casañ, P

2008-01-01

Different procedures have demonstrated efficacy to teach cognitive and metacognitive strategies to problem solving in mathematics. Some studies have used computer-based problem solving instructional programs. To analyze in students with learning disabilities the efficacy of a cognitive strategies training for problem solving, with three instructional delivery formats: a teacher-directed program (T-D), a computer-assisted instructional (CAI) program, and a combined program (T-D + CAI). Forty-four children with mathematics learning disabilities, between 8 and 10 years old participated in this study. The children were randomly assigned to one of the three instructional formats and a control group without cognitive strategies training. In the three instructional conditions which were compared all the students learnt problems solving linguistic and visual cognitive strategies trough the self-instructional procedure. Several types of measurements were used for analysing the possible differential efficacy of the three instructional methods implemented: solving problems tests, marks in mathematics, internal achievement responsibility scale, and school behaviours teacher ratings. Our findings show that the T-D training group and the T-D + CAI group improved significantly on math word problem solving and on marks in Maths from pre- to post-testing. In addition, the results indicated that the students of the T-D + CAI group solved more real-life problems and developed more internal attributions compared to both control and CAI groups. Finally, with regard to school behaviours, improvements in school adjustment and learning problems were observed in the students of the group with a combined instructional format (T-D + CAI).

Optimal installation program for reprocessing plants

International Nuclear Information System (INIS)

Kubokawa, Toshihiko; Kiyose, Ryohei

1976-01-01

Optimization of the program of installation of reprocessing plants is mathematically formulated as problem of mixed integer programming, which is numerically solved by the branch-and-bound method. A new concept of quasi-penalty is used to obviate the difficulties associated with dual degeneracy. The finiteness of the useful life of the plant is also taken into consideration. It is shown that an analogous formulation is possible for the cases in which the demand forecasts and expected plant lives cannot be predicted with certainty. The scale of the problem is found to have kN binary variables, (k+2)N continuous variables, and (k+3)N constraint conditions, where k is the number of intervals used in the piece-wise linear approximation of a nonlinear objective function, and N the overall duration of the period covered by the installation program. Calculations are made for N=24 yr and k=3, with the assumption that the plant life is 15 yr, the plant scale factor 0.5, and the maximum plant capacity 900 (t/yr). The results are calculated and discussed for four different demand forecasts. The difference of net profit between optimal and non-optimal installation programs is found to be in the range of 50 -- 100 M$. The pay-off matrix is calculated, and the optimal choice of action when the demand cannot be forecast with certainty is determined by applying Bayes' theory. The optimal installation program under such conditions of uncertainty is obtained also with a stochastic mixed integer programming model. (auth.)

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

Methodological innovations in public health education: transdisciplinary problem solving.

Science.gov (United States)

Lawlor, Edward F; Kreuter, Matthew W; Sebert-Kuhlmann, Anne K; McBride, Timothy D

2015-03-01

In 2008, the faculty of the Brown School at Washington University in St. Louis designed a Master of Public Health program centered on transdisciplinary problem solving in public health. We have described the rationale for our approach, guiding principles and pedagogy for the program, and specific transdisciplinary competencies students acquire. We have explained how transdisciplinary content has been organized and delivered, how the program is being evaluated, and how we have demonstrated the feasibility of this approach for a Master of Public Health degree.

The Impact of Parental Attitudes on Problem Solving Skills in High School Students

Science.gov (United States)

Tösten, Rasim; Han, Bünyamin; Anik, Sabri

2017-01-01

Problem solving skill is one of the important skills which are expected to be gained during the educational programs. In the development of children's skills and shaping the behaviors, parental attitudes are believed to be effective. That means problem-solving skills and behavioral characteristics of individuals are closely related. From that…

Multidisciplinary Optimization Branch Experience Using iSIGHT Software

Science.gov (United States)

Padula, S. L.; Korte, J. J.; Dunn, H. J.; Salas, A. O.

1999-01-01

The Multidisciplinary Optimization (MDO) Branch at NASA Langley is investigating frameworks for supporting multidisciplinary analysis and optimization research. A framework provides software and system services to integrate computational tasks and allows the researcher to concentrate more on the application and less on the programming details. A framework also provides a common working environment and a full range of optimization tools, and so increases the productivity of multidisciplinary research teams. Finally, a framework enables staff members to develop applications for use by disciplinary experts in other organizations. This year, the MDO Branch has gained experience with the iSIGHT framework. This paper describes experiences with four aerospace applications, including: (1) reusable launch vehicle sizing, (2) aerospike nozzle design, (3) low-noise rotorcraft trajectories, and (4) acoustic liner design. Brief overviews of each problem are provided, including the number and type of disciplinary codes and computation time estimates. In addition, the optimization methods, objective functions, design variables, and constraints are described for each problem. For each case, discussions on the advantages and disadvantages of using the iSIGHT framework are provided as well as notes on the ease of use of various advanced features and suggestions for areas of improvement.

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

Science.gov (United States)

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

1993-10-01

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

Using Computer Symbolic Algebra to Solve Differential Equations.

Science.gov (United States)

Mathews, John H.

1989-01-01

This article illustrates that mathematical theory can be incorporated into the process to solve differential equations by a computer algebra system, muMATH. After an introduction to functions of muMATH, several short programs for enhancing the capabilities of the system are discussed. Listed are six references. (YP)

New approach to solve symmetric fully fuzzy linear systems

Indian Academy of Sciences (India)

concepts of fuzzy set theory and then define a fully fuzzy linear system of equations. .... To represent the above problem as fully fuzzy linear system, we represent x .... Fully fuzzy linear systems can be solved by Linear programming approach, ...

Problem-Solving Management Training Effects on Sales Productivity and Job Satisfaction.

Science.gov (United States)

Ross, Paul C.; And Others

Research suggests that effective organizational change must be led by line personnel rather than by outside consultants. The Performance Management Program (PMP) implemented in two Bell Telephone companies is a line-led, self-help program in which managers participate in problem-solving activities within their own jobs. Marketing and sales…

Coulomb branches with complex singularities

Science.gov (United States)

Argyres, Philip C.; Martone, Mario

2018-06-01

We construct 4d superconformal field theories (SCFTs) whose Coulomb branches have singular complex structures. This implies, in particular, that their Coulomb branch coordinate rings are not freely generated. Our construction also gives examples of distinct SCFTs which have identical moduli space (Coulomb, Higgs, and mixed branch) geometries. These SCFTs thus provide an interesting arena in which to test the relationship between moduli space geometries and conformal field theory data. We construct these SCFTs by gauging certain discrete global symmetries of N = 4 superYang-Mills (sYM) theories. In the simplest cases, these discrete symmetries are outer automorphisms of the sYM gauge group, and so these theories have lagrangian descriptions as N = 4 sYM theories with disconnected gauge groups.

Solving the Unknown with Algebra: Poster/Teaching Guide for Pre-Algebra Students. Expect the Unexpected with Math[R

Science.gov (United States)

Actuarial Foundation, 2013

2013-01-01

"Solving the Unknown with Algebra" is a new math program aligned with the National Council of Teachers of Mathematics (NCTM) standards and designed to help students practice pre-algebra skills including using formulas, solving for unknowns, and manipulating equations. Developed by The Actuarial Foundation with Scholastic, this program provides…

New Approaches for Very Large-Scale Integer Programming

Science.gov (United States)

2016-06-24

DISTRIBUTION/ AVAILABILITY STATEMENT Approved for Public Release 13. SUPPLEMENTARY NOTES 14. ABSTRACT The focus of this project is new computational... heuristics for integer programs in order to rapidly improve dual bounds. 2. Choosing good branching variables in branch-and-bound algorithms for MIP. 3...programming, algorithms, parallel processing, machine learning, heuristics 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT UU 18. NUMBER OF

Conformations and solution properties of star-branched polyelectrolytes

NARCIS (Netherlands)

Borisov, O.V.; Zhulina, E.B.; Leermakers, F.A.M.; Ballauff, M.; Muller, A.H.E.

2011-01-01

Aqueous solutions of star-like polyelectrolytes (PEs) exhibit distinctive features that originate from the topological complexity of branched macromolecules. In a salt-free solution of branched PEs, mobile counterions preferentially localize in the intramolecular volume of branched macroions.

Reactive Programming in Java

CERN Document Server

CERN. Geneva

2017-01-01

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

Vere-Jones' self-similar branching model

International Nuclear Information System (INIS)

Saichev, A.; Sornette, D.

2005-01-01

Motivated by its potential application to earthquake statistics as well as for its intrinsic interest in the theory of branching processes, we study the exactly self-similar branching process introduced recently by Vere-Jones. This model extends the ETAS class of conditional self-excited branching point-processes of triggered seismicity by removing the problematic need for a minimum (as well as maximum) earthquake size. To make the theory convergent without the need for the usual ultraviolet and infrared cutoffs, the distribution of magnitudes m ' of daughters of first-generation of a mother of magnitude m has two branches m ' ' >m with exponent β+d, where β and d are two positive parameters. We investigate the condition and nature of the subcritical, critical, and supercritical regime in this and in an extended version interpolating smoothly between several models. We predict that the distribution of magnitudes of events triggered by a mother of magnitude m over all generations has also two branches m ' ' >m with exponent β+h, with h=d√(1-s), where s is the fraction of triggered events. This corresponds to a renormalization of the exponent d into h by the hierarchy of successive generations of triggered events. For a significant part of the parameter space, the distribution of magnitudes over a full catalog summed over an average steady flow of spontaneous sources (immigrants) reproduces the distribution of the spontaneous sources with a single branch and is blind to the exponents β,d of the distribution of triggered events. Since the distribution of earthquake magnitudes is usually obtained with catalogs including many sequences, we conclude that the two branches of the distribution of aftershocks are not directly observable and the model is compatible with real seismic catalogs. In summary, the exactly self-similar Vere-Jones model provides an attractive new approach to model triggered seismicity, which alleviates delicate questions on the role of

Using Problem Solving to Teach a Programming Language.

Science.gov (United States)

Milbrandt, George

1995-01-01

Computer studies courses should incorporate as many computer concepts and programming language experiences as possible. A gradual increase in problem difficulty will help the student to understand various computer concepts, and the programming language's syntax and structure. A sidebar provides two examples of how to establish a learning…

Cux1 and Cux2 regulate dendritic branching, spine morphology and synapses of the upper layer neurons of the cortex

Science.gov (United States)

Cubelos, Beatriz; Sebastián-Serrano, Alvaro; Beccari, Leonardo; Calcagnotto, Maria Elisa; Cisneros, Elsa; Kim, Seonhee; Dopazo, Ana; Alvarez-Dolado, Manuel; Redondo, Juan Miguel; Bovolenta, Paola; Walsh, Christopher A.; Nieto, Marta

2010-01-01

Summary Dendrite branching and spine formation determines the function of morphologically distinct and specialized neuronal subclasses. However, little is known about the programs instructing specific branching patterns in vertebrate neurons and whether such programs influence dendritic spines and synapses. Using knockout and knockdown studies combined with morphological, molecular and electrophysiological analysis we show that the homeobox Cux1 and Cux2 are intrinsic and complementary regulators of dendrite branching, spine development and synapse formation in layer II–III neurons of the cerebral cortex. Cux genes control the number and maturation of dendritic spines partly through direct regulation of the expression of Xlr3b and Xlr4b, chromatin remodeling genes previously implicated in cognitive defects. Accordingly, abnormal dendrites and synapses in Cux2−/− mice correlate with reduced synaptic function and defects in working memory. These demonstrate critical roles of Cux in dendritogenesis and highlight novel subclass-specific mechanisms of synapse regulation that contribute to the establishment of cognitive circuits. PMID:20510857

Collinear and TMD quark and gluon densities from parton branching solution of QCD evolution equations

Energy Technology Data Exchange (ETDEWEB)

Hautmann, F. [Rutherford Appleton Laboratory, Chilton (United Kingdom); Oxford Univ. (United Kingdom). Dept. of Theoretical Physics; Antwerpen Univ. (Belgium). Elementaire Deeltjes Fysica; Jung, H.; Lelek, A.; Zlebcik, R. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Radescu, V. [European Organization for Nuclear Research (CERN), Geneva (Switzerland)

2017-08-15

We study parton-branching solutions of QCD evolution equations and present a method to construct both collinear and transverse momentum dependent (TMD) parton densities from this approach. We work with next-to-leading-order (NLO) accuracy in the strong coupling. Using the unitarity picture in terms of resolvable and non-resolvable branchings, we analyze the role of the soft-gluon resolution scale in the evolution equations. For longitudinal momentum distributions, we find agreement of our numerical calculations with existing evolution programs at the level of better than 1 percent over a range of five orders of magnitude both in evolution scale and in longitudinal momentum fraction. We make predictions for the evolution of transverse momentum distributions. We perform fits to the high-precision deep inelastic scattering (DIS) structure function measurements, and we present a set of NLO TMD distributions based on the parton branching approach.

Branching bisimulation congruence for probabilistic systems

NARCIS (Netherlands)

Trcka, N.; Georgievska, S.; Aldini, A.; Baier, C.

2008-01-01

The notion of branching bisimulation for the alternating model of probabilistic systems is not a congruence with respect to parallel composition. In this paper we first define another branching bisimulation in the more general model allowing consecutive probabilistic transitions, and we prove that

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

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.

The Euler’s Graphical User Interface Spreadsheet Calculator for Solving Ordinary Differential Equations by Visual Basic for Application Programming

Science.gov (United States)

Gaik Tay, Kim; Cheong, Tau Han; Foong Lee, Ming; Kek, Sie Long; Abdul-Kahar, Rosmila

2017-08-01

In the previous work on Euler’s spreadsheet calculator for solving an ordinary differential equation, the Visual Basic for Application (VBA) programming was used, however, a graphical user interface was not developed to capture users input. This weakness may make users confuse on the input and output since those input and output are displayed in the same worksheet. Besides, the existing Euler’s spreadsheet calculator is not interactive as there is no prompt message if there is a mistake in inputting the parameters. On top of that, there are no users’ instructions to guide users to input the derivative function. Hence, in this paper, we improved previous limitations by developing a user-friendly and interactive graphical user interface. This improvement is aimed to capture users’ input with users’ instructions and interactive prompt error messages by using VBA programming. This Euler’s graphical user interface spreadsheet calculator is not acted as a black box as users can click on any cells in the worksheet to see the formula used to implement the numerical scheme. In this way, it could enhance self-learning and life-long learning in implementing the numerical scheme in a spreadsheet and later in any programming language.

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

Social support, problem solving, and the longitudinal course of newlywed marriage.

Science.gov (United States)

Sullivan, Kieran T; Pasch, Lauri A; Johnson, Matthew D; Bradbury, Thomas N

2010-04-01

Married couples (N = 172) were observed as newlyweds and observed again 1 year later while engaging in 2 problem-solving and 2 personal support discussions. Microanalytic coding of these conversations was used to examine associations between problem-solving and social support behaviors for 1 year and their relative contributions to 10-year trajectories of self-reported relationship satisfaction and dissolution. Results demonstrated that initially lower levels of positive support behaviors and higher levels of negative support behaviors predicted 1-year increases in negative emotion displayed during problem-solving conversations. Emotions coded from the initial problem-solving conversations did not predict 1-year changes in social support behaviors. Controlling for emotions displayed during problem-solving interactions eliminated or reduced associations between initial social support behaviors and (a) later levels of satisfaction and (b) relationship dissolution. These findings corroborate models that prioritize empathy, validation, and caring as key elements in the development of intimacy (e.g., Reis & Shaver, 1988) and suggest that deficits in these domains foreshadow deterioration in problem solving and conflict management. Implications for integrating support and problem solving in models of relationship change are outlined, as are implications for incorporating social support in education programs for developing relationships.

Temperament and problem solving in a population of adolescent guide dogs.

Science.gov (United States)

Bray, Emily E; Sammel, Mary D; Seyfarth, Robert M; Serpell, James A; Cheney, Dorothy L

2017-09-01

It is often assumed that measures of temperament within individuals are more correlated to one another than to measures of problem solving. However, the exact relationship between temperament and problem-solving tasks remains unclear because large-scale studies have typically focused on each independently. To explore this relationship, we tested 119 prospective adolescent guide dogs on a battery of 11 temperament and problem-solving tasks. We then summarized the data using both confirmatory factor analysis and exploratory principal components analysis. Results of confirmatory analysis revealed that a priori separation of tests as measuring either temperament or problem solving led to weak results, poor model fit, some construct validity, and no predictive validity. In contrast, results of exploratory analysis were best summarized by principal components that mixed temperament and problem-solving traits. These components had both construct and predictive validity (i.e., association with success in the guide dog training program). We conclude that there is complex interplay between tasks of "temperament" and "problem solving" and that the study of both together will be more informative than approaches that consider either in isolation.

Randomized Controlled Trial of Problem-Solving Therapy for Minor Depression in Home Care

Science.gov (United States)

Gellis, Zvi D.; McGinty, Jean; Tierney, Lynda; Jordan, Cindy; Burton, Jean; Misener, Elizabeth

2008-01-01

Objective: Data are presented from a pilot research program initiated to develop, refine, and test the outcomes of problem-solving therapy that targets the needs of older adults with minor depression in home care settings. Method: A pilot randomized clinical trial compares the impact of problem-solving therapy for home care to treatment as usual…

Spontaneous Age-Related Neurite Branching in C. elegans

Science.gov (United States)

Tank, Elizabeth M. H.; Rodgers, Kasey E.; Kenyon, Cynthia

2011-01-01

The analysis of morphological changes that occur in the nervous system during normal aging could provide insight into cognitive decline and neurodegenerative disease. Previous studies have suggested that the nervous system of C. elegans maintains its structural integrity with age despite the deterioration of surrounding tissues. Unexpectedly, we observed that neurons in aging animals frequently displayed ectopic branches, and that the prevalence of these branches increased with time. Within age-matched populations, the branching of mechnosensory neurons correlated with decreased response to light touch and decreased mobility. The incidence of branching was influenced by two pathways that can affect the rate of aging, the Jun kinase pathway and the insulin/IGF-1 pathway. Loss of Jun kinase signaling, which slightly shortens lifespan, dramatically increased and accelerated the frequency of neurite branching. Conversely, inhibition of the daf-2 insulin/IGF-1-like signaling pathway, which extends lifespan, delayed and suppressed branching, and this delay required DAF-16/FOXO activity. Both JNK-1 and DAF-16 appeared to act within neurons in a cell-autonomous manner to influence branching, and, through their tissue-specific expression, it was possible to disconnect the rate at which branching occurred from the overall rate of aging of the animal. Old age has generally been associated with the decline and deterioration of different tissues, except in the case of tumor cell growth. To our knowledge, this is the first indication that aging can potentiate another form of growth, the growth of neurite branches, in normal animals. PMID:21697377

Activities of the Development Branch. 1978-1981

International Nuclear Information System (INIS)

Candame de Gallo, Rita; Marrapodi, M.R.E.; Baez, L.B.

1982-01-01

The activities carried out by the Development Branch from 1978 through 1981 are summarized. Subjects covered include: Metallurgy, Nuclear Fuels, Instrumentation and Control, Nuclear Reactors, as well as the various projects developed during this period and the administrative and technical activities of various groups belonging to this Branch. A list of publications by personnel of this Branch during the same period is also included. (C.A.K.) [es

Field electron emission from branched nanotubes film

International Nuclear Information System (INIS)

Zeng Baoqing; Tian Shikai; Yang Zhonghai

2005-01-01

We describe the preparation and analyses of films composed of branched carbon nanotubes (CNTs). The CNTs were grown on a Ni catalyst film using chemical vapor deposition from a gas containing acetylene. From scanning electron microscope (SEM) and transmission electron microscope (TEM) analyses, the branched structure of the CNTs was determined; the field emission characteristics in a vacuum chamber indicated a lower turn on field for branched CNTs than normal CNTs

Connecting Problem-Solving Style to Peer Evaluations of Performance in Secondary Cooperative Learning Projects

Science.gov (United States)

Bush, Sarah A.; Friedel, Curtis R.; Hoerbert, Lindsey R.; Broyles, Thomas W.

2017-01-01

With an evolving and expanding agricultural industry, it is crucial to provide future professionals with valuable experiences and skills in problem solving, communication, and teamwork. Agricultural summer programs for secondary students, which provide cooperative learning experiences with a focus on group work and problem solving, aim to help…

Tutorial on Using LISP Object-Oriented Programming for Blackboards: Solving the Radar Tracking Problem

Science.gov (United States)

1989-08-01

1977. Pp. 1-229. 25. V. Lesser and R. Fennell. "Parallelism in Aritificial Intelligence Problem Solving: A Case Study of Hearsay II," IEEE Transactions...artificial intelligence architecture used to solve the radar tracking problem. The research described was performed at Purdue University during long...TION 1 COSA TI CODES 18 SUBJECT TERMS in ,,tnu; . ’ .’ , .., ,’ a-, ,’£ ,i-, ,4’o4,, nun br) ,LD I GROUP SUB.GROu P Artificial intelligence Object

Branching habit and the allocation of reproductive resources in conifers.

Science.gov (United States)

Leslie, Andrew B

2012-09-01

Correlated relationships between branch thickness, branch density, and twig and leaf size have been used extensively to study the evolution of plant canopy architecture, but fewer studies have explored the impact of these relationships on the allocation of reproductive resources. This study quantifies pollen cone production in conifers, which have similar basic reproductive biology but vary dramatically in branching habit, in order to test how differences in branch diameter influence pollen cone size and the density with which they are deployed in the canopy. Measurements of canopy branch density, the number of cones per branch and cone size were used to estimate the amount of pollen cone tissues produced by 16 species in three major conifer clades. The number of pollen grains produced was also estimated using direct counts from individual pollen cones. The total amount of pollen cone tissues in the conifer canopy varied little among species and clades, although vegetative traits such as branch thickness, branch density and pollen cone size varied over several orders of magnitude. However, branching habit controls the way these tissues are deployed: taxa with small branches produce small pollen cones at a high density, while taxa with large branches produce large cones relatively sparsely. Conifers appear to invest similar amounts of energy in pollen production independent of branching habit. However, similar associations between branch thickness, branch density and pollen cone size are seen across conifers, including members of living and extinct groups not directly studied here. This suggests that reproductive features relating to pollen cone size are in large part a function of the evolution of vegetative morphology and branching habit.

40 CFR 721.3627 - Branched synthetic fatty acid.

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 30 2010-07-01 2010-07-01 false Branched synthetic fatty acid. 721... Substances § 721.3627 Branched synthetic fatty acid. (a) Chemical substance and significant new uses subject to reporting. (1) The chemical substance identified generically as a branched synthetic fatty acid...

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

Science.gov (United States)

Park, Ryoungsun; Kim, Jiseon; Dodd, Barbara G.; Chung, Hyewon

2011-01-01

JPLEX, short for Java simPLEX, is an automated test assembly (ATA) program. It is a mixed integer linear programming (MILP) solver written in Java. It reads in a configuration file, solves the minimization problem, and produces an output file for postprocessing. It implements the simplex algorithm to create a fully relaxed solution and…

Branching enzyme assay: selective quantitation of the alpha 1,6-linked glucosyl residues involved in the branching points.

Science.gov (United States)

Krisman, C R; Tolmasky, D S; Raffo, S

1985-06-01

Methods previously described for glycogen or amylopectin branching enzymatic activity are insufficiently sensitive and not quantitative. A new, more sensitive, specific, and quantitative one was developed. It is based upon the quantitation of the glucose residues joined by alpha 1,6 bonds introduced by varying amounts of branching enzyme. The procedure involved the synthesis of a polysaccharide from Glc-1-P and phosphorylase in the presence of the sample to be tested. The branched polysaccharide was then purified and the glucoses involved in the branching points were quantitated after degradation with phosphorylase and debranching enzymes. This method appeared to be useful, not only in enzymatic activity determinations but also in the study of the structure of alpha-D-glucans when combined with those of total polysaccharide quantitation, such as iodine and phenol-sulfuric acid.

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.

Programming Cardiac Resynchronization Therapy for Electrical Synchrony: Reaching Beyond Left Bundle Branch Block and Left Ventricular Activation Delay.

Science.gov (United States)

Varma, Niraj; O'Donnell, David; Bassiouny, Mohammed; Ritter, Philippe; Pappone, Carlo; Mangual, Jan; Cantillon, Daniel; Badie, Nima; Thibault, Bernard; Wisnoskey, Brian

2018-02-06

QRS narrowing following cardiac resynchronization therapy with biventricular (BiV) or left ventricular (LV) pacing is likely affected by patient-specific conduction characteristics (PR, qLV, LV-paced propagation interval), making a universal programming strategy likely ineffective. We tested these factors using a novel, device-based algorithm (SyncAV) that automatically adjusts paced atrioventricular delay (default or programmable offset) according to intrinsic atrioventricular conduction. Seventy-five patients undergoing cardiac resynchronization therapy (age 66±11 years; 65% male; 32% with ischemic cardiomyopathy; LV ejection fraction 28±8%; QRS duration 162±16 ms) with intact atrioventricular conduction (PR interval 194±34, range 128-300 ms), left bundle branch block, and optimized LV lead position were studied at implant. QRS duration (QRSd) reduction was compared for the following pacing configurations: nominal simultaneous BiV (Mode I: paced/sensed atrioventricular delay=140/110 ms), BiV+SyncAV with 50 ms offset (Mode II), BiV+SyncAV with offset that minimized QRSd (Mode III), or LV-only pacing+SyncAV with 50 ms offset (Mode IV). The intrinsic QRSd (162±16 ms) was reduced to 142±17 ms (-11.8%) by Mode I, 136±14 ms (-15.6%) by Mode IV, and 132±13 ms (-17.8%) by Mode II. Mode III yielded the shortest overall QRSd (123±12 ms, -23.9% [ P <0.001 versus all modes]) and was the only configuration without QRSd prolongation in any patient. QRS narrowing occurred regardless of QRSd, PR, or LV-paced intervals, or underlying ischemic disease. Post-implant electrical optimization in already well-selected patients with left bundle branch block and optimized LV lead position is facilitated by patient-tailored BiV pacing adjusted to intrinsic atrioventricular timing using an automatic device-based algorithm. © 2018 The Authors. Published on behalf of the American Heart Association, Inc., by Wiley.

A Python Program for Solving Schro¨dinger's Equation in Undergraduate Physical Chemistry

Science.gov (United States)

Srnec, Matthew N.; Upadhyay, Shiv; Madura, Jeffry D.

2017-01-01

In undergraduate physical chemistry, Schrödinger's equation is solved for a variety of cases. In doing so, the energies and wave functions of the system can be interpreted to provide connections with the physical system being studied. Solving this equation by hand for a one-dimensional system is a manageable task, but it becomes time-consuming…

Distribution of degrees of polymerization in statistically branched polymers with tetrafunctional branch points: model calculations

Czech Academy of Sciences Publication Activity Database

Netopilík, Miloš; Kratochvíl, Pavel

2006-01-01

Roč. 55, č. 2 (2006), s. 196-203 ISSN 0959-8103 R&D Projects: GA AV ČR IAA100500501; GA AV ČR IAA4050403; GA AV ČR IAA4050409; GA ČR GA203/03/0617 Institutional research plan: CEZ:AV0Z40500505 Keywords : statistical branching * tetrafunctional branch points * molecular-weight distribution Subject RIV: CD - Macromolecular Chemistry Impact factor: 1.475, year: 2006

A Case Study: Using Integrated Approach to Design a Net-Zero Bank Branch

Energy Technology Data Exchange (ETDEWEB)

Athalye, Rahul A.; Xie, YuLong; Liu, Bing; Baechler, Michael C.

2012-10-26

This paper describes a real life project conducted by the Pacific Northwest National Laboratory and PNC Financial Services Group's design team. This is a demonstration project supported by the U.S. Department of Energy's Commercial Partnerships Program, the goal of which is to design and construct a new-zero energy bank branch in Fort Lauderdale, Florida.

Sustainability of International Branch Campuses in the United Arab Emirates: A Vision for the Future

Science.gov (United States)

Franklin, Angela; Alzouebi, Khadeegha

2014-01-01

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

Predicting the scanning branches of hysteretic soil water-retention capacity with use of the method of mathematical modeling

Science.gov (United States)

Terleev, V.; Ginevsky, R.; Lazarev, V.; Nikonorov, A.; Togo, I.; Topaj, A.; Moiseev, K.; Abakumov, E.; Melnichuk, A.; Dunaieva, I.

2017-10-01

A mathematical model of the hysteresis of the water-retention capacity of the soil is proposed. The parameters of the model are interpreted within the framework of physical concepts of the structure and capillary properties of soil pores. On the basis of the model, a computer program with an interface that allows for dialogue with the user is developed. The program has some of options: visualization of experimental data; identification of the model parameters with use of measured data by means of an optimizing algorithm; graphical presentation of the hysteresis loop with application of the assigned parameters. Using the program, computational experiments were carried out, which consisted in verifying the identifiability of the model parameters from data on the main branches, and also in testing the ability to predict the scanning branches of the hysteresis loop. For the experiments, literature data on two sandy soils were used. The absence of an “artificial pump effect” is proved. A sufficiently high accuracy of the prediction of the scanning branches of the hysteresis loop has been achieved in comparison with the three models of the precursors. The practical importance of the proposed model and computer program, which is developed on its basis, is to ensure the calculation of precision irrigation rates. The application of such rates in irrigation farming will help to prevent excess moisture from flowing beyond the root layer of the soil and, thus, minimize the unproductive loss of irrigation water and agrochemicals, as well as reduce the risk of groundwater contamination and natural water eutrophication.

40 CFR 721.10094 - Decene, branched and linear.

Science.gov (United States)

2010-07-01

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

Solving dominance and potential optimality in imprecise multi-attribute additive problems

International Nuclear Information System (INIS)

Mateos, Alfonso; Jimenez, Antonio; Rios-Insua, Sixto

2003-01-01

We consider the multicriteria decision-making problem where there is partial information on decision maker preferences, represented by means of an imprecise multiattribute additive utility function, and where the consequences of the alternatives or strategies are also possibly imprecise. Under these circumstances we consider how useful problem-solving concepts, namely nondominated, potentially optimal, adjacent potentially optimal alternatives, can be analytically computed. Thus, the problem can be solved much more efficiently using the classical methodology of linear programming

Using graph theory for automated electric circuit solving

International Nuclear Information System (INIS)

Toscano, L; Stella, S; Milotti, E

2015-01-01

Graph theory plays many important roles in modern physics and in many different contexts, spanning diverse topics such as the description of scale-free networks and the structure of the universe as a complex directed graph in causal set theory. Graph theory is also ideally suited to describe many concepts in computer science. Therefore it is increasingly important for physics students to master the basic concepts of graph theory. Here we describe a student project where we develop a computational approach to electric circuit solving which is based on graph theoretic concepts. This highly multidisciplinary approach combines abstract mathematics, linear algebra, the physics of circuits, and computer programming to reach the ambitious goal of implementing automated circuit solving. (paper)

Geometrical scaling, furry branching and minijets

International Nuclear Information System (INIS)

Hwa, R.C.

1988-01-01

Scaling properties and their violations in hadronic collisions are discussed in the framework of the geometrical branching model. Geometrical scaling supplemented by Furry branching characterizes the soft component, while the production of jets specifies the hard component. Many features of multiparticle production processes are well described by this model. 21 refs

Conformal branching rules and modular invariants

International Nuclear Information System (INIS)

Walton, M.A.

1989-01-01

Using the outer automorphisms of the affine algebra SU(n), we show how the branching rules for the conformal subalgebra SU(pq) contains SU(p) x SU(q) may be simply calculated. We demonstrate that new modular invariant combinations of SU(n) characters are obtainable from the branching rules. (orig.)

Parallelization of elliptic solver for solving 1D Boussinesq model

Science.gov (United States)

Tarwidi, D.; Adytia, D.

2018-03-01

In this paper, a parallel implementation of an elliptic solver in solving 1D Boussinesq model is presented. Numerical solution of Boussinesq model is obtained by implementing a staggered grid scheme to continuity, momentum, and elliptic equation of Boussinesq model. Tridiagonal system emerging from numerical scheme of elliptic equation is solved by cyclic reduction algorithm. The parallel implementation of cyclic reduction is executed on multicore processors with shared memory architectures using OpenMP. To measure the performance of parallel program, large number of grids is varied from 28 to 214. Two test cases of numerical experiment, i.e. propagation of solitary and standing wave, are proposed to evaluate the parallel program. The numerical results are verified with analytical solution of solitary and standing wave. The best speedup of solitary and standing wave test cases is about 2.07 with 214 of grids and 1.86 with 213 of grids, respectively, which are executed by using 8 threads. Moreover, the best efficiency of parallel program is 76.2% and 73.5% for solitary and standing wave test cases, respectively.

Collective Cellular Decision-Making Gives Developmental Plasticity: A Model of Signaling in Branching Roots

Science.gov (United States)

McCleery, W. Tyler; Mohd-Radzman, Nadiatul A.; Grieneisen, Veronica A.

Cells within tissues can be regarded as autonomous entities that respond to their local environment and signaling from neighbors. Cell coordination is particularly important in plants, where root architecture must strategically invest resources for growth to optimize nutrient acquisition. Thus, root cells are constantly adapting to environmental cues and neighbor communication in a non-linear manner. To explain such plasticity, we view the root as a swarm of coupled multi-cellular structures, ''metamers'', rather than as a continuum of identical cells. These metamers are individually programmed to achieve a local objective - developing a lateral root primordia, which aids in local foraging of nutrients. Collectively, such individual attempts may be halted, structuring root architecture as an emergent behavior. Each metamer's decision to branch is coordinated locally and globally through hormone signaling, including processes of controlled diffusion, active polar transport, and dynamic feedback. We present a physical model of the signaling mechanism that coordinates branching decisions in response to the environment. This work was funded by the European Commission 7th Framework Program, Project No. 601062, SWARM-ORGAN.

The sensory-motor bridge neurorraphy: an anatomic study of feasibility between sensory branch of the musculocutaneous nerve and deep branch of the radial nerve.

Science.gov (United States)

Goubier, Jean-Noel; Teboul, Frédéric

2011-05-01

Restoring elbow flexion remains the first step in the management of total palsy of the brachial plexus. Non avulsed upper roots may be grafted on the musculocutaneous nerve. When this nerve is entirely grafted, some motor fibres regenerate within the sensory fibres quota. Aiming potential utilization of these lost motor fibres, we attempted suturing the sensory branch of the musculocutaneous nerve onto the deep branch of the radial nerve. The objective of our study was to assess the anatomic feasibility of such direct suturing of the terminal sensory branch of the musculocutaneous nerve onto the deep branch of the radial nerve. The study was carried out with 10 upper limbs from fresh cadavers. The sensory branch of the musculocutaneous muscle was dissected right to its division. The motor branch of the radial nerve was identified and dissected as proximally as possible into the radial nerve. Then, the distance separating the two nerves was measured so as to assess whether direct neurorraphy of the two branches was feasible. The excessive distance between the two branches averaged 6 mm (1-13 mm). Thus, direct neurorraphy of the sensory branch of the musculocutaneous nerve and the deep branch of the radial nerve was possible. When the whole musculocutaneous nerve is grafted, some of its motor fibres are lost amongst the sensory fibres (cutaneous lateral antebrachial nerve). By suturing this sensory branch onto the deep branch of the radial nerve, "lost" fibres may be retrieved, resulting in restoration of digital extension. Copyright © 2011 Wiley-Liss, Inc.

Hilbert Series and Mixed Branches of T[SU(N)] theories

Energy Technology Data Exchange (ETDEWEB)

Carta, Federico [Departamento de Física Teórica and Instituto de Física Teórica UAM-CSIC,Universidad Autónoma de Madrid, Cantoblanco, 28049 Madrid (Spain); Hayashi, Hirotaka [Departamento de Física Teórica and Instituto de Física Teórica UAM-CSIC,Universidad Autónoma de Madrid, Cantoblanco, 28049 Madrid (Spain); Tokai University,4-1-1 Kitakaname, Hiratsuka, Kanagawa 259-1292 (Japan)

2017-02-07

We consider mixed branches of 3dN=4T[SU(N)] theory. We compute the Hilbert series of the Coulomb branch part of the mixed branch from a restriction rule acting on the Hilbert series of the full Coulomb branch that will truncate the magnetic charge summation only to the subset of BPS dressed monopole operators that arise in the Coulomb branch sublocus where the mixed branch stems. This restriction can be understood directly from the type IIB brane picture by a relation between the magnetic charges of the monopoles and brane position moduli. We also apply the restriction rule to the Higgs branch part of a given mixed branch by exploiting 3d mirror symmetry. Both cases show complete agreement with the results calculated by different methods.

Branching miter joints : principles and artwork

NARCIS (Netherlands)

Verhoeff, T.; Verhoeff, K.; Hart, G.W.; Sarhangi, R.

2010-01-01

A miter joint connects two beams, typically of the same cross section, at an angle such that the longitudinal beam edges continue across the joint. When more than two beams meet in one point, like in a tree, we call this a branching joint. In a branching miter joint, the beams’ longitudinal edges

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 the Copenhagen City Heart Study examined in 1976-2003 free from previous myocardial infarction (MI), chronic heart failure, and left bundle branch block through registry linkage until 2009 for all-cause mortality and cardiovascular outcomes. The prevalence of RBBB/IRBBB was higher in men (1.4%/4.7% in men vs. 0.......5%/2.3% in women, P block was associated with significantly...

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.

Pre-Service Physics Teachers’ Problem-solving Skills in Projectile Motion Concept

Science.gov (United States)

Sutarno, S.; Setiawan, A.; Kaniawati, I.; Suhandi, A.

2017-09-01

This study is a preliminary research aiming at exploring pre-service physics teachers’ skills in applying the stage of problem-solving strategies. A total of 76 students of physics education study program at a college in Bengkulu Indonesia participated in the study. The skills on solving physics problems are being explored through exercises that demand the use of problem-solving strategies with several stages such as useful description, physics approach, specific application of physics, physics equation, mathematical procedures, and logical progression. Based on the results of data analysis, it is found that the pre-service physics teachers’ skills are in the moderate category for physics approach and mathematical procedural, and low category for the others. It was concluded that the pre-service physics teachers’ problem-solving skills are categorized low. It is caused by the learning of physics that has done less to practice problem-solving skills. The problems provided are only routine and poorly trained in the implementation of problem-solving strategies.The results of the research can be used as a reference for the importance of the development of physics learning based on higher order thinking skills.

The influence of branch order on optimal leaf vein geometries: Murray's law and area preserving branching.

Directory of Open Access Journals (Sweden)

Charles A Price

Full Text Available Models that predict the form of hierarchical branching networks typically invoke optimization based on biomechanical similitude, the minimization of impedance to fluid flow, or construction costs. Unfortunately, due to the small size and high number of vein segments found in real biological networks, complete descriptions of networks needed to evaluate such models are rare. To help address this we report results from the analysis of the branching geometry of 349 leaf vein networks comprising over 1.5 million individual vein segments. In addition to measuring the diameters of individual veins before and after vein bifurcations, we also assign vein orders using the Horton-Strahler ordering algorithm adopted from the study of river networks. Our results demonstrate that across all leaves, both radius tapering and the ratio of daughter to parent branch areas for leaf veins are in strong agreement with the expectation from Murray's law. However, as veins become larger, area ratios shift systematically toward values expected under area-preserving branching. Our work supports the idea that leaf vein networks differentiate roles of leaf support and hydraulic supply between hierarchical orders.

Pen Branch fault: Confirmatory drilling results

International Nuclear Information System (INIS)

Stieve, A.; Coruh, C.; Costain, J.K.

1994-01-01

The Confirmatory Drilling Project is the final investigation under the Pen Branch Fault Program initiated to determine the capability of the Pen Branch fault (PBF) to release seismic energy. This investigation focused on a small zone over the fault where previously collected seismic reflection data had indicated the fault deforms the subsurface at 150 msec (with reference to an 80 m reference datum). Eighteen drill holes, 2 to basement and the others to 300 ft, were arranged in a scatter pattern over the fault. To adequately define configuration of the layers deformed by the fault boreholes were spaced over a zone of 800 ft, north to south. The closely spaced data were to confirm or refute the existence of flat lying reflectors observed in seismic reflection data and to enable the authors to identify and correlate lithologic layers with seismic reflection data. Results suggest that deformation by the fault in sediments 300 ft deep ad shallower is subtle. Corroboration of the geologic interpretation with the seismic reflection profile is ongoing but preliminary results indicate that specific reflectors can be assigned to lithologic layers. A large amplitude package of reflections below a flat lying continuous reflection at 40 msec can be correlated with a lithology that corresponds to carbonate sediments in geologic cross-section. Further, data also show that a geologic layer as shallow as 30 ft can be traced on these seismic data over the same subsurface distance where geologic cross-section shows corresponding continuity. The subsurface structure is thus corroborated by both methods at this study site

Optimization of multi-branch switched diversity systems

KAUST Repository

Nam, Haewoon; Alouini, Mohamed-Slim

2009-01-01

A performance optimization based on the optimal switching threshold(s) for a multi-branch switched diversity system is discussed in this paper. For the conventional multi-branch switched diversity system with a single switching threshold

Branched RNA: A New Architecture for RNA Interference

Directory of Open Access Journals (Sweden)

Anna Aviñó

2011-01-01

Full Text Available Branched RNAs with two and four strands were synthesized. These structures were used to obtain branched siRNA. The branched siRNA duplexes had similar inhibitory capacity as those of unmodified siRNA duplexes, as deduced from gene silencing experiments of the TNF-α protein. Branched RNAs are considered novel structures for siRNA technology, and they provide an innovative tool for specific gene inhibition. As the method described here is compatible with most RNA modifications described to date, these compounds may be further functionalized to obtain more potent siRNA derivatives and can be attached to suitable delivery systems.

Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach

Directory of Open Access Journals (Sweden)

Khalid Haddouch

2016-09-01

Full Text Available A wide variety of real world optimization problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs. In this paper, we model this problem in terms of in original 0-1 quadratic programming subject to leaner constraints. View it performance, we use the continuous Hopfield network to solve the obtained model basing on original energy function. To validate our model, we solve several instance of benchmarking WCSP. In this regard, our approach recognizes the optimal solution of the said instances.

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.

Computer problem-solving coaches for introductory physics: Design and usability studies

Science.gov (United States)

Ryan, Qing X.; Frodermann, Evan; Heller, Kenneth; Hsu, Leonardo; Mason, Andrew

2016-06-01

The combination of modern computing power, the interactivity of web applications, and the flexibility of object-oriented programming may finally be sufficient to create computer coaches that can help students develop metacognitive problem-solving skills, an important competence in our rapidly changing technological society. However, no matter how effective such coaches might be, they will only be useful if they are attractive to students. We describe the design and testing of a set of web-based computer programs that act as personal coaches to students while they practice solving problems from introductory physics. The coaches are designed to supplement regular human instruction, giving students access to effective forms of practice outside class. We present results from large-scale usability tests of the computer coaches and discuss their implications for future versions of the coaches.

The Carnegie–Chicago Hubble Program. III. The Distance to NGC 1365 via the Tip of the Red Giant Branch

Science.gov (United States)

Jang, In Sung; Hatt, Dylan; Beaton, Rachael L.; Lee, Myung Gyoon; Freedman, Wendy L.; Madore, Barry F.; Hoyt, Taylor J.; Monson, Andrew J.; Rich, Jeffrey A.; Scowcroft, Victoria; Seibert, Mark

2018-01-01

The Carnegie–Chicago Hubble Program (CCHP) seeks to anchor the distance scale of Type Ia supernovae via the Tip of the Red Giant Branch (TRGB) method. Based on deep Hubble Space Telescope ACS/WFC imaging, we present an analysis of the TRGB for the metal-poor halo of NGC 1365, a giant spiral galaxy in the Fornax cluster that was host to the Type Ia supernova SN 2012fr. We have measured the extinction-corrected TRGB magnitude of NGC 1365 to be F814W = 27.34 ± 0.03stat ± 0.04sys mag. In advance of future direct calibration by Gaia, we adopt a provisional I-band TRGB luminosity set at the Large Magellanic Cloud and find a true distance modulus μ 0 = 31.29 ± 0.04stat ± 0.06sys mag or D = 18.1 ± 0.3stat ± 0.5sys Mpc. This measurement is in excellent agreement with recent Cepheid-based distances to NGC 1365 and reveals no significant difference in the distances derived from stars of Populations I and II for this galaxy. We revisit the error budget for the CCHP path to the Hubble constant based on the analysis presented here, i.e., that for one of the most distant Type Ia supernova hosts within our Program, and find that a 2.5% measurement is feasible with the current sample of galaxies and TRGB absolute calibration. Based in part on observations made with the NASA/ESA Hubble Space Telescope, obtained at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555. These observations are associated with program #13691.

Cadaveric Study of the Articular Branches of the Shoulder Joint.

Science.gov (United States)

Eckmann, Maxim S; Bickelhaupt, Brittany; Fehl, Jacob; Benfield, Jonathan A; Curley, Jonathan; Rahimi, Ohmid; Nagpal, Ameet S

This cadaveric study investigated the anatomic relationships of the articular branches of the suprascapular (SN), axillary (AN), and lateral pectoral nerves (LPN), which are potential targets for shoulder analgesia. Sixteen embalmed cadavers and 1 unembalmed cadaver, including 33 shoulders total, were dissected. Following dissections, fluoroscopic images were taken to propose an anatomical landmark to be used in shoulder articular branch blockade. Thirty-three shoulders from 17 total cadavers were studied. In a series of 16 shoulders, 16 (100%) of 16 had an intact SN branch innervating the posterior head of the humerus and shoulder capsule. Suprascapular sensory branches coursed laterally from the spinoglenoid notch then toward the glenohumeral joint capsule posteriorly. Axillary nerve articular branches innervated the posterolateral head of the humerus and shoulder capsule in the same 16 (100%) of 16 shoulders. The AN gave branches ascending circumferentially from the quadrangular space to the posterolateral humerus, deep to the deltoid, and inserting at the inferior portion of the posterior joint capsule. In 4 previously dissected and 17 distinct shoulders, intact LPNs could be identified in 14 (67%) of 21 specimens. Of these, 12 (86%) of 14 had articular branches innervating the anterior shoulder joint, and 14 (100%) of 14 LPN articular branches were adjacent to acromial branches of the thoracoacromial blood vessels over the superior aspect of the coracoid process. Articular branches from the SN, AN, and LPN were identified. Articular branches of the SN and AN insert into the capsule overlying the glenohumeral joint posteriorly. Articular branches of the LPN exist and innervate a portion of the anterior shoulder joint.

Development of a problem solving evaluation instrument; untangling of specific problem solving assets

Science.gov (United States)

Adams, Wendy Kristine

The purpose of my research was to produce a problem solving evaluation tool for physics. To do this it was necessary to gain a thorough understanding of how students solve problems. Although physics educators highly value problem solving and have put extensive effort into understanding successful problem solving, there is currently no efficient way to evaluate problem solving skill. Attempts have been made in the past; however, knowledge of the principles required to solve the subject problem are so absolutely critical that they completely overshadow any other skills students may use when solving a problem. The work presented here is unique because the evaluation tool removes the requirement that the student already have a grasp of physics concepts. It is also unique because I picked a wide range of people and picked a wide range of tasks for evaluation. This is an important design feature that helps make things emerge more clearly. This dissertation includes an extensive literature review of problem solving in physics, math, education and cognitive science as well as descriptions of studies involving student use of interactive computer simulations, the design and validation of a beliefs about physics survey and finally the design of the problem solving evaluation tool. I have successfully developed and validated a problem solving evaluation tool that identifies 44 separate assets (skills) necessary for solving problems. Rigorous validation studies, including work with an independent interviewer, show these assets identified by this content-free evaluation tool are the same assets that students use to solve problems in mechanics and quantum mechanics. Understanding this set of component assets will help teachers and researchers address problem solving within the classroom.

PCX, Interior-Point Linear Programming Solver

International Nuclear Information System (INIS)

Czyzyk, J.

2004-01-01

1 - Description of program or function: PCX solves linear programming problems using the Mehrota predictor-corrector interior-point algorithm. PCX can be called as a subroutine or used in stand-alone mode, with data supplied from an MPS file. The software incorporates modules that can be used separately from the linear programming solver, including a pre-solve routine and data structure definitions. 2 - Methods: The Mehrota predictor-corrector method is a primal-dual interior-point method for linear programming. The starting point is determined from a modified least squares heuristic. Linear systems of equations are solved at each interior-point iteration via a sparse Cholesky algorithm native to the code. A pre-solver is incorporated in the code to eliminate inefficiencies in the user's formulation of the problem. 3 - Restriction on the complexity of the problem: There are no size limitations built into the program. The size of problem solved is limited by RAM and swap space on the user's computer

Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Moruz, Gabriel

2005-01-01

Branch mispredictions is an important factor affecting the running time in practice. In this paper we consider tradeoffs between the number of branch mispredictions and the number of comparisons for sorting algorithms in the comparison model. We prove that a sorting algorithm using O(dnlog n......) comparisons performs Omega(nlogd n) branch mispredictions. We show that Multiway MergeSort achieves this tradeoff by adopting a multiway merger with a low number of branch mispredictions. For adaptive sorting algorithms we similarly obtain that an algorithm performing O(dn(1+log (1+Inv/n))) comparisons must...... perform Omega(nlogd (1+Inv/n)) branch mispredictions, where Inv is the number of inversions in the input. This tradeoff can be achieved by GenericSort by Estivill-Castro and Wood by adopting a multiway division protocol and a multiway merging algorithm with a low number of branch mispredictions....

A new RNA branching activity: the GIR1 ribozyme

DEFF Research Database (Denmark)

Nielsen, Henrik; Johansen, Steinar D

2006-01-01

The formation of lariat intermediates during the first step of splicing of group II introns and spliceosomal introns is a well-studied fundamental reaction in molecular biology. Apart from this prominent example, there are surprisingly few occurrences of branched nucleotides or even 2......',5'-phosphodiester bonds in biology. We recently described a new ribozyme, the GIR1 branching ribozyme, which catalyzes the formation of a tiny lariat that caps an mRNA. This new example together with work on artificial branching ribozymes and deoxyribozymes shows that branching is facile and points...... to the possibility that branching reactions could be more prevalent than previously recognized....

Contribution of Interpersonal Cognitive Problem-Solving Strategy to Children with Attention Deficit Hyperactivity Disorder

Directory of Open Access Journals (Sweden)

Selahattin Ogulmus

2010-08-01

Full Text Available Attention-Deficit Hyperactivity Disorder (ADHD is a neuropsychiatric disorder characterized by inattention, distractibility, and impulsivity. Scholastic competence, social acceptance, and behavioral conduct were problem areas for children with ADHD. These children have difficulties in regulating their emotions and maintaining good relations. Lack of these skills hinders the development of healthy peer relationships and positive interaction with adults. It is important for children with ADHD to receive interventions as early as possible so that their social and emotional development can be achieved. Some social skills training programs for school-ages children with ADHD have shown positive results. The research findings in the literature demonstrate that interpersonal problem-solving skills are teachable and learnable through properly structured education programmes. Social problem solving training for children with ADHD has positive effects on the academic, behavioral and cognitive impairment. The Interpersonal Cognitive Problem-Solving (ICPS Program can have a significant effect on the behaviors of children with ADHD and can generalize to settings outside of the one in which the child was initially trained. The positive effectiveness of ICPS also known as I Can Problem Solve in developing problem-solving skills and reducing problem behaviors of children with ADHD is known. [TAF Prev Med Bull 2010; 9(4.000: 391-398

The impact of switching costs on closing of service branches

OpenAIRE

Baron, Mira G.

2002-01-01

The paper deals with the optimal location of service branches. Consumers can receive service from different firms and branches offering substitute services. The consumer chooses the firm and the branch. Examples are banking services (which firm and branch?), healthcare providers, insurance companies and their agents, brokerage firms and their branches. With the change in the accessibility of the internet, the service industry witnesses the impact of the change in technology. More customers pr...

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…

Problem solving and inference mechanisms

Energy Technology Data Exchange (ETDEWEB)

Furukawa, K; Nakajima, R; Yonezawa, A; Goto, S; Aoyama, A

1982-01-01

The heart of the fifth generation computer will be powerful mechanisms for problem solving and inference. A deduction-oriented language is to be designed, which will form the core of the whole computing system. The language is based on predicate logic with the extended features of structuring facilities, meta structures and relational data base interfaces. Parallel computation mechanisms and specialized hardware architectures are being investigated to make possible efficient realization of the language features. The project includes research into an intelligent programming system, a knowledge representation language and system, and a meta inference system to be built on the core. 30 references.

Computational models of airway branching morphogenesis.

Science.gov (United States)

Varner, Victor D; Nelson, Celeste M

2017-07-01

The bronchial network of the mammalian lung consists of millions of dichotomous branches arranged in a highly complex, space-filling tree. Recent computational models of branching morphogenesis in the lung have helped uncover the biological mechanisms that construct this ramified architecture. In this review, we focus on three different theoretical approaches - geometric modeling, reaction-diffusion modeling, and continuum mechanical modeling - and discuss how, taken together, these models have identified the geometric principles necessary to build an efficient bronchial network, as well as the patterning mechanisms that specify airway geometry in the developing embryo. We emphasize models that are integrated with biological experiments and suggest how recent progress in computational modeling has advanced our understanding of airway branching morphogenesis. Copyright © 2016 Elsevier Ltd. All rights reserved.

Piping research program plan

International Nuclear Information System (INIS)

1988-09-01

This document presents the piping research program plan for the Structural and Seismic Engineering Branch and the Materials Engineering Branch of the Division of Engineering, Office of Nuclear Regulatory Research. The plan describes the research to be performed in the areas of piping design criteria, environmentally assisted cracking, pipe fracture, and leak detection and leak rate estimation. The piping research program addresses the regulatory issues regarding piping design and piping integrity facing the NRC today and in the foreseeable future. The plan discusses the regulatory issues and needs for the research, the objectives, key aspects, and schedule for each research project, or group of projects focussing of a specific topic, and, finally, the integration of the research areas into the regulatory process is described. The plan presents a snap-shot of the piping research program as it exists today. However, the program plan will change as the regulatory issues and needs change. Consequently, this document will be revised on a bi-annual basis to reflect the changes in the piping research program. (author)

Engineering Courses on Computational Thinking Through Solving Problems in Artificial Intelligence

Directory of Open Access Journals (Sweden)

Piyanuch Silapachote

2017-09-01

Full Text Available Computational thinking sits at the core of every engineering and computing related discipline. It has increasingly emerged as its own subject in all levels of education. It is a powerful cornerstone for cognitive development, creative problem solving, algorithmic thinking and designs, and programming. How to effectively teach computational thinking skills poses real challenges and creates opportunities. Targeting entering computer science and engineering undergraduates, we resourcefully integrate elements from artificial intelligence (AI into introductory computing courses. In addition to comprehension of the essence of computational thinking, practical exercises in AI enable inspirations of collaborative problem solving beyond abstraction, logical reasoning, critical and analytical thinking. Problems in machine intelligence systems intrinsically connect students to algorithmic oriented computing and essential mathematical foundations. Beyond knowledge representation, AI fosters a gentle introduction to data structures and algorithms. Focused on engaging mental tool, a computer is never a necessity. Neither coding nor programming is ever required. Instead, students enjoy constructivist classrooms designed to always be active, flexible, and highly dynamic. Learning to learn and reflecting on cognitive experiences, they rigorously construct knowledge from collectively solving exciting puzzles, competing in strategic games, and participating in intellectual discussions.

Three ancient hormonal cues co-ordinate shoot branching in a moss.

Science.gov (United States)

Coudert, Yoan; Palubicki, Wojtek; Ljung, Karin; Novak, Ondrej; Leyser, Ottoline; Harrison, C Jill

2015-03-25

Shoot branching is a primary contributor to plant architecture, evolving independently in flowering plant sporophytes and moss gametophytes. Mechanistic understanding of branching is largely limited to flowering plants such as Arabidopsis, which have a recent evolutionary origin. We show that in gametophytic shoots of Physcomitrella, lateral branches arise by re-specification of epidermal cells into branch initials. A simple model co-ordinating the activity of leafy shoot tips can account for branching patterns, and three known and ancient hormonal regulators of sporophytic branching interact to generate the branching pattern- auxin, cytokinin and strigolactone. The mode of auxin transport required in branch patterning is a key divergence point from known sporophytic pathways. Although PIN-mediated basipetal auxin transport regulates branching patterns in flowering plants, this is not so in Physcomitrella, where bi-directional transport is required to generate realistic branching patterns. Experiments with callose synthesis inhibitors suggest plasmodesmal connectivity as a potential mechanism for transport.

The mathematical statement for the solving of the problem of N-version software system design

Science.gov (United States)

Kovalev, I. V.; Kovalev, D. I.; Zelenkov, P. V.; Voroshilova, A. A.

2015-10-01

The N-version programming, as a methodology of the fault-tolerant software systems design, allows successful solving of the mentioned tasks. The use of N-version programming approach turns out to be effective, since the system is constructed out of several parallel executed versions of some software module. Those versions are written to meet the same specification but by different programmers. The problem of developing an optimal structure of N-version software system presents a kind of very complex optimization problem. This causes the use of deterministic optimization methods inappropriate for solving the stated problem. In this view, exploiting heuristic strategies looks more rational. In the field of pseudo-Boolean optimization theory, the so called method of varied probabilities (MVP) has been developed to solve problems with a large dimensionality.

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

Aeroacoustics of pipe systems with closed branches

NARCIS (Netherlands)

Tonon, D.; Hirschberg, A.; Golliard, J.; Ziada, S.

2011-01-01

Flow induced pulsations in resonant pipe networks with closed branches are considered in this review paper. These pulsations, observed in many technical applications, have been identified as self-sustained aeroacoustic oscillations driven by the instability of the flow along the closed branches. The

Use of Generalized Fluid System Simulation Program (GFSSP) for Teaching and Performing Senior Design Projects at the Educational Institutions

Science.gov (United States)

Majumdar, A. K.; Hedayat, A.

2015-01-01

Marshall Space Flight Center (MSFC) as a general fluid flow system solver capable of handling phase changes, compressibility, mixture thermodynamics and transient operations. It also includes the capability to model external body forces such as gravity and centrifugal effects in a complex flow network. The objectives of GFSSP development are: a) to develop a robust and efficient numerical algorithm to solve a system of equations describing a flow network containing phase changes, mixing, and rotation; and b) to implement the algorithm in a structured, easy-to-use computer program. The analysis of thermofluid dynamics in a complex network requires resolution of the system into fluid nodes and branches, and solid nodes and conductors as shown in Figure 1. Figure 1 shows a schematic and GFSSP flow circuit of a counter-flow heat exchanger. Hot nitrogen gas is flowing through a pipe, colder nitrogen is flowing counter to the hot stream in the annulus pipe and heat transfer occurs through metal tubes. The problem considered is to calculate flowrates and temperature distributions in both streams. GFSSP has a unique data structure, as shown in Figure 2, that allows constructing all possible arrangements of a flow network with no limit on the number of elements. The elements of a flow network are boundary nodes where pressure and temperature are specified, internal nodes where pressure and temperature are calculated, and branches where flowrates are calculated. For conjugate heat transfer problems, there are three additional elements: solid node, ambient node, and conductor. The solid and fluid nodes are connected with solid-fluid conductors. GFSSP solves the conservation equations of mass and energy, and equation of state in internal nodes to calculate pressure, temperature and resident mass. The momentum conservation equation is solved in branches to calculate flowrate. It also solves for energy conservation equations to calculate temperatures of solid nodes. The equations are

Decision-making and problem-solving methods in automation technology

Science.gov (United States)

Hankins, W. W.; Pennington, J. E.; Barker, L. K.

1983-01-01

The state of the art in the automation of decision making and problem solving is reviewed. The information upon which the report is based was derived from literature searches, visits to university and government laboratories performing basic research in the area, and a 1980 Langley Research Center sponsored conferences on the subject. It is the contention of the authors that the technology in this area is being generated by research primarily in the three disciplines of Artificial Intelligence, Control Theory, and Operations Research. Under the assumption that the state of the art in decision making and problem solving is reflected in the problems being solved, specific problems and methods of their solution are often discussed to elucidate particular aspects of the subject. Synopses of the following major topic areas comprise most of the report: (1) detection and recognition; (2) planning; and scheduling; (3) learning; (4) theorem proving; (5) distributed systems; (6) knowledge bases; (7) search; (8) heuristics; and (9) evolutionary programming.

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

Directory of Open Access Journals (Sweden)

H Kazemipoor

2012-04-01

Full Text Available A multi-skilled project scheduling problem (MSPSP has been generally presented to schedule a project with staff members as resources. Each activity in project network requires different skills and also staff members have different skills, too. This causes the MSPSP becomes a special type of a multi-mode resource-constrained project scheduling problem (MM-RCPSP with a huge number of modes. Given the importance of this issue, in this paper, a mixed integer linear programming for the MSPSP is presented. Due to the complexity of the problem, a meta-heuristic algorithm is proposed in order to find near optimal solutions. To validate performance of the algorithm, results are compared against exact solutions solved by the LINGO solver. The results are promising and show that optimal or near-optimal solutions are derived for small instances and good solutions for larger instances in reasonable time.

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

AGB [asymptotic giant branch]: Star evolution

International Nuclear Information System (INIS)

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

Instruction in Renal Physiology on a Minicomputer-Based Educational System.

Science.gov (United States)

Wells, C. H.; And Others

A prototypical minicomputer-based educational system was designed at the University of Texas Medical Branch to determine if it is possible to evolve complex educational programs which are effective and also flexible and of low cost. Freshman medical students using the minicomputer program substantially improved their problem-solving abilities in…

NUTRIENT CONTENT IN DURIAN (DURIO ZIBETHINUS L. BRANCH BARK

Directory of Open Access Journals (Sweden)

Jaime A. TEIXEIRA DA SILVA

2017-12-01

Full Text Available Durian (Durio zibethinus L. fruit form on the bark of branches. The aim of our research was to assess whether branches bearing different number of fruits have different nutrient contents in their bark. We determined the nitrogen (N, phosphorous (P, potassium (K, and carbon (C content in branch bark 30 days after fruit set using branches bearing different number of fruits per panicle (0, 1, 2 or >2 of two varieties (‘Otong’ and ‘Kani’. Bark was cut into 0.03 m long and 0.005 m wide segments with an average thickness of 0.00085 m. The bark of branches bearing a different number of fruits had the same N, P, K, and C content but different ratios of C/N, C/P, C/K, N/K, and P/K. The bark of ‘Otong’ branches had a higher N content but a lower C/N ratio than ‘Kani’ bark.

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

Science.gov (United States)

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

2017-01-01

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

Fuzzy linear programming approach for solving transportation

Indian Academy of Sciences (India)

Transportation problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at ...

Flow structure in a downward branch pipe with a closed end. Characteristics of flow velocity in the branch pipe

International Nuclear Information System (INIS)

Miyoshi, Koji; Nakamura, Akira; Takenaka, Nobuyuki

2016-01-01

Many pipes branch off from a main pipe in industrial plants. The penetration of hot water into the branch pipe causes thermal stratification. The thermal stratification layer fluctuates and causes thermal fatigue. The characteristics of velocity distributions in the branch pipe for inner diameters from D_b=21 mm to 43 mm were investigated by laser Doppler velocimetry in this paper. As for the flow in the branch pipe at L=4D_b, the mean velocity of the spiral flow was a simple forced vortex which indicated a straight velocity distribution. The maximum circumferential velocity U_θ _m_a_x and minimum axial velocity U_z _m_i_n at L=4D_b were expressed with D_b and main flow velocity. Empirical formulas were proposed for estimating the distributions of U_θ _m_a_x and U_z _m_i_n in the axial direction. (author)

Fourth annual Walker Branch Watershed research symposium: Program and abstracts

International Nuclear Information System (INIS)

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

Marginal mandibular branch of the facial nerve: An anatomical study

Directory of Open Access Journals (Sweden)

Ayman Ahmad Khanfour

2014-06-01

Results: Results showed that the (MMBFN arises as a single branch, two branches, and three branches in 36.7%, 43.3% and 20% of specimens, respectively. In 83.3% of cases, one of the main or secondary branches of the marginal mandibular nerve crosses superficial (lateral to the facial vessels. There are communications either between the main or the secondary branches of the marginal mandibular nerve itself in 53.6% of specimens and with the buccal branch of the facial nerve in 40%, also with the anterior branch of the great auricular nerve in 3.3%, and with the transverse cervical nerve in 3.3% of specimens. The relationship of the nerve to the lower border of the mandible at a point midway between the angle of the mandible and symphysis menti is variable; it is either totally above it in most of the specimens 80%, or below it in 10% or at it in the remaining 10% of the specimens. The branches that lie above the lower border of the mandible are always deep into the superficial layer of the parotid fascia, while those branches that lie below the lower border of the mandible are intrafascially. The termination of the nerve is deep into the muscles of the ipsilateral lower lip in all specimens.

A multiobjective approach for solving cooperative n-person games

Energy Technology Data Exchange (ETDEWEB)

Maali, Yashar [Department of Industrial Engineering, Payam-e-Noor University, Tehran (Iran)

2009-11-15

A linear programming model is introduced to solve cooperative games. The solution is always Pareto optimal. It is based on the idea of the core but instead of requiring rationality for all groups, a multiobjective approach is proposed including the importance weights of the players. A case study illustrates the application of this method. (author)

A Metacognitive Profile of Vocational High School Student’s Field Independent in Mathematical Problem Solving

Science.gov (United States)

Nugraheni, L.; Budayasa, I. K.; Suwarsono, S. T.

2018-01-01

The study was designed to discover examine the profile of metacognition of vocational high school student of the Machine Technology program that had high ability and field independent cognitive style in mathematical problem solving. The design of this study was exploratory research with a qualitative approach. This research was conducted at the Machine Technology program of the vocational senior high school. The result revealed that the high-ability student with field independent cognitive style conducted metacognition practices well. That involved the three types of metacognition activities, consisting of planning, monitoring, and evaluating at metacognition level 2 or aware use, 3 or strategic use, 4 or reflective use in mathematical problem solving. The applicability of the metacognition practices conducted by the subject was never at metacognition level 1 or tacit use. This indicated that the participant were already aware, capable of choosing strategies, and able to reflect on their own thinking before, after, or during the process at the time of solving mathematical problems.That was very necessary for the vocational high school student of Machine Technology program.

Pipeline corridors through wetlands - impacts on plant communities: Deep Creek and Brandy Branch crossings, Nassau County, Florida

Energy Technology Data Exchange (ETDEWEB)

Shem, L.M.; Van Dyke, G.D.; Zimmerman, R.E.

1994-12-01

The goal of the Gas Research Institute Wetland Corridors Program is to document impacts of existing pipelines on the wetlands they traverse. To accomplish this goal, 12 existing wetland crossings were surveyed. These sites varied in elapsed time since pipeline construction, wetland type, pipeline installation techniques, and right-of-way (ROW) management practices. This report presents the results of surveys conducted July 14-18, 1992, at the Deep Creek and the Brandy Branch crossings of a pipeline installed during May 1991 in Nassau County, Florida. Both floodplains supported bottomland hardwood forests. The pipeline at the Deep Creek crossing was installed by means of horizontal directional drilling after the ROW had been clear-cut, while the pipeline at the Brandy Branch crossing was installed by means of conventional open trenching. Neither site was seeded or fertilized. At the time of sampling, a dense vegetative community, made up primarily of native perennial herbaceous species, occupied the ROW within the Deep Creek floodplain. The Brandy Branch ROW was vegetated by a less dense stand of primarily native perennial herbaceous plants. Plant diversity was also lower at the Brandy Branch crossing than at the Deep Creek crossing. The results suggest that some of the differences in plant communities are related to the more hydric conditions at the Brandy Branch floodplain.

State-set branching

DEFF Research Database (Denmark)

Jensen, Rune Møller; Veloso, Manuela M.; Bryant, Randal E.

2008-01-01

In this article, we present a framework called state-set branching that combines symbolic search based on reduced ordered Binary Decision Diagrams (BDDs) with best-first search, such as A* and greedy best-first search. The framework relies on an extension of these algorithms from expanding a sing...

Model Integrated Problem Solving Based Learning pada Perkuliahan Dasar-dasar Kimia Analitik

Directory of Open Access Journals (Sweden)

Indarini Dwi Pursitasari

2013-07-01

Full Text Available Abstract: Integrated Problem Solving Based Learning Model on Foundation of Analytical Chemistry. This study was conducted to know the effects of Integrated Problem Solving Based Learning (IPSBL model on problem solving skills and cognitive ability of pre-service teachers. The subjects of the study were 41 pre- service teachers, 21 in the experimental group and 20 in the control group. The data were collected through a test on problem solving skills, a test on cognitive ability, and a questionnaire on the students’opinions on the use of IPSBL model. The quantitative data were analyzed using t-test and one-way ANOVA, and the qualitative data were analyzed by counting the percentage. The results of the study show that the implementation of IPSBL model increased the problem solving skills and cognitive ability of the pre-service teachers . The model was also responded positively by the research subjects. Abstrak: Model Integrated Problem Solving Based learning pada Perkuliahan Dasar-dasar Kimia Analitik. Penelitian ini bertujuan menentukan pengaruh model Integrated Problem Solving Based Learning(IPSBL terhadap peningkatan kemampuan problem solving dan kemampuan kognitif mahasiswa calon guru. Subjek penelitian terdiri dari 21 mahasiswa kelas eksperimen dan 20 mahasiswa kelas kontrol. Data dikumpulkan menggunakan tes kemampuan problem solving, tes kemampuan kognitif, dan angket untuk menjaring pendapat mahasiswa terhadap penggunaan model IPSBL . Data kuantitatif dianalisis denga n uji- t dan Anava dengan bantuan program SPSS 16.0. Data kualitatif dihitung persentasenya. Hasil penelitian menunjukkan bahwa model IPSBL dapat meningkatkan kemampuan problem solving dan kemampuan kognitif serta mendapat tanggapan yang positif dari mahasiswa.

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

Science.gov (United States)

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

2012-01-01

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

Asymptotic behaviour near extinction of continuous-state branching processes

OpenAIRE

Berzunza, Gabriel; Pardo, Juan Carlos

2016-01-01

In this note, we study the asymptotic behaviour near extinction of (sub-) critical continuous state branching processes. In particular, we establish an analogue of Khintchin's law of the iterated logarithm near extinction time for a continuous state branching process whose branching mechanism satisfies a given condition and its reflected process at its infimum.

Stochastic and deterministic causes of streamer branching in liquid dielectrics

International Nuclear Information System (INIS)

Jadidian, Jouya; Zahn, Markus; Lavesson, Nils; Widlund, Ola; Borg, Karl

2013-01-01

Streamer branching in liquid dielectrics is driven by stochastic and deterministic factors. The presence of stochastic causes of streamer branching such as inhomogeneities inherited from noisy initial states, impurities, or charge carrier density fluctuations is inevitable in any dielectric. A fully three-dimensional streamer model presented in this paper indicates that deterministic origins of branching are intrinsic attributes of streamers, which in some cases make the branching inevitable depending on shape and velocity of the volume charge at the streamer frontier. Specifically, any given inhomogeneous perturbation can result in streamer branching if the volume charge layer at the original streamer head is relatively thin and slow enough. Furthermore, discrete nature of electrons at the leading edge of an ionization front always guarantees the existence of a non-zero inhomogeneous perturbation ahead of the streamer head propagating even in perfectly homogeneous dielectric. Based on the modeling results for streamers propagating in a liquid dielectric, a gauge on the streamer head geometry is introduced that determines whether the branching occurs under particular inhomogeneous circumstances. Estimated number, diameter, and velocity of the born branches agree qualitatively with experimental images of the streamer branching

Environmental control of branching in petunia.

Science.gov (United States)

Drummond, Revel S M; Janssen, Bart J; Luo, Zhiwei; Oplaat, Carla; Ledger, Susan E; Wohlers, Mark W; Snowden, Kimberley C

2015-06-01

Plants alter their development in response to changes in their environment. This responsiveness has proven to be a successful evolutionary trait. Here, we tested the hypothesis that two key environmental factors, light and nutrition, are integrated within the axillary bud to promote or suppress the growth of the bud into a branch. Using petunia (Petunia hybrida) as a model for vegetative branching, we manipulated both light quality (as crowding and the red-to-far-red light ratio) and phosphate availability, such that the axillary bud at node 7 varied from deeply dormant to rapidly growing. In conjunction with the phenotypic characterization, we also monitored the state of the strigolactone (SL) pathway by quantifying SL-related gene transcripts. Mutants in the SL pathway inhibit but do not abolish the branching response to these environmental signals, and neither signal is dominant over the other, suggesting that the regulation of branching in response to the environment is complex. We have isolated three new putatively SL-related TCP (for Teosinte branched1, Cycloidia, and Proliferating cell factor) genes from petunia, and have identified that these TCP-type transcription factors may have roles in the SL signaling pathway both before and after the reception of the SL signal at the bud. We show that the abundance of the receptor transcript is regulated by light quality, such that axillary buds growing in added far-red light have greatly increased receptor transcript abundance. This suggests a mechanism whereby the impact of any SL signal reaching an axillary bud is modulated by the responsiveness of these cells to the signal. © 2015 American Society of Plant Biologists. All Rights Reserved.

BPP: a sequence-based algorithm for branch point prediction.

Science.gov (United States)

Zhang, Qing; Fan, Xiaodan; Wang, Yejun; Sun, Ming-An; Shao, Jianlin; Guo, Dianjing

2017-10-15

Although high-throughput sequencing methods have been proposed to identify splicing branch points in the human genome, these methods can only detect a small fraction of the branch points subject to the sequencing depth, experimental cost and the expression level of the mRNA. An accurate computational model for branch point prediction is therefore an ongoing objective in human genome research. We here propose a novel branch point prediction algorithm that utilizes information on the branch point sequence and the polypyrimidine tract. Using experimentally validated data, we demonstrate that our proposed method outperforms existing methods. Availability and implementation: https://github.com/zhqingit/BPP. djguo@cuhk.edu.hk. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

Capabilities of the Environmental Effects Branch at Marshall Space Flight Cente

Science.gov (United States)

Rogers, Jan; Finckenor, Miria; Nehls, Mary

2016-01-01

The Environmental Effects Branch at the Marshall Space Flight Center supports a myriad array of programs for NASA, DoD, and commercial space including human exploration, advanced space propulsion, improving life on Earth, and the study of the Sun, the Earth, and the solar system. The branch provides testing, evaluation, and qualification of materials for use on external spacecraft surfaces and in contamination-sensitive systems. Space environment capabilities include charged particle radiation, ultraviolet radiation, atomic oxygen, impact, plasma, and thermal vacuum, anchored by flight experiments and analysis of returned space hardware. These environmental components can be combined for solar wind or planetary surface environment studies or to evaluate synergistic effects. The Impact Testing Facility allows simulation of impacts ranging from sand and rain to micrometeoroids and orbital debris in order to evaluate materials and components for flight and ground-based systems. The Contamination Control Team is involved in the evaluation of environmentally-friendly replacements for HCFC-225 for use in propulsion oxygen systems, developing cleaning methods for additively manufactured hardware, and reducing risk for the Space Launch System.

Towards high-performance symbolic computing using MuPAD as a problem solving environment

CERN Document Server

Sorgatz, A

1999-01-01

This article discusses the approach of developing MuPAD into an open and parallel problem solving environment for mathematical applications. It introduces the key technologies domains and dynamic modules and describes the current $9 state of macro parallelism which covers three fields of parallel programming: message passing, network variables and work groups. First parallel algorithms and examples of using the prototype of the MuPAD problem solving environment $9 are demonstrated. (12 refs).

An introduction to programming with specifications

CERN Document Server

1991-01-01

A feature of modern advanced computing is the functional approach to programming. In this book, the authors present an introduction to the mathematics which underline functional programming, emphasizing the understanding of definition and specification--a prerequisite of good programming and problem solving with a computer. The book is self-contained, requiring a low level of mathematical sophistication and may be used as an introduction to the mathematics of programming.Provides an introduction to the functional approach to programming**Emphasizes the problem to be solved, not the pro

Isotope decay equations solved by means of a recursive method

International Nuclear Information System (INIS)

Grant, Carlos

2009-01-01

The isotope decay equations have been solved using forward finite differences taking small time steps, among other methods. This is the case of the cell code WIMS, where it is assumed that concentrations of all fissionable isotopes remain constant during the integration interval among other simplifications. Even when the problem could be solved running through a logical tree, all algorithms used for resolution of these equations used an iterative programming formulation. That happened because nearly all computer languages used up to a recent past by the scientific programmers did not support recursion, such as the case of the old versions of FORTRAN or BASIC. Nowadays also an integral form of the depletion equations is used in Monte Carlo simulation. In this paper we propose another programming solution using a recursive algorithm, running through all descendants of each isotope and adding their contributions to all isotopes in each generation. The only assumption made for this solution is that fluxes remain constant during the whole time step. Recursive process is interrupted when a stable isotope was attained or the calculated contributions are smaller than a given precision. These algorithms can be solved by means an exact analytic method that can have some problems when circular loops appear for isotopes with alpha decay, and a more general polynomial method. Both methods are shown. (author)

Stochastic programming with integer recourse

NARCIS (Netherlands)

van der Vlerk, Maarten Hendrikus

1995-01-01

In this thesis we consider two-stage stochastic linear programming models with integer recourse. Such models are at the intersection of two different branches of mathematical programming. On the one hand some of the model parameters are random, which places the problem in the field of stochastic

Design and Production of Multimedia Training Programs for Problem Solving Skill and its Effect on the Mental Health of High School Female Students in Kermanshah

OpenAIRE

Shahnaz Bahrami; Saeed Vaziri Yazdi

2014-01-01

This paper addresses the design and production of multimedia training programs for problem solving skill and its effect on the mental health of high school female students in Kermanshah. The studied group included students sponsored by Imam Khomeini Relief Foundation. From five Relief Foundations in Kermanshah, Foundation Office Region 2 was randomly selected; female students were selected from all male and female students sponsored by the foundation. High school students were selected among ...

Ezhil: A Tamil Programming Language

OpenAIRE

Annamalai, Muthiah

2009-01-01

Ezhil is a Tamil language based interpreted procedural programming language. Tamil keywords and grammar are chosen to make the native Tamil speaker write programs in the Ezhil system. Ezhil allows easy representation of computer program closer to the Tamil language logical constructs equivalent to the conditional, branch and loop statements in modern English based programming languages. Ezhil is a compact programming language aimed towards Tamil speaking novice computer users. Grammar for Ezh...

Plexin A3 and turnout regulate motor axonal branch morphogenesis in zebrafish.

Directory of Open Access Journals (Sweden)

Rajiv Sainath

Full Text Available During embryogenesis motor axons navigate to their target muscles, where individual motor axons develop complex branch morphologies. The mechanisms that control axonal branching morphogenesis have been studied intensively, yet it still remains unclear when branches begin to form or how branch locations are determined. Live cell imaging of individual zebrafish motor axons reveals that the first axonal branches are generated at the ventral extent of the myotome via bifurcation of the growth cone. Subsequent branches are generated by collateral branching restricted to their synaptic target field along the distal portion of the axon. This precisely timed and spatially restricted branching process is disrupted in turnout mutants we identified in a forward genetic screen. Molecular genetic mapping positioned the turnout mutation within a 300 kb region encompassing eight annotated genes, however sequence analysis of all eight open reading frames failed to unambiguously identify the turnout mutation. Chimeric analysis and single cell labeling reveal that turnout function is required cell non-autonomously for intraspinal motor axon guidance and peripheral branch formation. turnout mutant motor axons form the first branch on time via growth cone bifurcation, but unlike wild-type they form collateral branches precociously, when the growth cone is still navigating towards the ventral myotome. These precocious collateral branches emerge along the proximal region of the axon shaft typically devoid of branches, and they develop into stable, permanent branches. Furthermore, we find that null mutants of the guidance receptor plexin A3 display identical motor axon branching defects, and time lapse analysis reveals that precocious branch formation in turnout and plexin A3 mutants is due to increased stability of otherwise short-lived axonal protrusions. Thus, plexin A3 dependent intrinsic and turnout dependent extrinsic mechanisms suppress collateral branch

Branching is coordinated with mitosis in growing hyphae of Aspergillus nidulans

DEFF Research Database (Denmark)

Dynesen, Jens Østergaard; Nielsen, Jens

2003-01-01

Filamentous fungi like Aspergillus nidulans can effectively colonize their surroundings by the formation of new branches along the existing hyphae. While growth conditions, chemical perturbations, and mutations affecting branch formation have received great attention during the last decades......, the mechanisms that regulates branching is still poorly understood. In this study, a possible relation between cell cycle progression and branching was studied by testing the effect of a nuclei distribution mutation, cell cycle inhibitors. and conditional cell cycle mutations in combination with tip......-growth inhibitors and varying substrate concentrations on branch initiation. Formation of branches was blocked after inhibition of nuclear division, which was not caused by a reduced growth rate. In hyphae of a nuclei distribution mutant branching was severely reduced in anucleated hyphae whereas the number...

Groundwater availability in the Crouch Branch and McQueen Branch aquifers, Chesterfield County, South Carolina, 1900-2012

Science.gov (United States)

Campbell, Bruce G.; Landmeyer, James E.

2014-01-01

, totaled about 1,117 square miles. Major types of data used as input to the model included groundwater levels, groundwater-use data, and hydrostratigraphic data, along with estimates and measurements of stream base flows made specifically for this study. The groundwater-flow model was calibrated to groundwater-level and stream base-flow conditions from 1900 to 2012 using 39 stress periods. The model was calibrated with an automated parameter-estimation approach using the computer program PEST, and the model used regularized inversion and pilot points. The groundwater-flow model was calibrated using field data that included groundwater levels that had been collected between 1940 and 2012 from 239 wells and base-flow measurements from 44 locations distributed within the study area. To better understand recharge and inter-aquifer interactions, seven wells were equipped with continuous groundwater-level recording equipment during the course of the study, between 2008 and 2012. These water levels were included in the model calibration process. The observed groundwater levels were compared to the simulated ones, and acceptable calibration fits were achieved. Root mean square error for the simulated groundwater levels compared to all observed groundwater levels was 9.3 feet for the Crouch Branch aquifer and 8.6 feet for the McQueen Branch aquifer. The calibrated groundwater-flow model was then used to calculate groundwater budgets for the entire study area and for two sub-areas. The sub-areas are the Alligator Rural Water and Sewer Company well field near McBee, South Carolina, and the Carolina Sandhills National Wildlife Refuge acquisition boundary area. For the overall model area, recharge rates vary from 56 to 1,679 million gallons per day (Mgal/d) with a mean of 737 Mgal/d over the simulation period (1900–2012). The simulated water budget for the streams and rivers varies from 653 to 1,127 Mgal/d with a mean of 944 Mgal/d. The simulated “storage-in term” ranges from 0

Applications of Genetic Programming

DEFF Research Database (Denmark)

Gaunholt, Hans; Toma, Laura

1996-01-01

In this report a study of genetic programming (GP) has been performed with respect to a number of applications such as Symbolic function regression, Solving Symbolic Differential Equations, Image encoding, the ant problem etc.......In this report a study of genetic programming (GP) has been performed with respect to a number of applications such as Symbolic function regression, Solving Symbolic Differential Equations, Image encoding, the ant problem etc....

Branch formation induced by microbeam irradiation of Adiantum protonemata

International Nuclear Information System (INIS)

Wada, M.

1998-01-01

Branches were induced in centrifuged Adiantum protonemal cells by partial irradiation with polarized red light. Nuclear behavior and microtubule pattern change during branch formation were investigated. A branch formed at any part where a red microbeam was focused along a long apical cell. The nucleus moved towards the irradiated area and remained there until a branch developed. The pattern of microtubules changed from parallel to oblique at the irradiated area and then a transverse arrangement of microtubules appeared on both sides of the area. It appeared as if the nucleus was suspended between two microtubule rings. This nuclear behavior and the changes in microtubule pattern were different from those observed during branch formation under whole cell irradiation. From the results of this work we suggest that there is an importance for precise control of experimental conditions

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…

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…

Self-patching firmware program

International Nuclear Information System (INIS)

Stanchi, L.

1976-12-01

A method of branching to an auxiliary program without any hardware or software modification at the time the auxiliary program will be written is described. Suitable statements in the main program are already prepared to accept a future program that will be written in machine language. The main program is stored as firmware in PROM memory, while the auxiliary program is loaded into RAM memory. The method is described for the Intel 8080 microprocessor, but can be generalized for any microprocessor or minicomputer that uses ROMs or PROMs. 1 figure, 2 tables

The normal distribution of thoracoabdominal aorta small branch artery ostia

International Nuclear Information System (INIS)

Cronin, Paul; Williams, David M.; Vellody, Ranjith; Kelly, Aine Marie; Kazerooni, Ella A.; Carlos, Ruth C.

2011-01-01

The purpose of this study was to determine the normal distribution of aortic branch artery ostia. CT scans of 100 subjects were retrospectively reviewed. The angular distributions of the aorta with respect to the center of the T3 to L4 vertebral bodies, and of branch artery origins with respect to the center of the aorta were measured. At each vertebral body level the distribution of intercostal/lumbar arteries and other branch arteries were calculated. The proximal descending aorta is posteriorly placed becoming a midline structure, at the thoracolumbar junction, and remains anterior to the vertebral bodies within the abdomen. The intercostal and lumbar artery ostia have a distinct distribution. At each vertebral level from T3 caudally, one intercostal artery originates from the posterior wall of the aorta throughout the thoracic aorta, while the other intercostal artery originates from the medial wall of the descending thoracic aorta high in the chest, posteromedially from the mid-thoracic aorta, and from the posterior wall of the aorta low in the chest. Mediastinal branches of the thoracic aorta originate from the medial and anterior wall. Lumbar branches originate only from the posterior wall of the abdominal aorta. Aortic branch artery origins arise with a bimodal distribution and have a characteristic location. Mediastinal branches of the thoracic aorta originate from the medial and anterior wall. Knowing the location of aortic branch artery ostia may help distinguish branch artery pseudoaneurysms from penetrating ulcers.

Flight Planning Branch NASA Co-op Tour

Science.gov (United States)

Marr, Aja M.

2013-01-01

This semester I worked with the Flight Planning Branch at the NASA Johnson Space Center. I learned about the different aspects of flight planning for the International Space Station as well as the software that is used internally and ISSLive! which is used to help educate the public on the space program. I had the opportunity to do on the job training in the Mission Control Center with the planning team. I transferred old timeline records from the planning team's old software to the new software in order to preserve the data for the future when the software is retired. I learned about the operations of the International Space Station, the importance of good communication between the different parts of the planning team, and enrolled in professional development classes as well as technical classes to learn about the space station.

Directing the Branching Growth of Cuprous Oxide by OH- Ions

Science.gov (United States)

Chen, Kunfeng; Si, Yunfei; Xue, Dongfeng

The effect of OH- ions on the branching growth of cuprous oxide microcrystals was systematically studied by a reduction route, where copper-citrate complexes were reduced by glucose under alkaline conditions. Different copper salts including Cu(NO3)2, CuCl2, CuSO4, and Cu(Ac)2 were used in this work. The results indicate that the Cu2O branching growth habit is closely correlated to the concentration of OH- ions, which plays an important role in directing the diffusion-limited branching growth of Cu2O and influencing the reduction power of glucose. A variety of Cu2O branching patterns including 6-pod, 8-pod and 24-pod branches, have been achieved without using template and surfactant. The current method can provide a good platform for studying the growth mechanism of microcrystal branching patterns.

["Habitual" left branch block alternating with 2 "disguised" bracnch block].

Science.gov (United States)

Lévy, S; Jullien, G; Mathieu, P; Mostefa, S; Gérard, R

1976-10-01

Two cases of alternating left bundle branch block and "masquerading block" (with left bundle branch morphology in the stnadard leads and right bundle branch block morphology in the precordial leads) were studied by serial tracings and his bundle electrocardiography. In case 1 "the masquerading" block was associated with a first degree AV block related to a prolongation of HV interval. This case is to our knowledge the first cas of alternating bundle branch block in which his bundle activity was recorded in man. In case 2, the patient had atrial fibrilation and His bundle recordings were performed while differents degrees of left bundle branch block were present: The mechanism of the alternation and the concept of "masquerading" block are discussed. It is suggested that this type of block represents a right bundle branch block associated with severe lesions of the "left system".

Medial branch neurotomy in low back pain

International Nuclear Information System (INIS)

Masala, Salvatore; Mammucari, Matteo; Simonetti, Giovanni; Nano, Giovanni; Marcia, Stefano

2012-01-01

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

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

Measurement of the absolute branching ratio of the K+→π+π−π+(γ) decay with the KLOE detector

International Nuclear Information System (INIS)

Babusci, D.; Balwierz-Pytko, I.; Bencivenni, G.; Bloise, C.; Bossi, F.; Branchini, P.; Budano, A.; Caldeira Balkeståhl, L.; Ceradini, F.; Ciambrone, P.; Curciarello, F.; Czerwiński, E.; Danè, E.; De Leo, V.; De Lucia, E.; De Robertis, G.; De Santis, A.; De Simone, P.; Di Cicco, A.

2014-01-01

The absolute branching ratio of the K + →π + π − π + (γ) decay, inclusive of final-state radiation, has been measured using ∼17 million tagged K + mesons collected with the KLOE detector at DAΦNE, the Frascati ϕ-factory. The result is: BR(K + →π + π − π + (γ))=0.05565±0.00031 stat ±0.00025 syst a factor ≃ 5 more precise with respect to the previous result. This work completes the program of precision measurements of the dominant kaon branching ratios at KLOE.

Measurement of Tau Lepton Branching Fractions

Energy Technology Data Exchange (ETDEWEB)

Nicol, N.

2003-12-19

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

Tillering and panicle branching genes in rice.

Science.gov (United States)

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

2014-03-01

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

Programs for data accumulation and storage from the multicrate CAMAC systems basing on the M-6000 computer

International Nuclear Information System (INIS)

Antonichev, G.M.; Shilkin, I.P.; Bespalova, T.V.; Golutvin, I.A.; Maslov, V.V.; Nevskaya, N.A.

1978-01-01

Programs for data accumulation and storage from multicrate CAMAC systems organized in parallel into a branch and connected with the M-6000 computer via the branch interface are described. Program operation in different modes of CAMAC apparatus is described. All the programs operate within the real time disk operation system

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…

Solving the Water Jugs Problem by an Integer Sequence Approach

Science.gov (United States)

Man, Yiu-Kwong

2012-01-01

In this article, we present an integer sequence approach to solve the classic water jugs problem. The solution steps can be obtained easily by additions and subtractions only, which is suitable for manual calculation or programming by computer. This approach can be introduced to secondary and undergraduate students, and also to teachers and…

Tracheobronchial Branching Anomalies

International Nuclear Information System (INIS)

Hong, Min Ji; Kim, Young Tong; Jou, Sung Shick; Park, A Young

2010-01-01

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

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

Modeling of branching density and branching distribution in low-density polyethylene polymerization

NARCIS (Netherlands)

Kim, D.M.; Iedema, P.D.

2008-01-01

Low-density polyethylene (ldPE) is a general purpose polymer with various applications. By this reason, many publications can be found on the ldPE polymerization modeling. However, scission reaction and branching distribution are only recently considered in the modeling studies due to difficulties

Pulsed positive corona streamer propagation and branching

International Nuclear Information System (INIS)

Veldhuizen, E.M. van; Rutgers, W.R.

2002-01-01

The propagation and branching of pulsed positive corona streamers in a short gap is observed with high resolution in space and time. The appearance of the pre-breakdown phenomena can be controlled by the electrode configuration, the gas composition and the impedance of the pulsed power circuit. In a point-wire gap the positive corona shows much more branching than in the parallel plane gap with a protrusion. In air, the branching is more pronounced than in argon. The pulsed power circuit appears to operate in two modes, either as an inductive circuit creating a lower number of thick streamers or as a resistive circuit giving a higher number of thin streamers. A possible cause for branching is electrostatic repulsion of two parts of the streamer head. The electric field at the streamer head is limited, the maximum values found are ∼170 kV cm -1 in air and ∼100 kV cm -1 in argon. At these maximum field strengths, the electrons have 5-10 eV energy, so the ionization is dominated by two-step processes. Differences between argon and ambient air in the field strength at which streamers propagate are ascribed to the difference in de-excitation processes in noble and molecular gases. The fact that the pulsed power circuit can control the streamer structure is important for applications, but this effect must also be taken into account in fundamental studies of streamer propagation and branching. (author)

Pulsed positive corona streamer propagation and branching

Energy Technology Data Exchange (ETDEWEB)

Veldhuizen, E.M. van [Department of Physics, Technische Universiteit Eindhoven, Eindhoven (Netherlands)]. E-mail: e.m.v.veldhuizen@tue.nl; Rutgers, W.R. [Department of Physics, Technische Universiteit Eindhoven, Eindhoven (Netherlands)

2002-09-07

The propagation and branching of pulsed positive corona streamers in a short gap is observed with high resolution in space and time. The appearance of the pre-breakdown phenomena can be controlled by the electrode configuration, the gas composition and the impedance of the pulsed power circuit. In a point-wire gap the positive corona shows much more branching than in the parallel plane gap with a protrusion. In air, the branching is more pronounced than in argon. The pulsed power circuit appears to operate in two modes, either as an inductive circuit creating a lower number of thick streamers or as a resistive circuit giving a higher number of thin streamers. A possible cause for branching is electrostatic repulsion of two parts of the streamer head. The electric field at the streamer head is limited, the maximum values found are {approx}170 kV cm{sup -1} in air and {approx}100 kV cm{sup -1} in argon. At these maximum field strengths, the electrons have 5-10 eV energy, so the ionization is dominated by two-step processes. Differences between argon and ambient air in the field strength at which streamers propagate are ascribed to the difference in de-excitation processes in noble and molecular gases. The fact that the pulsed power circuit can control the streamer structure is important for applications, but this effect must also be taken into account in fundamental studies of streamer propagation and branching. (author)

Concise review: can the intrinsic power of branching morphogenesis be used for engineering epithelial tissues and organs?

Science.gov (United States)

Nigam, Sanjay K

2013-12-01

Branching morphogenesis is critical to the development of organs such as kidney, lung, mammary gland, prostate, pancreas, and salivary gland. Essentially, an epithelial bud becomes an iterative tip-stalk generator (ITSG) able to form a tree of branching ducts and/or tubules. In different organs, branching morphogenesis is governed by similar sets of genes. Epithelial branching has been recapitulated in vitro (or ex vivo) using three-dimensional cell culture and partial organ culture systems, and several such systems relevant to kidney tissue engineering are discussed here. By adapting systems like these it may be possible to harness the power inherent in the ITSG program to propagate and engineer epithelial tissues and organs. It is also possible to conceive of a universal ITSG capable of propagation that may, by recombination with organ-specific mesenchymal cells, be used for engineering many organ-like tissues similar to the organ from which the mesenchyme cells were derived, or toward which they are differentiated (from stem cells). The three-dimensional (3D) branched epithelial structure could act as a dynamic branching cellular scaffold to establish the architecture for the rest of the tissue. Another strategy-that of recombining propagated organ-specific ITSGs in 3D culture with undifferentiated mesenchymal stem cells-is also worth exploring. If feasible, such engineered tissues may be useful for the ex vivo study of drug toxicity, developmental biology, and physiology in the laboratory. Over the long term, they have potential clinical applications in the general fields of transplantation, regenerative medicine, and bioartificial medical devices to aid in the treatment of chronic kidney disease, diabetes, and other diseases.

Solving a discrete model of the lac operon using Z3

Science.gov (United States)

Gutierrez, Natalia A.

2014-05-01

A discrete model for the Lcac Operon is solved using the SMT-solver Z3. Traditionally the Lac Operon is formulated in a continuous math model. This model is a system of ordinary differential equations. Here, it was considerated as a discrete model, based on a Boolean red. The biological problem of Lac Operon is enunciated as a problem of Boolean satisfiability, and it is solved using an STM-solver named Z3. Z3 is a powerful solver that allows understanding the basic dynamic of the Lac Operon in an easier and more efficient way. The multi-stability of the Lac Operon can be easily computed with Z3. The code that solves the Boolean red can be written in Python language or SMT-Lib language. Both languages were used in local version of the program as online version of Z3. For future investigations it is proposed to solve the Boolean red of Lac Operon using others SMT-solvers as cvc4, alt-ergo, mathsat and yices.

Results of the Quarterly Tritium Survey of Fourmile Branch and Its Seeplines in the F and H Areas of SRS: May 1995

International Nuclear Information System (INIS)

Koch, J.W.; Dixon, K.L.

1995-01-01

The Environmental Sciences Section of the Savannah River Technology Center established a quarterly monitoring program of the Fourmile Branch stream and its associated seepline located down gradient from the F- and H-Area Seepage Basins. The primary focus of this program was to survey and track changes in tritium levels; however, specific conductivity, and pH were also surveyed and tracked. The measurement from the eleventh survey (May 1995) exhibited similar tritium levels, conductivity measurements, and pH values to data from previous sampling events. The overall results of the tritium survey and stream monitoring data (Looney et al., 1993) indicate that the tritium plume resulting from the past operation of the seepage basins continues to flush from the Fourmile Branch wetland system

Investigation of the relative effects of vascular branching structure and gravity on pulmonary arterial blood flow heterogeneity via an image-based computational model.

Science.gov (United States)

Burrowes, Kelly S; Hunter, Peter J; Tawhai, Merryn H

2005-11-01

A computational model of blood flow through the human pulmonary arterial tree has been developed to investigate the relative influence of branching structure and gravity on blood flow distribution in the human lung. Geometric models of the largest arterial vessels and lobar boundaries were first derived using multidetector row x-ray computed tomography (MDCT) scans. Further accompanying arterial vessels were generated from the MDCT vessel endpoints into the lobar volumes using a volume-filling branching algorithm. Equations governing the conservation of mass and momentum were solved within the geometric model to calculate pressure, velocity, and vessel radius. Blood flow results in the anatomically based model, with and without gravity, and in a symmetric geometric model were compared to investigate their relative contributions to blood flow heterogeneity. Results showed a persistent blood flow gradient and flow heterogeneity in the absence of gravitational forces in the anatomically based model. Comparison with flow results in the symmetric model revealed that the asymmetric vascular branching structure was largely responsible for producing this heterogeneity. Analysis of average results in varying slice thicknesses illustrated a clear flow gradient because of gravity in "lower resolution" data (thicker slices), but on examination of higher resolution data, a trend was less obvious. Results suggest that although gravity does influence flow distribution, the influence of the tree branching structure is also a dominant factor. These results are consistent with high-resolution experimental studies that have demonstrated gravity to be only a minor determinant of blood flow distribution.

Reproductive success and mortality rates of Ceriodaphnia dubia maintained in water from Upper Three Runs, Pen Branch, and Fourmile Branch

International Nuclear Information System (INIS)

Specht, W.L.

1994-12-01

It is anticipated that the new SRS NPDES permit will require toxicity testing of at numerous outfalls and receiving streams, using the standard test species, Ceriodaphnia dubia. Because SRS surface waters differ markedly from the standard culture water that is used for Ceriodaphnia, studies were undertaken to determine if unimpacted SRS surface waters will support this species. Three SRS surface waters were evaluated; Upper Three Runs at Road 8-1, Pen Branch at Road B, and Fourmile Branch at Road F. Toxicity tests were performed monthly on each water source for eleven months. All three water sources exhibited varying degrees of toxicity to Ceriodaphnia, with Pen Branch being the least toxic and Fourmile Branch being the most toxic. These results indicate that if in-stream toxicity testing is required, it may not be possible to separate the naturally occurring toxic effects of the receiving water from possible toxic effects of SRS effluents

Compilation of contract research for the Materials Engineering Branch, Division of Engineering Technology. Annual report for FY 1983. Vol.2

International Nuclear Information System (INIS)

1984-03-01

This report presents summaries of the research work performed during Fiscal Year 1983 by laboratories and organizations under contracts administered by the NRC's Materials Engineering Branch, Office of Nuclear Regulatory Research. Each contractor has written a more complete and detailed annual report of their work which can be obtained by writing to NRC. The contractor reports are organized into the major areas of concern to Primary System Integrity, which is the main focus for the branch's research. These areas are: Vessel and Piping Fracture Mechanics; Pressure Vesel Surveillance Dosimetry; Steam Generators, Aging, and Environmental Cracking; and Non-Destructive Examination. The research programs reported provide information on the overall program objectives, a more limited scope of work for FY 1983, a technical description of the year's work, and a brief forecast of the plans for continuing work

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

Exciton scattering approach for optical spectra calculations in branched conjugated macromolecules

International Nuclear Information System (INIS)

Li, Hao; Wu, Chao; Malinin, Sergey V.; Tretiak, Sergei; Chernyak, Vladimir Y.

2016-01-01

The exciton scattering (ES) technique is a multiscale approach based on the concept of a particle in a box and developed for efficient calculations of excited-state electronic structure and optical spectra in low-dimensional conjugated macromolecules. Within the ES method, electronic excitations in molecular structure are attributed to standing waves representing quantum quasi-particles (excitons), which reside on the graph whose edges and nodes stand for the molecular linear segments and vertices, respectively. Exciton propagation on the linear segments is characterized by the exciton dispersion, whereas exciton scattering at the branching centers is determined by the energy-dependent scattering matrices. Using these ES energetic parameters, the excitation energies are then found by solving a set of generalized “particle in a box” problems on the graph that represents the molecule. Similarly, unique energy-dependent ES dipolar parameters permit calculations of the corresponding oscillator strengths, thus, completing optical spectra modeling. Both the energetic and dipolar parameters can be extracted from quantum-chemical computations in small molecular fragments and tabulated in the ES library for further applications. Subsequently, spectroscopic modeling for any macrostructure within a considered molecular family could be performed with negligible numerical effort. We demonstrate the ES method application to molecular families of branched conjugated phenylacetylenes and ladder poly-para-phenylenes, as well as structures with electron donor and acceptor chemical substituents. Time-dependent density functional theory (TD-DFT) is used as a reference model for electronic structure. The ES calculations accurately reproduce the optical spectra compared to the reference quantum chemistry results, and make possible to predict spectra of complex macromolecules, where conventional electronic structure calculations are unfeasible.

Exciton scattering approach for optical spectra calculations in branched conjugated macromolecules

Science.gov (United States)

Li, Hao; Wu, Chao; Malinin, Sergey V.; Tretiak, Sergei; Chernyak, Vladimir Y.

2016-12-01

The exciton scattering (ES) technique is a multiscale approach based on the concept of a particle in a box and developed for efficient calculations of excited-state electronic structure and optical spectra in low-dimensional conjugated macromolecules. Within the ES method, electronic excitations in molecular structure are attributed to standing waves representing quantum quasi-particles (excitons), which reside on the graph whose edges and nodes stand for the molecular linear segments and vertices, respectively. Exciton propagation on the linear segments is characterized by the exciton dispersion, whereas exciton scattering at the branching centers is determined by the energy-dependent scattering matrices. Using these ES energetic parameters, the excitation energies are then found by solving a set of generalized "particle in a box" problems on the graph that represents the molecule. Similarly, unique energy-dependent ES dipolar parameters permit calculations of the corresponding oscillator strengths, thus, completing optical spectra modeling. Both the energetic and dipolar parameters can be extracted from quantum-chemical computations in small molecular fragments and tabulated in the ES library for further applications. Subsequently, spectroscopic modeling for any macrostructure within a considered molecular family could be performed with negligible numerical effort. We demonstrate the ES method application to molecular families of branched conjugated phenylacetylenes and ladder poly-para-phenylenes, as well as structures with electron donor and acceptor chemical substituents. Time-dependent density functional theory (TD-DFT) is used as a reference model for electronic structure. The ES calculations accurately reproduce the optical spectra compared to the reference quantum chemistry results, and make possible to predict spectra of complex macromolecules, where conventional electronic structure calculations are unfeasible.

Exciton scattering approach for optical spectra calculations in branched conjugated macromolecules

Energy Technology Data Exchange (ETDEWEB)

Li, Hao [Department of Chemistry, University of Houston, Houston, TX 77204 (United States); Wu, Chao [Electronic Structure Lab, Center of Microscopic Theory and Simulation, Frontier Institute of Science and Technology, Xian Jiaotong University, Xian 710054 (China); Malinin, Sergey V. [Department of Chemistry, Wayne State University, 5101 Cass Avenue, Detroit, MI 48202 (United States); Tretiak, Sergei, E-mail: serg@lanl.gov [Theoretical Division and Center for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, NM 87545 (United States); Center for Integrated Nanotechnologies, Los Alamos National Laboratory, Los Alamos, NM 87545 (United States); Chernyak, Vladimir Y., E-mail: chernyak@chem.wayne.edu [Department of Chemistry, Wayne State University, 5101 Cass Avenue, Detroit, MI 48202 (United States)

2016-12-20

The exciton scattering (ES) technique is a multiscale approach based on the concept of a particle in a box and developed for efficient calculations of excited-state electronic structure and optical spectra in low-dimensional conjugated macromolecules. Within the ES method, electronic excitations in molecular structure are attributed to standing waves representing quantum quasi-particles (excitons), which reside on the graph whose edges and nodes stand for the molecular linear segments and vertices, respectively. Exciton propagation on the linear segments is characterized by the exciton dispersion, whereas exciton scattering at the branching centers is determined by the energy-dependent scattering matrices. Using these ES energetic parameters, the excitation energies are then found by solving a set of generalized “particle in a box” problems on the graph that represents the molecule. Similarly, unique energy-dependent ES dipolar parameters permit calculations of the corresponding oscillator strengths, thus, completing optical spectra modeling. Both the energetic and dipolar parameters can be extracted from quantum-chemical computations in small molecular fragments and tabulated in the ES library for further applications. Subsequently, spectroscopic modeling for any macrostructure within a considered molecular family could be performed with negligible numerical effort. We demonstrate the ES method application to molecular families of branched conjugated phenylacetylenes and ladder poly-para-phenylenes, as well as structures with electron donor and acceptor chemical substituents. Time-dependent density functional theory (TD-DFT) is used as a reference model for electronic structure. The ES calculations accurately reproduce the optical spectra compared to the reference quantum chemistry results, and make possible to predict spectra of complex macromolecules, where conventional electronic structure calculations are unfeasible.

WWC Review of the Report "The Effects of Cognitive Strategy Instruction on Math Problem Solving of Middle School Students of Varying Ability." What Works Clearinghouse Single Study Review

Science.gov (United States)

What Works Clearinghouse, 2014

2014-01-01

A recent study, "The Effects of Cognitive Strategy Instruction on Math Problem Solving of Middle School Students of Varying Ability," examined the effectiveness of "Solve It!," a program intended to improve the problem-solving skills of seventh-grade math students. During the program, students are taught cognitive strategies of…

Secondary motion in three-dimensional branching networks

Science.gov (United States)

Guha, Abhijit; Pradhan, Kaustav

2017-06-01

A major aim of the present work is to understand and thoroughly document the generation, the three-dimensional distribution, and the evolution of the secondary motion as the fluid progresses downstream through a branched network. Six generations (G0-G5) of branches (involving 63 straight portions and 31 bifurcation modules) are computed in one go; such computational challenges are rarely taken in the literature. More than 30 × 106 computational elements are employed for high precision of computed results and fine quality of the flow visualization diagrams. The study of co-planar vis-à-vis non-planar space-filling configurations establishes a quantitative evaluation of the dependence of the fluid dynamics on the three-dimensional arrangement of the same individual branches. As compared to the secondary motion in a simple curved pipe, three distinctive features, viz., the change of shape and size of the flow-cross-section, the division of non-uniform primary flow in a bifurcation module, and repeated switchover from clockwise to anticlockwise curvature and vice versa in the flow path, make the present situation more complex. It is shown that the straight portions in the network, in general, attenuate the secondary motion, while the three-dimensionally complex bifurcation modules generate secondary motion and may alter the number, arrangement, and structure of vortices. A comprehensive picture of the evolution of quantitative flow visualizations of the secondary motion is achieved by constructing contours of secondary velocity | v → S | , streamwise vorticity ω S , and λ 2 iso-surfaces. It is demonstrated, for example, that for in-plane configuration, the vortices on any plane appear in pair (i.e., for each clockwise rotating vortex, there is an otherwise identical anticlockwise vortex), whereas the vortices on a plane for the out-of-plane configuration may be dissimilar, and there may even be an odd number of vortices. We have formulated three new parameters

A Global Optimization Algorithm for Sum of Linear Ratios Problem

OpenAIRE

Yuelin Gao; Siqiao Jin

2013-01-01

We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the c...

The influence of flexible branches in flexible polymers

International Nuclear Information System (INIS)

Wescott, J.T.

1998-06-01

In this work the influence of branches in flexible polymer systems has been investigated by consideration of (1) the behaviour of isolated poly-α-olefin chains and (2) the p -T phase behaviour of poly(4-methylpentene-1)(P4MP1). Molecular dynamics simulations of isolated poly-α-olefins were performed in order to gauge directly the effect of molecular structure on chain dimensions, flexibility (via the persistence length) and shape. Under Θ-conditions the addition of short linear branches was shown to increase the flexibility of the backbone. In conditions of good solvent, however, the effect of longer and bulkier branches was to increase the persistence length and average size of the coil with the arrangement of side chain atoms making a small difference. The side branches themselves also affected the solvent conditions experienced by the backbone, behaving much like bound solvent. Consideration of ethylene-α-olefin copolymers, where the branch content was varied from 0-50%, showed that under good solvent conditions the branches increased the chain stiffness only when the gap between side branches was less than five backbone carbon atoms. The backbone torsions were also shown to play an important role in determining these trends. For comparison with the above simulations, persistence length values for polyethylene (= 7.3±0.2A) and P4MP1 (=7.6±0.3A) were measured experimentally by neutron scattering in dilute solution. A value of 6.7±0.5 for the characteristic ratio of PE was also calculated. To investigate the role of a bulky side group in crystalline phases, wide angle X-ray diffraction experiments using a Hikosaka pressure cell were performed on P4MP1. Computer modelling, utilising the experimental data obtained, determined the structure of a disordered phase produced at room temperature and a new high pressure/high temperature phase. The disordered phase was found to be due to a collapse of the backbone combined with some disordering of the side chains

The Comparison of assertiveness level of physically disabled athletes who played in different sport branches.

Directory of Open Access Journals (Sweden)

Gonca İNCE

2017-03-01

Full Text Available Aim: The aim of this study was the comparison of assertiveness level of physically disabled athletes who played in different sport branches. Material and Methods: Totally 60 disabled athletes (35 athletes, 25 swimmers joined in to the study voluntarily. The means of ages, sports year and sport statues were found 19.73±5.08, 2.48±1.75 years, day number in per week:3.63±1.52, hour numberin per day: 2.91±1.53 respectively. Rathus Assertiveness Schedule was used for evaluating assertiveness and questionnaire of athletes' demograpic features was performed by researcher. For statistical analyses, the SPSS 11.5 computer packet program (frequency, mean, standard deviation and independent t test was performed. Results: We say that no association was detected between branches (p>0.05. The means of assertiveness of swimmers and athletes were found 14.67±6.62, 12.70±4.67 respectively. Both swimming (19 person, %76 and athletics (25 person, %71.4 were seen shyness more than assertiveness. Conclusions: We think that branches of different sports may be alike effect on the assertiveness characteristics of the physically disabled individuals.

Outcomes of fenestrated and branched endovascular repair of complex abdominal and thoracoabdominal aortic aneurysms.

Science.gov (United States)

Schanzer, Andres; Simons, Jessica P; Flahive, Julie; Durgin, Jonathan; Aiello, Francesco A; Doucet, Danielle; Steppacher, Robert; Messina, Louis M

2017-09-01

More than 80% of infrarenal aortic aneurysms are treated by endovascular repair. However, adoption of fenestrated and branched endovascular repair for complex aortic aneurysms has been limited, despite high morbidity and mortality associated with open repair. There are few published reports of consecutive outcomes, inclusive of all fenestrated and branched endovascular repairs, starting from the inception of a complex aortic aneurysm program. Therefore, we examined a single center's consecutive experience of fenestrated and branched endovascular repair of complex aortic aneurysms. This is a single-center, prospective, observational cohort study evaluating 30-day and 1-year outcomes in all consecutive patients who underwent fenestrated and branched endovascular repair of complex aortic aneurysms (definition: requiring one or more fenestrations or branches). Data were collected prospectively through an Institutional Review Board-approved registry and a physician-sponsored investigational device exemption clinical trial (G130210). We performed 100 consecutive complex endovascular aortic aneurysm repairs (November 2010 to March 2016) using 58 (58%) commercially manufactured custom-made devices and 42 (42%) physician-modified devices to treat 4 (4%) common iliac, 42 (42%) juxtarenal, 18 (18%) pararenal, and 36 (36%) thoracoabdominal aneurysms (type I, n = 1; type II, n = 4; type III, n = 12; type IV, n = 18; arch, n = 1). The repairs included 309 fenestrations, branches, and scallops (average of 3.1 branch arteries/case). All patients had 30-day follow-up for 30-day event rates: three (3%) deaths; six (6%) target artery occlusions; five (5%) progressions to dialysis; eight (8%) access complications; one (1%) paraparesis; one (1%) bowel ischemia; and no instances of myocardial infarction, paralysis, or stroke. Of 10 type I or type III endoleaks, 8 resolved (7 with secondary intervention, 1 without intervention). Mean follow-up time was 563 days (interquartile range

Coalitions and family problem solving with preadolescents in referred, at-risk, and comparison families.

Science.gov (United States)

Vuchinich, S; Wood, B; Vuchinich, R

1994-12-01

This study tested the hypothesis that the mother-father coalition, parent-child coalitions, and parental warmth expressed toward the child are associated with family problem solving in families with a preadolescent child referred for treatment of behavior problems (n = 30), families with a child at-risk for conduct disorder (n = 68), and a sample of comparison families (n = 90). Referred and at-risk families displayed less effective problem solving. A regression analysis, which controlled for gender of the child, family structure, family income, marital satisfaction, and severity of child problems, showed that strong parental coalitions were linked to low levels of family problem solving in at-risk and referred families. Parent-child coalitions had little apparent impact while parental warmth was highly correlated with better family problem solving. The results may be interpreted as evidence for a tendency for parents in at-risk and referred families to "scapegoat" a preadolescent during family problem-solving sessions. This may undermine progress on family problem solutions and may complicate family-based prevention and treatment programs that use family problem-solving sessions.

Neural network error correction for solving coupled ordinary differential equations

Science.gov (United States)

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

1992-01-01

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

Algorithms for solving the single-sink fixed-charge transportation problem

DEFF Research Database (Denmark)

Klose, Andreas

2006-01-01

The single-sink fixed-charge transportation problem is an important subproblem of the fixed-charge transportation problem. Just a few methods have been proposed in the literature to solve this problem. In this paper, solution approaches based on dynamic programming and implicit enumeration...... are revisited. It is shown how the problem size as well as the search space of a recently published dynamic programming method can be reduced by exploiting reduced cost information. Additionally, a further implicit enumeration approach relying on solution concepts for the binary knapsack problem is introduced...

Cavity design programs

International Nuclear Information System (INIS)

Nelson, E.M.

1996-01-01

Numerous computer programs are available to help accelerator physicists and engineers model and design accelerator cavities and other microwave components. This article discusses the problems these programs solve and the principles upon which these programs are based. Some examples of how these programs are used in the design of accelerator cavities are also given

The Horizontal Branch of the Sculptor Dwarf galaxy

NARCIS (Netherlands)

Salaris, Maurizio; de Boer, Thomas; Tolstoy, Eline; Fiorentino, Giuliana; Cassisi, Santi

2013-01-01

We have performed the first detailed simulation of the horizontal branch of the Sculptor dwarf spheroidal galaxy by means of synthetic modelling techniques, taking consistently into account the star formation history and metallicity evolution as determined from the main sequence and red giant branch

Critical Age-Dependent Branching Markov Processes and their ...

Indian Academy of Sciences (India)

This paper studies: (i) the long-time behaviour of the empirical distribution of age and normalized position of an age-dependent critical branching Markov process conditioned on non-extinction; and (ii) the super-process limit of a sequence of age-dependent critical branching Brownian motions.

Practice for beginners programming lesson using App Lab: Introduction of programming learning for undergraduate students

OpenAIRE

榊原, 直樹

2017-01-01

App Lab is an online programming education environment. It was designed classes of programming for beginners using the App Lab. Through 15 lessons of the class, it was to understand the basic structure of the programming of the sequential-repetition-branch. Students were allowed to complete the game as a final project. The effectiveness of App the Lab has been confirmed from these results.

The Cross-Contextual Transfer of Problem Solving Strategies from Logo to Non-Computer Domains.

Science.gov (United States)

Swan, Karen; Black, John B.

This report investigated the relationship between learning to program LOGO and the development of problem solving skills. Subjects were 133 students in grades 4-8 who had at least 30 hours of experience with both graphics and lists programming in Logo. Students were randomly assigned to one of three contextual groupings, which received graphics,…

Semiconductor device simulation by a new method of solving poisson, Laplace and Schrodinger equations

International Nuclear Information System (INIS)

Sharifi, M. J.; Adibi, A.

2000-01-01

In this paper, we have extended and completed our previous work, that was introducing a new method for finite differentiation. We show the applicability of the method for solving a wide variety of equations such as poisson, Laplace and Schrodinger. These equations are fundamental to the most semiconductor device simulators. In a section, we solve the Shordinger equation by this method in several cases including the problem of finding electron concentration profile in the channel of a HEMT. In another section, we solve the Poisson equation by this method, choosing the problem of SBD as an example. Finally we solve the Laplace equation in two dimensions and as an example, we focus on the VED. In this paper, we have shown that, the method can get stable and precise results in solving all of these problems. Also the programs which have been written based on this method become considerably faster, more clear, and more abstract