Sufahani, Suliadi; Ghazali Kamardan, M.; Saifullah Rusiman, Mohd; Mohamad, Mahathir; Khalid, Kamil; Ali, Maselan; Khalid, Kamal; Nawawi, MKM; Ahmad, Asmala
2018-04-01
A solid body needs adequate supplements from nourishment that we eat each day. Eating pretty much than what our body needs will prompt lack of healthy sustenance (under-nourishment and over-nourishment). In Malaysia, a few reviews have been directed to examine the wholesome status of Malaysians, particularly among youngsters and youths. However there are different methods for taking care of the menu arranging issue and in this paper Binary Programming (BP) is executed. Separately, “Additive Technique (AT)” and “Branch and Bound Technique (BBT)” are utilized as a part of BP. Both methodologies utilize diverse systems and might yield distinctive ideal arrangements. Along these lines, this study expects to build up a scientific model for eating regimen arranging that meets the essential supplement admission and look at the outcomes yield through additive substance and branch and bound methodologies. The information was gathered from different all inclusive schools and furthermore from the Ministry of Education. The model was illuminated by utilizing the Balas Algorithm through AT and Binary Programming through BBT.
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 Problem-Solving Skills of the Teachers in Various Branches
Temel, Veysel
2015-01-01
The aim of this study was to determine the problem-solving skills of the teachers in various branches in Çat town of Erzurum Province in Turkey, using some variables. A total of 153 teachers (84 females, 69 males and age: 1.6536±0.72837) from different departments participated in the study. Problem Solving Inventory, developed by Heppner and…
Photovoltaic Program Branch annual report, FY 1989
Energy Technology Data Exchange (ETDEWEB)
Summers, K A [ed.
1990-03-01
This report summarizes the progress of the Photovoltaic (PV) Program Branch of the Solar Energy Research Institute (SERI) from October 1, 1988, through September 30, 1989. The branch is responsible for managing the subcontracted portion of SERI's PV Advanced Research and Development Project. In fiscal year (FY) 1989, this included nearly 50 subcontracts, with a total annualized funding of approximately $13.1 million. Approximately two-thirds of the subcontracts were with universities, at a total funding of nearly $4 million. The six technical sections of the report cover the main areas of the subcontracted program: Amorphous Silicon Research, Polycrystalline Thin Films, Crystalline Silicon Materials Research, High-Efficiency Concepts, New Ideas, and University Participation. Technical summaries of each of the subcontracted programs provide a discussion of approaches, major accomplishments in FY 1989, and future research directions. Each report will be cataloged individually.
PSQP: Puzzle Solving by Quadratic Programming.
Andalo, Fernanda A; Taubin, Gabriel; Goldenstein, Siome
2017-02-01
In this article we present the first effective method based on global optimization for the reconstruction of image puzzles comprising rectangle pieces-Puzzle Solving by Quadratic Programming (PSQP). The proposed novel mathematical formulation reduces the problem to the maximization of a constrained quadratic function, which is solved via a gradient ascent approach. The proposed method is deterministic and can deal with arbitrary identical rectangular pieces. We provide experimental results showing its effectiveness when compared to state-of-the-art approaches. Although the method was developed to solve image puzzles, we also show how to apply it to the reconstruction of simulated strip-shredded documents, broadening its applicability.
A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs
DEFF Research Database (Denmark)
Stidsen, Thomas Riis; Andersen, Kim Allan; Dammann, Bernd
2014-01-01
there is the complicating factor that some of the variables are required to be integral. The resulting class of problems is named multiobjective mixed integer programming (MOMIP) problems. Solving these kinds of optimization problems exactly requires a method that can generate the whole set of nondominated points (the...... Pareto-optimal front). In this paper, we first give a survey of the newly developed branch and bound methods for solving MOMIP problems. After that, we propose a new branch and bound method for solving a subclass of MOMIP problems, where only two objectives are allowed, the integer variables are binary......, and one of the two objectives has only integer variables. The proposed method is able to find the full set of nondominated points. It is tested on a large number of problem instances, from six different classes of MOMIP problems. The results reveal that the developed biobjective branch and bound method...
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.
On Computational Power of Quantum Read-Once Branching Programs
Directory of Open Access Journals (Sweden)
Farid Ablayev
2011-03-01
Full Text Available In this paper we review our current results concerning the computational power of quantum read-once branching programs. First of all, based on the circuit presentation of quantum branching programs and our variant of quantum fingerprinting technique, we show that any Boolean function with linear polynomial presentation can be computed by a quantum read-once branching program using a relatively small (usually logarithmic in the size of input number of qubits. Then we show that the described class of Boolean functions is closed under the polynomial projections.
Programming languages for business problem solving
Wang, Shouhong
2007-01-01
It has become crucial for managers to be computer literate in today's business environment. It is also important that those entering the field acquire the fundamental theories of information systems, the essential practical skills in computer applications, and the desire for life-long learning in information technology. Programming Languages for Business Problem Solving presents a working knowledge of the major programming languages, including COBOL, C++, Java, HTML, JavaScript, VB.NET, VBA, ASP.NET, Perl, PHP, XML, and SQL, used in the current business computing environment. The book examin
A note on solving large-scale zero-one programming problems
Adema, Jos J.
1988-01-01
A heuristic for solving large-scale zero-one programming problems is provided. The heuristic is based on the modifications made by H. Crowder et al. (1983) to the standard branch-and-bound strategy. First, the initialization is modified. The modification is only useful if the objective function
The Coin Problem and Pseudorandomness for Branching Programs
DEFF Research Database (Denmark)
Brody, Joshua; Verbin, Elad
2010-01-01
in the model of emph{read-once width-$w$ branching programs}. We prove that in order to succeed in this model, $beta$ must be at least $1/ (log n)^{Theta(w)}$. For constant $w$ this is tight by considering the recursive tribes function, and for other values of $w$ this is nearly tight by considering other read...... be distinguished by small-width read-once branching programs. We suggest one application for this kind of theorems: we prove that Nisan's Generator fools width-$w$ read-once emph{regular} branching programs, using seed length $O(w^4 log n log log n + log n log (1/eps))$. For $w=eps=Theta(1)$, this seed length...
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.
Agriculture and Food Processes Branch program summary document
Energy Technology Data Exchange (ETDEWEB)
None
1980-06-01
The work of the Agriculture and Food Processes Branch within the US DOE's Office of Industrial Programs is discussed and reviewed. The Branch is responsible for assisting the food and agricultural sectors of the economy in increasing their energy efficiency by cost sharing with industry the development and demonstration of technologies industry by itself would not develop because of a greater than normal risk factor, but have significant energy conservation benefits. This task is made more difficult by the diversity of agriculture and the food industry. The focus of the program is now on the development and demonstration of energy conservation technology in high energy use industry sectors and agricultural functions (e.g., sugar processing, meat processing, irrigation, and crop drying, high energy use functions common to many sectors of the food industry (e.g., refrigeration, drying, and evaporation), and innovative concepts (e.g., energy integrated farm systems. Specific projects within the program are summarized. (LCL)
A branch-and-price algorithm for solving the cutting strips problem
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,
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.
Logo Programming, Problem Solving, and Knowledge-Based Instruction.
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…
An approach for solving linear fractional programming problems ...
African Journals Online (AJOL)
The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebraically using the concept of duality ...
Problem solving and Program design using the TI-92
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
An Approach for Solving Linear Fractional Programming Problems
Andrew Oyakhobo Odior
2012-01-01
Linear fractional programming problems are useful tools in production planning, financial and corporate planning, health care and hospital planning and as such have attracted considerable research interest. The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebr...
Emotion Oriented Programming: Computational Abstractions for AI Problem Solving
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 ...
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 ...
A "feasible direction" search for Lineal Programming problem solving
Directory of Open Access Journals (Sweden)
Jaime U Malpica Angarita
2003-07-01
Full Text Available The study presents an approach to solve linear programming problems with no artificial variables. A primal linear minimization problem is standard form and its associated dual linear maximization problem are used. Initially, the dual (or a partial dual program is solved by a "feasible direction" search, where the Karush-Kuhn-Tucker conditions help to verify its optimality and then its feasibility. The "feasible direction" search exploits the characteristics of the convex polyhedron (or prototype formed by the dual program constraints to find a starting point and then follows line segments, whose directions are found in afine subspaces defined by boundary hyperplanes of polyhedral faces, to find next points up to the (an optimal one. Them, the remaining dual constraints not satisfaced at that optimal dual point, if there are any, are handled as nonbasic variables of the primal program, which is to be solved by such "feasible direction" search.
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.
Improve Problem Solving Skills through Adapting Programming Tools
Shaykhian, Linda H.; Shaykhian, Gholam Ali
2007-01-01
There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.
A Branch-and-Bound Algorithm Embedded with DCA for DC Programming
Directory of Open Access Journals (Sweden)
Meihua Wang
2012-01-01
Full Text Available The special importance of Difference of Convex (DC functions programming has been recognized in recent studies on nonconvex optimization problems. In this work, a class of DC programming derived from the portfolio selection problems is studied. The most popular method applied to solve the problem is the Branch-and-Bound (B&B algorithm. However, “the curse of dimensionality” will affect the performance of the B&B algorithm. DC Algorithm (DCA is an efficient method to get a local optimal solution. It has been applied to many practical problems, especially for large-scale problems. A B&B-DCA algorithm is proposed by embedding DCA into the B&B algorithms, the new algorithm improves the computational performance and obtains a global optimal solution. Computational results show that the proposed B&B-DCA algorithm has the superiority of the branch number and computational time than general B&B. The nice features of DCA (inexpensiveness, reliability, robustness, globality of computed solutions, etc. provide crucial support to the combined B&B-DCA for accelerating the convergence of B&B.
An Improved Method for Solving Multiobjective Integer Linear Fractional Programming Problem
Directory of Open Access Journals (Sweden)
Meriem Ait Mehdi
2014-01-01
Full Text Available We describe an improvement of Chergui and Moulaï’s method (2008 that generates the whole efficient set of a multiobjective integer linear fractional program based on the branch and cut concept. The general step of this method consists in optimizing (maximizing without loss of generality one of the fractional objective functions over a subset of the original continuous feasible set; then if necessary, a branching process is carried out until obtaining an integer feasible solution. At this stage, an efficient cut is built from the criteria’s growth directions in order to discard a part of the feasible domain containing only nonefficient solutions. Our contribution concerns firstly the optimization process where a linear program that we define later will be solved at each step rather than a fractional linear program. Secondly, local ideal and nadir points will be used as bounds to prune some branches leading to nonefficient solutions. The computational experiments show that the new method outperforms the old one in all the treated instances.
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.
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.
EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report.
Jarvis, John J.; And Others
Designed for student use in solving linear programming problems, the interactive computer program described (EZLP) permits the student to input the linear programming model in exactly the same manner in which it would be written on paper. This report includes a brief review of the development of EZLP; narrative descriptions of program features,…
A goal programming procedure for solving fuzzy multiobjective fractional linear programming problems
Directory of Open Access Journals (Sweden)
Tunjo Perić
2014-12-01
Full Text Available This paper presents a modification of Pal, Moitra and Maulik's goal programming procedure for fuzzy multiobjective linear fractional programming problem solving. The proposed modification of the method allows simpler solving of economic multiple objective fractional linear programming (MOFLP problems, enabling the obtained solutions to express the preferences of the decision maker defined by the objective function weights. The proposed method is tested on the production planning example.
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
Solving cyclical nurse scheduling problem using preemptive goal programming
Sundari, V. E.; Mardiyati, S.
2017-07-01
Nurse scheduling system in a hospital is being modeled as a preemptive goal programming problem that is solved by using LINGO software with the objective function to minimize deviation variable at each goal. The scheduling is done cyclically, so every nurse is treated fairly since they have the same work shift portion with the other nurses. By paying attention to the hospital's rules regarding nursing work shift cyclically, it can be obtained that numbers of nurse needed in every ward are 18 nurses and the numbers of scheduling periods are 18 periods where every period consists of 21 days.
A recurrent neural network for solving bilevel linear programming problem.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian
2014-04-01
In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.
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.
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
Deciding Full Branching Time Logic by Program Transformation
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.
Neural network for solving convex quadratic bilevel programming problems.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie
2014-03-01
In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.
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
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)
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.
Bricolage Programming and Problem Solving Ability in Young Children : an Exploratory Study
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...
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)
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...
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...
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...
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....
van Hoorn, Jelke J.; Nogueira, Agustín; Ojea, Ignacio; Gromicho Dos Santos, Joaquim Antonio
2017-01-01
In [1] an algorithm is proposed for solving the job-shop scheduling problem optimally using a dynamic programming strategy. This is, according to our knowledge, the first exact algorithm for the Job Shop problem which is not based on integer linear programming and branch and bound. Despite the
Restricted dynamic programming: a flexible framework for solving realistic VRPs
Gromicho, J.; van Hoorn, J.J.; Kok, A.L.; Schutten, Johannes M.J.
2009-01-01
Most solution methods for solving large vehicle routing and schedu- ling problems are based on local search. A drawback of these ap- proaches is that they are designed and optimized for specific types of vehicle routing problems (VRPs). As a consequence, it is hard to adapt these solution methods to
Using Problem Solving to Teach a Programming Language.
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…
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
Approximate Dynamic Programming Solving the Curses of Dimensionality
Powell, Warren B
2011-01-01
Praise for the First Edition "Finally, a book devoted to dynamic programming and written using the language of operations research (OR)! This beautiful book fills a gap in the libraries of OR specialists and practitioners."-Computing Reviews This new edition showcases a focus on modeling and computation for complex classes of approximate dynamic programming problems Understanding approximate dynamic programming (ADP) is vital in order to develop practical and high-quality solutions to complex industrial problems, particularly when those problems involve making decisions in the presence of unce
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.…
How Does Early Feedback in an Online Programming Course Change Problem Solving?
Ebrahimi, Alireza
2012-01-01
How does early feedback change the programming problem solving in an online environment and help students choose correct approaches? This study was conducted in a sample of students learning programming in an online course entitled Introduction to C++ and OOP (Object Oriented Programming) using the ANGEL learning management system platform. My…
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…
Programmable calculator programs to solve softwood volume and value equations.
Janet K. Ayer. Sachet
1982-01-01
This paper presents product value and product volume equations as programs for handheld calculators. These tree equations are for inland Douglas-fir, young-growth Douglas-fir, western white pine, ponderosa pine, and western larch. Operating instructions and an example are included.
A new neural network model for solving random interval linear programming problems.
Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza
2017-05-01
This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.
Approximate dynamic programming solving the curses of dimensionality
Powell, Warren B
2007-01-01
Warren B. Powell, PhD, is Professor of Operations Research and Financial Engineering at Princeton University, where he is founder and Director of CASTLE Laboratory, a research unit that works with industrial partners to test new ideas found in operations research. The recipient of the 2004 INFORMS Fellow Award, Dr. Powell has authored over 100 refereed publications on stochastic optimization, approximate dynamic programming, and dynamic resource management.
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.
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.
Computer programs for solving systems of nonlinear equations
International Nuclear Information System (INIS)
Asaoka, Takumi
1978-03-01
Computer programs to find a solution, usually the one closest to some guess, of a system of simultaneous nonlinear equations are provided for real functions of the real arguments. These are based on quasi-Newton methods or projection methods, which are briefly reviewed in the present report. Benchmark tests were performed on these subroutines to grasp their characteristics. As the program not requiring analytical forms of the derivatives of the Jacobian matrix, we have dealt with NS01A of Powell, NS03A of Reid for a system with the sparse Jacobian and NONLIN of Brown. Of these three subroutines of quasi-Newton methods, NONLIN is shown to be the most useful because of its stable algorithm and short computation time. On the other hand, as the subroutine for which the derivatives of the Jacobian are to be supplied analytically, we have tested INTECH of a quasi-Newton method based on the Boggs' algorithm, PROJA of Georg and Keller based on the projection method and an option of NS03A. The results have shown that INTECH, treating variables which appear only linearly in the functions separately, takes the shortest computation time, on the whole, while the projection method requires further research to find an optimal algorithm. (auth.)
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...
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.
Developing Student Programming and Problem-Solving Skills with Visual Basic
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…
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.
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.
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.
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...
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.
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.
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.)
The role of metacognitive skills in solving object-oriented programming problems: a case study
Directory of Open Access Journals (Sweden)
Marietjie Havenga
2015-07-01
Full Text Available This article reports on the role of metacognitive skills when solving object-oriented programming problems as part of a case study. The research was constructivist-based within an interpretivist approach to explore how four students constructed their own thinking when solving programming problems. A qualitative methodology was employed. Both concept-driven coding and data-driven coding were applied. Two main issues emerged from the findings. Participating students had fragmented knowledge of the object-oriented approach and shortcomings regarding the implementation thereof, and they experienced problems with metacognitive control during all the steps of program development. Based on the findings the use of metacognitive critical control points (MCCPs is proposed to be used as a mechanism to facilitate students in their programming efforts and to prevent loss of control during program development.
The Strengthening Families Program 10-14: influence on parent and youth problem-solving skill.
Semeniuk, Y; Brown, R L; Riesch, S K; Zywicki, M; Hopper, J; Henriques, J B
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.
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…
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.)
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
Schoevers, E.M.; Kroesbergen, E.H.; Pitta-Pantazi, D.
2017-01-01
This article describes a new pedagogical method, an integrated visual art and geometry program, which has the aim to increase primary school students' creative problem solving and geometrical ability. This paper presents the rationale for integrating visual art and geometry education. Furthermore
Enhancing Problem-Solving Capabilities Using Object-Oriented Programming Language
Unuakhalu, Mike F.
2009-01-01
This study integrated object-oriented programming instruction with transfer training activities in everyday tasks, which might provide a mechanism that can be used for efficient problem solving. Specifically, a Visual BASIC embedded with everyday tasks group was compared to another group exposed to Visual BASIC instruction only. Subjects were 40…
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.
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
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.
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming
DEFF Research Database (Denmark)
Christensen, Tue; Andersen, Kim Allan; Klose, Andreas
2013-01-01
This paper considers a minimum-cost network flow problem in a bipartite graph with a single sink. The transportation costs exhibit a staircase cost structure because such types of transportation cost functions are often found in practice. We present a dynamic programming algorithm for solving...... this so-called single-sink, fixed-charge, multiple-choice transportation problem exactly. The method exploits heuristics and lower bounds to peg binary variables, improve bounds on flow variables, and reduce the state-space variable. In this way, the dynamic programming method is able to solve large...... instances with up to 10,000 nodes and 10 different transportation modes in a few seconds, much less time than required by a widely used mixed-integer programming solver and other methods proposed in the literature for this problem....
Directory of Open Access Journals (Sweden)
Samir Dey
2015-07-01
Full Text Available This paper proposes a new multi-objective intuitionistic fuzzy goal programming approach to solve a multi-objective nonlinear programming problem in context of a structural design. Here we describe some basic properties of intuitionistic fuzzy optimization. We have considered a multi-objective structural optimization problem with several mutually conflicting objectives. The design objective is to minimize weight of the structure and minimize the vertical deflection at loading point of a statistically loaded three-bar planar truss subjected to stress constraints on each of the truss members. This approach is used to solve the above structural optimization model based on arithmetic mean and compare with the solution by intuitionistic fuzzy goal programming approach. A numerical solution is given to illustrate our approach.
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.
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
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
... 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 ...
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
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.
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.
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
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
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....
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...
High profile students’ growth of mathematical understanding in solving linier programing problems
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.
M. ZANGIABADI; H. R. MALEKI
2007-01-01
In the real-world optimization problems, coefficients of the objective function are not known precisely and can be interpreted as fuzzy numbers. In this paper we define the concepts of optimality for linear programming problems with fuzzy parameters based on those for multiobjective linear programming problems. Then by using the concept of comparison of fuzzy numbers, we transform a linear programming problem with fuzzy parameters to a multiobjective linear programming problem. To this end, w...
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
Markovian Monte Carlo program EvolFMC v.2 for solving QCD evolution equations
Jadach, S.; Płaczek, W.; Skrzypek, M.; Stokłosa, P.
2010-02-01
We present the program EvolFMC v.2 that solves the evolution equations in QCD for the parton momentum distributions by means of the Monte Carlo technique based on the Markovian process. The program solves the DGLAP-type evolution as well as modified-DGLAP ones. In both cases the evolution can be performed in the LO or NLO approximation. The quarks are treated as massless. The overall technical precision of the code has been established at 5×10. This way, for the first time ever, we demonstrate that with the Monte Carlo method one can solve the evolution equations with precision comparable to the other numerical methods. New version program summaryProgram title: EvolFMC v.2 Catalogue identifier: AEFN_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFN_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including binary test data, etc.: 66 456 (7407 lines of C++ code) No. of bytes in distributed program, including test data, etc.: 412 752 Distribution format: tar.gz Programming language: C++ Computer: PC, Mac Operating system: Linux, Mac OS X RAM: Less than 256 MB Classification: 11.5 External routines: ROOT ( http://root.cern.ch/drupal/) Nature of problem: Solution of the QCD evolution equations for the parton momentum distributions of the DGLAP- and modified-DGLAP-type in the LO and NLO approximations. Solution method: Monte Carlo simulation of the Markovian process of a multiple emission of partons. Restrictions:Limited to the case of massless partons. Implemented in the LO and NLO approximations only. Weighted events only. Unusual features: Modified-DGLAP evolutions included up to the NLO level. Additional comments: Technical precision established at 5×10. Running time: For the 10 6 events at 100 GeV: DGLAP NLO: 27s; C-type modified DGLAP NLO: 150s (MacBook Pro with Mac OS X v.10
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.
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.
The Effect of TMPT Program on Pre-School Children's Social Problem Solving Skills
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…
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.
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.
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.
Govender, I.; Govender, D.; Havenga, M.; Mentz, E.; Breed, B.; Dignum, F.; Dignum, V.
2014-01-01
The difficulty of learning to program has long been identified amongst novices. This study explored the benefits of teaching a problem solving strategy by comparing students’ perceptions and attitudes towards problem solving before and after the strategy was implemented in secondary schools. Based
Directory of Open Access Journals (Sweden)
Tunjo Perić
2017-01-01
Full Text Available This paper presents and analyzes the applicability of three linearization techniques used for solving multi-objective linear fractional programming problems using the goal programming method. The three linearization techniques are: (1 Taylor’s polynomial linearization approximation, (2 the method of variable change, and (3 a modification of the method of variable change proposed in [20]. All three linearization techniques are presented and analyzed in two variants: (a using the optimal value of the objective functions as the decision makers’ aspirations, and (b the decision makers’ aspirations are given by the decision makers. As the criteria for the analysis we use the efficiency of the obtained solutions and the difficulties the analyst comes upon in preparing the linearization models. To analyze the applicability of the linearization techniques incorporated in the linear goal programming method we use an example of a financial structure optimization problem.
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 Disparities Through Payment And Delivery System Reform: A Program To Achieve Health Equity.
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.
Gulland, E.-K.; Veenendaal, B.; Schut, A. G. T.
2012-07-01
Problem-solving knowledge and skills are an important attribute of spatial sciences graduates. The challenge of higher education is to build a teaching and learning environment that enables students to acquire these skills in relevant and authentic applications. This study investigates the effectiveness of traditional face-to-face teaching and online learning technologies in supporting the student learning of problem-solving and computer programming skills, techniques and solutions. The student cohort considered for this study involves students in the surveying as well as geographic information science (GISc) disciplines. Also, students studying across a range of learning modes including on-campus, distance and blended, are considered in this study. Student feedback and past studies reveal a lack of student interest and engagement in problem solving and computer programming. Many students do not see such skills as directly relevant and applicable to their perceptions of what future spatial careers hold. A range of teaching and learning methods for both face-to-face teaching and distance learning were introduced to address some of the perceived weaknesses of the learning environment. These included initiating greater student interaction in lectures, modifying assessments to provide greater feedback and student accountability, and the provision of more interactive and engaging online learning resources. The paper presents and evaluates the teaching methods used to support the student learning environment. Responses of students in relation to their learning experiences were collected via two anonymous, online surveys and these results were analysed with respect to student pass and retention rates. The study found a clear distinction between expectations and engagement of surveying students in comparison to GISc students. A further outcome revealed that students who were already engaged in their learning benefited the most from the interactive learning resources and
Directory of Open Access Journals (Sweden)
E.-K. Gulland
2012-07-01
Full Text Available Problem-solving knowledge and skills are an important attribute of spatial sciences graduates. The challenge of higher education is to build a teaching and learning environment that enables students to acquire these skills in relevant and authentic applications. This study investigates the effectiveness of traditional face-to-face teaching and online learning technologies in supporting the student learning of problem-solving and computer programming skills, techniques and solutions. The student cohort considered for this study involves students in the surveying as well as geographic information science (GISc disciplines. Also, students studying across a range of learning modes including on-campus, distance and blended, are considered in this study. Student feedback and past studies reveal a lack of student interest and engagement in problem solving and computer programming. Many students do not see such skills as directly relevant and applicable to their perceptions of what future spatial careers hold. A range of teaching and learning methods for both face-to-face teaching and distance learning were introduced to address some of the perceived weaknesses of the learning environment. These included initiating greater student interaction in lectures, modifying assessments to provide greater feedback and student accountability, and the provision of more interactive and engaging online learning resources. The paper presents and evaluates the teaching methods used to support the student learning environment. Responses of students in relation to their learning experiences were collected via two anonymous, online surveys and these results were analysed with respect to student pass and retention rates. The study found a clear distinction between expectations and engagement of surveying students in comparison to GISc students. A further outcome revealed that students who were already engaged in their learning benefited the most from the interactive
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)
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.
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.
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
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.
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.
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
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.
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.
Entanglement branching operator
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.
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.
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.
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
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.
Future on the ITER program. On a branch of research on nuclear fusion
International Nuclear Information System (INIS)
Masaike, Akira
2000-01-01
As a huge cost for research and development of nuclear fusion is required, some international cooperative research such as ITER program have been intended to promote, to which Japanese response is required. As the program can be understood on its meaning at a viewpoint of promotion of basic science, concept on a key of energy problem is not insufficient yet And, its effect on technical problems and environment cannot be neglected Here was shown some proposals necessity for discussion on how the program had to be promoted under consideration of these problems. When a large scale program consuming national budget will be carried out, it is natural that agreement of national peoples must be obtained. Regretfully, in Japan discussion on science program above all nuclear policy has scarcely been experienced at citizens' levels, and some bitter experiences, where the concerned have promoted it in one side under a concept without any change once decided, have been pressured without any response to scientific advancements and social changes. Therefore, future plan on the nuclear fusion must be carried out a number of thorough discussion at a wide range from various viewpoints such as its realizing feasibility, safety, economics, and so forth, to promote careful adaptabilities. And, the concerned under promotion of the program and the relatives in the academic community seem to have a responsibility to easily explain present condition and scope of the plan to not only scientists but also citizens to awake them to promote its discussion with them. (G.K.)
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.
Backtrack Programming: A Computer-Based Approach to Group Problem Solving.
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…
A Python Program for Solving Schro¨dinger's Equation in Undergraduate Physical Chemistry
Srnec, Matthew N.; Upadhyay, Shiv; Madura, Jeffry D.
2017-01-01
In undergraduate physical chemistry, Schrödinger's equation is solved for a variety of cases. In doing so, the energies and wave functions of the system can be interpreted to provide connections with the physical system being studied. Solving this equation by hand for a one-dimensional system is a manageable task, but it becomes time-consuming…
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...
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.
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
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.
DESIGN AND EXAMINATION OF ALGORITHMS FOR SOLVING THE KNAPSACK PROBLEM
Directory of Open Access Journals (Sweden)
S. Kantsedal
2015-07-01
Full Text Available The use of methods of branches and boundaries as well as the methods of dynamic programming at solving the problem of «knapsack» is grounded. The main concepts are expounded. The methods and algorithms development for solving the above specified problem are described. Recommendations on practical application of constructed algorithms based on their experimental investigation and carrying out charactheristics comparison are presented.
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.
Modifications of the branch-and-bound algorithm for application in constrained adaptive testing
Veldkamp, Bernard P.
2000-01-01
A mathematical programming approach is presented for computer adaptive testing (CAT) with many constraints on the item and test attributes. Because mathematical programming problems have to be solved while the examinee waits for the next item, a fast implementation of the Branch-and-Bound algorithm
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.
The NASA Computational Fluid Dynamics (CFD) program - Building technology to solve future challenges
Richardson, Pamela F.; Dwoyer, Douglas L.; Kutler, Paul; Povinelli, Louis A.
1993-01-01
This paper presents the NASA Computational Fluid Dynamics program in terms of a strategic vision and goals as well as NASA's financial commitment and personnel levels. The paper also identifies the CFD program customers and the support to those customers. In addition, the paper discusses technical emphasis and direction of the program and some recent achievements. NASA's Ames, Langley, and Lewis Research Centers are the research hubs of the CFD program while the NASA Headquarters Office of Aeronautics represents and advocates the program.
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.
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.
This article examines the development and implementation of the NOx Budget Trading Program (NBP) and the lessons the Environmental Protection Agency has learned from this seasonal emissions cap-and-trade program.
Toledo, Raciel Yera; Mota, Yailé Caballero
2014-01-01
The paper proposes a recommender system approach to cover online judge's domains. Online judges are e-learning tools that support the automatic evaluation of programming tasks done by individual users, and for this reason they are usually used for training students in programming contest and for supporting basic programming teachings. The…
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
Java programming fundamentals problem solving through object oriented analysis and design
Nair, Premchand S
2008-01-01
While Java texts are plentiful, it's difficult to find one that takes a real-world approach, and encourages novice programmers to build on their Java skills through practical exercise. Written by an expert with 19 experience teaching computer programming, Java Programming Fundamentals presents object-oriented programming by employing examples taken from everyday life. Provides a foundation in object-oriented design principles and UML notation Describes common pitfalls and good programming practicesFurnishes supplemental links, documents, and programs on its companion website, www.premnair.netU
Programming and Tuning a Quantum Annealing Device to Solve Real World Problems
Perdomo-Ortiz, Alejandro; O'Gorman, Bryan; Fluegemann, Joseph; Smelyanskiy, Vadim
2015-03-01
Solving real-world applications with quantum algorithms requires overcoming several challenges, ranging from translating the computational problem at hand to the quantum-machine language to tuning parameters of the quantum algorithm that have a significant impact on the performance of the device. In this talk, we discuss these challenges, strategies developed to enhance performance, and also a more efficient implementation of several applications. Although we will focus on applications of interest to NASA's Quantum Artificial Intelligence Laboratory, the methods and concepts presented here apply to a broader family of hard discrete optimization problems, including those that occur in many machine-learning algorithms.
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.
Analysis of Learning Behavior in a Flipped Programing Classroom Adopting Problem-Solving Strategies
Chiang, Tosti Hsu-Cheng
2017-01-01
Programing is difficult for beginners because they need to learn the new language of computers. Developing software, especially complex software, is bound to result in problems, frustration, and the need to think in new ways. Identifying the learning behavior behind programing by way of empirical studies can help beginners learn more easily. In…
Energy Technology Data Exchange (ETDEWEB)
Blumstein, Carl (Univ. of California, Energy Institute (United States))
2009-07-01
This paper addresses the nexus between the evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes problems that arise when evaluators are asked to measure program performance by answering the counterfactual question, what would have happened in the absence of the program? Then some ways of addressing these problems are examined. Key conclusions are that 1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, 2) given the current state of knowledge, the decision to tie all of the incentive to program outcomes is misguided, and 3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions.
Energy Technology Data Exchange (ETDEWEB)
Blumstein, Carl, E-mail: blumstei@berkeley.ed [University of California Energy Institute, 2547 Channing Way, Berkeley, CA 94720 (United States)
2010-10-15
This paper addresses the nexus between evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes the problems that arise when evaluators are asked to measure program performance by answering the counterfactual question-what would have happened in the absence of the program? Then the paper examines some ways of addressing these problems. Key conclusions are (1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, (2) given the current state of knowledge, the decision to tie all incentives to program outcomes is misguided, and (3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions.
Energy Technology Data Exchange (ETDEWEB)
Blumstein, Carl [University of California Energy Institute, 2547 Channing Way, Berkeley, CA 94720 (United States)
2010-10-15
This paper addresses the nexus between evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes the problems that arise when evaluators are asked to measure program performance by answering the counterfactual question - what would have happened in the absence of the program? Then the paper examines some ways of addressing these problems. Key conclusions are (1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, (2) given the current state of knowledge, the decision to tie all incentives to program outcomes is misguided, and (3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions. (author)
International Nuclear Information System (INIS)
Blumstein, Carl
2010-01-01
This paper addresses the nexus between evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes the problems that arise when evaluators are asked to measure program performance by answering the counterfactual question-what would have happened in the absence of the program? Then the paper examines some ways of addressing these problems. Key conclusions are (1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, (2) given the current state of knowledge, the decision to tie all incentives to program outcomes is misguided, and (3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions.
Solving inverse problems with the unfolding program TRUEE: Examples in astroparticle physics
International Nuclear Information System (INIS)
Milke, N.; Doert, M.; Klepser, S.; Mazin, D.; Blobel, V.; Rhode, W.
2013-01-01
The unfolding program TRUEE is a software package for the numerical solution of inverse problems. The algorithm was first applied in the FORTRAN 77 program RUN. RUN is an event-based unfolding algorithm which makes use of the Tikhonov regularization. It has been tested and compared to different unfolding applications and stood out with notably stable results and reliable error estimation. TRUEE is a conversion of RUN to C++, which works within the powerful ROOT framework. The program has been extended for more user-friendliness and delivers unfolding results which are identical to RUN. Beside the simplicity of the installation of the software and the generation of graphics, there are new functions, which facilitate the choice of unfolding parameters and observables for the user. In this paper, we introduce the new unfolding program and present its performance by applying it to two exemplary data sets from astroparticle physics, taken with the MAGIC telescopes and the IceCube neutrino detector, respectively.
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
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.
OpenMP GNU and Intel Fortran programs for solving the time-dependent Gross-Pitaevskii equation
Young-S., Luis E.; Muruganandam, Paulsamy; Adhikari, Sadhan K.; Lončar, Vladimir; Vudragović, Dušan; Balaž, Antun
2017-11-01
We present Open Multi-Processing (OpenMP) version of Fortran 90 programs for solving the Gross-Pitaevskii (GP) equation for a Bose-Einstein condensate in one, two, and three spatial dimensions, optimized for use with GNU and Intel compilers. We use the split-step Crank-Nicolson algorithm for imaginary- and real-time propagation, which enables efficient calculation of stationary and non-stationary solutions, respectively. The present OpenMP programs are designed for computers with multi-core processors and optimized for compiling with both commercially-licensed Intel Fortran and popular free open-source GNU Fortran compiler. The programs are easy to use and are elaborated with helpful comments for the users. All input parameters are listed at the beginning of each program. Different output files provide physical quantities such as energy, chemical potential, root-mean-square sizes, densities, etc. We also present speedup test results for new versions of the programs. Program files doi:http://dx.doi.org/10.17632/y8zk3jgn84.2 Licensing provisions: Apache License 2.0 Programming language: OpenMP GNU and Intel Fortran 90. Computer: Any multi-core personal computer or workstation with the appropriate OpenMP-capable Fortran compiler installed. Number of processors used: All available CPU cores on the executing computer. Journal reference of previous version: Comput. Phys. Commun. 180 (2009) 1888; ibid.204 (2016) 209. Does the new version supersede the previous version?: Not completely. It does supersede previous Fortran programs from both references above, but not OpenMP C programs from Comput. Phys. Commun. 204 (2016) 209. Nature of problem: The present Open Multi-Processing (OpenMP) Fortran programs, optimized for use with commercially-licensed Intel Fortran and free open-source GNU Fortran compilers, solve the time-dependent nonlinear partial differential (GP) equation for a trapped Bose-Einstein condensate in one (1d), two (2d), and three (3d) spatial dimensions for
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.
An Interactive Method to Solve Infeasibility in Linear Programming Test Assembling Models
Huitzing, Hiddo A.
2004-01-01
In optimal assembly of tests from item banks, linear programming (LP) models have proved to be very useful. Assembly by hand has become nearly impossible, but these LP techniques are able to find the best solutions, given the demands and needs of the test to be assembled and the specifics of the item bank from which it is assembled. However,…
Model-based problem solving through symbolic regression via pareto genetic programming
Vladislavleva, E.
2008-01-01
Pareto genetic programming methodology is extended by additional generic model selection and generation strategies that (1) drive the modeling engine to creation of models of reduced non-linearity and increased generalization capabilities, and (2) improve the effectiveness of the search for robust
PROGRAMMING OF METHODS FOR THE NEEDS OF LOGISTICS DISTRIBUTION SOLVING PROBLEMS
Directory of Open Access Journals (Sweden)
Andrea Štangová
2014-06-01
Full Text Available Logistics has become one of the dominant factors which is affecting the successful management, competitiveness and mentality of the global economy. Distribution logistics materializes the connesciton of production and consumer marke. It uses different methodology and methods of multicriterial evaluation and allocation. This thesis adresses the problem of the costs of securing the distribution of product. It was therefore relevant to design a software product thet would be helpful in solvin the problems related to distribution logistics. Elodis – electronic distribution logistics program was designed on the basis of theoretical analysis of the issue of distribution logistics and on the analysis of the software products market. The program uses a multicriterial evaluation methods to deremine the appropriate type and mathematical and geometrical method to determine an appropriate allocation of the distribution center, warehouse and company.
Solving the Frequency Assignment Problem by Site Availability and Constraint Programming
Linhares, Andrea Carneiro; Torres-Moreno, Juan-Manuel; Peinl, Peter; Michelon, Philippe
2010-01-01
The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of Constraint Programming and integrate the site availability concept. Numerical simulations conducted ...
An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems
Sitopu, Joni Wilson; Mawengkang, Herman; Syafitri Lubis, Riri
2018-01-01
The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.
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.
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.
Maddrey, Elizabeth
Research in academia and industry continues to identify a decline in enrollment in computer science. One major component of this decline in enrollment is a shortage of female students. The primary reasons for the gender gap presented in the research include lack of computer experience prior to their first year in college, misconceptions about the field, negative cultural stereotypes, lack of female mentors and role models, subtle discriminations in the classroom, and lack of self-confidence (Pollock, McCoy, Carberry, Hundigopal, & You, 2004). Male students are also leaving the field due to misconceptions about the field, negative cultural stereotypes, and a lack of self-confidence. Analysis of first year attrition revealed that one of the major challenges faced by students of both genders is a lack of problem-solving skills (Beaubouef, Lucas & Howatt, 2001; Olsen, 2005; Paxton & Mumey, 2001). The purpose of this study was to investigate whether specific, non-mathematical problem-solving instruction as part of introductory programming courses significantly increased computer programming self-efficacy and achievement of students. The results of this study showed that students in the experimental group had significantly higher achievement than students in the control group. While this shows statistical significance, due to the effect size and disordinal nature of the data between groups, care has to be taken in its interpretation. The study did not show significantly higher programming self-efficacy among the experimental students. There was not enough data collected to statistically analyze the effect of the treatment on self-efficacy and achievement by gender. However, differences in means were observed between the gender groups, with females in the experimental group demonstrating a higher than average degree of self-efficacy when compared with males in the experimental group and both genders in the control group. These results suggest that the treatment from this
Fitting of full Cobb-Douglas and full VRTS cost frontiers by solving goal programming problem
Venkateswarlu, B.; Mahaboob, B.; Subbarami Reddy, C.; Madhusudhana Rao, B.
2017-11-01
The present research article first defines two popular production functions viz, Cobb-Douglas and VRTS production frontiers and their dual cost functions and then derives their cost limited maximal outputs. This paper tells us that the cost limited maximal output is cost efficient. Here the one side goal programming problem is proposed by which the full Cobb-Douglas cost frontier, full VRTS frontier can be fitted. This paper includes the framing of goal programming by which stochastic cost frontier and stochastic VRTS frontiers are fitted. Hasan et al. [1] used a parameter approach Stochastic Frontier Approach (SFA) to examine the technical efficiency of the Malaysian domestic banks listed in the Kuala Lumpur stock Exchange (KLSE) market over the period 2005-2010. AshkanHassani [2] exposed Cobb-Douglas Production Functions application in construction schedule crashing and project risk analysis related to the duration of construction projects. Nan Jiang [3] applied Stochastic Frontier analysis to a panel of New Zealand dairy forms in 1998/99-2006/2007.
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.
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming
DEFF Research Database (Denmark)
Rauff Lind Christensen, Tue; Klose, Andreas; Andersen, Kim Allan
important aspects of supplier selection, an important application of the SSFCTP, this does not reflect the real life situation. First, transportation costs faced by many companies are in fact piecewise linear. Secondly, when suppliers offer discounts, either incremental or all-unit discounts, such savings......The Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem (SSFCMCTP) is a problem with versatile applications. This problem is a generalization of the Single-Sink, Fixed-Charge Transportation Problem (SSFCTP), which has a fixed-charge, linear cost structure. However, in at least two...... are neglected in the SSFCTP. The SSFCMCTP overcome this problem by incorporating a staircase cost structure in the cost function instead of the usual one used in SSFCTP. We present a dynamic programming algorithm for the resulting problem. To enhance the performance of the generic algorithm a number...
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.
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.
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.
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.
Yager’s ranking method for solving the trapezoidal fuzzy number linear programming
Karyati; Wutsqa, D. U.; Insani, N.
2018-03-01
In the previous research, the authors have studied the fuzzy simplex method for trapezoidal fuzzy number linear programming based on the Maleki’s ranking function. We have found some theories related to the term conditions for the optimum solution of fuzzy simplex method, the fuzzy Big-M method, the fuzzy two-phase method, and the sensitivity analysis. In this research, we study about the fuzzy simplex method based on the other ranking function. It is called Yager's ranking function. In this case, we investigate the optimum term conditions. Based on the result of research, it is found that Yager’s ranking function is not like Maleki’s ranking function. Using the Yager’s function, the simplex method cannot work as well as when using the Maleki’s function. By using the Yager’s function, the value of the subtraction of two equal fuzzy numbers is not equal to zero. This condition makes the optimum table of the fuzzy simplex table is undetected. As a result, the simplified fuzzy simplex table becomes stopped and does not reach the optimum solution.
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…
International Nuclear Information System (INIS)
Hance, R.; Areti, H.; Atac, R.
1987-01-01
The ACP Branchbus, a high speed differential bus for data movement in multiprocessing and data acquisition environments, is described. This bus was designed as the central bus in the ACP multiprocessing system. In its full implementation with 16 branches and a bus switch, it will handle data rates of 160 MByte/sec and allow reliable data transmission over inter rack distances. We also summarize applications of the ACP system in experimental data acquisition, triggering and monitoring, with special attention paid to FASTBUS environments
Energy Technology Data Exchange (ETDEWEB)
Morrison, B A; Thuns, A; Feldman, M
1988-01-01
To supplement in-house investigations, Agriculture Canada contracted out research in a number of programs including three which supported engineering work. This document lists the contracts awarded under the programs and provides reference citations of the contract reports. Reports are grouped by file number, scientific authority, author or contractor, and subject, and a subject index is also included. The three programs are: Development, Research and Evaluation in Agricultural Mechanization (DREAM), Agricultural Engineering Research and Development Program (AERD), and Energy Research and Development in Agriculture and Food (ERDAF). AERD, which replaced DREAM, has been terminated, but the ERDAF program is still continuing as of the date of this document.
Vi D. Nguyen; Lara A. Roman; Dexter H. Locke; Sarah K. Mincey; Jessica R. Sanders; Erica Smith Fichman; Mike Duran-Mitchell; Sarah Lumban Tobing
2017-01-01
Residential lands constitute a major component of existing and possible tree canopy in many cities in the United States. To expand the urban forest on these lands, some municipalities and nonprofit organizations have launched residential yard tree distribution programs, also known as tree giveaway programs. This paper describes the operations of five tree distribution...
Energy Technology Data Exchange (ETDEWEB)
Kochin, I.V.; Martynenko, O.N.; Berestizhevskii, S.I.; Eshchenko, N.E.
1987-01-01
A draft is evaluated for a research program on health hazards and occupational diseases in coking plants in the USSR. The research program would be a component of the Health program for 1986-1990 approved by the authorities. The following structure of the research program is recommended for the coking industry in the Ukrainian SSR: research on social and socio-economic factors which influence health of coking plant employees (development of standard survey, development of questionnaires), examinations of state of health of coking plant personnel on the basis of statistical data (determining most frequent disease in coking plant personnel, calculating indices which describe disease frequency, assessment of disease structure), investigations into disease dependence on social and socio-economic factors as well as safety conditions (development of mathematical models which describe effects of various social and economic factors on general state of health and diseases of coking plant personnel, classification of personnel in coking plant considering state of health and socio-economic factors (development of computer programs and algorithms), development of computer programs for health control in coking plants and reducing economic losses caused by absence associated with diseases and accidents.
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…
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…
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)
DEFF Research Database (Denmark)
Dohn, Anders Høeg; Mason, Andrew
2013-01-01
We present a novel generic programming implementation of a column-generation algorithm for the generalized staff rostering problem. The problem is represented as a generalized set partitioning model, which is able to capture commonly occurring problem characteristics given in the literature. Colu...
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)
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.
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....
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.
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 ...
3rd Workshop on Branching Processes and their Applications
González, Miguel; Gutiérrez, Cristina; Martínez, Rodrigo; Minuesa, Carmen; Molina, Manuel; Mota, Manuel; Ramos, Alfonso; WBPA15
2016-01-01
This volume gathers papers originally presented at the 3rd Workshop on Branching Processes and their Applications (WBPA15), which was held from 7 to 10 April 2015 in Badajoz, Spain (http://branching.unex.es/wbpa15/index.htm). The papers address a broad range of theoretical and practical aspects of branching process theory. Further, they amply demonstrate that the theoretical research in this area remains vital and topical, as well as the relevance of branching concepts in the development of theoretical approaches to solving new problems in applied fields such as Epidemiology, Biology, Genetics, and, of course, Population Dynamics. The topics covered can broadly be classified into the following areas: 1. Coalescent Branching Processes 2. Branching Random Walks 3. Population Growth Models in Varying and Random Environments 4. Size/Density/Resource-Dependent Branching Models 5. Age-Dependent Branching Models 6. Special Branching Models 7. Applications in Epidemiology 8. Applications in Biology and Genetics Offer...
Sole, Marla A.
2016-01-01
Open-ended questions that can be solved using different strategies help students learn and integrate content, and provide teachers with greater insights into students' unique capabilities and levels of understanding. This article provides a problem that was modified to allow for multiple approaches. Students tended to employ high-powered, complex,…
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.
NCI: DCTD: Biometric Research Branch
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.
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.
An overview of solution methods for multi-objective mixed integer linear programming programs
DEFF Research Database (Denmark)
Andersen, Kim Allan; Stidsen, Thomas Riis
Multiple objective mixed integer linear programming (MOMIP) problems are notoriously hard to solve to optimality, i.e. finding the complete set of non-dominated solutions. We will give an overview of existing methods. Among those are interactive methods, the two phases method and enumeration...... methods. In particular we will discuss the existing branch and bound approaches for solving multiple objective integer programming problems. Despite the fact that branch and bound methods has been applied successfully to integer programming problems with one criterion only a few attempts has been made...
Hill, Mary C.
1990-01-01
This report documents PCG2 : a numerical code to be used with the U.S. Geological Survey modular three-dimensional, finite-difference, ground-water flow model . PCG2 uses the preconditioned conjugate-gradient method to solve the equations produced by the model for hydraulic head. Linear or nonlinear flow conditions may be simulated. PCG2 includes two reconditioning options : modified incomplete Cholesky preconditioning, which is efficient on scalar computers; and polynomial preconditioning, which requires less computer storage and, with modifications that depend on the computer used, is most efficient on vector computers . Convergence of the solver is determined using both head-change and residual criteria. Nonlinear problems are solved using Picard iterations. This documentation provides a description of the preconditioned conjugate gradient method and the two preconditioners, detailed instructions for linking PCG2 to the modular model, sample data inputs, a brief description of PCG2, and a FORTRAN listing.
International Nuclear Information System (INIS)
Jarvis, R.D.; Nelson, P.
1995-01-01
LOCFES-B solves the steady-state, monoenergetic and azimuthally symmetric neutral-particle transport equation in one-dimensional plane-parallel geometry. LOCFES-B is designed to facilitate testing and comparison of different spatial approximations in neutron transport. Accordingly, it permits performance of user-provided CLOF spatial approximations to be compared directly on successively refined mesh sizes and user-input physical problems with automatic comparison of results. if desired, to user-supplied benchmark results
Coalition for Evidence-Based Policy, 2015
2015-01-01
The Social Spending Innovation Research (SSIR) proposal seeks to replicate, in social spending, the great success of the Small Business Innovation Research (SBIR) program in technology development. The SBIR program funds technology development by entrepreneurial small companies. The program has spawned breakthrough technologies in diverse areas…
... 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) — ...
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....
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.
Problem Solving on a Monorail.
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)
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.
National Research Council Canada - National Science Library
Wallace, Steven O
2008-01-01
The U.S. Executive Branch should change its fundamental structure at the operational level to achieve integrated planning and regional unity of effort through unified regional executors to synchronize...
Strategy of Irrigation Branch in Russia
Zeyliger, A.; Ermolaeva, O.
2012-04-01
At this moment, at the starting time of the program on restoration of a large irrigation in Russia till 2020, the scientific and technical community of irrigation branch does not have clear vision on how to promote a development of irrigated agriculture and without repeating of mistakes having a place in the past. In many respects absence of a vision is connected to serious backlog of a scientific and technical and informational and technological level of development of domestic irrigation branch from advanced one. Namely such level of development is necessary for the resolving of new problems in new conditions of managing, and also for adequate answers to new challenges from climate and degradation of ground & water resources, as well as a rigorous requirement from an environment. In such important situation for irrigation branch when it is necessary quickly generate a scientific and technical politics for the current decade for maintenance of translation of irrigated agriculture in the Russian Federation on a new highly effective level of development, in our opinion, it is required to carry out open discussion of needs and requirements as well as a research for a adequate solutions. From political point of view a framework organized in FP6 DESIRE 037046 project is an example of good practice that can serve as methodical approach how to organize and develop such processes. From technical point of view a technology of operational management of irrigation at large scale presents a prospective alternative to the current type of management based on planning. From point of view ICT operational management demands creation of a new platform for the professional environment of activity. This platform should allow to perceive processes in real time, at their partial predictability on signals of a straight line and a feedback, within the framework of variability of decision making scenarious, at high resolution and the big ex-awning of sensor controls and the gauges
Burghardt, F. F.
An estimated 850,000 Canadian adults lack basic literacy skills. An examination of the profile and achievements of the students enrolled in the literacy education program at the Alberta Vocational Centre in Edmonton indicates that like the many other types in the broad range of adult literacy programs, the highly structured nature of the Edmonton…
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...
Hatt, Dylan; Beaton, Rachael L.; Freedman, Wendy L.; Madore, Barry F.; Jang, In-Sung; Hoyt, Taylor J.; Lee, Myung Gyoon; Monson, Andrew J.; Rich, Jeffrey A.; Scowcroft, Victoria; Seibert, Mark
2017-08-01
IC 1613 is an isolated dwarf galaxy within the Local Group. Low foreground and internal extinction, low metallicity, and low crowding make it an invaluable testbed for the calibration of the local distance ladder. We present new, high-fidelity distance estimates to IC 1613 via its Tip of the Red Giant Branch (TRGB) and its RR Lyrae (RRL) variables as part of the Carnegie-Chicago Hubble Program, which seeks an alternate local route to H 0 using Population II stars. We have measured a TRGB magnitude {I}{ACS}{TRGB}=20.35+/- {0.01}{stat}+/- {0.01}{sys} mag using wide-field observations obtained from the IMACS camera on the Magellan-Baade telescope. We have further constructed optical and near-infrared RRL light curves using archival BI- and new H-band observations from the ACS/WFC and WFC3/IR instruments on board the Hubble Space Telescope (HST). In advance of future Gaia data releases, we set provisional values for the TRGB luminosity via the Large Magellanic Cloud and Galactic RRL zero-points via HST parallaxes. We find corresponding true distance moduli {μ }0{TRGB}=24.30+/- {0.03}{stat}+/- {0.05}{sys} {mag} and =24.28+/- {0.04}{stat+{sys}} mag. We compare our results to a body of recent publications on IC 1613 and find no statistically significant difference between the distances derived from Population I and II stars. Based in part on observations made with the NASA/ESA Hubble Space Telescope, obtained at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555. These observations are associated with programs #10505 and #13691. Additional observations are credited to the Observatories of the Carnegie Institution of Washington for the use of Magellan-Baade IMACS. Presented as part of a dissertation to the Department of Astronomy and Astrophysics, The University of Chicago, in partial fulfillment of the requirements for the Ph.D. degree.
Branching processes and neutral evolution
Taïb, Ziad
1992-01-01
The Galton-Watson branching process has its roots in the problem of extinction of family names which was given a precise formulation by F. Galton as problem 4001 in the Educational Times (17, 1873). In 1875, an attempt to solve this problem was made by H. W. Watson but as it turned out, his conclusion was incorrect. Half a century later, R. A. Fisher made use of the Galton-Watson process to determine the extinction probability of the progeny of a mutant gene. However, it was J. B. S. Haldane who finally gave the first sketch of the correct conclusion. J. B. S. Haldane also predicted that mathematical genetics might some day develop into a "respectable branch of applied mathematics" (quoted in M. Kimura & T. Ohta, Theoretical Aspects of Population Genetics. Princeton, 1971). Since the time of Fisher and Haldane, the two fields of branching processes and mathematical genetics have attained a high degree of sophistication but in different directions. This monograph is a first attempt to apply the current sta...
BDC 500 branch driver controller
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).
Ellis, Barbara G.; Dick, Steven J.
1996-01-01
Employs the statistics-documentation portion of a word-processing program's grammar-check feature together with qualitative analyses to determine that Henry Watterson, long-time editor of the "Louisville Courier-Journal," was probably the South's famed Civil War correspondent "Shadow." (TB)
Nara, Jun
2010-01-01
This research explores how chief cabin crew members of major airlines made their decisions on-the-spot when they had unexpected problems. This research also presents some insights that may improve personnel training programs for future stewardesses and stewards based on the investigation of their decision-making styles. The theoretical framework…
International Nuclear Information System (INIS)
Wilcox, T.P.
1981-01-01
This user's manual covers this latest version of the MORSE-C code which solves the multiple energy group form of the Boltzmann transport equation in order to obtain the eigenvalue (multiplication) when fissionable materials are present. Cross sections for up to 100 energy groups may be employed. The angular scattering is treated by the usual Legendre expansion as used in the discrete ordinates codes. Upscattering may be specified. The geometry is defined by relationships to general 1st or 2nd degree surfaces. Array units may be specified. Output includes, besides the usual values of input quantities, plots of the geometry, calculated volumes and masses, and graphs of results to assist the user in determining the correctness of the problem's solution. Appendix II of this report contains the code listing with its numerous comments which should simplify finding an answer to any specific question the reader might have about MORSE-C. The remaining sections of this report explain how to obtain the code, how to set-up the input for a specific problem, how to understand the output, and then illustrates two typical problems run with the code
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...
International Nuclear Information System (INIS)
Snider, D.M.
1981-02-01
INVERT 1.0 is a digital computer program written in FORTRAN IV which calculates the surface heat flux of a one-dimensional solid using an interior-measured temperature and a physical description of the solid. By using two interior-measured temperatures, INVERT 1.0 can provide a solution for the heat flux at two surfaces, the heat flux at a boundary and the time dependent power, or the heat flux at a boundary and the time varying thermal conductivity of a material composing the solid. The analytical solution to inversion problem is described for the one-dimensional cylinder, sphere, or rectangular slab. The program structure, input instructions, and sample problems demonstrating the accuracy of the solution technique are included
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...
Roman, Monsi C.; Kim, Tony; Sudnik, Janet; Sivak, Amy; Porter, Molly; Cylar, Rosaling; Cavanaugh, Dominique; Krome, Kim
2017-01-01
The National Aeronautics and Space Administration (NASA) Centennial Challenges Program, part of the Space Technology Mission Directorate (STMD), addresses key technology needs of NASA and the nation, while facilitating new sources of innovation outside the traditional community. This is done by the direct engagement of the public at large, through the offering of Congressional authorized prize purses and associated challenges developed by NASA and the aerospace community and set up as a competition awarding the prize money for achieving the specified technology goal.
Directory of Open Access Journals (Sweden)
Naima Moustaid-Moussa
2012-08-01
Full Text Available Background: Recent findings from our research indicate that children participating in a creative afterschool program exhibit overall healthier lifestyle practices compared to the average US pediatric population. This observation led us to investigate the prevalence of overweight/obesity and lifestyle practices of their parents. Objective: To determine the strongest predictors of weight status for female parents whose children were participating in such creative afterschool program. Design: Surveyed subjects were parents of children who competed in the 2008 and 2009 Destination ImagiNation® Global Finals in Knoxville, Tennessee. A total of 4,608 children participated in data collection, with parental consent. For the combined 2 years, 1,118 parents, 87% of whom were females (n=1,032 completed online questionnaires, which were based on the Behavioral Risk Factor Surveillance System and included self-reported height, weight, dietary intake, physical activity, and socioeconomic status. The majority of this population was white, and less than 5% were African American or Hispanic. Results: We report here results obtained for the female parents. Only 45.2% of these female parents were overweight/obese, compared to a national average of 64.1% reported by the National Health Nutrition Examination Surveys for 2007—2008. Furthermore, this population was significantly more physically active compared to national average. Most parents (76% had completed a college degree and reported high incomes. Parents with the lowest income were the most obese in this population. Finally, we found a significant association between parent and child weight status. Conclusions: These studies demonstrate that female parents of children who have healthy lifestyles were physically active, which likely accounts for the parents’ lower overweight/obesity rates. In addition to physical activity, income and percentage of calories from fat were all predictors of weight status.
Wise, K; Rief, W; Goebel, G
1998-06-01
Two different group treatments were evaluated in 144 in-patients suffering from impairment due to chronic tinnitus. A tinnitus management therapy (TMT) was developed using principles of cognitive-behavioral therapy and compared with problem solving group therapy. Self-ratings were used to evaluate the help patients found in dealing with life problems and tinnitus as well as the degree to which they felt they were being properly treated and taken seriously. Patients showed significantly more satisfaction with the TMT group and evaluated the help they found in coping with tinnitus and life problems significantly higher. Thus, in the light of unsatisfactory medical solutions and the poor acceptance of some psychological treatments for tinnitus, TMT appears to be an acceptable and helpful treatment program.
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
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....
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....
Directory of Open Access Journals (Sweden)
Narong Wichapa
2018-01-01
Full Text Available Infectious waste disposal remains one of the most serious problems in the medical, social and environmental domains of almost every country. Selection of new suitable locations and finding the optimal set of transport routes for a fleet of vehicles to transport infectious waste material, location routing problem for infectious waste disposal, is one of the major problems in hazardous waste management. Determining locations for infectious waste disposal is a difficult and complex process, because it requires combining both intangible and tangible factors. Additionally, it depends on several criteria and various regulations. This facility location problem for infectious waste disposal is complicated, and it cannot be addressed using any stand-alone technique. Based on a case study, 107 hospitals and 6 candidate municipalities in Upper-Northeastern Thailand, we considered criteria such as infrastructure, geology and social & environmental criteria, evaluating global priority weights using the fuzzy analytical hierarchy process (Fuzzy AHP. After that, a new multi-objective facility location problem model which hybridizes fuzzy AHP and goal programming (GP, namely the HGP model, was tested. Finally, the vehicle routing problem (VRP for a case study was formulated, and it was tested using a hybrid genetic algorithm (HGA which hybridizes the push forward insertion heuristic (PFIH, genetic algorithm (GA and three local searches including 2-opt, insertion-move and interexchange-move. The results show that both the HGP and HGA can lead to select new suitable locations and to find the optimal set of transport routes for vehicles delivering infectious waste material. The novelty of the proposed methodologies, HGP, is the simultaneous combination of relevant factors that are difficult to interpret and cost factors in order to determine new suitable locations, and HGA can be applied to determine the transport routes which provide a minimum number of vehicles
Branching processes in biology
Kimmel, Marek
2015-01-01
This book provides a theoretical background of branching processes and discusses their biological applications. Branching processes are a well-developed and powerful set of tools in the field of applied probability. The range of applications considered includes molecular biology, cellular biology, human evolution and medicine. The branching processes discussed include Galton-Watson, Markov, Bellman-Harris, Multitype, and General Processes. As an aid to understanding specific examples, two introductory chapters, and two glossaries are included that provide background material in mathematics and in biology. The book will be of interest to scientists who work in quantitative modeling of biological systems, particularly probabilists, mathematical biologists, biostatisticians, cell biologists, molecular biologists, and bioinformaticians. The authors are a mathematician and cell biologist who have collaborated for more than a decade in the field of branching processes in biology for this new edition. This second ex...
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
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
Branches of the Facial Artery.
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.
Thermoelectric effects in disordered branched nanowires
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.
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...
Moraes Rêgo, Patrícia Helena; Viana da Fonseca Neto, João; Ferreira, Ernesto M.
2015-08-01
The main focus of this article is to present a proposal to solve, via UDUT factorisation, the convergence and numerical stability problems that are related to the covariance matrix ill-conditioning of the recursive least squares (RLS) approach for online approximations of the algebraic Riccati equation (ARE) solution associated with the discrete linear quadratic regulator (DLQR) problem formulated in the actor-critic reinforcement learning and approximate dynamic programming context. The parameterisations of the Bellman equation, utility function and dynamic system as well as the algebra of Kronecker product assemble a framework for the solution of the DLQR problem. The condition number and the positivity parameter of the covariance matrix are associated with statistical metrics for evaluating the approximation performance of the ARE solution via RLS-based estimators. The performance of RLS approximators is also evaluated in terms of consistence and polarisation when associated with reinforcement learning methods. The used methodology contemplates realisations of online designs for DLQR controllers that is evaluated in a multivariable dynamic system model.
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.
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.
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.
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
Intermittency in branching models
International Nuclear Information System (INIS)
Chiu, C.B.; Texas Univ., Austin; Hwa, R.C.; Oregon Univ., Eugene
1990-01-01
The intermittency properties of three branching models have been investigated. The factorial moments show power-law behavior as function of small rapidity width. The slopes and energy dependences reveal different characteristics of the models. The gluon model has the weakest intermittency. (orig.)
DEFF Research Database (Denmark)
Jensen, Rune Møller; Veloso, Manuela M.; Bryant, Randal E.
2008-01-01
In this article, we present a framework called state-set branching that combines symbolic search based on reduced ordered Binary Decision Diagrams (BDDs) with best-first search, such as A* and greedy best-first search. The framework relies on an extension of these algorithms from expanding a sing...
Tracheobronchial Branching Anomalies
Energy Technology Data Exchange (ETDEWEB)
Hong, Min Ji; Kim, Young Tong; Jou, Sung Shick [Soonchunhyang University, Cheonan Hospital, Cheonan (Korea, Republic of); Park, A Young [Soonchunhyang University College of Medicine, Asan (Korea, Republic of)
2010-04-15
There are various congenital anomalies with respect to the number, length, diameter, and location of tracheobronchial branching patterns. The tracheobronchial anomalies are classified into two groups. The first one, anomalies of division, includes tracheal bronchus, cardiac bronchus, tracheal diverticulum, pulmonary isomerism, and minor variations. The second one, dysmorphic lung, includes lung agenesis-hypoplasia complex and lobar agenesis-aplasia complex
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....
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…
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.
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.
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...
Improving mathematical problem solving : A computerized approach
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
Generalized Markov branching models
Li, Junping
2005-01-01
In this thesis, we first considered a modified Markov branching process incorporating both state-independent immigration and resurrection. After establishing the criteria for regularity and uniqueness, explicit expressions for the extinction probability and mean extinction time are presented. The criteria for recurrence and ergodicity are also established. In addition, an explicit expression for the equilibrium distribution is presented.\\ud \\ud We then moved on to investigate the basic proper...
Buskulic, Damir; De Bonis, I; Décamp, D; Ghez, P; Goy, C; Lees, J P; Lucotte, A; Minard, M N; Odier, P; Pietrzyk, B; Ariztizabal, F; Chmeissani, M; Crespo, J M; Efthymiopoulos, I; Fernández, E; Fernández-Bosman, M; Gaitan, V; Garrido, L; Martínez, M; Orteu, S; Pacheco, A; Padilla, C; Palla, Fabrizio; Pascual, A; Perlas, J A; Sánchez, F; Teubert, F; Colaleo, A; Creanza, D; De Palma, M; Farilla, A; Gelao, G; Girone, M; Iaselli, Giuseppe; Maggi, G; Maggi, M; Marinelli, N; Natali, S; Nuzzo, S; Ranieri, A; Raso, G; Romano, F; Ruggieri, F; Selvaggi, G; Silvestris, L; Tempesta, P; Zito, G; Huang, X; Lin, J; Ouyang, Q; Wang, T; Xie, Y; Xu, R; Xue, S; Zhang, J; Zhang, L; Zhao, W; Bonvicini, G; Cattaneo, M; Comas, P; Coyle, P; Drevermann, H; Engelhardt, A; Forty, Roger W; Frank, M; Hagelberg, R; Harvey, J; Jacobsen, R; Janot, P; Jost, B; Kneringer, E; Knobloch, J; Lehraus, Ivan; Markou, C; Martin, E B; Mato, P; Minten, Adolf G; Miquel, R; Oest, T; Palazzi, P; Pater, J R; Pusztaszeri, J F; Ranjard, F; Rensing, P E; Rolandi, Luigi; Schlatter, W D; Schmelling, M; Schneider, O; Tejessy, W; Tomalin, I R; Venturi, A; Wachsmuth, H W; Wiedenmann, W; Wildish, T; Witzeling, W; Wotschack, J; Ajaltouni, Ziad J; Bardadin-Otwinowska, Maria; Barrès, A; Boyer, C; Falvard, A; Gay, P; Guicheney, C; Henrard, P; Jousset, J; Michel, B; Monteil, S; Montret, J C; Pallin, D; Perret, P; Podlyski, F; Proriol, J; Rossignol, J M; Saadi, F; Fearnley, Tom; Hansen, J B; Hansen, J D; Hansen, J R; Hansen, P H; Nilsson, B S; Kyriakis, A; Simopoulou, Errietta; Siotis, I; Vayaki, Anna; Zachariadou, K; Blondel, A; Bonneaud, G R; Brient, J C; Bourdon, P; Passalacqua, L; Rougé, A; Rumpf, M; Tanaka, R; Valassi, Andrea; Verderi, M; Videau, H L; Candlin, D J; Parsons, M I; Focardi, E; Parrini, G; Corden, M; Delfino, M C; Georgiopoulos, C H; Jaffe, D E; Antonelli, A; Bencivenni, G; Bologna, G; Bossi, F; Campana, P; Capon, G; Chiarella, V; Felici, G; Laurelli, P; Mannocchi, G; Murtas, F; Murtas, G P; Pepé-Altarelli, M; Dorris, S J; Halley, A W; ten Have, I; Knowles, I G; Lynch, J G; Morton, W T; O'Shea, V; Raine, C; Reeves, P; Scarr, J M; Smith, K; Smith, M G; Thompson, A S; Thomson, F; Thorn, S; Turnbull, R M; Becker, U; Braun, O; Geweniger, C; Graefe, G; Hanke, P; Hepp, V; Kluge, E E; Putzer, A; Rensch, B; Schmidt, M; Sommer, J; Stenzel, H; Tittel, K; Werner, S; Wunsch, M; Beuselinck, R; Binnie, David M; Cameron, W; Colling, D J; Dornan, Peter J; Konstantinidis, N P; Moneta, L; Moutoussi, A; Nash, J; San Martin, G; Sedgbeer, J K; Stacey, A M; Dissertori, G; Girtler, P; Kuhn, D; Rudolph, G; Bowdery, C K; Brodbeck, T J; Colrain, P; Crawford, G; Finch, A J; Foster, F; Hughes, G; Sloan, Terence; Whelan, E P; Williams, M I; Galla, A; Greene, A M; Kleinknecht, K; Quast, G; Raab, J; Renk, B; Sander, H G; Wanke, R; Van Gemmeren, P; Zeitnitz, C; Aubert, Jean-Jacques; Bencheikh, A M; Benchouk, C; Bonissent, A; Bujosa, G; Calvet, D; Carr, J; Diaconu, C A; Etienne, F; Thulasidas, M; Nicod, D; Payre, P; Rousseau, D; Talby, M; Abt, I; Assmann, R W; Bauer, C; Blum, Walter; Brown, D; Dietl, H; Dydak, Friedrich; Ganis, G; Gotzhein, C; Jakobs, K; Kroha, H; Lütjens, G; Lutz, Gerhard; Männer, W; Moser, H G; Richter, R H; Rosado-Schlosser, A; Schael, S; Settles, Ronald; Seywerd, H C J; Saint-Denis, R; Wolf, G; Alemany, R; Boucrot, J; Callot, O; Cordier, A; Courault, F; Davier, M; Duflot, L; Grivaz, J F; Heusse, P; Jacquet, M; Kim, D W; Le Diberder, F R; Lefrançois, J; Lutz, A M; Musolino, G; Nikolic, I A; Park, H J; Park, I C; Schune, M H; Simion, S; Veillet, J J; Videau, I; Abbaneo, D; Azzurri, P; Bagliesi, G; Batignani, G; Bettarini, S; Bozzi, C; Calderini, G; Carpinelli, M; Ciocci, M A; Ciulli, V; Dell'Orso, R; Fantechi, R; Ferrante, I; Foà, L; Forti, F; Giassi, A; Giorgi, M A; Gregorio, A; Ligabue, F; Lusiani, A; Marrocchesi, P S; Messineo, A; Rizzo, G; Sanguinetti, G; Sciabà, A; Spagnolo, P; Steinberger, Jack; Tenchini, Roberto; Tonelli, G; Triggiani, G; Vannini, C; Verdini, P G; Walsh, J; Betteridge, A P; Blair, G A; Bryant, L M; Cerutti, F; Gao, Y; Green, M G; Johnson, D L; Medcalf, T; Mir, L M; Perrodo, P; Strong, J A; Bertin, V; Botterill, David R; Clifft, R W; Edgecock, T R; Haywood, S; Edwards, M; Maley, P; Norton, P R; Thompson, J C; Bloch-Devaux, B; Colas, P; Emery, S; Kozanecki, Witold; Lançon, E; Lemaire, M C; Locci, E; Marx, B; Pérez, P; Rander, J; Renardy, J F; Roussarie, A; Schuller, J P; Schwindling, J; Trabelsi, A; Vallage, B; Johnson, R P; Kim, H Y; Litke, A M; McNeil, M A; Taylor, G; Beddall, A; Booth, C N; Boswell, R; Cartwright, S L; Combley, F; Dawson, I; Köksal, A; Letho, M; Newton, W M; Rankin, C; Thompson, L F; Böhrer, A; Brandt, S; Cowan, G D; Feigl, E; Grupen, Claus; Lutters, G; Minguet-Rodríguez, J A; Rivera, F; Saraiva, P; Smolik, L; Stephan, F; Apollonio, M; Bosisio, L; Della Marina, R; Giannini, G; Gobbo, B; Ragusa, F; Rothberg, J E; Wasserbaech, S R; Armstrong, S R; Bellantoni, L; Elmer, P; Feng, Z; Ferguson, D P S; Gao, Y S; González, S; Grahl, J; Harton, J L; Hayes, O J; Hu, H; McNamara, P A; Nachtman, J M; Orejudos, W; Pan, Y B; Saadi, Y; Schmitt, M; Scott, I J; Sharma, V; Turk, J; Walsh, A M; Wu Sau Lan; Wu, X; Yamartino, J M; Zheng, M; Zobernig, G
1996-01-01
A sample of 62249 \\tau-pair events is selected from data taken with the ALEPH detector in 1991, 1992 and 1993. The measurement of the branching fractions for \\tau decays into electrons and muons is presented with emphasis on the study of systematic effects from selection, particle identification and decay classification. Combined with the most recent ALEPH determination of the \\tau lifetime, these results provide a relative measurement of the leptonic couplings in the weak charged current for transverse W bosons.
Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem
DEFF Research Database (Denmark)
Gamst, Mette; Petersen, Bjørn
2012-01-01
-Protocol Label Switching. The problem has previously been solved to optimality through branch-and-price. In this paper we propose two exact solution methods both based on an alternative decomposition. The two methods differ in their branching strategy. The first method, which branches on forbidden edge sequences...
The branch librarians' handbook
Rivers, Vickie
2004-01-01
""Recommended""--Booklist; ""an excellent addition...highly recommended""--Public Libraries; ""clear...very sound advice...strongly recommend""--Catholic Library World; ""excellent resource...organized...well written""--Against the Grain; ""interesting...thoroughly practical...a very good book...well organized...clearly written""--ARBA. This handbook covers a wide variety of issues that the branch librarian must deal with every day. Chapters are devoted to mission statements (the Dallas Public Library and Dayton Metro Library mission statements are highlighted as examples), library systems,
Interactive problem solving using LOGO
Boecker, Heinz-Dieter; Fischer, Gerhard
2014-01-01
This book is unique in that its stress is not on the mastery of a programming language, but on the importance and value of interactive problem solving. The authors focus on several specific interest worlds: mathematics, computer science, artificial intelligence, linguistics, and games; however, their approach can serve as a model that may be applied easily to other fields as well. Those who are interested in symbolic computing will find that Interactive Problem Solving Using LOGO provides a gentle introduction from which one may move on to other, more advanced computational frameworks or more
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.
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...
A primer on scientific programming with Python
Langtangen, Hans Petter
2014-01-01
The book serves as a first introduction to computer programming of scientific applications, using the high-level Python language. The exposition is example and problem-oriented, where the applications are taken from mathematics, numerical calculus, statistics, physics, biology and finance. The book teaches "Matlab-style" and procedural programming as well as object-oriented programming. High school mathematics is a required background and it is advantageous to study classical and numerical one-variable calculus in parallel with reading this book. Besides learning how to program computers, the reader will also learn how to solve mathematical problems, arising in various branches of science and engineering, with the aid of numerical methods and programming. By blending programming, mathematics and scientific applications, the book lays a solid foundation for practicing computational science. From the reviews: Langtangen … does an excellent job of introducing programming as a set of skills in problem solving. ...
A primer on scientific programming with Python
Langtangen, Hans Petter
2016-01-01
The book serves as a first introduction to computer programming of scientific applications, using the high-level Python language. The exposition is example and problem-oriented, where the applications are taken from mathematics, numerical calculus, statistics, physics, biology and finance. The book teaches "Matlab-style" and procedural programming as well as object-oriented programming. High school mathematics is a required background and it is advantageous to study classical and numerical one-variable calculus in parallel with reading this book. Besides learning how to program computers, the reader will also learn how to solve mathematical problems, arising in various branches of science and engineering, with the aid of numerical methods and programming. By blending programming, mathematics and scientific applications, the book lays a solid foundation for practicing computational science. From the reviews: Langtangen … does an excellent job of introducing programming as a set of skills in problem solving. ...
A 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....
Quiver Varieties and Branching
Directory of Open Access Journals (Sweden)
Hiraku Nakajima
2009-01-01
Full Text Available Braverman and Finkelberg recently proposed the geometric Satake correspondence for the affine Kac-Moody group Gaff [Braverman A., Finkelberg M., arXiv:0711.2083]. They conjecture that intersection cohomology sheaves on the Uhlenbeck compactification of the framed moduli space of Gcpt-instantons on $R^4/Z_r$ correspond to weight spaces of representations of the Langlands dual group $G_{aff}^{vee}$ at level $r$. When $G = SL(l$, the Uhlenbeck compactification is the quiver variety of type $sl(r_{aff}$, and their conjecture follows from the author's earlier result and I. Frenkel's level-rank duality. They further introduce a convolution diagram which conjecturally gives the tensor product multiplicity [Braverman A., Finkelberg M., Private communication, 2008]. In this paper, we develop the theory for the branching in quiver varieties and check this conjecture for $G = SL(l$.
Integrating over Higgs branches
International Nuclear Information System (INIS)
Moore, G.; Shatashvili, S.
2000-01-01
We develop some useful techniques for integrating over Higgs branches in supersymmetric theories with 4 and 8 supercharges. In particular, we define a regularized volume for hyperkaehler quotients. We evaluate this volume for certain ALE and ALF spaces in terms of the hyperkaehler periods. We also reduce these volumes for a large class of hyperkaehler quotients to simpler integrals. These quotients include complex coadjoint orbits, instanton moduli spaces on R 4 and ALE manifolds, Hitchin spaces, and moduli spaces of (parabolic) Higgs bundles on Riemann surfaces. In the case of Hitchin spaces the evaluation of the volume reduces to a summation over solutions of Bethe ansatz equations for the non-linear Schroedinger system. We discuss some applications of our results. (orig.)
The efficiency of bank branches
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...
Methods and Technologies Branch (MTB)
The Methods and Technologies Branch focuses on methods to address epidemiologic data collection, study design and analysis, and to modify technological approaches to better understand cancer susceptibility.
Coyle, Shawn; Jones, Thea; Pickle, Shirley Kirk
2009-01-01
This article presents a sample of online learning programs serving very different populations: a small district spread over a vast area, a large inner school district, and a statewide program serving numerous districts. It describes how these districts successfully implemented e-learning programs in their schools and discusses the positive impact…
Solving applied mathematical problems with Matlab
Xue, Dingyu
2008-01-01
Computer Mathematics Language-An Overview. Fundamentals of MATLAB Programming. Calculus Problems. MATLAB Computations of Linear Algebra Problems. Integral Transforms and Complex Variable Functions. Solutions to Nonlinear Equations and Optimization Problems. MATLAB Solutions to Differential Equation Problems. Solving Interpolations and Approximations Problems. Solving Probability and Mathematical Statistics Problems. Nontraditional Solution Methods for Mathematical Problems.
Buskulic, Damir; De Bonis, I; Décamp, D; Ghez, P; Goy, C; Lees, J P; Lucotte, A; Minard, M N; Odier, P; Pietrzyk, B; Ariztizabal, F; Chmeissani, M; Crespo, J M; Efthymiopoulos, I; Fernández, E; Fernández-Bosman, M; Gaitan, V; Martínez, M; Orteu, S; Pacheco, A; Padilla, C; Palla, Fabrizio; Pascual, A; Perlas, J A; Sánchez, F; Teubert, F; Colaleo, A; Creanza, D; De Palma, M; Farilla, A; Gelao, G; Girone, M; Iaselli, Giuseppe; Maggi, G; Maggi, M; Marinelli, N; Natali, S; Nuzzo, S; Ranieri, A; Raso, G; Romano, F; Ruggieri, F; Selvaggi, G; Silvestris, L; Tempesta, P; Zito, G; Huang, X; Lin, J; Ouyang, Q; Wang, T; Xie, Y; Xu, R; Xue, S; Zhang, J; Zhang, L; Zhao, W; Bonvicini, G; Cattaneo, M; Comas, P; Coyle, P; Drevermann, H; Engelhardt, A; Forty, Roger W; Frank, M; Hagelberg, R; Harvey, J; Jacobsen, R; Janot, P; Jost, B; Kneringer, E; Knobloch, J; Lehraus, Ivan; Markou, C; Martin, E B; Mato, P; Minten, Adolf G; Miquel, R; Oest, T; Palazzi, P; Pater, J R; Pusztaszeri, J F; Ranjard, F; Rensing, P E; Rolandi, Luigi; Schlatter, W D; Schmelling, M; Schneider, O; Tejessy, W; Tomalin, I R; Venturi, A; Wachsmuth, H W; Wiedenmann, W; Wildish, T; Witzeling, W; Wotschack, J; Ajaltouni, Ziad J; Bardadin-Otwinowska, Maria; Barrès, A; Boyer, C; Falvard, A; Gay, P; Guicheney, C; Henrard, P; Jousset, J; Michel, B; Monteil, S; Pallin, D; Perret, P; Podlyski, F; Proriol, J; Rossignol, J M; Saadi, F; Fearnley, Tom; Hansen, J B; Hansen, J D; Hansen, J R; Hansen, P H; Nilsson, B S; Kyriakis, A; Simopoulou, Errietta; Siotis, I; Vayaki, Anna; Zachariadou, K; Blondel, A; Bonneaud, G R; Brient, J C; Bourdon, P; Passalacqua, L; Rougé, A; Rumpf, M; Tanaka, R; Valassi, Andrea; Verderi, M; Videau, H L; Candlin, D J; Parsons, M I; Focardi, E; Parrini, G; Corden, M; Delfino, M C; Georgiopoulos, C H; Jaffe, D E; Antonelli, A; Bencivenni, G; Bologna, G; Bossi, F; Campana, P; Capon, G; Chiarella, V; Felici, G; Laurelli, P; Mannocchi, G; Murtas, F; Murtas, G P; Pepé-Altarelli, M; Dorris, S J; Halley, A W; ten Have, I; Knowles, I G; Lynch, J G; Morton, W T; O'Shea, V; Raine, C; Reeves, P; Scarr, J M; Smith, K; Smith, M G; Thompson, A S; Thomson, F; Thorn, S; Turnbull, R M; Becker, U; Braun, O; Geweniger, C; Graefe, G; Hanke, P; Hepp, V; Kluge, E E; Putzer, A; Rensch, B; Schmidt, M; Sommer, J; Stenzel, H; Tittel, K; Werner, S; Wunsch, M; Beuselinck, R; Binnie, David M; Cameron, W; Colling, D J; Dornan, Peter J; Konstantinidis, N P; Moneta, L; Moutoussi, A; Nash, J; San Martin, G; Sedgbeer, J K; Stacey, A M; Dissertori, G; Girtler, P; Kuhn, D; Rudolph, G; Bowdery, C K; Brodbeck, T J; Colrain, P; Crawford, G; Finch, A J; Foster, F; Hughes, G; Sloan, Terence; Whelan, E P; Williams, M I; Galla, A; Greene, A M; Kleinknecht, K; Quast, G; Raab, J; Renk, B; Sander, H G; Wanke, R; Van Gemmeren, P; Zeitnitz, C; Aubert, Jean-Jacques; Bencheikh, A M; Benchouk, C; Bonissent, A; Bujosa, G; Calvet, D; Carr, J; Diaconu, C A; Etienne, F; Thulasidas, M; Nicod, D; Payre, P; Rousseau, D; Talby, M; Abt, I; Assmann, R W; Bauer, C; Blum, Walter; Brown, D; Dietl, H; Dydak, Friedrich; Ganis, G; Gotzhein, C; Jakobs, K; Kroha, H; Lütjens, G; Lutz, Gerhard; Männer, W; Moser, H G; Richter, R H; Rosado-Schlosser, A; Schael, S; Settles, Ronald; Seywerd, H C J; Saint-Denis, R; Wolf, G; Alemany, R; Boucrot, J; Callot, O; Cordier, A; Courault, F; Davier, M; Duflot, L; Grivaz, J F; Heusse, P; Jacquet, M; Kim, D W; Le Diberder, F R; Lefrançois, J; Lutz, A M; Musolino, G; Nikolic, I A; Park, H J; Park, I C; Schune, M H; Simion, S; Veillet, J J; Videau, I; Abbaneo, D; Azzurri, P; Bagliesi, G; Batignani, G; Bettarini, S; Bozzi, C; Calderini, G; Carpinelli, M; Ciocci, M A; Ciulli, V; Dell'Orso, R; Fantechi, R; Ferrante, I; Foà, L; Forti, F; Giassi, A; Giorgi, M A; Gregorio, A; Ligabue, F; Lusiani, A; Marrocchesi, P S; Messineo, A; Rizzo, G; Sanguinetti, G; Sciabà, A; Spagnolo, P; Steinberger, Jack; Tenchini, Roberto; Tonelli, G; Triggiani, G; Vannini, C; Verdini, P G; Walsh, J; Betteridge, A P; Blair, G A; Bryant, L M; Cerutti, F; Gao, Y; Green, M G; Johnson, D L; Medcalf, T; Mir, L M; Perrodo, P; Strong, J A; Bertin, V; Botterill, David R; Clifft, R W; Edgecock, T R; Haywood, S; Edwards, M; Maley, P; Norton, P R; Thompson, J C; Bloch-Devaux, B; Colas, P; Emery, S; Kozanecki, Witold; Lançon, E; Lemaire, M C; Locci, E; Marx, B; Pérez, P; Rander, J; Renardy, J F; Roussarie, A; Schuller, J P; Schwindling, J; Trabelsi, A; Vallage, B; Johnson, R P; Kim, H Y; Litke, A M; McNeil, M A; Taylor, G; Beddall, A; Booth, C N; Boswell, R; Cartwright, S L; Combley, F; Dawson, I; Köksal, A; Letho, M; Newton, W M; Rankin, C; Thompson, L F; Böhrer, A; Brandt, S; Cowan, G D; Feigl, E; Grupen, Claus; Lutters, G; Minguet-Rodríguez, J A; Rivera, F; Saraiva, P; Smolik, L; Stephan, F; Apollonio, M; Bosisio, L; Della Marina, R; Giannini, G; Gobbo, B; Ragusa, F; Rothberg, J E; Wasserbaech, S R; Armstrong, S R; Bellantoni, L; Elmer, P; Feng, Z; Ferguson, D P S; Gao, Y S; González, S; Grahl, J; Harton, J L; Hayes, O J; Hu, H; McNamara, P A; Nachtman, J M; Orejudos, W; Pan, Y B; Saadi, Y; Schmitt, M; Scott, I J; Sharma, V; Turk, J; Walsh, A M; Wu Sau Lan; Wu, X; Yamartino, J M; Zheng, M; Zobernig, G
1996-01-01
From 64492 selected \\tau-pair events, produced at the Z^0 resonance, the measurement of the tau decays into hadrons from a global analysis using 1991, 1992 and 1993 ALEPH data is presented. Special emphasis is given to the reconstruction of photons and \\pi^0's, and the removal of fake photons. A detailed study of the systematics entering the \\pi^0 reconstruction is also given. A complete and consistent set of tau hadronic branching ratios is presented for 18 exclusive modes. Most measurements are more precise than the present world average. The new level of precision reached allows a stringent test of \\tau-\\mu universality in hadronic decays, g_\\tau/g_\\mu \\ = \\ 1.0013 \\ \\pm \\ 0.0095, and the first measurement of the vector and axial-vector contributions to the non-strange hadronic \\tau decay width: R_{\\tau ,V} \\ = \\ 1.788 \\ \\pm \\ 0.025 and R_{\\tau ,A} \\ = \\ 1.694 \\ \\pm \\ 0.027. The ratio (R_{\\tau ,V} - R_{\\tau ,A}) / (R_{\\tau ,V} + R_{\\tau ,A}), equal to (2.7 \\pm 1.3) \\ \\%, is a measure of the importance of Q...
Su, Addison Y. S.; Yang, Stephen J. H.; Hwang, Wu-Yuin; Huang, Chester S. J.; Tern, Ming-Yu
2014-01-01
For more than 2 years, Scratch programming has been taught in Taiwanese elementary schools. However, past studies have shown that it is difficult to find appropriate learning methods or tools to boost students' Scratch programming performance. This inability to readily identify tutoring tools has become one of the primary challenges addressed in…
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.
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...
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
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...
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....
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
Energy Technology Data Exchange (ETDEWEB)
Wichapa, Narong; Khokhajaikiat, Porntep
2017-07-01
Disposal of infectious waste remains one of the most serious problems in the social and environmental domains of almost every nation. Selection of new suitable locations and finding the optimal set of transport routes to transport infectious waste, namely location routing problem for infectious waste disposal, is one of the major problems in hazardous waste management. Design/methodology/approach: Due to the complexity of this problem, location routing problem for a case study, forty hospitals and three candidate municipalities in sub-Northeastern Thailand, was divided into two phases. The first phase is to choose suitable municipalities using hybrid fuzzy goal programming model which hybridizes the fuzzy analytic hierarchy process and fuzzy goal programming. The second phase is to find the optimal routes for each selected municipality using hybrid genetic algorithm which hybridizes the genetic algorithm and local searches including 2-Opt-move, Insertion-move and ?-interchange-move. Findings: The results indicate that the hybrid fuzzy goal programming model can guide the selection of new suitable municipalities, and the hybrid genetic algorithm can provide the optimal routes for a fleet of vehicles effectively. Originality/value: The novelty of the proposed methodologies, hybrid fuzzy goal programming model, is the simultaneous combination of both intangible and tangible factors in order to choose new suitable locations, and the hybrid genetic algorithm can be used to determine the optimal routes which provide a minimum number of vehicles and minimum transportation cost under the actual situation, efficiently.
International Nuclear Information System (INIS)
Wichapa, Narong; Khokhajaikiat, Porntep
2017-01-01
Disposal of infectious waste remains one of the most serious problems in the social and environmental domains of almost every nation. Selection of new suitable locations and finding the optimal set of transport routes to transport infectious waste, namely location routing problem for infectious waste disposal, is one of the major problems in hazardous waste management. Design/methodology/approach: Due to the complexity of this problem, location routing problem for a case study, forty hospitals and three candidate municipalities in sub-Northeastern Thailand, was divided into two phases. The first phase is to choose suitable municipalities using hybrid fuzzy goal programming model which hybridizes the fuzzy analytic hierarchy process and fuzzy goal programming. The second phase is to find the optimal routes for each selected municipality using hybrid genetic algorithm which hybridizes the genetic algorithm and local searches including 2-Opt-move, Insertion-move and ?-interchange-move. Findings: The results indicate that the hybrid fuzzy goal programming model can guide the selection of new suitable municipalities, and the hybrid genetic algorithm can provide the optimal routes for a fleet of vehicles effectively. Originality/value: The novelty of the proposed methodologies, hybrid fuzzy goal programming model, is the simultaneous combination of both intangible and tangible factors in order to choose new suitable locations, and the hybrid genetic algorithm can be used to determine the optimal routes which provide a minimum number of vehicles and minimum transportation cost under the actual situation, efficiently.
Directory of Open Access Journals (Sweden)
Narong Wichapa
2017-11-01
Originality/value: The novelty of the proposed methodologies, hybrid fuzzy goal programming model, is the simultaneous combination of both intangible and tangible factors in order to choose new suitable locations, and the hybrid genetic algorithm can be used to determine the optimal routes which provide a minimum number of vehicles and minimum transportation cost under the actual situation, efficiently.
On Solving Aircraft Conflict Avoidance Using Deterministic Global Optimization (sBB) Codes
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
Singh, Chandralekha
2009-07-01
One finding of cognitive research is that people do not automatically acquire usable knowledge by spending lots of time on task. Because students' knowledge hierarchy is more fragmented, "knowledge chunks" are smaller than those of experts. The limited capacity of short term memory makes the cognitive load high during problem solving tasks, leaving few cognitive resources available for meta-cognition. The abstract nature of the laws of physics and the chain of reasoning required to draw meaningful inferences makes these issues critical. In order to help students, it is crucial to consider the difficulty of a problem from the perspective of students. We are developing and evaluating interactive problem-solving tutorials to help students in the introductory physics courses learn effective problem-solving strategies while solidifying physics concepts. The self-paced tutorials can provide guidance and support for a variety of problem solving techniques, and opportunity for knowledge and skill acquisition.
Teaching Creative Problem Solving.
Christensen, Kip W.; Martin, Loren
1992-01-01
Interpersonal and cognitive skills, adaptability, and critical thinking can be developed through problem solving and cooperative learning in technology education. These skills have been identified as significant needs of the workplace as well as for functioning in society. (SK)
Supporting Organizational Problem Solving with a Workstation.
1982-07-01
G. [., and Sussman, G. J. AMORD: Explicit Control or Reasoning. In Proceedings of the Symposium on Artificial Intellignece and Programming Languagues...0505 9. PERFORMING ORGANIZATION NAME AND ADDRESS 10. PROGRAM ELEMENT. PROJECT. TASK Artificial Intelligence Laboratory AREA& WORK UNIT NUMBERS 545...extending ideas from the field of Artificial Intelligence (A), we describ office work as a problem solving activity. A knowledge embedding language called
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.
Applying Lakatos' Theory to the Theory of Mathematical Problem Solving.
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)
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
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.
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
Local Strategy Improvement for Parity Game Solving
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...
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.
Coulomb branches with complex singularities
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.
International Nuclear Information System (INIS)
Ondis, L.A. II; Tyburski, L.J.; Moskowitz, B.S.
2000-01-01
The RCP01 Monte Carlo program is used to analyze many geometries of interest in nuclear design and analysis of light water moderated reactors such as the core in its pressure vessel with complex piping arrangement, fuel storage arrays, shipping and container arrangements, and neutron detector configurations. Written in FORTRAN and in use on a variety of computers, it is capable of estimating steady state neutron or photon reaction rates and neutron multiplication factors. The energy range covered in neutron calculations is that relevant to the fission process and subsequent slowing-down and thermalization, i.e., 20 MeV to 0 eV. The same energy range is covered for photon calculations
Energy Technology Data Exchange (ETDEWEB)
Ondis, L.A., II; Tyburski, L.J.; Moskowitz, B.S.
2000-03-01
The RCP01 Monte Carlo program is used to analyze many geometries of interest in nuclear design and analysis of light water moderated reactors such as the core in its pressure vessel with complex piping arrangement, fuel storage arrays, shipping and container arrangements, and neutron detector configurations. Written in FORTRAN and in use on a variety of computers, it is capable of estimating steady state neutron or photon reaction rates and neutron multiplication factors. The energy range covered in neutron calculations is that relevant to the fission process and subsequent slowing-down and thermalization, i.e., 20 MeV to 0 eV. The same energy range is covered for photon calculations.
Navon, I. M.; Yu, Jian
A FORTRAN computer program is presented and documented applying the Turkel-Zwas explicit large time-step scheme to a hemispheric barotropic model with constraint restoration of integral invariants of the shallow-water equations. We then proceed to detail the algorithms embodied in the code EXSHALL in this paper, particularly algorithms related to the efficiency and stability of T-Z scheme and the quadratic constraint restoration method which is based on a variational approach. In particular we provide details about the high-latitude filtering, Shapiro filtering, and Robert filtering algorithms used in the code. We explain in detail the various subroutines in the EXSHALL code with emphasis on algorithms implemented in the code and present the flowcharts of some major subroutines. Finally, we provide a visual example illustrating a 4-day run using real initial data, along with a sample printout and graphic isoline contours of the height field and velocity fields.
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....
DEFF Research Database (Denmark)
Chemi, Tatiana
2016-01-01
This chapter aims to deconstruct some persistent myths about creativity: the myth of individualism and of the genius. By looking at literature that approaches creativity as a participatory and distributed phenomenon and by bringing empirical evidence from artists’ studios, the author presents a p......, what can educators at higher education learn from the ways creative groups solve problems? How can artists contribute to inspiring higher education?......This chapter aims to deconstruct some persistent myths about creativity: the myth of individualism and of the genius. By looking at literature that approaches creativity as a participatory and distributed phenomenon and by bringing empirical evidence from artists’ studios, the author presents...... a perspective that is relevant to higher education. The focus here is on how artists solve problems in distributed paths, and on the elements of creative collaboration. Creative problem-solving will be looked at as an ongoing dialogue that artists engage with themselves, with others, with recipients...
Branch-pipe-routing approach for ships using improved genetic algorithm
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.
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 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....
Directory of Open Access Journals (Sweden)
Narong Wichapa
Full Text Available The selection of a suitable location for infectious waste disposal is one of the major problems in waste management. Determining the location of infectious waste disposal centers is a difficult and complex process because it requires combining social and environmental factors that are hard to interpret, and cost factors that require the allocation of resources. Additionally, it depends on several regulations. Based on the actual conditions of a case study, forty hospitals and three candidate municipalities in the sub-Northeast region of Thailand, we considered multiple factors such as infrastructure, geological and social & environmental factors, calculating global priority weights using the fuzzy analytical hierarchy process (FAHP. After that, a new multi-objective facility location problem model which combines FAHP and goal programming (GP, namely the FAHP-GP model, was tested. The proposed model can lead to selecting new suitable locations for infectious waste disposal by considering both total cost and final priority weight objectives. The novelty of the proposed model is the simultaneous combination of relevant factors that are difficult to interpret and cost factors, which require the allocation of resources. Keywords: Multi-objective facility location problem, Fuzzy analytic hierarchy process, Infectious waste disposal centers
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 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....
Cash efficiency for bank branches.
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.
Risk Factor Assessment Branch (RFAB)
The Risk Factor Assessment Branch (RFAB) focuses on the development, evaluation, and dissemination of high-quality risk factor metrics, methods, tools, technologies, and resources for use across the cancer research continuum, and the assessment of cancer-related risk factors in the population.
Introspection in Problem Solving
Jäkel, Frank; Schreiber, Cornell
2013-01-01
Problem solving research has encountered an impasse. Since the seminal work of Newell und Simon (1972) researchers do not seem to have made much theoretical progress (Batchelder and Alexander, 2012; Ohlsson, 2012). In this paper we argue that one factor that is holding back the field is the widespread rejection of introspection among cognitive…
Greene, Kim; Heyck-Williams, Jeff; Timpson Gray, Elicia
2017-01-01
Problem solving spans all grade levels and content areas, as evidenced by this compilation of projects from schools across the United States. In one project, high school girls built a solar-powered tent to serve their city's homeless population. In another project, 4th graders explored historic Jamestown to learn about the voices lost to history.…
Solving Linear Differential Equations
Nguyen, K.A.; Put, M. van der
2010-01-01
The theme of this paper is to 'solve' an absolutely irreducible differential module explicitly in terms of modules of lower dimension and finite extensions of the differential field K. Representations of semi-simple Lie algebras and differential Galo is theory are the main tools. The results extend
Utomo, P.H.; Makarim, R.H.
2017-01-01
A Binary puzzle is a Sudoku-like puzzle with values in each cell taken from the set {0,1} {0,1}. Let n≥4 be an even integer, a solved binary puzzle is an n×n binary array that satisfies the following conditions: (1) no three consecutive ones and no three consecutive zeros in each row and each
Ayrinhac, Simon
2014-01-01
We present in this work a demonstration of the maze-solving problem with electricity. Electric current flowing in a maze as a printed circuit produces Joule heating and the right way is instantaneously revealed with infrared thermal imaging. The basic properties of electric current can be discussed in this context, with this challenging question:…
Transport equation solving methods
International Nuclear Information System (INIS)
Granjean, P.M.
1984-06-01
This work is mainly devoted to Csub(N) and Fsub(N) methods. CN method: starting from a lemma stated by Placzek, an equivalence is established between two problems: the first one is defined in a finite medium bounded by a surface S, the second one is defined in the whole space. In the first problem the angular flux on the surface S is shown to be the solution of an integral equation. This equation is solved by Galerkin's method. The Csub(N) method is applied here to one-velocity problems: in plane geometry, slab albedo and transmission with Rayleigh scattering, calculation of the extrapolation length; in cylindrical geometry, albedo and extrapolation length calculation with linear scattering. Fsub(N) method: the basic integral transport equation of the Csub(N) method is integrated on Case's elementary distributions; another integral transport equation is obtained: this equation is solved by a collocation method. The plane problems solved by the Csub(N) method are also solved by the Fsub(N) method. The Fsub(N) method is extended to any polynomial scattering law. Some simple spherical problems are also studied. Chandrasekhar's method, collision probability method, Case's method are presented for comparison with Csub(N) and Fsub(N) methods. This comparison shows the respective advantages of the two methods: a) fast convergence and possible extension to various geometries for Csub(N) method; b) easy calculations and easy extension to polynomial scattering for Fsub(N) method [fr
Dobbs, David E.
2013-01-01
A direct method is given for solving first-order linear recurrences with constant coefficients. The limiting value of that solution is studied as "n to infinity." This classroom note could serve as enrichment material for the typical introductory course on discrete mathematics that follows a calculus course.
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.
Directory of Open Access Journals (Sweden)
Yaritza Tardo Fernández
2013-02-01
Full Text Available The cultural, technological and eminently social character of the computer programming problems solving process, joined with the complexity and difficulties detected in their teaching, has contributed to increase the concern about the study of the processes of communication, transmission and understanding of computer programming and to attract the attention of a wide scientific community in correspondence with the growing development that this reaches at the present time. That is the reason why this paper has the objective of discover, from the didactic point of view, the integrators axes of an algorithmic logic that solves the contradiction that is revealed in the formative process between the mathematic modeling and their algorithmic systematization to empower an efficient performance of the professionals of Computer Science and Computer Engineering. In this sense a new didactic proposal is based, that consist in an algorithmic logic, in which are specified and explained those essentials processes that should be carry out to solve computer programming problems. Based on the theoretical fundaments, we concluded that these processes constitute didactics moments, required in order to solve the contradiction mentioned before.RESUMENEl carácter eminentemente social, cultural y tecnológico del proceso de resolución de problemas de programación computacional, junto a la complejidad y dificultades detectadas en su enseñanza, han contribuido a despertar la preocupación por el estudio de los procesos de comunicación, transmisión y comprensión de la Programación y a interesar a una amplia comunidad científica en correspondencia con el creciente desarrollo que ésta alcanza en la actualidad. Razón por la cual este trabajo tiene como objetivo que se develen, desde el punto de vista didáctico, los ejes integradores de una lógica algorítmica que sea contentiva de la solución a la contradicción que se revela en el proceso formativo entre la
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
Toward Solving the Problem of Problem Solving: An Analysis Framework
Roesler, Rebecca A.
2016-01-01
Teaching is replete with problem solving. Problem solving as a skill, however, is seldom addressed directly within music teacher education curricula, and research in music education has not examined problem solving systematically. A framework detailing problem-solving component skills would provide a needed foundation. I observed problem solving…
Alesiani, Roberta; Boccalon, Silvia; Giarolli, Laura; Blum, Nancee; Fossati, Andrea
2014-05-01
In this study we present a clinical application of the STEPPS model in an Italian sample of severely affected patients with borderline personality disorder (BPD) or personality disorder (PD) with prominent borderline features in comorbidity with a mood disorder. The aims of this work are: 1) to confirm our preliminary results in a larger sample and at a 12-month follow-up, and 2) to identify predictors of drop-out vs completion of STEPPS in order to understand which characteristics of patients make them suitable or not for this treatment. The sample is composed of 32 subjects recruited from a population of inpatients of the Mood Disorders Center, Department of Clinical Neurosciences, Hospital San Raffaele-Turro, Milan. To confirm STEPPS efficacy at 12-month follow-up, we selected the following outcome criteria: reduction in the number of hospitalizations related to self-harm acts; reduction in the number of suicidal attempts; reduction of perceived emotional intensity levels; changes in cognitive filter scores; changes in the scores on self-report questionnaires. To identify predictors of drop-out vs completion, we analysed the following variables: demographic features (sex, marital status, school level achieved, and job status); Axis-I diagnosis; Axis-II categorical and dimensional diagnosis; and personality features. Seventeen (53%) subjects completed the treatment successfully. The drop-out rate was 47%. Patients who completed the program show a significant decrease in the number of hospitalizations, both at the end of the treatment and at 12-month follow-up. Friedman ANOVA test shows a significant decrease in suicidal attempts during and after STEPPS, and at 12-month follow-up. Analysis of drop-outs showed no significant differences with regard to sex, marital status, school level and job status between the two groups. Axis-I and Axis-II categorical diagnoses did not discriminate between the two groups. Those patients who dropped differ significantly from
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.
A Rubric for Assessing Students' Experimental Problem-Solving Ability
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…
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.)
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 branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
DEFF Research Database (Denmark)
Masson, Renaud; Røpke, Stefan; Lehuédé, Fabien
2014-01-01
for the PDPS and a branch-and-cut-and-price algorithm to solve it. The pricing sub-problem, an Elementary Shortest Path Problem with Resource Constraints (ESPPRC), is solved with a labeling algorithm enhanced with efficient dominance rules. Three families of valid inequalities are used to strengthen...
Branching 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
Creativity and Problem Solving
DEFF Research Database (Denmark)
Vidal, Rene Victor Valqui
2004-01-01
This paper presents some modern and interdisciplinary concepts about creativity and creative processes of special relevance for Operational Research workers. Central publications in the area Creativity-Operational Research are shortly reviewed. Some creative tools and the Creative Problem Solving...... approach are also discussed. Finally, some applications of these concepts and tools are outlined. Some central references are presented for further study of themes related to creativity or creative tools....
Creativity and problem Solving
Directory of Open Access Journals (Sweden)
René Victor Valqui Vidal
2004-12-01
Full Text Available This paper presents some modern and interdisciplinary concepts about creativity and creative processes of special relevance for Operational Research workers. Central publications in the area Creativity-Operational Research are shortly reviewed. Some creative tools and the Creative Problem Solving approach are also discussed. Finally, some applications of these concepts and tools are outlined. Some central references are presented for further study of themes related to creativity or creative tools.
Branching geodesics in normed spaces
International Nuclear Information System (INIS)
Ivanov, A O; Tuzhilin, A A
2002-01-01
We study branching extremals of length functionals on normed spaces. This is a natural generalization of the Steiner problem in normed spaces. We obtain criteria for a network to be extremal under deformations that preserve the topology of networks as well as under deformations with splitting. We discuss the connection between locally shortest networks and extremal networks. In the important particular case of the Manhattan plane, we get a criterion for a locally shortest network to be extremal
Cash efficiency for bank branches
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 ...
Solid State Photovoltaic Research Branch
Energy Technology Data Exchange (ETDEWEB)
1990-09-01
This report summarizes the progress of the Solid State Photovoltaic Research Branch of the Solar Energy Research Institute (SERI) from October 1, 1988, through September 30,l 1989. Six technical sections of the report cover these main areas of SERIs in-house research: Semiconductor Crystal Growth, Amorphous Silicon Research, Polycrystalline Thin Films, III-V High-Efficiency Photovoltaic Cells, Solid-State Theory, and Laser Raman and Luminescence Spectroscopy. Sections have been indexed separately for inclusion on the data base.
Learning Matlab a problem solving approach
Gander, Walter
2015-01-01
This comprehensive and stimulating introduction to Matlab, a computer language now widely used for technical computing, is based on an introductory course held at Qian Weichang College, Shanghai University, in the fall of 2014. Teaching and learning a substantial programming language aren’t always straightforward tasks. Accordingly, this textbook is not meant to cover the whole range of this high-performance technical programming environment, but to motivate first- and second-year undergraduate students in mathematics and computer science to learn Matlab by studying representative problems, developing algorithms and programming them in Matlab. While several topics are taken from the field of scientific computing, the main emphasis is on programming. A wealth of examples are completely discussed and solved, allowing students to learn Matlab by doing: by solving problems, comparing approaches and assessing the proposed solutions.
Solving Wicked Problems through Action Learning
Crul, Liselore
2014-01-01
This account of practice outlines the Oxyme Action Learning Program which was conducted as part of the Management Challenge in my final year of the MSc in Coaching and Behavioral Change at Henley Business School. The central research questions were: (1) how action learning can help to solve wicked problems and (2) what the effect of an action…
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...
Artificial Intelligence Research Branch future plans
Stewart, Helen (Editor)
1992-01-01
This report contains information on the activities of the Artificial Intelligence Research Branch (FIA) at NASA Ames Research Center (ARC) in 1992, as well as planned work in 1993. These activities span a range from basic scientific research through engineering development to fielded NASA applications, particularly those applications that are enabled by basic research carried out in FIA. Work is conducted in-house and through collaborative partners in academia and industry. All of our work has research themes with a dual commitment to technical excellence and applicability to NASA short, medium, and long-term problems. FIA acts as the Agency's lead organization for research aspects of artificial intelligence, working closely with a second research laboratory at the Jet Propulsion Laboratory (JPL) and AI applications groups throughout all NASA centers. This report is organized along three major research themes: (1) Planning and Scheduling: deciding on a sequence of actions to achieve a set of complex goals and determining when to execute those actions and how to allocate resources to carry them out; (2) Machine Learning: techniques for forming theories about natural and man-made phenomena; and for improving the problem-solving performance of computational systems over time; and (3) Research on the acquisition, representation, and utilization of knowledge in support of diagnosis design of engineered systems and analysis of actual systems.
DEFF Research Database (Denmark)
Hansen, David
2012-01-01
Many industrial production work systems have increased in complexity, and their new business model scompete on innovation, rather than low cost.At a medical device production facility committed to Lean Production, a research project was carried out to use Appreciative Inquiry to better engage...... employee strengths in continuou simprovements of the work system. The research question was: “How can Lean problem solving and Appreciative Inquiry be combined for optimized work system innovation?” The research project was carried out as a co-creation process with close cooperation between researcher...
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
2006-01-01
as a general approach to problem solving. We apply these Simonian ideas to organisational issues, specifically new organisational forms. Specifically, Simonian ideas allow us to develop a morphology of new organisational forms and to point to some design problems that characterise these forms.......Two of Herbert Simon's best-known papers are 'The Architecture of Complexity' and 'The Structure of Ill-Structured Problems.' We discuss the neglected links between these two papers, highlighting the role of decomposition in the context of problems on which constraints have been imposed...
1982-10-01
Artificial Intelig ~ence (Vol. III, edited by Paul R. Cohen and’ Edward A.. Feigenbaum)’, The chapter was written B’ Paul Cohen, with contributions... Artificial Intelligence (Vol. III, edited by Paul R. Cohen and EdWard A. Feigenbaum). The chapter was written by Paul R. Cohen, with contributions by Stephen...Wheevoats"EntermdI’ Planning and Problem ’Solving by Paul R. Cohen Chaptb-rXV-of Volumec III’of the Handbook of Artificial Intelligence edited by Paul R
Dynamic Crack Branching - A Photoelastic Evaluation,
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 Differential Equations in R: Package deSolve
In this paper we present the R package deSolve to solve initial value problems (IVP) written as ordinary differential equations (ODE), differential algebraic equations (DAE) of index 0 or 1 and partial differential equations (PDE), the latter solved using the method of lines appr...
Solving Differential Equations in R: Package deSolve
Soetaert, K.E.R.; Petzoldt, T.; Setzer, R.W.
2010-01-01
In this paper we present the R package deSolve to solve initial value problems (IVP) written as ordinary differential equations (ODE), differential algebraic equations (DAE) of index 0 or 1 and partial differential equations (PDE), the latter solved using the method of lines approach. The
Klenke, Andrew M.; Dell, Tim W.
2007-01-01
Graduates of the automotive technology program at Pittsburg State University (PSU) generally enter the workforce in some type of automotive management role. As a result, the program does not require students to purchase their own tools, and it does not have room for all 280 majors to roll around a personal tool chest. Each instructor must maintain…
Yamamoto, Keisuke; Tsuchisaka, Atsunari; Yukawa, Hideaki
Branched-chain amino acids (BCAAs), viz., L-isoleucine, L-leucine, and L-valine, are essential amino acids that cannot be synthesized in higher organisms and are important nutrition for humans as well as livestock. They are also valued as synthetic intermediates for pharmaceuticals. Therefore, the demand for BCAAs in the feed and pharmaceutical industries is increasing continuously. Traditional industrial fermentative production of BCAAs was performed using microorganisms isolated by random mutagenesis. A collection of these classical strains was also scientifically useful to clarify the details of the BCAA biosynthetic pathways, which are tightly regulated by feedback inhibition and transcriptional attenuation. Based on this understanding of the metabolism of BCAAs, it is now possible for us to pursue strains with higher BCAA productivity using rational design and advanced molecular biology techniques. Additionally, systems biology approaches using augmented omics information help us to optimize carbon flux toward BCAA production. Here, we describe the biosynthetic pathways of BCAAs and their regulation and then overview the microorganisms developed for BCAA production. Other chemicals, including isobutanol, i.e., a second-generation biofuel, can be synthesized by branching the BCAA biosynthetic pathways, which are also outlined.
Solved problems in electromagnetics
Salazar Bloise, Félix; Bayón Rojo, Ana; Gascón Latasa, Francisco
2017-01-01
This book presents the fundamental concepts of electromagnetism through problems with a brief theoretical introduction at the beginning of each chapter. The present book has a strong didactic character. It explains all the mathematical steps and the theoretical concepts connected with the development of the problem. It guides the reader to understand the employed procedures to learn to solve the exercises independently. The exercises are structured in a similar way: The chapters begin with easy problems increasing progressively in the level of difficulty. This book is written for students of physics and engineering in the framework of the new European Plans of Study for Bachelor and Master and also for tutors and lecturers. .
Solved problems in electrochemistry
International Nuclear Information System (INIS)
Piron, D.L.
2004-01-01
This book presents calculated solutions to problems in fundamental and applied electrochemistry. It uses industrial data to illustrate scientific concepts and scientific knowledge to solve practical problems. It is subdivided into three parts. The first uses modern basic concepts, the second studies the scientific basis for electrode and electrolyte thermodynamics (including E-pH diagrams and the minimum energy involved in transformations) and the kinetics of rate processes (including the energy lost in heat and in parasite reactions). The third part treats larger problems in electrolysis and power generation, as well as in corrosion and its prevention. Each chapter includes three sections: the presentation of useful principles; some twenty problems with their solutions; and, a set of unsolved problems
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)
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.
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
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 ...
Energy Technology Data Exchange (ETDEWEB)
Candelore, N R; Gast, R C; Ondis, II, L A
1978-08-01
The RCP01 Monte Carlo program for the CDC-7600 and CDC-6600 performs fixed source or eigenfunction neutron reaction rate calculations, or photon reaction rate calculations, for complex geometries. The photon calculations may be linked to the neutron reaction rate calculations. For neutron calculations, the full energy range is treated as required for neutron birth by the fission process and the subsequent neutron slowing down and thermalization, i.e., 10 MeV to 0 eV; for photon calculations the same energy range is treated. The detailed cross sections required for the neutron or photon collision processes are provided by RCPL1. This report provides details of the various types of neutron and photon starts and collisions, the common geometry tracking, and the input required. 37 figures, 1 table.
ACPSEM (NZ Branch) annual meeting
International Nuclear Information System (INIS)
McEwan, A.C.
1999-01-01
The 1998 annual meeting of the New Zealand Branch of the Australasian College of Physical Scientists and Engineers in Medicine was held at the Christchurch School of Medicine over 26-27 November 1998, and attracted a record number of around 45 registrations. The meeting serves a number of purposes but one of the primary ones is to bring together scientists in medicine from around the country to compare notes on practices and advances, particularly in radiotherapy and diagnostic radiology physics. Following the meeting format established over recent years, separate workshops were devoted to radiotherapy physics and developments in the regional centres represented, and to practical issues relating to medical physics in diagnostic radiology. The workshops were held in parallel with presentations of scientific papers covering a wide range of topics, but with about half relating to engineering applications in medicine. (author)
Branching process models of cancer
Durrett, Richard
2015-01-01
This volume develops results on continuous time branching processes and applies them to study rate of tumor growth, extending classic work on the Luria-Delbruck distribution. As a consequence, the authors calculate the probability that mutations that confer resistance to treatment are present at detection and quantify the extent of tumor heterogeneity. As applications, the authors evaluate ovarian cancer screening strategies and give rigorous proofs for results of Heano and Michor concerning tumor metastasis. These notes should be accessible to students who are familiar with Poisson processes and continuous time. Richard Durrett is mathematics professor at Duke University, USA. He is the author of 8 books, over 200 journal articles, and has supervised more than 40 Ph.D. students. Most of his current research concerns the applications of probability to biology: ecology, genetics, and most recently cancer.
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.
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…
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
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.
[Branches of the National Institute of Hygiene].
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
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-.
Directory of Open Access Journals (Sweden)
Matteo Ghiringhelli
2015-07-01
Full Text Available Our study is focused on evaluation and use of the most effective and correct nutrients. In particular, our attention is directed to the role of certain amino acids in cachectic patients. During parenteral nutrition in humans, physician already associates in the PN-bags different formulations including amino acids, lipids and glucose solutions or essential amino acids solution alone or exclusively branched-chain amino acids (BCAA. Studies investigated the effects of dietary BCAA ingestion on different diseases and conditions such as obesity and metabolic disorders, liver disease, muscle atrophy, cancer, impaired immunity or injuries (surgery, trauma, burns, and sepsis. BCAAs have been shown to affect gene expression, protein metabolism, apoptosis and regeneration of hepatocytes, and insulin resistance. They have also been shown to inhibit the proliferation of liver cancer cells in vitro, and are essential for lymphocyte proliferation and dendritic cell maturation. Oral or parenteral administration of these three amino acids will allow us to evaluate the real efficacy of these compounds during a therapy to treat malnutrition in subjects unable to feed themselves.
AVM branch vibration test equipment
International Nuclear Information System (INIS)
Anne, J.P.
1995-01-01
An inventory of the test equipment of the AVM Branch ''Acoustic and Vibratory Mechanics Analysis Methods'' group has been undertaken. The purpose of this inventory is to enable better acquaintance with the technical characteristics of the equipment, providing an accurate definition of their functionalities, ad to inform potential users of the possibilities and equipment available in this field. The report first summarizes the various experimental surveys conduced. Then, using the AVM equipment database to draw up an exhaustive list of available equipment, it provides a full-scope picture of the vibration measurement systems (sensors, conditioners and exciters) and data processing resources commonly used on industrial sites and in laboratories. A definition is also given of a mobile test unit, called 'shelter', and a test bench used for the testing and performance rating of the experimental analysis methods developed by the group. The report concludes with a description of two fixed installations: - the calibration bench ensuring the requisite quality level for the vibration measurement systems ; - the training bench, whereby know-how acquired in the field in the field of measurement and experimental analysis processes is made available to others. (author). 27 refs., 15 figs., 2 appends
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
Branching out Has So Much to Offer
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…
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.)
Aeroacoustics of pipe systems with closed branches
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
Branching miter joints : principles and artwork
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
Branching bisimulation congruence for probabilistic systems
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
Prebiotic branched galacto-oligosaccharides (gos)
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
Difficulties in Genetics Problem Solving.
Tolman, Richard R.
1982-01-01
Examined problem-solving strategies of 30 high school students as they solved genetics problems. Proposes a new sequence of teaching genetics based on results: meiosis, sex chromosomes, sex determination, sex-linked traits, monohybrid and dihybrid crosses (humans), codominance (humans), and Mendel's pea experiments. (JN)
Problem Solving, Scaffolding and Learning
Lin, Shih-Yin
2012-01-01
Helping students to construct robust understanding of physics concepts and develop good solving skills is a central goal in many physics classrooms. This thesis examine students' problem solving abilities from different perspectives and explores strategies to scaffold students' learning. In studies involving analogical problem solving…
Solving complex fisheries management problems
DEFF Research Database (Denmark)
Petter Johnsen, Jahn; Eliasen, Søren Qvist
2011-01-01
A crucial issue for the new EU common fisheries policy is how to solve the discard problem. Through a study of the institutional set up and the arrangements for solving the discard problem in Denmark, the Faroe Islands, Iceland and Norway, the article identifies the discard problem as related...
[Croatian Medical Association--Branch Zagreb].
Kaić, Zvonimir; Sain, Snjezana; Gulić, Mirjana; Mahovlić, Vjekoslav; Krznarić, Zeljko
2014-01-01
The available literature shows us that "Druztvo ljeciteljah u Zagrebus (the Society of Healers in Zagreb) was founded as far back as the year 1845 by a total of thirteen members. This data allows us to follow the role of doctors and health workers in Zagreb through their everyday profession, research, organizational and social work as well as management through a period of over one hundred to seventy years. The Branch Zagreb was active before the official establishment of subsidiaries of CMA which is evident from the minutes of the regular annual assembly of the Croatian Medical Association on 21 March 1948. Until the end of 1956, there was no clear division of labor, functions and competencies between the Branch and the Main Board. Their actions were instead consolidated and the Branch operated within and under the name of Croatian Medical Association. In that year the Branch became independent. The Branch Zagreb is the largest and one of the most active branches of the Croatian Medical Association. At the moment, the Branch brings together 3621 members, regular members--doctors of medicine (2497), doctors of dental medicine (384), retired physicians (710), and associate members (30 specialists with higher education who are not doctors). The Branch is especially accomplished in its activities in the area of professional development of its members and therefore organizes a series of scientific conferences in the framework of continuous education of physicians, allowing its members to acquire necessary points for the extension of their operating license. The choir "Zagrebacki lijecnici pjevaci" (Zagreb Physicians' Choir) of the Croatian Medical Music Society of the CMA and its activities are inseparable from the Branch Zagreb. The Branch is firmly linked to the parent body, the CMA, and thus has a visible impact on the strategy and the activities of the Association as a whole. Most professional societies of the CMA have their headquarters in Zagreb and this is
Partial branch and bound algorithm for improved data association in multiframe processing
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.
Callejo, Maria Luz
1994-01-01
Reports, in French, an investigation on the use of graphic representations in problem-solving tasks of the type in Spanish Mathematical Olympiads. Analysis showed that the choice and interpretation of the first graphic representation played a decisive role in the discovery of the solution. (34 references) (Author/MKR)
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.
Problem Solving with General Semantics.
Hewson, David
1996-01-01
Discusses how to use general semantics formulations to improve problem solving at home or at work--methods come from the areas of artificial intelligence/computer science, engineering, operations research, and psychology. (PA)
How to solve mathematical problems
Wickelgren, Wayne A
1995-01-01
Seven problem-solving techniques include inference, classification of action sequences, subgoals, contradiction, working backward, relations between problems, and mathematical representation. Also, problems from mathematics, science, and engineering with complete solutions.
Interactive Problem-Solving Interventions
African Journals Online (AJOL)
Frew Demeke Alemu
concerted efforts of unofficial actors to establish unofficial communication ... Frew Demeke Alemu (LLB, LLM in International Human Rights Law from Lund ..... 24 Tamra Pearson d'Estrée (2009), “Problem-Solving Approaches”, (in The SAGE ...
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.
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.
Code 672 observational science branch computer networks
Hancock, D. W.; Shirk, H. G.
1988-01-01
In general, networking increases productivity due to the speed of transmission, easy access to remote computers, ability to share files, and increased availability of peripherals. Two different networks within the Observational Science Branch are described in detail.
Overview of the Advanced High Frequency Branch
Miranda, Felix A.
2015-01-01
This presentation provides an overview of the competencies, selected areas of research and technology development activities, and current external collaborative efforts of the NASA Glenn Research Center's Advanced High Frequency Branch.
Star-Branched Polymers (Star Polymers)
Hirao, Akira; Hayashi, Mayumi; Ito, Shotaro; Goseki, Raita; Higashihara, Tomoya; Hadjichristidis, Nikolaos
2015-01-01
The synthesis of well-defined regular and asymmetric mixed arm (hereinafter miktoarm) star-branched polymers by the living anionic polymerization is reviewed in this chapter. In particular, much attention is being devoted to the synthetic
Schoenfeld's problem solving theory in a student controlled learning environment
Harskamp, E.; Suhre, C.
2007-01-01
This paper evaluates the effectiveness of a student controlled computer program for high school mathematics based on instruction principles derived from Schoenfeld's theory of problem solving. The computer program allows students to choose problems and to make use of hints during different episodes
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.
Branch retinal artery occlusion in Susac's syndrome
Directory of Open Access Journals (Sweden)
Ricardo Evangelista Marrocos de Aragão
2015-02-01
Full Text Available Susac's syndrome is a rare disease attribuited to a microangiopathy involving the arterioles of the cochlea, retina and brain. Encefalopathy, hearing loss, and visual deficits are the hallmarks of the disease. Visual loss is due to multiple, recurrent branch arterial retinal occlusions. We report a case of a 20-year-old women with Susac syndrome presented with peripheral vestibular syndrome, hearing loss, ataxia, vertigo, and vision loss due occlusion of the retinal branch artery.
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
Multiprogrammation fast branch driver for microcomputer MICRAL
International Nuclear Information System (INIS)
Kaiser, Josef; Lacroix, Jean.
1975-01-01
This branch driver allows in association with the FIFO memories of the microcomputer Micral, very fast exchanges with the 7 crates of a CAMAC branch. A CAMAC programm (command, test, read, write) is loaded in the 1K FIFO buffer of the Micral before execution time and executed in sequence at a rate of 1,5μs per CAMAC command. After programm execution, data may be transferred directly on a magnetic tape [fr
Tangram solved? Prefrontal cortex activation analysis during geometric problem solving.
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.
Conformations and solution properties of star-branched polyelectrolytes
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.
All change at the CERN UBS branch
Antonella Del Rosso
2012-01-01
UBS branches across the country are being modernised, and the CERN branch is no exception. The Bulletin brings you a preview of the project, which will get under way in January 2013. Mock-up of the renovated UBS branch. The changes at the UBS branch in CERN's Main Building will be no simple facelift. The entire bank will be renovated, transforming the present relatively confined premises into an open and attractive area. "The renovation of the UBS branches is part of a wider campaign designed to further enhance our customer relations," explains Ezio Mangia, the head of the CERN branch. The UBS bank currently occupies three sets of premises in CERN's Main Building (two on the ground floor and one in the basement). "By the end of the work, which is scheduled to be completed by the middle of next year, CERN customers will benefit from a new area with open-plan counters and "hole-in-the-wall" machines accessible to...
Absolute branching intensities in the decay of 92Rb to 92Sr
Lhersonneau, G; Rizzi, V; Alyakrinskiy, O; Lanchais, A; Volkov, Yu.M; Barzakh, A.E; Fedorov, D.V; Ionan, A.M; Ivanov, V.S; Mezilev, K.A; Moroz, F.V; Orlov, S.Yu; Panteleev, V.N; Lau, C; Bajeat, O; Essabaa, S; Leroy, R; Jardin, P; Stroe, L; 10.1103/PhysRevC.74.017308
2006-01-01
The branching of the 2+ to 0+ transition in 92Sr has been measured to 0.032(4) per 92Rb decay. It confirms an earlier measurement however discarded in nuclear data evaluations since in contradiction with accepted lower logft limits. The conflict could be solved assuming that close to half of the decay intensity, mostly as high-energy ground-state transitions, is missing in th edecay scheme.
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 hyperbolic heat conduction using electrical simulation
International Nuclear Information System (INIS)
Gheitaghy, A. M.; Talaee, M. R.
2013-01-01
In the present study, the electrical network simulation method is proposed to solve the hyperbolic and parabolic heat conduction problem considering Cattaneo-Vernoute (C.V) constitutive relation. Using this new proposed numerical model and the electrical circuit simulation program HSPICE, transient temperature and heat flux profiles at slab can be obtained easily and quickly. To verify the proposed method, the obtained numerical results for cases of one dimensional two-layer slab under periodic boundary temperature with perfect and imperfect thermal contact are compared with the published results. Comparisons show the proposed technique might be considered as a useful tool in the analysis of parabolic and hyperbolic thermal problems.
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
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.
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.
Customer-centered problem solving.
Samelson, Q B
1999-11-01
If there is no single best way to attract new customers and retain current customers, there is surely an easy way to lose them: fail to solve the problems that arise in nearly every buyer-supplier relationship, or solve them in an unsatisfactory manner. Yet, all too frequently, companies do just that. Either we deny that a problem exists, we exert all our efforts to pin the blame elsewhere, or we "Band-Aid" the problem instead of fixing it, almost guaranteeing that we will face it again and again.
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
as a general approach to problem solving. We apply these Simonian ideas to organizational issues, specifically new organizational forms. Specifically, Simonian ideas allow us to develop a morphology of new organizational forms and to point to some design problems that characterize these forms.Keywords: Herbert...... Simon, problem-solving, new organizational forms. JEL Code: D23, D83......Two of Herbert Simon's best-known papers are "The Architecture of Complexity" and "The Structure of Ill-Structured Problems." We discuss the neglected links between these two papers, highlighting the role of decomposition in the context of problems on which constraints have been imposed...
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
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)
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…
Computational models of airway branching morphogenesis.
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.
Tillering and panicle branching genes in rice.
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.
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.
Funke, Joachim
2013-01-01
This paper presents a bibliography of 263 references related to human problem solving, arranged by subject matter. The references were taken from PsycInfo and Academic Premier data-base. Journal papers, book chapters, and dissertations are included. The topics include human development, education, neuroscience, and research in applied settings. It…
Solved problems in classical electromagnetism
Franklin, Jerrold
2018-01-01
This original Dover publication is the companion to a new edition of the author's Classical Electromagnetism: Second Edition. The latter volume will feature only basic answers; this book will contain some problems from the reissue as well as many other new ones. All feature complete, worked-out solutions and form a valuable source of problem-solving material for students.
Error Patterns in Problem Solving.
Babbitt, Beatrice C.
Although many common problem-solving errors within the realm of school mathematics have been previously identified, a compilation of such errors is not readily available within learning disabilities textbooks, mathematics education texts, or teacher's manuals for school mathematics texts. Using data on error frequencies drawn from both the Fourth…
Quantitative Reasoning in Problem Solving
Ramful, Ajay; Ho, Siew Yin
2015-01-01
In this article, Ajay Ramful and Siew Yin Ho explain the meaning of quantitative reasoning, describing how it is used in the to solve mathematical problems. They also describe a diagrammatic approach to represent relationships among quantities and provide examples of problems and their solutions.
Students' Problem Solving and Justification
Glass, Barbara; Maher, Carolyn A.
2004-01-01
This paper reports on methods of students' justifications of their solution to a problem in the area of combinatorics. From the analysis of the problem solving of 150 students in a variety of settings from high-school to graduate study, four major forms of reasoning evolved: (1) Justification by Cases, (2) Inductive Argument, (3) Elimination…
Solving 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
Problem solving skills for schizophrenia.
Xia, J; Li, Chunbo
2007-04-18
The severe and long-lasting symptoms of schizophrenia are often the cause of severe disability. Environmental stress such as life events and the practical problems people face in their daily can worsen the symptoms of schizophrenia. Deficits in problem solving skills in people with schizophrenia affect their independent and interpersonal functioning and impair their quality of life. As a result, therapies such as problem solving therapy have been developed to improve problem solving skills for people with schizophrenia. To review the effectiveness of problem solving therapy compared with other comparable therapies or routine care for those with schizophrenia. We searched the Cochrane Schizophrenia Group's Register (September 2006), which is based on regular searches of BIOSIS, CENTRAL, CINAHL, EMBASE, MEDLINE and PsycINFO. We inspected references of all identified studies for further trials. We included all clinical randomised trials comparing problem solving therapy with other comparable therapies or routine care. We extracted data independently. For homogenous dichotomous data we calculated random effects, relative risk (RR), 95% confidence intervals (CI) and, where appropriate, numbers needed to treat (NNT) on an intention-to-treat basis. For continuous data, we calculated weighted mean differences (WMD) using a random effects statistical model. We included only three small trials (n=52) that evaluated problem solving versus routine care, coping skills training or non-specific interaction. Inadequate reporting of data rendered many outcomes unusable. We were unable to undertake meta-analysis. Overall results were limited and inconclusive with no significant differences between treatment groups for hospital admission, mental state, behaviour, social skills or leaving the study early. No data were presented for global state, quality of life or satisfaction. We found insufficient evidence to confirm or refute the benefits of problem solving therapy as an additional
Learning via problem solving in mathematics education
Directory of Open Access Journals (Sweden)
Piet Human
2009-09-01
problem-solving movement, over the last twenty years, mathematics educators around the world started increasingly to appreciate the role of social interaction and mathematical discourse in classrooms, and to take into consideration the inﬂ uence of the social, socio-mathematical and mathematical norms established in classrooms. This shift away from an emphasis on individualised instruction towards classroom practices characterised by rich and focused social interaction orchestrated by the teacher, became the second element, next to problem-solving, of what is now known as the “reform agenda”. Learning and teaching by means of problem-solving in a socially-interactive classroom, with a strong demand for conceptual understanding, is radically different from traditional expository teaching. However, contrary to commonly-held misunderstandings, it requires substantial teacher involvement. It also requires teachers to assume a much higher level of responsibility for the extent and quality of learning than that which teachers tended to assume traditionally. Over the last 10 years, teaching for and via problem solving has become entrenched in the national mathematics curriculum statements of many countries, and programs have been launched to induce and support teachers to implement it. Actual implementation of the “reform agenda” in classrooms is, however, still limited. The limited implementation is ascribed to a number of factors, including the failure of assessment practices to accommodate problem solving and higher levels of understanding that may be facilitated by teaching via problem solving, lack of clarity about what teaching for and via problem solving may actually mean in practice, and limited mathematical expertise of teachers. Some leading mathematics educators (for example, Schoenfeld, Stigler and Hiebert believe that the reform agenda speciﬁ es classroom practices that are fundamentally foreign to culturally embedded pedagogical traditions, and hence
Solving PDEs in Python the FEniCS tutorial I
Langtangen, Hans Petter
2016-01-01
This book offers a concise and gentle introduction to finite element programming in Python based on the popular FEniCS software library. Using a series of examples, including the Poisson equation, the equations of linear elasticity, the incompressible Navier–Stokes equations, and systems of nonlinear advection–diffusion–reaction equations, it guides readers through the essential steps to quickly solving a PDE in FEniCS, such as how to define a finite variational problem, how to set boundary conditions, how to solve linear and nonlinear systems, and how to visualize solutions and structure finite element Python programs. This book is open access under a CC BY license.
Genetics problem solving and worldview
Dale, Esther
The research goal was to determine whether worldview relates to traditional and real-world genetics problem solving. Traditionally, scientific literacy emphasized content knowledge alone because it was sufficient to solve traditional problems. The contemporary definition of scientific literacy is, "The knowledge and understanding of scientific concepts and processes required for personal decision-making, participation in civic and cultural affairs and economic productivity" (NRC, 1996). An expanded definition of scientific literacy is needed to solve socioscientific issues (SSI), complex social issues with conceptual, procedural, or technological associations with science. Teaching content knowledge alone assumes that students will find the scientific explanation of a phenomenon to be superior to a non-science explanation. Formal science and everyday ways of thinking about science are two different cultures (Palmer, 1999). Students address this rift with cognitive apartheid, the boxing away of science knowledge from other types of knowledge (Jedege & Aikenhead, 1999). By addressing worldview, cognitive apartheid may decrease and scientific literacy may increase. Introductory biology students at the University of Minnesota during fall semester 2005 completed a written questionnaire-including a genetics content-knowledge test, four genetic dilemmas, the Worldview Assessment Instrument (WAI) and some items about demographics and religiosity. Six students responded to the interview protocol. Based on statistical analysis and interview data, this study concluded the following: (1) Worldview, in the form of metaphysics, relates to solving traditional genetic dilemmas. (2) Worldview, in the form of agency, relates to solving traditional genetics problems. (3) Thus, worldview must be addressed in curriculum, instruction, and assessment.
Branching time, indeterminism and tense logic
DEFF Research Database (Denmark)
Ploug, Thomas; Øhrstrøm, Peter
2012-01-01
This paper deals with the historical and philosophical background of the introduction of the notion of branching time in philosophical logic as it is revealed in the hitherto unpublished mail-correspondence between Saul Kripke and A.N. Prior in the late 1950s. The paper reveals that the idea...... relativity. The correspondence underpins the point that Prior’s later development of branching time may be understood as a crucial part of his attempt at the formulating a conceptual framework integrating basic human notions of time and free choice....
Electronic branching ratio of the τ lepton
International Nuclear Information System (INIS)
Ammar, R.; Baringer, P.; Coppage, D.; Davis, R.; Kelly, M.; Kwak, N.; Lam, H.; Ro, S.; Kubota, Y.; Lattery, M.; Nelson, J.K.; Perticone, D.; Poling, R.; Schrenk, S.; Wang, R.; Alam, M.S.; Kim, I.J.; Nemati, B.; Romero, V.; Sun, C.R.; Wang, P.; Zoeller, M.M.; Crawford, G.; Fulton, R.; Gan, K.K.; Kagan, H.; Kass, R.; Lee, J.; Malchow, R.; Morrow, F.; Sung, M.K.; Whitmore, J.; Wilson, P.; Butler, F.; Fu, X.; Kalbfleisch, G.; Lambrecht, M.; Skubic, P.; Snow, J.; Wang, P.; Bortoletto, D.; Brown, D.N.; Dominick, J.; McIlwain, R.L.; Miller, D.H.; Modesitt, M.; Shibata, E.I.; Schaffner, S.F.; Shipsey, I.P.J.; Battle, M.; Ernst, J.; Kroha, H.; Roberts, S.; Sparks, K.; Thorndike, E.H.; Wang, C.; Stroynowski, R.; Artuso, M.; Goldberg, M.; Haupt, T.; Horwitz, N.; Kennett, R.; Moneti, G.C.; Playfer, S.; Rozen, Y.; Rubin, P.; Skwarnicki, T.; Stone, S.; Thulasidas, M.; Yao, W.; Zhu, G.; Barnes, A.V.; Bartelt, J.; Csorna, S.E.; Jain, V.; Letson, T.; Mestayer, M.D.; Akerib, D.S.; Barish, B.; Chadha, M.; Cowen, D.F.; Eigen, G.; Miller, J.S.; Urheim, J.; Weinstein, A.J.; Morrison, R.J.; Tajima, H.; Schmidt, D.; Sperka, D.; Procario, M.; Daoudi, M.; Ford, W.T.; Johnson, D.R.; Lingel, K.; Lohner, M.; Rankin, P.; Smith, J.G.; Alexander, J.; Bebek, C.; Berkelman, K.; Besson, D.; Browder, T.E.; Cassel, D.G.; Cheu, E.; Coffman, D.M.; Drell, P.S.; Ehrlich, R.; Galik, R.S.; Garcia-Sciveres, M.; Geiser, B.; Gittelman, B.; Gray, S.W.; Hartill, D.L.; Heltsley, B.K.; Honscheid, K.; Jones, C.; Kandaswamy, J.; Katayama, N.; Kim, P.C.; Kreinick, D.L.; Ludwig, G.S.; Masui, J.; Mevissen, J.; Mistry, N.B.; Nandi, S.; Ng, C.R.; Nordberg, E.; O'Grady, C.; Patterson, J.R.; Peterson, D.; Riley, D.; Sapper, M.; Selen, M.; Worden, H.; Worris, M.; Wuerthwein, F.; Avery, P.; Freyberger, A.; Rodriguez, J.; Yelton, J.; Henderson, S.; Kinoshita, K.; Pipkin, F.; Saulnier, M.; Wilson, R.; Wolinski, J.; Xiao, D.; Yamamoto, H.; Sadoff, A.J.
1992-01-01
Using data accumulated by the CLEO I detector operating at the Cornell Electron Storage Ring, we have measured the ratio R=Γ(τ→e bar ν e ν τ )/Γ 1 , where Γ 1 is the τ decay rate to final states with one charged particle. We find R=0.2231±0.0044±0.0073 where the first error is statistical and the second is systematic. Together with the measured topological one-charged-particle branching fraction, this yields the branching fraction of the τ lepton to electrons, B e =0.192±0.004±0.006
International Nuclear Information System (INIS)
Tanatarov, I.V.; Tanatarov, I.V.; Adamenko, I.N.; Nemchenko, K.E.; Wyatt, A.F.G.
2010-01-01
We analyse the dispersion relation of ripplons, on the surface of superfluid helium, using the dispersive hydrodynamics approach and find a new ripplon branch. We obtain analytical equation for the dispersion relation and analytic expressions for the limiting cases. The probabilities of decay of unstable ripplons above the roton gap into rotons are derived. A numerical solution for the ripplon dispersion curve is obtained. The new ripplon branch is found at energies just below the instability point of the bulk spectrum, and is investigated; its stability is discussed.
Assessing Leadership and Problem-Solving Skills and Their Impacts in the Community.
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…
A Case Study of an Induction Year Teacher's Problem-Solving Using the LIBRE Model Activity
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…
Knowledge-Based Instruction: Teaching Problem Solving in a Logo Learning Environment.
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…
Turing mechanism underlying a branching model for lung morphogenesis.
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.
The impact of switching costs on closing of service branches
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...
CSIR Research Space (South Africa)
Motara, YM
2017-09-01
Full Text Available the intersection between the SHA-1 preimage problem, the encoding of that problem for SAT-solving, and SAT-solving. The results demonstrate that SAT-solving is not yet a viable approach to take to solve the preimage problem, and also indicate that some...
Assessing Algebraic Solving Ability: A Theoretical Framework
Lian, Lim Hooi; Yew, Wun Thiam
2012-01-01
Algebraic solving ability had been discussed by many educators and researchers. There exists no definite definition for algebraic solving ability as it can be viewed from different perspectives. In this paper, the nature of algebraic solving ability in terms of algebraic processes that demonstrate the ability in solving algebraic problem is…
BranchAnalysis2D/3D automates morphometry analyses of branching structures.
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.
ORD’s Urban Watershed Management Branch
This is a poster for the Edison Science Day, tentatively scheduled for June 10, 2009. This poster presentation summarizes key elements of the EPA Office of Research and Development’s (ORD) Urban Watershed Management Branch (UWMB). An overview of the national problems posed by w...
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.)
Heavy metal contamination in TIMS Branch sediments
International Nuclear Information System (INIS)
Pickett, J.B.
1990-01-01
The objective of this memorandum is to summarize results of previous sediment studies on Tims Branch and Steed's Pond conducted by Health Protection (HP) and by the Savannah River Laboratory (SRL) in conjunction with Reactor Materials Engineering ampersand Technology (RMET). The results for other heavy metals, such as lead, nickel, copper, mercury, chromium, cadmium, zinc, and thorium are also summarized
Organizing Organoids: Stem Cells Branch Out.
Davies, Jamie A
2017-12-07
In this issue of Cell Stem Cell, Taguchi and Nishinakamura (2017) describe a carefully optimized method for making a branch-competent ureteric bud, a tissue fundamental to kidney development, from mouse embryonic stem cells and human induced pluripotent stem cells. The work illuminates embryology and has important implications for making more realistic kidney organoids. Copyright © 2017 Elsevier Inc. All rights reserved.
Annealed star-branched polyelectrolytes in solution
Klein Wolterink, J.; Male, van J.; Cohen Stuart, M.A.; Koopal, L.K.; Zhulina, E.B.; Borisov, O.V.
2002-01-01
Equilibrium conformations of annealed star-branched polyelectrolytes (polyacids) are calculated with a numerical self-consistent-field (SCF) model. From the calculations we obtain also the size and charge of annealed polyelectrolyte stars as a function of the number of arms, pH, and the ionic
Branch President gives evidence at Scottish Parliament.
2017-07-01
As the Scottish Government moves forward with its recently announced package of measures on animal health and welfare, Hayley Atkin, BVA Policy Officer, describes a busy month for the President of BVA Scottish Branch representing members in the Scottish Parliament. British Veterinary Association.
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.)
Laughter-induced left bundle branch block.
Chow, Grant V; Desai, Dipan; Spragg, David D; Zakaria, Sammy
2012-10-01
We present the case of a patient with ischemic heart disease and intermittent left bundle branch block, reproducibly induced by laughter. Following treatment of ischemia with successful deployment of a drug-eluting stent, no further episodes of inducible LBBB were seen. Transient ischemia, exacerbated by elevated intrathoracic pressure during laughter, may have contributed to onset of this phenomenon. © 2012 Wiley Periodicals, Inc.
Branching bisimulation congruence for probabilistic systems
Andova, S.; Georgievska, S.; Trcka, N.
2012-01-01
A notion of branching bisimilarity for the alternating model of probabilistic systems, compatible with parallel composition, is defined. For a congruence result, an internal transition immediately followed by a non-trivial probability distribution is not considered inert. A weaker definition of
Infrared studies of asymptotic giant branch stars
International Nuclear Information System (INIS)
Willems, F.J.
1987-01-01
In this thesis studies are presented of asymptotic giant branch stars, which are thought to be an important link in the evolution of the galaxy. The studies were performed on the basis of data collected by the IRAS, the infrared astronomical satelite. 233 refs.; 33 figs.; 16 tabs
Semileptonic b branching fractions at LEP
Gagnon, P
2000-01-01
I review recent results on semileptonic branching fractions at LEP for Z/sup 0/ to bb data, for the average b hadron then for b baryons. From the inclusive BR(b to lX), one can obtain the most precise value for the CKM matrix element V/sub cb/. (14 refs).
Origin of buds, branches, and sprouts
Kevin T. Smith
2014-01-01
Recent research shows that survivor trees in rural, managed forests rebuild broken crowns with new branches and foliage after ice storm injury (Shortle et al. 2014). Veteran trees in historic parks and landscapes show repeated cycles of crown loss and recovery (Fay 2002). Crown rebuilding or reiteration from sprouts is a physiological response with architectural...
High speed CAMAC differential branch highway driver
International Nuclear Information System (INIS)
McMillan, D.E.; Nelson, R.O.; Poore, R.V.; Sunier, J.W.; Ross, J.J.
1979-01-01
A new CAMAC branch driver is described that incorporates several unusual features which combine to give reliable, high-speed performance. These include balanced line driver/receivers, stored CAMAC command lists, 8 DMA channels, pseudo LAMS, hardware priority encoding of LAMS, and hardware-implemented Q-controlled block transfers. 3 figures
International Nuclear Information System (INIS)
Jackson, M.A.
1982-01-01
The programmer's task is often taken to be the construction of algorithms, expressed in hierarchical structures of procedures: this view underlies the majority of traditional programming languages, such as Fortran. A different view is appropriate to a wide class of problem, perhaps including some problems in High Energy Physics. The programmer's task is regarded as having three main stages: first, an explicit model is constructed of the reality with which the program is concerned; second, this model is elaborated to produce the required program outputs; third, the resulting program is transformed to run efficiently in the execution environment. The first two stages deal in network structures of sequential processes; only the third is concerned with procedure hierarchies. (orig.)
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.
Methods of solving nonstandard problems
Grigorieva, Ellina
2015-01-01
This book, written by an accomplished female mathematician, is the second to explore nonstandard mathematical problems – those that are not directly solved by standard mathematical methods but instead rely on insight and the synthesis of a variety of mathematical ideas. It promotes mental activity as well as greater mathematical skills, and is an ideal resource for successful preparation for the mathematics Olympiad. Numerous strategies and techniques are presented that can be used to solve intriguing and challenging problems of the type often found in competitions. The author uses a friendly, non-intimidating approach to emphasize connections between different fields of mathematics and often proposes several different ways to attack the same problem. Topics covered include functions and their properties, polynomials, trigonometric and transcendental equations and inequalities, optimization, differential equations, nonlinear systems, and word problems. Over 360 problems are included with hints, ...
Jackson, M A
1982-01-01
The programmer's task is often taken to be the construction of algorithms, expressed in hierarchical structures of procedures: this view underlies the majority of traditional programming languages, such as Fortran. A different view is appropriate to a wide class of problem, perhaps including some problems in High Energy Physics. The programmer's task is regarded as having three main stages: first, an explicit model is constructed of the reality with which the program is concerned; second, thi...
Confluent-Functional solving systems
Directory of Open Access Journals (Sweden)
V.N. Koval
2001-08-01
Full Text Available The paper proposes a statistical knowledge-acquision approach. The solving systems are considered, which are able to find unknown structural dependences between situational and transforming variables on the basis of statistically analyzed input information. Situational variables describe features, states and relations between environment objects. Transforming variables describe transforming influences, exerted by a goal-oriented system onto an environment. Unknown environment rules are simulated by a structural equations system, associating situational and transforming variables.
Pesticides and Asbestos Programs and Enforcement Branch Case Tracking System
Tracks the entire life cycle of a regulated site from initial inspection through site response to enforcement actions. Separate site action history is maintained for each statute under which the site is regulated.
Environmental control of branching in petunia.
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.
Tree Branching: Leonardo da Vinci's Rule versus Biomechanical Models
Minamino, Ryoko; Tateno, Masaki
2014-01-01
This study examined Leonardo da Vinci's rule (i.e., the sum of the cross-sectional area of all tree branches above a branching point at any height is equal to the cross-sectional area of the trunk or the branch immediately below the branching point) using simulations based on two biomechanical models: the uniform stress and elastic similarity models. Model calculations of the daughter/mother ratio (i.e., the ratio of the total cross-sectional area of the daughter branches to the cross-sectional area of the mother branch at the branching point) showed that both biomechanical models agreed with da Vinci's rule when the branching angles of daughter branches and the weights of lateral daughter branches were small; however, the models deviated from da Vinci's rule as the weights and/or the branching angles of lateral daughter branches increased. The calculated values of the two models were largely similar but differed in some ways. Field measurements of Fagus crenata and Abies homolepis also fit this trend, wherein models deviated from da Vinci's rule with increasing relative weights of lateral daughter branches. However, this deviation was small for a branching pattern in nature, where empirical measurements were taken under realistic measurement conditions; thus, da Vinci's rule did not critically contradict the biomechanical models in the case of real branching patterns, though the model calculations described the contradiction between da Vinci's rule and the biomechanical models. The field data for Fagus crenata fit the uniform stress model best, indicating that stress uniformity is the key constraint of branch morphology in Fagus crenata rather than elastic similarity or da Vinci's rule. On the other hand, mechanical constraints are not necessarily significant in the morphology of Abies homolepis branches, depending on the number of daughter branches. Rather, these branches were often in agreement with da Vinci's rule. PMID:24714065
Tree branching: Leonardo da Vinci's rule versus biomechanical models.
Minamino, Ryoko; Tateno, Masaki
2014-01-01
This study examined Leonardo da Vinci's rule (i.e., the sum of the cross-sectional area of all tree branches above a branching point at any height is equal to the cross-sectional area of the trunk or the branch immediately below the branching point) using simulations based on two biomechanical models: the uniform stress and elastic similarity models. Model calculations of the daughter/mother ratio (i.e., the ratio of the total cross-sectional area of the daughter branches to the cross-sectional area of the mother branch at the branching point) showed that both biomechanical models agreed with da Vinci's rule when the branching angles of daughter branches and the weights of lateral daughter branches were small; however, the models deviated from da Vinci's rule as the weights and/or the branching angles of lateral daughter branches increased. The calculated values of the two models were largely similar but differed in some ways. Field measurements of Fagus crenata and Abies homolepis also fit this trend, wherein models deviated from da Vinci's rule with increasing relative weights of lateral daughter branches. However, this deviation was small for a branching pattern in nature, where empirical measurements were taken under realistic measurement conditions; thus, da Vinci's rule did not critically contradict the biomechanical models in the case of real branching patterns, though the model calculations described the contradiction between da Vinci's rule and the biomechanical models. The field data for Fagus crenata fit the uniform stress model best, indicating that stress uniformity is the key constraint of branch morphology in Fagus crenata rather than elastic similarity or da Vinci's rule. On the other hand, mechanical constraints are not necessarily significant in the morphology of Abies homolepis branches, depending on the number of daughter branches. Rather, these branches were often in agreement with da Vinci's rule.
Using Computer Symbolic Algebra to Solve Differential Equations.
Mathews, John H.
1989-01-01
This article illustrates that mathematical theory can be incorporated into the process to solve differential equations by a computer algebra system, muMATH. After an introduction to functions of muMATH, several short programs for enhancing the capabilities of the system are discussed. Listed are six references. (YP)
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)
Problem Solving Abilities and Perceptions in Alternative Certification Mathematics Teachers
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…
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, ...
Solving the Water Jugs Problem by an Integer Sequence Approach
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…
Learning Styles and Problem Solving Skills of Turkish Prospective Teachers
Gencel, Ilke Evin
2015-01-01
Global changes in educational discourse have an impact on educational systems, so teacher education programs need to be transformed to better train teachers and to contribute to their professional development. In this process learning styles and problem solving skills should be considered as individual differences which have an impact in…
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
Modeling and Solving the Train Pathing Problem
Directory of Open Access Journals (Sweden)
Chuen-Yih Chen
2009-04-01
Full Text Available In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. In this paper, we present an optimization heuristic to solve the train pathing and timetabling problem. This heuristic allows the dwell time of trains in a station or link to be dependent on the assigned tracks. It also allows the minimum clearance time between the trains to depend on their relative status. The heuristic generates a number of alternative paths for each train service in the initialization phase. Then it uses a neighborhood search approach to find good feasible combinations of these paths. A linear program is developed to evaluate the quality of each combination that is encountered. Numerical examples are provided.
The Pen Branch Project: Restoration of a Forested Wetland in South Carolina
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...
Sustainability of International Branch Campuses in the United Arab Emirates: A Vision for the Future
Franklin, Angela; Alzouebi, Khadeegha
2014-01-01
The United Arab Emirates is developing higher education institutions that will contribute to an educational sector providing premium degree programs. There was a belief that the recognition and achievements these institutions attained over decades in their native land would be transferable in the implementation of international branch campuses.…
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.
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...
Do Branch Lengths Help to Locate a Tree in a Phylogenetic Network?
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.
Problem solving through recreational mathematics
Averbach, Bonnie
1999-01-01
Historically, many of the most important mathematical concepts arose from problems that were recreational in origin. This book takes advantage of that fact, using recreational mathematics - problems, puzzles and games - to teach students how to think critically. Encouraging active participation rather than just observation, the book focuses less on mathematical results than on how these results can be applied to thinking about problems and solving them. Each chapter contains a diverse array of problems in such areas as logic, number and graph theory, two-player games of strategy, solitaire ga
Fort Collins Science Center Ecosystem Dynamics Branch
Wilson, Jim; Melcher, C.; Bowen, Z.
2009-01-01
Complex natural resource issues require understanding a web of interactions among ecosystem components that are (1) interdisciplinary, encompassing physical, chemical, and biological processes; (2) spatially complex, involving movements of animals, water, and airborne materials across a range of landscapes and jurisdictions; and (3) temporally complex, occurring over days, weeks, or years, sometimes involving response lags to alteration or exhibiting large natural variation. Scientists in the Ecosystem Dynamics Branch of the U.S. Geological Survey, Fort Collins Science Center, investigate a diversity of these complex natural resource questions at the landscape and systems levels. This Fact Sheet describes the work of the Ecosystems Dynamics Branch, which is focused on energy and land use, climate change and long-term integrated assessments, herbivore-ecosystem interactions, fire and post-fire restoration, and environmental flows and river restoration.
Mass loss on the Asymptotic Giant Branch
Zijlstra, Albert
2006-01-01
Mass loss on the Asymptotic Giant Branch provides the origin of planetary nebulae. This paper reviews several relevant aspects of AGB evolution: pulsation properties, mass loss formalisms and time variable mass loss, evidence for asymmetries on the AGB, binarity, ISM interaction, and mass loss at low metallicity. There is growing evidence that mass loss on the AGB is already asymmetric, but with spherically symmetric velocity fields. The origin of the rings may be in pulsational instabilities...
Bent and branched chains of nanoresonators
Melikhova, A. S.; Popov, I. Yu
2014-10-01
We study the spectral problem for bent and branched chains of weakly coupled conglobate resonators. At the joint points the δ-coupling is assumed. Our approach is based on the theory of self-adjoint extensions of symmetric operators and transfer matrix method. The structure of the spectrum is described. For the both cases it is proved that the Hamiltonian has negative eigenvalue for some values of the model parameters.
COELIAC TRUNK BRANCHING PATTERN AND VARIATION
Directory of Open Access Journals (Sweden)
Jude Jose Thomson
2017-01-01
Full Text Available BACKGROUND Anatomical variations involving the visceral arteries are common. However, variations in coeliac trunk are usually asymptomatic, they may become important in patients undergoing diagnostic angiography for gastrointestinal bleeding or prior to an operative procedure. This study was useful for knowing the possible morphological variations before an upper abdominal surgery. MATERIALS AND METHODS This was a descriptive study done by cadaveric dissection, conducted on thirty cadavers. The coeliac trunk being examined for its origin, branching pattern, distribution, and variations. Results were statistically analysed and compared with the previous studies. RESULTS In our study, 60% of the coeliac trunk shows variations and 40% have normal branching pattern. A complete absence of coeliac trunk was observed in one case. In the present study the Right inferior phrenic artery arising from coeliac trunk in 2 cases (6.6% and left inferior phrenic artery arising from coeliac trunk in 3 cases (9.9%. Both inferior phrenic arteries are arising from coeliac trunk in 2 cases (6.6%. The common hepatomesenteric trunk and gastro splenic trunk was found in 1 case (3.3%. Hepatosplenic trunk was found in 2 cases (6.6%. In another 2 cases (6.6% gastric and hepatic artery originate from coeliac trunk but splenic artery has a separate origin from abdominal aorta. An absent trunk was also found in 1 case (3.3%. In 5 cases (16.7% showed trifurcation with variation in the branching pattern. CONCLUSION The branching pattern and extreme degree variability in coeliac trunk as brought out in the observations of the present study make it obvious that the present study almost falls in description with previous studies.
Fabrication and characterization of branched carbon nanostructures
Directory of Open Access Journals (Sweden)
Sharali Malik
2016-09-01
Full Text Available Carbon nanotubes (CNTs have atomically smooth surfaces and tend not to form covalent bonds with composite matrix materials. Thus, it is the magnitude of the CNT/fiber interfacial strength that limits the amount of nanomechanical interlocking when using conventional CNTs to improve the structural behavior of composite materials through reinforcement. This arises from two well-known, long standing problems in this research field: (a inhomogeneous dispersion of the filler, which can lead to aggregation and (b insufficient reinforcement arising from bonding interactions between the filler and the matrix. These dispersion and reinforcement issues could be addressed by using branched multiwalled carbon nanotubes (b-MWCNTs as it is known that branched fibers can greatly enhance interfacial bonding and dispersability. Therefore, the use of b-MWCNTs would lead to improved mechanical performance and, in the case of conductive composites, improved electrical performance if the CNT filler was better dispersed and connected. This will provide major benefits to the existing commercial application of CNT-reinforced composites in electrostatic discharge materials (ESD: There would be also potential usage for energy conversion, e.g., in supercapacitors, solar cells and Li-ion batteries. However, the limited availability of b-MWCNTs has, to date, restricted their use in such technological applications. Herein, we report an inexpensive and simple method to fabricate large amounts of branched-MWCNTs, which opens the door to a multitude of possible applications.
Cold versus hot fusion deuterium branching ratios
International Nuclear Information System (INIS)
Fox, H.; Bass, R.
1995-01-01
A major source of misunderstanding of the nature of cold nuclear fusion has been the expectation that the deuterium branching ratios occurring within a palladium lattice would be consistent with the gas-plasma branching ratios. This misunderstanding has led to the concept of the dead graduate student, the 1989's feverish but fruitless search for neutron emissions from cold fusion reactors, and the follow-on condemnation of the new science of cold fusion. The experimental facts are that in a properly loaded palladium lattice, the deuterium fusion produces neutrons at little above background, a greatly less-than-expected production of tritium (the tritium desert), and substantially more helium-4 than is observed in hot plasma physics. The experimental evidence is now compelling (800 reports of success from 30 countries) that cold nuclear fusion is a reality, that the branching ratios are unexpected, and that a new science is struggling to be recognized. Commercialization of some types of cold fusion devices has already begun
Program for Analyzing Flows in a Complex Network
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.
Multidisciplinary Optimization Branch Experience Using iSIGHT Software
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.
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....
Aquatics Systems Branch: transdisciplinary research to address water-related environmental problems
Dong, Quan; Walters, Katie D.
2015-01-01
The Aquatic Systems Branch at the Fort Collins Science Center is a group of scientists dedicated to advancing interdisciplinary science and providing science support to solve water-related environmental issues. Natural resource managers have an increasing need for scientific information and stakeholders face enormous challenges of increasing and competing demands for water. Our scientists are leaders in ecological flows, riparian ecology, hydroscape ecology, ecosystem management, and contaminant biology. The Aquatic Systems Branch employs and develops state-of-the-science approaches in field investigations, laboratory experiments, remote sensing, simulation and predictive modeling, and decision support tools. We use the aquatic experimental laboratory, the greenhouse, the botanical garden and other advanced facilities to conduct unique research. Our scientists pursue research on the ground, in the rivers, and in the skies, generating and testing hypotheses and collecting quantitative information to support planning and design in natural resource management and aquatic restoration.
Optimization of multi-branch switched diversity systems
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
Auxin transport in the evolution of branching forms.
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.
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...
Solving network design problems via decomposition, aggregation and approximation
Bärmann, Andreas
2016-01-01
Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. Contents Decomposition for Multi-Period Network Design Solving Network Design Problems via Ag...
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
Solving rational expectations models using Excel
DEFF Research Database (Denmark)
Strulik, Holger
2004-01-01
Problems of discrete time optimal control can be solved using backward iteration and Microsoft Excel. The author explains the method in general and shows how the basic models of neoclassical growth and real business cycles are solved......Problems of discrete time optimal control can be solved using backward iteration and Microsoft Excel. The author explains the method in general and shows how the basic models of neoclassical growth and real business cycles are solved...
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.
Energy Technology Data Exchange (ETDEWEB)
Pagola, Silvina; Polymeros, Alekos; Kourkoumelis, Nikolaos
2017-02-01
The direct-space methods software
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.
LEGO Robotics: An Authentic Problem Solving Tool?
Castledine, Alanah-Rei; Chalmers, Chris
2011-01-01
With the current curriculum focus on correlating classroom problem solving lessons to real-world contexts, are LEGO robotics an effective problem solving tool? This present study was designed to investigate this question and to ascertain what problem solving strategies primary students engaged with when working with LEGO robotics and whether the…
Perspectives on Problem Solving and Instruction
van Merrienboer, Jeroen J. G.
2013-01-01
Most educators claim that problem solving is important, but they take very different perspective on it and there is little agreement on how it should be taught. This article aims to sort out the different perspectives and discusses problem solving as a goal, a method, and a skill. As a goal, problem solving should not be limited to well-structured…
Flight Planning Branch NASA Co-op Tour
Marr, Aja M.
2013-01-01
This semester I worked with the Flight Planning Branch at the NASA Johnson Space Center. I learned about the different aspects of flight planning for the International Space Station as well as the software that is used internally and ISSLive! which is used to help educate the public on the space program. I had the opportunity to do on the job training in the Mission Control Center with the planning team. I transferred old timeline records from the planning team's old software to the new software in order to preserve the data for the future when the software is retired. I learned about the operations of the International Space Station, the importance of good communication between the different parts of the planning team, and enrolled in professional development classes as well as technical classes to learn about the space station.
Q-branch Raman scattering and modern kinetic thoery
Energy Technology Data Exchange (ETDEWEB)
Monchick, L. [The Johns Hopkins Univ., Laurel, MD (United States)
1993-12-01
The program is an extension of previous APL work whose general aim was to calculate line shapes of nearly resonant isolated line transitions with solutions of a popular quantum kinetic equation-the Waldmann-Snider equation-using well known advanced solution techniques developed for the classical Boltzmann equation. The advanced techniques explored have been a BGK type approximation, which is termed the Generalized Hess Method (GHM), and conversion of the collision operator to a block diagonal matrix of symmetric collision kernels which then can be approximated by discrete ordinate methods. The latter method, which is termed the Collision Kernel method (CC), is capable of the highest accuracy and has been used quite successfully for Q-branch Raman scattering. The GHM method, not quite as accurate, is applicable over a wider range of pressures and has proven quite useful.
Asymptotic behaviour near extinction of continuous-state branching processes
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.
40 CFR 721.10094 - Decene, branched and linear.
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...
40 CFR 721.3627 - Branched synthetic fatty acid.
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...
Solving large mixed linear models using preconditioned conjugate gradient iteration.
Strandén, I; Lidauer, M
1999-12-01
Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.
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
Methodological innovations in public health education: transdisciplinary problem solving.
Lawlor, Edward F; Kreuter, Matthew W; Sebert-Kuhlmann, Anne K; McBride, Timothy D
2015-03-01
In 2008, the faculty of the Brown School at Washington University in St. Louis designed a Master of Public Health program centered on transdisciplinary problem solving in public health. We have described the rationale for our approach, guiding principles and pedagogy for the program, and specific transdisciplinary competencies students acquire. We have explained how transdisciplinary content has been organized and delivered, how the program is being evaluated, and how we have demonstrated the feasibility of this approach for a Master of Public Health degree.
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.
JPLEX: Java Simplex Implementation with Branch-and-Bound Search for Automated Test Assembly
Park, Ryoungsun; Kim, Jiseon; Dodd, Barbara G.; Chung, Hyewon
2011-01-01
JPLEX, short for Java simPLEX, is an automated test assembly (ATA) program. It is a mixed integer linear programming (MILP) solver written in Java. It reads in a configuration file, solves the minimization problem, and produces an output file for postprocessing. It implements the simplex algorithm to create a fully relaxed solution and…
Branching habit and the allocation of reproductive resources in conifers.
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.
STARDUST FROM ASYMPTOTIC GIANT BRANCH STARS
International Nuclear Information System (INIS)
Gail, H.-P.; Zhukovska, S. V.; Hoppe, P.; Trieloff, M.
2009-01-01
The formation of dust in the outflows of low- and intermediate-mass stars on the first giant branch and asymptotic giant branch (AGB) is studied and the relative contributions of stars of different initial masses and metallicities to the interstellar medium (ISM) at the instant of solar system formation are derived. These predictions are compared with the characteristics of the parent stars of presolar dust grains found in primitive meteorites and interplanetary dust particles (IDPs) inferred from their isotopic compositions. For this purpose, model calculations for dust condensation in stellar outflows are combined with synthetic models of stellar evolution on the first giant branch and AGB and an evolution model of the Milky Way for the solar neighborhood. The dust components considered are olivine, pyroxene, carbon, SiC, and iron. The corresponding dust production rates are derived for the solar vicinity. From these rates and taking into account dust destruction by supernova shocks in the ISM, the contributions to the inventory of presolar dust grains in the solar system are derived for stars of different initial masses and metallicities. It is shown that stars on the first giant branch and the early AGB are not expected to form dust, in accord with astronomical observations. Dust formation is concentrated in the last phase of evolution, the thermally pulsing AGB. Due to the limited lifetime of dust grains in the ISM only parent stars from a narrow range of metallicities are expected to contribute to the population of presolar dust grains. Silicate and silicon carbide dust grains are predicted to come from parent stars with metallicities not less than about Z ∼ 0.008 (0.6 x solar). This metallicity limit is higher than that inferred from presolar SiC grain isotope data. The population of presolar carbon dust grains is predicted to originate from a wider range of metallicities, down to Z ∼ 0.004. Masses of AGB stars that produce C-rich dust are in the range
Technical normalization in the geoinformatics branch
Directory of Open Access Journals (Sweden)
Bronislava Horáková
2006-09-01
Full Text Available A basic principle of the technical normalisation is to hold the market development by developing unified technical rules for all concerned subjects. The information and communication technological industry is characterised by certain specific features contrary to the traditional industry. These features bring to the normalisation domain new demands, mainly the flexibility enabling to reflect the rapidly development market of ICT elastic way. The goal of the paper is to provide a comprehensive overview of the current process of technical normalization in the geoinformatic branch
Organization and targets of the European Branch
Energy Technology Data Exchange (ETDEWEB)
Cataldi, R
1997-12-01
After a short historical review of the formation, objectives and organization of the International Geothermal Association (IGA), this paper describes the functions, goals and activities of the IGA European Branch. In particular, the paper illustrates the plan of action established for the periods 1993-`95 and 1996-`98, and the issues dealt with by the European Forum as of August 1996. The last section of the paper outlines the main problems to be faced in the near future in order to facilitate the aggregation of efforts, the amalgamation of promotional initiatives and the coordination of the basic activities needed for the consolidation and growth of the geothermal community in Europe. (orig.)
Accelerator Physics Branch annual technical report, 1989
International Nuclear Information System (INIS)
Hulbert, J.A.
1990-08-01
The report describes, in a series of separate articles, the achievements of the Accelerator Physics Branch for the calendar year 1989. Work in basic problems of accelerator physics including ion sources, high-duty-factor rf quadrupoles, coupling effects in standing wave linacs and laser acceleration is outlined. A proposal for a synchrotron light source for Canada is described. Other articles cover the principal design features of the IMPELA industrial electron linac prototype, the cavities developed for the HERA complex at DESY, Hamburg, West Germany, and further machine projects that have been completed
Geology of the Cane Branch and Helton Branch watershed areas, McCreary County, Kentucky
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.
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....
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…
Randomized Controlled Trial of Problem-Solving Therapy for Minor Depression in Home Care
Gellis, Zvi D.; McGinty, Jean; Tierney, Lynda; Jordan, Cindy; Burton, Jean; Misener, Elizabeth
2008-01-01
Objective: Data are presented from a pilot research program initiated to develop, refine, and test the outcomes of problem-solving therapy that targets the needs of older adults with minor depression in home care settings. Method: A pilot randomized clinical trial compares the impact of problem-solving therapy for home care to treatment as usual…
The Impact of Parental Attitudes on Problem Solving Skills in High School Students
Tösten, Rasim; Han, Bünyamin; Anik, Sabri
2017-01-01
Problem solving skill is one of the important skills which are expected to be gained during the educational programs. In the development of children's skills and shaping the behaviors, parental attitudes are believed to be effective. That means problem-solving skills and behavioral characteristics of individuals are closely related. From that…
Large branched self-assembled DNA complexes
International Nuclear Information System (INIS)
Tosch, Paul; Waelti, Christoph; Middelberg, Anton P J; Davies, A Giles
2007-01-01
Many biological molecules have been demonstrated to self-assemble into complex structures and networks by using their very efficient and selective molecular recognition processes. The use of biological molecules as scaffolds for the construction of functional devices by self-assembling nanoscale complexes onto the scaffolds has recently attracted significant attention and many different applications in this field have emerged. In particular DNA, owing to its inherent sophisticated self-organization and molecular recognition properties, has served widely as a scaffold for various nanotechnological self-assembly applications, with metallic and semiconducting nanoparticles, proteins, macromolecular complexes, inter alia, being assembled onto designed DNA scaffolds. Such scaffolds may typically contain multiple branch-points and comprise a number of DNA molecules selfassembled into the desired configuration. Previously, several studies have used synthetic methods to produce the constituent DNA of the scaffolds, but this typically constrains the size of the complexes. For applications that require larger self-assembling DNA complexes, several tens of nanometers or more, other techniques need to be employed. In this article, we discuss a generic technique to generate large branched DNA macromolecular complexes
Synthesis of branched naphthoquinones from castor oil
Directory of Open Access Journals (Sweden)
Adriano Olímpio da Silva
2012-06-01
Full Text Available The naphthoquinones are cyclic aromatic α,β-dienonas with a basic framework derived from naphthalene. They are also found in many higher plants, algae, fungi and as the product of the metabolism of some bacteria having large biologica activity described in the literature such as antibacterial, anti-inflammatory, antitumor, anticancer and trypanocidal [1-3]. Castor oil is an abundant raw material in Brazil of great versatility and, it is present in biodiesel production, surfactants, cosmetics and others. Considering the importance of naphthoquinones and, the availability of the ricinoleic acid from castor oil, the aim of this study was the preparation of new branched naphthoquinones in order to test their trypanocidal activity. Castor oil was submitted to saponification with sodium hydroxide, ethanol and water under reflux for 6 h. We then carried out an acid hydrolysis with hydrochloric acid and the formed ricinoleic acid was extracted with ethyl acetate. Following, through Kochi-Anderson addition reaction it was performed the alkylation of a naphthoquinone 1 and 2, using ammonium persulfate, silver nitrate, acetonitrile and water, under heating at 70-80 ° C during 3 h, to give the branched naphthoquinones 4 and 5 (scheme 1. The naphthoquinone 3 will be similarly submitted to this procedure. The naphthoquinones 4 and 5 were purified by column chromatography on sílica gel using hexane as the eluent. The compounds were characterized by mass spectrometry and 1H and 13CNMR spectroscopy.
Fixman compensating potential for general branched molecules
Energy Technology Data Exchange (ETDEWEB)
Jain, Abhinandan, E-mail: Abhi.Jain@jpl.nasa.gov [Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, California 91109 (United States); Kandel, Saugat; Wagner, Jeffrey; Larsen, Adrien; Vaidehi, Nagarajan, E-mail: nvaidehi@coh.org [Division of Immunology, Beckman Research Institute of the City of Hope, Duarte, California 91010 (United States)
2013-12-28
The technique of constraining high frequency modes of molecular motion is an effective way to increase simulation time scale and improve conformational sampling in molecular dynamics simulations. However, it has been shown that constraints on higher frequency modes such as bond lengths and bond angles stiffen the molecular model, thereby introducing systematic biases in the statistical behavior of the simulations. Fixman proposed a compensating potential to remove such biases in the thermodynamic and kinetic properties calculated from dynamics simulations. Previous implementations of the Fixman potential have been limited to only short serial chain systems. In this paper, we present a spatial operator algebra based algorithm to calculate the Fixman potential and its gradient within constrained dynamics simulations for branched topology molecules of any size. Our numerical studies on molecules of increasing complexity validate our algorithm by demonstrating recovery of the dihedral angle probability distribution function for systems that range in complexity from serial chains to protein molecules. We observe that the Fixman compensating potential recovers the free energy surface of a serial chain polymer, thus annulling the biases caused by constraining the bond lengths and bond angles. The inclusion of Fixman potential entails only a modest increase in the computational cost in these simulations. We believe that this work represents the first instance where the Fixman potential has been used for general branched systems, and establishes the viability for its use in constrained dynamics simulations of proteins and other macromolecules.
An Anomalous Branching of Coeliac Trunk
Directory of Open Access Journals (Sweden)
Jadhav Surekha D
2013-07-01
Full Text Available Anatomical variations of the coeliac trunk arevery common. A variation of coeliac trunk oc-curs due to the developmental abnormalities inthe ventral splanchnic arteries. Present paperhighlights a rare variation of branching patternof coeliac trunk which was observed during rou-tine dissection. In a 63 year old male cadaver,we observed a bifurcation of coeliac trunk intoshort hepato-splenic and longer hepato-gastrictrunks. The hepato-splenic trunk divided intocommon hepatic artery and splenic artery. Cys-tic artery originated from proper hepatic arteryand then proper hepatic artery divided into rightand left hepatic arteries. Hepato-gastric trunkran laterally and upward, and then it divided intotwo branches: a left gastric artery and left ac-cessory hepatic artery. Knowledge of this rarevariation is clinically very important for sur-geons, especially while performing liver trans-plantation, gastric, gallbladder surgeries andtransarterial chemoembolization for hepatictumor and during invasive procedures like an-giography and also other radiological studies.
Branching pathways in the photocycle of bacteriorhodopsin
International Nuclear Information System (INIS)
Kalisky, O.; Ottolenghi, M.
1982-01-01
The pulsed laser photolysis of light-adapted bacteriorhodopsin (BR 570 ) is carried out between 25 C and -92 C in neutral and alkaline water-glycerol solutions. At relatively low temperatures the primary photoproduct K 610 equilibrates with a blue-shifted species, Ksub(p). Both K 610 and the new intermediate subsequently decay into another species, K'sub(p), in a process which competes with the formation of L 550 . Finally, K'sub(p) converts very slowly to L 550 . This branched pathway delays the formation of L 550 and thus of M 412 , without affecting the final yield of either species. A thermal back-reaction regenerating BR 570 takes place at the stage of L 550 , inhibiting the formation of M 412 . The reaction which also predominates at low temperatures, is relatively inefficient at high pH when the forward L 550 → M 412 step is highly catalyzed. It is the superposition of both these branching mechanisms which accounts for the complex effects of temperature and pH on the photocycle of BR 570 . The latter mechanism is accounted for by a molecular scheme in which deprotonation of a tyrosine moiety at the stage of L 550 constitutes a prerequisite for deprotonation of the retinal-lysine schiff-base as required for forming M 412 . This scheme appears to be directly related to the proton pump. (author)
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.
Cravity modulation of the moss Tortula modica branching
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
Community-powered problem solving.
Gouillart, Francis; Billings, Douglas
2013-04-01
Traditionally, companies have managed their constituencies with specific processes: marketing to customers, procuring from vendors, developing HR policies for employees, and so on. The problem is, such processes focus on repeatability and compliance, so they can lead to stagnation. Inviting your constituencies to collectively help you solve problems and exploit opportunities--"co-creation"--is a better approach. It allows you to continually tap the skills and insights of huge numbers of stakeholders and develop new ways to produce value for all. The idea is to provide stakeholders with platforms (physical and digital forums) on which they can interact, get them to start exploring new experiences and connections, and let the system grow organically. A co-creation initiative by a unit of Becton, Dickinson and Company demonstrates how this works. A global leader in syringes, BD set out to deepen its ties with hospital customers and help them reduce the incidence of infections from unsafe injection and syringe disposal practices. The effort began with a cross-functional internal team, brought in the hospital procurement and supply managers BD had relationships with, and then reached out to hospitals' infection-prevention and occupational health leaders. Eventually product designers, nurses, sustainability staffers, and even hospital CFOs were using the platform, contributing data that generated new best practices and reduced infections.
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…
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.
Students’ difficulties in probabilistic problem-solving
Arum, D. P.; Kusmayadi, T. A.; Pramudya, I.
2018-03-01
There are many errors can be identified when students solving mathematics problems, particularly in solving the probabilistic problem. This present study aims to investigate students’ difficulties in solving the probabilistic problem. It focuses on analyzing and describing students errors during solving the problem. This research used the qualitative method with case study strategy. The subjects in this research involve ten students of 9th grade that were selected by purposive sampling. Data in this research involve students’ probabilistic problem-solving result and recorded interview regarding students’ difficulties in solving the problem. Those data were analyzed descriptively using Miles and Huberman steps. The results show that students have difficulties in solving the probabilistic problem and can be divided into three categories. First difficulties relate to students’ difficulties in understanding the probabilistic problem. Second, students’ difficulties in choosing and using appropriate strategies for solving the problem. Third, students’ difficulties with the computational process in solving the problem. Based on the result seems that students still have difficulties in solving the probabilistic problem. It means that students have not able to use their knowledge and ability for responding probabilistic problem yet. Therefore, it is important for mathematics teachers to plan probabilistic learning which could optimize students probabilistic thinking ability.
IDEAL Problem Solving dalam Pembelajaran Matematika
Directory of Open Access Journals (Sweden)
Eny Susiana
2012-01-01
Full Text Available Most educators agree that problem solving is among the most meaningful and importantkinds of learning and thingking. That is, the central focus of learning and instructionshould be learning to solve problems. There are several warrants supporting that claims.They are authenticity, relevance, problem solving engages deeper learning angtherefore enhances meaning making, and constructed to represent problems (problemsolving is more meaningful. It is the reason why we must provide teaching and learningto make studentâ€™s problem solving skill in progress. There are many informationprocessingmodels of problem solving, such as simplified model of the problem-solvingprocess by Gicks, Polyaâ€™s problem solving process etc. One of them is IDEAL problemsolving. Each letter of IDEAL is stand for an aspect of thinking that is important forproblem solving. IDEAL is identify problem, Define Goal, Explore possible strategies,Anticipate outcme and Act, and Look back and learn. Using peer interaction andquestion prompt in small group in IDEAL problem solving teaching and Learning canimprove problem solving skill.Kata kunci: IDEAL Problem Solving, Interaksi Sebaya, Pertanyaan Penuntun, KelompokKecil.