WorldWideScience

Sample records for branch and bound algorithms

  1. Kodiak: An Implementation Framework for Branch and Bound Algorithms

    Science.gov (United States)

    Smith, Andrew P.; Munoz, Cesar A.; Narkawicz, Anthony J.; Markevicius, Mantas

    2015-01-01

    Recursive branch and bound algorithms are often used to refine and isolate solutions to several classes of global optimization problems. A rigorous computation framework for the solution of systems of equations and inequalities involving nonlinear real arithmetic over hyper-rectangular variable and parameter domains is presented. It is derived from a generic branch and bound algorithm that has been formally verified, and utilizes self-validating enclosure methods, namely interval arithmetic and, for polynomials and rational functions, Bernstein expansion. Since bounds computed by these enclosure methods are sound, this approach may be used reliably in software verification tools. Advantage is taken of the partial derivatives of the constraint functions involved in the system, firstly to reduce the branching factor by the use of bisection heuristics and secondly to permit the computation of bifurcation sets for systems of ordinary differential equations. The associated software development, Kodiak, is presented, along with examples of three different branch and bound problem types it implements.

  2. A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions

    KAUST Repository

    Fowkes, Jaroslav M.

    2012-06-21

    We present a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex set. The algorithm is based on applying cubic regularisation techniques to the objective function within an overlapping branch and bound algorithm for convex constrained global optimization. Unlike other branch and bound algorithms, lower bounds are obtained via nonconvex underestimators of the function. For a numerical example, we apply the proposed branch and bound algorithm to radial basis function approximations. © 2012 Springer Science+Business Media, LLC.

  3. A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions

    KAUST Repository

    Fowkes, Jaroslav M.; Gould, Nicholas I. M.; Farmer, Chris L.

    2012-01-01

    We present a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex set. The algorithm is based on applying cubic regularisation

  4. Modifications of the branch-and-bound algorithm for application in constrained adaptive testing

    NARCIS (Netherlands)

    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

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

    Science.gov (United States)

    Poore, Aubrey B.; Yan, Xin

    1999-07-01

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

  6. A Lagrangian lower bound for the container transshipment problem at a railway hub for a fast branch-and-bound algorithm

    OpenAIRE

    M Barketau; H Kopfer; E Pesch

    2013-01-01

    In this paper, we consider the container transshipment problem at a railway hub. A simple lower bound known for this problem will be improved by a new Lagrangian relaxation lower bound. Computational tests show that this lower bound outperforms the simple one and decreases substantially the run time of the branch-and-bound algorithm.

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

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

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

  10. A Branch-and-bound Algorithm for the Network Diversion Problem

    National Research Council Canada - National Science Library

    Erken, Ozgur

    2002-01-01

    ...). We develop and test a specialized branch-and-hound algorithm for this NP-complete problem. The algorithm is based on partitioning the solution space with respect to edges in certain s-t cuts and yields a non- standard, non-binary enumeration tree...

  11. A branch-and-bound algorithm for the capacitated facility location problem with convex production costs

    DEFF Research Database (Denmark)

    Klose, Andreas

    solution approaches: The use of perspective cuts, a second-order cone (SOC) MIP formulation for the case of quadratic costs, and Benders’ decomposition. Our computational results indicate that in many case the branch-and-bound method is superior to both the perspective cut approach, the SOC MIP...

  12. Branch-and-Bound algorithm applied to uncertainty quantification of a Boiling Water Reactor Station Blackout

    Energy Technology Data Exchange (ETDEWEB)

    Nielsen, Joseph, E-mail: joseph.nielsen@inl.gov [Idaho National Laboratory, 1955 N. Fremont Avenue, P.O. Box 1625, Idaho Falls, ID 83402 (United States); University of Idaho, Department of Mechanical Engineering and Nuclear Engineering Program, 1776 Science Center Drive, Idaho Falls, ID 83402-1575 (United States); Tokuhiro, Akira [University of Idaho, Department of Mechanical Engineering and Nuclear Engineering Program, 1776 Science Center Drive, Idaho Falls, ID 83402-1575 (United States); Hiromoto, Robert [University of Idaho, Department of Computer Science, 1776 Science Center Drive, Idaho Falls, ID 83402-1575 (United States); Tu, Lei [University of Idaho, Department of Mechanical Engineering and Nuclear Engineering Program, 1776 Science Center Drive, Idaho Falls, ID 83402-1575 (United States)

    2015-12-15

    Highlights: • Dynamic Event Tree solutions have been optimized using the Branch-and-Bound algorithm. • A 60% efficiency in optimization has been achieved. • Modeling uncertainty within a risk-informed framework is evaluated. - Abstract: Evaluation of the impacts of uncertainty and sensitivity in modeling presents a significant set of challenges in particular to high fidelity modeling. Computational costs and validation of models creates a need for cost effective decision making with regards to experiment design. Experiments designed to validate computation models can be used to reduce uncertainty in the physical model. In some cases, large uncertainty in a particular aspect of the model may or may not have a large impact on the final results. For example, modeling of a relief valve may result in large uncertainty, however, the actual effects on final peak clad temperature in a reactor transient may be small and the large uncertainty with respect to valve modeling may be considered acceptable. Additionally, the ability to determine the adequacy of a model and the validation supporting it should be considered within a risk informed framework. Low fidelity modeling with large uncertainty may be considered adequate if the uncertainty is considered acceptable with respect to risk. In other words, models that are used to evaluate the probability of failure should be evaluated more rigorously with the intent of increasing safety margin. Probabilistic risk assessment (PRA) techniques have traditionally been used to identify accident conditions and transients. Traditional classical event tree methods utilize analysts’ knowledge and experience to identify the important timing of events in coordination with thermal-hydraulic modeling. These methods lack the capability to evaluate complex dynamic systems. In these systems, time and energy scales associated with transient events may vary as a function of transition times and energies to arrive at a different physical

  13. Branch-and-Bound algorithm applied to uncertainty quantification of a Boiling Water Reactor Station Blackout

    International Nuclear Information System (INIS)

    Nielsen, Joseph; Tokuhiro, Akira; Hiromoto, Robert; Tu, Lei

    2015-01-01

    Highlights: • Dynamic Event Tree solutions have been optimized using the Branch-and-Bound algorithm. • A 60% efficiency in optimization has been achieved. • Modeling uncertainty within a risk-informed framework is evaluated. - Abstract: Evaluation of the impacts of uncertainty and sensitivity in modeling presents a significant set of challenges in particular to high fidelity modeling. Computational costs and validation of models creates a need for cost effective decision making with regards to experiment design. Experiments designed to validate computation models can be used to reduce uncertainty in the physical model. In some cases, large uncertainty in a particular aspect of the model may or may not have a large impact on the final results. For example, modeling of a relief valve may result in large uncertainty, however, the actual effects on final peak clad temperature in a reactor transient may be small and the large uncertainty with respect to valve modeling may be considered acceptable. Additionally, the ability to determine the adequacy of a model and the validation supporting it should be considered within a risk informed framework. Low fidelity modeling with large uncertainty may be considered adequate if the uncertainty is considered acceptable with respect to risk. In other words, models that are used to evaluate the probability of failure should be evaluated more rigorously with the intent of increasing safety margin. Probabilistic risk assessment (PRA) techniques have traditionally been used to identify accident conditions and transients. Traditional classical event tree methods utilize analysts’ knowledge and experience to identify the important timing of events in coordination with thermal-hydraulic modeling. These methods lack the capability to evaluate complex dynamic systems. In these systems, time and energy scales associated with transient events may vary as a function of transition times and energies to arrive at a different physical

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

  15. A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms

    Directory of Open Access Journals (Sweden)

    Shangchia Liu

    2015-01-01

    Full Text Available In the field of distributed decision making, different agents share a common processing resource, and each agent wants to minimize a cost function depending on its jobs only. These issues arise in different application contexts, including real-time systems, integrated service networks, industrial districts, and telecommunication systems. Motivated by its importance on practical applications, we consider two-agent scheduling on a single machine where the objective is to minimize the total completion time of the jobs of the first agent with the restriction that an upper bound is allowed the total completion time of the jobs for the second agent. For solving the proposed problem, a branch-and-bound and three simulated annealing algorithms are developed for the optimal solution, respectively. In addition, the extensive computational experiments are also conducted to test the performance of the algorithms.

  16. Towards an abstract parallel branch and bound machine

    NARCIS (Netherlands)

    A. de Bruin (Arie); G.A.P. Kindervater (Gerard); H.W.J.M. Trienekens

    1995-01-01

    textabstractMany (parallel) branch and bound algorithms look very different from each other at first glance. They exploit, however, the same underlying computational model. This phenomenon can be used to define branch and bound algorithms in terms of a set of basic rules that are applied in a

  17. A tool for simulating parallel branch-and-bound methods

    Science.gov (United States)

    Golubeva, Yana; Orlov, Yury; Posypkin, Mikhail

    2016-01-01

    The Branch-and-Bound method is known as one of the most powerful but very resource consuming global optimization methods. Parallel and distributed computing can efficiently cope with this issue. The major difficulty in parallel B&B method is the need for dynamic load redistribution. Therefore design and study of load balancing algorithms is a separate and very important research topic. This paper presents a tool for simulating parallel Branchand-Bound method. The simulator allows one to run load balancing algorithms with various numbers of processors, sizes of the search tree, the characteristics of the supercomputer's interconnect thereby fostering deep study of load distribution strategies. The process of resolution of the optimization problem by B&B method is replaced by a stochastic branching process. Data exchanges are modeled using the concept of logical time. The user friendly graphical interface to the simulator provides efficient visualization and convenient performance analysis.

  18. A tool for simulating parallel branch-and-bound methods

    Directory of Open Access Journals (Sweden)

    Golubeva Yana

    2016-01-01

    Full Text Available The Branch-and-Bound method is known as one of the most powerful but very resource consuming global optimization methods. Parallel and distributed computing can efficiently cope with this issue. The major difficulty in parallel B&B method is the need for dynamic load redistribution. Therefore design and study of load balancing algorithms is a separate and very important research topic. This paper presents a tool for simulating parallel Branchand-Bound method. The simulator allows one to run load balancing algorithms with various numbers of processors, sizes of the search tree, the characteristics of the supercomputer’s interconnect thereby fostering deep study of load distribution strategies. The process of resolution of the optimization problem by B&B method is replaced by a stochastic branching process. Data exchanges are modeled using the concept of logical time. The user friendly graphical interface to the simulator provides efficient visualization and convenient performance analysis.

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

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

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

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

    NARCIS (Netherlands)

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

    1997-01-01

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

  3. Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Moruz, Gabriel

    2005-01-01

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

  4. Subdivision, Sampling, and Initialization Strategies for Simplical Branch and Bound in Global Optimization

    DEFF Research Database (Denmark)

    Clausen, Jens; Zilinskas, A,

    2002-01-01

    We consider the problem of optimizing a Lipshitzian function. The branch and bound technique is a well-known solution method, and the key components for this are the subdivision scheme, the bound calculation scheme, and the initialization. For Lipschitzian optimization, the bound calculations are...

  5. A Partitioning and Bounded Variable Algorithm for Linear Programming

    Science.gov (United States)

    Sheskin, Theodore J.

    2006-01-01

    An interesting new partitioning and bounded variable algorithm (PBVA) is proposed for solving linear programming problems. The PBVA is a variant of the simplex algorithm which uses a modified form of the simplex method followed by the dual simplex method for bounded variables. In contrast to the two-phase method and the big M method, the PBVA does…

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

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

  8. Branch-and-cut algorithms for the split delivery vehicle routing problem

    NARCIS (Netherlands)

    Archetti, Claudia; Bianchessi, Nicola; Speranza, M. Grazia

    2014-01-01

    In this paper we present two exact branch-and-cut algorithms for the Split Delivery Vehicle Routing Problem (SDVRP) based on two relaxed formulations that provide lower bounds to the optimum. Procedures to obtain feasible solutions to the SDVRP from a feasible solution to the relaxed formulations

  9. Design of planar articulated mechanisms using branch and bound

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Kawamoto, Atsushi

    2005-01-01

    This paper considers an optimization model and a solution method for the design of two-dimensional mechanical mechanisms. The mechanism design problem is modeled as a nonconvex mixed integer program which allows the optimal topology and geometry of the mechanism to be determined simultaneously...

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

  11. Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm

    OpenAIRE

    Gelareha, Shahin; Monemic, Rahimeh Neamatian; Semetd, Frederic

    2017-01-01

    In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein each hub acts as a transshipment node for one directed route. The number of hubs lies between a minimum and a maximum and the hub-level network is a complete subgraph. The transshipment operations take place at the hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoke- to-hub allocations. We propose a mathematical model and a branch-and-cut algor...

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

  13. Aplikasi Algoritma Branch and Bound Untuk Optimasi Jalur Pemadam Kebakaran Kota Yogyakarta

    Directory of Open Access Journals (Sweden)

    Sri Margiyani

    2014-04-01

    Full Text Available Kasus kebakaran di Indonesia, khususnya Kota Yogyakarta dari tahun ke tahun masih menunjukkan angka yang tinggi. Hal ini mengakibatkan kerugian yang cukup tinggi bagi korban kebakaran. Untuk meminimalisasi terjadinya korban jiwa dan kerugian secara material saat terjadi kebakaran, maka pihak pemadam kebakaran mengupayakan melalui rute terpendek untuk sampai di lokasi kebakaran. Tujuan dari penelitian ini adalah pencarian rute terpendek jalur pemadam kebakaran dari kantor pemadam sampai ke lokasi kebakaran. Permasalahan pencarian rute terpendek jalur pemadam kebakaran secara abstrak dapat digambarkan dengan suatu graf yang merupakan masalah optimasi dalam pencarian rute terpendek (Shortest Path Problem. Pemecahan permasalahan tersebut adalah dengan merepresentasikan peta pemadam kebakaran ke dalam bentuk graf berbobot dan berarah, selanjutnya permasalahan diselesaikan menggunakan Algoritma Branch and Bound. Perhitungan dilakukan secara manual dengan jarak (dalam meter sebagai bobot perhitungan.  Berdasarkan perhitungan menggunakan Algoritma Branch and Bound untuk optimasi jalur pemadam kebakaran Kota Yogyakarta untuk wilayah Kecamatan Umbulharjo menghasilkan solusi rute: Kantor pemadam kebakaran – Jln. Ipda Tut Harsono - Jln. Kusumanegara – Jln. Glagahsari – Kantor Kecamatan Umbulharjo dengan total jarak 5305 meter atau 5,035 km.

  14. A Mathematical Study on “Additive Technique” Versus “Branch and Bound Technique” for Solving Binary Programming Problem

    Science.gov (United States)

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

  15. Disjunctive cuts in a branch-and-price algorithm for the capacitated vehicle routing problem

    DEFF Research Database (Denmark)

    Røpke, Stefan

    This talk presents computational results that show the usefulness of the general-purpose valid inequalities disjunctive cuts when applied to the CVRP. Results indicate that the disjunctive cuts are able to reduce the gap between lower bound and upper bound more than state-of-the-art problem...... specific inequalities. Results also indicate that introducing the cuts leads to a smaller branch and bound tree and faster solution times overall....

  16. Optimization method to branch-and-bound large SBO state spaces under dynamic probabilistic risk assessment via use of LENDIT scales and S2R2 sets

    International Nuclear Information System (INIS)

    Nielsen, Joseph; Tokuhiro, Akira; Khatry, Jivan; Hiromoto, Robert

    2014-01-01

    Traditional probabilistic risk assessment (PRA) methods have been developed to evaluate risk associated with complex systems; however, PRA methods lack the capability to evaluate complex dynamic systems. In these systems, time and energy scales associated with transient events may vary as a function of transition times and energies to arrive at a different physical state. Dynamic PRA (DPRA) methods provide a more rigorous analysis of complex dynamic systems. Unfortunately DPRA methods introduce issues associated with combinatorial explosion of states. In order to address this combinatorial complexity, a branch-and-bound optimization technique is applied to the DPRA formalism to control the combinatorial state explosion. In addition, a new characteristic scaling metric (LENDIT – length, energy, number, distribution, information and time) is proposed as linear constraints that are used to guide the branch-and-bound algorithm to limit the number of possible states to be analyzed. The LENDIT characterization is divided into four groups or sets – 'state, system, resource and response' (S2R2) – describing reactor operations (normal and off-normal). In this paper we introduce the branch-and-bound DPRA approach and the application of LENDIT scales and S2R2 sets to a station blackout (SBO) transient. (author)

  17. An O(m log n) algorithm for stuttering equivalence and branching bisimulation

    NARCIS (Netherlands)

    Groote, J.F.; Wijs, A.J.; Chechik, M.; Raskin, J.-F.

    2016-01-01

    We provide a new algorithm to determine stuttering equivalence with time complexity O(m log n), where n is the number of states and m is the number of transitions of a Kripke structure. This algorithm can also be used to determine branching bisimulation in O(m(log|Act|+log n)) time. Theoretically,

  18. An O(mlog n) algorithm for computing stuttering equivalence and branching bisimulation

    NARCIS (Netherlands)

    Groote, J.F.; Jansen, D.N.; Keiren, J.J.A.; Wijs, A.J.

    2017-01-01

    We provide a new algorithm to determine stuttering equivalence with time complexity O(mlog n), where n is the number of states and mis the number of transitions of a Kripke structure. This algorithm can also be used to determine branching bisimulation in O(m(log |Act| + log n)) time, where Act is

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

  20. New Facets and a Branch-and-Cut Algorithm for the Weighted Clique Problem

    DEFF Research Database (Denmark)

    Sørensen, Michael Malmros

    2001-01-01

    of facet defining inequalities in a branch-and-cut algorithm for the problem. We give a description of this algorithm, including some separation procedures, and present the computational results for different sets of test problems. The computation times that are obtained indicate that this algorithm...... four new classes of facet defining inequalities for the associated b-clique polytope. One of these inequality classes constitutes a generalization of the well known tree inequalities; the other classes are associated with multistars. We utilize these inequality classes together with other classes...... is more efficient than previously described algorithms for the problem....

  1. A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem

    DEFF Research Database (Denmark)

    Bach, Lukas; Wøhlk, Sanne; Lysgaard, Jens

    2016-01-01

    In this paper, we consider the Mixed Capacitated General Routing Problem which is a combination of the Capacitated Vehicle Routing Problem and the Capacitated Arc Routing Problem. The problem is also known as the Node, Edge, and Arc Routing Problem. We propose a Branch-and-Cut-and-Price algorithm...

  2. New facets and a branch-and-cut algorithm for the weighted clique problem

    DEFF Research Database (Denmark)

    Sørensen, Michael Malmros

    2004-01-01

    four new classes of facet defining inequalities for the associated b-clique polytope. One of these inequality classes constitutes a generalization of the well known tree inequalities; the other classes are associated with multistars. We use these inequalities together with other classes of facet...... defining inequalities in a branch-and-cut algorithm for the problem. We give a description of this algorithm, including some separation procedures, and present the computational results for different sets of test problems. The computation times that are obtained indicate that this algorithm is more...

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

  4. A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem

    NARCIS (Netherlands)

    K. Dalmeijer (Kevin); R. Spliet (Remy)

    2016-01-01

    textabstractThis paper presents a branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known. A novel set of valid inequalities, the precedence inequalities, is introduced and

  5. Cutting Planes for Branch-and-Price Algorithms

    DEFF Research Database (Denmark)

    Desaulniers, Guy; Desrosiers, Jacques; Spoorendonk, Simon

    2011-01-01

    This article presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be derived using the variables of an equivalent compact formulation (i.e., the subproblem variables) or the master problem variables. In the fi......This article presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be derived using the variables of an equivalent compact formulation (i.e., the subproblem variables) or the master problem variables....... In the first case, cuts are added to the compact formulation, either at the master level or the subproblem level, and the decomposition process is reapplied. In the second case, we show that it is possible to model inequalities defined on the master problem variables by adding new variables and constraints......, and the cutting stock problem. © 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 58(4), 301–310 2011...

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

    Science.gov (United States)

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

    2011-01-01

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

  7. A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

    DEFF Research Database (Denmark)

    Wøhlk, Sanne; Lysgaard, Jens

    2014-01-01

    The paper considers the Cumulative Capacitated Vehicle Routing Problem (CCVRP), which is a variation of the well-known Capacitated Vehicle Routing Problem (CVRP). In this problem, the traditional objective of minimizing total distance or time traveled by the vehicles is replaced by minimizing...... the sum of arrival times at the customers. A branch-and-cut-and-price algorithm for obtaining optimal solutions to the problem is proposed. Computational results based on a set of standard CVRP benchmarks are presented....

  8. Control Theoretical Expression of Quantum Systems And Lower Bound of Finite Horizon Quantum Algorithms

    OpenAIRE

    Yanagisawa, Masahiro

    2007-01-01

    We provide a control theoretical method for a computational lower bound of quantum algorithms based on quantum walks of a finite time horizon. It is shown that given a quantum network, there exists a control theoretical expression of the quantum system and the transition probability of the quantum walk is related to a norm of the associated transfer function.

  9. First direct observation of bound-state beta-decay: Measurements of branching and lifetime of 207Tl81+ fragments

    International Nuclear Information System (INIS)

    Boutin, D.

    2005-08-01

    The first experimental observation of bound-state beta-decay showed, that due solely to the electron stripping, a stable nuclide, e.g. 163 Dy, became unstable. Also a drastic modification of the half-life of bare 187 Re, from 4.12(2) x 10 10 years down to 32.9(20) years, could be observed. It was mainly due to the possibility for the mother nuclide to decay into a previously inaccessible nuclear level of the daughter nuclide. It was proposed to study a nuclide where this decay mode was competing with continuum-state beta-decay, in order to measure their respective branchings. The ratio β b /β c could also be evaluated for the first time. 207 Tl was chosen due to its high atomic number, and Q-value of about 1.4 MeV, small enough to enhance the β b probability and large enough to allow the use of time-resolved Schottky Mass Spectrometry (SMS) to study the evolution of mother and bound-state beta-decay daughter ions. The decay properties of the ground state and isomeric state of 207 Tl 81+ have been investigated at the GSI accelerator facility in two separate experiments. For the first time β-decay where the electron could go either to a bound state (atomic orbitals) and lead to 207 Pb 81+ as a daughter nuclide, or to a continuum state and lead to 207 Pb 82+ , has been observed. The respective branchings of these two processes could be measured as well. The deduced total nuclear half-life of 255(17) s for 207 Tl 81+ , was slightly modified with respect to the half-life of the neutral atom of 286(2) s. It was nevertheless in very good agreement with calculations based on the assumption that the beta-decay was following an allowed type of transition. The branching β b /β c =0.192(20), was also in very good agreement with the same calculations. The application of stochastic precooling allowed to observe in addition the 1348 keV short-lived isomeric state of 207 Tl. The half-life of this isomeric state was measured as 1.47(32) s, which shows a small deviation

  10. Solusi Optimal Model Optimisasi Robust Untuk Masalah Traveling Salesman Dengan Ketidaktentuan Kotak Dan Pendekatan Metode Branch And Bound

    Directory of Open Access Journals (Sweden)

    Poppy Amriyati

    2015-12-01

    Full Text Available Traveling Salesman Problem (TSP merupakan teknik pencarian rute yang dimulai dari satu titik awal, setiap kota harus dikunjungi sekali dan kemudian kembali ke tempat asal sehingga total jarak atau waktu perjalanan adalah minimum. Untuk mengatasi kedakpastian jarak atau waktu perjalanan, maka perlu dilakukan pengembangan model TSP. Salah satu bidang Optimisasi yang mampu menyelesaikan permasalahan terkait ketidakpastian adalah Optimisasi Robust. Dalam makalah ini dibahas mengenai penerapan Optimisasi Robust pada TSP (RTSP menggunakan pendekatan Box Uncertainty dan diselesaikan dengan menggunakan Metode Branch and Bound. Disajikan simulasi numerik pada software aplikasi Maple untuk beberapa kasus nyata terkait penerapan Optimisasi RTSP , seperti masalah manajemen konstruksi, penentuan jarak tempuh kota di Pulau Jawa, dan Penentuan Rute Mandiri Fun Run.

  11. Automatic bounding estimation in modified NLMS algorithm

    International Nuclear Information System (INIS)

    Shahtalebi, K.; Doost-Hoseini, A.M.

    2002-01-01

    Modified Normalized Least Mean Square algorithm, which is a sign form of Nlm based on set-membership (S M) theory in the class of optimal bounding ellipsoid (OBE) algorithms, requires a priori knowledge of error bounds that is unknown in most applications. In a special but popular case of measurement noise, a simple algorithm has been proposed. With some simulation examples the performance of algorithm is compared with Modified Normalized Least Mean Square

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

    International Nuclear Information System (INIS)

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

    2011-01-01

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

  13. Affordances of the 'branch and bound' paradigm for developing computational thinking

    NARCIS (Netherlands)

    van der Meulen, Joris; Timmer, Mark

    As technological advances in engineering and computer science happen more and more quickly, we must shift focus from teaching specific techniques or programming languages to teaching something more transcending: computational thinking (Wing, 2006). Wing explained this concept later as “the thought

  14. Algorithms for polynomial spectral factorization and bounded-real balanced state space representations

    NARCIS (Netherlands)

    Rapisarda, P.; Trentelman, H.L.; Minh, H.B.

    We illustrate an algorithm that starting from the image representation of a strictly bounded-real system computes a minimal balanced state variable, from which a minimal balanced state realization is readily obtained. The algorithm stems from an iterative procedure to compute a storage function,

  15. New matrix bounds and iterative algorithms for the discrete coupled algebraic Riccati equation

    Science.gov (United States)

    Liu, Jianzhou; Wang, Li; Zhang, Juan

    2017-11-01

    The discrete coupled algebraic Riccati equation (DCARE) has wide applications in control theory and linear system. In general, for the DCARE, one discusses every term of the coupled term, respectively. In this paper, we consider the coupled term as a whole, which is different from the recent results. When applying eigenvalue inequalities to discuss the coupled term, our method has less error. In terms of the properties of special matrices and eigenvalue inequalities, we propose several upper and lower matrix bounds for the solution of DCARE. Further, we discuss the iterative algorithms for the solution of the DCARE. In the fixed point iterative algorithms, the scope of Lipschitz factor is wider than the recent results. Finally, we offer corresponding numerical examples to illustrate the effectiveness of the derived results.

  16. Energy-bounded caging: Formal definition and 2-D energy lower bound algorithm based on weighted alpha shapes

    NARCIS (Netherlands)

    Mahler, Jeffrey; Pokorny, Florian T.; McCarthy, Zoe; van der Stappen, A.F.; Goldberg, Ken

    Caging grasps are valuable as they can be robust to bounded variations in object shape and pose, do not depend on friction, and enable transport of an object without full immobilization. Complete caging of an object is useful but may not be necessary in cases where forces such as gravity are

  17. MAXIMUM r-REGULAR INDUCED SUBGRAPH PROBLEM: FAST EXPONENTIAL ALGORITHMS AND COMBINATORIAL BOUNDS

    DEFF Research Database (Denmark)

    Gupta, S.; Raman, V.; Saurabh, S.

    2012-01-01

    We show that for a fixed r, the number of maximal r-regular induced subgraphs in any graph with n vertices is upper bounded by O(c(n)), where c is a positive constant strictly less than 2. This bound generalizes the well-known result of Moon and Moser, who showed an upper bound of 3(n/3) on the n...

  18. A Branch-and-Price algorithm for stable workforce assignments with hierarchical skills

    NARCIS (Netherlands)

    Firat, M.; Briskorn, D.; Laugier, A.

    2016-01-01

    This paper deals with assigning hierarchically skilled technicians to jobs by considering preferences. We investigate stability definitions in multi-skill workforce assignments stemming from the notion of blocking pairs as stated in the Marriage model of Gale–Shapley. We propose a Branch-and-Price

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

    Science.gov (United States)

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

    2017-10-15

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

  20. Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs

    Directory of Open Access Journals (Sweden)

    Igor Stojanović

    2017-01-01

    Full Text Available The continuous planar facility location problem with the connected region of feasible solutions bounded by arcs is a particular case of the constrained Weber problem. This problem is a continuous optimization problem which has a nonconvex feasible set of constraints. This paper suggests appropriate modifications of four metaheuristic algorithms which are defined with the aim of solving this type of nonconvex optimization problems. Also, a comparison of these algorithms to each other as well as to the heuristic algorithm is presented. The artificial bee colony algorithm, firefly algorithm, and their recently proposed improved versions for constrained optimization are appropriately modified and applied to the case study. The heuristic algorithm based on modified Weiszfeld procedure is also implemented for the purpose of comparison with the metaheuristic approaches. Obtained numerical results show that metaheuristic algorithms can be successfully applied to solve the instances of this problem of up to 500 constraints. Among these four algorithms, the improved version of artificial bee algorithm is the most efficient with respect to the quality of the solution, robustness, and the computational efficiency.

  1. Effective calculation algorithm for nuclear chains of arbitrary length and branching

    International Nuclear Information System (INIS)

    Chirkov, V.A.; Mishanin, B.V.

    1994-01-01

    An effective algorithm for calculation of the isotope concentration in the spent nuclear fuel when it is kept in storage, is presented. Using the superposition principle and representing the transfer function in a rather compact form it becomes possible achieve high calculation speed and a moderate computer code size. The algorithm is applied for the calculation of activity, energy release and toxicity of heavy nuclides and products of their decay when the fuel is kept in storage. (authors). 1 ref., 4 tabs

  2. New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks: new formulation and branch-and-cut algorithm

    NARCIS (Netherlands)

    Sampaio Oliveira, A.H.; Urrutia, S.

    2017-01-01

    In this paper, we consider the pickup and delivery traveling salesman problem with multiple stacks in which a single vehicle must serve a set of customer requests defined by a pair of pickup and delivery destinations of an item. The vehicle contains a fixed number of stacks, where each item is

  3. A general algorithm for radioactive decay with branching and loss from a medium

    International Nuclear Information System (INIS)

    Strenge, D.L.

    1995-07-01

    Many areas in the field of health physics require evaluation of the change of radionuclide quantity in a medium with time. A general solution to first-order compartmental models is presented in this paper for application to systems consisting of one physical medium that contains any number of radionuclide decay chain members. The general analytical solution to the problem is first described mathematically, and then extended to four applications: (1) evaluation of the quantity of radionuclides as a function of time, (2) evaluation of the time integral of the quantity during a time period, (3) evaluation of the amount in a medium as a function of time following deposition at a constant rate, and (4) evaluation of the time integral of the amount in a medium after deposition at a constant rate for a time. The solution can be applied to any system involving physical transfers from the medium and radioactive chain decay with branching in the medium. The general solution is presented for quantities expressed in units of atoms and activity. Unlike many earlier mathematical solutions, this solution includes chain decay with branching explicitly in the equations

  4. A Branch-and-Price Algorithm for Two Multi-Compartment Vehicle Routing Problems

    DEFF Research Database (Denmark)

    Mirzaei, Samira; Wøhlk, Sanne

    2017-01-01

    by comparing the optimal costs of the two versions. Computational results are presented for instances with up to 100 customers and the algorithm can solve instances with up to 50 customers and 4 commodities to optimality. NOTE: An early version of the paper was made public on the website of the journal...

  5. A Branch-and-Price algorithm for railway rolling stock rescheduling

    DEFF Research Database (Denmark)

    Lusby, Richard Martin; Haahr, Jørgen Thorlund; Larsen, Jesper

    2017-01-01

    How to best reschedule their fleet of rolling stock units during a disruption is an optimization problem regularly faced by railway operators. Despite the problem’s high complexity, it is still usually solved manually. In this paper we propose a path based mathematical formulation and solve...... by the suburban railway operator in Copenhagen, DSB S-tog. When used in combination with a lower bound method taken from the literature we show that near-optimal solutions to this rescheduling problem can be found within a few seconds. Furthermore, we show that the proposed methodology can be used, with minor...

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

  7. A fast algorithm for determining bounds and accurate approximate p-values of the rank product statistic for replicate experiments.

    Science.gov (United States)

    Heskes, Tom; Eisinga, Rob; Breitling, Rainer

    2014-11-21

    The rank product method is a powerful statistical technique for identifying differentially expressed molecules in replicated experiments. A critical issue in molecule selection is accurate calculation of the p-value of the rank product statistic to adequately address multiple testing. Both exact calculation and permutation and gamma approximations have been proposed to determine molecule-level significance. These current approaches have serious drawbacks as they are either computationally burdensome or provide inaccurate estimates in the tail of the p-value distribution. We derive strict lower and upper bounds to the exact p-value along with an accurate approximation that can be used to assess the significance of the rank product statistic in a computationally fast manner. The bounds and the proposed approximation are shown to provide far better accuracy over existing approximate methods in determining tail probabilities, with the slightly conservative upper bound protecting against false positives. We illustrate the proposed method in the context of a recently published analysis on transcriptomic profiling performed in blood. We provide a method to determine upper bounds and accurate approximate p-values of the rank product statistic. The proposed algorithm provides an order of magnitude increase in throughput as compared with current approaches and offers the opportunity to explore new application domains with even larger multiple testing issue. The R code is published in one of the Additional files and is available at http://www.ru.nl/publish/pages/726696/rankprodbounds.zip .

  8. Communication Lower Bounds and Optimal Algorithms for Programs that Reference Arrays - Part 1

    Science.gov (United States)

    2013-05-14

    that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it...by UC Discovery (award DIG07-10227), with additional support from ParLab affiliates National Instruments, Nokia , NVIDIA, Oracle, and Samsung, and...presents a number of examples showing why the assumptions of Theorem 4.1 are in fact necessary to obtain a lower bound. Section 4.5 looks at one of these

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

  10. A branch-and-price algorithm for the long-term home care scheduling problem

    DEFF Research Database (Denmark)

    Gamst, Mette; Jensen, Thomas Sejr

    2012-01-01

    In several countries, home care is provided for certain citizens living at home. The long-term home care scheduling problem is to generate work plans such that a high quality of service is maintained, the work hours of the employees are respected, and the overall cost is kept as low as possible. We...... propose a branchand-price algorithm for the long-term home care scheduling problem. The pricing problem generates a one-day plan for an employee, and the master problem merges the plans with respect to regularity constraints. The method is capable of generating plans with up to 44 visits during one week....

  11. First direct observation of bound-state beta-decay. Measurements of branching and lifetime of {sup 207}Tl{sup 81+} fragments

    Energy Technology Data Exchange (ETDEWEB)

    Boutin, D.

    2005-08-01

    The first experimental observation of bound-state beta-decay showed, that due solely to the electron stripping, a stable nuclide, e.g. {sup 163}Dy, became unstable. Also a drastic modification of the half-life of bare {sup 187}Re, from 4.12(2) x 10{sup 10} years down to 32.9(20) years, could be observed. It was mainly due to the possibility for the mother nuclide to decay into a previously inaccessible nuclear level of the daughter nuclide. It was proposed to study a nuclide where this decay mode was competing with continuum-state beta-decay, in order to measure their respective branchings. The ratio {beta}{sub b}/{beta}{sub c} could also be evaluated for the first time. {sup 207}Tl was chosen due to its high atomic number, and Q-value of about 1.4 MeV, small enough to enhance the {beta}{sub b} probability and large enough to allow the use of time-resolved Schottky Mass Spectrometry (SMS) to study the evolution of mother and bound-state beta-decay daughter ions. The decay properties of the ground state and isomeric state of {sup 207}Tl{sup 81+} have been investigated at the GSI accelerator facility in two separate experiments. For the first time {beta}-decay where the electron could go either to a bound state (atomic orbitals) and lead to {sup 207}Pb{sup 81+} as a daughter nuclide, or to a continuum state and lead to {sup 207}Pb{sup 82+}, has been observed. The respective branchings of these two processes could be measured as well. The deduced total nuclear half-life of 255(17) s for {sup 207}Tl{sup 81+}, was slightly modified with respect to the half-life of the neutral atom of 286(2) s. It was nevertheless in very good agreement with calculations based on the assumption that the beta-decay was following an allowed type of transition. The branching {beta}{sub b}/{beta}{sub c}=0.192(20), was also in very good agreement with the same calculations. The application of stochastic precooling allowed to observe in addition the 1348 keV short-lived isomeric state of {sup

  12. Spanning Trees whose Stems have a Bounded Number of Branch Vertices

    Directory of Open Access Journals (Sweden)

    Yan Zheng

    2016-08-01

    Full Text Available Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T. The subtree T − Leaf(T of T is called the stem of T and denoted by Stem(T. In this paper, we give two sufficient conditions for a connected graph to have a spanning tree whose stem has a bounded number of branch vertices, and these conditions are best possible.

  13. Upper and lower bounds for disadvantage factors as a test of algorithm used in a synthesis method

    International Nuclear Information System (INIS)

    Nanneh, M.M.; Ackroyd, R.T.

    1991-01-01

    A lower bound for the disadvantage factor of a lattice cell of arbitrary configuration is obtained using a finite element method which is based on a variational principle for the even-parity angular flux. An upper bound for the disadvantage factor is given by a finite element method using the complementary variational principle for the odd-parity angular flux. These theoretical results are illustrated by calculations for uranium/graphite and uranium/water lattices. As the approximations are refined the fluxes obtained by the first method tend towards the actual flux from below in the moderator, and from above in the fuel. These trends are reversed for the second method. This derivation of benchmarks for disadvantage factors has been undertaken primarily as a test of an important algorithm used by the authors in a method of synthesising transport solutions starting with a diffusion theory approximation. The algorithm is used to convert odd-parity approximations for the angular flux into even-parity approximations and vice versa. (author). 15 refs., 8 tabs., 9 figs

  14. Upper and lower bounds for disadvantage factors as a test of an algorithm used in a synthesis method

    International Nuclear Information System (INIS)

    Ackroyd, R.T.; Nanneh, M.M.

    1988-01-01

    A lower bound for the disadvantage factor of a lattice cell of arbitrary configuration is obtained using a finite element method which is based on a variational principle for the even-parity angular flux. An upper bound for the disadvantage factor is given by a finite element method using the complementary variational principle for the odd-parity angular flux. These theoretical results are illustrated by calculations for urnaium/graphite and uranium/water lattices. As the approximations are refined the fluxes obtained by the first method tend towards the actual flux from below in the moderator, and from above in the fuel. These trends are reversed for the second method. This derivation of benchmarks for disadvantage factors has been undertaken primarily as a test of an important algorithm used by the authors in a method of synthesising transport solutions starting with a diffusion theory approximation. The algorithm is used to convert odd-parity approximations for the angular flux into even-parity approximations and vice versa. (author)

  15. Algorithm-Dependent Generalization Bounds for Multi-Task Learning.

    Science.gov (United States)

    Liu, Tongliang; Tao, Dacheng; Song, Mingli; Maybank, Stephen J

    2017-02-01

    Often, tasks are collected for multi-task learning (MTL) because they share similar feature structures. Based on this observation, in this paper, we present novel algorithm-dependent generalization bounds for MTL by exploiting the notion of algorithmic stability. We focus on the performance of one particular task and the average performance over multiple tasks by analyzing the generalization ability of a common parameter that is shared in MTL. When focusing on one particular task, with the help of a mild assumption on the feature structures, we interpret the function of the other tasks as a regularizer that produces a specific inductive bias. The algorithm for learning the common parameter, as well as the predictor, is thereby uniformly stable with respect to the domain of the particular task and has a generalization bound with a fast convergence rate of order O(1/n), where n is the sample size of the particular task. When focusing on the average performance over multiple tasks, we prove that a similar inductive bias exists under certain conditions on the feature structures. Thus, the corresponding algorithm for learning the common parameter is also uniformly stable with respect to the domains of the multiple tasks, and its generalization bound is of the order O(1/T), where T is the number of tasks. These theoretical analyses naturally show that the similarity of feature structures in MTL will lead to specific regularizations for predicting, which enables the learning algorithms to generalize fast and correctly from a few examples.

  16. Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation

    Science.gov (United States)

    Hamane, Ryoso; Itoh, Toshiya

    When a store sells items to customers, the store wishes to decide the prices of the items to maximize its profit. If the store sells the items with low (resp. high) prices, the customers buy more (resp. less) items, which provides less profit to the store. It would be hard for the store to decide the prices of items. Assume that a store has a set V of n items and there is a set C of m customers who wish to buy those items. The goal of the store is to decide the price of each item to maximize its profit. We refer to this maximization problem as an item pricing problem. We classify the item pricing problems according to how many items the store can sell or how the customers valuate the items. If the store can sell every item i with unlimited (resp. limited) amount, we refer to this as unlimited supply (resp. limited supply). We say that the item pricing problem is single-minded if each customer j∈C wishes to buy a set ej⊆V of items and assigns valuation w(ej)≥0. For the single-minded item pricing problems (in unlimited supply), Balcan and Blum regarded them as weighted k-hypergraphs and gave several approximation algorithms. In this paper, we focus on the (pseudo) degree of k-hypergraphs and the valuation ratio, i. e., the ratio between the smallest and the largest valuations. Then for the single-minded item pricing problems (in unlimited supply), we show improved approximation algorithms (for k-hypergraphs, general graphs, bipartite graphs, etc.) with respect to the maximum (pseudo) degree and the valuation ratio.

  17. Algorithms for optimization of branching gravity-driven water networks

    Science.gov (United States)

    Dardani, Ian; Jones, Gerard F.

    2018-05-01

    The design of a water network involves the selection of pipe diameters that satisfy pressure and flow requirements while considering cost. A variety of design approaches can be used to optimize for hydraulic performance or reduce costs. To help designers select an appropriate approach in the context of gravity-driven water networks (GDWNs), this work assesses three cost-minimization algorithms on six moderate-scale GDWN test cases. Two algorithms, a backtracking algorithm and a genetic algorithm, use a set of discrete pipe diameters, while a new calculus-based algorithm produces a continuous-diameter solution which is mapped onto a discrete-diameter set. The backtracking algorithm finds the global optimum for all but the largest of cases tested, for which its long runtime makes it an infeasible option. The calculus-based algorithm's discrete-diameter solution produced slightly higher-cost results but was more scalable to larger network cases. Furthermore, the new calculus-based algorithm's continuous-diameter and mapped solutions provided lower and upper bounds, respectively, on the discrete-diameter global optimum cost, where the mapped solutions were typically within one diameter size of the global optimum. The genetic algorithm produced solutions even closer to the global optimum with consistently short run times, although slightly higher solution costs were seen for the larger network cases tested. The results of this study highlight the advantages and weaknesses of each GDWN design method including closeness to the global optimum, the ability to prune the solution space of infeasible and suboptimal candidates without missing the global optimum, and algorithm run time. We also extend an existing closed-form model of Jones (2011) to include minor losses and a more comprehensive two-part cost model, which realistically applies to pipe sizes that span a broad range typical of GDWNs of interest in this work, and for smooth and commercial steel roughness values.

  18. Algorithms for optimization of branching gravity-driven water networks

    Directory of Open Access Journals (Sweden)

    I. Dardani

    2018-05-01

    Full Text Available The design of a water network involves the selection of pipe diameters that satisfy pressure and flow requirements while considering cost. A variety of design approaches can be used to optimize for hydraulic performance or reduce costs. To help designers select an appropriate approach in the context of gravity-driven water networks (GDWNs, this work assesses three cost-minimization algorithms on six moderate-scale GDWN test cases. Two algorithms, a backtracking algorithm and a genetic algorithm, use a set of discrete pipe diameters, while a new calculus-based algorithm produces a continuous-diameter solution which is mapped onto a discrete-diameter set. The backtracking algorithm finds the global optimum for all but the largest of cases tested, for which its long runtime makes it an infeasible option. The calculus-based algorithm's discrete-diameter solution produced slightly higher-cost results but was more scalable to larger network cases. Furthermore, the new calculus-based algorithm's continuous-diameter and mapped solutions provided lower and upper bounds, respectively, on the discrete-diameter global optimum cost, where the mapped solutions were typically within one diameter size of the global optimum. The genetic algorithm produced solutions even closer to the global optimum with consistently short run times, although slightly higher solution costs were seen for the larger network cases tested. The results of this study highlight the advantages and weaknesses of each GDWN design method including closeness to the global optimum, the ability to prune the solution space of infeasible and suboptimal candidates without missing the global optimum, and algorithm run time. We also extend an existing closed-form model of Jones (2011 to include minor losses and a more comprehensive two-part cost model, which realistically applies to pipe sizes that span a broad range typical of GDWNs of interest in this work, and for smooth and commercial steel

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

    Directory of Open Access Journals (Sweden)

    Bisheng He

    2014-01-01

    Full Text Available A time-space network based optimization method is designed for high-speed rail train timetabling problem to improve the service level of the high-speed rail. The general time-space path cost is presented which considers both the train travel time and the high-speed rail operation requirements: (1 service frequency requirement; (2 stopping plan adjustment; and (3 priority of train types. Train timetabling problem based on time-space path aims to minimize the total general time-space path cost of all trains. An improved branch-and-price algorithm is applied to solve the large scale integer programming problem. When dealing with the algorithm, a rapid branching and node selection for branch-and-price tree and a heuristic train time-space path generation for column generation are adopted to speed up the algorithm computation time. The computational results of a set of experiments on China’s high-speed rail system are presented with the discussions about the model validation, the effectiveness of the general time-space path cost, and the improved branch-and-price algorithm.

  20. Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Bektas, Tolga; Erdogan, Günes; Røpke, Stefan

    2011-01-01

    The Generalized Vehicle Routing Problem (GVRP) consists of nding a set of routes for a number of vehicles with limited capacities on a graph with the vertices partitioned into clusters with given demands such that the total cost of travel is minimized and all demands are met. This paper offers four...

  1. A branch-and-cut algorithm for the capacitated open vehicle routing problem

    DEFF Research Database (Denmark)

    Letchford, A.N.; Lysgaard, Jens; Eglese, R.W.

    2007-01-01

    -and-cut. We show that, even though the open CVRP initially looks like a minor variation of the standard CVRP, the integer programming formulation and cutting planes need to be modified in subtle ways. Computational results are given for several standard test instances, which enables us for the first time...... to assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem....

  2. A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Letchford, Adam N.; Lysgaard, Jens; Eglese, Richard W.

    -and-cut. We show that, even though the open CVRP initially looks like a minor variation of the standard CVRP, the integer programming formulation and cutting planes need to be modified in subtle ways. Computational results are given for several standard test instances, which enables us for the first time...... to assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem....

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

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Pisinger, David

    2012-01-01

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

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

    DEFF Research Database (Denmark)

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

    2014-01-01

    This paper considers the Capacitated Profitable Tour Problem (CPTP) which is a special case of the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). The CPTP belongs to the group of problems known as traveling salesman problems with profits. In CPTP each customer is associated...... with a profit and a demand and the objective is to find a capacitated tour (rooted in a depot node) that minimizes the total travel distance minus the profit of the visited customers. The CPTP can be recognized as the sub-problem in many column generation applications, where it is traditionally solved through...

  5. Exponential Lower Bounds for the PPSZ k-SAT Algorithm

    DEFF Research Database (Denmark)

    Chen, Shiteng; Scheder, Dominik Alban; Talebanfard, Navid

    2013-01-01

    In 1998, Paturi, Pudl´ak, Saks, and Zane presented PPSZ, an elegant randomized algorithm for k-SAT. Fourteen years on, this algorithm is still the fastest known worst-case algorithm. They proved that its expected running time on k-CNF formulas with n variables is at most 2(1−k)n, where k 2 (1/k).......). So far, no exponential lower bounds at all have been known. In this paper, we construct hard instances for PPSZ. That is, we construct satisfiable k-CNF formulas over n variables on which the expected running time is at least 2(1−k)n, for k 2 O(log2 k/k)....

  6. General upper bounds on the runtime of parallel evolutionary algorithms.

    Science.gov (United States)

    Lässig, Jörg; Sudholt, Dirk

    2014-01-01

    We present a general method for analyzing the runtime of parallel evolutionary algorithms with spatially structured populations. Based on the fitness-level method, it yields upper bounds on the expected parallel runtime. This allows for a rigorous estimate of the speedup gained by parallelization. Tailored results are given for common migration topologies: ring graphs, torus graphs, hypercubes, and the complete graph. Example applications for pseudo-Boolean optimization show that our method is easy to apply and that it gives powerful results. In our examples the performance guarantees improve with the density of the topology. Surprisingly, even sparse topologies such as ring graphs lead to a significant speedup for many functions while not increasing the total number of function evaluations by more than a constant factor. We also identify which number of processors lead to the best guaranteed speedups, thus giving hints on how to parameterize parallel evolutionary algorithms.

  7. Fast Branch & Bound algorithms for optimal feature selection

    Czech Academy of Sciences Publication Activity Database

    Somol, Petr; Pudil, Pavel; Kittler, J.

    2004-01-01

    Roč. 26, č. 7 (2004), s. 900-912 ISSN 0162-8828 R&D Projects: GA ČR GA402/02/1271; GA ČR GA402/03/1310; GA AV ČR KSK1019101 Institutional research plan: CEZ:AV0Z1075907 Keywords : subset search * feature selection * search tree Subject RIV: BD - Theory of Information Impact factor: 4.352, year: 2004

  8. A tighter bound for the self-stabilization time in Hermanʼs algorithm

    DEFF Research Database (Denmark)

    Feng, Yuan; Zhang, Lijun

    2013-01-01

    We study the expected self-stabilization time of Hermanʼs algorithm. For N processors the lower bound is 427N2 (0.148N2), and an upper bound of 0.64N2 is presented in Kiefer et al. (2011) [4]. In this paper we give a tighter upper bound 0.521N2. © 2013 Published by Elsevier B.V....

  9. Solving binary-state multi-objective reliability redundancy allocation series-parallel problem using efficient epsilon-constraint, multi-start partial bound enumeration algorithm, and DEA

    International Nuclear Information System (INIS)

    Khalili-Damghani, Kaveh; Amiri, Maghsoud

    2012-01-01

    In this paper, a procedure based on efficient epsilon-constraint method and data envelopment analysis (DEA) is proposed for solving binary-state multi-objective reliability redundancy allocation series-parallel problem (MORAP). In first module, a set of qualified non-dominated solutions on Pareto front of binary-state MORAP is generated using an efficient epsilon-constraint method. In order to test the quality of generated non-dominated solutions in this module, a multi-start partial bound enumeration algorithm is also proposed for MORAP. The performance of both procedures is compared using different metrics on well-known benchmark instance. The statistical analysis represents that not only the proposed efficient epsilon-constraint method outperform the multi-start partial bound enumeration algorithm but also it improves the founded upper bound of benchmark instance. Then, in second module, a DEA model is supplied to prune the generated non-dominated solutions of efficient epsilon-constraint method. This helps reduction of non-dominated solutions in a systematic manner and eases the decision making process for practical implementations. - Highlights: ► A procedure based on efficient epsilon-constraint method and DEA was proposed for solving MORAP. ► The performance of proposed procedure was compared with a multi-start PBEA. ► Methods were statistically compared using multi-objective metrics.

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

    Science.gov (United States)

    Sui, Haiteng; Niu, Wentie

    2016-09-01

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

  11. Effect of a culture-based screening algorithm on tuberculosis incidence in immigrants and refugees bound for the United States: a population-based cross-sectional study.

    Science.gov (United States)

    Liu, Yecai; Posey, Drew L; Cetron, Martin S; Painter, John A

    2015-03-17

    Before 2007, immigrants and refugees bound for the United States were screened for tuberculosis (TB) by a smear-based algorithm that could not diagnose smear-negative/culture-positive TB. In 2007, the Centers for Disease Control and Prevention implemented a culture-based algorithm. To evaluate the effect of the culture-based algorithm on preventing the importation of TB to the United States by immigrants and refugees from foreign countries. Population-based, cross-sectional study. Panel physician sites for overseas medical examination. Immigrants and refugees with TB. Comparison of the increase of smear-negative/culture-positive TB cases diagnosed overseas among immigrants and refugees by the culture-based algorithm with the decline of reported cases among foreign-born persons within 1 year after arrival in the United States from 2007 to 2012. Of the 3 212 421 arrivals of immigrants and refugees from 2007 to 2012, a total of 1 650 961 (51.4%) were screened by the smear-based algorithm and 1 561 460 (48.6%) were screened by the culture-based algorithm. Among the 4032 TB cases diagnosed by the culture-based algorithm, 2195 (54.4%) were smear-negative/culture-positive. Before implementation (2002 to 2006), the annual number of reported cases among foreign-born persons within 1 year after arrival was relatively constant (range, 1424 to 1626 cases; mean, 1504 cases) but decreased from 1511 to 940 cases during implementation (2007 to 2012). During the same period, the annual number of smear-negative/culture-positive TB cases diagnosed overseas among immigrants and refugees bound for the United States by the culture-based algorithm increased from 4 to 629. This analysis did not control for the decline in new arrivals of nonimmigrant visitors to the United States and the decrease of incidence of TB in their countries of origin. Implementation of the culture-based algorithm may have substantially reduced the incidence of TB among newly arrived, foreign-born persons in

  12. Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax

    DEFF Research Database (Denmark)

    Krejca, Martin S.; Witt, Carsten

    2017-01-01

    The Univariate Marginal Distribution Algorithm (UMDA), a popular estimation of distribution algorithm, is studied from a run time perspective. On the classical OneMax benchmark function, a lower bound of Ω(μ√n + n log n), where μ is the population size, on its expected run time is proved...... values maintained by the algorithm, including carefully designed potential functions. These techniques may prove useful in advancing the field of run time analysis for estimation of distribution algorithms in general........ This is the first direct lower bound on the run time of the UMDA. It is stronger than the bounds that follow from general black-box complexity theory and is matched by the run time of many evolutionary algorithms. The results are obtained through advanced analyses of the stochastic change of the frequencies of bit...

  13. A database of linear codes over F_13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm

    Directory of Open Access Journals (Sweden)

    Eric Z. Chen

    2015-01-01

    Full Text Available Error control codes have been widely used in data communications and storage systems. One central problem in coding theory is to optimize the parameters of a linear code and construct codes with best possible parameters. There are tables of best-known linear codes over finite fields of sizes up to 9. Recently, there has been a growing interest in codes over $\\mathbb{F}_{13}$ and other fields of size greater than 9. The main purpose of this work is to present a database of best-known linear codes over the field $\\mathbb{F}_{13}$ together with upper bounds on the minimum distances. To find good linear codes to establish lower bounds on minimum distances, an iterative heuristic computer search algorithm is employed to construct quasi-twisted (QT codes over the field $\\mathbb{F}_{13}$ with high minimum distances. A large number of new linear codes have been found, improving previously best-known results. Tables of $[pm, m]$ QT codes over $\\mathbb{F}_{13}$ with best-known minimum distances as well as a table of lower and upper bounds on the minimum distances for linear codes of length up to 150 and dimension up to 6 are presented.

  14. Bounded Rationality and Budgeting

    OpenAIRE

    Ibrahim, Mukdad

    2016-01-01

    This article discusses the theory of bounded rationality which had been introduced by Herbert Simon in the 1950s. Simon introduced the notion of bounded rationality stating that while decision-makers strive for rationality, they are limited by the effect of the environment, their information process capacity and by the constraints on their information storage and retrieval capabilities. Moreover, this article tries to specifically blend this notion into budgeting, using the foundations of inc...

  15. Bound and rebound states

    International Nuclear Information System (INIS)

    Orzalesi, C.A.

    1979-01-01

    In relativistic quantum theory, bound states generate forces in the crossed channel; such forces can affect the binding and self-consistent solutions should be sought for the bound-state problem. The author investigates how self-consistency can be achieved by successive approximations, in a simple scalar model and with successive relativistic eikonal approximations (EAs). Within the generalized ladder approximation, some exact properties of the resulting ''first generation'' bound states are discussed. The binding energies in this approximation are rather small even for rather large values of the primary coupling constant. The coupling of the constituent particles to the first-generation reggeon is determined by a suitable EA and a new generalized ladder amplitude is constructed with rungs given either by the primary gluons or by the first-generation reggeons. The resulting new (second-generation) bound states are found in a reggeized EA. The size of the corrections to the binding energies due to the rebinding effects is surprisingly large. The procedure is then iterated, so as to find - again in an EA - the third-generation bound states. The procedure is found to be self-consistent already at this stage: the third-generation bound states coincide with those of second generation, and no further rebinding takes place in the higher iterations of the approximation method. Features - good and bad - of the model are discussed, as well as the possible relevance of rebinding mechanisms in hadron dynamics. (author)

  16. Can abnormal returns be earned on bandwidth-bounded currencies? Evidence from a genetic algorithm

    OpenAIRE

    Pedro Godinho

    2012-01-01

    Most of the studies about the Foreign Exchange market (Forex) analyse the behaviour of currencies that are allowed to float freely (or almost freely), but some currencies are still bounded by bandwidths (either disclosed or undisclosed). In this paper, I try to find out whether two bandwidth-bounded currencies, the Hong Kong dollar (HKD) and the Singapore dollar (SGD), present opportunities for abnormal returns. I consider a set of trading rules, and I use a genetic algorithm to optimise both...

  17. Computational experience with a parallel algorithm for tetrangle inequality bound smoothing.

    Science.gov (United States)

    Rajan, K; Deo, N

    1999-09-01

    Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances can usually be obtained only for a small subset of the 2(n(n-1)) atom pairs, using NMR. Given the bounds so obtained on the distances between some of the atom pairs, it is often useful to compute tighter bounds on all the 2(n(n-1)) pairwise distances. This process is referred to as bound smoothing. The initial lower and upper bounds for the pairwise distances not measured are usually assumed to be 0 and infinity. One method for bound smoothing is to use the limits imposed by the triangle inequality. The distance bounds so obtained can often be tightened further by applying the tetrangle inequality--the limits imposed on the six pairwise distances among a set of four atoms (instead of three for the triangle inequalities). The tetrangle inequality is expressed by the Cayley-Menger determinants. For every quadruple of atoms, each pass of the tetrangle inequality bound smoothing procedure finds upper and lower limits on each of the six distances in the quadruple. Applying the tetrangle inequalities to each of the (4n) quadruples requires O(n4) time. Here, we propose a parallel algorithm for bound smoothing employing the tetrangle inequality. Each pass of our algorithm requires O(n3 log n) time on a REW PRAM (Concurrent Read Exclusive Write Parallel Random Access Machine) with O(log(n)n) processors. An implementation of this parallel algorithm on the Intel Paragon XP/S and its performance are also discussed.

  18. Rational hybrid Monte Carlo algorithm for theories with unknown spectral bounds

    International Nuclear Information System (INIS)

    Kogut, J. B.; Sinclair, D. K.

    2006-01-01

    The Rational Hybrid Monte Carlo (RHMC) algorithm extends the Hybrid Monte Carlo algorithm for lattice QCD simulations to situations involving fractional powers of the determinant of the quadratic Dirac operator. This avoids the updating increment (dt) dependence of observables which plagues the Hybrid Molecular-dynamics (HMD) method. The RHMC algorithm uses rational approximations to fractional powers of the quadratic Dirac operator. Such approximations are only available when positive upper and lower bounds to the operator's spectrum are known. We apply the RHMC algorithm to simulations of 2 theories for which a positive lower spectral bound is unknown: lattice QCD with staggered quarks at finite isospin chemical potential and lattice QCD with massless staggered quarks and chiral 4-fermion interactions (χQCD). A choice of lower bound is made in each case, and the properties of the RHMC simulations these define are studied. Justification of our choices of lower bounds is made by comparing measurements with those from HMD simulations, and by comparing different choices of lower bounds

  19. Bounded variation and around

    CERN Document Server

    Appell, Jürgen; Merentes Díaz, Nelson José

    2013-01-01

    This monographis a self-contained exposition of the definition and properties of functionsof bounded variation and their various generalizations; the analytical properties of nonlinear composition operators in spaces of such functions; applications to Fourier analysis, nonlinear integral equations, and boundary value problems. The book is written for non-specialists. Every chapter closes with a list of exercises and open problems.

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

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

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

    DEFF Research Database (Denmark)

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

    2014-01-01

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

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

  4. Subexponential lower bounds for randomized pivoting rules for the simplex algorithm

    DEFF Research Database (Denmark)

    Friedmann, Oliver; Hansen, Thomas Dueholm; Zwick, Uri

    2011-01-01

    The simplex algorithm is among the most widely used algorithms for solving linear programs in practice. With essentially all deterministic pivoting rules it is known, however, to require an exponential number of steps to solve some linear programs. No non-polynomial lower bounds were known, prior...... to this work, for randomized pivoting rules. We provide the first subexponential (i.e., of the form 2Ω(nα), for some α>0) lower bounds for the two most natural, and most studied, randomized pivoting rules suggested to date. The first randomized pivoting rule considered is Random-Edge, which among all improving...... pivoting steps (or edges) from the current basic feasible solution (or vertex) chooses one uniformly at random. The second randomized pivoting rule considered is Random-Facet, a more complicated randomized pivoting rule suggested by Kalai and by Matousek, Sharir and Welzl. Our lower bound for the Random...

  5. An Interval Bound Algorithm of optimizing reactor core loading pattern by using reactivity interval schema

    International Nuclear Information System (INIS)

    Gong Zhaohu; Wang Kan; Yao Dong

    2011-01-01

    Highlights: → We present a new Loading Pattern Optimization method - Interval Bound Algorithm (IBA). → IBA directly uses the reactivity of fuel assemblies and burnable poison. → IBA can optimize fuel assembly orientation in a coupled way. → Numerical experiment shows that IBA outperforms genetic algorithm and engineers. → We devise DDWF technique to deal with multiple objectives and constraints. - Abstract: In order to optimize the core loading pattern in Nuclear Power Plants, the paper presents a new optimization method - Interval Bound Algorithm (IBA). Similar to the typical population based algorithms, e.g. genetic algorithm, IBA maintains a population of solutions and evolves them during the optimization process. IBA acquires the solution by statistical learning and sampling the control variable intervals of the population in each iteration. The control variables are the transforms of the reactivity of fuel assemblies or the worth of burnable poisons, which are the crucial heuristic information for loading pattern optimization problems. IBA can deal with the relationship between the dependent variables by defining the control variables. Based on the IBA algorithm, a parallel Loading Pattern Optimization code, named IBALPO, has been developed. To deal with multiple objectives and constraints, the Dynamic Discontinuous Weight Factors (DDWF) for the fitness function have been used in IBALPO. Finally, the code system has been used to solve a realistic reloading problem and a better pattern has been obtained compared with the ones searched by engineers and genetic algorithm, thus the performance of the code is proved.

  6. Methods and Technologies Branch (MTB)

    Science.gov (United States)

    The Methods and Technologies Branch focuses on methods to address epidemiologic data collection, study design and analysis, and to modify technological approaches to better understand cancer susceptibility.

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

  8. Rigorous lower bound on the dynamic critical exponent of some multilevel Swendsen-Wang algorithms

    International Nuclear Information System (INIS)

    Li, X.; Sokal, A.D.

    1991-01-01

    We prove the rigorous lower bound z exp ≥α/ν for the dynamic critical exponent of a broad class of multilevel (or ''multigrid'') variants of the Swendsen-Wang algorithm. This proves that such algorithms do suffer from critical slowing down. We conjecture that such algorithms in fact lie in the same dynamic universality class as the stanard Swendsen-Wang algorithm

  9. Upper-Lower Bounds Candidate Sets Searching Algorithm for Bayesian Network Structure Learning

    Directory of Open Access Journals (Sweden)

    Guangyi Liu

    2014-01-01

    Full Text Available Bayesian network is an important theoretical model in artificial intelligence field and also a powerful tool for processing uncertainty issues. Considering the slow convergence speed of current Bayesian network structure learning algorithms, a fast hybrid learning method is proposed in this paper. We start with further analysis of information provided by low-order conditional independence testing, and then two methods are given for constructing graph model of network, which is theoretically proved to be upper and lower bounds of the structure space of target network, so that candidate sets are given as a result; after that a search and scoring algorithm is operated based on the candidate sets to find the final structure of the network. Simulation results show that the algorithm proposed in this paper is more efficient than similar algorithms with the same learning precision.

  10. Cryptographic protocol security analysis based on bounded constructing algorithm

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    An efficient approach to analyzing cryptographic protocols is to develop automatic analysis tools based on formal methods. However, the approach has encountered the high computational complexity problem due to reasons that participants of protocols are arbitrary, their message structures are complex and their executions are concurrent. We propose an efficient automatic verifying algorithm for analyzing cryptographic protocols based on the Cryptographic Protocol Algebra (CPA) model proposed recently, in which algebraic techniques are used to simplify the description of cryptographic protocols and their executions. Redundant states generated in the analysis processes are much reduced by introducing a new algebraic technique called Universal Polynomial Equation and the algorithm can be used to verify the correctness of protocols in the infinite states space. We have implemented an efficient automatic analysis tool for cryptographic protocols, called ACT-SPA, based on this algorithm, and used the tool to check more than 20 cryptographic protocols. The analysis results show that this tool is more efficient, and an attack instance not offered previously is checked by using this tool.

  11. Exact parallel maximum clique algorithm for general and protein graphs.

    Science.gov (United States)

    Depolli, Matjaž; Konc, Janez; Rozman, Kati; Trobec, Roman; Janežič, Dušanka

    2013-09-23

    A new exact parallel maximum clique algorithm MaxCliquePara, which finds the maximum clique (the fully connected subgraph) in undirected general and protein graphs, is presented. First, a new branch and bound algorithm for finding a maximum clique on a single computer core, which builds on ideas presented in two published state of the art sequential algorithms is implemented. The new sequential MaxCliqueSeq algorithm is faster than the reference algorithms on both DIMACS benchmark graphs as well as on protein-derived product graphs used for protein structural comparisons. Next, the MaxCliqueSeq algorithm is parallelized by splitting the branch-and-bound search tree to multiple cores, resulting in MaxCliquePara algorithm. The ability to exploit all cores efficiently makes the new parallel MaxCliquePara algorithm markedly superior to other tested algorithms. On a 12-core computer, the parallelization provides up to 2 orders of magnitude faster execution on the large DIMACS benchmark graphs and up to an order of magnitude faster execution on protein product graphs. The algorithms are freely accessible on http://commsys.ijs.si/~matjaz/maxclique.

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

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

  14. A Finite Continuation Algorithm for Bound Constrained Quadratic Programming

    DEFF Research Database (Denmark)

    Madsen, Kaj; Nielsen, Hans Bruun; Pinar, Mustafa C.

    1999-01-01

    The dual of the strictly convex quadratic programming problem with unit bounds is posed as a linear $\\ell_1$ minimization problem with quadratic terms. A smooth approximation to the linear $\\ell_1$ function is used to obtain a parametric family of piecewise-quadratic approximation problems...

  15. A Scalable GVT Estimation Algorithm for PDES: Using Lower Bound of Event-Bulk-Time

    Directory of Open Access Journals (Sweden)

    Yong Peng

    2015-01-01

    Full Text Available Global Virtual Time computation of Parallel Discrete Event Simulation is crucial for conducting fossil collection and detecting the termination of simulation. The triggering condition of GVT computation in typical approaches is generally based on the wall-clock time or logical time intervals. However, the GVT value depends on the timestamps of events rather than the wall-clock time or logical time intervals. Therefore, it is difficult for the existing approaches to select appropriate time intervals to compute the GVT value. In this study, we propose a scalable GVT estimation algorithm based on Lower Bound of Event-Bulk-Time, which triggers the computation of the GVT value according to the number of processed events. In order to calculate the number of transient messages, our algorithm employs Event-Bulk to record the messages sent and received by Logical Processes. To eliminate the performance bottleneck, we adopt an overlapping computation approach to distribute the workload of GVT computation to all worker-threads. We compare our algorithm with the fast asynchronous GVT algorithm using PHOLD benchmark on the shared memory machine. Experimental results indicate that our algorithm has a light overhead and shows higher speedup and accuracy of GVT computation than the fast asynchronous GVT algorithm.

  16. Quivers of Bound Path Algebras and Bound Path Coalgebras

    Directory of Open Access Journals (Sweden)

    Dr. Intan Muchtadi

    2010-09-01

    Full Text Available bras and coalgebras can be represented as quiver (directed graph, and from quiver we can construct algebras and coalgebras called path algebras and path coalgebras. In this paper we show that the quiver of a bound path coalgebra (resp. algebra is the dual quiver of its bound path algebra (resp. coalgebra.

  17. Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles

    DEFF Research Database (Denmark)

    Hansen, Thomas Dueholm; Zwick, Uri

    2010-01-01

    Mean-Cost cycles (MMCC). Experimental studies suggest that Howard’s algorithm works extremely well in this context. The theoretical complexity of Howard’s algorithm for finding MMCCs is a mystery. No polynomial time bound is known on its running time. Prior to this work, there were only linear lower...

  18. HiggsBounds-4. Improved tests of extended Higgs sectors against exclusion bounds from LEP, the Tevatron and the LHC

    Energy Technology Data Exchange (ETDEWEB)

    Bechtle, Philip [Bonn Univ. (Germany). Physikalisches Inst.; Heinemeyer, Sven [Instituto de Fisica de Cantabria (CSIC-UC), Santander (Spain); Staal, Oscar [Stockholm Univ. (Sweden). Dept. of Physics; Stefaniak, Tim; Williams, Karina E. [Bonn Univ. (Germany). Physikalisches Inst.; Bonn Univ. (Germany). Bethe Center for Theoretical Physics; Weiglein, Georg [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Brein, Oliver

    2013-12-15

    We describe the new developments in version 4 of the public computer code HiggsBounds. HiggsBounds is a tool to test models with arbitrary Higgs sectors, containing both neutral and charged Higgs bosons, against the published exclusion bounds from Higgs searches at the LEP, Tevatron and LHC experiments. From the model predictions for the Higgs masses, branching ratios, production cross sections and total decay widths - which are specified by the user in the input for the program - the code calculates the predicted signal rates for the search channels considered in the experimental data. The signal rates are compared to the expected and observed cross section limits from the Higgs searches to determine whether a point in the model parameter space is excluded at 95% confidence level. In this paper we present a modification of the HiggsBounds main algorithm that extends the exclusion test in order to ensure that it provides useful results in the presence of one or more significant excesses in the data, corresponding to potential Higgs signals. We also describe a new method to test whether the limits from an experimental search performed under certain model assumptions can be applied to a different theoretical model. Further developments discussed here include a framework to take into account theoretical uncertainties on the Higgs mass predictions, and the possibility to obtain the {chi}{sup 2} likelihood of Higgs exclusion limits from LEP. Extensions to the user subroutines from earlier versions of HiggsBounds are described. The new features are demonstrated by additional example programs.

  19. HiggsBounds-4. Improved tests of extended Higgs sectors against exclusion bounds from LEP, the Tevatron and the LHC

    International Nuclear Information System (INIS)

    Bechtle, Philip; Staal, Oscar; Brein, Oliver

    2013-12-01

    We describe the new developments in version 4 of the public computer code HiggsBounds. HiggsBounds is a tool to test models with arbitrary Higgs sectors, containing both neutral and charged Higgs bosons, against the published exclusion bounds from Higgs searches at the LEP, Tevatron and LHC experiments. From the model predictions for the Higgs masses, branching ratios, production cross sections and total decay widths - which are specified by the user in the input for the program - the code calculates the predicted signal rates for the search channels considered in the experimental data. The signal rates are compared to the expected and observed cross section limits from the Higgs searches to determine whether a point in the model parameter space is excluded at 95% confidence level. In this paper we present a modification of the HiggsBounds main algorithm that extends the exclusion test in order to ensure that it provides useful results in the presence of one or more significant excesses in the data, corresponding to potential Higgs signals. We also describe a new method to test whether the limits from an experimental search performed under certain model assumptions can be applied to a different theoretical model. Further developments discussed here include a framework to take into account theoretical uncertainties on the Higgs mass predictions, and the possibility to obtain the χ 2 likelihood of Higgs exclusion limits from LEP. Extensions to the user subroutines from earlier versions of HiggsBounds are described. The new features are demonstrated by additional example programs.

  20. Length-Bounded Hybrid CPU/GPU Pattern Matching Algorithm for Deep Packet Inspection

    Directory of Open Access Journals (Sweden)

    Yi-Shan Lin

    2017-01-01

    Full Text Available Since frequent communication between applications takes place in high speed networks, deep packet inspection (DPI plays an important role in the network application awareness. The signature-based network intrusion detection system (NIDS contains a DPI technique that examines the incoming packet payloads by employing a pattern matching algorithm that dominates the overall inspection performance. Existing studies focused on implementing efficient pattern matching algorithms by parallel programming on software platforms because of the advantages of lower cost and higher scalability. Either the central processing unit (CPU or the graphic processing unit (GPU were involved. Our studies focused on designing a pattern matching algorithm based on the cooperation between both CPU and GPU. In this paper, we present an enhanced design for our previous work, a length-bounded hybrid CPU/GPU pattern matching algorithm (LHPMA. In the preliminary experiment, the performance and comparison with the previous work are displayed, and the experimental results show that the LHPMA can achieve not only effective CPU/GPU cooperation but also higher throughput than the previous method.

  1. Tolerance based algorithms for the ATSP

    NARCIS (Netherlands)

    Goldengorin, B; Sierksma, G; Turkensteen, M; Hromkovic, J; Nagl, M; Westfechtel, B

    2004-01-01

    In this paper we use arc tolerances, instead of arc costs, to improve Branch-and-Bound type algorithms for the Asymmetric Traveling Salesman Problem (ATSP). We derive new tighter lower bounds based on exact and approximate bottleneck upper tolerance values of the Assignment Problem (AP). It is shown

  2. Branching processes and neutral evolution

    CERN Document Server

    Taïb, Ziad

    1992-01-01

    The Galton-Watson branching process has its roots in the problem of extinction of family names which was given a precise formulation by F. Galton as problem 4001 in the Educational Times (17, 1873). In 1875, an attempt to solve this problem was made by H. W. Watson but as it turned out, his conclusion was incorrect. Half a century later, R. A. Fisher made use of the Galton-Watson process to determine the extinction probability of the progeny of a mutant gene. However, it was J. B. S. Haldane who finally gave the first sketch of the correct conclusion. J. B. S. Haldane also predicted that mathematical genetics might some day develop into a "respectable branch of applied mathematics" (quoted in M. Kimura & T. Ohta, Theoretical Aspects of Population Genetics. Princeton, 1971). Since the time of Fisher and Haldane, the two fields of branching processes and mathematical genetics have attained a high degree of sophistication but in different directions. This monograph is a first attempt to apply the current sta...

  3. Bound entanglement and local realism

    International Nuclear Information System (INIS)

    Kaszlikowski, Dagomir; Zukowski, Marek; Gnacinski, Piotr

    2002-01-01

    We show using a numerical approach, which gives necessary and sufficient conditions for the existence of local realism, that the bound entangled state presented in Bennett et al. [Phys. Rev. Lett. 82, 5385 (1999)] admits a local and realistic description. We also find the lowest possible amount of some appropriate entangled state that must be ad-mixed to the bound entangled state so that the resulting density operator has no local and realistic description and as such can be useful in quantum communication and quantum computation

  4. Algorithms for Protein Structure Prediction

    DEFF Research Database (Denmark)

    Paluszewski, Martin

    -trace. Here we present three different approaches for reconstruction of C-traces from predictable measures. In our first approach [63, 62], the C-trace is positioned on a lattice and a tabu-search algorithm is applied to find minimum energy structures. The energy function is based on half-sphere-exposure (HSE......) is more robust than standard Monte Carlo search. In the second approach for reconstruction of C-traces, an exact branch and bound algorithm has been developed [67, 65]. The model is discrete and makes use of secondary structure predictions, HSE, CN and radius of gyration. We show how to compute good lower...... bounds for partial structures very fast. Using these lower bounds, we are able to find global minimum structures in a huge conformational space in reasonable time. We show that many of these global minimum structures are of good quality compared to the native structure. Our branch and bound algorithm...

  5. Pareto upper confidence bounds algorithms : an empirical study

    NARCIS (Netherlands)

    Drugan, M.M.; Nowé, A.; Manderick, B.

    2014-01-01

    Many real-world stochastic environments are inherently multi-objective environments with conflicting objectives. The multi-objective multi-armed bandits (MOMAB) are extensions of the classical, i.e. single objective, multi-armed bandits to reward vectors and multi-objective optimisation techniques

  6. Reconciling taxonomy and phylogenetic inference: formalism and algorithms for describing discord and inferring taxonomic roots

    Directory of Open Access Journals (Sweden)

    Matsen Frederick A

    2012-05-01

    Full Text Available Abstract Background Although taxonomy is often used informally to evaluate the results of phylogenetic inference and the root of phylogenetic trees, algorithmic methods to do so are lacking. Results In this paper we formalize these procedures and develop algorithms to solve the relevant problems. In particular, we introduce a new algorithm that solves a "subcoloring" problem to express the difference between a taxonomy and a phylogeny at a given rank. This algorithm improves upon the current best algorithm in terms of asymptotic complexity for the parameter regime of interest; we also describe a branch-and-bound algorithm that saves orders of magnitude in computation on real data sets. We also develop a formalism and an algorithm for rooting phylogenetic trees according to a taxonomy. Conclusions The algorithms in this paper, and the associated freely-available software, will help biologists better use and understand taxonomically labeled phylogenetic trees.

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

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

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

    Directory of Open Access Journals (Sweden)

    Charles A Price

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

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

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2004-01-01

    -ring is designed connecting the metro-rings, minimizing fixed link establishment costs of the federal-ring. A branch-and-price algorithm is presented for the design of the bottom layer and it is suggested that existing methods are used for the design of the federal-ring. Computational results are given...

  11. Markov branching diffusions: martingales, Girsanov type theorems and applications to the long term behaviour

    NARCIS (Netherlands)

    Engländer, J.; Kyprianou, A.E.

    2001-01-01

    Consider a spatial branching particle process where the underlying motion is a conservative diffusion on D C Rd corresponding to the elliptic op- erator L on D, and the branching is strictly binary (dyadic), with spatially varying rate ß(x) => 0 (and ß <> 0) which is assumed to be bounded

  12. Bounded Densities and Their Derivatives

    DEFF Research Database (Denmark)

    Kozine, Igor; Krymsky, V.

    2009-01-01

    This paper describes how one can compute interval-valued statistical measures given limited information about the underlying distribution. The particular focus is on a bounded derivative of a probability density function and its combination with other available statistical evidence for computing ...... quantities of interest. To be able to utilise the evidence about the derivative it is suggested to adapt the ‘conventional’ problem statement to variational calculus and the way to do so is demonstrated. A number of examples are given throughout the paper....

  13. 78 FR 18326 - Agency Information Collection Activities; Comment Request; Upward Bound and Upward Bound Math...

    Science.gov (United States)

    2013-03-26

    ...; Comment Request; Upward Bound and Upward Bound Math Science Annual Performance Report AGENCY: The Office... considered public records. Title of Collection: Upward Bound and Upward Bound Math Science Annual Performance...) and Upward Bound Math and Science (UBMS) Programs. The Department is requesting a new APR because of...

  14. Perceptron Mistake Bounds

    OpenAIRE

    Mohri, Mehryar; Rostamizadeh, Afshin

    2013-01-01

    We present a brief survey of existing mistake bounds and introduce novel bounds for the Perceptron or the kernel Perceptron algorithm. Our novel bounds generalize beyond standard margin-loss type bounds, allow for any convex and Lipschitz loss function, and admit a very simple proof.

  15. Sharp Bounds by Probability-Generating Functions and Variable Drift

    DEFF Research Database (Denmark)

    Doerr, Benjamin; Fouz, Mahmoud; Witt, Carsten

    2011-01-01

    We introduce to the runtime analysis of evolutionary algorithms two powerful techniques: probability-generating functions and variable drift analysis. They are shown to provide a clean framework for proving sharp upper and lower bounds. As an application, we improve the results by Doerr et al....... (GECCO 2010) in several respects. First, the upper bound on the expected running time of the most successful quasirandom evolutionary algorithm for the OneMax function is improved from 1.28nln n to 0.982nlnn, which breaks the barrier of nln n posed by coupon-collector processes. Compared to the classical...

  16. The algebras of bounded and essentially bounded Lebesgue measurable functions

    Directory of Open Access Journals (Sweden)

    Mortini Raymond

    2017-04-01

    Full Text Available Let X be a set in ℝn with positive Lebesgue measure. It is well known that the spectrum of the algebra L∞(X of (equivalence classes of essentially bounded, complex-valued, measurable functions on X is an extremely disconnected compact Hausdorff space.We show, by elementary methods, that the spectrum M of the algebra ℒb(X, ℂ of all bounded measurable functions on X is not extremely disconnected, though totally disconnected. Let ∆ = { δx : x ∈ X} be the set of point evaluations and let g be the Gelfand topology on M. Then (∆, g is homeomorphic to (X, Τdis,where Tdis is the discrete topology. Moreover, ∆ is a dense subset of the spectrum M of ℒb(X, ℂ. Finally, the hull h(I, (which is homeomorphic to M(L∞(X, of the ideal of all functions in ℒb(X, ℂ vanishing almost everywhere on X is a nowhere dense and extremely disconnected subset of the Corona M \\ ∆ of ℒb(X, ℂ.

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

  18. Prognosis assessment of persistent left bundle branch block after TAVI by an electrophysiological and remote monitoring risk-adapted algorithm: rationale and design of the multicentre LBBB-TAVI Study.

    Science.gov (United States)

    Massoullié, Grégoire; Bordachar, Pierre; Irles, Didier; Caussin, Christophe; Da Costa, Antoine; Defaye, Pascal; Jean, Frédéric; Mechulan, Alexis; Mondoly, Pierre; Souteyrand, Géraud; Pereira, Bruno; Ploux, Sylvain; Eschalier, Romain

    2016-10-26

    Percutaneous aortic valve replacement (transcatheter aortic valve implantation (TAVI)) notably increases the likelihood of the appearance of a complete left bundle branch block (LBBB) by direct lesion of the LBB of His. This block can lead to high-grade atrioventricular conduction disturbances responsible for a poorer prognosis. The management of this complication remains controversial. The screening of LBBB after TAVI persisting for more than 24 hours will be conducted by surface ECG. Stratification will be performed by post-TAVI intracardiac electrophysiological study. Patients at high risk of conduction disturbances (≥70 ms His-ventricle interval (HV) or presence of infra-Hisian block) will be implanted with a pacemaker enabling the recording of disturbance episodes. Those at lower risk (HV algorithm based on electrophysiological study and remote monitoring of CIEDs in the prediction of high-grade conduction disturbances in patients with LBBB after TAVI. The primary end point is to compare the incidence (rate and time to onset) of high-grade conduction disturbances in patients with LBBB after TAVI between the two groups at 12 months. Given the proportion of high-grade conduction disturbances (20-40%), a sample of 200 subjects will allow a margin of error of 6-7%. The LBBB-TAVI Study has been in an active recruiting phase since September 2015 (21 patients already included). Local ethics committee authorisation was obtained in May 2015. We will publish findings from this study in a peer-reviewed scientific journal and present results at national and international conferences. NCT02482844; Pre-results. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/.

  19. An Algorithm for the Weighted Earliness-Tardiness Unconstrained Project Scheduling Problem

    Science.gov (United States)

    Afshar Nadjafi, Behrouz; Shadrokh, Shahram

    This research considers a project scheduling problem with the object of minimizing weighted earliness-tardiness penalty costs, taking into account a deadline for the project and precedence relations among the activities. An exact recursive method has been proposed for solving the basic form of this problem. We present a new depth-first branch and bound algorithm for extended form of the problem, which time value of money is taken into account by discounting the cash flows. The algorithm is extended with two bounding rules in order to reduce the size of the branch and bound tree. Finally, some test problems are solved and computational results are reported.

  20. The bounded model property via step algebras and step frames

    NARCIS (Netherlands)

    Bezhanishvili, N.; Ghilardi, S.

    2014-01-01

    The paper introduces semantic and algorithmic methods for establishing a variant of the analytic subformula property (called ‘the bounded proof property’, bpp) for modal propositional logics. The bpp is much weaker property than full cut-elimination, but it is nevertheless sufficient for

  1. Fuzzy upper bounds and their applications

    Energy Technology Data Exchange (ETDEWEB)

    Soleimani-damaneh, M. [Department of Mathematics, Faculty of Mathematical Science and Computer Engineering, Teacher Training University, 599 Taleghani Avenue, Tehran 15618 (Iran, Islamic Republic of)], E-mail: soleimani_d@yahoo.com

    2008-04-15

    This paper considers the concept of fuzzy upper bounds and provides some relevant applications. Considering a fuzzy DEA model, the existence of a fuzzy upper bound for the objective function of the model is shown and an effective approach to solve that model is introduced. Some dual interpretations are provided, which are useful for practical purposes. Applications of the concept of fuzzy upper bounds in two physical problems are pointed out.

  2. Pen Branch Delta and Savannah River Swamp Hydraulic Model

    International Nuclear Information System (INIS)

    Chen, K.F.

    1999-01-01

    The proposed Savannah River Site (SRS) Wetlands Restoration Project area is located in Barnwell County, South Carolina on the southwestern boundary of the SRS Reservation. The swamp covers about 40.5 km2 and is bounded to the west and south by the Savannah River and to the north and east by low bluffs at the edge of the Savannah River floodplain. Water levels within the swamp are determined by stage along the Savannah River, local drainage, groundwater seepage, and inflows from four tributaries, Beaver Dam Creek, Fourmile Branch, Pen Branch, and Steel Creek. Historic discharges of heated process water into these tributaries scoured the streambed, created deltas in the adjacent wetland, and killed native vegetation in the vicinity of the delta deposits. Future releases from these tributaries will be substantially smaller and closer to ambient temperatures. One component of the proposed restoration project will be to reestablish indigenous wetland vegetation on the Pen Branch delta that covers about 1.0 km2. Long-term predictions of water levels within the swamp are required to determine the characteristics of suitable plants. The objective of the study was to predict water levels at various locations within the proposed SRS Wetlands Restoration Project area for a range of Savannah River flows and regulated releases from Pen Branch. TABS-MD, a United States Army Corps of Engineer developed two-dimensional finite element open channel hydraulic computer code, was used to model the SRS swamp area for various flow conditions

  3. Algorithmic test design using classical item parameters

    NARCIS (Netherlands)

    van der Linden, Willem J.; Adema, Jos J.

    Two optimalization models for the construction of tests with a maximal value of coefficient alpha are given. Both models have a linear form and can be solved by using a branch-and-bound algorithm. The first model assumes an item bank calibrated under the Rasch model and can be used, for instance,

  4. Stacked spheres and lower bound theorem

    Indian Academy of Sciences (India)

    BASUDEB DATTA

    2011-11-20

    Nov 20, 2011 ... Preliminaries. Lower bound theorem. On going work. Definitions. An n-simplex is a convex hull of n + 1 affinely independent points. (called vertices) in some Euclidean space R. N . Stacked spheres and lower bound theorem. Basudeb Datta. Indian Institute of Science. 2 / 27 ...

  5. A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets

    DEFF Research Database (Denmark)

    David, Alexandre; Jacobsen, Lasse; Jacobsen, Morten

    2012-01-01

    Timed-arc Petri nets (TAPN) are a well-known time extension of thePetri net model and several translations to networks of timedautomata have been proposed for this model.We present a direct, DBM-basedalgorithm for forward reachability analysis of bounded TAPNs extended with transport arcs...

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

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

  8. Covariant entropy bound and loop quantum cosmology

    International Nuclear Information System (INIS)

    Ashtekar, Abhay; Wilson-Ewing, Edward

    2008-01-01

    We examine Bousso's covariant entropy bound conjecture in the context of radiation filled, spatially flat, Friedmann-Robertson-Walker models. The bound is violated near the big bang. However, the hope has been that quantum gravity effects would intervene and protect it. Loop quantum cosmology provides a near ideal setting for investigating this issue. For, on the one hand, quantum geometry effects resolve the singularity and, on the other hand, the wave function is sharply peaked at a quantum corrected but smooth geometry, which can supply the structure needed to test the bound. We find that the bound is respected. We suggest that the bound need not be an essential ingredient for a quantum gravity theory but may emerge from it under suitable circumstances.

  9. Tillering and panicle branching genes in rice.

    Science.gov (United States)

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

    2014-03-01

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

  10. A subexponential lower bound for the Random Facet algorithm for Parity Games

    DEFF Research Database (Denmark)

    Friedmann, Oliver; Hansen, Thomas Dueholm; Zwick, Uri

    2011-01-01

    Parity Games form an intriguing family of infinite duration games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of Deterministic Mean Payoff Games, which in turn is a very natural subclass...... of turn-based Stochastic Mean Payoff Games. It is a major open problem whether these game families can be solved in polynomial time. The currently theoretically fastest algorithms for the solution of all these games are adaptations of the randomized algorithms of Kalai and of Matouˇsek, Sharir and Welzl...... for LP-type problems, an abstract generalization of linear programming. The expected running time of both algorithms is subexponential in the size of the game, i.e., 2O(√n log n), where n is the number of vertices in the game. We focus in this paper on the algorithm of Matouˇsek, Sharir and Welzl...

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

  12. The bound state problem and quark confinement

    International Nuclear Information System (INIS)

    Chaichian, M.; Demichev, A.P.; Nelipa, N.F.

    1980-01-01

    A quantum field-theoretic model in which quark is confined is considered. System of equations for the Green functions of colour singlet and octet bound states is obtained. The method is based on the nonperturbative Schwinger-Dyson equations with the use of Slavnov-Taylor identities. It is shown that in the framework of the model if there exist singlet, then also exist octet bound states of the quark-antiquark system. Thus in general, confinement of free quarks does not mean absence of their coloured bound states. (author)

  13. Origin of buds, branches, and sprouts

    Science.gov (United States)

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

  14. Lower Bounds and Semi On-line Multiprocessor Scheduling

    Directory of Open Access Journals (Sweden)

    T.C. Edwin Cheng

    2003-10-01

    Full Text Available We are given a set of identical machines and a sequence of jobs from which we know the sum of the job weights in advance. The jobs have to be assigned on-line to one of the machines and the objective is to minimize the makespan. An algorithm with performance ratio 1.6 and a lower bound of 1.5 is presented. This improves recent results by Azar and Regev who published an algorithm with performance ratio 1.625 for the less general problem that the optimal makespan is known in advance.

  15. Graphs and matroids weighted in a bounded incline algebra.

    Science.gov (United States)

    Lu, Ling-Xia; Zhang, Bei

    2014-01-01

    Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most reliable path problem. The solutions for LPP and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied.

  16. Circulation of Railway Rolling Stock: A Branch-and-Price Approach

    NARCIS (Netherlands)

    M. Peeters (Marc); L.G. Kroon (Leo)

    2003-01-01

    textabstractWe describe an algorithmic approach to determine an efficient railway rolling stock circulation on a single line or on a set of interacting lines. Given the timetable and the passengers? seat demand, we develop a branch-and-price algorithm that results in an allocation of rolling

  17. Error Bounds: Necessary and Sufficient Conditions

    Czech Academy of Sciences Publication Activity Database

    Outrata, Jiří; Kruger, A.Y.; Fabian, Marián; Henrion, R.

    2010-01-01

    Roč. 18, č. 2 (2010), s. 121-149 ISSN 1877-0533 R&D Projects: GA AV ČR IAA100750802 Institutional research plan: CEZ:AV0Z10750506; CEZ:AV0Z10190503 Keywords : Error bounds * Calmness * Subdifferential * Slope Subject RIV: BA - General Mathematics Impact factor: 0.333, year: 2010 http://library.utia.cas.cz/separaty/2010/MTR/outrata-error bounds necessary and sufficient conditions.pdf

  18. An efficient algorithm for computing fixed length attractors based on bounded model checking in synchronous Boolean networks with biochemical applications.

    Science.gov (United States)

    Li, X Y; Yang, G W; Zheng, D S; Guo, W S; Hung, W N N

    2015-04-28

    Genetic regulatory networks are the key to understanding biochemical systems. One condition of the genetic regulatory network under different living environments can be modeled as a synchronous Boolean network. The attractors of these Boolean networks will help biologists to identify determinant and stable factors. Existing methods identify attractors based on a random initial state or the entire state simultaneously. They cannot identify the fixed length attractors directly. The complexity of including time increases exponentially with respect to the attractor number and length of attractors. This study used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose a new algorithm for efficiently computing the fixed length attractors, which is more suitable for large Boolean networks and numerous attractors' networks. After comparison using the tool BooleNet, empirical experiments involving biochemical systems demonstrated the feasibility and efficiency of our approach.

  19. Behavioral Consistency of C and Verilog Programs Using Bounded Model Checking

    National Research Council Canada - National Science Library

    Clarke, Edmund; Kroening, Daniel; Yorav, Karen

    2003-01-01

    .... We describe experimental results on various reactive present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking...

  20. 3rd Workshop on Branching Processes and their Applications

    CERN Document Server

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

    2016-01-01

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

  1. A Scheduling Algorithm for Time Bounded Delivery of Packets on the Internet

    NARCIS (Netherlands)

    I. Vaishnavi (Ishan)

    2008-01-01

    htmlabstractThis thesis aims to provide a better scheduling algorithm for Real-Time delivery of packets. A number of emerging applications such as VoIP, Tele-immersive environments, distributed media viewing and distributed gaming require real-time delivery of packets. Currently the scheduling

  2. Bent and branched chains of nanoresonators

    Science.gov (United States)

    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.

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

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

  5. A Global Optimization Algorithm for Sum of Linear Ratios Problem

    OpenAIRE

    Yuelin Gao; Siqiao Jin

    2013-01-01

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

  6. Energy conditions bounds and supernovae data

    International Nuclear Information System (INIS)

    Lima, M.P.; Vitenti, S.D.P.; Reboucas, M.J.

    2008-01-01

    The energy conditions play an important role in the description of some important properties of the Universe, including the current accelerating expansion phase and the possible recent phase of super-acceleration. In a recent work we have provided a detailed study of the energy conditions for the recent past by deriving bounds from energy conditions and by making the confrontation of the bounds with supernovae data. Here, we extend and update these results in two different ways. First, by carrying out a new statistical analysis for q(z) estimates needed for the confrontation between the bounds and supernovae data. Second, by providing a new picture of the energy conditions fulfillment and violation in the light of the recently compiled Union set of 307 type Ia supernovae and by using two different statistical approaches

  7. Operator continued fraction and bound states

    International Nuclear Information System (INIS)

    Pindor, M.

    1984-01-01

    The effective Hamiltonian of the model space perturbation theory (multilevel Rayleigh-Schroedinger theory) is expressed as an operator continued fraction. In the case of a nondegenerate model space the expression becomes an operator branched continued fraction. The method is applied to the harmonic oscillator with the kinetic energy treated as the perturbation and to the anharmonic oscillator

  8. A Global Optimization Algorithm for Sum of Linear Ratios Problem

    Directory of Open Access Journals (Sweden)

    Yuelin Gao

    2013-01-01

    Full Text Available We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the convergence of the algorithm is proved. Numerical experiments are reported to show the effectiveness of the proposed algorithm.

  9. The DMM Bound

    DEFF Research Database (Denmark)

    Emiris, Ioannis Z.; Mourrain, Bernard; Tsigaridas, Elias

    2010-01-01

    ) resultant by means of mixed volume, as well as recent advances on aggregate root bounds for univariate polynomials, and are applicable to arbitrary positive dimensional systems. We improve upon Canny's gap theorem [7] by a factor of O(dn-1), where d bounds the degree of the polynomials, and n is the number...... bound on the number of steps that subdivision-based algorithms perform in order to isolate all real roots of a polynomial system. This leads to the first complexity bound of Milne's algorithm [22] in 2D....

  10. [Membrane-bound cytokine and feedforward regulation].

    Science.gov (United States)

    Wu, Ke-Fu; Zheng, Guo-Guang; Ma, Xiao-Tong; Song, Yu-Hua

    2013-10-01

    Feedback and feedforward widely exist in life system, both of them are the basic processes of control system. While the concept of feedback has been widely used in life science, feedforward regulation was systematically studied in neurophysiology, awaiting further evidence and mechanism in molecular biology and cell biology. The authors put forward a hypothesis about the feedforward regulation of membrane bound macrophage colony stimulation factor (mM-CSF) on the basis of their previous work. This hypothesis might provide a new direction for the study on the biological effects of mM-CSF on leukemia and solid tumors, and contribute to the study on other membrane bound cytokines.

  11. Yukawa Bound States and Their LHC Phenomenology

    Directory of Open Access Journals (Sweden)

    Enkhbat Tsedenbaljir

    2013-01-01

    Full Text Available We present the current status on the possible bound states of extra generation quarks. These include phenomenology and search strategy at the LHC. If chiral fourth-generation quarks do exist their strong Yukawa couplings, implied by current experimental lower bound on their masses, may lead to formation of bound states. Due to nearly degenerate 4G masses suggested by Precision Electroweak Test one can employ “heavy isospin” symmetry to classify possible spectrum. Among these states, the color-octet isosinglet vector ω 8 is the easiest to be produced at the LHC. The discovery potential and corresponding decay channels are covered in this paper. With possible light Higgs at ~125 GeV two-Higgs doublet version is briefly discussed.

  12. Career Development and Personal Functioning Differences between Work-Bound and Non-Work Bound Students

    Science.gov (United States)

    Creed, Peter A.; Patton, Wendy; Hood, Michelle

    2010-01-01

    We surveyed 506 Australian high school students on career development (exploration, planning, job-knowledge, decision-making, indecision), personal functioning (well-being, self-esteem, life satisfaction, school satisfaction) and control variables (parent education, school achievement), and tested differences among work-bound, college-bound and…

  13. Quantum Kolmogorov complexity and bounded quantum memory

    International Nuclear Information System (INIS)

    Miyadera, Takayuki

    2011-01-01

    The effect of bounded quantum memory in a primitive information protocol has been examined using the quantum Kolmogorov complexity as a measure of information. We employed a toy two-party protocol in which Bob, by using a bounded quantum memory and an unbounded classical memory, estimates a message that was encoded in qubits by Alice in one of the bases X or Z. Our theorem gave a nontrivial effect of the memory boundedness. In addition, a generalization of the uncertainty principle in the presence of quantum memory has been obtained.

  14. Pluto's Paleoglaciation: Processes and Bounds.

    Science.gov (United States)

    Umurhan, O. M.; Howard, A. D.; White, O. L.; Moore, J. M.; Grundy, W. M.; Schenk, P.; Beyer, R. A.; McKinnon, W. B.; Singer, K. N.; Lauer, T.; Cheng, A. F.; Stern, A.; Weaver, H. A., Jr.; Young, L. A.; Ennico Smith, K.; Olkin, C.

    2017-12-01

    New Horizons imaging of Pluto's surface shows eroded landscapes reminiscent of assorted glaciated terrains found on the Earth such as alpine valleys, dendritic networks and others. For example, LORRI imaging of fluted craters show radially oriented ridging which also resembles Pluto's washboard terrain. Digital elevation modeling indicates that these down-gradient oriented ridges are about 3-4 km spaced apart with depths ranging from 0.2-0.5 km. Present day glaciation on Pluto is characterized by moving N2 ice blocks presumably riding over a H2O ice bedrock substrate. Assuming Pluto's ancient surface was sculpted by N2 glaciation, what remains a mystery is the specific nature of the glacial erosion mechanism(s) responsible for the observed features. To better resolve this puzzle, we perform landform evolution modeling of several glacial erosion processes known from terrestrial H2O ice glaciation studies. These terrestrial processes, which depend upon whether or not the glacier's base is wet or dry, include quarrying/plucking and fluvial erosion. We also consider new erosional processes (to be described in this presentation) which are unique to the highly insulating character of solid N2 including both phase change induced hydrofracture and geothermally driven basal melt. Until improvements in our knowledge of solid N2's rheology are made available (including its mechanical behavior as a binary/trinary mixture of CH4 and CO), it is difficult to assess with high precision which of the aforementioned erosion mechanisms are responsible for the observed surface etchings. Nevertheless, we consider a model crater surface and examine its erosional development due to flowing N2 glacial ice as built up over time according to N2 deposition rates based on GCM modeling of Pluto's ancient atmosphere. For given erosional mechanism our aim is to determine the permissible ranges of model input parameters (e.g., ice strength, flow rates, grain sizes, quarrying rates, etc.) that best

  15. Scaling Limits and Generic Bounds for Exploration Processes

    Science.gov (United States)

    Bermolen, Paola; Jonckheere, Matthieu; Sanders, Jaron

    2017-12-01

    We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its neighboring nodes become blocked. Given an initial number of vertices N growing to infinity, we study statistical properties of the proportion of explored (active or blocked) nodes in time using scaling limits. We obtain exact limits for homogeneous graphs and prove an explicit central limit theorem for the final proportion of active nodes, known as the jamming constant, through a diffusion approximation for the exploration process which can be described as a unidimensional process. We then focus on bounding the trajectories of such exploration processes on random geometric graphs, i.e., random sequential adsorption. As opposed to exploration processes on homogeneous random graphs, these do not allow for such a dimensional reduction. Instead we derive a fundamental relationship between the number of explored nodes and the discovered volume in the spatial process, and we obtain generic bounds for the fluid limit and jamming constant: bounds that are independent of the dimension of space and the detailed shape of the volume associated to the discovered node. Lastly, using coupling techinques, we give trajectorial interpretations of the generic bounds.

  16. On Leak Localization in the Main Branched and Simple Inclined Gas Pipelines

    OpenAIRE

    T. Davitashvili; G. Gubelidze

    2013-01-01

    In this paper two mathematical models for definition of gas accidental escape localization in the gas pipelines are suggested. The first model was created for leak localization in the horizontal branched pipeline and second one for leak detection in inclined section of the main gas pipeline. The algorithm of leak localization in the branched pipeline did not demand on knowledge of corresponding initial hydraulic parameters at entrance and ending points of each sections of pipeline. For detect...

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

  18. Book Selection, Collection Development, and Bounded Rationality.

    Science.gov (United States)

    Schwartz, Charles A.

    1989-01-01

    Reviews previously proposed schemes of classical rationality in book selection, describes new approaches to rational choice behavior, and presents a model of book selection based on bounded rationality in a garbage can decision process. The role of tacit knowledge and symbolic content in the selection process are also discussed. (102 references)…

  19. Monotonicity and bounds on Bessel functions

    Directory of Open Access Journals (Sweden)

    Larry Landau

    2000-07-01

    Full Text Available survey my recent results on monotonicity with respect to order of general Bessel functions, which follow from a new identity and lead to best possible uniform bounds. Application may be made to the "spreading of the wave packet" for a free quantum particle on a lattice and to estimates for perturbative expansions.

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

    Science.gov (United States)

    2010-07-01

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

  1. Efficiency gains, bounds, and risk in finance

    NARCIS (Netherlands)

    Sarisoy, Cisil

    2015-01-01

    This thesis consists of three chapters. The first chapter analyzes efficiency gains in the estimation of expected returns based on asset pricing models and examines the economic implications of such gains in portfolio allocation exercises. The second chapter provides nonparametric efficiency bounds

  2. Capacity Bounds and Mapping Design for Binary Symmetric Relay Channels

    Directory of Open Access Journals (Sweden)

    Majid Nasiri Khormuji

    2012-12-01

    Full Text Available Capacity bounds for a three-node binary symmetric relay channel with orthogonal components at the destination are studied. The cut-set upper bound and the rates achievable using decode-and-forward (DF, partial DF and compress-and-forward (CF relaying are first evaluated. Then relaying strategies with finite memory-length are considered. An efficient algorithm for optimizing the relay functions is presented. The Boolean Fourier transform is then employed to unveil the structure of the optimized mappings. Interestingly, the optimized relay functions exhibit a simple structure. Numerical results illustrate that the rates achieved using the optimized low-dimensional functions are either comparable to those achieved by CF or superior to those achieved by DF relaying. In particular, the optimized low-dimensional relaying scheme can improve on DF relaying when the quality of the source-relay link is worse than or comparable to that of other links.

  3. Trial and Error: A new Approach to Space-Bounded Learning

    DEFF Research Database (Denmark)

    Ameur, F.; Fischer, Paul; Hoeffgen, H.-U.

    1996-01-01

    A pac-learning algorithm is d-space bounded, if it stores at most d examples from the sample at any time. We characterize the d-space learnable concept classes. For this purpose we introduce the compression parameter of a concept class 𝒞 and design our trial and error learning algorithm. We ...

  4. Quantum Computation and Algorithms

    International Nuclear Information System (INIS)

    Biham, O.; Biron, D.; Biham, E.; Grassi, M.; Lidar, D.A.

    1999-01-01

    It is now firmly established that quantum algorithms provide a substantial speedup over classical algorithms for a variety of problems, including the factorization of large numbers and the search for a marked element in an unsorted database. In this talk I will review the principles of quantum algorithms, the basic quantum gates and their operation. The combination of superposition and interference, that makes these algorithms efficient, will be discussed. In particular, Grover's search algorithm will be presented as an example. I will show that the time evolution of the amplitudes in Grover's algorithm can be found exactly using recursion equations, for any initial amplitude distribution

  5. Sharp Bounds for Symmetric and Asymmetric Diophantine Approximation

    Institute of Scientific and Technical Information of China (English)

    Cornelis KRAAIKAMP; Ionica SMEETS

    2011-01-01

    In 2004,Tong found bounds for the approximation quality of a regular continued fraction convergent to a rational number,expressed in bounds for both the previous and next approximation.The authors sharpen his results with a geometric method and give both sharp upper and lower bounds.The asymptotic frequencies that these bounds occur are also calculated.

  6. Branching habit and the allocation of reproductive resources in conifers.

    Science.gov (United States)

    Leslie, Andrew B

    2012-09-01

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

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

  8. Heterogeneity, Bounded Rationality and Market Dysfunctionality

    OpenAIRE

    Xue-Zhong He; Lei Shi

    2008-01-01

    As the main building blocks of the modern finance theory, homogeneity and rational expectation have faced difficulty in explaining many market anomalies, stylized factors, and market inefficiency in empirical studies. As a result, heterogeneity and bounded rationality have been used as an alterative paradigm of asset price dynamics and this paradigm has been widely recognized recently in both academic and financial market practitioners. Within the framework of Chiarella, Dieci and He (2006a, ...

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

  10. Branching miter joints : principles and artwork

    NARCIS (Netherlands)

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

    2010-01-01

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

  11. Optima and bounds for irreversible thermodynamic processes

    International Nuclear Information System (INIS)

    Hoffmann, K.H.

    1990-01-01

    In this paper bounds and optima for irreversible thermodynamic processes and their application in different fields are discussed. The tools of finite time thermodynamics are presented and especially optimal control theory is introduced. These methods are applied to heat engines, including models of the Diesel engine and a light-driven engine. Further bounds for irreversible processes are introduced, discussing work deficiency and its relation to thermodynamic length. Moreover the problem of dissipation in systems composed of several subsystems is studied. Finally, the methods of finite time thermodynamics are applied to thermodynamic processes described on a more microscopic level. The process used as an example is simulated annealing. It is shown how optimal control theory is applied to find the optimal cooling schedule for this important stochastic optimization method

  12. Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm

    DEFF Research Database (Denmark)

    Justesen, Jørn

    2007-01-01

    By introducing a few simplifying assumptions we derive a simple condition for successful decoding using the Koetter-Vardy algorithm for soft-decision decoding of Reed-Solomon codes. We show that the algorithm has a significant advantage over hard decision decoding when the code rate is low, when ...

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

    Science.gov (United States)

    Lyons, Erwin J.

    1957-01-01

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

  14. Higher order branching of periodic orbits from polynomial isochrones

    Directory of Open Access Journals (Sweden)

    B. Toni

    1999-09-01

    Full Text Available We discuss the higher order local bifurcations of limit cycles from polynomial isochrones (linearizable centers when the linearizing transformation is explicitly known and yields a polynomial perturbation one-form. Using a method based on the relative cohomology decomposition of polynomial one-forms complemented with a step reduction process, we give an explicit formula for the overall upper bound of branch points of limit cycles in an arbitrary $n$ degree polynomial perturbation of the linear isochrone, and provide an algorithmic procedure to compute the upper bound at successive orders. We derive a complete analysis of the nonlinear cubic Hamiltonian isochrone and show that at most nine branch points of limit cycles can bifurcate in a cubic polynomial perturbation. Moreover, perturbations with exactly two, three, four, six, and nine local families of limit cycles may be constructed.

  15. Multipartite secret key distillation and bound entanglement

    International Nuclear Information System (INIS)

    Augusiak, Remigiusz; Horodecki, Pawel

    2009-01-01

    Recently it has been shown that quantum cryptography beyond pure entanglement distillation is possible and a paradigm for the associated protocols has been established. Here we systematically generalize the whole paradigm to the multipartite scenario. We provide constructions of new classes of multipartite bound entangled states, i.e., those with underlying twisted Greenberger-Horne-Zeilinger (GHZ) structure and nonzero distillable cryptographic key. We quantitatively estimate the key from below with the help of the privacy squeezing technique.

  16. Bounded excursion stable gravastars and black holes

    Energy Technology Data Exchange (ETDEWEB)

    Rocha, P [Instituto de Fisica, Universidade Federal Fluminense, Avenida Litoranea, s/n, Boa Viagem 24210-340, Niteroi, RJ (Brazil); Miguelote, A Y; Chan, R [Coordenacao de Astronomia e Astrofisica, Observatorio Nacional, Rua General Jose Cristino, 77, Sao Cristovao 20921-400, Rio de Janeiro, RJ (Brazil); Da Silva, M F; Wang, Anzhong [Departamento de Fisica Teorica, Instituto de Fisica, Universidade do Estado do Rio de Janeiro, Rua Sao Francisco Xavier 524, Maracana 20550-900, Rio de Janeiro-RJ (Brazil); Santos, N O, E-mail: pedrosennarocha@gmail.com, E-mail: yasuda@on.br, E-mail: chan@on.br, E-mail: mfasnic@gmail.com, E-mail: N.O.Santos@qmul.ac.uk, E-mail: anzhong_wang@baylor.edu [LERMA/CNRS-FRE 2460, Universite Pierre et Marie Curie, ERGA, Boite 142, 4 Place Jussieu, 75005 Paris Cedex 05 (France)

    2008-06-15

    Dynamical models of prototype gravastars were constructed in order to study their stability. The models are the Visser-Wiltshire three-layer gravastars, in which an infinitely thin spherical shell of stiff fluid divides the whole spacetime into two regions, where the internal region is de Sitter, and the external one is Schwarzschild. It is found that in some cases the models represent the 'bounded excursion' stable gravastars, where the thin shell is oscillating between two finite radii, while in other cases they collapse until the formation of black holes occurs. In the phase space, the region for the 'bounded excursion' gravastars is very small in comparison to that of black holes, but not empty. Therefore, although the possibility of the existence of gravastars cannot be excluded from such dynamical models, our results indicate that, even if gravastars do indeed exist, that does not exclude the possibility of the existence of black holes.

  17. Command and Data Handling Branch Internship

    Science.gov (United States)

    Billings, Rachel Mae

    2016-01-01

    Modular Integrated Stackable Layers (MISL) is a computer system designed for simple, fast, and cost effective flexible reconfiguration in space environments such as the ISS and Orion projects for various uses. Existing applications include wireless and wired communications, data acquisition and instrumentation, and camera systems, and potential applications include bus protocol converters and subsystem control. MISL is based on Texas Instruments (TI)' MSP430 16-bit ultra-low-power microcontroller device. The purpose of my project was to integrate the MISL system with a liquid crystal display (LCD) touchscreen. The LCD, manufactured by Crystalfontz and part number CFAF320240F-035T-TS, is a 320 by 240 RGB resistive color screen including an optional carrier board. The vast majority of the project was done with Altium Designer, a tool for printed circuit board (PCB) schematic capture, 3D design, and FPGA (Field Programmable Gate Array) development. The new PCB was to allow the LCD to directly stack to the rest of MISL. Research was done with datasheets for the TI microcontroller and touchscreen display in order to meet desired hardware specifications. Documentation on prior MISL projects was also utilized. The initial step was to create a schematic for the LCD, power bus, and data bus connections between components. A layout was then designed with the required physical dimensions, routed traces and vias, power and ground planes, layer stacks, and other specified design rules such as plane clearance and hole size. Multiple consultation sessions were held with Hester Yim, the technical discipline lead for the Command and Data Handling Branch, and Christy Herring, the lead PCB layout designer in the Electronic Design and Manufacturing Branch in order to ensure proper configuration. At the moment, the PCB is awaiting revision by the latter-mentioned branch. Afterwards, the board will begin to undergo the manufacturing and testing process. Throughout the internship at

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

  19. Convectons in periodic and bounded domains

    International Nuclear Information System (INIS)

    Mercader, Isabel; Batiste, Oriol; Alonso, Arantxa; Knobloch, Edgar

    2010-01-01

    Numerical continuation is used to compute spatially localized convection in a binary fluid with no-slip laterally insulating boundary conditions and the results are compared with the corresponding ones for periodic boundary conditions (PBC). The change in the boundary conditions produces a dramatic change in the snaking bifurcation diagram that describes the organization of localized states with PBC: the snaking branches turn continuously into a large amplitude state that resembles periodic convection with defects at the sidewalls. Odd parity convectons are more affected by the boundary conditions since the sidewalls suppress the horizontal pumping action that accompanies these states in spatially periodic domains.

  20. Convectons in periodic and bounded domains

    Energy Technology Data Exchange (ETDEWEB)

    Mercader, Isabel; Batiste, Oriol; Alonso, Arantxa [Departament de Fisica Aplicada, Universitat Politecnica de Catalunya, Barcelona (Spain); Knobloch, Edgar [Department of Physics, University of California, Berkeley, CA 94720 (United States)

    2010-04-15

    Numerical continuation is used to compute spatially localized convection in a binary fluid with no-slip laterally insulating boundary conditions and the results are compared with the corresponding ones for periodic boundary conditions (PBC). The change in the boundary conditions produces a dramatic change in the snaking bifurcation diagram that describes the organization of localized states with PBC: the snaking branches turn continuously into a large amplitude state that resembles periodic convection with defects at the sidewalls. Odd parity convectons are more affected by the boundary conditions since the sidewalls suppress the horizontal pumping action that accompanies these states in spatially periodic domains.

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

    NARCIS (Netherlands)

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

    2008-01-01

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

  2. Properties of Confined Star-Branched and Linear Chains. A Monte Carlo Simulation Study

    International Nuclear Information System (INIS)

    Romiszowski, P.; Sikorski, A.

    2004-01-01

    A model of linear and star-branched polymer chains confined between two parallel and impenetrable surfaces was built. The polymer chains were restricted to a simple cubic lattice. Two macromolecular architectures of the chain: linear and star branched (consisted of f = 3 branches of equal length) were studied. The excluded volume was the only potential introduced into the model (the athermal system). Monte Carlo simulations were carried out using a sampling algorithm based on chain's local changes of conformation. The simulations were carried out at different confinement conditions: from light to high chain's compression. The scaling of chain's size with the chain length was studied and discussed. The influence of the confinement and the macromolecular architecture on the shape of a chain was studied. The differences in the shape of linear and star-branched chains were pointed out. (author)

  3. Bounded fractional diffusion in geological media: Definition and Lagrangian approximation

    Science.gov (United States)

    Zhang, Yong; Green, Christopher T.; LaBolle, Eric M.; Neupauer, Roseanna M.; Sun, HongGuang

    2016-01-01

    Spatiotemporal Fractional-Derivative Models (FDMs) have been increasingly used to simulate non-Fickian diffusion, but methods have not been available to define boundary conditions for FDMs in bounded domains. This study defines boundary conditions and then develops a Lagrangian solver to approximate bounded, one-dimensional fractional diffusion. Both the zero-value and non-zero-value Dirichlet, Neumann, and mixed Robin boundary conditions are defined, where the sign of Riemann-Liouville fractional derivative (capturing non-zero-value spatial-nonlocal boundary conditions with directional super-diffusion) remains consistent with the sign of the fractional-diffusive flux term in the FDMs. New Lagrangian schemes are then proposed to track solute particles moving in bounded domains, where the solutions are checked against analytical or Eularian solutions available for simplified FDMs. Numerical experiments show that the particle-tracking algorithm for non-Fickian diffusion differs from Fickian diffusion in relocating the particle position around the reflective boundary, likely due to the non-local and non-symmetric fractional diffusion. For a non-zero-value Neumann or Robin boundary, a source cell with a reflective face can be applied to define the release rate of random-walking particles at the specified flux boundary. Mathematical definitions of physically meaningful nonlocal boundaries combined with bounded Lagrangian solvers in this study may provide the only viable techniques at present to quantify the impact of boundaries on anomalous diffusion, expanding the applicability of FDMs from infinite do mains to those with any size and boundary conditions.

  4. Precise Propagation of Upper and Lower Probability Bounds in System P

    OpenAIRE

    Gilio, Angelo

    2000-01-01

    In this paper we consider the inference rules of System P in the framework of coherent imprecise probabilistic assessments. Exploiting our algorithms, we propagate the lower and upper probability bounds associated with the conditional assertions of a given knowledge base, automatically obtaining the precise probability bounds for the derived conclusions of the inference rules. This allows a more flexible and realistic use of System P in default reasoning and provides an exact illustration of ...

  5. Robustness bounds and practical limitations of quantum key distribution

    International Nuclear Information System (INIS)

    Khalique, Aeysha

    2008-01-01

    Quantum information theory is a modern branch of theoretical physics. One of its main goals is to interpret concepts of quantum physics. This leads to a deeper understanding of quantum theory. The most common examples of practical applications of basic quantum theory are quantum computation and quantum cryptography. Quantum cryptography provides secure communication between legitimate users even in the presence of an adversary by making possible the distribution of a secret key. It then allows error correction and privacy amplification, which is elimination of adversary information, through classical communication. In this thesis two important aspects of quantum key distribution are covered, namely robustness bounds with respect to provable entanglement for ideal protocols and practical quantum key distribution using two-way classical communication. In part one of the thesis, ideal quantum key distribution protocols and their robustness in terms of provable entanglement are discussed. The robustness bounds are proved for most general coherent attacks. These bounds for provable entanglement are already known to be 25% for the four-state protocol and 33% for the six-state protocol. We anticipate to provide a region in which the legitimate users share entanglement. This region is large for the four-state protocol and is reduced to a smaller region for the six-state protocol because of additional constraint on it. We also investigate the information cost which the adversary has to pay in order to reach these bounds. In part two we adopt a more practical approach. We investigate the limitation on distance of secure communication because of practical restrictions. In particular we investigate the restrictions due to the lack of single photon sources, the lossy channel and faulty detectors. These practical limitations have already been observed using one-way classical communication between legitimate users. It has been observed that it is actually the dark count rate that

  6. A lower bound on deterministic online algorithms for scheduling on related machines without preemption

    Czech Academy of Sciences Publication Activity Database

    Ebenlendr, Tomáš; Sgall, J.

    2015-01-01

    Roč. 56, č. 1 (2015), s. 73-81 ISSN 1432-4350 R&D Projects: GA ČR GBP202/12/G061; GA AV ČR IAA100190902 Institutional support: RVO:67985840 Keywords : online algorithms * scheduling * makespan Subject RIV: IN - Informatics, Computer Science Impact factor: 0.719, year: 2015 http://link.springer.com/article/10.1007%2Fs00224-013-9451-6

  7. Bounded Rationality, Retaliation, and the Spread of Urban Violence

    Science.gov (United States)

    Jacobs, Bruce A.; Wright, Richard

    2010-01-01

    Drawing from in-depth interviews with 52 active street criminals, this article examines the grounded theoretic implications of bounded rationality for retaliatory street violence. The bounds on rationality that this article explores are anger, uncertainty, and time pressure. These bounds create imperfections in the retaliatory decision-making…

  8. Regularization by Functions of Bounded Variation and Applications to Image Enhancement

    International Nuclear Information System (INIS)

    Casas, E.; Kunisch, K.; Pola, C.

    1999-01-01

    Optimization problems regularized by bounded variation seminorms are analyzed. The optimality system is obtained and finite-dimensional approximations of bounded variation function spaces as well as of the optimization problems are studied. It is demonstrated that the choice of the vector norm in the definition of the bounded variation seminorm is of special importance for approximating subspaces consisting of piecewise constant functions. Algorithms based on a primal-dual framework that exploit the structure of these nondifferentiable optimization problems are proposed. Numerical examples are given for denoising of blocky images with very high noise

  9. Hyperquarks and bosonic preon bound states

    International Nuclear Information System (INIS)

    Schmid, Michael L.; Buchmann, Alfons J.

    2009-01-01

    In a model in which leptons, quarks, and the recently introduced hyperquarks are built up from two fundamental spin-(1/2) preons, the standard model weak gauge bosons emerge as preon bound states. In addition, the model predicts a host of new composite gauge bosons, in particular, those responsible for hyperquark and proton decay. Their presence entails a left-right symmetric extension of the standard model weak interactions and a scheme for a partial and grand unification of nongravitational interactions based on, respectively, the effective gauge groups SU(6) P and SU(9) G . This leads to a prediction of the Weinberg angle at low energies in good agreement with experiment. Furthermore, using evolution equations for the effective coupling strengths, we calculate the partial and grand unification scales, the hyperquark mass scale, as well as the mass and decay rate of the lightest hyperhadron.

  10. Algorithms and Their Explanations

    NARCIS (Netherlands)

    Benini, M.; Gobbo, F.; Beckmann, A.; Csuhaj-Varjú, E.; Meer, K.

    2014-01-01

    By analysing the explanation of the classical heapsort algorithm via the method of levels of abstraction mainly due to Floridi, we give a concrete and precise example of how to deal with algorithmic knowledge. To do so, we introduce a concept already implicit in the method, the ‘gradient of

  11. Structure and dynamics of weakly bound complexes

    International Nuclear Information System (INIS)

    Skouteris, D.

    1998-01-01

    The present thesis deals with the spectroscopic and theoretical investigation of weakly bound complexes involving a methane molecule. Studies of these Van der Waals complexes can give valuable information on the relevant intermolecular dynamics and promote the understanding of the interactions between molecules (which can ultimately lead to chemical reactions). Especially interesting are complexes involving molecules of high symmetry (e.g. tetrahedral, such as methane) because of the unusual effects arising from it (selection rules, nuclear Spin statistical weights etc.). The infrared spectrum of the Van der Waals complex between a CH 4 and a N 2 O molecule has been recorded and most of it has been assigned in the region of the N - O stretch (approximately 2225.0 cm -1 ). Despite the fact that this is really a weakly bound complex, it is nevertheless rigid enough so that the standard model for asymmetric top spectra can be applied to it with the usual quantum numbers. From the value of the inertial defect, it turns out that the methane unit is locked in a rigid configuration within the complex rather than freely rotating. The intermolecular distance as well as the tilting angle of the N 2 O linear unit are determined from the rotational constants. The complex itself turns out to have a T - shaped configuration. The infrared spectrum of the Ar - CH 4 complex at the ν 4 (bending) band of methane is also assigned. This is different from the previous one in that the methane unit rotates almost freely Within the complex. As a result, the quantum numbers used to classify rovibrational energy levels include these of the free unit. The concept of 'overall symmetry' is made use of to rationalise selection rules in various sub-bands of the spectrum. Moreover, new terms in the potential anisotropy Hamiltonian are calculated through the use of the overall symmetry concept. These are termed 'mixed anisotropy' terms since they involve both rotational and vibrational degrees of

  12. Total tree, merchantable stem and branch volume models for ...

    African Journals Online (AJOL)

    Total tree, merchantable stem and branch volume models for miombo woodlands of Malawi. Daud J Kachamba, Tron Eid. Abstract. The objective of this study was to develop general (multispecies) models for prediction of total tree, merchantable stem and branch volume including options with diameter at breast height (dbh) ...

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

    Indian Academy of Sciences (India)

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

  14. News and Events - Nanodelivery Systems and Devices Branch

    Science.gov (United States)

    The latest news from the Nanodelivery Systems and Devices Branch and the Alliance, as well as upcoming and past events attended by the Nanodelivery Systems and Devices Branchstaff, and relevant upcoming scientific meetings.

  15. Stochastic and deterministic causes of streamer branching in liquid dielectrics

    International Nuclear Information System (INIS)

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

    2013-01-01

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

  16. Similarity problems and completely bounded maps

    CERN Document Server

    Pisier, Gilles

    2001-01-01

    These notes revolve around three similarity problems, appearing in three different contexts, but all dealing with the space B(H) of all bounded operators on a complex Hilbert space H. The first one deals with group representations, the second one with C* -algebras and the third one with the disc algebra. We describe them in detail in the introduction which follows. This volume is devoted to the background necessary to understand these three problems, to the solutions that are known in some special cases and to numerous related concepts, results, counterexamples or extensions which their investigation has generated. While the three problems seem different, it is possible to place them in a common framework using the key concept of "complete boundedness", which we present in detail. Using this notion, the three problems can all be formulated as asking whether "boundedness" implies "complete boundedness" for linear maps satisfying certain additional algebraic identities. Two chapters have been added on the HALMO...

  17. Bound states and molecular structure of systems with hyperons

    International Nuclear Information System (INIS)

    Akaishi, Y.

    1992-01-01

    Microscopic calculations are done for Σ-hypernuclear few-body systems by a method named ATMS. Among two- to five-body systems, only the Σ 4 He(0 + ) and Σ 4 H(0 + ) hypernuclei are expected to be bound: The binding energy and the width of the former are calculated to be 3.7 ∼ 4.6 MeV and 4.5 ∼ 7.9 MeV, respectively. The observation of Σ 4 He at KEK is in good agreement with the above prediction. The nucleus-Σ potential has a strong Lane term and a repulsive bump at short distance. The Lane term makes the system bound and the bump suppresses the ΣN → ΛN conversion. X-ray measurement of level shifts in the 4 He-Σ - , 3 He-Σ - and 3 H-Σ - atoms can provide another information on the Lane term. In 208 Pb, there may exist a peculiar state, Coulomb-assisted (atomnucleus) hybrid state, where Σ - is trapped in the surface region by the strong interaction with the aid of the inner centrifugal repulsion and the outer Coulomb attraction. An analysis is given for new data of Ξ -.12 C atomic or nuclear systems from the emulsion-counter experiment at KEK. The double-Λ hypernucleus formation rate is calculated for a stopped Ξ - on 4 He. A high branching ratio of 37% is obtained for the ΛΛ 4 H formation from a Ξ -.4 He atom. The detection of about 2.3 MeV neutron is proposed to search for lightest double-Λ hypernucleus ΛΛ 4 H. (author)

  18. Linear and Branched PEIs (Polyethylenimines and Their Property Space

    Directory of Open Access Journals (Sweden)

    Claudiu N. Lungu

    2016-04-01

    Full Text Available A chemical property space defines the adaptability of a molecule to changing conditions and its interaction with other molecular systems determining a pharmacological response. Within a congeneric molecular series (compounds with the same derivatization algorithm and thus the same brute formula the chemical properties vary in a monotonic manner, i.e., congeneric compounds share the same chemical property space. The chemical property space is a key component in molecular design, where some building blocks are functionalized, i.e., derivatized, and eventually self-assembled in more complex systems, such as enzyme-ligand systems, of which (physico-chemical properties/bioactivity may be predicted by QSPR/QSAR (quantitative structure-property/activity relationship studies. The system structure is determined by the binding type (temporal/permanent; electrostatic/covalent and is reflected in its local electronic (and/or magnetic properties. Such nano-systems play the role of molecular devices, important in nano-medicine. In the present article, the behavior of polyethylenimine (PEI macromolecules (linear LPEI and branched BPEI, respectively with respect to the glucose oxidase enzyme GOx is described in terms of their (interacting energy, geometry and topology, in an attempt to find the best shape and size of PEIs to be useful for a chosen (nanochemistry purpose.

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

  20. The hyperbolic step potential: Anti-bound states, SUSY partners and Wigner time delays

    Energy Technology Data Exchange (ETDEWEB)

    Gadella, M. [Departamento de Física Teórica, Atómica y Óptica and IMUVA, Universidad de Valladolid, E-47011 Valladolid (Spain); Kuru, Ş. [Department of Physics, Faculty of Science, Ankara University, 06100 Ankara (Turkey); Negro, J., E-mail: jnegro@fta.uva.es [Departamento de Física Teórica, Atómica y Óptica and IMUVA, Universidad de Valladolid, E-47011 Valladolid (Spain)

    2017-04-15

    We study the scattering produced by a one dimensional hyperbolic step potential, which is exactly solvable and shows an unusual interest because of its asymmetric character. The analytic continuation of the scattering matrix in the momentum representation has a branch cut and an infinite number of simple poles on the negative imaginary axis which are related with the so called anti-bound states. This model does not show resonances. Using the wave functions of the anti-bound states, we obtain supersymmetric (SUSY) partners which are the series of Rosen–Morse II potentials. We have computed the Wigner reflection and transmission time delays for the hyperbolic step and such SUSY partners. Our results show that the more bound states a partner Hamiltonian has the smaller is the time delay. We also have evaluated time delays for the hyperbolic step potential in the classical case and have obtained striking similitudes with the quantum case. - Highlights: • The scattering matrix of hyperbolic step potential is studied. • The scattering matrix has a branch cut and an infinite number of poles. • The poles are associated to anti-bound states. • Susy partners using antibound states are computed. • Wigner time delays for the hyperbolic step and partner potentials are compared.

  1. The relationship between randomness and power-law distributed move lengths in random walk algorithms

    Science.gov (United States)

    Sakiyama, Tomoko; Gunji, Yukio-Pegio

    2014-05-01

    Recently, we proposed a new random walk algorithm, termed the REV algorithm, in which the agent alters the directional rule that governs it using the most recent four random numbers. Here, we examined how a non-bounded number, i.e., "randomness" regarding move direction, was important for optimal searching and power-law distributed step lengths in rule change. We proposed two algorithms: the REV and REV-bounded algorithms. In the REV algorithm, one of the four random numbers used to change the rule is non-bounded. In contrast, all four random numbers in the REV-bounded algorithm are bounded. We showed that the REV algorithm exhibited more consistent power-law distributed step lengths and flexible searching behavior.

  2. Optimization algorithms and applications

    CERN Document Server

    Arora, Rajesh Kumar

    2015-01-01

    Choose the Correct Solution Method for Your Optimization ProblemOptimization: Algorithms and Applications presents a variety of solution techniques for optimization problems, emphasizing concepts rather than rigorous mathematical details and proofs. The book covers both gradient and stochastic methods as solution techniques for unconstrained and constrained optimization problems. It discusses the conjugate gradient method, Broyden-Fletcher-Goldfarb-Shanno algorithm, Powell method, penalty function, augmented Lagrange multiplier method, sequential quadratic programming, method of feasible direc

  3. Solving large instances of the quadratic cost of partition problem on dense graphs by data correcting algorithms

    NARCIS (Netherlands)

    Goldengorin, Boris; Vink, Marius de

    1999-01-01

    The Data-Correcting Algorithm (DCA) corrects the data of a hard problem instance in such a way that we obtain an instance of a well solvable special case. For a given prescribed accuracy of the solution, the DCA uses a branch and bound scheme to make sure that the solution of the corrected instance

  4. State-set branching

    DEFF Research Database (Denmark)

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

    2008-01-01

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

  5. Business Systems Branch Abilities, Capabilities, and Services Web Page

    Science.gov (United States)

    Cortes-Pena, Aida Yoguely

    2009-01-01

    During the INSPIRE summer internship I acted as the Business Systems Branch Capability Owner for the Kennedy Web-based Initiative for Communicating Capabilities System (KWICC), with the responsibility of creating a portal that describes the services provided by this Branch. This project will help others achieve a clear view ofthe services that the Business System Branch provides to NASA and the Kennedy Space Center. After collecting the data through the interviews with subject matter experts and the literature in Business World and other web sites I identified discrepancies, made the necessary corrections to the sites and placed the information from the report into the KWICC web page.

  6. Braneworld black holes and entropy bounds

    Directory of Open Access Journals (Sweden)

    Y. Heydarzade

    2018-01-01

    Full Text Available The Bousso's D-bound entropy for the various possible black hole solutions on a 4-dimensional brane is checked. It is found that the D-bound entropy here is apparently different from that of obtained for the 4-dimensional black hole solutions. This difference is interpreted as the extra loss of information, associated to the extra dimension, when an extra-dimensional black hole is moved outward the observer's cosmological horizon. Also, it is discussed that N-bound entropy is hold for the possible solutions here. Finally, by adopting the recent Bohr-like approach to black hole quantum physics for the excited black holes, the obtained results are written also in terms of the black hole excited states.

  7. An error bound estimate and convergence of the Nodal-LTS N solution in a rectangle

    International Nuclear Information System (INIS)

    Hauser, Eliete Biasotto; Pazos, Ruben Panta; Tullio de Vilhena, Marco

    2005-01-01

    In this work, we report the mathematical analysis concerning error bound estimate and convergence of the Nodal-LTS N solution in a rectangle. For such we present an efficient algorithm, called LTS N 2D-Diag solution for Cartesian geometry

  8. Monetary and fiscal policy under bounded rationality and heterogeneous expectations

    NARCIS (Netherlands)

    Lustenhouwer, J.E.

    2017-01-01

    The goal of this thesis is to use plausible and intuitive models of bounded rationality to give new insights in monetary and fiscal policy. Particular focus is put on the zero lower bound on the nominal interest rate, forward guidance, and fiscal consolidations. The thesis considers different forms

  9. Tensor squeezed limits and the Higuchi bound

    Energy Technology Data Exchange (ETDEWEB)

    Bordin, Lorenzo [SISSA, via Bonomea 265, 34136, Trieste (Italy); Creminelli, Paolo [Abdus Salam International Centre for Theoretical Physics, Strada Costiera 11, 34151, Trieste (Italy); Mirbabayi, Mehrdad [Institute for Advanced Study, Princeton, NJ 08540 (United States); Noreña, Jorge, E-mail: lbordin@sissa.it, E-mail: creminel@ictp.it, E-mail: mehrdadm@ias.edu, E-mail: jorge.norena@pucv.cl [Instituto de Física, Pontificia Universidad Católica de Valparaíso, Avenida Universidad 330, Curauma, Valparaíso (Chile)

    2016-09-01

    We point out that tensor consistency relations—i.e. the behavior of primordial correlation functions in the limit a tensor mode has a small momentum—are more universal than scalar consistency relations. They hold in the presence of multiple scalar fields and as long as anisotropies are diluted exponentially fast. When de Sitter isometries are approximately respected during inflation this is guaranteed by the Higuchi bound, which forbids the existence of light particles with spin: de Sitter space can support scalar hair but no curly hair. We discuss two indirect ways to look for the violation of tensor consistency relations in observations, as a signature of models in which inflation is not a strong isotropic attractor, such as solid inflation: (a) graviton exchange contribution to the scalar four-point function; (b) quadrupolar anisotropy of the scalar power spectrum due to super-horizon tensor modes. This anisotropy has a well-defined statistics which can be distinguished from cases in which the background has a privileged direction.

  10. Upper bounds on minimum cardinality of exact and approximate reducts

    KAUST Repository

    Chikalov, Igor

    2010-01-01

    In the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case. © 2010 Springer-Verlag Berlin Heidelberg.

  11. F-Theory, spinning black holes and multi-string branches

    International Nuclear Information System (INIS)

    Haghighat, Babak; Murthy, Sameer; Vafa, Cumrun; Vandoren, Stefan

    2016-01-01

    We study 5d supersymmetric black holes which descend from strings of generic N=(1,0) supergravity in 6d. These strings have an F-theory realization in 6d as D3 branes wrapping smooth genus g curves in the base of elliptic 3-folds. They enjoy (0,4) worldsheet supersymmetry with an extra SU(2) L current algebra at level g realized on the left-movers. When the smooth curves degenerate they lead to multi-string branches and we find that the microscopic worldsheet theory flows in the IR to disconnected 2d CFTs having different central charges. The single string sector is the one with maximal central charge, which when wrapped on a circle, leads to a 5d spinning BPS black hole whose horizon volume agrees with the leading entropy prediction from the Cardy formula. However, we find new phenomena where this branch meets other branches of the CFT. These include multi-string configurations which have no bound states in 6 dimensions but are bound through KK momenta when wrapping a circle, as well as loci where the curves degenerate to spheres. These loci lead to black hole configurations which can have total angular momentum relative to a Taub-Nut center satisfying J 2 >M 3 and whose number of states, though exponentially large, grows much slower than those of the large spinning black hole.

  12. Upper bounds on quantum uncertainty products and complexity measures

    Energy Technology Data Exchange (ETDEWEB)

    Guerrero, Angel; Sanchez-Moreno, Pablo; Dehesa, Jesus S. [Department of Atomic, Molecular and Nuclear Physics, University of Granada, Granada (Spain); Department of Applied Mathematics, University of Granada, Granada (Spain) and Institute Carlos I for Computational and Theoretical Physics, University of Granada, Granada (Spain); Department of Atomic, Molecular and Nuclear Physics, University of Granada, Granada (Spain); Institute Carlos I for Computational and Theoretical Physics, University of Granada, Granada (Spain)

    2011-10-15

    The position-momentum Shannon and Renyi uncertainty products of general quantum systems are shown to be bounded not only from below (through the known uncertainty relations), but also from above in terms of the Heisenberg-Kennard product . Moreover, the Cramer-Rao, Fisher-Shannon, and Lopez-Ruiz, Mancini, and Calbet shape measures of complexity (whose lower bounds have been recently found) are also bounded from above. The improvement of these bounds for systems subject to spherically symmetric potentials is also explicitly given. Finally, applications to hydrogenic and oscillator-like systems are done.

  13. Algorithms

    Indian Academy of Sciences (India)

    to as 'divide-and-conquer'. Although there has been a large effort in realizing efficient algorithms, there are not many universally accepted algorithm design paradigms. In this article, we illustrate algorithm design techniques such as balancing, greedy strategy, dynamic programming strategy, and backtracking or traversal of ...

  14. Forecasting with Universal Approximators and a Learning Algorithm

    DEFF Research Database (Denmark)

    Kock, Anders Bredahl

    bounds for the combination rules applied. We apply the Weighted Average Algorithm (WAA) of Kivinen and Warmuth (1999) for which such loss bounds exist. Specifically, one can bound the worst case performance of the WAA compared to the performance of the best single model in the set of models combined from....... The use of universal approximators along with a combination scheme for which explicit loss bounds exist should give a solid theoretical foundation to the way the forecasts are performed. The practical performance will be investigated by considering various monthly postwar macroeconomic data sets for the G...

  15. Twisting, supercoiling and stretching in protein bound DNA

    Science.gov (United States)

    Lam, Pui-Man; Zhen, Yi

    2018-04-01

    We have calculated theoretical results for the torque and slope of the twisted DNA, with various proteins bound on it, using the Neukirch-Marko model, in the regime where plectonemes exist. We found that the torque in the protein bound DNA decreases compared to that in the bare DNA. This is caused by the decrease in the free energy g(f) , and hence the smaller persistence lengths, in the case of protein bound DNA. We hope our results will encourage experimental investigations of supercoiling in protein bound DNA, which can provide further tests of the Neukirch-Marko model.

  16. Classical Physics and the Bounds of Quantum Correlations.

    Science.gov (United States)

    Frustaglia, Diego; Baltanás, José P; Velázquez-Ahumada, María C; Fernández-Prieto, Armando; Lujambio, Aintzane; Losada, Vicente; Freire, Manuel J; Cabello, Adán

    2016-06-24

    A unifying principle explaining the numerical bounds of quantum correlations remains elusive, despite the efforts devoted to identifying it. Here, we show that these bounds are indeed not exclusive to quantum theory: for any abstract correlation scenario with compatible measurements, models based on classical waves produce probability distributions indistinguishable from those of quantum theory and, therefore, share the same bounds. We demonstrate this finding by implementing classical microwaves that propagate along meter-size transmission-line circuits and reproduce the probabilities of three emblematic quantum experiments. Our results show that the "quantum" bounds would also occur in a classical universe without quanta. The implications of this observation are discussed.

  17. Agency and Algorithms

    Directory of Open Access Journals (Sweden)

    Hanns Holger Rutz

    2016-11-01

    Full Text Available Although the concept of algorithms has been established a long time ago, their current topicality indicates a shift in the discourse. Classical definitions based on logic seem to be inadequate to describe their aesthetic capabilities. New approaches stress their involvement in material practices as well as their incompleteness. Algorithmic aesthetics can no longer be tied to the static analysis of programs, but must take into account the dynamic and experimental nature of coding practices. It is suggested that the aesthetic objects thus produced articulate something that could be called algorithmicity or the space of algorithmic agency. This is the space or the medium – following Luhmann’s form/medium distinction – where human and machine undergo mutual incursions. In the resulting coupled “extimate” writing process, human initiative and algorithmic speculation cannot be clearly divided out any longer. An observation is attempted of defining aspects of such a medium by drawing a trajectory across a number of sound pieces. The operation of exchange between form and medium I call reconfiguration and it is indicated by this trajectory. 

  18. Three-Dimensional Reconstruction of the Virtual Plant Branching Structure Based on Terrestrial LIDAR Technologies and L-System

    Science.gov (United States)

    Gong, Y.; Yang, Y.; Yang, X.

    2018-04-01

    For the purpose of extracting productions of some specific branching plants effectively and realizing its 3D reconstruction, Terrestrial LiDAR data was used as extraction source of production, and a 3D reconstruction method based on Terrestrial LiDAR technologies combined with the L-system was proposed in this article. The topology structure of the plant architectures was extracted using the point cloud data of the target plant with space level segmentation mechanism. Subsequently, L-system productions were obtained and the structural parameters and production rules of branches, which fit the given plant, was generated. A three-dimensional simulation model of target plant was established combined with computer visualization algorithm finally. The results suggest that the method can effectively extract a given branching plant topology and describes its production, realizing the extraction of topology structure by the computer algorithm for given branching plant and also simplifying the extraction of branching plant productions which would be complex and time-consuming by L-system. It improves the degree of automation in the L-system extraction of productions of specific branching plants, providing a new way for the extraction of branching plant production rules.

  19. THREE-DIMENSIONAL RECONSTRUCTION OF THE VIRTUAL PLANT BRANCHING STRUCTURE BASED ON TERRESTRIAL LIDAR TECHNOLOGIES AND L-SYSTEM

    Directory of Open Access Journals (Sweden)

    Y. Gong

    2018-04-01

    Full Text Available For the purpose of extracting productions of some specific branching plants effectively and realizing its 3D reconstruction, Terrestrial LiDAR data was used as extraction source of production, and a 3D reconstruction method based on Terrestrial LiDAR technologies combined with the L-system was proposed in this article. The topology structure of the plant architectures was extracted using the point cloud data of the target plant with space level segmentation mechanism. Subsequently, L-system productions were obtained and the structural parameters and production rules of branches, which fit the given plant, was generated. A three-dimensional simulation model of target plant was established combined with computer visualization algorithm finally. The results suggest that the method can effectively extract a given branching plant topology and describes its production, realizing the extraction of topology structure by the computer algorithm for given branching plant and also simplifying the extraction of branching plant productions which would be complex and time-consuming by L-system. It improves the degree of automation in the L-system extraction of productions of specific branching plants, providing a new way for the extraction of branching plant production rules.

  20. Branching microtubule nucleation in Xenopus egg extracts mediated by augmin and TPX2

    Science.gov (United States)

    Petry, Sabine; Groen, Aaron C.; Ishihara, Keisuke; Mitchison, Timothy J.; Vale, Ronald D.

    2013-01-01

    Summary The microtubules that comprise mitotic spindles in animal cells are nucleated at centrosomes and by spindle assembly factors that are activated in the vicinity of chromatin. Indirect evidence also has suggested that microtubules might be nucleated from pre-existing microtubules throughout the spindle, but this process has not been observed directly. Here, we demonstrate microtubule nucleation from the sides of existing microtubules in meiotic Xenopus egg extracts. Daughter microtubules grow at a low branch angle and with the same polarity as mother filaments. Branching microtubule nucleation requires gamma-tubulin and augmin and is stimulated by GTP-bound Ran and its effector TPX2, factors previously implicated in chromatin-stimulated nucleation. Because of the rapid amplification of microtubule numbers and the preservation of microtubule polarity, microtubule-dependent microtubule nucleation is well suited for spindle assembly and maintenance. PMID:23415226

  1. Semi-automated tabulation of the 3D topology and morphology of branching networks using CT: application to the airway tree

    International Nuclear Information System (INIS)

    Sauret, V.; Bailey, A.G.

    1999-01-01

    Detailed information on biological branching networks (optical nerves, airways or blood vessels) is often required to improve the analysis of 3D medical imaging data. A semi-automated algorithm has been developed to obtain the full 3D topology and dimensions (direction cosine, length, diameter, branching and gravity angles) of branching networks using their CT images. It has been tested using CT images of a simple Perspex branching network and applied to the CT images of a human cast of the airway tree. The morphology and topology of the computer derived network were compared with the manually measured dimensions. Good agreement was found. The airways dimensions also compared well with previous values quoted in literature. This algorithm can provide complete data set analysis much more quickly than manual measurements. Its use is limited by the CT resolution which means that very small branches are not visible. New data are presented on the branching angles of the airway tree. (author)

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

    International Nuclear Information System (INIS)

    Specht, W.L.

    1994-12-01

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

  3. Avoiding spurious submovement decompositions: a globally optimal algorithm

    International Nuclear Information System (INIS)

    Rohrer, Brandon Robinson; Hogan, Neville

    2003-01-01

    Evidence for the existence of discrete submovements underlying continuous human movement has motivated many attempts to extract them. Although they produce visually convincing results, all of the methodologies that have been employed are prone to produce spurious decompositions. Examples of potential failures are given. A branch-and-bound algorithm for submovement extraction, capable of global nonlinear minimization (and hence capable of avoiding spurious decompositions), is developed and demonstrated.

  4. Parallel Algorithms and Patterns

    Energy Technology Data Exchange (ETDEWEB)

    Robey, Robert W. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2016-06-16

    This is a powerpoint presentation on parallel algorithms and patterns. A parallel algorithm is a well-defined, step-by-step computational procedure that emphasizes concurrency to solve a problem. Examples of problems include: Sorting, searching, optimization, matrix operations. A parallel pattern is a computational step in a sequence of independent, potentially concurrent operations that occurs in diverse scenarios with some frequency. Examples are: Reductions, prefix scans, ghost cell updates. We only touch on parallel patterns in this presentation. It really deserves its own detailed discussion which Gabe Rockefeller would like to develop.

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

    Directory of Open Access Journals (Sweden)

    Lee Shaish

    Full Text Available The high morphological resemblance between branching corals and trees, can lead to comparative studies on pattern formation traits, best exemplified in plants and in some cnidarians. Here, 81 branches of similar size of the hermatypic coral Stylophora pistillata were lopped of three different genets, their skeletons marked with alizarin red-S, and divided haphazardly into three morphometric treatment groups: (I upright position; (II horizontal position, intact tip; and (III horizontal position, cut tip. After 1 y of in-situ growth, the 45 surviving ramets were brought to the laboratory, their tissues removed and their architectures analyzed by 22 morphological parameters (MPs. We found that within 1 y, isolated branches developed into small coral colonies by growing new branches from all branch termini, in all directions. No architectural dissimilarity was assigned among the three studied genets of treatment I colonies. However, a major architectural disparity between treatment I colonies and colonies of treatments II and III was documented as the development of mirror structures from both sides of treatments II and III settings as compared to tip-borne architectures in treatment I colonies. We did not observe apical dominance since fragments grew equally from all branch sides without documented dominant polarity along branch axis. In treatment II colonies, no MP for new branches originating either from tips or from branch bases differed significantly. In treatment III colonies, growth from the cut tip areas was significantly lower compared to the base, again, suggesting lack of apical dominance in this species. Changes in branch polarity revealed genet associated plasticity, which in one of the studied genets, led to enhanced growth. Different genets exhibited canalization flexibility of growth patterns towards either lateral growth, or branch axis extension (skeletal weight and not porosity was measured. This study revealed that colony

  6. Solving the minimum flow problem with interval bounds and flows

    Indian Academy of Sciences (India)

    ... with crisp data. In this paper, the idea of Ghiyasvand was extended for solving the minimum flow problem with interval-valued lower, upper bounds and flows. This problem can be solved using two minimum flow problems with crisp data. Then, this result is extended to networks with fuzzy lower, upper bounds and flows.

  7. Law and Order in Algorithmics

    NARCIS (Netherlands)

    Fokkinga, M.M.

    1992-01-01

    An algorithm is the input-output effect of a computer program; mathematically, the notion of algorithm comes close to the notion of function. Just as arithmetic is the theory and practice of calculating with numbers, so is ALGORITHMICS the theory and practice of calculating with algorithms. Just as

  8. Bounds and estimates for the linearly perturbed eigenvalue problem

    International Nuclear Information System (INIS)

    Raddatz, W.D.

    1983-01-01

    This thesis considers the problem of bounding and estimating the discrete portion of the spectrum of a linearly perturbed self-adjoint operator, M(x). It is supposed that one knows an incomplete set of data consisting in the first few coefficients of the Taylor series expansions of one or more of the eigenvalues of M(x) about x = 0. The foundations of the variational study of eigen-values are first presented. These are then used to construct the best possible upper bounds and estimates using various sets of given information. Lower bounds are obtained by estimating the error in the upper bounds. The extension of these bounds and estimates to the eigenvalues of the doubly-perturbed operator M(x,y) is discussed. The results presented have numerous practical application in the physical sciences, including problems in atomic physics and the theory of vibrations of acoustical and mechanical systems

  9. A Branch-and-Price Framework for Railway Rolling Stock Rescheduling During Disruptions

    DEFF Research Database (Denmark)

    Haahr, Jørgen Thorlund; Lusby, Richard Martin; Larsen, Jesper

    using column generation in a complete Branch-and-Price framework. In contrast to flow-based approaches our formulation is more easily extended to handle certain families of constraints, such as train unit maintenance restrictions. We benchmark the framework against real-life instances provided...... by the suburban railway operator in Copenhagen (DSB S-tog). In combination with a lower bound method we show that near-optimal solutions can be found within a few seconds during a disruption. In addition we show that framework is also able to find solution within a few minutes for non-disturbed timetables....

  10. Models and Techniques for Proving Data Structure Lower Bounds

    DEFF Research Database (Denmark)

    Larsen, Kasper Green

    In this dissertation, we present a number of new techniques and tools for proving lower bounds on the operational time of data structures. These techniques provide new lines of attack for proving lower bounds in both the cell probe model, the group model, the pointer machine model and the I...... bound of tutq = (lgd􀀀1 n). For ball range searching, we get a lower bound of tutq = (n1􀀀1=d). The highest previous lower bound proved in the group model does not exceed ((lg n= lg lg n)2) on the maximum of tu and tq. Finally, we present a new technique for proving lower bounds....../O-model. In all cases, we push the frontiers further by proving lower bounds higher than what could possibly be proved using previously known techniques. For the cell probe model, our results have the following consequences: The rst (lg n) query time lower bound for linear space static data structures...

  11. Sampling and identification of gaseous and particle bounded air pollutants

    International Nuclear Information System (INIS)

    Kettrup, A.

    1993-01-01

    Air pollutants are gaseous, components of aerosols or particle bounded. Sampling, sample preparation, identification and quantification of compounds depend from kind and chemical composition of the air pollutants. Quality assurance of analytical data must be guaranted. (orig.) [de

  12. Viscosity bound violation in holographic solids and the viscoelastic response

    Energy Technology Data Exchange (ETDEWEB)

    Alberte, Lasma [Abdus Salam International Centre for Theoretical Physics (ICTP),Strada Costiera 11, 34151, Trieste (Italy); Baggioli, Matteo [Institut de Física d’Altes Energies (IFAE),The Barcelona Institute of Science and Technology (BIST),Campus UAB, 08193 Bellaterra, Barcelona (Spain); Department of Physics, Institute for Condensed Matter Theory, University of Illinois,1110 W. Green Street, Urbana, IL 61801 (United States); Pujolàs, Oriol [Institut de Física d’Altes Energies (IFAE),The Barcelona Institute of Science and Technology (BIST),Campus UAB, 08193 Bellaterra, Barcelona (Spain)

    2016-07-14

    We argue that the Kovtun-Son-Starinets (KSS) lower bound on the viscosity to entropy density ratio holds in fluid systems but is violated in solid materials with a non-zero shear elastic modulus. We construct explicit examples of this by applying the standard gauge/gravity duality methods to massive gravity and show that the KSS bound is clearly violated in black brane solutions whenever the massive gravity theories are of solid type. We argue that the physical reason for the bound violation relies on the viscoelastic nature of the mechanical response in these materials. We speculate on whether any real-world materials can violate the bound and discuss a possible generalization of the bound that involves the ratio of the shear elastic modulus to the pressure.

  13. Viscosity bound violation in holographic solids and the viscoelastic response

    International Nuclear Information System (INIS)

    Alberte, Lasma; Baggioli, Matteo; Pujolàs, Oriol

    2016-01-01

    We argue that the Kovtun-Son-Starinets (KSS) lower bound on the viscosity to entropy density ratio holds in fluid systems but is violated in solid materials with a non-zero shear elastic modulus. We construct explicit examples of this by applying the standard gauge/gravity duality methods to massive gravity and show that the KSS bound is clearly violated in black brane solutions whenever the massive gravity theories are of solid type. We argue that the physical reason for the bound violation relies on the viscoelastic nature of the mechanical response in these materials. We speculate on whether any real-world materials can violate the bound and discuss a possible generalization of the bound that involves the ratio of the shear elastic modulus to the pressure.

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

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

  16. Hitting times of local and global optima in genetic algorithms with very high selection pressure

    Directory of Open Access Journals (Sweden)

    Eremeev Anton V.

    2017-01-01

    Full Text Available The paper is devoted to upper bounds on the expected first hitting times of the sets of local or global optima for non-elitist genetic algorithms with very high selection pressure. The results of this paper extend the range of situations where the upper bounds on the expected runtime are known for genetic algorithms and apply, in particular, to the Canonical Genetic Algorithm. The obtained bounds do not require the probability of fitness-decreasing mutation to be bounded by a constant which is less than one.

  17. On the Coulomb and Higgs branch formulae for multi-centered black holes and quiver invariants

    CERN Document Server

    Manschot, Jan; Sen, Ashoke

    2013-01-01

    In previous work we have shown that the equivariant index of multi-centered N=2 black holes localizes on collinear configurations along a fixed axis. Here we provide a general algorithm for enumerating such collinear configurations and computing their contribution to the index. We apply this machinery to the case of black holes described by quiver quantum mechanics, and give a systematic prescription -- the Coulomb branch formula -- for computing the cohomology of the moduli space of quiver representations. For quivers without oriented loops, the Coulomb branch formula is shown to agree with the Higgs branch formula based on Reineke's result for stack invariants, even when the dimension vector is not primitive. For quivers with oriented loops, the Coulomb branch formula parametrizes the Poincar\\'e polynomial of the quiver moduli space in terms of single-centered (or pure-Higgs) BPS invariants, which are conjecturally independent of the stability condition (i.e. the choice of Fayet-Iliopoulos parameters) and a...

  18. RADIONUCLIDE INVENTORY AND DISTRIBUTION: FOURMILE BRANCH, PEN BRANCH, AND STEEL CREEK IOUS

    Energy Technology Data Exchange (ETDEWEB)

    Hiergesell, R.; Phifer, M.

    2014-04-29

    As a condition to the Department of Energy (DOE) Low Level Waste Disposal Federal Facility Review Group (LFRG) review team approving the Savannah River Site (SRS) Composite Analysis (CA), SRS agreed to follow up on a secondary issue, which consisted of the consolidation of several observations that the team concluded, when evaluated collectively, could potentially impact the integration of the CA results. This report addresses secondary issue observations 4 and 21, which identify the need to improve the CA sensitivity and uncertainty analysis specifically by improving the CA inventory and the estimate of its uncertainty. The purpose of the work described herein was to be responsive to these secondary issue observations by re-examining the radionuclide inventories of the Integrator Operable Units (IOUs), as documented in ERD 2001 and Hiergesell, et. al. 2008. The LFRG concern has been partially addressed already for the Lower Three Runs (LTR) IOU (Hiergesell and Phifer, 2012). The work described in this investigation is a continuation of the effort to address the LFRG concerns by re-examining the radionuclide inventories associated with Fourmile Branch (FMB) IOU, Pen Branch (PB) IOU and Steel Creek (SC) IOU. The overall approach to computing radionuclide inventories for each of the IOUs involved the following components: • Defining contaminated reaches of sediments along the IOU waterways • Identifying separate segments within each IOU waterway to evaluate individually • Computing the volume and mass of contaminated soil associated with each segment, or “compartment” • Obtaining the available and appropriate Sediment and Sediment/Soil analytical results associated with each IOU • Standardizing all radionuclide activity by decay-correcting all sample analytical results from sample date to the current point in time, • Computing representative concentrations for all radionuclides associated with each compartment in each of the IOUs • Computing the

  19. DAL Algorithms and Python

    CERN Document Server

    Aydemir, Bahar

    2017-01-01

    The Trigger and Data Acquisition (TDAQ) system of the ATLAS detector at the Large Hadron Collider (LHC) at CERN is composed of a large number of distributed hardware and software components. TDAQ system consists of about 3000 computers and more than 25000 applications which, in a coordinated manner, provide the data-taking functionality of the overall system. There is a number of online services required to configure, monitor and control the ATLAS data taking. In particular, the configuration service is used to provide configuration of above components. The configuration of the ATLAS data acquisition system is stored in XML-based object database named OKS. DAL (Data Access Library) allowing to access it's information by C++, Java and Python clients in a distributed environment. Some information has quite complicated structure, so it's extraction requires writing special algorithms. Algorithms available on C++ programming language and partially reimplemented on Java programming language. The goal of the projec...

  20. Boosting foundations and algorithms

    CERN Document Server

    Schapire, Robert E

    2012-01-01

    Boosting is an approach to machine learning based on the idea of creating a highly accurate predictor by combining many weak and inaccurate "rules of thumb." A remarkably rich theory has evolved around boosting, with connections to a range of topics, including statistics, game theory, convex optimization, and information geometry. Boosting algorithms have also enjoyed practical success in such fields as biology, vision, and speech processing. At various times in its history, boosting has been perceived as mysterious, controversial, even paradoxical.

  1. Inequalities and bounds for nucleon-nucleon scattering

    International Nuclear Information System (INIS)

    Ramandurai, K.S.

    1979-08-01

    The objective of this work is to derive model-independent inequalities and bounds for nucleon-nucleon elastic scattering amplitudes based on well-established theoretical principles and symmetries. Two classes of methods are used: algebraic and variational. In the algebraic part, the author derives inequalities and bounds for NN amplitudes and observables using their mutual relations and x symmetries. In the variational part, he employs Lagrange's method of undetermined multipliers to evaluate the bounds. He tests the predictions of a sample of proposed phase shifts at three different energies using the results obtained

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

    NARCIS (Netherlands)

    Goldengorin, B.; Ghosh, D.; Sierksma, G.

    The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This problem often appears as a subproblem in other combinatorial problems. Several

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

    NARCIS (Netherlands)

    Goldengorin, Boris; Ghosh, Diptesh; Sierksma, Gerard

    2001-01-01

    The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This problem of ten appears as a subproblem in other combinatorial problems. Several

  4. Unusually Looped and Muzzled Branches of Right Coronary Artery

    Directory of Open Access Journals (Sweden)

    Anitha Guru

    2017-01-01

    Full Text Available Coronary artery disease (CAD is the major cause of death in developed countries as it accounts on an average for 1 of every 5 deaths. Morphological variations of coronary arterial system is one of the causative factor for CAD. Anatomical knowledge of all possible variant patterns of coronary arterial system is imperative in the diagnostic and therapeutic approach of CAD. We report here a rare branching pattern of right coronary artery (RCA. The origin of RCA was normal but the course and branching pattern of it were atypical. RCA was not occupying its usual position in atrioventricular (coronary sulcus and its course was incomplete. It gave a ventricular branch to right ventricle, which presented an unusual looping pattern. It terminated as right marginal artery following its muzzled appearance within the musculature of the ventricle.

  5. Branch migration and the international dispersal of families.

    Science.gov (United States)

    Parr, N; Lucas, D; Mok, M

    2000-01-01

    This paper discusses the dispersal of facilities where family members migrate to different destination countries. Terminology for internationally dispersed families is proposed, and the term branch migration is suggested for the migration of related people from the same source country to different destination countries. Data from two 1993 surveys of senior secondary students show that 22% of Sydney students and 20% of Hong Kong students have relatives in two or more other countries. The data suggest that many Asian migrant families have branched between the US, Canada, Australia and other migrant-receiving nations. The causes and implications of the international dispersal of families are discussed.

  6. Reconstructing 3D Tree Models Using Motion Capture and Particle Flow

    Directory of Open Access Journals (Sweden)

    Jie Long

    2013-01-01

    Full Text Available Recovering tree shape from motion capture data is a first step toward efficient and accurate animation of trees in wind using motion capture data. Existing algorithms for generating models of tree branching structures for image synthesis in computer graphics are not adapted to the unique data set provided by motion capture. We present a method for tree shape reconstruction using particle flow on input data obtained from a passive optical motion capture system. Initial branch tip positions are estimated from averaged and smoothed motion capture data. Branch tips, as particles, are also generated within a bounding space defined by a stack of bounding boxes or a convex hull. The particle flow, starting at branch tips within the bounding volume under forces, creates tree branches. The forces are composed of gravity, internal force, and external force. The resulting shapes are realistic and similar to the original tree crown shape. Several tunable parameters provide control over branch shape and arrangement.

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

  8. The K tree score: quantification of differences in the relative branch length and topology of phylogenetic trees.

    Science.gov (United States)

    Soria-Carrasco, Víctor; Talavera, Gerard; Igea, Javier; Castresana, Jose

    2007-11-01

    We introduce a new phylogenetic comparison method that measures overall differences in the relative branch length and topology of two phylogenetic trees. To do this, the algorithm first scales one of the trees to have a global divergence as similar as possible to the other tree. Then, the branch length distance, which takes differences in topology and branch lengths into account, is applied to the two trees. We thus obtain the minimum branch length distance or K tree score. Two trees with very different relative branch lengths get a high K score whereas two trees that follow a similar among-lineage rate variation get a low score, regardless of the overall rates in both trees. There are several applications of the K tree score, two of which are explained here in more detail. First, this score allows the evaluation of the performance of phylogenetic algorithms, not only with respect to their topological accuracy, but also with respect to the reproduction of a given branch length variation. In a second example, we show how the K score allows the selection of orthologous genes by choosing those that better follow the overall shape of a given reference tree. http://molevol.ibmb.csic.es/Ktreedist.html

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

    Science.gov (United States)

    Freeman, B M; Chaves-Campos, J

    2016-06-01

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

  10. Aluminum stimulates uptake of non-transferrin bound iron and transferrin bound iron in human glial cells

    International Nuclear Information System (INIS)

    Kim, Yongbae; Olivi, Luisa; Cheong, Jae Hoon; Maertens, Alex; Bressler, Joseph P.

    2007-01-01

    Aluminum and other trivalent metals were shown to stimulate uptake of transferrin bound iron and nontransferrin bound iron in erytholeukemia and hepatoma cells. Because of the association between aluminum and Alzheimer's Disease, and findings of higher levels of iron in Alzheimer's disease brains, the effects of aluminum on iron homeostasis were examined in a human glial cell line. Aluminum stimulated dose- and time-dependent uptake of nontransferrin bound iron and iron bound to transferrin. A transporter was likely involved in the uptake of nontransferrin iron because uptake reached saturation, was temperature-dependent, and attenuated by inhibitors of protein synthesis. Interestingly, the effects of aluminum were not blocked by inhibitors of RNA synthesis. Aluminum also decreased the amount of iron bound to ferritin though it did not affect levels of divalent metal transporter 1. These results suggest that aluminum disrupts iron homeostasis in Brain by several mechanisms including the transferrin receptor, a nontransferrin iron transporter, and ferritin

  11. Deeply bound pionic states and modifications of hadrons

    International Nuclear Information System (INIS)

    Hirenzaki, S.

    2000-01-01

    We have studied the structure and formation of mesic atoms and mesic nuclei theoretically. The latest results on the deeply bound pionic atoms, the kaonic atoms and the sigma states are reported. (author)

  12. Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds

    DEFF Research Database (Denmark)

    Atamtürk, Alper; Muller, Laurent Flindt; Pisinger, David

    2013-01-01

    Motivated by addressing probabilistic 0-1 programs we study the conic quadratic knapsack polytope with generalized upper bound (GUB) constraints. In particular, we investigate separating and extending GUB cover inequalities. We show that, unlike in the linear case, determining whether a cover can...... be extended with a single variable is NP-hard. We describe and compare a number of exact and heuristic separation and extension algorithms which make use of the structure of the constraints. Computational experiments are performed for comparing the proposed separation and extension algorithms...

  13. Conformations and solution properties of star-branched polyelectrolytes

    NARCIS (Netherlands)

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

    2011-01-01

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

  14. Algebraic dynamics algorithm: Numerical comparison with Runge-Kutta algorithm and symplectic geometric algorithm

    Institute of Scientific and Technical Information of China (English)

    WANG ShunJin; ZHANG Hua

    2007-01-01

    Based on the exact analytical solution of ordinary differential equations,a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm.A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models.The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision,and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.

  15. Algebraic dynamics algorithm:Numerical comparison with Runge-Kutta algorithm and symplectic geometric algorithm

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Based on the exact analytical solution of ordinary differential equations, a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm. A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models. The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision, and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.

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

  17. HiggsBounds 2.0.0. Confronting neutral and charged Higgs sector predictions with exclusion bounds from LEP and the Tevatron

    Energy Technology Data Exchange (ETDEWEB)

    Bechtle, P.; Weiglein, G. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Brein, O. [Freiburg Univ. (Germany). Physikalisches Inst.; Heinemeyer, S. [Instituto de Fisica de Cantabria (CSIC-UC), Santander (Spain); Williams, K.E. [Bonn Univ. (Germany). Bethe Center for Theoretical Physics

    2011-03-15

    HiggsBounds 2.0.0 is a computer code which tests both neutral and charged Higgs sectors of arbitrary models against the current exclusion bounds from the Higgs searches at LEP and the Tevatron. As input, it requires a selection of model predictions, such as Higgs masses, branching ratios, effective couplings and total decay widths. HiggsBounds 2.0.0 then uses the expected and observed topological cross section limits from the Higgs searches to determine whether a given parameter scenario of a model is excluded at the 95% C.L. by those searches. Version 2.0.0 represents a significant extension of the code since its first release (1.0.0). It includes now 28/53 LEP/Tevatron Higgs search analyses, compared to the 11/22 in the first release, of which many of the ones from the Tevatron are replaced by updates. As a major extension, the code allows now the predictions for (singly) charged Higgs bosons to be confronted with LEP and Tevatron searches. Furthermore, the newly included analyses contain LEP searches for neutral Higgs bosons (H) decaying invisibly or into (non flavour tagged) hadrons as well as decay-mode independent searches for neutral Higgs bosons, LEP searches via the production modes {tau}{sup +}{tau}{sup -}H and b anti bH, and Tevatron searches via t anti tH. Also, all Tevatron results presented at the ICHEP'10 are included in version 2.0.0. As physics applications of HiggsBounds 2.0.0 we study the allowed Higgs mass range for model scenarios with invisible Higgs decays and we obtain exclusion results for the scalar sector of the Randall-Sundrum model using up-to-date LEP and Tevatron direct search results. (orig.)

  18. Global Expansion of International Branch Campuses: Managerial and Leadership Challenges

    Science.gov (United States)

    Lane, Jason E.

    2011-01-01

    In this chapter, the author outlines the growth of international branch campuses (IBCs) over the past fifty years and discusses some of the major management and leadership challenges associated with creating and sustaining IBCs. Part one of the chapter provides a discussion of the global expansion of IBCs. The second part focuses on the…

  19. Bounded solutions for fuzzy differential and integral equations

    Energy Technology Data Exchange (ETDEWEB)

    Nieto, Juan J. [Departamento de Analisis Matematico Facultad de Matematicas Universidad de Santiago de Compostela, 15782 (Spain)] e-mail: amnieto@usc.es; Rodriguez-Lopez, Rosana [Departamento de Analisis Matematico Facultad de Matematicas Universidad de Santiago de Compostela, 15782 (Spain)] e-mail: amrosana@usc.es

    2006-03-01

    We find sufficient conditions for the boundness of every solution of first-order fuzzy differential equations as well as certain fuzzy integral equations. Our results are based on several theorems concerning crisp differential and integral inequalities.

  20. Interactive Design and Visualization of Branched Covering Spaces.

    Science.gov (United States)

    Roy, Lawrence; Kumar, Prashant; Golbabaei, Sanaz; Zhang, Yue; Zhang, Eugene

    2018-01-01

    Branched covering spaces are a mathematical concept which originates from complex analysis and topology and has applications in tensor field topology and geometry remeshing. Given a manifold surface and an -way rotational symmetry field, a branched covering space is a manifold surface that has an -to-1 map to the original surface except at the ramification points, which correspond to the singularities in the rotational symmetry field. Understanding the notion and mathematical properties of branched covering spaces is important to researchers in tensor field visualization and geometry processing, and their application areas. In this paper, we provide a framework to interactively design and visualize the branched covering space (BCS) of an input mesh surface and a rotational symmetry field defined on it. In our framework, the user can visualize not only the BCSs but also their construction process. In addition, our system allows the user to design the geometric realization of the BCS using mesh deformation techniques as well as connecting tubes. This enables the user to verify important facts about BCSs such as that they are manifold surfaces around singularities, as well as the Riemann-Hurwitz formula which relates the Euler characteristic of the BCS to that of the original mesh. Our system is evaluated by student researchers in scientific visualization and geometry processing as well as faculty members in mathematics at our university who teach topology. We include their evaluations and feedback in the paper.

  1. Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Koprowski, Maciej

    2002-01-01

    not use any special properties of the group at hand. We prove an exponential lower bound on the generic complexity of root extraction, even if the algorithm can choose the public exponent itself. In other words, both the standard and the strong RSA assumption are provably true w.r.t. generic algorithms...... it in RSA groups without the original restriction that the modulus must be a product of safe primes. It can also be implemented in class groups. In all cases, security follows from a well defined complexity assumption (the strong root assumption), without relying on random oracles, and the assumption...

  2. Symbol Tables and Branch Tables: Linking Applications Together

    Science.gov (United States)

    Handler, Louis M.

    2011-01-01

    This document explores the computer techniques used to execute software whose parts are compiled and linked separately. The computer techniques include using a branch table or indirect address table to connect the parts. Methods of storing the information in data structures are discussed as well as differences between C and C++.

  3. Synthesis and application of branched type II arabinogalactans

    DEFF Research Database (Denmark)

    Andersen, Mathias Christian Franch; Boos, Irene; Ruprecht, Colin

    2017-01-01

    The synthesis of linear- and (1→6)-branched β-(1→3)-D-galactans, structures found in plant arabinogalactan proteins (AGPs) is described. The synthetic strategy relies on iterative couplings of mono- and disaccharide thioglycoside donors, followed by a late stage glycosylation of heptagalactan bac...

  4. Quantifying Bounded Rationality: Managerial Behaviour and the Smith Predictor

    OpenAIRE

    Riddalls, C.E.; Bennett, S.

    2001-01-01

    The concept of bounded rationality in decision making and research on its relegation to aggregate system dynamics is examined. By recasting one such example of a dynamic system, the Beer Game, as a Smith predictor control system is derived. A stability analysis is then employed to support the and qualify the assertion that the level of bounded rationality can adversely affect the aggregate dynamic behaviour of such supply chains. The analytical basis of these calculations enables the qualific...

  5. Buneman instability and Pierce instability in a collisionless bounded plasma

    International Nuclear Information System (INIS)

    Iizuka, Satoru; Saeki, Koichi; Sato, Noriyoshi; Hatta, Yoshisuke

    1983-01-01

    A systematic experiment is performed on the Buneman instability and the Pierce instability in a bounded plasma consisting of beam electrons and stationary ions. Current fluctuations are confirmed to be induced by the Buneman instability. On the other hand, the Pierce instability gives rise to a current limitation. The phenomena are well explained by Mikhailovskii's theory taking account of ion motion in a bounded plasma. (author)

  6. APS Beyond Positivity Bounds and the Fate of Massive Gravity

    CERN Document Server

    Bellazzini, Brando; Serra, Javi; Sgarlata, Francesco

    2018-04-18

    We constrain effective field theories by going beyond the familiar positivity bounds that follow from unitarity, analyticity, and crossing symmetry of the scattering amplitudes. As interesting examples, we discuss the implications of the bounds for the Galileon and ghost-free massive gravity. The combination of our theoretical bounds with the experimental constraints on the graviton mass implies that the latter is either ruled out or unable to describe gravitational phenomena, let alone to consistently implement the Vainshtein mechanism, down to the relevant scales of fifth-force experiments, where general relativity has been successfully tested. We also show that the Galileon theory must contain symmetry-breaking terms that are at most one-loop suppressed compared to the symmetry-preserving ones. We comment as well on other interesting applications of our bounds.

  7. MYOCARDIAL DEFORMATION AND COMPLETE LEFT BUNDLE BRANCH BLOCK

    Directory of Open Access Journals (Sweden)

    E. N. Pavlyukova

    2015-12-01

    Full Text Available Tissue Doppler imaging is evolving as a useful echocardiographic tool for quantitative assessment of left ventricular systolic and diastolic function. Over the last 10 years, myocardial deformation imaging has become possible initially with tissue Doppler , and more recently with myocardial speckle-tracking using 2D echocardiography. Unlike simple tissue velocity measurements, deformation measurements are specific for the region of interest. Strain rate or strain measurements have been used as sensitive indicators for subclinical diseases, and it is the most widely used tool to assess mechanical dyssynchrony. Left bundle branch block is a frequent, etiologically heterogeneous, clinically hostile and diagnostically challenging entity. About 2% of patients underwent cardiac stress testing show stable or intermittent left bundle branch block. Presence of left bundle branch block is associated with a lower and slower diastolic coronary flow velocity especially during hyperemia. Stress echocardiography is the best option for the diagnosis of ischemic heart disease, albeit specificity and sensitivity reduce in patients with left bundle branch block in the territory of left anterior descending artery in presence of initial septum dyskinesia.

  8. Cosmological stability bound in massive gravity and bigravity

    International Nuclear Information System (INIS)

    Fasiello, Matteo; Tolley, Andrew J.

    2013-01-01

    We give a simple derivation of a cosmological bound on the graviton mass for spatially flat FRW solutions in massive gravity with an FRW reference metric and for bigravity theories. This bound comes from the requirement that the kinetic term of the helicity zero mode of the graviton is positive definite. The bound is dependent only on the parameters in the massive gravity potential and the Hubble expansion rate for the two metrics. We derive the decoupling limit of bigravity and FRW massive gravity, and use this to give an independent derivation of the cosmological bound. We recover our previous results that the tension between satisfying the Friedmann equation and the cosmological bound is sufficient to rule out all observationally relevant FRW solutions for massive gravity with an FRW reference metric. In contrast, in bigravity this tension is resolved due to different nature of the Vainshtein mechanism. We find that in bigravity theories there exists an FRW solution with late-time self-acceleration for which the kinetic terms for the helicity-2, helicity-1 and helicity-0 are generically nonzero and positive making this a compelling candidate for a model of cosmic acceleration. We confirm that the generalized bound is saturated for the candidate partially massless (bi)gravity theories but the existence of helicity-1/helicity-0 interactions implies the absence of the conjectured partially massless symmetry for both massive gravity and bigravity

  9. Branched flow and caustics in random media with magnetic fields

    Science.gov (United States)

    Metzger, Jakob; Fleischmann, Ragnar; Geisel, Theo

    2009-03-01

    Classical particles as well as quantum mechanical waves exhibit complex behaviour when propagating through random media. One of the dominant features of the dynamics in correlated, weak disorder potentials is the branching of the flow. This can be observed in several physical systems, most notably in the electron flow in two-dimensional electron gases [1], and has also been used to describe the formation of freak waves [2]. We present advances in the theoretical understanding and numerical simulation of classical branched flows in magnetic fields. In particular, we study branching statistics and branch density profiles. Our results have direct consequences for experiments which measure transport properties in electronic systems [3].[1] e.g. M. A. Topinka et al., Nature 410, 183 (2001), M. P. Jura et al., Nature Physics 3, 841 (2007)[2] E. J. Heller, L. Kaplan and A. Dahlen, J. Geophys. Res., 113, C09023 (2008)[3] J. J. Metzger, R. Fleischmann and T. Geisel, in preparation

  10. Determination of total, and bound Se in sera by INAA

    International Nuclear Information System (INIS)

    Spate, V.L.; Mason, M.M.; Reams, C.L.; Baskett, C.K.; Morris, J.S.; Mills, D.S.

    1994-01-01

    The comparison between the total selenium in serum ('total Se') with that which is apparently bound to high molecular weight (> 12.000 D) species, presumably proteins ('bound Se') was reported. Nine hundred seventy seven (977) serum samples arising out of a population-based epidemiological study were prepared in duplicate for the determination of 'total Se' by pipeting directly into irradiation vials; and separate duplicate aliquots were dialyzed against DI water for the determination of 'bound Se'. All samples were analyzed by neutron activation analysis via 77m Se (17.4s) A small dialyzable Se component (∼ 6%) ('free Se'), defined as the difference between the 'total Se' minus the 'bound Se', was identified. (author) 2 refs.; 3 figs.; 5 tabs

  11. Remarks on interior transmission eigenvalues, Weyl formula and branching billiards

    International Nuclear Information System (INIS)

    Lakshtanov, E; Vainberg, B

    2012-01-01

    This paper contains the Weyl formula for the counting function of the interior transmission problem when the latter is parameter elliptic. Branching billiard trajectories are constructed, and the second term of the Weyl asymptotics is estimated from above under some conditions on the set of periodic billiard trajectories. (paper)

  12. Nuclear Science and Technology Branch Report 1975

    International Nuclear Information System (INIS)

    1975-10-01

    A summary is given of research activities. These include: nuclear techniques of analysis, nuclear techniques in hydrology, industrial applications of radioisotopes, biological and chemical applications of irradiation, radiation detection and measurement, environmental studies and biophysics and radiation biology. Patent applications and staff of the nuclear science and applications secretariat are listed. (R.L.)

  13. Observations of bound and unbound states of Ce−

    International Nuclear Information System (INIS)

    Walter, C W; Li, Y-G; Matyas, D J; Alton, R M; Lou, S E; III, R L Field; Gibson, N D; Hanstorp, D

    2012-01-01

    The negative ion of cerium has been investigated with tunable infrared laser photodetachment spectroscopy over selected photon energy ranges between 0.56 − 0.70 eV. The spectrum reveals several sharp peaks due to negative ion resonances and possible bound-bound transitions in Ce − . The newly observed transitions, together with our previous measurements, provide insight into the rich near-threshold spectrum of this lanthanide negative ion.

  14. Combinatorial optimization algorithms and complexity

    CERN Document Server

    Papadimitriou, Christos H

    1998-01-01

    This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering.

  15. Nuclear Science and Technology Branch report 1977

    International Nuclear Information System (INIS)

    1977-12-01

    Research programs are reported for the following divisions: Physics, Chemical Technology, Materials, Engineering Research, Isotopes, Instrumentation and Control, Health Physics Research and Applied Maths and Computing. Staff responsible for each project are indicated

  16. Nuclear science and technology branch report 1977

    International Nuclear Information System (INIS)

    1977-12-01

    A summary is given of research activities. These include: nuclear techniques of analysis, isotope techniques in hydrology, industrial applications of radioisotopes, biological and chemical applications of radiation, radiation detection and measurement, environmental studies, biophysics and radiation biology. (J.R.)

  17. Nanocrystals with linear and branched topology

    Science.gov (United States)

    Alivisatos, A. Paul; Milliron, Delia; Manna, Liberato; Hughes, Steven M.

    2007-12-04

    Disclosed herein are nanostructures comprising distinct dots and rods coupled through potential barriers of tuneable height and width, and arranged in three dimensional space at well defined angles and distances. Such control allows investigation of potential applications ranging from quantum information processing to artificial photosynthesis.

  18. Nuclear science and technology branch report 1975

    International Nuclear Information System (INIS)

    1975-10-01

    Research being conducted include: assessment of world energy sources and their utilization, basic information on fission reactors, reactor performance and safety, nuclear marine propulsion, controlled thermonuclear fusion and alternative energy sources. Staff publications and research interests are outlined. (R.L.)

  19. Nuclear science and technology branch report 1976

    International Nuclear Information System (INIS)

    1976-12-01

    Research being conducted includes: assessment of world energy sources and their utilization, basic information on fission reactors, reactor performance and safety, reviews of fission reactor technology, collaborative work on fission reactors, thermonuclear fusion and alternative energy sources. Staff publications and research interests are outlined. (J.R.)

  20. Microscopic observation of magnon bound states and their dynamics.

    Science.gov (United States)

    Fukuhara, Takeshi; Schauß, Peter; Endres, Manuel; Hild, Sebastian; Cheneau, Marc; Bloch, Immanuel; Gross, Christian

    2013-10-03

    The existence of bound states of elementary spin waves (magnons) in one-dimensional quantum magnets was predicted almost 80 years ago. Identifying signatures of magnon bound states has so far remained the subject of intense theoretical research, and their detection has proved challenging for experiments. Ultracold atoms offer an ideal setting in which to find such bound states by tracking the spin dynamics with single-spin and single-site resolution following a local excitation. Here we use in situ correlation measurements to observe two-magnon bound states directly in a one-dimensional Heisenberg spin chain comprising ultracold bosonic atoms in an optical lattice. We observe the quantum dynamics of free and bound magnon states through time-resolved measurements of two spin impurities. The increased effective mass of the compound magnon state results in slower spin dynamics as compared to single-magnon excitations. We also determine the decay time of bound magnons, which is probably limited by scattering on thermal fluctuations in the system. Our results provide a new way of studying fundamental properties of quantum magnets and, more generally, properties of interacting impurities in quantum many-body systems.

  1. Nuclear Science and Technology Branch report 1977

    International Nuclear Information System (INIS)

    Hardy, C.J.

    1977-12-01

    A report of research programs continuing in the following areas is presented: mining and treatment of uranium ores, manufacture of uranium hexafluoride, uranium enrichment, waste treatment, reprocessing and the uranium fuel cycle. Staff responsible for each project are indicated

  2. Nuclear science and technology branch report 1977

    International Nuclear Information System (INIS)

    Symonds, J.L.

    1977-12-01

    Research being conducted includes: assessment of world energy sources and their utilization, basic information on fission reactors, reactor performance and safety, reviews of fission reactor technology, collaborative work on fission reactors, thermonuclear fusion and alternative energy sources. Staff publications are also included

  3. Nuclear Science and Technology Branch report 1977

    International Nuclear Information System (INIS)

    Cawsey, W.E.T.

    1977-12-01

    This report records the technical service provided in support of research programs at the Research Establishment. Such services include HIFAR reactor operations, engineering services, information services, safety services and services provided research divisions themselves. Radioisotope production and other commercial activities are also included

  4. Nuclear science and technology branch report 1975

    International Nuclear Information System (INIS)

    Hardy, C.J.

    1975-10-01

    Research programs are reported into topics such as the mining and treatment of uranium ore, the manufacture of uranium hexafluoride, enrichment of uranium, fuel manufacture, waste treatment, reprocessing, heavy water production and the uranium fuel cycle. The names of staff responsible for each project are indicated. (R.L.)

  5. Nuclear science and technology branch report 1975

    International Nuclear Information System (INIS)

    Alder, K.F.

    1975-10-01

    Research programs are reported for the following divisions: Engineering Research, Chemical Technology, Instrumentation and Control, Materials division, Isotopes, Physics, Health Physics, Applied Mathematics and Computing, Radiation Biology Research. The names of staff responsible for each project are indicated. (R.L.)

  6. Adaptive delta management : Roots and branches

    NARCIS (Netherlands)

    Timmermans, J.S.; Haasnoot, M.; Hermans, L.M.; Kwakkel, J.H.; Rutten, M.M.; Thissen, W.A.H.

    2015-01-01

    Deltas are generally recognized as vulnerable to climate change and therefore a salient topic in adaptation science. Deltas are also highly dynamic systems viewed from physical (erosion, sedimentation, subsidence), social (demographic), economic (trade), infrastructures (transport, energy,

  7. Adaptive Delta Management : Roots and Branches

    NARCIS (Netherlands)

    Timmermans, Jos; Haasnoot, Marjolijn; Hermans, Leon; Kwakkel, Jan H.; Rutten, Maarten; Thissen, Wil A.H.; Mynett, Arthur

    2015-01-01

    Deltas are generally recognized as vulnerable to climate change and therefore a salient topic in adaptation science. Deltas are also highly dynamic systems viewed from physical (erosion, sedimentation, subsidence), social (demographic), economic (trade), infrastructures (transport, energy,

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

    Science.gov (United States)

    Ebrahimnejad, Ali

    2015-08-01

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

  9. A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem

    Directory of Open Access Journals (Sweden)

    Mio Horai

    2016-01-01

    Full Text Available We propose a new method for the specific nonlinear and nonconvex global optimization problem by using a linear relaxation technique. To simplify the specific nonlinear and nonconvex optimization problem, we transform the problem to the lower linear relaxation form, and we solve the linear relaxation optimization problem by the Branch and Bound Algorithm. Under some reasonable assumptions, the global convergence of the algorithm is certified for the problem. Numerical results show that this method is more efficient than the previous methods.

  10. Capacity Bounds for Parallel Optical Wireless Channels

    KAUST Repository

    Chaaban, Anas; Rezki, Zouheir; Alouini, Mohamed-Slim

    2016-01-01

    A system consisting of parallel optical wireless channels with a total average intensity constraint is studied. Capacity upper and lower bounds for this system are derived. Under perfect channel-state information at the transmitter (CSIT), the bounds have to be optimized with respect to the power allocation over the parallel channels. The optimization of the lower bound is non-convex, however, the KKT conditions can be used to find a list of possible solutions one of which is optimal. The optimal solution can then be found by an exhaustive search algorithm, which is computationally expensive. To overcome this, we propose low-complexity power allocation algorithms which are nearly optimal. The optimized capacity lower bound nearly coincides with the capacity at high SNR. Without CSIT, our capacity bounds lead to upper and lower bounds on the outage probability. The outage probability bounds meet at high SNR. The system with average and peak intensity constraints is also discussed.

  11. P2-16: Dual-Bound Model and the Role of Time Bound in Perceptual Decision Making

    Directory of Open Access Journals (Sweden)

    Daeseob Lim

    2012-10-01

    Full Text Available The diffusion model (DM encapsulates the dynamics of perceptual decision within a ‘diffusion field’ that is defined by a basis with sensory-evidence (SE and time vectors. At the core of the DM, it assumes that a decision is not made until an evidence particle drifts in the diffusion field and eventually hits one of the two pre-fixed bounds defined in the SE axis. This assumption dictates when and which choice is made by referring to when and which bound will be hit by the evidence particle. What if urgency pressures the decision system to make a choice even when the evidence particle has yet hit the SE bound? Previous modeling attempts at coping with time pressure, despite differences in detail, all manipulated the coordinate of SE bounds. Here, we offer a novel solution by adopting another bound on the time axis. This ‘dual-bound’ model (DBM posits that decisions can also be made when the evidence particle hits a time bound, which is determined on a trial-by-trial basis by a ‘perceived time interval’ – how long the system can stay in the ‘diffusion’ field. The classic single-bound model (SBM exhibited systematic errors in predicting both the reaction time distributions and the time-varying bias in choice. Those errors were not corrected by previously proposed variants of the SBM until the time bound was introduced. The validity of the DBM was further supported by the strong across-individual correlation between observed precision of interval timing and the predicted trial-by-trial variability of the time bound.

  12. Synthesis and characterization of an exact comb polyisoprene with three branches having the middle branch twice the molecular weight of the other two identical external branches

    KAUST Repository

    Ratkanthwar, Kedar

    2013-01-01

    An exact comb polyisoprene (PI) with three branches, with the middle branch having twice the molecular weight of the two other identical external branches, was synthesized by using anionic polymerization high vacuum techniques and appropriate chlorosilane chemistry. The synthetic approach involves (a) the selective replacement of the two chlorines of 4-(dichloromethylsilyl) diphenylethylene (DCMSDPE, key molecule) with identical PI chains by titration with PILi, (b) the addition of sec-BuLi to the double bond of DPE followed by the polymerization of isoprene from the newly created anionic site to form a 3-arm living star PI, (c) the selective replacement of the two chlorines of trichloromethylsilane with 3-arm star PI to form an H-shape intermediate, and (d) the replacement of the remaining chlorine of trichloromethylsilane by linear PI chains with double the molecular weight. All intermediate and final products were characterized via size exclusion chromatography, temperature gradient interaction chromatography and 1H-NMR spectroscopy. As expected, due to the inability to control the exact stoichiometry of the linking reactants, the main product (exact comb PI) is contaminated by a few by-products, despite the fact that anionic polymerization is the most efficient way to produce well-defined polymers. © 2013 The Royal Society of Chemistry.

  13. Crane Double Cycling in Container Ports: Algorithms, Evaluation, and Planning

    OpenAIRE

    Goodchild, Anne Victoria

    2005-01-01

    Loading ships as they are unloaded (double-cycling) can improve the efficiency of a quay crane and container port. This dissertation describes the double-cycling problem, and presents solution algorithms and simple formulae to estimate benefits. In Chapter 2 we focus on reducing the number of operations necessary to turn around a ship. First an intuitive lower bound is developed. We then present a greedy algorithm that was developed based on the physical properties of the problem and yields a...

  14. The Cramér-Rao Bounds and Sensor Selection for Nonlinear Systems with Uncertain Observations.

    Science.gov (United States)

    Wang, Zhiguo; Shen, Xiaojing; Wang, Ping; Zhu, Yunmin

    2018-04-05

    This paper considers the problems of the posterior Cramér-Rao bound and sensor selection for multi-sensor nonlinear systems with uncertain observations. In order to effectively overcome the difficulties caused by uncertainty, we investigate two methods to derive the posterior Cramér-Rao bound. The first method is based on the recursive formula of the Cramér-Rao bound and the Gaussian mixture model. Nevertheless, it needs to compute a complex integral based on the joint probability density function of the sensor measurements and the target state. The computation burden of this method is relatively high, especially in large sensor networks. Inspired by the idea of the expectation maximization algorithm, the second method is to introduce some 0-1 latent variables to deal with the Gaussian mixture model. Since the regular condition of the posterior Cramér-Rao bound is unsatisfied for the discrete uncertain system, we use some continuous variables to approximate the discrete latent variables. Then, a new Cramér-Rao bound can be achieved by a limiting process of the Cramér-Rao bound of the continuous system. It avoids the complex integral, which can reduce the computation burden. Based on the new posterior Cramér-Rao bound, the optimal solution of the sensor selection problem can be derived analytically. Thus, it can be used to deal with the sensor selection of a large-scale sensor networks. Two typical numerical examples verify the effectiveness of the proposed methods.

  15. Algorithms

    Indian Academy of Sciences (India)

    ticians but also forms the foundation of computer science. Two ... with methods of developing algorithms for solving a variety of problems but ... applications of computers in science and engineer- ... numerical calculus are as important. We will ...

  16. Agriculture and Food Processes Branch program summary document

    Energy Technology Data Exchange (ETDEWEB)

    None

    1980-06-01

    The work of the Agriculture and Food Processes Branch within the US DOE's Office of Industrial Programs is discussed and reviewed. The Branch is responsible for assisting the food and agricultural sectors of the economy in increasing their energy efficiency by cost sharing with industry the development and demonstration of technologies industry by itself would not develop because of a greater than normal risk factor, but have significant energy conservation benefits. This task is made more difficult by the diversity of agriculture and the food industry. The focus of the program is now on the development and demonstration of energy conservation technology in high energy use industry sectors and agricultural functions (e.g., sugar processing, meat processing, irrigation, and crop drying, high energy use functions common to many sectors of the food industry (e.g., refrigeration, drying, and evaporation), and innovative concepts (e.g., energy integrated farm systems. Specific projects within the program are summarized. (LCL)

  17. Algorithms for detecting and analysing autocatalytic sets.

    Science.gov (United States)

    Hordijk, Wim; Smith, Joshua I; Steel, Mike

    2015-01-01

    Autocatalytic sets are considered to be fundamental to the origin of life. Prior theoretical and computational work on the existence and properties of these sets has relied on a fast algorithm for detectingself-sustaining autocatalytic sets in chemical reaction systems. Here, we introduce and apply a modified version and several extensions of the basic algorithm: (i) a modification aimed at reducing the number of calls to the computationally most expensive part of the algorithm, (ii) the application of a previously introduced extension of the basic algorithm to sample the smallest possible autocatalytic sets within a reaction network, and the application of a statistical test which provides a probable lower bound on the number of such smallest sets, (iii) the introduction and application of another extension of the basic algorithm to detect autocatalytic sets in a reaction system where molecules can also inhibit (as well as catalyse) reactions, (iv) a further, more abstract, extension of the theory behind searching for autocatalytic sets. (i) The modified algorithm outperforms the original one in the number of calls to the computationally most expensive procedure, which, in some cases also leads to a significant improvement in overall running time, (ii) our statistical test provides strong support for the existence of very large numbers (even millions) of minimal autocatalytic sets in a well-studied polymer model, where these minimal sets share about half of their reactions on average, (iii) "uninhibited" autocatalytic sets can be found in reaction systems that allow inhibition, but their number and sizes depend on the level of inhibition relative to the level of catalysis. (i) Improvements in the overall running time when searching for autocatalytic sets can potentially be obtained by using a modified version of the algorithm, (ii) the existence of large numbers of minimal autocatalytic sets can have important consequences for the possible evolvability of

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

    Science.gov (United States)

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

    2011-05-01

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

  19. Opposite Degree Algorithm and Its Applications

    Directory of Open Access Journals (Sweden)

    Xiao-Guang Yue

    2015-12-01

    Full Text Available The opposite (Opposite Degree, referred to as OD algorithm is an intelligent algorithm proposed by Yue Xiaoguang et al. Opposite degree algorithm is mainly based on the concept of opposite degree, combined with the idea of design of neural network and genetic algorithm and clustering analysis algorithm. The OD algorithm is divided into two sub algorithms, namely: opposite degree - numerical computation (OD-NC algorithm and opposite degree - Classification computation (OD-CC algorithm.

  20. A gauged baby Skyrme model and a novel BPS bound

    International Nuclear Information System (INIS)

    Adam, C; Naya, C; Sanchez-Guillen, J; Wereszczynski, A

    2013-01-01

    The baby Skyrme model is a well-known nonlinear field theory supporting topological solitons in two space dimensions. Its action functional consist of a potential term, a kinetic term quadratic in derivatives (the 'nonlinear sigma model term') and the Skyrme term quartic in first derivatives. The limiting case of vanishing sigma model term (the so-called BPS baby Skyrme model) is known to support exact soliton solutions saturating a BPS bound which exists for this model. Further, the BPS model has infinitely many symmetries and conservation laws. Recently it was found that the gauged version of the BPS baby Skyrme model with gauge group U(1) and the usual Maxwell term, too, has a BPS bound and BPS solutions saturating this bound. This BPS bound is determined by a superpotential which has to obey a superpotential equation, in close analogy to the situation in supergravity. Further, the BPS bound and the corresponding BPS solitons only may exist for potentials such that the superpotential equation has a global solution. We also briefly describe some properties of soliton solutions.

  1. Polymers and Random graphs: Asymptotic equivalence to branching processes

    International Nuclear Information System (INIS)

    Spouge, J.L.

    1985-01-01

    In 1974, Falk and Thomas did a computer simulation of Flory's Equireactive RA/sub f/ Polymer model, rings forbidden and rings allowed. Asymptotically, the Rings Forbidden model tended to Stockmayer's RA/sub f/ distribution (in which the sol distribution ''sticks'' after gelation), while the Rings Allowed model tended to the Flory version of the RA/sub f/ distribution. In 1965, Whittle introduced the Tree and Pseudomultigraph models. We show that these random graphs generalize the Falk and Thomas models by incorporating first-shell substitution effects. Moreover, asymptotically the Tree model displays postgelation ''sticking.'' Hence this phenomenon results from the absence of rings and occurs independently of equireactivity. We also show that the Pseudomultigraph model is asymptotically identical to the Branching Process model introduced by Gordon in 1962. This provides a possible basis for the Branching Process model in standard statistical mechanics

  2. On Landauer's Principle and Bound for Infinite Systems

    Science.gov (United States)

    Longo, Roberto

    2018-04-01

    Landauer's principle provides a link between Shannon's information entropy and Clausius' thermodynamical entropy. Here we set up a basic formula for the incremental free energy of a quantum channel, possibly relative to infinite systems, naturally arising by an Operator Algebraic point of view. By the Tomita-Takesaki modular theory, we can indeed describe a canonical evolution associated with a quantum channel state transfer. Such evolution is implemented both by a modular Hamiltonian and a physical Hamiltonian, the latter being determined by its functoriality properties. This allows us to make an intrinsic analysis, extending our QFT index formula, but without any a priori given dynamics; the associated incremental free energy is related to the logarithm of the Jones index and is thus quantised. This leads to a general lower bound for the incremental free energy of an irreversible quantum channel which is half of the Landauer bound, and to further bounds corresponding to the discrete series of the Jones index. In the finite dimensional context, or in the case of DHR charges in QFT, where the dimension is a positive integer, our lower bound agrees with Landauer's bound.

  3. ACCOUNTING AS BRANCH OF KNOWLEDGE: SCIENCE, TECHNOLOGY AND PRACTICE

    OpenAIRE

    Farias, Manoel Raimundo Santana; Martins, Gilberto de Andrade

    2015-01-01

    The aim of this study was to characterize the accounting as branch of knowledge in three different fields: science, technology and practice. Through theoretical essay, we was argued that, although distinct, these fields interact, in that, as epistemology that justified the analysis here undertaken, the practical activities may be technology subject matter and that to be effective if based on one or more sciences. The difference between science and technology is given by the nature of knowledg...

  4. Chemical Composition of Sea Buckthorn Leaves, Branches and Bark

    Directory of Open Access Journals (Sweden)

    Gradt Ina

    2017-06-01

    Full Text Available Sea buckthorn leaves and branches presently create waste-/by-products of harvesting after pruning the plants. It is already known that sea buckthorn berries are important for their chemical composition and based on this occupy a wide field in nutrition. We raised the idea that sea buckthorn leaves, branches, and especially the bark, have also an extraordinary chemical composition like the berries. The aim of this study was to describe these by-products. For this purpose, detailed full analyses of corresponding samples from Russia (seven varieties and Germany (four varieties were performed. Especially the dry mass, fat content, proteins, carbohydrates, starch content, and crude fiber were investigated to obtain an overview. Minor components like total phenol content, metals, and water- and fat-soluble vitamins were also studied. All analytical parameters were based on an official collection of analysis methods (German ASU - amtliche Sammlung von Untersuchungsverfahren. The results of the full analysis of leaves and branches show some interesting aspects about the differences between male and female plants. Furthermore, we observed differences between Russian and German sea buckthorn varieties. Investigation of minor components showed that vitamins were present in very low amount (< 0.1 %.

  5. An corrigendum on the paper : Solving the job-shop scheduling problem optimally by dynamic programming (Computers and Operations Research 39(12) (2968–2977) (S0305054812000500) (10.1016/j.cor.2012.02.024))

    NARCIS (Netherlands)

    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

  6. Information-Theoretic Bounded Rationality and ε-Optimality

    Directory of Open Access Journals (Sweden)

    Daniel A. Braun

    2014-08-01

    Full Text Available Bounded rationality concerns the study of decision makers with limited information processing resources. Previously, the free energy difference functional has been suggested to model bounded rational decision making, as it provides a natural trade-off between an energy or utility function that is to be optimized and information processing costs that are measured by entropic search costs. The main question of this article is how the information-theoretic free energy model relates to simple ε-optimality models of bounded rational decision making, where the decision maker is satisfied with any action in an ε-neighborhood of the optimal utility. We find that the stochastic policies that optimize the free energy trade-off comply with the notion of ε-optimality. Moreover, this optimality criterion even holds when the environment is adversarial. We conclude that the study of bounded rationality based on ε-optimality criteria that abstract away from the particulars of the information processing constraints is compatible with the information-theoretic free energy model of bounded rationality.

  7. SkyAlign: a portable, work-efficient skyline algorithm for multicore and GPU architectures

    DEFF Research Database (Denmark)

    Bøgh, Kenneth Sejdenfaden; Chester, Sean; Assent, Ira

    2016-01-01

    The skyline operator determines points in a multidimensional dataset that offer some optimal trade-off. State-of-the-art CPU skyline algorithms exploit quad-tree partitioning with complex branching to minimise the number of point-to-point comparisons. Branch-phobic GPU skyline algorithms rely on ...... native multicore state of the art on challenging workloads by an increasing margin as more cores and sockets are utilised....

  8. Upper bound of abutment scour in laboratory and field data

    Science.gov (United States)

    Benedict, Stephen

    2016-01-01

    The U.S. Geological Survey, in cooperation with the South Carolina Department of Transportation, conducted a field investigation of abutment scour in South Carolina and used those data to develop envelope curves that define the upper bound of abutment scour. To expand on this previous work, an additional cooperative investigation was initiated to combine the South Carolina data with abutment scour data from other sources and evaluate upper bound patterns with this larger data set. To facilitate this analysis, 446 laboratory and 331 field measurements of abutment scour were compiled into a digital database. This extensive database was used to evaluate the South Carolina abutment scour envelope curves and to develop additional envelope curves that reflected the upper bound of abutment scour depth for the laboratory and field data. The envelope curves provide simple but useful supplementary tools for assessing the potential maximum abutment scour depth in the field setting.

  9. Hydroxycinnamic acid bound arabinoxylans from millet brans-structural features and antioxidant activity.

    Science.gov (United States)

    Bijalwan, Vandana; Ali, Usman; Kesarwani, Atul Kumar; Yadav, Kamalendra; Mazumder, Koushik

    2016-07-01

    Hydroxycinnamic acid bound arabinoxylans (HCA-AXs) were extracted from brans of five Indian millet varieties and response surface methodology was used to optimize the extraction conditions. The optimal condition to obtain highest yield of millet HCA-AXs was determined as follows: time 61min, temperature 66°C, ratio of solvent to sample 12ml/g. Linkage analysis indicated that hydroxycinnamic acid bound arabinoxylan from kodo millet (KM-HCA-AX) contained comparatively low branched arabinoxylan consisting of 14.6% mono-substituted, 1.2% di-substituted and 41.2% un-substituted Xylp residues. The HPLC analysis of millet HCA-AXs showed significant variation in the content of three major bound hydroxycinnamic acids (caffeic, p-coumaric and ferulic acid). The antioxidant activity of millet HCA-AXs were evaluated using three in vitro assay methods (DPPH, FRAP and β-carotene linoleate emulsion assays) which suggested both phenolic acid composition and structural characteristics of arabinoxylans could be correlated to their antioxidant potential, the detailed structural analysis revealed that low substituted KM-HCA-AX exhibited relatively higher antioxidant activity compared to other medium and highly substituted HCA-AXs from finger (FM), proso (PM), barnyard (BM) and foxtail (FOXM) millet. Copyright © 2016. Published by Elsevier B.V.

  10. Branching ratio and angular distribution of ejected electrons from Eu 4f76p1/2 n d auto-ionizing states

    International Nuclear Information System (INIS)

    Wu Xiao-Rui; Shen Li; Zhang Kai; Dai Chang-Jian; Yang Yu-Na

    2016-01-01

    The branching ratios of ions and the angular distributions of electrons ejected from the Eu 4f 7 6p 1/2 n d auto-ionizing states are investigated with the velocity-map-imaging technique. To populate the above auto-ionizing states, the relevant bound Rydberg states have to be detected first. Two new bound Rydberg states are identified in the region between 41150 cm −1 and 44580 cm −1 , from which auto-ionization spectra of the Eu 4f 7 6p 1/2 n d states are observed with isolated core excitation method. With all preparations above, the branching ratios from the above auto-ionizing states to different final ionic states and the angular distributions of electrons ejected from these processes are measured systematically. Energy dependence of branching ratios and anisotropy parameters within the auto-ionization spectra are carefully analyzed, followed by a qualitative interpretation. (paper)

  11. SM Higgs decay branching ratios and total Higgs width

    CERN Multimedia

    Daniel Denegri

    2001-01-01

    Upper: Higgs decay ratios as a function of Higgs mass. The largest branching ratio is not necessarily the most usefull one. The most usefull ones are gamma gamma bbar ZZ and WW as in those modes latter signal to background ratios can be achieved. Lower: Total Higgs decay width versus Higgs mass. At low masses the natural width is extremely small, thus observability depends on instrumental resolution primarily.

  12. Atomic Stretch: Optimally bounded real-time stretching and beyond

    DEFF Research Database (Denmark)

    Jensen, Rasmus Ramsbøl; Nielsen, Jannik Boll

    2016-01-01

    Atomic Stretch is a plugin for your preferred Adobe video editing tool, allowing real-time smooth and optimally bounded retarget-ting from and to any aspect ratio. The plugin allows preserving of high interest pixels through a protected region, attention redirection through color-modification, co......Atomic Stretch is a plugin for your preferred Adobe video editing tool, allowing real-time smooth and optimally bounded retarget-ting from and to any aspect ratio. The plugin allows preserving of high interest pixels through a protected region, attention redirection through color...

  13. Generalized mutual information and Tsirelson's bound

    Energy Technology Data Exchange (ETDEWEB)

    Wakakuwa, Eyuri [Department of Physics, Graduate School of Science, The University of Tokyo, Tokyo 113-0033 (Japan); Murao, Mio [Institute for Nano Quantum Information Electronics, The University of Tokyo, Tokyo 113-0033, Japan and Department of Physics, Graduate School of Science, The University of Tokyo, Tokyo 113-0033 (Japan)

    2014-12-04

    We introduce a generalization of the quantum mutual information between a classical system and a quantum system into the mutual information between a classical system and a system described by general probabilistic theories. We apply this generalized mutual information (GMI) to a derivation of Tsirelson's bound from information causality, and prove that Tsirelson's bound can be derived from the chain rule of the GMI. By using the GMI, we formulate the 'no-supersignalling condition' (NSS), that the assistance of correlations does not enhance the capability of classical communication. We prove that NSS is never violated in any no-signalling theory.

  14. Bound state of heavy quarks and antiquarks

    International Nuclear Information System (INIS)

    Quigg, C.

    1979-09-01

    Properties of the charmonium and upsilon families of heavy mesons are reviewed within the framework of quarkonium quantum mechanics. The implications of current data are analyzed and projections are made for heavier quarkonium families. 72 references

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

    DEFF Research Database (Denmark)

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

    2009-01-01

    In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks....... Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an IP-model for the problem, which is decomposed using Dantzig-Wolfe decomposition....... The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test...

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

    DEFF Research Database (Denmark)

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

    In this paper, we consider the Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (m-MAPTWTC). Given a set of teams and a set of tasks, the problem is to assign to each team a sequential order of tasks to maximize the total number of assigned tasks....... Both teams and tasks may be restricted by time windows outside which operation is not possible. Some tasks require cooperation between teams, and all teams cooperating must initiate execution simultaneously. We present an IP-model for the problem, which is decomposed using Dantzig-Wolfe decomposition....... The problem is solved by column generation in a Branch-and-Price framework. Simultaneous execution of tasks is enforced by the branching scheme. To test the efficiency of the proposed algorithm, 12 realistic test instances are introduced. The algorithm is able to find the optimal solution in 11 of the test...

  17. CBC bound proteins and RNA fate

    DEFF Research Database (Denmark)

    Giacometti, Simone

    ) complex (CBCN), were recently shown to target capped RNA either toward export or degradation, but the mechanisms by which they can discriminate between different RNA families and route them toward different metabolic pathways still remain unclear. A major question to be answered is how and when...... the different CBC subcomplexes are recruited to the RNP. Here, we used an individual nucleotide-resolution UV cross-linking and immunoprecipitation (iCLIP) approach to identify the transcriptome-wide targets for 5 different components of the CBCAP and CBCN complexes, and compared results to the previously...... analysed NEXT-component RBM7. We report that: (i) CBP20, ARS2, PHAX and ZC3H18 bind close to the cap, while RBM7 and MTR4 bind throughout the mRNA body; (ii) CBP20, ARS2, PHAX and ZC3H18 associate with a broad set of RNA polymerase II (PolII)-derived RNAs and have only mild species preferences; (iii...

  18. Electron waves and resonances in bounded plasmas

    CERN Document Server

    Vandenplas, Paul E

    1968-01-01

    General theoretical methods and experimental techniques ; the uniform plasma slab-condenser system ; the hollow cylindrical plasma ; scattering of a plane electromagnetic wave by a plasma column in steady magnetic fields (cold plasma approximation) ; hot non-uniform plasma column ; metallic and dielectric resonance probes, plasma-dielectric coated antenna, general considerations.

  19. Resonances and surface waves in bounded plasmas

    International Nuclear Information System (INIS)

    Bowers, K.J.; Qui, D.W.; Smith, H.B.; Birdsall, C.K.

    1999-01-01

    Surface waves provide a promising means of creating large, area plasmas. These waves can uniformly distribute the excitation energy and while presenting a small resistance and zero reactance to the driving source. Experimentally and in the simulations, the electron temperature is low (like 1--3 eV) as is the plasma potential (like 10 Te). The use of surface waves experimentally, and now industrially, to sustain large area plasma sources with device size is comparable to free space wavelength have motivated the authors to refine the theories of [1] and [2] to be fully electromagnetic. The wave dispersion predicted by the electromagnetic theory differs from the predictions of the prior theories and the results illuminate limitations of the electrostatic model. The use of surface waves have also motivated them to explore the mechanisms by which surface waves heat the plasma. In the 1d electrostatic simulations high velocity electron bunches are formed in the sheaths and are alternatively accelerated from each sheath into the bulk plasma each RF cycle. They speculate similar mechanisms provide the ionization in surface wave discharges. They also see in these simulations the plasma makes an abrupt transition from capacitively coupled to resistively coupled and the series resonance locks onto the drive frequency; these abrupt transitions resemble mode-jumping seen experimentally in large area sources. Furthermore, the density profile of the plasma tracks the drive frequency while in the resonant mode giving a new mechanism by which the plasma parameters can be controlled. They are currently investigating the effect of the driving electrode shape has on these resonances and conducting 2d simulations of a large area surface wave source to explore the ignition of surface wave devices and how the plasma fills in the device

  20. The information paradox and the locality bound

    International Nuclear Information System (INIS)

    Giddings, Steven B.; Lippert, Matthew

    2004-01-01

    Hawking's argument for information loss in black hole evaporation rests on the assumption of independent Hilbert spaces for the interior and exterior of a black hole. We argue that such independence cannot be established without incorporating strong gravitational effects that undermine locality and invalidate the use of quantum field theory in a semiclassical background geometry. These considerations should also play a role in a deeper understanding of horizon complementarity

  1. Universal extra dimensions and Kaluza-Klein bound states

    International Nuclear Information System (INIS)

    Carone, Christopher D.; Conroy, Justin M.; Sher, Marc; Turan, Ismail

    2004-01-01

    We study the bound states of the Kaluza-Klein (KK) excitations of quarks in certain models of universal extra dimensions. Such bound states may be detected at future lepton colliders in the cross section for the pair production of KK quarks near threshold. For typical values of model parameters, we find that 'KK quarkonia' have widths in the 10-100 MeV range, and production cross sections of the order of a few picobarns for the lightest resonances. Two body decays of the constituent KK quarks lead to distinctive experimental signatures. We point out that such KK resonances may be discovered before any of the higher KK modes

  2. Lower and Upper Bounds for Deniable Public-Key Encryption

    DEFF Research Database (Denmark)

    Bendlin, Rikke; Nielsen, Jesper Buus; Nordholt, Peter Sebastian

    2011-01-01

    the parties to change their internal state to make it look like a given ciphertext decrypts to a message different from what it really decrypts to. Deniable encryption was in this way introduced to allow to deny a message exchange and hence combat coercion. Depending on which parties can be coerced...... that it is impossible to construct a non-interactive bi-deniable public-key encryption scheme with better than polynomial security. Specifically, we give an explicit bound relating the security of the scheme to how efficient the scheme is in terms of key size. Our impossibility result establishes a lower bound...

  3. Quantum Gravity Mathematical Models and Experimental Bounds

    CERN Document Server

    Fauser, Bertfried; Zeidler, Eberhard

    2007-01-01

    The construction of a quantum theory of gravity is the most fundamental challenge confronting contemporary theoretical physics. The different physical ideas which evolved while developing a theory of quantum gravity require highly advanced mathematical methods. This book presents different mathematical approaches to formulate a theory of quantum gravity. It represents a carefully selected cross-section of lively discussions about the issue of quantum gravity which took place at the second workshop "Mathematical and Physical Aspects of Quantum Gravity" in Blaubeuren, Germany. This collection covers in a unique way aspects of various competing approaches. A unique feature of the book is the presentation of different approaches to quantum gravity making comparison feasible. This feature is supported by an extensive index. The book is mainly addressed to mathematicians and physicists who are interested in questions related to mathematical physics. It allows the reader to obtain a broad and up-to-date overview on ...

  4. Violence and family bounds in Phaedra's theme

    OpenAIRE

    Soares, Filipe

    2016-01-01

    UID/HIS/04666/2013 In World Culture love is presented as one the major topics explored by its intervenients. Concerning our study, it presents love and sexuality in terms of its disruptiveness: they are characterized as a force that destabilizes the status quo of human communities, leading to situations of Love/ Violence and Love/ Death. From this point of view, the Theme of Phaedra (after Thompson‟s Motif-Index) can be analysed in this perspective. Its variations allow him to adapt to dif...

  5. Quantum reading capacity: General definition and bounds

    OpenAIRE

    Das, Siddhartha; Wilde, Mark M.

    2017-01-01

    Quantum reading refers to the task of reading out classical information stored in a classical memory. In any such protocol, the transmitter and receiver are in the same physical location, and the goal of such a protocol is to use these devices, coupled with a quantum strategy, to read out as much information as possible from a classical memory, such as a CD or DVD. In this context, a memory cell is a collection of quantum channels that can be used to encode a classical message in a memory. Th...

  6. Resource-Bounded Information Acquisition and Learning

    Science.gov (United States)

    2012-05-01

    Different combinations of voting and confidence evaluation schemes...H. Wang, ... Facial Expression Decomposition..., ICCV, 2003. (E)..., H. Wang, ... Tensor Approximation..., SIGGRAPH. 2005. (F)..., H. Wang, ... High...two of the possible schemes for combining the evidence in the output space. In the first scheme, we take a majority 67 vote , i.e., the class with the

  7. Black hole bound states and their quantization

    NARCIS (Netherlands)

    de Boer, J.

    2008-01-01

    We briefly review the construction of multi-centered black hole solutions in type IIA string theory. We then discuss a decoupling limit which embeds these solutions in M-theory on AdS(3) x S-2 x CY, and discuss some aspects of their dual CFT interpretation. Finally, we consider the quantization of

  8. Linear Programming, the Simplex Algorithm and Simple Polytopes

    Directory of Open Access Journals (Sweden)

    Das Bhusan

    2010-09-01

    Full Text Available In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.

  9. Boson exchange mechanisms, bounds and asymptotic limits

    International Nuclear Information System (INIS)

    Carbotte, J.P.; Marsiglio, F.

    1989-01-01

    BCS theory predicts universal laws for the normalized thermodynamic and other properties of superconductors. The only parameter in the theory, which models the pairing interaction, can be fit to the measured size of the critical temperature and everything else follows. For example, the ratio of twice the gap edge Δ o to the critical temperature is 3.54 while the specific heat jump at T c (ΔC(T c )) normalized to the normal state value of the electronic specific heat γ o T c (with γ o the Sommerfeld constant) is 1.43. Other universal numbers also apply. In real materials, deviations from BCS laws are observed 2 - 6 which carry information on details of the microscopic parameters involved that cannot be modeled well by a constant pairing potential approximation

  10. Bayesian networks and boundedly rational expectations

    OpenAIRE

    Ran Spiegler

    2014-01-01

    I present a framework for analyzing decision makers with an imperfect understanding of their environment's correlation structure. The framework borrows the tool of "Bayesian networks", which is ubiquitous in statistics and artificial intelligence. In the model, a decision maker faces an objective multivariate probability distribution (his own action is one of the random variables). He is characterized by a directed acyclic graph over the set of random variables. His subjective belief filters ...

  11. Bose condensates make quantum leaps and bounds

    International Nuclear Information System (INIS)

    Castin, Y.; Dum, R.; Sinatra, A.

    1999-01-01

    Since the first observation in 1995 of Bose-Einstein condensation in dilute atomic gases, atomic physicists have made extraordinary progress in understanding this unusual quantum state of matter. BOSE-EINSTEIN condensation is a macroscopic quantum phenomenon that was first predicted by Albert Einstein in the 1920s, at a time when quantum theory was still developing and was being applied to microscopic systems, such as individual particles and atoms. Einstein applied the new concept of Bose statistics to an ideal gas of identical atoms that were at thermal equilibrium and trapped in a box. He predicted that at sufficiently low temperatures the particles would accumulate in the lowest quantum state in the box, giving rise to a new state of matter with many unusual properties. The crucial point of Einstein's model is the absence of interactions between the particles in the box. However, this makes his prediction difficult to test in practice. In most real systems the complicating effect of particle interactions causes the gas to solidify well before the temperature for Bose-Einstein condensation is reached. But techniques developed in the past four years have allowed physicists to form Bose-Einstein condensates for a wide range of elements. In this article the authors describe the latest advances in Bose-Einstein condensation. (UK)

  12. Power generation assets. Energy constraints, upper bounds and hedging strategies

    Energy Technology Data Exchange (ETDEWEB)

    Enge, Thomas

    2010-09-20

    The overall topic of this thesis is the valuation of power generation assets under energy and risk constraints. Our focus is on the modeling aspect i.e. to find the right balance between accuracy and computational feasibility. We define a new not yet investigated unit commitment problem that introduces an energy constraint to a thermal power plant. We define a continuous stochastic dynamic program with a nested mixed integer program (MIP). We introduce a fast implementation approach by replacing the MIP with an efficient matrix calculation and use principal component analysis to reduce the number of risk factors. We also provide a fast heuristic valuation approach for comparison. As both models can only provide lower bounds of the asset value, we investigate the theory of upper bounds for a proper validation of our power plant results. We review the primal dual algorithm for swing options by Meinshausen and Hambly and in particular clarify their notation and implementation. Then we provide an extension for swing options with multiple exercises at the same stage that we developed together with Prof. Bender, University of Braunschweig. We outline Prof. Bender's proof and describe the implementation in detail. Finally we provide a risk analysis for our thermal power plant. In particular we investigate strategies to reduce spot price risk to which power plants are significantly exposed. First, we focus on the measurement of spot price risk and propose three appropriate risk figures (Forward delta as opposed to Futures delta, synthetic spot delta and Earnings-at-Risk) and illustrate their application using a business case. Second we suggest risk mitigation strategies for both periods, before and in delivery. The latter tries to alter the dispatch policy i.e. pick less risky hours and accept a (desirably only slightly) smaller return. We introduce a benchmark that weighs risk versus return and that we will call EaR-efficient option value. We propose a mitigation

  13. Hybrid Cryptosystem Using Tiny Encryption Algorithm and LUC Algorithm

    Science.gov (United States)

    Rachmawati, Dian; Sharif, Amer; Jaysilen; Andri Budiman, Mohammad

    2018-01-01

    Security becomes a very important issue in data transmission and there are so many methods to make files more secure. One of that method is cryptography. Cryptography is a method to secure file by writing the hidden code to cover the original file. Therefore, if the people do not involve in cryptography, they cannot decrypt the hidden code to read the original file. There are many methods are used in cryptography, one of that method is hybrid cryptosystem. A hybrid cryptosystem is a method that uses a symmetric algorithm to secure the file and use an asymmetric algorithm to secure the symmetric algorithm key. In this research, TEA algorithm is used as symmetric algorithm and LUC algorithm is used as an asymmetric algorithm. The system is tested by encrypting and decrypting the file by using TEA algorithm and using LUC algorithm to encrypt and decrypt the TEA key. The result of this research is by using TEA Algorithm to encrypt the file, the cipher text form is the character from ASCII (American Standard for Information Interchange) table in the form of hexadecimal numbers and the cipher text size increase by sixteen bytes as the plaintext length is increased by eight characters.

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

    Directory of Open Access Journals (Sweden)

    Rajiv Sainath

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

  15. Optimal combinations bounds of root-square and arithmetic means ...

    Indian Academy of Sciences (India)

    Abstract. We find the greatest values α1 and α2, and the least values β1 and β2, such that the double inequalities α1S(a, b) + (1 − α1)A(a, b) 0 with a = b. As applications, we get two new bounds for the complete.

  16. An error bound estimate and convergence of the Nodal-LTS {sub N} solution in a rectangle

    Energy Technology Data Exchange (ETDEWEB)

    Hauser, Eliete Biasotto [Faculty of Mathematics, PUCRS Av Ipiranga 6681, Building 15, Porto Alegre - RS 90619-900 (Brazil)]. E-mail: eliete@pucrs.br; Pazos, Ruben Panta [Department of Mathematics, UNISC Av Independencia, 2293, room 1301, Santa Cruz do Sul - RS 96815-900 (Brazil)]. E-mail: rpp@impa.br; Tullio de Vilhena, Marco [Graduate Program in Applied Mathematics, UFRGS Av Bento Goncalves 9500, Building 43-111, Porto Alegre - RS 91509-900 (Brazil)]. E-mail: vilhena@mat.ufrgs.br

    2005-07-15

    In this work, we report the mathematical analysis concerning error bound estimate and convergence of the Nodal-LTS {sub N} solution in a rectangle. For such we present an efficient algorithm, called LTS {sub N} 2D-Diag solution for Cartesian geometry.

  17. The interplay of intrinsic and extrinsic bounded noises in biomolecular networks.

    Directory of Open Access Journals (Sweden)

    Giulio Caravagna

    Full Text Available After being considered as a nuisance to be filtered out, it became recently clear that biochemical noise plays a complex role, often fully functional, for a biomolecular network. The influence of intrinsic and extrinsic noises on biomolecular networks has intensively been investigated in last ten years, though contributions on the co-presence of both are sparse. Extrinsic noise is usually modeled as an unbounded white or colored gaussian stochastic process, even though realistic stochastic perturbations are clearly bounded. In this paper we consider Gillespie-like stochastic models of nonlinear networks, i.e. the intrinsic noise, where the model jump rates are affected by colored bounded extrinsic noises synthesized by a suitable biochemical state-dependent Langevin system. These systems are described by a master equation, and a simulation algorithm to analyze them is derived. This new modeling paradigm should enlarge the class of systems amenable at modeling. We investigated the influence of both amplitude and autocorrelation time of a extrinsic Sine-Wiener noise on: (i the Michaelis-Menten approximation of noisy enzymatic reactions, which we show to be applicable also in co-presence of both intrinsic and extrinsic noise, (ii a model of enzymatic futile cycle and (iii a genetic toggle switch. In (ii and (iii we show that the presence of a bounded extrinsic noise induces qualitative modifications in the probability densities of the involved chemicals, where new modes emerge, thus suggesting the possible functional role of bounded noises.

  18. The interplay of intrinsic and extrinsic bounded noises in biomolecular networks.

    Science.gov (United States)

    Caravagna, Giulio; Mauri, Giancarlo; d'Onofrio, Alberto

    2013-01-01

    After being considered as a nuisance to be filtered out, it became recently clear that biochemical noise plays a complex role, often fully functional, for a biomolecular network. The influence of intrinsic and extrinsic noises on biomolecular networks has intensively been investigated in last ten years, though contributions on the co-presence of both are sparse. Extrinsic noise is usually modeled as an unbounded white or colored gaussian stochastic process, even though realistic stochastic perturbations are clearly bounded. In this paper we consider Gillespie-like stochastic models of nonlinear networks, i.e. the intrinsic noise, where the model jump rates are affected by colored bounded extrinsic noises synthesized by a suitable biochemical state-dependent Langevin system. These systems are described by a master equation, and a simulation algorithm to analyze them is derived. This new modeling paradigm should enlarge the class of systems amenable at modeling. We investigated the influence of both amplitude and autocorrelation time of a extrinsic Sine-Wiener noise on: (i) the Michaelis-Menten approximation of noisy enzymatic reactions, which we show to be applicable also in co-presence of both intrinsic and extrinsic noise, (ii) a model of enzymatic futile cycle and (iii) a genetic toggle switch. In (ii) and (iii) we show that the presence of a bounded extrinsic noise induces qualitative modifications in the probability densities of the involved chemicals, where new modes emerge, thus suggesting the possible functional role of bounded noises.

  19. Combining Alphas via Bounded Regression

    Directory of Open Access Journals (Sweden)

    Zura Kakushadze

    2015-11-01

    Full Text Available We give an explicit algorithm and source code for combining alpha streams via bounded regression. In practical applications, typically, there is insufficient history to compute a sample covariance matrix (SCM for a large number of alphas. To compute alpha allocation weights, one then resorts to (weighted regression over SCM principal components. Regression often produces alpha weights with insufficient diversification and/or skewed distribution against, e.g., turnover. This can be rectified by imposing bounds on alpha weights within the regression procedure. Bounded regression can also be applied to stock and other asset portfolio construction. We discuss illustrative examples.

  20. Bounds for phase-shifts and deductions in potential scattering

    International Nuclear Information System (INIS)

    Sidharth, B.G.

    1979-01-01

    Starting from the radial Schroedinger equation and using the Cauchy-Schwarz inequality, expressions have been derived for bounds for phase-shifts in potential scattering and the deductions are verified in special cases such as the spherically symmetric square-well potential, where exact solutions are already known. (K.B.)

  1. Quasi-bound states, resonance tunnelling, and tunnelling times ...

    Indian Academy of Sciences (India)

    analysis of bound states below the threshold energy E = 0 and continuum above the threshold .... p are time reversal states of each other. Similarly, the ... are occurring at above-barrier energies and we do not treat them as QB states. They can ...

  2. Maximum and minimum entropy states yielding local continuity bounds

    Science.gov (United States)

    Hanson, Eric P.; Datta, Nilanjana

    2018-04-01

    Given an arbitrary quantum state (σ), we obtain an explicit construction of a state ρɛ * ( σ ) [respectively, ρ * , ɛ ( σ ) ] which has the maximum (respectively, minimum) entropy among all states which lie in a specified neighborhood (ɛ-ball) of σ. Computing the entropy of these states leads to a local strengthening of the continuity bound of the von Neumann entropy, i.e., the Audenaert-Fannes inequality. Our bound is local in the sense that it depends on the spectrum of σ. The states ρɛ * ( σ ) and ρ * , ɛ (σ) depend only on the geometry of the ɛ-ball and are in fact optimizers for a larger class of entropies. These include the Rényi entropy and the minimum- and maximum-entropies, providing explicit formulas for certain smoothed quantities. This allows us to obtain local continuity bounds for these quantities as well. In obtaining this bound, we first derive a more general result which may be of independent interest, namely, a necessary and sufficient condition under which a state maximizes a concave and Gâteaux-differentiable function in an ɛ-ball around a given state σ. Examples of such a function include the von Neumann entropy and the conditional entropy of bipartite states. Our proofs employ tools from the theory of convex optimization under non-differentiable constraints, in particular Fermat's rule, and majorization theory.

  3. Heterologous expression and purification of membrane-bound pyrophosphatases

    DEFF Research Database (Denmark)

    Kellosalo, J.; Kajander, T.; Palmgren, Michael Broberg

    2011-01-01

    Membrane-bound pyrophosphatases (M-PPases) are enzymes that couple the hydrolysis of inorganic pyrophosphate to pumping of protons or sodium ions. In plants and bacteria they are important for relieving stress caused by low energy levels during anoxia, drought, nutrient deficiency, cold and low l...

  4. On the anomalous characteristics in the P and R branches in a hydrogen fulcher band

    International Nuclear Information System (INIS)

    Kado, Shinichiro; Okamoto, Atsushi; Yamasaki, Daisuke; Iida, Yohei; Kajita, Shin; Shikama, Taiichi; Oishi, Tetsutaro; Tanaka, Satoru; Xiao Bingjia

    2006-01-01

    Anomalous characteristics in the P and R branches in hydrogen Fulcher-α emissions were investigated with respect to rotational temperature and population in the excited electronic state (upper-Fulcher state). The ro-vibrational population distribution of the ground electronic state was deduced by applying the coronal equilibrium to the Q branch, and then the population for the P and R branches was predicted. The anomalies in P and R branches can be found in the rotational temperature and the branching ratio between the branches. Our results suggest that the sum of the emission from P and R branches seems to agree with that predicted based on the Q branch emission. (author)

  5. Upper and lower bounds in nonrelativistic scattering theory

    International Nuclear Information System (INIS)

    Darewych, J.W.; Pooran, R.

    1980-01-01

    We consider the problem of determining rigorous upper and lower bounds to the difference between the exact and approximate scattering phase shift, for the case of central potential scattering. The present work is based on the Kato identities and the phase-amplitude formalism of potential scattering developed by Calogero. For nonstationary approximations, a new first-order (in small quantities) bound is established which is particularly useful for partial waves other than s waves. Similar, but second-order, bounds are established for approximations which are stationary. Some previous results, based on the use of the Lippman--Schwinger equation are generalized, and some new bounds are established. These are illustrated, and compared to previous results, by a simple example. We discuss the advantages and disadvantages of the present results in comparison to those derived previously. Finally, we present the generalization of some of the present formalism to the case of many-channel scattering involving many-particle systems, and discuss some of the difficulties of their practical implementation

  6. Oscillatory Critical Amplitudes in Hierarchical Models and the Harris Function of Branching Processes

    Science.gov (United States)

    Costin, Ovidiu; Giacomin, Giambattista

    2013-02-01

    Oscillatory critical amplitudes have been repeatedly observed in hierarchical models and, in the cases that have been taken into consideration, these oscillations are so small to be hardly detectable. Hierarchical models are tightly related to iteration of maps and, in fact, very similar phenomena have been repeatedly reported in many fields of mathematics, like combinatorial evaluations and discrete branching processes. It is precisely in the context of branching processes with bounded off-spring that T. Harris, in 1948, first set forth the possibility that the logarithm of the moment generating function of the rescaled population size, in the super-critical regime, does not grow near infinity as a power, but it has an oscillatory prefactor (the Harris function). These oscillations have been observed numerically only much later and, while the origin is clearly tied to the discrete character of the iteration, the amplitude size is not so well understood. The purpose of this note is to reconsider the issue for hierarchical models and in what is arguably the most elementary setting—the pinning model—that actually just boils down to iteration of polynomial maps (and, notably, quadratic maps). In this note we show that the oscillatory critical amplitude for pinning models and the Harris function coincide. Moreover we make explicit the link between these oscillatory functions and the geometry of the Julia set of the map, making thus rigorous and quantitative some ideas set forth in Derrida et al. (Commun. Math. Phys. 94:115-132, 1984).

  7. Limit Shapes and Fluctuations of Bounded Random Partitions

    DEFF Research Database (Denmark)

    Beltoft, Dan

    Random partitions of integers, bounded both in the number of summands and the size of each summand are considered, subject to the probability measure which assigns a probability proportional to some fixed positive number to the power of the number being partitioned. This corresponds to considering...

  8. Bounded Rationality and the Diffusion of Modern Investment Treaties

    DEFF Research Database (Denmark)

    Skovgaard Poulsen, Lauge

    2014-01-01

    insights on cognitive heuristics. In line with recent work on policy diffusion, it suggests that a bounded rationality framework has considerable potential to explain why, and how, developing countries have adopted modern investment treaties. To illustrate the potential of this approach, the case of South...

  9. Three-nucleon forces and the trinucleon bound states

    International Nuclear Information System (INIS)

    Friar, J.L.; Frois, B.

    1986-04-01

    A summary of the bound-state working group session of the ''International Symposium on the Three-Body Force in the Three-Nucleon System'' is presented. The experimental evidence for three-nucleon forces has centered on two ground state properties: the tritium binding energy and the trinucleon form factors. Both are discussed

  10. The bounded proof property via step algebras and step frames

    NARCIS (Netherlands)

    Bezhanishvili, N.; Ghilardi, Silvio

    2013-01-01

    We develop a semantic criterion for a specific rule-based calculus Ax axiomatizing a given logic L to have the so-called bounded proof property. This property is a kind of an analytic subformula property limiting the proof search space. Our main tools are one-step frames and one-step algebras. These

  11. Reference Service and Bounded Rationality: Helping Students with Research.

    Science.gov (United States)

    Chu, Felix T.

    1994-01-01

    In university libraries, reference librarians often get ambiguous questions to which they try to give appropriate answers. Because of limitations on resources, time, and mental capability for information processing, the decision-making process involved in answering reference questions becomes bounded by the rationality of these constraints.…

  12. The Services Sector and Economic Growth in Mauritius. A Bounds ...

    African Journals Online (AJOL)

    This paper examines the long run and short run impact of the services sector on economic growth in Mauritius. Using an augmented aggregate production function growth model, we apply the bounds testing approach to cointegration to assess the impact of different activities in the services sector on economic performance ...

  13. A lower bound for the node, edge, and arc routing problem

    DEFF Research Database (Denmark)

    Bach, Lukas; Hasle, Geir; Wøhlk, Sanne

    2013-01-01

    The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004, although similar problems have been studied before. This problem, also called the Mixed Capacitated General Routing Problem (MCGRP), generalizes the classical Capacitated Vehicle Routing Problem (CVRP......), the Capacitated Arc Routing Problem (CARP), and the General Routing Problem. It captures important aspects of real-life routing problems that were not adequately modeled in previous Vehicle Routing Problem (VRP) variants. The authors also proposed a memetic algorithm procedure and defined a set of test instances...... called the CBMix benchmark. The NEARP definition and investigation contribute to the development of rich VRPs. In this paper we present the first lower bound procedure for the NEARP. It is a further development of lower bounds for the CARP. We also define two novel sets of test instances to complement...

  14. Optical coherence tomography noise modeling and fundamental bounds on human retinal layer segmentation accuracy (Conference Presentation)

    Science.gov (United States)

    DuBose, Theodore B.; Milanfar, Peyman; Izatt, Joseph A.; Farsiu, Sina

    2016-03-01

    The human retina is composed of several layers, visible by in vivo optical coherence tomography (OCT) imaging. To enhance diagnostics of retinal diseases, several algorithms have been developed to automatically segment one or more of the boundaries of these layers. OCT images are corrupted by noise, which is frequently the result of the detector noise and speckle, a type of coherent noise resulting from the presence of several scatterers in each voxel. However, it is unknown what the empirical distribution of noise in each layer of the retina is, and how the magnitude and distribution of the noise affects the lower bounds of segmentation accuracy. Five healthy volunteers were imaged using a spectral domain OCT probe from Bioptigen, Inc, centered at 850nm with 4.6µm full width at half maximum axial resolution. Each volume was segmented by expert manual graders into nine layers. The histograms of intensities in each layer were then fit to seven possible noise distributions from the literature on speckle and image processing. Using these empirical noise distributions and empirical estimates of the intensity of each layer, the Cramer-Rao lower bound (CRLB), a measure of the variance of an estimator, was calculated for each boundary layer. Additionally, the optimum bias of a segmentation algorithm was calculated, and a corresponding biased CRLB was calculated, which represents the improved performance an algorithm can achieve by using prior knowledge, such as the smoothness and continuity of layer boundaries. Our general mathematical model can be easily adapted for virtually any OCT modality.

  15. Pittsfield Local Flood Protection, West Branch and Southwest Branch, Housatonic River, Pittsfield, Massachusetts. Detailed Project Report for Water Resources Development.

    Science.gov (United States)

    1980-10-01

    a bakery , a gas station, and the Linden Street bridge were flooded during the March 1977 storm. Flooding also occurred on the Southwest Branch...and service station, one bakery , and five other commercial establishments. Most of these structures are not suited to being elevated above the design...of a shopping plaza and a fast-food franchise in the flood plain on West Housatonic Street (Route 20). The following three alternate plans of

  16. Energy condition bounds and their confrontation with supernovae data

    International Nuclear Information System (INIS)

    Lima, M. P.; Vitenti, S.; Reboucas, M. J.

    2008-01-01

    The energy conditions play an important role in the understanding of several properties of the Universe, including the current accelerating expansion phase and the possible existence of the so-called phantom fields. We show that the integrated bounds provided by the energy conditions on cosmological observables such as the distance modulus μ(z) and the lookback time t L (z) are not sufficient (or necessary) to ensure the local fulfillment of the energy conditions, making explicit the limitation of these bounds in the confrontation with observational data. We recast the energy conditions as bounds on the deceleration and normalized Hubble parameters, obtaining new bounds which are necessary and sufficient for the local fulfillment of the energy conditions. A statistical confrontation, with 1σ-3σ confidence levels, between our bounds and supernovae data from the gold and combined samples is made for the recent past. Our analyses indicate, with 3σ confidence levels, the fulfillment of both the weak energy condition (WEC) and dominant energy condition (DEC) for z≤1 and z < or approx. 0.8, respectively. In addition, they suggest a possible recent violation of the null energy condition (NEC) with 3σ, i.e. a very recent phase of superacceleration. Our analyses also show the possibility of violation of the strong energy condition (SEC) with 3σ in the recent past (z≤1), but interestingly the q(z)-best-fit curve crosses the SEC--fulfillment divider at z≅0.67, which is a value very close to the beginning of the epoch of cosmic acceleration predicted by the standard concordance flat ΛCDM scenario.

  17. Elementary functions algorithms and implementation

    CERN Document Server

    Muller, Jean-Michel

    2016-01-01

    This textbook presents the concepts and tools necessary to understand, build, and implement algorithms for computing elementary functions (e.g., logarithms, exponentials, and the trigonometric functions). Both hardware- and software-oriented algorithms are included, along with issues related to accurate floating-point implementation. This third edition has been updated and expanded to incorporate the most recent advances in the field, new elementary function algorithms, and function software. After a preliminary chapter that briefly introduces some fundamental concepts of computer arithmetic, such as floating-point arithmetic and redundant number systems, the text is divided into three main parts. Part I considers the computation of elementary functions using algorithms based on polynomial or rational approximations and using table-based methods; the final chapter in this section deals with basic principles of multiple-precision arithmetic. Part II is devoted to a presentation of “shift-and-add” algorithm...

  18. Algorithms

    Indian Academy of Sciences (India)

    algorithm design technique called 'divide-and-conquer'. One of ... Turtle graphics, September. 1996. 5. ... whole list named 'PO' is a pointer to the first element of the list; ..... Program for computing matrices X and Y and placing the result in C *).

  19. Bounds and enhancements for negative scattering time delays

    International Nuclear Information System (INIS)

    Muga, J.G.; Egusquiza, I.L.; Damborenea, J.A.; Delgado, F.

    2002-01-01

    The time of passage of the transmitted wave packet in a tunneling collision of a quantum particle with a square potential barrier becomes independent of the barrier width in a range of barrier thickness. This is the Hartman effect, which has been frequently associated with 'superluminality'. A fundamental limitation on the effect is set by nonrelativistic 'causality conditions'. We demonstrate first that the causality conditions impose more restrictive bounds on the negative time delays (time advancements) when no bound states are present. These restrictive bounds are in agreement with a naive, and generally false, causality argument based on the positivity of the 'extrapolated phase time', one of the quantities proposed to characterize the duration of the barrier's traversal. Nevertheless, square wells may in fact lead to much larger advancements than square barriers. We point out that close to the thresholds of new bound states, the time advancement increases considerably, while, at the same time, the transmission probability is large, which facilitates the possible observation of the enhanced time advancement

  20. Quantum algorithms and learning theory

    NARCIS (Netherlands)

    Arunachalam, S.

    2018-01-01

    This thesis studies strengths and weaknesses of quantum computers. In the first part we present three contributions to quantum algorithms. 1) consider a search space of N elements. One of these elements is "marked" and our goal is to find this. We describe a quantum algorithm to solve this problem

  1. Algorithms

    Indian Academy of Sciences (India)

    polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used to describe an algorithm for execution on a computer. An algorithm expressed using a programming.

  2. π0 decay branching ratios of 5ΛHe and 12ΛC hypernuclei

    International Nuclear Information System (INIS)

    Okada, S.; Ajimura, S.; Aoki, K.; Banu, A.; Bhang, H.C.; Fukuda, T.; Hashimoto, O.; Hwang, J.I.; Kameoka, S.; Kang, B.H.; Kim, E.H.; Kim, J.H.; Kim, M.J.; Maruta, T.; Miura, Y.; Miyake, Y.; Nagae, T.; Nakamura, M.; Nakamura, S.N.; Noumi, H.; Okayasu, Y.; Outa, H.; Park, H.; Saha, P.K.; Sato, Y.; Sekimoto, M.; Takahashi, T.; Tamura, H.; Tanida, K.; Toyoda, A.; Tsukada, K.; Watanabe, T.; Yim, H.J.

    2005-01-01

    We precisely measured π0 branching ratios of 5 Λ He and 12 Λ C hypernuclei produced via the (π+,K+) reaction. Using these π0 branching ratios with the π- branching ratios and lifetimes, we obtained the π0 decay widths and the non-mesonic weak decay widths with an accuracy of ∼5% (stat) for both hypernuclei

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2017-02-07

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

  4. Long-branch attraction bias and inconsistency in Bayesian phylogenetics.

    Science.gov (United States)

    Kolaczkowski, Bryan; Thornton, Joseph W

    2009-12-09

    Bayesian inference (BI) of phylogenetic relationships uses the same probabilistic models of evolution as its precursor maximum likelihood (ML), so BI has generally been assumed to share ML's desirable statistical properties, such as largely unbiased inference of topology given an accurate model and increasingly reliable inferences as the amount of data increases. Here we show that BI, unlike ML, is biased in favor of topologies that group long branches together, even when the true model and prior distributions of evolutionary parameters over a group of phylogenies are known. Using experimental simulation studies and numerical and mathematical analyses, we show that this bias becomes more severe as more data are analyzed, causing BI to infer an incorrect tree as the maximum a posteriori phylogeny with asymptotically high support as sequence length approaches infinity. BI's long branch attraction bias is relatively weak when the true model is simple but becomes pronounced when sequence sites evolve heterogeneously, even when this complexity is incorporated in the model. This bias--which is apparent under both controlled simulation conditions and in analyses of empirical sequence data--also makes BI less efficient and less robust to the use of an incorrect evolutionary model than ML. Surprisingly, BI's bias is caused by one of the method's stated advantages--that it incorporates uncertainty about branch lengths by integrating over a distribution of possible values instead of estimating them from the data, as ML does. Our findings suggest that trees inferred using BI should be interpreted with caution and that ML may be a more reliable framework for modern phylogenetic analysis.

  5. Long-branch attraction bias and inconsistency in Bayesian phylogenetics.

    Directory of Open Access Journals (Sweden)

    Bryan Kolaczkowski

    Full Text Available Bayesian inference (BI of phylogenetic relationships uses the same probabilistic models of evolution as its precursor maximum likelihood (ML, so BI has generally been assumed to share ML's desirable statistical properties, such as largely unbiased inference of topology given an accurate model and increasingly reliable inferences as the amount of data increases. Here we show that BI, unlike ML, is biased in favor of topologies that group long branches together, even when the true model and prior distributions of evolutionary parameters over a group of phylogenies are known. Using experimental simulation studies and numerical and mathematical analyses, we show that this bias becomes more severe as more data are analyzed, causing BI to infer an incorrect tree as the maximum a posteriori phylogeny with asymptotically high support as sequence length approaches infinity. BI's long branch attraction bias is relatively weak when the true model is simple but becomes pronounced when sequence sites evolve heterogeneously, even when this complexity is incorporated in the model. This bias--which is apparent under both controlled simulation conditions and in analyses of empirical sequence data--also makes BI less efficient and less robust to the use of an incorrect evolutionary model than ML. Surprisingly, BI's bias is caused by one of the method's stated advantages--that it incorporates uncertainty about branch lengths by integrating over a distribution of possible values instead of estimating them from the data, as ML does. Our findings suggest that trees inferred using BI should be interpreted with caution and that ML may be a more reliable framework for modern phylogenetic analysis.

  6. Optimized Ultrawideband and Uniplanar Minkowski Fractal Branch Line Coupler

    Directory of Open Access Journals (Sweden)

    Mohammad Jahanbakht

    2012-01-01

    Full Text Available The non-Euclidean Minkowski fractal geometry is used in design, optimization, and fabrication of an ultrawideband (UWB branch line coupler. Self-similarities of the fractal geometries make them act like an infinite length in a finite area. This property creates a smaller design with broader bandwidth. The designed 3 dB microstrip coupler has a single layer and uniplanar platform with quite easy fabrication process. This optimized 180° coupler also shows a perfect isolation and insertion loss over the UWB frequency range of 3.1–10.6 GHz.

  7. Tau reconstruction and identification algorithm

    Indian Academy of Sciences (India)

    CMS has developed sophisticated tau identification algorithms for tau hadronic decay modes. Production of tau lepton decaying to hadrons are studied at 7 TeV centre-of-mass energy with 2011 collision data collected by CMS detector and has been used to measure the performance of tau identification algorithms by ...

  8. Semileptonic Branching Fractions of Charged and Neutral B Mesons

    International Nuclear Information System (INIS)

    Athanas, M.; Brower, W.; Masek, G.; Paar, H.P.; Gronberg, J.; Kutschke, R.; Menary, S.; Morrison, R.J.; Nakanishi, S.; Nelson, H.N.; Nelson, T.K.; Qiao, C.; Richman, J.D.; Ryd, A.; Tajima, H.; Sperka, D.; Witherell, M.S.; Balest, R.; Cho, K.; Ford, W.T.; Johnson, D.R.; Lingel, K.; Lohner, M.; Rankin, P.; Smith, J.G.; Alexander, J.P.; Bebek, C.; Berkelman, K.; Bloom, K.; Browder, T.E.; Cassel, D.G.; Cho, H.A.; Coffman, D.M.; Crowcroft, D.S.; Drell, P.S.; Dumas, D.; Ehrlich, R.; Gaidarev, P.; Garcia-Sciveres, M.; Geiser, B.; Gittelman, B.; Gray, S.W.; Hartill, D.L.; Heltsley, B.K.; Henderson, S.; Jones, C.D.; Jones, S.L.; Kandaswamy, J.; Katayama, N.; Kim, P.C.; Kreinick, D.L.; Ludwig, G.S.; Masui, J.; Mevissen, J.; Mistry, N.B.; Ng, C.R.; Nordberg, E.; Patterson, J.R.; Peterson, D.; Riley, D.; Salman, S.; Sapper, M.; Wuerthwein, F.; Avery, P.; Freyberger, A.; Rodriguez, J.; Yang, S.; Yelton, J.; Cinabro, D.; Liu, T.; Saulnier, M.; Wilson, R.; Yamamoto, H.; Bergfeld, T.; Eisenstein, B.I.; Gollin, G.; Ong, B.; Palmer, M.; Selen, M.; Thaler, J.J.; Edwards, K.W.; Ogg, M.; Bellerive, A.; Britton, D.I.; Hyatt, E.R.F.; MacFarlane, D.B.; Patel, P.M.; Spaan, B.; Sadoff, A.J.; Ammar, R.; Baringer, P.; Bean, A.; Besson, D.; Coppage, D.; Copty, N.; Davis, R.; Hancock, N.; Kelly, M.; Kotov, S.; Kravchenko, I.; Kwak, N.; Lam, H.; Kubota, Y.; Lattery, M.; Momayezi, M.; Nelson, J.K.; Patton, S.; Poling, R.; Savinov, V.; Schrenk, S.; Wang, R.; Alam, M.S.; Kim, I.J.; Ling, Z.; Mahmood, A.H.; O'Neill, J.J.; Severini, H.; Sun, C.R.; Wappler, F.; Crawford, G.; Daubenmier, C.M.; Fulton, R.; Fujino, D.; Gan, K.K.; Honscheid, K.; Kagan, H.; Kass, R.; Lee, J.; Malchow, R.; Skovpen, Y.; Sung, M.; White, C.; Zoeller, M.M.; Butler, F.; Fu, X.; Nemati, B.; Ross, W.R.; Skubic, P.; Wood, M.; Bishai, M.; Fast, J.; Gerndt, E.; McIlwain, R.L.; Miao, T.; Miller, D.H.; Modesitt, M.; Payne, D.; Shibata, E.I.; Shipsey, I.P.J.; Wang, P.N.; Battle, M.; Ernst, J.; Gibbons, L.; Kwon, Y.

    1994-01-01

    An examination of leptons in Υ(4S) events tagged by reconstructed B meson decays yields semileptonic branching fractions of b - =(10.1±1.8±1.5)% for charged and b 0 =(10.9±0.7±1.1)% for neutral B mesons. This is the first measurement for charged B mesons. Assuming equality of the charged and neutral semileptonic widths, the ratio b - /b 0 =0.93±0.18±0.12 is equivalent to the ratio of lifetimes

  9. A new algorithm for the integration of exponential and logarithmic functions

    Science.gov (United States)

    Rothstein, M.

    1977-01-01

    An algorithm for symbolic integration of functions built up from the rational functions by repeatedly applying either the exponential or logarithm functions is discussed. This algorithm does not require polynomial factorization nor partial fraction decomposition and requires solutions of linear systems with only a small number of unknowns. It is proven that if this algorithm is applied to rational functions over the integers, a computing time bound for the algorithm can be obtained which is a polynomial in a bound on the integer length of the coefficients, and in the degrees of the numerator and denominator of the rational function involved.

  10. Algorithms

    Indian Academy of Sciences (India)

    algorithm that it is implicitly understood that we know how to generate the next natural ..... Explicit comparisons are made in line (1) where maximum and minimum is ... It can be shown that the function T(n) = 3/2n -2 is the solution to the above ...

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

  12. Exponential Lower Bounds For Policy Iteration

    OpenAIRE

    Fearnley, John

    2010-01-01

    We study policy iteration for infinite-horizon Markov decision processes. It has recently been shown policy iteration style algorithms have exponential lower bounds in a two player game setting. We extend these lower bounds to Markov decision processes with the total reward and average-reward optimality criteria.

  13. Vegetation survey of Pen Branch and Four Mile Creek wetlands

    Energy Technology Data Exchange (ETDEWEB)

    1992-01-01

    One hundred-fifty plots were recently sampled (vegetational sampling study) at the Savannah River Site (SRS). An extensive characterization of the vascular flora, in four predetermined strata (overstory, Understory, shrub layer, and ground cover), was undertaken to determine dominance, co-dominance, and the importance value (I.V.) of each species. These results will be used by the Savannah River Laboratory (SRL) to evaluate the environmental status of Four Mile Creek, Pen Branch, and two upland pine stands. Objectives of this study were to: Describe in detail the plant communities previously mapped with reference to the topography and drainage, including species of plants present: Examine the successional trends within each sampling area and describe the extent to which current vegetation communities have resulted from specific earlier vegetation disturbances (e.g., logging and grazing); describe in detail the botanical field techniques used to sample the flora; describe the habitat and location of protected and/or rare species of plants; and collect and prepare plant species as herbarium quality specimens. Sampling was conducted at Four Mile Creek and Pen Branch, and in two upland pine plantations of different age growth.

  14. Vegetation survey of Pen Branch and Four Mile Creek wetlands

    Energy Technology Data Exchange (ETDEWEB)

    1992-10-01

    One hundred-fifty plots were recently sampled (vegetational sampling study) at the Savannah River Site (SRS). An extensive characterization of the vascular flora, in four predetermined strata (overstory, Understory, shrub layer, and ground cover), was undertaken to determine dominance, co-dominance, and the importance value (I.V.) of each species. These results will be used by the Savannah River Laboratory (SRL) to evaluate the environmental status of Four Mile Creek, Pen Branch, and two upland pine stands. Objectives of this study were to: Describe in detail the plant communities previously mapped with reference to the topography and drainage, including species of plants present: Examine the successional trends within each sampling area and describe the extent to which current vegetation communities have resulted from specific earlier vegetation disturbances (e.g., logging and grazing); describe in detail the botanical field techniques used to sample the flora; describe the habitat and location of protected and/or rare species of plants; and collect and prepare plant species as herbarium quality specimens. Sampling was conducted at Four Mile Creek and Pen Branch, and in two upland pine plantations of different age growth.

  15. On a branch-and-bound approach for a Huff-like Stackelberg location problem

    NARCIS (Netherlands)

    Sáiz Pérez, M.E.; Hendrix, E.M.T.; Fernández, J.; Pelegrin, B.

    2009-01-01

    Modelling the location decision of two competing firms that intend to build a new facility in a planar market can be done by a Huff-like Stackelberg location problem. In a Huff-like model, the market share captured by a firm is given by a gravity model determined by distance calculations to

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

    Science.gov (United States)

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

    2018-04-01

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

  17. Advanced Branching Control and Characterization of Inorganic Semiconducting Nanocrystals

    Energy Technology Data Exchange (ETDEWEB)

    Hughes, Steven Michael [Univ. of California, Berkeley, CA (United States)

    2007-01-01

    The ability to finely tune the size and shape of inorganic semiconducting nanocrystals is an area of great interest, as the more control one has, the more applications will be possible for their use. The first two basic shapes develped in nanocrystals were the sphere and the anistropic nanorod. the II_VI materials being used such as Cadmium Selenide (CdSe) and Cadmium Telluride (CdTe), exhibit polytypism, which allows them to form in either the hexagonally packed wurtzite or cubically packed zinc blende crystalline phase. The nanorods are wurtzite with the length of the rod growing along the c-axis. As this grows, stacking faults may form, which are layers of zinc blende in the otherwise wurtzite crystal. Using this polytypism, though, the first generation of branched crystals were developed in the form of the CdTe tetrapod. This is a nanocrystal that nucleates in the zincblend form, creating a tetrahedral core, on which four wurtzite arms are grown. This structure opened up the possibility of even more complex shapes and applications. This disseration investigates the advancement of branching control and further understanding the materials polytypism in the form of the stacking faults in nanorods.

  18. Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation

    DEFF Research Database (Denmark)

    Uchoa, Eduardo; Fukasawa, Ricardo; Lysgaard, Jens

    This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arborescence problem in order to make it solvable in pseudo......-polynomial time. Traditional inequalities over the arc formulation, like Capacity Cuts, are also used. Moreover, a novel feature is introduced in such kind of algorithms. Powerful new cuts expressed over a very large set of variables could be added, without increasing the complexity of the pricing subproblem...

  19. Bounds and asymptotics for orthogonal polynomials for varying weights

    CERN Document Server

    Levin, Eli

    2018-01-01

    This book establishes bounds and asymptotics under almost minimal conditions on the varying weights, and applies them to universality limits and entropy integrals.  Orthogonal polynomials associated with varying weights play a key role in analyzing random matrices and other topics.  This book will be of use to a wide community of mathematicians, physicists, and statisticians dealing with techniques of potential theory, orthogonal polynomials, approximation theory, as well as random matrices. .

  20. Bound states and scattering in four-body systems

    International Nuclear Information System (INIS)

    Narodetsky, I.M.

    1979-01-01

    It is the purpose of this review to provide the clear and elementary introduction in the integral equation method and to demonstrate explicitely its usefulness for the physical applications. The existing results concerning the application of the integral equation technique for the four-nucleon bound states and scattering are reviewed.The treatment is based on the quasiparticle approach that permits the simple interpretation of the equations in terms of quasiparticle scattering. The mathematical basis for the quasiparticle approach is the Hilbert-Schmidt theorem of the Fredholm integral equation theory. This paper contains the detailed discussion of the Hilbert-Schmidt expansion as applied to the 2-particle amplitudes and to the 3 + 1 and 2 + 2 amplitudes which are the kernels of the four-body equations. The review contains essentially the discussion of the four-body quasiparticle equations and results obtained for bound states and scattering

  1. Bound states in strongly correlated magnetic and electronic systems

    International Nuclear Information System (INIS)

    Trebst, S.

    2002-02-01

    A novel strong coupling expansion method to calculate two-particle spectra of quantum lattice models is developed. The technique can be used to study bosonic and fermionic models and in principle it can be applied to systems in any dimension. A number of strongly correlated magnetic and electronic systems are examined including the two-leg spin-half Heisenberg ladder, the dimerized Heisenberg chain with a frustrating next-nearest neighbor interaction, coupled Heisenberg ladders, and the one-dimensional Kondo lattice model. In the various models distinct bound states are found below the two-particle continuum. Quantitative calculations of the dispersion, coherence length and binding energy of these bound states are used to describe spectroscopic experiments on (Ca,La) 14 Cu 24 O 41 and NaV 2 O 5 . (orig.)

  2. BCDP: Budget Constrained and Delay-Bounded Placement for Hybrid Roadside Units in Vehicular Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Peng Li

    2014-11-01

    Full Text Available In vehicular ad hoc networks, roadside units (RSUs placement has been proposed to improve the the overall network performance in many ITS applications. This paper addresses the budget constrained and delay-bounded placement problem (BCDP for roadside units in vehicular ad hoc networks. There are two types of RSUs: cable connected RSU (c-RSU and wireless RSU (w-RSU. c-RSUs are interconnected through wired lines, and they form the backbone of VANETs, while w-RSUs connect to other RSUs through wireless communication and serve as an economical extension of the coverage of c-RSUs. The delay-bounded coverage range and deployment cost of these two cases are totally different. We are given a budget constraint and a delay bound, the problem is how to find the optimal candidate sites with the maximal delay-bounded coverage to place RSUs such that a message from any c-RSU in the region can be disseminated to the more vehicles within the given budget constraint and delay bound. We first prove that the BCDP problem is NP-hard. Then we propose several algorithms to solve the BCDP problem. Simulation results show the heuristic algorithms can significantly improve the coverage range and reduce the total deployment cost, compared with other heuristic methods.

  3. Quantum Computations: Fundamentals and Algorithms

    International Nuclear Information System (INIS)

    Duplij, S.A.; Shapoval, I.I.

    2007-01-01

    Basic concepts of quantum information theory, principles of quantum calculations and the possibility of creation on this basis unique on calculation power and functioning principle device, named quantum computer, are concerned. The main blocks of quantum logic, schemes of quantum calculations implementation, as well as some known today effective quantum algorithms, called to realize advantages of quantum calculations upon classical, are presented here. Among them special place is taken by Shor's algorithm of number factorization and Grover's algorithm of unsorted database search. Phenomena of decoherence, its influence on quantum computer stability and methods of quantum errors correction are described

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

    Science.gov (United States)

    Li, Yuzhong

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

  5. Pair condensation and bound states in fermionic systems

    International Nuclear Information System (INIS)

    Sedrakian, Armen; Clark, John W.

    2006-01-01

    We study the finite temperature-density phase diagram of an attractive fermionic system that supports two-body (dimer) and three-body (trimer) bound states in free space. Using interactions characteristic for nuclear systems, we obtain the critical temperature T c2 for the superfluid phase transition and the limiting temperature T c3 for the extinction of trimers. The phase diagram features a Cooper-pair condensate in the high-density, low-temperature domain which, with decreasing density, crosses over to a Bose condensate of strongly bound dimers. The high-temperature, low-density domain is populated by trimers whose binding energy decreases toward the density-temperature domain occupied by the superfluid and vanishes at a critical temperature T c3 >T c2

  6. Chromatin-bound RNA and the neurobiology of psychiatric disease.

    Science.gov (United States)

    Tushir, J S; Akbarian, S

    2014-04-04

    A large, and still rapidly expanding literature on epigenetic regulation in the nervous system has provided fundamental insights into the dynamic regulation of DNA methylation and post-translational histone modifications in the context of neuronal plasticity in health and disease. Remarkably, however, very little is known about the potential role of chromatin-bound RNAs, including many long non-coding transcripts and various types of small RNAs. Here, we provide an overview on RNA-mediated regulation of chromatin structure and function, with focus on histone lysine methylation and psychiatric disease. Examples of recently discovered chromatin-bound long non-coding RNAs important for neuronal health and function include the brain-derived neurotrophic factor antisense transcript (Bdnf-AS) which regulates expression of the corresponding sense transcript, and LOC389023 which is associated with human-specific histone methylation signatures at the chromosome 2q14.1 neurodevelopmental risk locus by regulating expression of DPP10, an auxillary subunit for voltage-gated K(+) channels. We predict that the exploration of chromatin-bound RNA will significantly advance our current knowledge base in neuroepigenetics and biological psychiatry. Copyright © 2013 IBRO. Published by Elsevier Ltd. All rights reserved.

  7. Ataques de nervios: culturally bound and distinct from panic attacks?

    Science.gov (United States)

    Keough, Meghan E; Timpano, Kiara R; Schmidt, Norman B

    2009-01-01

    The Diagnostic and Statistical Manual of Mental Disorders [DSM-IV-TR; American Psychiatric Association [APA], 2000) has emphasized the importance of understanding psychopathology within a cultural framework by including culture-bound syndromes within its appendices. These syndromes are proposed to be bound to certain cultures and distinct from other psychological disorders. Included among the syndromes are ataques de nervios (ADN), which are reported to be bound to the Hispanic culture and closely resemble panic attacks. However, the cultural distinctiveness and phenomenology of ADN has not been adequately investigated. The current study employed an ethnically diverse study sample (N=342) of undergraduates. Participants completed a number of measures that assessed acculturation, syndrome and anxiety risk factors. In contrast to the DSM-IV's conceptualization of ADN, the rate of ADN did not significantly vary across the three main groups (African American, Caucasian, and Hispanic participants) nor did it vary based on acculturation. More consistent with the DSM-IV, the symptom comparisons indicated some differentiation between ADN and panic attacks. The present report provides data indicating that ADNs, as described by the DSM-IV, are not unique to the Hispanic culture and are experienced by non-Hispanic individuals at similar rates to Hispanic-endorsement. The findings are consistent with the DSM-IV assertion that ADNs and PAs are distinct syndromes. (c) 2008 Wiley-Liss, Inc.

  8. QCD bound states at finite temperature and baryon number

    International Nuclear Information System (INIS)

    Kalinovsky, Yu.L.; Muenchow, L.

    1991-04-01

    Quark-antiquark bound states are described within the Bethe-Salpeter equation for a class of quark models with instantaneous 4-quark interaction at finite temperature. Thereby decompositions of the Bethe-Salpeter vertex and wave functions according to their Lorentz structures and the particles content are used. As an application of general scheme, we determine the mass spectrum of low-lying mesons for a special Nambu-Jona-Lasinio model inspired by QCD for hadrons. (orig.)

  9. Minimal Z' models: present bounds and early LHC reach

    International Nuclear Information System (INIS)

    Salvioni, Ennio; Zwirner, Fabio; Villadoro, Giovanni

    2009-01-01

    We consider 'minimal' Z' models, whose phenomenology is controlled by only three parameters beyond the Standard Model ones: the Z' mass and two effective coupling constants. They encompass many popular models motivated by grand unification, as well as many arising in other theoretical contexts. This parameterization takes also into account both mass and kinetic mixing effects, which we show to be sizable in some cases. After discussing the interplay between the bounds from electroweak precision tests and recent direct searches at the Tevatron, we extend our analysis to estimate the early LHC discovery potential. We consider a center-of-mass energy from 7 towards 10 TeV and an integrated luminosity from 50 to several hundred pb -1 , taking all existing bounds into account. We find that the LHC will start exploring virgin land in parameter space for M Z' around 700 GeV, with lower masses still excluded by the Tevatron and higher masses still excluded by electroweak precision tests. Increasing the energy up to 10 TeV, the LHC will start probing a wider range of Z' masses and couplings, although several hundred pb -1 will be needed to explore the regions of couplings favored by grand unification and to overcome the Tevatron bounds in the mass region around 250 GeV.

  10. Resource Loading by Branch-and-Price Techniques

    NARCIS (Netherlands)

    Hans, Elias W.

    2001-01-01

    The main contribution of this thesis is twofold. First, we propose a modeling approach that offers a generic framework to formulate various types of resource loading and RCCP problems as ILP models. Second, we propose various algorithms that can solve problems of reasonable size, i.e., typically

  11. Some bounds on pion-scattering amplitudes and their applications

    International Nuclear Information System (INIS)

    Chung, B.K.; Vinh Mau, R.

    1976-01-01

    If one uses the method introduced by Meinam and further developed by Martin, together with unitarity crossing symmetry and analyticity, upper and lower bounds to the πdeg πged scattering amplitudes inside the Mandelstam triangle are obtained in terms of the scattering lengths. These bounds are used to set a lower bound to the renormalized pion coupling constant lambda. In terms of the D-wave scattering length a 2 , the results are a 0 greater than or equal to -23.18 square root a 2 + 129.07a 2 and -7.71 square root a 2 less than or equal to lambda less than or equal to 7.71 square root a 2 +2.5a 2 . For a 2 =7.10 -4 they yield a 2 greater than or equal to -0.52 and lambda less than or equal to 0.20 where the pion, mass is set equal to unity

  12. Bound and resonant states in Coulomb-like potentials

    International Nuclear Information System (INIS)

    Papp, Z.

    1985-12-01

    The potential separable expansion method was generalized for calculating bound and resonant states in Coulomb-like potentials. The complete set of Coulomb-Sturmian functions was taken as the basis to expand the short-range potential. On this basis the matrix elements of the Coulomb-Green functions were given in closed form as functions of the (complex) energy. The feasibility of the method is demonstrated by a numerical example. (author)

  13. Shell closures, loosely bound structures, and halos in exotic nuclei

    International Nuclear Information System (INIS)

    Saxena, G.; Singh, D.

    2013-01-01

    Inspired by the recent experiments indicating doubly magic nuclei that lie near the drip-line and encouraged by the success of our relativistic mean-field (RMF) plus state-dependent BCS approach to the description of the ground-state properties of drip-line nuclei, we develop this approach further, across the entire periodic table, to explore magic nuclei, loosely bound structures, and halo formation in exotic nuclei. In our RMF+BCS approach, the single-particle continuum corresponding to the RMF is replaced by a set of discrete positive-energy states for the calculations of pairing energy. Detailed analysis of the single-particle spectrum, pairing energies, and densities of the nuclei predict the unusual proton shell closures at proton numbers Z = 6, 14, 16, 34, and unusual neutron shell closures at neutron numbers N = 6, 14, 16, 34, 40, 70, 112. Further, in several nuclei like the neutron-rich isotopes of Ca, Zr, Mo, etc., the gradual filling of lowlying single-particle resonant state together with weakly bound single-particle states lying close to the continuum threshold helps accommodate more neutrons but with an extremely small increase in the binding energy. This gives rise to the occurrence of loosely bound systems of neutron-rich nuclei with a large neutron-to-proton ratio. In general, the halo-like formation, irrespective of the existence of any resonant state, is seen to be due to the large spatial extension of the wave functions for the weakly bound single-particle states with low orbital angular momentum having very small or no centrifugal barriers.

  14. Shell closures, loosely bound structures, and halos in exotic nuclei

    Energy Technology Data Exchange (ETDEWEB)

    Saxena, G., E-mail: gauravphy@gmail.com [Govt. Women Engineering College, Department of Physics (India); Singh, D. [University of Rajasthan, Department of Physics (India)

    2013-04-15

    Inspired by the recent experiments indicating doubly magic nuclei that lie near the drip-line and encouraged by the success of our relativistic mean-field (RMF) plus state-dependent BCS approach to the description of the ground-state properties of drip-line nuclei, we develop this approach further, across the entire periodic table, to explore magic nuclei, loosely bound structures, and halo formation in exotic nuclei. In our RMF+BCS approach, the single-particle continuum corresponding to the RMF is replaced by a set of discrete positive-energy states for the calculations of pairing energy. Detailed analysis of the single-particle spectrum, pairing energies, and densities of the nuclei predict the unusual proton shell closures at proton numbers Z = 6, 14, 16, 34, and unusual neutron shell closures at neutron numbers N = 6, 14, 16, 34, 40, 70, 112. Further, in several nuclei like the neutron-rich isotopes of Ca, Zr, Mo, etc., the gradual filling of lowlying single-particle resonant state together with weakly bound single-particle states lying close to the continuum threshold helps accommodate more neutrons but with an extremely small increase in the binding energy. This gives rise to the occurrence of loosely bound systems of neutron-rich nuclei with a large neutron-to-proton ratio. In general, the halo-like formation, irrespective of the existence of any resonant state, is seen to be due to the large spatial extension of the wave functions for the weakly bound single-particle states with low orbital angular momentum having very small or no centrifugal barriers.

  15. Parallel algorithms and architecture for computation of manipulator forward dynamics

    Science.gov (United States)

    Fijany, Amir; Bejczy, Antal K.

    1989-01-01

    Parallel computation of manipulator forward dynamics is investigated. Considering three classes of algorithms for the solution of the problem, that is, the O(n), the O(n exp 2), and the O(n exp 3) algorithms, parallelism in the problem is analyzed. It is shown that the problem belongs to the class of NC and that the time and processors bounds are of O(log2/2n) and O(n exp 4), respectively. However, the fastest stable parallel algorithms achieve the computation time of O(n) and can be derived by parallelization of the O(n exp 3) serial algorithms. Parallel computation of the O(n exp 3) algorithms requires the development of parallel algorithms for a set of fundamentally different problems, that is, the Newton-Euler formulation, the computation of the inertia matrix, decomposition of the symmetric, positive definite matrix, and the solution of triangular systems. Parallel algorithms for this set of problems are developed which can be efficiently implemented on a unique architecture, a triangular array of n(n+2)/2 processors with a simple nearest-neighbor interconnection. This architecture is particularly suitable for VLSI and WSI implementations. The developed parallel algorithm, compared to the best serial O(n) algorithm, achieves an asymptotic speedup of more than two orders-of-magnitude in the computation the forward dynamics.

  16. Algorithms and Public Service Media

    OpenAIRE

    Sørensen, Jannick Kirk; Hutchinson, Jonathon

    2018-01-01

    When Public Service Media (PSM) organisations introduce algorithmic recommender systems to suggest media content to users, fundamental values of PSM are challenged. Beyond being confronted with ubiquitous computer ethics problems of causality and transparency, also the identity of PSM as curator and agenda-setter is challenged. The algorithms represents rules for which content to present to whom, and in this sense they may discriminate and bias the exposure of diversity. Furthermore, on a pra...

  17. Architecture, Assembly, and Emerging Applications of Branched Functional Polyelectrolytes and Poly(ionic liquid)s.

    Science.gov (United States)

    Xu, Weinan; Ledin, Petr A; Shevchenko, Valery V; Tsukruk, Vladimir V

    2015-06-17

    Branched polyelectrolytes with cylindrical brush, dendritic, hyperbranched, grafted, and star architectures bearing ionizable functional groups possess complex and unique assembly behavior in solution at surfaces and interfaces as compared to their linear counterparts. This review summarizes the recent developments in the introduction of various architectures and understanding of the assembly behavior of branched polyelectrolytes with a focus on functional polyelectrolytes and poly(ionic liquid)s with responsive properties. The branched polyelectrolytes and poly(ionic liquid)s interact electrostatically with small molecules, linear polyelectrolytes, or other branched polyelectrolytes to form assemblies of hybrid nanoparticles, multilayer thin films, responsive microcapsules, and ion-conductive membranes. The branched structures lead to unconventional assemblies and complex hierarchical structures with responsive properties as summarized in this review. Finally, we discuss prospectives for emerging applications of branched polyelectrolytes and poly(ionic liquid)s for energy harvesting and storage, controlled delivery, chemical microreactors, adaptive surfaces, and ion-exchange membranes.

  18. Dynamics of bleomycin interaction with a strongly bound hairpin DNA substrate, and implications for cleavage of the bound DNA.

    Science.gov (United States)

    Bozeman, Trevor C; Nanjunda, Rupesh; Tang, Chenhong; Liu, Yang; Segerman, Zachary J; Zaleski, Paul A; Wilson, W David; Hecht, Sidney M

    2012-10-31

    Recent studies involving DNAs bound strongly by bleomycins have documented that such DNAs are degraded by the antitumor antibiotic with characteristics different from those observed when studying the cleavage of randomly chosen DNAs in the presence of excess Fe·BLM. In the present study, surface plasmon resonance has been used to characterize the dynamics of BLM B(2) binding to a strongly bound hairpin DNA, to define the effects of Fe(3+), salt, and temperature on BLM-DNA interaction. One strong primary DNA binding site, and at least one much weaker site, were documented. In contrast, more than one strong cleavage site was found, an observation also made for two other hairpin DNAs. Evidence is presented for BLM equilibration between the stronger and weaker binding sites in a way that renders BLM unavailable to other, less strongly bound DNAs. Thus, enhanced binding to a given site does not necessarily result in increased DNA degradation at that site; i.e., for strongly bound DNAs, the facility of DNA cleavage must involve other parameters in addition to the intrinsic rate of C-4' H atom abstraction from DNA sugars.

  19. Planar graphs theory and algorithms

    CERN Document Server

    Nishizeki, T

    1988-01-01

    Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.

  20. Heterotachy and long-branch attraction in phylogenetics

    Directory of Open Access Journals (Sweden)

    Rodrigue Nicolas

    2005-10-01

    Full Text Available Abstract Background Probabilistic methods have progressively supplanted the Maximum Parsimony (MP method for inferring phylogenetic trees. One of the major reasons for this shift was that MP is much more sensitive to the Long Branch Attraction (LBA artefact than is Maximum Likelihood (ML. However, recent work by Kolaczkowski and Thornton suggested, on the basis of simulations, that MP is less sensitive than ML to tree reconstruction artefacts generated by heterotachy, a phenomenon that corresponds to shifts in site-specific evolutionary rates over time. These results led these authors to recommend that the results of ML and MP analyses should be both reported and interpreted with the same caution. This specific conclusion revived the debate on the choice of the most accurate phylogenetic method for analysing real data in which various types of heterogeneities occur. However, variation of evolutionary rates across species was not explicitly incorporated in the original study of Kolaczkowski and Thornton, and in most of the subsequent heterotachous simulations published to date, where all terminal branch lengths were kept equal, an assumption that is biologically unrealistic. Results In this report, we performed more realistic simulations to evaluate the relative performance of MP and ML methods when two kinds of heterogeneities are considered: (i within-site rate variation (heterotachy, and (ii rate variation across lineages. Using a similar protocol as Kolaczkowski and Thornton to generate heterotachous datasets, we found that heterotachy, which constitutes a serious violation of existing models, decreases the accuracy of ML whatever the level of rate variation across lineages. In contrast, the accuracy of MP can either increase or decrease when the level of heterotachy increases, depending on the relative branch lengths. This result demonstrates that MP is not insensitive to heterotachy, contrary to the report of Kolaczkowski and Thornton

  1. Multiagent scheduling models and algorithms

    CERN Document Server

    Agnetis, Alessandro; Gawiejnowicz, Stanisław; Pacciarelli, Dario; Soukhal, Ameur

    2014-01-01

    This book presents multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. It discusses complexity results, approximation schemes, heuristics and exact algorithms.

  2. Isolated Common Hepatic Artery Branch Thrombosis: Results and Risk Factors

    Directory of Open Access Journals (Sweden)

    Abdoulhossein Davoodabadi

    2016-10-01

    Full Text Available Isolated common hepatic artery branch thrombosis with severe gastric ischemia and duodenojejunal infarction is a rare condition; it usually presents with acute abdomen and may be associated with underlying thrombotic risk factors. We present a 35-year-old man admitted to our hospital with five days history of sudden abdominal pain and deteriorating epigastric pain. He was a driver and had no any past medical history. Explorative laparotomy showed: distal 2/3 gastric, duodenojejunal and papilla vater was sloughed. The stomach subtotal and sloughed duodenum and first 20 cm of jejunum were resected, continuity of the gastrointestinal was preserved with anastomosis of the proximal part of jejunum to gastric stump, pancreatic duct, and CBD repaired to the lateral side of jejunum on the guide of two 18 French feeding tube as an external drain. The patient had a good immediate postoperative recovery. Coagulation checkup after operation revealed isolated Hyperhomocysteinemia.

  3. Electrochemical synthesis and characterization of hierarchically branched ZnO nanostructures on ensembles of gold nanowires

    International Nuclear Information System (INIS)

    Ongaro, Michael; Gambirasi, Arianna; Favaro, Monica; Ugo, Paolo

    2012-01-01

    Highlights: ► ZnO branched nanofibres for photoelectrochemical applications. ► Branched nanostructures are obtained by electrochemical deposition of ZnO on gold template nanowires. ► Branched nanowires crystallographic phase determined by electron back scatter diffraction. ► Branched structures display improved performances for the photoelectrochemical oxidation of water. - Abstract: This study presents an electrosynthetic methodology to obtain hierarchically structured ZnO electrodes with improved surface area, by exploiting gold nanowires ensembles (3D-NEEs) as the growing substrate. By this way, semiconductor electrodes organized in the shape of fir-like branches are obtained. Branched nanofibres are characterized by electron microscopy and electron backscatter diffraction (EBSD), the latter technique allowing the determination of the crystalline habit of individual nanostructures. The hierarchical branched nanowires show enhanced performances with respect to water photooxidation in comparison with already known nanostructured materials such as 1D-ZnO nanowires.

  4. Fundamentals of natural computing basic concepts, algorithms, and applications

    CERN Document Server

    de Castro, Leandro Nunes

    2006-01-01

    Introduction A Small Sample of Ideas The Philosophy of Natural Computing The Three Branches: A Brief Overview When to Use Natural Computing Approaches Conceptualization General Concepts PART I - COMPUTING INSPIRED BY NATURE Evolutionary Computing Problem Solving as a Search Task Hill Climbing and Simulated Annealing Evolutionary Biology Evolutionary Computing The Other Main Evolutionary Algorithms From Evolutionary Biology to Computing Scope of Evolutionary Computing Neurocomputing The Nervous System Artif

  5. Computationally efficient analytic representations of relativistic bound-bound, bound-unbound and unbound-unbound transition matrix elements of hydrogenic atoms

    International Nuclear Information System (INIS)

    Soldatov, A.; Seke, J.; Adam, G.; Polak, M.

    2008-01-01

    Full text: A closed analytic form for relativistic transition matrix elements between bound-bound, bound-unbound and unbound-unbound relativistic eigenstates of hydrogenic atoms by using the plane-wave expansion for the electromagnetic-field vector potential was derived in a form convenient for large-scale numerical calculations in QED. By applying the obtained formulae, these transition matrix elements can be evaluated analytically and numerically. These exact matrix elements, which to our knowledge have not been calculated as yet, are of great importance in the analysis of various atom-field interaction processes where retardation effects cannot be ignored. The ultimate goal of the ongoing research is to develop a general universal calculation technique for Seke's approximation and renormalization method in QED, for which the usage of the plane vector expansion for the vector potential is a preferable choice. However, our primary interest lies in the Lamb-shift calculation. Our nearest objective is to carry out the plain-style relativistic calculations of the Lamb shift of the energy levels of hydrogen-like atoms and ions from first principles in the second and higher perturbative orders, using the corresponding convenient as well as novel expressions for the magnitude in question as they stand, i.e. without any additional approximations. Due to that there is no way to achieve all the above-declared goals without recourse to large-scale laborious and time-consuming high-precision numerical calculations, having the transition matrix elements of all possible types in an analytic, convenient for their efficient numerical evaluation form, would be highly advantageous and even unavoidable, especially for calculations of various QED effects in higher perturbative orders be it, equally, in traditional or novel approach. (author)

  6. Scaled lattice fermion fields, stability bounds, and regularity

    Science.gov (United States)

    O'Carroll, Michael; Faria da Veiga, Paulo A.

    2018-02-01

    We consider locally gauge-invariant lattice quantum field theory models with locally scaled Wilson-Fermi fields in d = 1, 2, 3, 4 spacetime dimensions. The use of scaled fermions preserves Osterwalder-Seiler positivity and the spectral content of the models (the decay rates of correlations are unchanged in the infinite lattice). In addition, it also results in less singular, more regular behavior in the continuum limit. Precisely, we treat general fermionic gauge and purely fermionic lattice models in an imaginary-time functional integral formulation. Starting with a hypercubic finite lattice Λ ⊂(aZ ) d, a ∈ (0, 1], and considering the partition function of non-Abelian and Abelian gauge models (the free fermion case is included) neglecting the pure gauge interactions, we obtain stability bounds uniformly in the lattice spacing a ∈ (0, 1]. These bounds imply, at least in the subsequential sense, the existence of the thermodynamic (Λ ↗ (aZ ) d) and the continuum (a ↘ 0) limits. Specializing to the U(1) gauge group, the known non-intersecting loop expansion for the d = 2 partition function is extended to d = 3 and the thermodynamic limit of the free energy is shown to exist with a bound independent of a ∈ (0, 1]. In the case of scaled free Fermi fields (corresponding to a trivial gauge group with only the identity element), spectral representations are obtained for the partition function, free energy, and correlations. The thermodynamic and continuum limits of the free fermion free energy are shown to exist. The thermodynamic limit of n-point correlations also exist with bounds independent of the point locations and a ∈ (0, 1], and with no n! dependence. Also, a time-zero Hilbert-Fock space is constructed, as well as time-zero, spatially pointwise scaled fermion creation operators which are shown to be norm bounded uniformly in a ∈ (0, 1]. The use of our scaled fields since the beginning allows us to extract and isolate the singularities of the free

  7. Light Signaling in Bud Outgrowth and Branching in Plants

    Directory of Open Access Journals (Sweden)

    Nathalie Leduc

    2014-04-01

    Full Text Available Branching determines the final shape of plants, which influences adaptation, survival and the visual quality of many species. It is an intricate process that includes bud outgrowth and shoot extension, and these in turn respond to environmental cues and light conditions. Light is a powerful environmental factor that impacts multiple processes throughout plant life. The molecular basis of the perception and transduction of the light signal within buds is poorly understood and undoubtedly requires to be further unravelled. This review is based on current knowledge on bud outgrowth-related mechanisms and light-mediated regulation of many physiological processes. It provides an extensive, though not exhaustive, overview of the findings related to this field. In parallel, it points to issues to be addressed in the near future.

  8. An upper and lower bound of the Medication Possession Ratio

    Directory of Open Access Journals (Sweden)

    Sperber CM

    2017-08-01

    Full Text Available Christian M Sperber, Suren R Samarasinghe, Grace P Lomax Patient Connect Limited, Guildford, UK Background: The Medication Possession Ratio (MPR is a ubiquitous and central measurement for adherence in the health care industry. However, attempts to standardize its calculation have failed, possibly due to the opacity of a single, static MPR, incapability of directly lending itself to a variety of studies, and challenges of comparing the value across studies. This work shows that the MPR strictly depends on the length of the time interval over which it is measured as well as on the dominant dispense quantity for short time intervals. Furthermore, removing a proportion of the patient cohort based on the number of acquisitions may also have a severe impact on the MPR. Therefore, it is suggested that the MPR is represented as a trend over a range of time intervals. To this end, an upper and lower bound of the MPR trend is developed with an upper bound acknowledging patients who change their treatment and the lower bound acknowledging patients who discontinue their treatment.Purpose: Introducing a representation of the MPR value as a trend rather than a static number by developing a quantitative description of an upper and lower bound of the MPR trend, while shedding light on the impacts on prefiltering the patient cohort.Patients and methods: Anonymized patient-level data was utilized as an example for a suggested calculation of an upper and lower bound of the MPR.Results: Representation of the MPR for a predefined time interval precludes a reliable MPR assessment. A quantitative approach is suggested to generate an upper and lower trend of the MPR while emphasizing the impact on removing patients with a limited number of acquisitions.Conclusion: An upper and lower trend makes the MPR more transparent and allows a better comparison across different studies. Removing patients with a limited number of acquisitions should be avoided. Keywords: MPR

  9. Branched chain amino acids requirements and metabolism in pigs

    DEFF Research Database (Denmark)

    Assadi Soumeh, Elham

    2015-01-01

    There is an interest to reduce the dietary crude protein (CP) level to promote the gut health of piglets, eliminate the environmental nitrogen load from intensive pig farming, and to reduce diet costs. This is possible by estimating individual amino acid (AA) requirements and by optimizing the diet...... according to the ideal protein profile that is compatible with the animal AA demand for normal body function. During the past decades, it has been tried to understand and characterize branched chain amino acids (BCAA) requirements, biological importance, and mode of actions. This is interesting for two...... of the last “-omics”, is a global analysis and interpretation of metabolome in specific health or nutritional status. Non-targeted metabolomics is used for screening the metabolic profile, and the metabolic signature could be used for hypothesis generation. The results of a non-targeted LC-MS metabolomics...

  10. Synthetic horizontal branch models for globular clusters - the luminosity of the horizontal branch and the Oosterhoff effect

    International Nuclear Information System (INIS)

    Lee, Y.W.; Demarque, P.; Zinn, R.

    1987-01-01

    The variation of horizontal-branch (HB) luminosities with metal abundances is analyzed on the basis of HB models synthesized from theoretical HB evolutionary tracks. The focus is on the Oosterhoff effect, as related to period shifts in globular-cluster RR Lyr variables. The construction of the models and the Oosterhoff period groups is explained in detail, and the implications for globular-cluster ages are considered. The ratio of Delta M(bol) (RR) to Delta Fe/H for the HB is calculated as 0.24, slightly steeper than that found by Sandage (1981 and 1982). 35 references

  11. Instanton Operators and the Higgs Branch at Infinite Coupling

    CERN Document Server

    Cremonesi, Stefano; Hanany, Amihay; Mekareeya, Noppadol

    2017-01-01

    The richness of 5d $\\mathcal{N}=1$ theories with a UV fixed point at infinite coupling is due to the existence of local disorder operators known as instanton operators. By considering the Higgs branch of $SU(2)$ gauge theories with $N_f \\leq 7$ flavours at finite and infinite coupling, we write down the explicit chiral ring relations between instanton operators, the glueball superfield and mesons. Exciting phenomena appear at infinite coupling: the glueball superfield is no longer nilpotent and the classical chiral ring relations are quantum corrected by instanton operators bilinears. We also find expressions for the dressing of instanton operators of arbitrary charge. The same analysis is performed for $USp(2k)$ with an antisymmetric hypermultiplet and pure $SU(N)$ gauge theories.

  12. Instanton operators and the Higgs branch at infinite coupling

    Energy Technology Data Exchange (ETDEWEB)

    Cremonesi, Stefano [Department of Mathematics, King’s College London,The Strand, London WC2R 2LS (United Kingdom); Ferlito, Giulia; Hanany, Amihay [Theoretical Physics Group, Imperial College London,Prince Consort Road, London, SW7 2AZ (United Kingdom); Mekareeya, Noppadol [Theory Division, Physics Department, CERN,CH-1211, Geneva 23 (Switzerland)

    2017-04-10

    The richness of 5d N=1 theories with a UV fixed point at infinite coupling is due to the existence of local disorder operators known as instanton operators. By considering the Higgs branch of SU(2) gauge theories with N{sub f}≤7 flavours at finite and infinite coupling, we write down the explicit chiral ring relations between instanton operators, the glueball superfield and mesons. Exciting phenomena appear at infinite coupling: the glueball superfield is no longer nilpotent and the classical chiral ring relations are quantum corrected by instanton operators bilinears. We also find expressions for the dressing of instanton operators of arbitrary charge. The same analysis is performed for USp(2k) with an antisymmetric hypermultiplet and pure SU(N) gauge theories.

  13. Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives

    Science.gov (United States)

    Chen, Dong; Gara, Alana; Heidelberger, Philip; Kumar, Sameer; Ohmacht, Martin; Steinmacher-Burow, Burkhard; Wisniewski, Robert

    2014-09-16

    Implementation primitives for concurrent array-based stacks, queues, double-ended queues (deques) and wrapped deques are provided. In one aspect, each element of the stack, queue, deque or wrapped deque data structure has its own ticket lock, allowing multiple threads to concurrently use multiple elements of the data structure and thus achieving high performance. In another aspect, new synchronization primitives FetchAndIncrementBounded (Counter, Bound) and FetchAndDecrementBounded (Counter, Bound) are implemented. These primitives can be implemented in hardware and thus promise a very fast throughput for queues, stacks and double-ended queues.

  14. Quantum lower bound for sorting

    OpenAIRE

    Shi, Yaoyun

    2000-01-01

    We prove that \\Omega(n log(n)) comparisons are necessary for any quantum algorithm that sorts n numbers with high success probability and uses only comparisons. If no error is allowed, at least 0.110nlog_2(n) - 0.067n + O(1) comparisons must be made. The previous known lower bound is \\Omega(n).

  15. The distribution of branched octanols between dodecane and water

    International Nuclear Information System (INIS)

    Sagert, N.H.; Lau, D.W.P.

    1985-01-01

    The distribution of four branched chain octanols, 3-ethyl-3-hexanol, 4-ethyl-3-hexanol, 2-ethyl-4-methylpentanol, and 4-octanol, has been measured between dodecane and water. Measurements were made at alcohol concentrations in the dodecane of less than 0.1 mol/dmsup(3), and as a function of temperature from 10 degrees C to 35 degrees C. From these distribution data, standard thermodynamic functions for transfer were calculated. Standard Gibbs energies of transfer from water to dodecane at 25 degrees C were in the range -14.1 to -15.l kJ/mol, whereas the standard enthalpies of transfer at 25 degrees C varied from 29 to 39 kJ/mol. Thus, the change in the standard enthalpy tends to inhibit transfer, but a large standard entropy of transfer results in dodecane being the favoured phase

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

  17. Measurement of the ratios of branching fractions and.

    Science.gov (United States)

    Abulencia, A; Acosta, D; Adelman, J; Affolder, T; Akimoto, T; Albrow, M G; Ambrose, D; Amerio, S; Amidei, D; Anastassov, A; Anikeev, K; Annovi, A; Antos, J; Aoki, M; Apollinari, G; Arguin, J-F; Arisawa, T; Artikov, A; Ashmanskas, W; Attal, A; Azfar, F; Azzi-Bacchetta, P; Azzurri, P; Bacchetta, N; Bachacou, H; Badgett, W; Barbaro-Galtieri, A; Barnes, V E; Barnett, B A; Baroiant, S; Bartsch, V; Bauer, G; Bedeschi, F; Behari, S; Belforte, S; Bellettini, G; Bellinger, J; Belloni, A; Ben-Haim, E; Benjamin, D; Beretvas, A; Beringer, J; Berry, T; Bhatti, A; Binkley, M; Bisello, D; Bishai, M; Blair, R E; Blocker, C; Bloom, K; Blumenfeld, B; Bocci, A; Bodek, A; Boisvert, V; Bolla, G; Bolshov, A; Bortoletto, D; Boudreau, J; Bourov, S; Boveia, A; Brau, B; Bromberg, C; Brubaker, E; Budagov, J; Budd, H S; Budd, S; Burkett, K; Busetto, G; Bussey, P; Byrum, K L; Cabrera, S; Campanelli, M; Campbell, M; Canelli, F; Canepa, A; Carlsmith, D; Carosi, R; Carron, S; Casarsa, M; Castro, A; Catastini, P; Cauz, D; Cavalli-Sforza, M; Cerri, A; Cerrito, L; Chang, S H; Chapman, J; Chen, Y C; Chertok, M; Chiarelli, G; Chlachidze, G; Chlebana, F; Cho, I; Cho, K; Chokheli, D; Chou, J P; Chu, P H; Chuang, S H; Chung, K; Chung, W H; Chung, Y S; Ciljak, M; Ciobanu, C I; Ciocci, M A; Clark, A; Clark, D; Coca, M; Connolly, A; Convery, M E; Conway, J; Cooper, B; Copic, K; Cordelli, M; Cortiana, G; Cruz, A; Cuevas, J; Culbertson, R; Cyr, D; Daronco, S; D'Auria, S; D'onofrio, M; Dagenhart, D; de Barbaro, P; De Cecco, S; Deisher, A; De Lentdecker, G; Dell'Orso, M; Demers, S; Demortier, L; Deng, J; Deninno, M; De Pedis, D; Derwent, P F; Dionisi, C; Dittmann, J; DiTuro, P; Dörr, C; Dominguez, A; Donati, S; Donega, M; Dong, P; Donini, J; Dorigo, T; Dube, S; Ebina, K; Efron, J; Ehlers, J; Erbacher, R; Errede, D; Errede, S; Eusebi, R; Fang, H C; Farrington, S; Fedorko, I; Fedorko, W T; Feild, R G; Feindt, M; Fernandez, J P; Field, R; Flanagan, G; Flores-Castillo, L R; Foland, A; Forrester, S; Foster, G W; Franklin, M; Freeman, J C; Fujii, Y; Furic, I; Gajjar, A; Gallinaro, M; Galyardt, J; Garcia, J E; Sciverez, M Garcia; Garfinkel, A F; Gay, C; Gerberich, H; Gerchtein, E; Gerdes, D; Giagu, S; Giannetti, P; Gibson, A; Gibson, K; Ginsburg, C; Giolo, K; Giordani, M; Giunta, M; Giurgiu, G; Glagolev, V; Glenzinski, D; Gold, M; Goldschmidt, N; Goldstein, J; Gomez, G; Gomez-Ceballos, G; Goncharov, M; González, O; Gorelov, I; Goshaw, A T; Gotra, Y; Goulianos, K; Gresele, A; Griffiths, M; Grinstein, S; Grosso-Pilcher, C; Grundler, U; da Costa, J Guimaraes; Haber, C; Hahn, S R; Hahn, K; Halkiadakis, E; Hamilton, A; Han, B-Y; Handler, R; Happacher, F; Hara, K; Hare, M; Harper, S; Harr, R F; Harris, R M; Hatakeyama, K; Hauser, J; Hays, C; Hayward, H; Heijboer, A; Heinemann, B; Heinrich, J; Hennecke, M; Herndon, M; Heuser, J; Hidas, D; Hill, C S; Hirschbuehl, D; Hocker, A; Holloway, A; Hou, S; Houlden, M; Hsu, S-C; Huffman, B T; Hughes, R E; Huston, J; Ikado, K; Incandela, J; Introzzi, G; Iori, M; Ishizawa, Y; Ivanov, A; Iyutin, B; James, E; Jang, D; Jayatilaka, B; Jeans, D; Jensen, H; Jeon, E J; Jones, M; Joo, K K; Jun, S Y; Junk, T R; Kamon, T; Kang, J; Karagoz-Unel, M; Karchin, P E; Kato, Y; Kemp, Y; Kephart, R; Kerzel, U; Khotilovich, V; Kilminster, B; Kim, D H; Kim, H S; Kim, J E; Kim, M J; Kim, M S; Kim, S B; Kim, S H; Kim, Y K; Kirby, M; Kirsch, L; Klimenko, S; Klute, M; Knuteson, B; Ko, B R; Kobayashi, H; Kondo, K; Kong, D J; Konigsberg, J; Korytov, A; Kotwal, A V; Kovalev, A; Kraus, J; Kravchenko, I; Kreps, M; Kreymer, A; Kroll, J; Krumnack, N; Kruse, M; Krutelyov, V; Kuhlmann, S E; Kusakabe, Y; Kwang, S; Laasanen, A T; Lai, S; Lami, S; Lami, S; Lammel, S; Lancaster, M; Lander, R L; Lannon, K; Lath, A; Latino, G; Lazzizzera, I; Lecci, C; LeCompte, T; Lee, J; Lee, J; Lee, S W; Lefèvre, R; Leonardo, N; Leone, S; Levy, S; Lewis, J D; Li, K; Lin, C; Lin, C S; Lindgren, M; Lipeles, E; Liss, T M; Lister, A; Litvintsev, D O; Liu, T; Liu, Y; Lockyer, N S; Loginov, A; Loreti, M; Loverre, P; Lu, R-S; Lucchesi, D; Lujan, P; Lukens, P; Lungu, G; Lyons, L; Lys, J; Lysak, R; Lytken, E; Mack, P; MacQueen, D; Madrak, R; Maeshima, K; Maksimovic, P; Manca, G; Margaroli, F; Marginean, R; Marino, C; Martin, A; Martin, M; Martin, V; Martínez, M; Maruyama, T; Matsunaga, H; Mattson, M E; Mazini, R; Mazzanti, P; McFarland, K S; McGivern, D; McIntyre, P; McNamara, P; McNulty, R; Mehta, A; Menzemer, S; Menzione, A; Merkel, P; Mesropian, C; Messina, A; von der Mey, M; Miao, T; Miladinovic, N; Miles, J; Miller, R; Miller, J S; Mills, C; Milnik, M; Miquel, R; Miscetti, S; Mitselmakher, G; Miyamoto, A; Moggi, N; Mohr, B; Moore, R; Morello, M; Fernandez, P Movilla; Mülmenstädt, J; Mukherjee, A; Mulhearn, M; Muller, Th; Mumford, R; Murat, P; Nachtman, J; Nahn, S; Nakano, I; Napier, A; Naumov, D; Necula, V; Neu, C; Neubauer, M S; Nielsen, J; Nigmanov, T; Nodulman, L; Norniella, O; Ogawa, T; Oh, S H; Oh, Y D; Okusawa, T; Oldeman, R; Orava, R; Osterberg, K; Pagliarone, C; Palencia, E; Paoletti, R; Papadimitriou, V; Papikonomou, A; Paramonov, A A; Parks, B; Pashapour, S; Patrick, J; Pauletta, G; Paulini, M; Paus, C; Pellett, D E; Penzo, A; Phillips, T J; Piacentino, G; Piedra, J; Pitts, K; Plager, C; Pondrom, L; Pope, G; Portell, X; Poukhov, O; Pounder, N; Prakoshyn, F; Pronko, A; Proudfoot, J; Ptohos, F; Punzi, G; Pursley, J; Rademacker, J; Rahaman, A; Rakitin, A; Rappoccio, S; Ratnikov, F; Reisert, B; Rekovic, V; van Remortel, N; Renton, P; Rescigno, M; Richter, S; Rimondi, F; Rinnert, K; Ristori, L; Robertson, W J; Robson, A; Rodrigo, T; Rogers, E; Rolli, S; Roser, R; Rossi, M; Rossin, R; Rott, C; Ruiz, A; Russ, J; Rusu, V; Ryan, D; Saarikko, H; Sabik, S; Safonov, A; Sakumoto, W K; Salamanna, G; Salto, O; Saltzberg, D; Sanchez, C; Santi, L; Sarkar, S; Sato, K; Savard, P; Savoy-Navarro, A; Scheidle, T; Schlabach, P; Schmidt, E E; Schmidt, M P; Schmitt, M; Schwarz, T; Scodellaro, L; Scott, A L; Scribano, A; Scuri, F; Sedov, A; Seidel, S; Seiya, Y; Semenov, A; Semeria, F; Sexton-Kennedy, L; Sfiligoi, I; Shapiro, M D; Shears, T; Shepard, P F; Sherman, D; Shimojima, M; Shochet, M; Shon, Y; Shreyber, I; Sidoti, A; Sinervo, P; Sisakyan, A; Sjolin, J; Skiba, A; Slaughter, A J; Sliwa, K; Smirnov, D; Smith, J R; Snider, F D; Snihur, R; Soderberg, M; Soha, A; Somalwar, S; Sorin, V; Spalding, J; Spinella, F; Squillacioti, P; Stanitzki, M; Staveris-Polykalas, A; Denis, R St; Stelzer, B; Stelzer-Chilton, O; Stentz, D; Strologas, J; Stuart, D; Suh, J S; Sukhanov, A; Sumorok, K; Sun, H; Suzuki, T; Taffard, A; Tafirout, R; Takashima, R; Takeuchi, Y; Takikawa, K; Tanaka, M; Tanaka, R; Tecchio, M; Teng, P K; Terashi, K; Tether, S; Thom, J; Thompson, A S; Thomson, E; Tipton, P; Tiwari, V; Tkaczyk, S; Toback, D; Tollefson, K; Tomura, T; Tonelli, D; Tönnesmann, M; Torre, S; Torretta, D; Tourneur, S; Trischuk, W; Tsuchiya, R; Tsuno, S; Turini, N; Ukegawa, F; Unverhau, T; Uozumi, S; Usynin, D; Vacavant, L; Vaiciulis, A; Vallecorsa, S; Varganov, A; Vataga, E; Velev, G; Veramendi, G; Veszpremi, V; Vickey, T; Vidal, R; Vila, I; Vilar, R; Vollrath, I; Volobouev, I; Würthwein, F; Wagner, P; Wagner, R G; Wagner, R L; Wagner, W; Wallny, R; Walter, T; Wan, Z; Wang, M J; Wang, S M; Warburton, A; Ward, B; Waschke, S; Waters, D; Watts, T; Weber, M; Wester, W C; Whitehouse, B; Whiteson, D; Wicklund, A B; Wicklund, E; Williams, H H; Wilson, P; Winer, B L; Wittich, P; Wolbers, S; Wolfe, C; Worm, S; Wright, T; Wu, X; Wynne, S M; Yagil, A; Yamamoto, K; Yamaoka, J; Yamashita, Y; Yang, C; Yang, U K; Yao, W M; Yeh, G P; Yoh, J; Yorita, K; Yoshida, T; Yu, I; Yu, S S; Yun, J C; Zanello, L; Zanetti, A; Zaw, I; Zetti, F; Zhang, X; Zhou, J; Zucchelli, S

    2006-05-19

    We report an observation of the decay B(O)(S) --> D(-)(s)pi(+) in pp collisions at radical S = 1.96 TeV using 115 pb(-1) of data collected by the CDF II detector at the Fermilab Tevatron. We observe 83 +/- 11(stat) B(O)(s) --> D(-)(s)pi(+) candidates, representing a large increase in statistics over previous measurements and the first observation of this decay at a pp collider. We present the first measurement of the relative branching fraction Beta(B(O)(s) --> D(-)(s)pi(+))/Beta(B(0) --> D(-)(pi)(+)) = 1.32 +/- 0.18(stat) +/- 0.38(syst). We also measure Beta(B(+) --> D(0)pi(+))/Beta(B(0) -->D(-)pi(+)) = 1.97 +/- 0.10(stat) +/- 0.21(syst), which is consistent with previous measurements.

  18. Integrability and the conformal field theory of the Higgs branch

    International Nuclear Information System (INIS)

    Sax, Olof Ohlsson; Sfondrini, Alessandro; Bogdan, Stefański Jr.

    2015-01-01

    In the context of the AdS 3 /CFT 2 correspondence, we investigate the Higgs branch CFT 2 . Witten showed that states localised near the small instanton singularity can be described in terms of vector multiplet variables. This theory has a planar, weak-coupling limit, in which anomalous dimensions of single-trace composite operators can be calculated. At one loop, the calculation reduces to finding the spectrum of a spin-chain with nearest-neighbour interactions. This CFT 2 spin-chain matches precisely the one that was previously found as the weak-coupling limit of the integrable system describing the AdS 3 side of the duality. We compute the one-loop dilatation operator in a non-trivial compact subsector and show that it corresponds to an integrable spin-chain Hamiltonian. This provides the first direct evidence of integrability on the CFT 2 side of the correspondence.

  19. Degenerate quantum codes and the quantum Hamming bound

    International Nuclear Information System (INIS)

    Sarvepalli, Pradeep; Klappenecker, Andreas

    2010-01-01

    The parameters of a nondegenerate quantum code must obey the Hamming bound. An important open problem in quantum coding theory is whether the parameters of a degenerate quantum code can violate this bound for nondegenerate quantum codes. In this article we show that Calderbank-Shor-Steane (CSS) codes, over a prime power alphabet q≥5, cannot beat the quantum Hamming bound. We prove a quantum version of the Griesmer bound for the CSS codes, which allows us to strengthen the Rains' bound that an [[n,k,d

  20. A comparison between skeleton and bounding box models for falling direction recognition

    Science.gov (United States)

    Narupiyakul, Lalita; Srisrisawang, Nitikorn

    2017-12-01

    Falling is an injury that can lead to a serious medical condition in every range of the age of people. However, in the case of elderly, the risk of serious injury is much higher. Due to the fact that one way of preventing serious injury is to treat the fallen person as soon as possible, several works attempted to implement different algorithms to recognize the fall. Our work compares the performance of two models based on features extraction: (i) Body joint data (Skeleton Data) which are the joint's positions in 3 axes and (ii) Bounding box (Box-size Data) covering all body joints. Machine learning algorithms that were chosen are Decision Tree (DT), Naïve Bayes (NB), K-nearest neighbors (KNN), Linear discriminant analysis (LDA), Voting Classification (VC), and Gradient boosting (GB). The results illustrate that the models trained with Skeleton data are performed far better than those trained with Box-size data (with an average accuracy of 94-81% and 80-75%, respectively). KNN shows the best performance in both Body joint model and Bounding box model. In conclusion, KNN with Body joint model performs the best among the others.

  1. Hybrid Bacterial Foraging and Particle Swarm Optimization for detecting Bundle Branch Block.

    Science.gov (United States)

    Kora, Padmavathi; Kalva, Sri Ramakrishna

    2015-01-01

    Abnormal cardiac beat identification is a key process in the detection of heart diseases. Our present study describes a procedure for the detection of left and right bundle branch block (LBBB and RBBB) Electrocardiogram (ECG) patterns. The electrical impulses that control the cardiac beat face difficulty in moving inside the heart. This problem is termed as bundle branch block (BBB). BBB makes it harder for the heart to pump blood effectively through the heart circulatory system. ECG feature extraction is a key process in detecting heart ailments. Our present study comes up with a hybrid method combining two heuristic optimization methods: Bacterial Forging Optimization (BFO) and Particle Swarm Optimization (PSO) for the feature selection of ECG signals. One of the major controlling forces of BFO algorithm is the chemotactic movement of a bacterium that models a test solution. The chemotaxis process of the BFO depends on random search directions which may lead to a delay in achieving the global optimum solution. The hybrid technique: Bacterial Forging-Particle Swarm Optimization (BFPSO) incorporates the concepts from BFO and PSO and it creates individuals in a new generation. This BFPSO method performs local search through the chemotactic movement of BFO and the global search over the entire search domain is accomplished by a PSO operator. The BFPSO feature values are given as the input for the Levenberg-Marquardt Neural Network classifier.

  2. Bound-state perturbation theory and annihilation effects in positronium

    International Nuclear Information System (INIS)

    Abbasabadi, A.; Repko, W.W.

    1987-01-01

    Working in Coulomb gauge and using the lowest-order equation proposed by Barbieri and Remiddi it is calculated, in the one-loop order of perturbation theory, the decay rate and the energy shift of the ground states of parapositronium and orthopositronium, respectively. Our result for the decay rate agrees with that of Harris and Brown. For contribution of one-photon-annihilation channel to the energy shift, it is confirmed the result of Karplus and Klein. These results are derived completely within the bound-state formalism and avoid the necessity of performing on-mass-shell wave function and vertex renormalization subtractions

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

    Science.gov (United States)

    Campbell, Bruce G.; Landmeyer, James E.

    2014-01-01

    Chesterfield County is located in the northeastern part of South Carolina along the southern border of North Carolina and is primarily underlain by unconsolidated sediments of Late Cretaceous age and younger of the Atlantic Coastal Plain. Approximately 20 percent of Chesterfield County is in the Piedmont Physiographic Province, and this area of the county is not included in this study. These Atlantic Coastal Plain sediments compose two productive aquifers: the Crouch Branch aquifer that is present at land surface across most of the county and the deeper, semi-confined McQueen Branch aquifer. Most of the potable water supplied to residents of Chesterfield County is produced from the Crouch Branch and McQueen Branch aquifers by a well field located near McBee, South Carolina, in the southwestern part of the county. Overall, groundwater availability is good to very good in most of Chesterfield County, especially the area around and to the south of McBee, South Carolina. The eastern part of Chesterfield County does not have as abundant groundwater resources but resources are generally adequate for domestic purposes. The primary purpose of this study was to determine groundwater-flow rates, flow directions, and changes in water budgets over time for the Crouch Branch and McQueen Branch aquifers in the Chesterfield County area. This goal was accomplished by using the U.S. Geological Survey finite-difference MODFLOW groundwater-flow code to construct and calibrate a groundwater-flow model of the Atlantic Coastal Plain of Chesterfield County. The model was created with a uniform grid size of 300 by 300 feet to facilitate a more accurate simulation of groundwater-surface-water interactions. The model consists of 617 rows from north to south extending about 35 miles and 884 columns from west to east extending about 50 miles, yielding a total area of about 1,750 square miles. However, the active part of the modeled area, or the part where groundwater flow is simulated

  4. Branching innovation, recombinant innovation, and endogenous technological transitions

    NARCIS (Netherlands)

    Frenken, K.; Izquierdo, L.; Zeppini, P.

    2012-01-01

    We propose a model of technological transitions based on two different types of innovations. Branching innovations refer to technological improvements along a particular path, while recombinant innovations represent fusions of multiple paths. Recombinant innovations create "short-cuts" which reduce

  5. Algorithmic randomness and physical entropy

    International Nuclear Information System (INIS)

    Zurek, W.H.

    1989-01-01

    Algorithmic randomness provides a rigorous, entropylike measure of disorder of an individual, microscopic, definite state of a physical system. It is defined by the size (in binary digits) of the shortest message specifying the microstate uniquely up to the assumed resolution. Equivalently, algorithmic randomness can be expressed as the number of bits in the smallest program for a universal computer that can reproduce the state in question (for instance, by plotting it with the assumed accuracy). In contrast to the traditional definitions of entropy, algorithmic randomness can be used to measure disorder without any recourse to probabilities. Algorithmic randomness is typically very difficult to calculate exactly but relatively easy to estimate. In large systems, probabilistic ensemble definitions of entropy (e.g., coarse-grained entropy of Gibbs and Boltzmann's entropy H=lnW, as well as Shannon's information-theoretic entropy) provide accurate estimates of the algorithmic entropy of an individual system or its average value for an ensemble. One is thus able to rederive much of thermodynamics and statistical mechanics in a setting very different from the usual. Physical entropy, I suggest, is a sum of (i) the missing information measured by Shannon's formula and (ii) of the algorithmic information content---algorithmic randomness---present in the available data about the system. This definition of entropy is essential in describing the operation of thermodynamic engines from the viewpoint of information gathering and using systems. These Maxwell demon-type entities are capable of acquiring and processing information and therefore can ''decide'' on the basis of the results of their measurements and computations the best strategy for extracting energy from their surroundings. From their internal point of view the outcome of each measurement is definite

  6. Complex bounds and microstructural recovery from measurements of sea ice permittivity

    International Nuclear Information System (INIS)

    Gully, A.; Backstrom, L.G.E.; Eicken, H.; Golden, K.M.

    2007-01-01

    Sea ice is a porous composite of pure ice with brine, air, and salt inclusions. The polar sea ice packs play a key role in the earth's ocean-climate system, and they host robust algal and bacterial communities that support the Arctic and Antarctic ecosystems. Monitoring the sea ice packs on global or regional scales is an increasingly important problem, typically involving the interaction of an electromagnetic wave with sea ice. In the quasistatic regime where the wavelength is much longer than the composite microstructural scale, the electromagnetic behavior is characterized by the effective complex permittivity tensor ε*. In assessing the impact of climate change on the polar sea ice covers, current satellites and algorithms can predict ice extent, but the thickness distribution remains an elusive, yet most important feature. In recent years, electromagnetic induction devices using low frequency waves have been deployed on ships, helicopters and planes to obtain thickness data. Here we compare two sets of theoretical bounds to extensive outdoor tank and in situ field data on ε* at 50MHz taken in the Arctic and Antarctic. The sea ice is assumed to be a two phase composite of ice and brine with known constituent permittivities. The first set of bounds assumes only knowledge of the brine volume fraction or porosity, and the second set further assumes statistical isotropy of the microstructure. We obtain excellent agreement between theory and experiment, and are able to observe the apparent violation of the isotropic bounds as the vertically oriented microstructure becomes increasingly connected for higher porosities. Moreover, these bounds are inverted to obtain estimates of the porosity from the measurements of ε*. We find that the temporal variations of the reconstructed porosity, which is directly related to temperature, closely follow the actual behavior

  7. Detection of Bundle Branch Block using Adaptive Bacterial Foraging Optimization and Neural Network

    Directory of Open Access Journals (Sweden)

    Padmavthi Kora

    2017-03-01

    Full Text Available The medical practitioners analyze the electrical activity of the human heart so as to predict various ailments by studying the data collected from the Electrocardiogram (ECG. A Bundle Branch Block (BBB is a type of heart disease which occurs when there is an obstruction along the pathway of an electrical impulse. This abnormality makes the heart beat irregular as there is an obstruction in the branches of heart, this results in pulses to travel slower than the usual. Our current study involved is to diagnose this heart problem using Adaptive Bacterial Foraging Optimization (ABFO Algorithm. The Data collected from MIT/BIH arrhythmia BBB database applied to an ABFO Algorithm for obtaining best(important feature from each ECG beat. These features later fed to Levenberg Marquardt Neural Network (LMNN based classifier. The results show the proposed classification using ABFO is better than some recent algorithms reported in the literature.

  8. Using MOEA with Redistribution and Consensus Branches to Infer Phylogenies.

    Science.gov (United States)

    Min, Xiaoping; Zhang, Mouzhao; Yuan, Sisi; Ge, Shengxiang; Liu, Xiangrong; Zeng, Xiangxiang; Xia, Ningshao

    2017-12-26

    In recent years, to infer phylogenies, which are NP-hard problems, more and more research has focused on using metaheuristics. Maximum Parsimony and Maximum Likelihood are two effective ways to conduct inference. Based on these methods, which can also be considered as the optimal criteria for phylogenies, various kinds of multi-objective metaheuristics have been used to reconstruct phylogenies. However, combining these two time-consuming methods results in those multi-objective metaheuristics being slower than a single objective. Therefore, we propose a novel, multi-objective optimization algorithm, MOEA-RC, to accelerate the processes of rebuilding phylogenies using structural information of elites in current populations. We compare MOEA-RC with two representative multi-objective algorithms, MOEA/D and NAGA-II, and a non-consensus version of MOEA-RC on three real-world datasets. The result is, within a given number of iterations, MOEA-RC achieves better solutions than the other algorithms.

  9. Flood-inundation and flood-mitigation modeling of the West Branch Wapsinonoc Creek Watershed in West Branch, Iowa

    Science.gov (United States)

    Cigrand, Charles V.

    2018-03-26

    The U.S. Geological Survey (USGS) in cooperation with the city of West Branch and the Herbert Hoover National Historic Site of the National Park Service assessed flood-mitigation scenarios within the West Branch Wapsinonoc Creek watershed. The scenarios are intended to demonstrate several means of decreasing peak streamflows and improving the conveyance of overbank flows from the West Branch Wapsinonoc Creek and its tributary Hoover Creek where they flow through the city and the Herbert Hoover National Historic Site located within the city.Hydrologic and hydraulic models of the watershed were constructed to assess the flood-mitigation scenarios. To accomplish this, the models used the U.S. Army Corps of Engineers Hydrologic Engineering Center-Hydrologic Modeling System (HEC–HMS) version 4.2 to simulate the amount of runoff and streamflow produced from single rain events. The Hydrologic Engineering Center-River Analysis System (HEC–RAS) version 5.0 was then used to construct an unsteady-state model that may be used for routing streamflows, mapping areas that may be inundated during floods, and simulating the effects of different measures taken to decrease the effects of floods on people and infrastructure.Both models were calibrated to three historic rainfall events that produced peak streamflows ranging between the 2-year and 10-year flood-frequency recurrence intervals at the USGS streamgage (05464942) on Hoover Creek. The historic rainfall events were calibrated by using data from two USGS streamgages along with surveyed high-water marks from one of the events. The calibrated HEC–HMS model was then used to simulate streamflows from design rainfall events of 24-hour duration ranging from a 20-percent to a 1-percent annual exceedance probability. These simulated streamflows were incorporated into the HEC–RAS model.The unsteady-state HEC–RAS model was calibrated to represent existing conditions within the watershed. HEC–RAS model simulations with the

  10. Radioimmunoassay for free and bound forms of abscisic acid

    Energy Technology Data Exchange (ETDEWEB)

    Cutting, J.G.; Hofman, P.J.; Wolstenholme, B.N. (Natal Univ., Pietermaritzburg (South Africa). Dept. of Horticultural Science); Lishman, A.W. (Natal Univ., Pietermaritzburg (South Africa). Dept. of Animal Science)

    1984-01-01

    A radioimmunoassay (RIA) for the quanitation of abscisic acid (ABA) has been developed. The assay is extremely sensitive and measuring ranges extend from 10 pg to 10 ng. Although the assay was free of contaminant interference when applied to avocado material, crude extract analysis yielded a composite of free and bound forms of ABA. Equivalents of 20 mg of plant material were spotted onto silica gel plates (GF/sup 245/ solvent:toluene:ethyl acetate : acetic acid 25:15:3), developed and the relative Rf zones removed and subjected to RIA. The technique was tested on avocados.

  11. Radioimmunoassay for free and bound forms of abscisic acid

    International Nuclear Information System (INIS)

    Cutting, J.G.; Hofman, P.J.; Wolstenholme, B.N.; Lishman, A.W.

    1984-01-01

    A radioimmunoassay (RIA) for the quanitation of abscisic acid (ABA) has been developed. The assay is extremely sensitive and measuring ranges extend from 10 pg to 10 ng. Although the assay was free of contaminant interference when applied to avocado material, crude extract analysis yielded a composite of free and bound forms of ABA. Equivalents of 20 mg of plant material were spotted onto silica gel plates (GF 245 solvent:toluene:ethyl acetate : acetic acid 25:15:3), developed and the relative Rf zones removed and subjected to RIA. The technique was tested on avocados

  12. Comparable stocks, boundedly rational stock markets and IPO entry rates.

    Directory of Open Access Journals (Sweden)

    Jay Chok

    Full Text Available In this study, we examine how initial public offerings (IPO entry rates are affected when stock markets are boundedly rational and IPO firms infer information from their counterparts in the market. We hypothesize a curvilinear relationship between the number of comparable stocks and initial public offerings (IPO entry rates into the NASDAQ Stock Exchange. Furthermore, we argue that trading volume and changes in stock returns partially mediates the relationship between the number of comparable stocks and IPO entry rates. The statistical evidence provides strong support for the hypotheses.

  13. Focus: Bounded Rationality and the History of Science. Introduction.

    Science.gov (United States)

    Cowles, Henry M; Deringer, William; Dick, Stephanie; Webster, Colin

    2015-09-01

    Historians of science see knowledge and its claimants as constrained by myriad factors. These limitations range from the assumptions and commitments of scientific practitioners to the material and ideational contexts of their practice. The precise nature of such limits and the relations among them remains an open question in the history of science. The essays in this Focus section address this question by examining one influential portrayal of constraints--Herbert Simon's theory of "bounded rationality"--as well as the responses to which it has given rise over the last half century.

  14. Neutrinos, DUNE and the world best bound on CPT invariance

    Science.gov (United States)

    Barenboim, G.; Ternes, C. A.; Tórtola, M.

    2018-05-01

    CPT symmetry, the combination of Charge Conjugation, Parity and Time reversal, is a cornerstone of our model building strategy and therefore the repercussions of its potential violation will severely threaten the most extended tool we currently use to describe physics, i.e. local relativistic quantum fields. However, limits on its conservation from the Kaon system look indeed imposing. In this work we will show that neutrino oscillation experiments can improve this limit by several orders of magnitude and therefore are an ideal tool to explore the foundations of our approach to Nature. Strictly speaking testing CPT violation would require an explicit model for how CPT is broken and its effects on physics. Instead, what is presented in this paper is a test of one of the predictions of CPT conservation, i.e., the same mass and mixing parameters in neutrinos and antineutrinos. In order to do that we calculate the current CPT bound on all the neutrino mixing parameters and study the sensitivity of the DUNE experiment to such an observable. After deriving the most updated bound on CPT from neutrino oscillation data, we show that, if the recent T2K results turn out to be the true values of neutrino and antineutrino oscillations, DUNE would measure the fallout of CPT conservation at more than 3σ. Then, we study the sensitivity of the experiment to measure CPT invariance in general, finding that DUNE will be able to improve the current bounds on Δ (Δ m312) by at least one order of magnitude. We also study the sensitivity to the other oscillation parameters. Finally we show that, if CPT is violated in nature, combining neutrino with antineutrino data in oscillation analysis will produce imposter solutions.

  15. Compton scattering, meson exchange, and the polarizabilities of bound nucleons

    International Nuclear Information System (INIS)

    Feldman, G.; Mellendorf, K.E.; Eisenstein, R.A.; Federspiel, F.J.; Garino, G.; Igarashi, R.; Kolb, N.R.; Lucas, M.A.; MacGibbon, B.E.; Mize, W.K.; Nathan, A.M.; Pywell, R.E.; Wells, D.P.

    1996-01-01

    Elastic photon scattering cross sections on 16 O have been measured in the energy range 27 endash 108 MeV. These data are inconsistent with a conventional interpretation in which the electric and magnetic polarizabilities of the bound nucleon are unchanged from the free values and the meson-exchange seagull amplitude is taken in the zero-energy limit. Agreement with the data can be achieved by invoking either strongly modified polarizabilities or a substantial energy dependence to the meson-exchange seagull amplitude. It is argued that these seemingly different explanations are experimentally indistinguishable and probably physically equivalent. copyright 1996 The American Physical Society

  16. Computational geometry algorithms and applications

    CERN Document Server

    de Berg, Mark; Overmars, Mark; Schwarzkopf, Otfried

    1997-01-01

    Computational geometry emerged from the field of algorithms design and anal­ ysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The suc­ cess of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains--computer graphics, geographic in­ formation systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or difficult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simplified many of the previous approaches. In this textbook we have tried to make these modem algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can ...

  17. Greedy algorithms withweights for construction of partial association rules

    KAUST Repository

    Moshkov, Mikhail; Piliszczu, Marcin; Zielosko, Beata Marta

    2009-01-01

    This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds on the minimal weight of partial association rules based on an information obtained during the greedy algorithm run.

  18. Greedy algorithms withweights for construction of partial association rules

    KAUST Repository

    Moshkov, Mikhail

    2009-09-10

    This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds on the minimal weight of partial association rules based on an information obtained during the greedy algorithm run.

  19. Study of the anatomy of the tibial nerve and its branches in the distal medial leg

    Science.gov (United States)

    Torres, André Leal Gonçalves; Ferreira, Marcus Castro

    2012-01-01

    Objective Determine, through dissection in fresh cadavers, the topographic anatomy of the tibial nerve and its branches at the ankle, in relation to the tarsal tunnel. Methods Bilateral dissections were performed on 26 fresh cadavers and the locations of the tibial nerve bifurcation and its branches were measured in millimeters. For the calcaneal branches, the amount and their respective nerves of origin were also analyzed. Results The tibial nerve bifurcation occurred under the tunnel in 88% of the cases and proximally in 12%. As for the calcaneal branches, the medial presented with one (58%), two (34%) and three (8%) branches, with the most common source occurring in the tibial nerve (90%) and the lower with a single branch per leg and lateral plantar nerve as the most common origin (70%). Level of Evidence, V Expert opinion. PMID:24453596

  20. Algebraic Algorithm Design and Local Search

    National Research Council Canada - National Science Library

    Graham, Robert

    1996-01-01

    .... Algebraic techniques have been applied successfully to algorithm synthesis by the use of algorithm theories and design tactics, an approach pioneered in the Kestrel Interactive Development System (KIDS...

  1. Occurrence and distribution of GDGTs in the free and bound lipid fractions from podzols: implications for the reconstruction of mean air temperature

    Science.gov (United States)

    Huguet, A.; Fosse, C.; Metzger, P.; Derenne, S.

    2009-12-01

    Glycerol dialkyl glycerol tetraethers (GDGTs) are complex lipids of high molecular weight, present in cell membranes of archaea and some bacteria. Archaeal membranes are formed predominantly by isoprenoid GDGTs with acyclic or ring-containing biphytanyl chains. Another type of GDGTs with branched instead of isoprenoid alkyl chains was recently discovered in soils. Branched tetraethers were suggested to be produced by anaerobic bacteria and can be used to reconstruct past air temperature and soil pH. Lipids preserved in soils can take two broad chemical forms: "free" lipids, recoverable after solvent extraction, and "bound" lipids, linked to the organic or mineral matrix of soils. The "free" and "bound" lipid fractions may respond to environmental changes in different ways and the information derived from these two pools may differ. The aim of the present work was therefore to compare the abundance and distribution of "free" and "bound" GDGTs in two contrasted podzols: a temperate podzol located 40 km north of Paris and a tropical podzol from the upper Amazon Basin. Five samples were collected from the whole profile of the temperate podzol including the litter layer. Five additional samples were obtained from three profiles of the tropical soil sequence, representative of the transition between a latosol and a well-developed podzol. Vertical and/or lateral variations in GDGT content and composition were highlighted. In particular, in the tropical sequence, GDGTs were present at relatively low concentrations in the early stages of podzolisation and were more abundant in the well-developed podzolic horizons, where higher acidity and increased bacterial activity may favour their stabilization. Concerning the temperate podzol, GDGT distribution was shown to vary greatly with depth in the soil profile, the methylation degree of bacterial GDGTs being notably higher in the surficial than in the deep soil horizons. Bacterial GDGTs were also detected in the litter layer of

  2. Network marketing with bounded rationality and partial information

    Science.gov (United States)

    Kiet, Hoang Anh Tuan; Kim, Beom Jun

    2008-08-01

    Network marketing has been proposed and used as a way to spread the product information to consumers through social connections. We extend the previous game model of the network marketing on a small-world tree network and propose two games: In the first model with the bounded rationality, each consumer makes purchase decision stochastically, while in the second model, consumers get only partial information due to the finite length of social connections. Via extensive numerical simulations, we find that as the rationality is enhanced not only the consumer surplus but also the firm’s profit is increased. The implication of our results is also discussed.

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

  4. Site suitability, selection and characterization: Branch technical position--Low-Level Waste Licensing Branch

    International Nuclear Information System (INIS)

    Siefken, D.; Pangburn, G.; Pennifill, R.; Starmer, R.J.

    1982-04-01

    The staff provides an expanded interpretation of the site suitability requirements in the proposed rule 10 CFR Part 61, a description of the anticipated site selection process, and a detailed discussion of the site characterization program needed to support a license application and environmental report. The paper provides early-on guidance to prospective applicants in these three subject areas

  5. Cucker-Smale Flocking with Bounded Cohesive and Repulsive Forces

    Directory of Open Access Journals (Sweden)

    Qiang Song

    2013-01-01

    Full Text Available This paper proposes two Cucker-Smale-type flocking models by introducing both cohesive and repulsive forces to second-order multiagent systems. Under some mild conditions on the initial state of the flocking system, it is shown that the velocity consensus of the agents can be reached independent of the parameter which describes the decay of communication rates. In particular, the collision between any two agents can always be avoided by designing an appropriate bounded repulsive function based on the initial energy of the flock. Numerical examples are given to demonstrate the effectiveness of the theoretical analysis.

  6. Holographic Bound in Quantum Field Energy Density and Cosmological Constant

    OpenAIRE

    Castorina, Paolo

    2012-01-01

    The cosmological constant problem is reanalyzed by imposing the limitation of the number of degrees of freedom (d.o.f.) due to entropy bounds directly in the calculation of the energy density of a field theory. It is shown that if a quantum field theory has to be consistent with gravity and holography, i.e. with an upper limit of storing information in a given area, the ultraviolet momentum cut-off is not the Planck mass, M_p, as naively expected, but M_p/N_U^(1/4) where N_U is the number of ...

  7. Foreign Banks: Internal Control and Audit Weaknesses in U.S. Branches

    National Research Council Canada - National Science Library

    1997-01-01

    .... Weaknesses in the branch's internal controls, including inadequate segregation of duties in trading and electronic funds transfer activities, had enabled an employee to trade illegally and to hide...

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

  9. Evaluating risk using bounding calculations and limited data; TOPICAL

    International Nuclear Information System (INIS)

    COWLEY, W.L.

    1999-01-01

    This paper describes a methodology for estimating the potential risk to workers and the public from igniting organic solvents in any of the 177 underground waste storage tanks at the Hanford Site in southeastern Washington state. The Hanford Site is one of the U.S. Department of Energy's former production facilities for nuclear materials. The tanks contain mixed radioactive wastes. Risk is measured by calculating toxicological and radiological accident consequences and frequencies and comparing the results to established regulatory guidelines. Available sample data is insufficient to adequately characterize the waste and solvent, so a model that maximizes releases from the tanks (bounding case) is used. Maximizing releases (and thus consequences) is a standard technique used in safety analysis to compensate for lack of information. The model predicts bounding values of fire duration, the time at which the fire extinguishes because of lack of oxygen, and a pressure history of a fire in a tank. The model output is used to calculate mass and volume release rates of material from the tanks. The mass and volume release rates permit calculation of radiological and toxicological consequences. The resulting consequence calculations demonstrate that risk from an organic solvent fire in the tanks is within regulatory guidelines

  10. Estimating risk using bounding calculations and limited data

    International Nuclear Information System (INIS)

    COWLEY, W.L.

    1999-01-01

    This paper describes a methodology for estimating the potential risk to workers and the public from igniting organic solvents in any of the 177 underground waste storage tanks at the Hanford Site in southeastern Washington state. The Hanford Site is one of the U.S. Department of Energy's former production facilities for nuclear materials. The tanks contain mixed radioactive wastes. Risk is measured by calculating toxicological and radiological accident consequences and frequencies and comparing the results to established regulatory guidelines. Available sample data is insufficient to adequately characterize the waste and solvent, so a model that maximizes releases from the tanks (bounding case) is used. Maximizing releases (and thus consequences) is a standard technique used in safety analysis to compensate for lack of information. The model predicts bounding values of fire duration, the time at which the fire extinguishes because of lack of oxygen, and a pressure history of a fire in a tank. The model output is used to calculate mass and volume release rates of material from the tanks. The mass and volume release rates permit calculation of radiological and toxicological consequences. The resulting consequence calculations demonstrate that risk from an organic solvent fire in the tanks is within regulatory guidelines

  11. Bounds for percolation thresholds on directed and undirected graphs

    Science.gov (United States)

    Hamilton, Kathleen; Pryadko, Leonid

    2015-03-01

    Percolation theory is an efficient approach to problems with strong disorder, e.g., in quantum or classical transport, composite materials, and diluted magnets. Recently, the growing role of big data in scientific and industrial applications has led to a renewed interest in graph theory as a tool for describing complex connections in various kinds of networks: social, biological, technological, etc. In particular, percolation on graphs has been used to describe internet stability, spread of contagious diseases and computer viruses; related models describe market crashes and viral spread in social networks. We consider site-dependent percolation on directed and undirected graphs, and present several exact bounds for location of the percolation transition in terms of the eigenvalues of matrices associated with graphs, including the adjacency matrix and the Hashimoto matrix used to enumerate non-backtracking walks. These bounds correspond t0 a mean field approximation and become asymptotically exact for graphs with no short cycles. We illustrate this convergence numerically by simulating percolation on several families of graphs with different cycle lengths. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-11-1-0027.

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

    DEFF Research Database (Denmark)

    Uchoa, Eduardo; Fukasawa, Ricardo; Lysgaard, Jens

    2008-01-01

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

  13. Parallel algorithms and cluster computing

    CERN Document Server

    Hoffmann, Karl Heinz

    2007-01-01

    This book presents major advances in high performance computing as well as major advances due to high performance computing. It contains a collection of papers in which results achieved in the collaboration of scientists from computer science, mathematics, physics, and mechanical engineering are presented. From the science problems to the mathematical algorithms and on to the effective implementation of these algorithms on massively parallel and cluster computers we present state-of-the-art methods and technology as well as exemplary results in these fields. This book shows that problems which seem superficially distinct become intimately connected on a computational level.

  14. Quark-antiquark bound-state spectroscopy and QCD

    International Nuclear Information System (INIS)

    Bloom, E.D.

    1982-11-01

    The discussion covers quarks as we know them, the classification of ordinary mesons in terms of constituent quarks, hidden charm states and charmed mesons, bottom quarks, positronium as a model for quarti q, quantum chromodynamics and its foundation in experiment, the charmonium model, the mass of states, fine structure and hyperfine structure, classification, widths of states, rate and multipolarity of gamma transitions, questions about bottom, leptonic widths and the determination of Q/sub b/, the mass splitting of the n 3 S 1 states, the center of gravity of the masses of the n 3 P; states, n 3 P; fine structure and classification, branching ratios for upsilon' → tau chi/sub 6j/ and the tau cascade reactions, hyperfine splitting, and top

  15. Quark-antiquark bound-state spectroscopy and QCD

    Energy Technology Data Exchange (ETDEWEB)

    Bloom, E.D.

    1982-11-01

    The discussion covers quarks as we know them, the classification of ordinary mesons in terms of constituent quarks, hidden charm states and charmed mesons, bottom quarks, positronium as a model for quarti q, quantum chromodynamics and its foundation in experiment, the charmonium model, the mass of states, fine structure and hyperfine structure, classification, widths of states, rate and multipolarity of gamma transitions, questions about bottom, leptonic widths and the determination of Q/sub b/, the mass splitting of the n/sup 3/S/sub 1/ states, the center of gravity of the masses of the n/sup 3/P; states, n/sup 3/ P; fine structure and classification, branching ratios for upsilon' ..-->.. tau chi/sub 6j/ and the tau cascade reactions, hyperfine splitting, and top. (GHT)

  16. Quantum walks and search algorithms

    CERN Document Server

    Portugal, Renato

    2013-01-01

    This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classical random walks. It is known that quantum computers have great power for searching unsorted databases. This power extends to many kinds of searches, particularly to the problem of finding a specific location in a spatial layout, which can be modeled by a graph. The goal is to find a specific node knowing that the particle uses the edges to jump from one node to the next. This book is self-contained with main topics that include: Grover's algorithm, describing its geometrical interpretation and evolution by means of the spectral decomposition of the evolution operater Analytical solutions of quantum walks on important graphs like line, cycles, two-dimensional lattices, and hypercubes using Fourier transforms Quantum walks on generic graphs, describing methods to calculate the limiting d...

  17. Confidence bounds and hypothesis tests for normal distribution coefficients of variation

    Science.gov (United States)

    Steve Verrill; Richard A. Johnson

    2007-01-01

    For normally distributed populations, we obtain confidence bounds on a ratio of two coefficients of variation, provide a test for the equality of k coefficients of variation, and provide confidence bounds on a coefficient of variation shared by k populations.

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

  19. Branch of bank, change of its status and its value in contemporary Czech banking system.

    OpenAIRE

    Čížek, Martin

    2009-01-01

    This study concerns view of contemporary branch of bank. It shortly deals with history of bank branch in Czech environment after 1989. Further the study analyses its importance, advantages and disadvantages comparing direct banking - online banking in particular. The key point of the study is to answer the question if there is a future of branch of bank. Whether it will cooperate successfully with internet online channels of communication or it will be superseded by online banking at all.

  20. Axisymmetric thermoviscoelastoplastic state of branched laminar shells, taking account of transverse-shear and torsional deformation

    International Nuclear Information System (INIS)

    Galishin, A.Z.

    1995-01-01

    The nonaxisymmetric thermoelastic stress-strain state (SSS) of branched laminar orthotropic shells was considered; the axisymmetric thermoviscoelastic SSS of branched laminar orthotropic shells was considered; and the axisymmetric thermoviscoelastoplastic SSS of branched laminar isotropic shells was considered, taking into account of the transverse-shear deformation. In the present work, in contrast, the axisymmetric thermoviscoelastoplastic SSS of branched laminar isotropic shells is considered, taking account of transverse-shear and torsional deformation. Layers that are made from orthotropic materials and deform in the elastic region may be present

  1. Branched-linear and agglomerate protein polymers as vaccine platforms.

    Science.gov (United States)

    Wang, Leyi; Xia, Ming; Huang, Pengwei; Fang, Hao; Cao, Dianjun; Meng, Xiang-Jin; McNeal, Monica; Jiang, Xi; Tan, Ming

    2014-09-01

    Many viral structural proteins and their truncated domains share a common feature of homotypic interaction forming dimers, trimers, and/or oligomers with various valences. We reported previously a simple strategy for construction of linear and network polymers through the dimerization feature of viral proteins for vaccine development. In this study, technologies were developed to produce more sophisticated polyvalent complexes through both the dimerization and oligomerization natures of viral antigens. As proof of concept, branched-linear and agglomerate polymers were made via fusions of the dimeric glutathione-s-transferase (GST) with either a tetrameric hepatitis E virus (HEV) protruding protein or a 24-meric norovirus (NoV) protruding protein. Furthermore, a monomeric antigen, either the M2e epitope of influenza A virus or the VP8* antigen of rotavirus, was inserted and displayed by the polymer platform. All resulting polymers were easily produced in Escherichia coli at high yields. Immunization of mice showed that the polymer vaccines induced significantly higher specific humoral and T cell responses than those induced by the dimeric antigens. Additional evidence in supporting use of polymer vaccines included the significantly higher neutralization activity and protective immunity of the polymer vaccines against the corresponding viruses than those of the dimer vaccines. Thus, our technology for production of polymers containing different viral antigens offers a strategy for vaccine development against infectious pathogens and their associated diseases. Copyright © 2014 Elsevier Ltd. All rights reserved.

  2. Lower and Upper Bounds for the Node, Edge, and Arc Routing Problem

    DEFF Research Database (Denmark)

    Bach, Lukas; Wøhlk, Sanne; Hasle, Geir

    The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004. They also proposed a memetic algorithm procedure and defined a set of test instances: the so-called CBMix benchmark. The NEARP generalizes the classical CVRP, the CARP, and the General Routing Problem...... for the CARP. We also define two novel sets of test instances to complement the CBMix benchmark. The first is based on well-known CARP instances; the second consists of real life cases of newspaper delivery routing. We provide numerical results in the form 1 of lower and best known upper bounds for all...... instances of all three benchmarks. For two of the instances, the gap is closed....

  3. Hill climbing algorithms and trivium

    DEFF Research Database (Denmark)

    Borghoff, Julia; Knudsen, Lars Ramkilde; Matusiewicz, Krystian

    2011-01-01

    This paper proposes a new method to solve certain classes of systems of multivariate equations over the binary field and its cryptanalytical applications. We show how heuristic optimization methods such as hill climbing algorithms can be relevant to solving systems of multivariate equations....... A characteristic of equation systems that may be efficiently solvable by the means of such algorithms is provided. As an example, we investigate equation systems induced by the problem of recovering the internal state of the stream cipher Trivium. We propose an improved variant of the simulated annealing method...

  4. Nonmyopic Sensor Scheduling and its Efficient Implementation for Target Tracking Applications

    Directory of Open Access Journals (Sweden)

    Morrell Darryl

    2006-01-01

    Full Text Available We propose two nonmyopic sensor scheduling algorithms for target tracking applications. We consider a scenario where a bearing-only sensor is constrained to move in a finite number of directions to track a target in a two-dimensional plane. Both algorithms provide the best sensor sequence by minimizing a predicted expected scheduler cost over a finite time-horizon. The first algorithm approximately computes the scheduler costs based on the predicted covariance matrix of the tracker error. The second algorithm uses the unscented transform in conjunction with a particle filter to approximate covariance-based costs or information-theoretic costs. We also propose the use of two branch-and-bound-based optimal pruning algorithms for efficient implementation of the scheduling algorithms. We design the first pruning algorithm by combining branch-and-bound with a breadth-first search and a greedy-search; the second pruning algorithm combines branch-and-bound with a uniform-cost search. Simulation results demonstrate the advantage of nonmyopic scheduling over myopic scheduling and the significant savings in computational and memory resources when using the pruning algorithms.

  5. Fault Branching and Long-Term Earthquake Rupture Scenario for Strike-Slip Earthquake

    Science.gov (United States)

    Klinger, Y.; CHOI, J. H.; Vallage, A.

    2017-12-01

    Careful examination of surface rupture for large continental strike-slip earthquakes reveals that for the majority of earthquakes, at least one major branch is involved in the rupture pattern. Often, branching might be either related to the location of the epicenter or located toward the end of the rupture, and possibly related to the stopping of the rupture. In this work, we examine large continental earthquakes that show significant branches at different scales and for which ground surface rupture has been mapped in great details. In each case, rupture conditions are described, including dynamic parameters, past earthquakes history, and regional stress orientation, to see if the dynamic stress field would a priori favor branching. In one case we show that rupture propagation and branching are directly impacted by preexisting geological structures. These structures serve as pathways for the rupture attempting to propagate out of its shear plane. At larger scale, we show that in some cases, rupturing a branch might be systematic, hampering possibilities for the development of a larger seismic rupture. Long-term geomorphology hints at the existence of a strong asperity in the zone where the rupture branched off the main fault. There, no evidence of throughgoing rupture could be seen along the main fault, while the branch is well connected to the main fault. This set of observations suggests that for specific configurations, some rupture scenarios involving systematic branching are more likely than others.

  6. A branch and cut approach to the multiproduct pipeline scheduling problem

    Energy Technology Data Exchange (ETDEWEB)

    Souza Filho, Erito Marques de; Bahiense, Laura; Ferreira Filho, Virgilio Jose Martins [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil)

    2009-07-01

    Pipelines are known as the most reliable and economical mode of transportation for petroleum and its derivatives, especially when large amounts of products have to be pumped for large distances. We address the short-term schedule of a pipeline system comprising the distribution of several petroleum derivatives from a single oil refinery to several depots, connected to local consumer markets, through a single multi-product pipeline. The major difficulties faced in these operations are related to the satisfaction of product demands by the various consumer markets, and operational constraints such as the maximum sizes of contiguous pumping packs, and the immiscible products. Several researchers have developed models and techniques for this short-term pipeline scheduling problem. Two different methodologies have been proposed in the literature: heuristic search techniques and exact methods. In this paper, we use a branch-and cut algorithm, performed in Xpress-MP{sup T}M, and compare the solutions obtained with that ones obtained before using the Variable Neighborhood Search metaheuristic. The computational results showed a significant improvement of performance in relation to previous algorithm. (author)

  7. Covalently bound molecular states in beryllium and carbon isotopes

    International Nuclear Information System (INIS)

    Wolfram von, Oertzen; Hans-Gerhard, Bohlen; Wolfram von, Oertzen

    2003-01-01

    Nuclear clustering in N=Z nuclei has been studied since many decades. States close to the decay thresholds, as described by the Ikeda diagram, are of particular interest. Recent studies in loosely bound systems, as observed with neutron-rich nuclei has revived the interest in cluster structures in nuclei, with additional valence neutrons, which give rise to pronounced covalent molecular structures. The Beryllium isotopes represent the first example of such unique states in nuclear physics with extreme deformations. In the deformed shell model these are referred to as super- and hyper-deformation. These states can be described explicitly by molecular concepts, with neutrons in covalent binding orbits. Examples of recent experiments performed at the HMI-Berlin demonstrating the molecular structure of the rotational bands in Beryllium isotopes are presented. Further work on chain states (nuclear polymers) in the carbon isotopes is in progress, these are the first examples of deformed structures in nuclei with an axis ratio of 3:1. A threshold diagram with clusters bound via neutrons in covalent molecular configurations can be established, which can serve as a guideline for future work. (authors)

  8. Upper and lower Higgs boson mass bounds from a chirally invariant lattice Higgs-Yukawa model

    International Nuclear Information System (INIS)

    Gerhold, Philipp Frederik Clemens

    2009-01-01

    Motivated by the advent of the Large Hadron Collider (LHC) the aim of the present work is the non-perturbative determination of the cutoff-dependent upper and lower mass bounds of the Standard Model Higgs boson based on first principle calculations, in particular not relying on additional information such as the triviality property of the Higgs- Yukawa sector or indirect arguments like vacuum stability considerations. For that purpose the lattice approach is employed to allow for a non-perturbative investigation of a chirally invariant lattice Higgs-Yukawa model, serving here as a reasonable simplification of the full Standard Model, containing only those fields and interactions which are most essential for the intended Higgs boson mass determination. These are the complex Higgs doublet as well as the top and bottom quark fields and their mutual interactions. To maintain the chiral character of the Standard Model Higgs-fermion coupling also on the lattice, the latter model is constructed on the basis of the Neuberger overlap operator, obeying then an exact global lattice chiral symmetry. Respecting the fermionic degrees of freedom in a fully dynamical manner by virtue of a PHMC algorithm appropriately adapted to the here intended lattice calculations, such mass bounds can indeed be established with the aforementioned approach. Supported by analytical calculations performed in the framework of the constraint effective potential, the lower bound is found to be approximately m low H (Λ)=80 GeV at a cutoff of Λ=1000 GeV. The emergence of a lower Higgs boson mass bound is thus a manifest property of the pure Higgs-Yukawa sector that evolves directly from the Higgs-fermion interaction for a given set of Yukawa coupling constants. Its quantitative size, however, turns out to be non-universal in the sense, that it depends on the specific form, for instance, of the Higgs boson self-interaction. The upper Higgs boson mass bound is then established in the strong coupling

  9. Data streams: algorithms and applications

    National Research Council Canada - National Science Library

    Muthukrishnan, S

    2005-01-01

    ... massive data sets in general. Researchers in Theoretical Computer Science, Databases, IP Networking and Computer Systems are working on the data stream challenges. This article is an overview and survey of data stream algorithmics and is an updated version of [175]. S. Muthukrishnan Rutgers University, New Brunswick, NJ, USA, muthu@cs...

  10. Algorithms as fetish: Faith and possibility in algorithmic work

    Directory of Open Access Journals (Sweden)

    Suzanne L Thomas

    2018-01-01

    Full Text Available Algorithms are powerful because we invest in them the power to do things. With such promise, they can transform the ordinary, say snapshots along a robotic vacuum cleaner’s route, into something much more, such as a clean home. Echoing David Graeber’s revision of fetishism, we argue that this easy slip from technical capabilities to broader claims betrays not the “magic” of algorithms but rather the dynamics of their exchange. Fetishes are not indicators of false thinking, but social contracts in material form. They mediate emerging distributions of power often too nascent, too slippery or too disconcerting to directly acknowledge. Drawing primarily on 2016 ethnographic research with computer vision professionals, we show how faith in what algorithms can do shapes the social encounters and exchanges of their production. By analyzing algorithms through the lens of fetishism, we can see the social and economic investment in some people’s labor over others. We also see everyday opportunities for social creativity and change. We conclude that what is problematic about algorithms is not their fetishization but instead their stabilization into full-fledged gods and demons – the more deserving objects of critique.

  11. Simple bounds and monotonicity results for finite multi-server exponential tandem queues

    NARCIS (Netherlands)

    Dijk, van N.M.; Wal, van der J.

    1989-01-01

    Simple and computationally attractive lower and upper bounds are presented for the call congestion such as those representing multi-server loss or delay stations. Numerical computations indicate a potential usefulness of the bounds for quick engineering purposes. The bounds correspond to

  12. Confidence bounds and hypothesis tests for normal distribution coefficients of variation

    Science.gov (United States)

    Steve P. Verrill; Richard A. Johnson

    2007-01-01

    For normally distributed populations, we obtain confidence bounds on a ratio of two coefficients of variation, provide a test for the equality of k coefficients of variation, and provide confidence bounds on a coefficient of variation shared by k populations. To develop these confidence bounds and test, we first establish that estimators based on Newton steps from n-...

  13. A behavioral characterization of the positive real and bounded real characteristic values in balancing

    NARCIS (Netherlands)

    Trentelman, H.L.

    In passivity preserving and bounded realness preserving model reduction by balanced truncation, an important role is played by the so-called positive real (PR) and bounded real (BR) characteristic values. Both for the positive real as well as the bounded real case, these values are defined in terms

  14. Adaptive protection algorithm and system

    Science.gov (United States)

    Hedrick, Paul [Pittsburgh, PA; Toms, Helen L [Irwin, PA; Miller, Roger M [Mars, PA

    2009-04-28

    An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.

  15. Supergravity and upper bound on scale of supersymmetry breaking

    International Nuclear Information System (INIS)

    Kim, J.E.; Nishino, H.

    1983-09-01

    In locally supersymmetric grand unified models we show rather a model independent upper bound 3x10 11 GeV for the scale of supersymmetry breaking, which is derived by considering SU(2)xU(1) breaking at electro-weak mass scale. This bound necessarily implies the existence of new particles (superpartners) below 10 4 GeV. (author)

  16. The wave function and minimum uncertainty function of the bound quadratic Hamiltonian system

    Science.gov (United States)

    Yeon, Kyu Hwang; Um, Chung IN; George, T. F.

    1994-01-01

    The bound quadratic Hamiltonian system is analyzed explicitly on the basis of quantum mechanics. We have derived the invariant quantity with an auxiliary equation as the classical equation of motion. With the use of this invariant it can be determined whether or not the system is bound. In bound system we have evaluated the exact eigenfunction and minimum uncertainty function through unitary transformation.

  17. An evolutionary model of bounded rationality and intelligence.

    Directory of Open Access Journals (Sweden)

    Thomas J Brennan

    Full Text Available BACKGROUND: Most economic theories are based on the premise that individuals maximize their own self-interest and correctly incorporate the structure of their environment into all decisions, thanks to human intelligence. The influence of this paradigm goes far beyond academia-it underlies current macroeconomic and monetary policies, and is also an integral part of existing financial regulations. However, there is mounting empirical and experimental evidence, including the recent financial crisis, suggesting that humans do not always behave rationally, but often make seemingly random and suboptimal decisions. METHODS AND FINDINGS: Here we propose to reconcile these contradictory perspectives by developing a simple binary-choice model that takes evolutionary consequences of decisions into account as well as the role of intelligence, which we define as any ability of an individual to increase its genetic success. If no intelligence is present, our model produces results consistent with prior literature and shows that risks that are independent across individuals in a generation generally lead to risk-neutral behaviors, but that risks that are correlated across a generation can lead to behaviors such as risk aversion, loss aversion, probability matching, and randomization. When intelligence is present the nature of risk also matters, and we show that even when risks are independent, either risk-neutral behavior or probability matching will occur depending upon the cost of intelligence in terms of reproductive success. In the case of correlated risks, we derive an implicit formula that shows how intelligence can emerge via selection, why it may be bounded, and how such bounds typically imply the coexistence of multiple levels and types of intelligence as a reflection of varying environmental conditions. CONCLUSIONS: Rational economic behavior in which individuals maximize their own self interest is only one of many possible types of behavior that

  18. An evolutionary model of bounded rationality and intelligence.

    Science.gov (United States)

    Brennan, Thomas J; Lo, Andrew W

    2012-01-01

    Most economic theories are based on the premise that individuals maximize their own self-interest and correctly incorporate the structure of their environment into all decisions, thanks to human intelligence. The influence of this paradigm goes far beyond academia-it underlies current macroeconomic and monetary policies, and is also an integral part of existing financial regulations. However, there is mounting empirical and experimental evidence, including the recent financial crisis, suggesting that humans do not always behave rationally, but often make seemingly random and suboptimal decisions. Here we propose to reconcile these contradictory perspectives by developing a simple binary-choice model that takes evolutionary consequences of decisions into account as well as the role of intelligence, which we define as any ability of an individual to increase its genetic success. If no intelligence is present, our model produces results consistent with prior literature and shows that risks that are independent across individuals in a generation generally lead to risk-neutral behaviors, but that risks that are correlated across a generation can lead to behaviors such as risk aversion, loss aversion, probability matching, and randomization. When intelligence is present the nature of risk also matters, and we show that even when risks are independent, either risk-neutral behavior or probability matching will occur depending upon the cost of intelligence in terms of reproductive success. In the case of correlated risks, we derive an implicit formula that shows how intelligence can emerge via selection, why it may be bounded, and how such bounds typically imply the coexistence of multiple levels and types of intelligence as a reflection of varying environmental conditions. Rational economic behavior in which individuals maximize their own self interest is only one of many possible types of behavior that arise from natural selection. The key to understanding which types of

  19. Algorithms and Public Service Media

    DEFF Research Database (Denmark)

    Sørensen, Jannick Kirk; Hutchinson, Jonathon

    2018-01-01

    When Public Service Media (PSM) organisations introduce algorithmic recommender systems to suggest media content to users, fundamental values of PSM are challenged. Beyond being confronted with ubiquitous computer ethics problems of causality and transparency, also the identity of PSM as curator...

  20. On the supremum and infimum of bounded quantum observables

    International Nuclear Information System (INIS)

    Long Long; Zhang Shifang

    2011-01-01

    Let S(H) be the set of all bounded self-adjoint linear operators on a complex Hilbert space H. In 2006, Gudder [Math. Slovaca 56, 573 (2006)] introduced a new order ≼ on S(H). Since then, the existence conditions and representations of the supremum and infimum of two elements in S(H) with respect to the order ≼ have been intensively studied. Specifically, Li and Sun [J. Math. Phys. 50, 122107 (2009)] obtained simpler representations of A and P and A or P, where A(set-membership sign)S(H) and P is an orthogonal projection on H. In this note, we present more intuitive and concise results on A or P and extend the results of Li and Sun to more general cases. Moreover, some applications of our results are given to show that our results are easier to deal with.