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 SEPARABLE CONCAVE PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    Hong-gang Xue; Cheng-xian; Feng-min Xu

    2004-01-01

    In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB)technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved that the LDB method is a normal rectangle subdivision(NRS). Numerical tests on problems with dimensions from 100 to 10000 show that the proposed branch and bound algorithm is efficient for solving large scale separable concave programming problems, and convergence rate is faster than ω-subdivision method.

  3. Constrained branch-and-bound algorithm for image registration

    Institute of Scientific and Technical Information of China (English)

    JIN Jian-qiu; WANG Zhang-ye; PENG Qun-sheng

    2005-01-01

    In this paper, the authors propose a refined Branch-and-Bound algorithm for affine-transformation based image registration. Given two feature point-sets in two images respectively, the authors first extract a sequence of high-probability matched point-pairs by considering well-defined features. Each resultant point-pair can be regarded as a constraint in the search space of Branch-and-Bound algorithm guiding the search process. The authors carry out Branch-and-Bound search with the constraint of a pair-point selected by using Monte Carlo sampling according to the match measures of point-pairs. If such one cannot lead to correct result, additional candidate is chosen to start another search. High-probability matched point-pairs usually results in fewer loops and the search process is accelerated greatly. Experimental results verify the high efficiency and robustness of the author's approach.

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

  5. Revisiting the upper bounding process in a safe Branch and Bound algorithm

    CERN Document Server

    Goldsztejn, Alexandre; Michel, Claude; Rueher, Michel

    2008-01-01

    Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce a new strategy to compute very accurate approximations of feasible points. This strategy takes advantage of the Newton method for under-constrained systems of equations and inequalities. More precisely, it exploits the optimal solution of a linear relaxation of the problem to compute efficiently a promising upper bound. First experiments on the Coconuts benchmarks demonstrate that this approach is very effective.

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

    Institute of Scientific and Technical Information of China (English)

    LI Zi; CAI YueMing

    2008-01-01

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

  7. The lower bound on complexity of parallel branch-and-bound algorithm for subset sum problem

    Science.gov (United States)

    Kolpakov, Roman; Posypkin, Mikhail

    2016-10-01

    The subset sum problem is a particular case of the Boolean knapsack problem where each item has the price equal to its weight. This problem can be informally stated as searching for most dense packing of a set of items into a box with limited capacity. Recently, coarse-grain parallelization approaches to Branch-and-Bound (B&B) method attracted some attention due to the growing popularity of weakly-connected distributed computing platforms. In this paper we consider one of such approaches for solving the subset sum problem. One of the processors (manager) performs some number of B&B steps on the first stage with generating some subproblems. On the second stage, the generated subproblems are sent to other processors, one subproblem per processor. The processors solve completely the received subproblems, the manager collects all the obtained solutions and chooses the optimal one. For this algorithm we formally define the parallel execution model (frontal scheme of parallelization) and the notion of the frontal scheme complexity. We study the frontal scheme complexity for a series of subset sum problems.

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

    Science.gov (United States)

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

    2016-11-01

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

  9. A Branch and Bound Algorithm for the Protein Folding Problem in the HP Lattice Model

    Institute of Scientific and Technical Information of China (English)

    Mao Chen; Wen-Qi Huang

    2005-01-01

    A branch and bound algorithm is proposed for the two-dimensional protein folding problem in the HP lattice model. In this algorithm, the benefit of each possible location of hydrophobic monomers is evaluated and only promising nodes are kept for further branching at each level. The proposed algorithm is compared with other well-known methods for 10 benchmark sequences with lengths ranging from 20 to 100 monomers. The results indicate that our method is a very efficient and promising tool for the protein folding problem.

  10. A branch-and-bound feature selection algorithm for U-shaped cost functions

    CERN Document Server

    Ris, Marcelo; Martins, David C

    2008-01-01

    This paper presents the formulation of a combinatorial optimization problem with the following characteristics: i.the search space is the power set of a finite set structured as a Boolean lattice; ii.the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics, that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed ...

  11. A-optimality orthogonal forward regression algorithm using branch and bound.

    Science.gov (United States)

    Hong, Xia; Chen, Sheng; Harris, Chris J

    2008-11-01

    In this brief, we propose an orthogonal forward regression (OFR) algorithm based on the principles of the branch and bound (BB) and A-optimality experimental design. At each forward regression step, each candidate from a pool of candidate regressors, referred to as S, is evaluated in turn with three possible decisions: 1) one of these is selected and included into the model; 2) some of these remain in S for evaluation in the next forward regression step; and 3) the rest are permanently eliminated from S . Based on the BB principle in combination with an A-optimality composite cost function for model structure determination, a simple adaptive diagnostics test is proposed to determine the decision boundary between 2) and 3). As such the proposed algorithm can significantly reduce the computational cost in the A-optimality OFR algorithm. Numerical examples are used to demonstrate the effectiveness of the proposed algorithm.

  12. A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs

    DEFF Research Database (Denmark)

    Stidsen, Thomas Riis; Andersen, Kim Allan; Dammann, Bernd

    2014-01-01

    Pareto-optimal front). In this paper, we first give a survey of the newly developed branch and bound methods for solving MOMIP problems. After that, we propose a new branch and bound method for solving a subclass of MOMIP problems, where only two objectives are allowed, the integer variables are binary...

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

    Science.gov (United States)

    Buchheim, Christoph; Caprara, Alberto; Lodi, Andrea

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

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

    Directory of Open Access Journals (Sweden)

    Shicheng Hu

    2015-01-01

    Full Text Available With respect to the block assembly schedule in a shipbuilding enterprise, a spatial resource constrained project scheduling problem (SRCPSP is proposed, which aims to minimize the makespan of a project under the constraints of the availability of a two-dimensional spatial resource and the precedence relationship between tasks. In order to solve SRCPSP to the optimum, a branch and bound algorithm (BB is developed. For the BB-SRCPSP, first, an implicitly enumerative branch scheme is presented. Secondly, a precedence based lower bound, as well as an effective dominance rule, is employed for pruning. Next, a heuristic based algorithm is used to decide the order of a node to be selected for expansion such that the efficiency of the algorithm is further improved. In addition, a maximal space based arrangement is applied to the configuration of the areas required each day in an available area. Finally, the simulation experiment is conducted to illustrate the effectiveness of the BB-SRCPSP.

  15. AN IMPROVED BRANCH-AND-BOUND ALGORITHM TO MINIMIZE THE WEIGHTED FLOWTIME ON IDENTICAL PARALLEL MACHINES WITH FAMILY SETUP TIMES

    Institute of Scientific and Technical Information of China (English)

    Belgacem BETTAYEB; Imed KACEM; Kondo H.ADJALLAH

    2008-01-01

    This article investigates identical parallel machines scheduling with family setup times. Theobjective function being the weighted sum of completion times, the problem is known to be strongly NP-hard. We propose a constructive heuristic algorithm and three complementary lower bounds. Two of these bounds proceed by elimination of setup times or by distributing each of them to jobs of the corresponding family, while the third one is based on a lagrangian relaxation. The bounds and the heuristic are incorporated into a branch-and-bound algorithm. Experimental results obtained outperform those of the methods presented in previous works, in term of size of solved problems.

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

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

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

  19. Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement

    Directory of Open Access Journals (Sweden)

    A. Shirzadeh Chaleshtarti

    2014-01-01

    Full Text Available A lot of projects in real life are subject to some kinds of nonrenewable resources that are not exactly similar to the type defined in the project scheduling literature. The difference stems from the fact that, in those projects, contrary to the common assumption in the project scheduling literature, nonrenewable resources are not available in full amount at the beginning of the project, but they are procured along the project horizon. In this paper, we study this different type of nonrenewable resources. To that end, we extend the resource constrained project scheduling problem (RCPSP by this resource type (RCPSP-NR and customize four basic branch and bound algorithms of RCPSP for it, including precedence tree, extension alternatives, minimal delaying alternatives, and minimal forbidden sets. Several bounding and fathoming rules are introduced to the algorithms to shorten the enumeration process. We perform comprehensive experimental analysis using the four customized algorithms and also CPLEX solver.

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

  1. 双向自动分支界限特征选择算法%Bidirectional Automated Branch and Bound Algorithm for Feature Selection

    Institute of Scientific and Technical Information of China (English)

    杨胜; 施鹏飞

    2005-01-01

    Feature selection is a process where a minimal feature subset is selected from an original feature set according to a certain measure. In this paper, feature relevancy is defined by an Inconsistency rate. A bidirectional automated branch and bound algorithm is presented. It is a new complete search algorithm for feature selection, which performs feature deletion and feature addition in parallel.it is fit for feature selection.

  2. Bi-objective branch-and-cut algorithms

    DEFF Research Database (Denmark)

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

    two distinct bound set based branch-and-cut algorithms for bi-objective combinatorial optimization problems, based on implicitly and explicitly stated lower bound sets, respectively. The algorithm based on explicitly given lower bound sets computes for each branching node a lower bound set...... and compares it to an upper bound set. The implicit bound set based algorithm, on the other hand, fathoms branching nodes by generating a single point on the lower bound set for each local nadir point. We outline several approaches for fathoming branching nodes and we propose an updating scheme for the lower...... bound sets that prevents us from solving the bi-objective LP-relaxation of each branching node. To strengthen the lower bound sets, we propose a bi-objective cutting plane algorithm that dynamically adjusts the weights of the objective functions such that different parts of the feasible set...

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

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

  5. PICO: An Object-Oriented Framework for Branch and Bound

    Energy Technology Data Exchange (ETDEWEB)

    ECKSTEIN,JONATHAN; HART,WILLIAM E.; PHILLIPS,CYNTHIA A.

    2000-12-01

    This report describes the design of PICO, a C++ framework for implementing general parallel branch-and-bound algorithms. The PICO framework provides a mechanism for the efficient implementation of a wide range of branch-and-bound methods on an equally wide range of parallel computing platforms. We first discuss the basic architecture of PICO, including the application class hierarchy and the package's serial and parallel layers. We next describe the design of the serial layer, and its central notion of manipulating subproblem states. Then, we discuss the design of the parallel layer, which includes flexible processor clustering and communication rates, various load balancing mechanisms, and a non-preemptive task scheduler running on each processor. We describe the application of the package to a branch-and-bound method for mixed integer programming, along with computational results on the ASCI Red massively parallel computer. Finally we describe the application of the branch-and-bound mixed-integer programming code to a resource constrained project scheduling problem for Pantex.

  6. Faster Algorithms on Branch and Clique Decompositions

    Science.gov (United States)

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

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

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

    NARCIS (Netherlands)

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

    1998-01-01

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

  8. A Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany

    Directory of Open Access Journals (Sweden)

    Yuyan Tan

    2015-01-01

    Full Text Available With the aim of supporting the process of adapting railway infrastructure and future traffic needs, we have developed a method to insert additional trains efficiently to an existing timetable without introducing large consecutive delays to scheduled trains. In this work, the problem is characterized as a job-shop scheduling problem. In order to meet the limited time requirement and minimize deviations to the existing timetable, the modification that consists of retiming or reordering trains is implemented if and only if it potentially leads to a better solution. With these issues in mind, the problem of adding train paths is decomposed into two subproblems. One is finding the optimal insertion for a fixed order timetable and the other is reordering trains. The two subproblems are solved iteratively until no improvement is possible within a time limit of computation. An innovative branch and bound algorithm and iterative reordering strategy are proposed to solve this problem in real time. Unoccupied capacities are utilized as primary resources for additional trains and the transfer connections for passengers can be guaranteed in the new timetable. From numerical investigations, the proposed framework and associated techniques are tested and shown to be effective.

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

  10. On longest edge division in simplicial branch and bound

    NARCIS (Netherlands)

    Herrera, J.F.R.; Casado, L.G.; Hendrix, E.M.T.

    2014-01-01

    Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative refinement process, a popular strategy is to divide simplices by their longest edge, thus avoiding needle-shaped simplices. A range of possibilities arises when the number of longest edges in a simplex

  11. A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags

    NARCIS (Netherlands)

    Brucker, P.; Hilbig, T.; Hurink, J.L.

    1999-01-01

    Positive and negative time-lags are general timing restrictions between the starting times of jobs which have been introduced by Roy in connection with the Metra Potential Method. They allow the consideration of positive and negative time-lags between the starting times of jobs. It is shown that com

  12. Branch and bound algorithm for the uncapacitated facility location problem%无容量限制设施选址问题的分支定界法

    Institute of Scientific and Technical Information of China (English)

    李翼; 赵茂先; 李岳佳

    2012-01-01

    设施选址问题是经典的优化问题.一个好的选址方法可以有效节省费用,促进生产和消费的协调与配合,使得设施系统平衡发展.企业的优势和公共设施的盈利能力同样依赖于设施的选址结果.介绍了无容量限制的设施选址问题,给出了该问题的数学模型,提出了解决此问题的一个精确算法———分支定界法,最后通过一个算例说明了算法的有效性.%Facility location problems are classical optimization problems.A good location method can save money efficiently,promote the coordination of production and consumption and obtain the balanced development of facility system.The competitive advantage of firms and the profitability of public facilities depend on the results of these locations.In this paper,uncapacitated facility location problem is introduced.We give a branch and bound method,which is an exact algorithm to solve this problem.Numerical examples illustrate this approach.

  13. A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Velde, van de S.L.

    1996-01-01

    We address the NP-hard single-machine problem of scheduling n independent jobs so as to minimize the sum of α times total completion time and β times total earliness with β > α, which can be rewritten as an earliness–tardiness problem. Postponing jobs by leaving the machine idle may then be advantag

  14. Um algoritmo branch-and-bound para o problema de programação de projetos com custo de disponibilidade de recursos e múltiplos modos A branch-and-bound algorithm for the resource constrained project scheduling problem with resource availability cost and multiple modes

    Directory of Open Access Journals (Sweden)

    Denise Sato Yamashita

    2007-12-01

    Full Text Available Em um estudo anterior (YAMASHITA; MORABITO, 2007a, foi proposto um algoritmo exato para resolver o problema de programação de projetos com custo de disponibilidade de recursos, considerando múltiplos modos de execução para as atividades. O algoritmo é uma adaptação de outro algoritmo exato da literatura para o caso particular do problema em que só existe um modo de executar as atividades. No presente estudo, é proposto um novo algoritmo exato baseado no método branch-and-bound para tratar do problema com múltiplos modos de execução. Como o problema é NP-difícil, o algoritmo é viável computacionalmente apenas para resolver exemplares de tamanho moderado. Diversos testes computacionais utilizando o programa gerador Progen da literatura foram realizados para comparar o desempenho do algoritmo proposto com o algoritmo anterior e também com o aplicativo CPLEX. Os resultados obtidos mostram que a versão atual do algoritmo é competitiva com os outros métodos, e estimulam a pesquisa e o desenvolvimento de versões mais elaboradas deste algoritmo.In a recent study (YAMASHITA; MORABITO, 2007a, it was proposed an exact algorithm to solve problems of resource-constrained project scheduling with resource availability costs under multiple modes of execution. That algorithm is an adaptation of another exact algorithm recorded in the literature for the particular case where there is only a single mode for executing the tasks. In the present study, we propose a new exact algorithm based on the branch and bound method to deal with multiple performing modes problem. Since the problem is NP-hard, the algorithm is computationally viable only for problems of moderate size. Numerous computational tests using the generator ProGen were run to compare the performance of the proposed algorithm with the former algorithm and with the CPLEX software. The results show that the proposed version of the algorithm is competitive with the other methods and

  15. Some distance bounds of branching processes and their diffusion limits

    CERN Document Server

    Kammerer, Niels B

    2010-01-01

    We compute exact values respectively bounds of "distances" - in the sense of (transforms of) power divergences and relative entropy - between two discrete-time Galton-Watson branching processes with immigration GWI for which the offspring as well as the immigration is arbitrarily Poisson-distributed (leading to arbitrary type of criticality). Implications for asymptotic distinguishability behaviour in terms of contiguity and entire separation of the involved GWI are given, too. Furthermore, we determine the corresponding limit quantities for the context in which the two GWI converge to Feller-type branching diffusion processes, as the time-lags between observations tend to zero. Some applications to (static random environment like) Bayesian decision making and Neyman-Pearson testing are presented as well.

  16. Design of planar articulated mechanisms using branch and bound

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Kawamoto, Atsushi

    2005-01-01

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

  17. Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning

    CERN Document Server

    Dimitrakakis, Christos

    2009-01-01

    There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most problems of interest, the optimal solution involves planning in an infinitely large tree. However, it is possible to obtain stochastic lower and upper bounds on the value of each tree node. This enables us to use stochastic branch and bound algorithms to search the tree efficiently. This paper proposes two such algorithms and examines their complexity in this setting.

  18. Betweenness Centrality : Algorithms and Lower Bounds

    CERN Document Server

    Kintali, Shiva

    2008-01-01

    One of the most fundamental problems in large scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely used metric to measure the importance of a node in a network. In this paper, we present a randomized parallel algorithm, lower bounds and an algebraic method for computing betweenness centrality of all nodes in a network. We prove that any path comparison based algorithm cannot compute betweenness of all nodes in less than O(nm) time.

  19. Planeación de sistemas secundarios de distribución usando el algoritmo Branch and Bound Secondary distribution system planning using branch and bound

    Directory of Open Access Journals (Sweden)

    Ricardo Alberto Hincapie-Isaza

    2011-06-01

    Full Text Available En este trabajo se plantea una metodología para la solución del problema delplaneamiento de sistemas secundarios de distribución considerando un modelode programación lineal entero mixto (PLEM, el cual considera la ubicación y dimensionamiento de transformadores de distribución, el dimensionamientoy rutas de circuitos secundarios y sus costos variables. Para la solución delproblema se emplea el algoritmo Branch and Bound. Los resultados obtenidosen un sistema de prueba empleado en la literatura especializada muestran lavalidez y efectividad de la metodología propuesta.This paper presents a methodology for solving secondary distribution systems planning problem as a mixed integer linear programming problem (MILP. The algorithm takes into account several design issues such as the capacity and location of distribution transformers and secondary feeders. Variable costs of secondary feeders are also considered. The problem is solved using branch and bound algorithm. Numerical results show that the mathematical model and the solution technique are effective for this kind of problems.

  20. Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound

    Science.gov (United States)

    Saad, Shakila; Wan Jaafar, Wan Nurhadani; Jamil, Siti Jasmida

    2013-04-01

    The standard Traveling Salesman Problem (TSP) is the classical Traveling Salesman Problem (TSP) while Multiple Traveling Salesman Problem (MTSP) is an extension of TSP when more than one salesman is involved. The objective of MTSP is to find the least costly route that the traveling salesman problem can take if he wishes to visit exactly once each of a list of n cities and then return back to the home city. There are a few methods that can be used to solve MTSP. The objective of this research is to implement an exact method called Branch-and-Bound (B&B) algorithm. Briefly, the idea of B&B algorithm is to start with the associated Assignment Problem (AP). A branching strategy will be applied to the TSP and MTSP which is Breadth-first-Search (BFS). 11 nodes of cities are implemented for both problem and the solutions to the problem are presented.

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

    Institute of Scientific and Technical Information of China (English)

    田朝薇; 宋海洲

    2012-01-01

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

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

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

    NARCIS (Netherlands)

    Truetsch, U.

    2014-01-01

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

  4. 基于分支定界算法的飞机结构件元特征排序%Meta-Feature Sequencing of Aircraft Structural Part Based on Branch-and-Bound Algorithm

    Institute of Scientific and Technical Information of China (English)

    黄玲玲; 李迎光; 王伟; 汤立民

    2015-01-01

    针对现在定义的飞机结构件加工特征与加工操作不一一对应导致的特征排序存在大量空走刀问题,将加工特征分解为与加工操作一一对应的元特征。基于加工规则和最小耗费分支定界算法对元特征进行排序,实现刀具非切削行程最短。%The one-to-many mappings between the current deifned machining features and the machining operations lead to the increasing of the non-cutting path. In order to solve this problem, the machining features are de-composed into meta-features that are associated with a sin-gle machining operation individually. The rules abstracted from the machining process and the branch-and-bound algorithm are employed to sequence the meta-features to minimum the non-cutting path.

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

    OpenAIRE

    Simanjuntak, Daniel TS

    2016-01-01

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

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

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

  8. Bounds of Deviation for Branching Chains in Random Environments

    Institute of Scientific and Technical Information of China (English)

    Wei Gang WANG

    2011-01-01

    We consider non-extinct branching processes in general random environments. Under the condition of means and second moments of each generation being bounded, we give the upper bounds and lower bounds for some form deviations of the process.

  9. A branch-and-cut algorithm for the bandwidth packing problem

    Energy Technology Data Exchange (ETDEWEB)

    Park, S.; Park, K.; Kang, S.

    1994-12-31

    We consider the bandwidth packing problem, that arises in the telecommunication network. The problem is to determine the set of calls and the assignment of them to the paths in an arc capacitated network to maximize profit. The problem is formulated by using path variables. To solve LP relaxation, an efficient column generation technique is proposed. Moreover, modified cover inequality is used to strengthen the formulation. The algorithm incorporates the column generation technique and the strong cutting plane approach into the branch-and-bound scheme. We test the proposed algorithm on several problem instances. The results show that the algorithm can be used to solve the problems to optimality within reasonably small time limits.

  10. Variables Bounding Based Retiming Algorithm

    Institute of Scientific and Technical Information of China (English)

    宫宗伟; 林争辉; 陈后鹏

    2002-01-01

    Retiming is a technique for optimizing sequential circuits. In this paper, wediscuss this problem and propose an improved retiming algorithm based on variables bounding.Through the computation of the lower and upper bounds on variables, the algorithm can signi-ficantly reduce the number of constraints and speed up the execution of retiming. Furthermore,the elements of matrixes D and W are computed in a demand-driven way, which can reducethe capacity of memory. It is shown through the experimental results on ISCAS89 benchmarksthat our algorithm is very effective for large-scale sequential circuits.

  11. Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC and a modified branch-and-bound method (MBB

    Directory of Open Access Journals (Sweden)

    Mukhacheva E.A.

    2000-01-01

    Full Text Available Two algorithms for the one-dimensional cutting problem, namely, a modified branch-and-bound method (exact method and a heuristic sequential value correction method are suggested. In order to obtain a reliable assessment of the efficiency of the algorithms, hard instances of the problem were considered and from the computational experiment it seems that the efficiency of the heuristic method appears to be superior to that of the exact one, taking into account the computing time of the latter. A detailed description of the two methods is given along with suggestions for their improvements.

  12. 考虑大宗交易的均值-方差投资组合优化模型及其分支定界算法%Portfolio optimization model and branch-bound algorithm under block trading

    Institute of Scientific and Technical Information of China (English)

    薛宏刚; 张川; 胡春萍; 徐成贤

    2011-01-01

    In this paper, we consider the portfolio optimal problem under block trading. As the decrease of marginal transaction cost under block trading, we establish the mean-variance portfolio optimization model and the corresponding algorithm by means of fit transaction cost function with linear and concave form. Computational results are presented by considering the stocks involved in Hang Seng Index to show that: The efficient frontier under block trading is between that with linear transaction cost and without transaction cost; The investment risk can be eliminated by portfolio diversification, but the effect of that is dilute under block trading; In terms of linear transaction cost, the greater the transaction cost under block trading, the higher the portfolio concentration.%由于大宗交易下边际交易费用递减,因此用线性加凹的函数拟合实际交易费用函数,建立了均值-方差框架下的组合优化模型并给出了相应的求解算法.通过对恒生指数样本股的实证分析发现:考虑大宗交易的组合有效边缘介于线性交易费用和无交易费用的组合有效边缘之间;大宗交易稀释了“分散化降低风险”的效应;大宗交易下交易费用越大,相对于线性交易费用而言组合集中度越高.

  13. A Branch-and-Cut Algorithm for Elementary Shortest Path Problem with Resource Constraints

    DEFF Research Database (Denmark)

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

    The elementary shortest path with resource constraints are commonly solved with dynamic programming algorithms. We present a branch-and-cut algorithm for the undirected version. Two types of resources are discussed: A capacity and a fixed charge resource. The former is the subproblem of the capac...... of the capacitated vehicle routing problem and the latter is for the split delivery version....

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

    In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on branch-and...

  15. A branch-and-cut algorithm for the elementary shortest path problem with resource constraints

    DEFF Research Database (Denmark)

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

    The elementary shortest path with resource constraints have commonly been solved with dynamic programming algorithms. Assuming an undirected graph, we present a compact formulation of this problem and a branch-and-cut algorithm to solve it. Two types of resources are discussed: a capacity...... and a fixed charge resource. The former is the subproblem of the capacitated vehicle routing problem and the latter is from the split delivery version. Computational results are presented and compared to dynamic programming algorithms....

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

  17. Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms

    NARCIS (Netherlands)

    G. Galambos; A. van Vliet (André)

    1994-01-01

    textabstractIn this paper we discuss lower bounds for the asymptotic worst case ratio of on-line algorithms for different kind of bin packing problems. Recently, Galambos and Frenk gave a simple proof of the 1.536 ... lower bound for the 1-dimensional bin packing problem. Following their ideas, we p

  18. Persistence-Based Branch Misprediction Bounds for WCET Analysis

    DEFF Research Database (Denmark)

    Puffitsch, Wolfgang

    2015-01-01

    Branch prediction is an important feature of pipelined processors to achieve high performance. However, it can lead to overly pessimistic worst-case execution time (WCET) bounds when being modeled too conservatively. This paper presents bounds on the number of branch mispredictions for local dyna...... linear programming formulations of the WCET problem. An evaluation on a number of benchmarks shows that with these bounds, dynamic branch prediction does not necessarily lead to higher WCET bounds than static prediction schemes....

  19. A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands

    DEFF Research Database (Denmark)

    Christiansen, Christian Holk; Lysgaard, Jens; Wøhlk, Sanne

    2009-01-01

    We address the Capacitated Arc Routing Problem with Stochastic Demands (CARPSD), which we formulate as a Set Partitioning Problem. The CARPSD is solved by a Branch-and-Price algorithm, which we apply without graph transformation. The demand's stochastic nature is incorporated into the pricing...... problem. Computational results are reported....

  20. Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep

    CERN Document Server

    Daskalakis, Constantinos; Roch, Sebastien

    2008-01-01

    We introduce a new phylogenetic reconstruction algorithm which, unlike most previous rigorous inference techniques, does not rely on assumptions regarding the branch lengths or the depth of the tree. The algorithm returns a forest which is guaranteed to contain all edges that are: 1) sufficiently long and 2) sufficiently close to the leaves. How much of the true tree is recovered depends on the sequence length provided. The algorithm is distance-based and runs in polynomial time.

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

  2. A frequency function and singular set bounds for branched minimal immersions

    CERN Document Server

    Simon, Leon

    2010-01-01

    We show that any 2-valued C^{1, \\alpha} (\\alpha \\in (0, 1)) function u = {u_{1}, u_{2}} on an open ball B in {\\mathbb R}^{n} with values u_{1}, u_{2} \\in {\\mathbb R}^{k} whose graph, viewed as a varifold with multiplicity 2 at points where u_{1} = u_{2} and with multiplicity 1 at points where u_{1}, u_{2} are distinct, is stationary in the cylinder B \\times {\\mathbb R}^{k} must be a C^{1, 1/2} function, and the set of its branch points, if non-empty, must have Hausdorff dimension (n-2) and locally positive (n-2)-dimensional Hausdorff measure. The C^{1, 1/2} regularity is optimal.

  3. CUDA optimization strategies for compute- and memory-bound neuroimaging algorithms.

    Science.gov (United States)

    Lee, Daren; Dinov, Ivo; Dong, Bin; Gutman, Boris; Yanovsky, Igor; Toga, Arthur W

    2012-06-01

    As neuroimaging algorithms and technology continue to grow faster than CPU performance in complexity and image resolution, data-parallel computing methods will be increasingly important. The high performance, data-parallel architecture of modern graphical processing units (GPUs) can reduce computational times by orders of magnitude. However, its massively threaded architecture introduces challenges when GPU resources are exceeded. This paper presents optimization strategies for compute- and memory-bound algorithms for the CUDA architecture. For compute-bound algorithms, the registers are reduced through variable reuse via shared memory and the data throughput is increased through heavier thread workloads and maximizing the thread configuration for a single thread block per multiprocessor. For memory-bound algorithms, fitting the data into the fast but limited GPU resources is achieved through reorganizing the data into self-contained structures and employing a multi-pass approach. Memory latencies are reduced by selecting memory resources whose cache performance are optimized for the algorithm's access patterns. We demonstrate the strategies on two computationally expensive algorithms and achieve optimized GPU implementations that perform up to 6× faster than unoptimized ones. Compared to CPU implementations, we achieve peak GPU speedups of 129× for the 3D unbiased nonlinear image registration technique and 93× for the non-local means surface denoising algorithm.

  4. Novel algorithm for complex bit reversal: employing vector permutation and branch reduction methods

    Institute of Scientific and Technical Information of China (English)

    Feng YU; Ze-ke WANG; Rui-feng GE

    2009-01-01

    We present novel vector permutation and branch reduction methods to minimize the number of execution cycles for bit reversal algorithms. The new methods are applied to single instruction multiple data (SIMD) parallel implementation of complex data floating-point fast Fourier transform (FFT). The number of operational clock cycles can be reduced by an average factor of 3.5 by using our vector permutation methods and by 1.1 by using our branch reduction methods, compared with conventional implementations. Experiments on MPC7448 (a well-known SIMD reduced instruction set computing processor) demonstrate that our optimal bit-reversal algorithm consistently takes fewer than two cycles per element in complex array operations.

  5. Wave-Based Algorithms and Bounds for Target Support Estimation

    Science.gov (United States)

    2015-05-15

    Department of Electrical and Computer Engineering Northeastern University Boston, MA 02115 Abstract In this research program we developed novel analytical... nonuniqueness of the full inverse source problem of reconstructing the actual source that generated the given far field [29, 30]. Previous work on the scattering...information about the support of a source or scatterer that is contained in far fields of sources and scatterers. In addition, despite the nonuniqueness of the

  6. 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...... new integer linear programming formulations for the GVRP, two based on multicommodity flow and the other two based on exponential sets of inequalities. Branch-and-cut algorithms are proposed for the latter two. Computational results on a large set of instances are presented....

  7. The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond

    CERN Document Server

    Garivier, Aurélien

    2011-01-01

    This paper presents a finite-time analysis of the KL-UCB algorithm, an online, horizon-free index policy for stochastic bandit problems. We prove two distinct results: first, for arbitrary bounded rewards, the KL-UCB algorithm satisfies a uniformly better regret bound than UCB or UCB2; second, in the special case of Bernoulli rewards, it reaches the lower bound of Lai and Robbins. Furthermore, we show that simple adaptations of the KL-UCB algorithm are also optimal for specific classes of (possibly unbounded) rewards, including those generated from exponential families of distributions. A large-scale numerical study comparing KL-UCB with its main competitors (UCB, UCB2, UCB-Tuned, UCB-V, DMED) shows that KL-UCB is remarkably efficient and stable, including for short time horizons. KL-UCB is also the only method that always performs better than the basic UCB policy. Our regret bounds rely on deviations results of independent interest which are stated and proved in the Appendix. As a by-product, we also obtain ...

  8. 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......The capacitated facility location problem (CFLP) is a well-known combinatorial optimization problem with applications in distribution and production planning. It consists in selecting plant sites from a finite set of potential sites and in allocating customer demands in such a way as to minimize...... operating and transportation costs. A number of solution approaches based on Lagrangean relaxation and subgradient optimization has been proposed for this problem. Subgradient optimization does not provide a primal (fractional) optimal solution to the corresponding master problem. However, in order...

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

    NARCIS (Netherlands)

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

    2013-01-01

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

  10. Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations

    CERN Document Server

    Etessami, Kousha; Yannakakis, Mihalis

    2012-01-01

    We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic max(min) polynomial equations, referred to as maxPPSs (and minPPSs, respectively), in time polynomial in both the encoding size of the system of equations and in log(1/epsilon), where epsilon > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We establish this result using a generalization of Newton's method which applies to maxPPSs and minPPSs, even though the underlying functions are only piecewise-differentiable. This generalizes our recent work which provided a P-time algorithm for purely probabilistic PPSs. These equations form the Bellman optimality equations for several important classes of infinite-state Markov Decision Processes (MDPs). Thus, as a corollary, we obtain the first polynomial time algorithms for computing to within arbitrary desired precision the optimal value vector for several classes of infinite-state...

  11. Bound entanglement and entanglement bounds

    Energy Technology Data Exchange (ETDEWEB)

    Sauer, Simeon [Physikalisch-Astronomische Fakultaet, Friedrich-Schiller-Univesitaet Jena (Germany)]|[Physikalisches Institut, Albert-Ludwigs-Universitaet Freiburg, Hermann-Herder-Strasse 3, D-79104 Freiburg (Germany); Melo, Fernando de; Mintert, Florian; Buchleitner, Andreas [Physikalisches Institut, Albert-Ludwigs-Universitaet Freiburg, Hermann-Herder-Strasse 3, D-79104 Freiburg (Germany)]|[Max-Planck-Institut fuer Physik komplexer Systeme, Noethnitzer Str.38, D-01187 Dresden (Germany); Bae, Joonwoo [School of Computational Sciences, Korea Institute for Advanced Study, Seoul 130-012 (Korea); Hiesmayr, Beatrix [Faculty of Physics, University of Vienna, Boltzmanngasse 5, A-1090 Vienna (Austria)

    2008-07-01

    We investigate the separability of Bell-diagonal states of two qutrits. By using lower bounds to algebraically estimate concurrence, we find convex regions of bound entangled states. Some of these regions exactly coincide with the obtained results when employing optimal entanglement witnesses, what shows that the lower bound can serve as a precise detector of entanglement. Some hitherto unknown regions of bound entangled states were discovered with this approach, and delimited efficiently.

  12. New Algorithms and Lower Bounds for Sequential-Access Data Compression

    Science.gov (United States)

    Gagie, Travis

    2009-02-01

    This thesis concerns sequential-access data compression, i.e., by algorithms that read the input one or more times from beginning to end. In one chapter we consider adaptive prefix coding, for which we must read the input character by character, outputting each character's self-delimiting codeword before reading the next one. We show how to encode and decode each character in constant worst-case time while producing an encoding whose length is worst-case optimal. In another chapter we consider one-pass compression with memory bounded in terms of the alphabet size and context length, and prove a nearly tight tradeoff between the amount of memory we can use and the quality of the compression we can achieve. In a third chapter we consider compression in the read/write streams model, which allows us passes and memory both polylogarithmic in the size of the input. We first show how to achieve universal compression using only one pass over one stream. We then show that one stream is not sufficient for achieving good grammar-based compression. Finally, we show that two streams are necessary and sufficient for achieving entropy-only bounds.

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

  14. The RHMC algorithm for theories with unknown spectral bounds

    CERN Document Server

    Kogut, J B

    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 ($\\chi$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 ...

  15. Algorithms for Quantum Branching Programs Based on Fingerprinting

    CERN Document Server

    Ablayev, Farid; 10.4204/EPTCS.9.1

    2009-01-01

    In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on fingerprinting technique and representation of Boolean functions by their characteristic polynomials. We use circuit notation for branching programs for desired algorithms presentation. For several known functions our approach provides optimal QOBDDs. Namely we consider such functions as Equality, Palindrome, and Permutation Matrix Test. We also propose a generalization of our method and apply it to the Boolean variant of the Hidden Subgroup Problem.

  16. A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands

    DEFF Research Database (Denmark)

    Christiansen, Christian Holk; Lysgaard, Jens

    2007-01-01

    This article introduces a new exact algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands (CVRPSD). The CVRPSD can be formulated as a Set Partitioning Problem and it is shown that the associated column generation subproblem can be solved using a dynamic programming scheme...

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

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

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

    DEFF Research Database (Denmark)

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

    2014-01-01

    the integrated problem. In the proposed model, the master problem is formulated as a set-partitioning problem, and subproblems to identify columns with negative reduced costs are solved using mixed integer programming. To obtain sub-optimal solutions quickly, a metaheuristic approach based on critical......In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight...... the differences in operations between bulk ports and container terminals which highlights the need to devise specific solutions for bulk ports. The objective is to minimize the total service time of vessels berthing at the port. We propose an exact solution algorithm based on a branch and price framework to solve...

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

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

  1. Developing an Upper Bound and Heuristic Solution Algorithm for Order Scheduling Problem with Machines Idle Time Minimization

    Directory of Open Access Journals (Sweden)

    Hadi Mokhtari

    2013-01-01

    Full Text Available In this paper, the problem of received order scheduling by a manufacturer, with the measure of maximum completion times of orders, has been formulated and then an analytical approach has been devised for its solution. At the beginning of a planning period, the manufacturer receives a number of orders from customers, each of which requires two different stages for processing. In order to minimize the work in process inventories, the no-wait condition between two operations of each order is regarded. Then, the equality of obtained schedules is proved by machine idle time minimization, as objective, with the schedules obtained by maximum completion time minimization. A concept entitled “Order pairing” has been defined and an algorithm for achieving optimal order pairs which is based on symmetric assignment problem has been presented. Using the established order pairs, an upper bound has been developed based on contribution of every order pair out of total machines idle time. Out of different states of improving upper bound, 12 potential situations of order pairs sequencing have been also evaluated and then the upper bound improvement has been proved in each situation, separately. Finally, a heuristic algorithm has been developed based on attained results of pair improvement and a case study in printing industry has been investigated and analyzed to approve its applicability.

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

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

  4. A General Nonlinear Optimization Algorithm for Lower Bound Limit Analysis

    DEFF Research Database (Denmark)

    Krabbenhøft, Kristian; Damkilde, Lars

    2003-01-01

    The non-linear programming problem associated with the discrete lower bound limit analysis problem is treated by means of an algorithm where the need to linearize the yield criteria is avoided. The algorithm is an interior point method and is completely general in the sense that no particular...... finite element discretization or yield criterion is required. As with interior point methods for linear programming the number of iterations is affected only little by the problem size. Some practical implementation issues are discussed with reference to the special structure of the common lower bound...

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

    Science.gov (United States)

    Wu, Z; Zhang, Y

    2008-01-01

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

  6. BOUNDING PYRAMIDS AND BOUNDING CONES FOR TRIANGULAR BEZIER SURFACES

    Institute of Scientific and Technical Information of China (English)

    Jian-song Deng; Fa-lai Chen; Li-li Wang

    2000-01-01

    This paper describes practical approaches on how to construct bounding pyramids and bounding cones for triangular Bézier surfaces. Examples are provided to illustrate the process of construction and comparison is made between various surface bounding volumes. Furthermore, as a starting point for the construction,we provide a way to compute hodographs of triangular Bézier surfaces and improve the algorithm for computing the bounding cone of a set of vectors.

  7. Tracking Infection Diffusion in Social Networks: Filtering Algorithms and Threshold Bounds

    CERN Document Server

    Krishnamurthy, Vikram; Pedersen, Tavis

    2016-01-01

    This paper deals with the statistical signal pro- cessing over graphs for tracking infection diffusion in social networks. Infection (or Information) diffusion is modeled using the Susceptible-Infected-Susceptible (SIS) model. Mean field approximation is employed to approximate the discrete valued infected degree distribution evolution by a deterministic ordinary differential equation for obtaining a generative model for the infection diffusion. The infected degree distribution is shown to follow polynomial dynamics and is estimated using an exact non- linear Bayesian filter. We compute posterior Cramer-Rao bounds to obtain the fundamental limits of the filter which depend on the structure of the network. Considering the time-varying nature of the real world networks, the relationship between the diffusion thresholds and the degree distribution is investigated using generative models for real world networks. In addition, we validate the efficacy of our method with the diffusion data from a real-world online s...

  8. Bounded global Hopf branches for stage-structured differential equations with unimodal feedback

    Science.gov (United States)

    Shu, Hongying; Wang, Lin; Wu, Jianhong

    2017-03-01

    We consider a class of stage-structured differential equations with unimodal feedback. By using the time delay as a bifurcation parameter, we show that the number of local Hopf bifurcation values is finite. Furthermore, we analytically prove that these local Hopf bifurcation values are neatly paired, and each pair is jointed by a bounded global Hopf branch. We use the well-known Mackey-Glass equation with a stage structure as an illustrative example to demonstrate that bounded global Hopf branches can induce interesting and rich dynamics. As the delay increases over a finite interval, the stage-structured Mackey-Glass equation exhibits certain symmetric dynamic patterns: the solutions evolve from a stable equilibrium to sustained stable periodic oscillations, to chaotic-like aperiodic oscillations and back to sustained stable periodic oscillations, to a stable equilibrium.

  9. Dynamic programming algorithm for economic lot-sizing problem with bounded inventory and out-sourcing

    Institute of Scientific and Technical Information of China (English)

    LIU Xiao; WANG Cheng-en

    2005-01-01

    This paper addresses a single item dynamic lot-sizing model with inventory capacity and out-sourcing. The goal is to minimize the total costs of production, setup, inventory holding and out-sourcing. Two versions of an out-sourcing model with time-varying costs are considered: stock out case and conservation case. Zero Inventory Order property has been found and some new properties are obtained in an optimal solution. Dynamic programming algorithms are developed to solve the problem in strongly polynomial time respectively. Furthermore, some numerical results demonstrate that the approach proposed is efficient and applicable.

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

    Directory of Open Access Journals (Sweden)

    Bisheng He

    2014-01-01

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

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

    DEFF Research Database (Denmark)

    Sørensen, Michael Malmros

    2001-01-01

    We consider a polyhedral approach to the weighted maximal b-clique problem. Given a node- and edge-weighted complete graph the problem is to find a complete subgraph (clique) with no more than b nodes such that the sum of the weights of all nodes and edges in the clique is maximal. We introduce...... 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...

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

    DEFF Research Database (Denmark)

    Sørensen, Michael Malmros

    2004-01-01

    We consider a polyhedral approach to the weighted maximal b-clique problem. Given a node- and edge-weighted complete graph the problem is to find a complete subgraph (clique) with no more than b nodes such that the sum of the weights of all nodes and edges in the clique is maximal. We introduce...... 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...

  13. Visualization of Link Structures and URL Retrievals Utilizing Internal Structure of URLs Based on Brunch and Bound Algorithms

    Directory of Open Access Journals (Sweden)

    Kohei Arai

    2012-11-01

    Full Text Available Method for visualization of URL link structure and URL retrievals using internal structure of URLs based on brunch and bound method is proposed. Twisting link structure of URLs can be solved by the proposed visualization method. Also some improvements are observed for the proposed brunch and bound based method in comparison to the conventional URL retrieval methods.

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

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

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

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

  18. Improved Bounds on Quantum Learning Algorithms

    CERN Document Server

    Atici, A; Atici, Alp; Servedio, Rocco A.

    2004-01-01

    In this article we give several new results on the complexity of algorithms that learn Boolean functions from quantum queries and quantum examples. Hunziker et al. conjectured that for any class C of Boolean functions, the number of quantum black-box queries which are required to exactly identify an unknown function from C is at most $O(\\frac{\\log |C|}{\\sqrt{{\\hat{\\gamma}}^{C}}})$, where $\\hat{\\gamma}^{C}$ is a combinatorial parameter of the class C. We essentially resolve this conjecture in the affirmative by giving a quantum algorithm that, for any class C, identifies any unknown function from C using at most $O(\\frac{\\log |C| \\log \\log |C|}{\\sqrt{{\\hat{\\gamma}}^{C}}})$ quantum black-box queries. We consider a range of natural problems intermediate between the exact learning problem (in which the learner must obtain all bits of information about the black-box function) and the usual problem of computing a predicate (in which the learner must obtain only one bit of information about the black-box function). ...

  19. A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm

    NARCIS (Netherlands)

    R. Freling (Richard); R.M. Lentink (Ramon); A.P.M. Wagelmans (Albert)

    2001-01-01

    textabstractThis paper discusses a decision support system for airline and railway crew planning. The system is a state-of-the-art branch-and-price solver that is used for crew scheduling and crew rostering. We briefly discuss the mathematical background of the solver, of which most part is covered

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

    Science.gov (United States)

    2013-05-14

    by UC Discovery (award DIG07-10227), with additional support from ParLab affiliates National Instruments, Nokia , NVIDIA, Oracle, and Samsung, and...award 024894), and matching funding by UC Discovery (award DIG07-10227), with additional support from ParLab affiliates National Instruments, Nokia

  1. 配电网运行拓扑与支路顺序算法%Operation Topology of Distribution Network and Branch Sequence Algorithm

    Institute of Scientific and Technical Information of China (English)

    董张卓; 赵元鹏; 王清亮

    2016-01-01

    前推回代法计算配电网潮流的关键是在高效拓扑表示基础上,确定配电网支路或节点前推、回代顺序。首先,按照IEC 61970-301 CIM中拓扑的概念,对配电网的拓扑表示进行总结,给出了配电网运行时,表示拓扑的图的定义;然后提出用邻接支路表示这种图,并定义出这种图支路的度和逆有向道路;再根据前推回代潮流计算的特点,提出了计算前推支路顺序搜索和回代支路顺序的计算方法;最后编制了程序,验证了算法的正确性。算法简单直观,占用内存小,计算效率高。%The sequence of branches or nodes in the efficient distribution network topology description is the key to the forward-backward sweep algorithm for power flow caculation. According to the concept of topology in IEC 61970-301 CIM,the topology representation of distribution network is summarized,and the operation topology graph of distribu⁃tion network is defined. It is recommended that the graph should be represented by an adjacent branch method. More⁃over,the method defines the degree of branch and converse directed road. According to the characteristics of the for⁃ward-backward sweep algorithm for power flow calculation,the calculation algorithms for forward branch sequence search and back substitution branch sequence are proposed. To verify the correctness of the algorithm,a program is pro⁃grammed. The algorithm is simple and intuitive,and it has low memory footprint and high calculation efficiency.

  2. Tight Bounds for Mixing of the Swendsen-Wang Algorithm at the Potts Transition Point

    CERN Document Server

    Borgs, Christian; Tetali, Prasad

    2010-01-01

    We study two widely used algorithms for the Potts model on rectangular subsets of the hypercubic lattice Z^d - heat bath dynamics and the Swendsen-Wang algorithm - and prove that, under certain circumstances, the mixing in these algorithms is torpid or slow. In particular, we show that for heat bath dynamics throughout the region of phase coexistence, and for the Swendsen-Wang algorithm at the transition point, the mixing time in a box of side length L with periodic boundary conditions has upper and lower bounds which are exponential in L^{d-1}. This work provides the first upper bound of this form for the Swendsen-Wang algorithm, and gives lower bounds for both algorithms which significantly improve the previous lower bounds that were exponential in L/(log L)^2.

  3. Matrix algorithms for solving (in)homogeneous bound state equations.

    Science.gov (United States)

    Blank, M; Krassnigg, A

    2011-07-01

    In the functional approach to quantum chromodynamics, the properties of hadronic bound states are accessible via covariant integral equations, e.g. the Bethe-Salpeter equation for mesons. In particular, one has to deal with linear, homogeneous integral equations which, in sophisticated model setups, use numerical representations of the solutions of other integral equations as part of their input. Analogously, inhomogeneous equations can be constructed to obtain off-shell information in addition to bound-state masses and other properties obtained from the covariant analogue to a wave function of the bound state. These can be solved very efficiently using well-known matrix algorithms for eigenvalues (in the homogeneous case) and the solution of linear systems (in the inhomogeneous case). We demonstrate this by solving the homogeneous and inhomogeneous Bethe-Salpeter equations and find, e.g. that for the calculation of the mass spectrum it is as efficient or even advantageous to use the inhomogeneous equation as compared to the homogeneous. This is valuable insight, in particular for the study of baryons in a three-quark setup and more involved systems.

  4. Koenigs function and branching processes

    CERN Document Server

    Chikilev, O G

    2001-01-01

    An explicit solution of time-homogeneous pure birth branching processes is described. It gives alternative extensions for the negative binomial distribution (branching processes with immigration) and for the Furry-Yule distribution (branching processes without immigration).

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

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

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

    DEFF Research Database (Denmark)

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

    2006-01-01

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

  8. Split Bregman Iteration Algorithm for Image Deblurring Using Fourth-Order Total Bounded Variation Regularization Model

    Directory of Open Access Journals (Sweden)

    Yi Xu

    2013-01-01

    Full Text Available We propose a fourth-order total bounded variation regularization model which could reduce undesirable effects effectively. Based on this model, we introduce an improved split Bregman iteration algorithm to obtain the optimum solution. The convergence property of our algorithm is provided. Numerical experiments show the more excellent visual quality of the proposed model compared with the second-order total bounded variation model which is proposed by Liu and Huang (2010.

  9. Automated test data generation for branch testing using incremental genetic algorithm

    Indian Academy of Sciences (India)

    T MANIKUMAR; A JOHN SANJEEV KUMAR; R MARUTHAMUTHU

    2016-09-01

    Cost of software testing can be reduced by automated test data generation to find a minimal set of data that has maximum coverage. Search-based software testing (SBST) is one of the techniques recently used for automated testing task. SBST makes use of control flow graph (CFG) and meta-heuristic search algorithms to accomplish the process. This paper focuses on test data generation for branch coverage. A major drawback in using meta-heuristic techniques is that the CFG paths have to be traversed from the starting node to end node for each automated test data. This kind of traversal could be improved by branch ordering, together with elitism. But still the population size and the number of iterations are maintained as the same to keep all the branches alive. In this paper, we present an incremental genetic algorithm (IGA) for branch coverage testing. Initially, a classical genetic algorithm (GA) is used to construct the population with the best parents for each branch node, and the IGA is started with these parents as the initial population. Hence, it is not necessary to maintain a huge population size and large number of iterations to cover all the branches. The performance is analyzed with five benchmark programs studied from the literature. The experimental results indicate that the proposed IGA search technique outperforms the other meta-heuristic search techniques in terms of memory usage and scalability.

  10. Multi-Agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds

    DEFF Research Database (Denmark)

    Förster, Klaus-Tycho; Groner, Linus; Hoefler, Torsten

    2017-01-01

    We investigate the multi-agent pathfinding (MAPF) problem with $n$ agents on graphs with $n$ vertices: Each agent has a unique start and goal vertex, with the objective of moving all agents in parallel movements to their goal s.t.~each vertex and each edge may only be used by one agent at a time....... We give a combinatorial classification of all graphs where this problem is solvable in general, including cases where the solvability depends on the initial agent placement. Furthermore, we present an algorithm solving the MAPF problem in our setting, requiring O(n²) rounds, or O(n³) moves...... of individual agents. Complementing these results, we show that there are graphs where Omega(n²) rounds and Omega(n³) moves are required for any algorithm....

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

    Science.gov (United States)

    Liu, Derong; Li, Hongliang; Wang, Ding

    2015-06-01

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

  12. A branch and bound hybrid algorithm with four deterministic heuristics for the resource constrained project scheduling problem (RCPSP

    Directory of Open Access Journals (Sweden)

    Daniel Morillo-Torres

    2015-01-01

    Full Text Available En este artículo se aborda el problema de Programación de Tareas con Recursos Restringidos (RCPSP. Para su solución, se desarrolla y se implementa una metodología híbrida que usa como base un algoritmo de Ramificación y Acotamiento con potentes reglas de dominancia, y se combina con cuatro heurísticas determinísticas cuyo objetivo es truncar ramas del árbol de búsqueda, pero, a su vez, minimizar la probabilidad de descartar ramales que contengan soluciones óptimas. En esencia, estas estrategias permiten la repartición de iteraciones en forma mayoritaria y organizada en las regiones más promisorias usando, únicamente, subconjuntos que tengan características similares o iguales a las de las soluciones óptimas en cada nivel del árbol, garantizando así una amplia exploración dentro de la región factible y al mismo tiempo una buena explotación. Finalmente se analiza el desempeño del algoritmo desarrollado mediante la solución de algunos problemas de la librería de prueba PSPLIB.

  13. 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. The u....... The unique path generated by the minimizers of these problems yields the solution to the original problem for finite values of the approximation parameter. Thus, a finite continuation algorithm is designed. Results of extensive computational experiments are reported....

  14. GLOBAL CONVERGENCE OF TRUST REGION ALGORITHM FOR EQUALITY AND BOUND CONSTRAINED NONLINEAR OPTIMIZATION%等式与界约束非线性优化信赖域算法的全局收敛

    Institute of Scientific and Technical Information of China (English)

    童小娇; 周叔子

    2003-01-01

    This paper presents a trust region two-phase model algorithm for solving the equality and bound constrained nonlinear optimization problem. A concept of substationary point is given. Under suitable assumptions,the global convergence of this algorithm is proved without assuming the linear independence of the gradient of active constraints. A numerical example is also presented.

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

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

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

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

    DEFF Research Database (Denmark)

    Røpke, Stefan; Cordeau, Jean-Francois

    2009-01-01

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

  19. A better lower bound for quantum algorithms searching an ordered list

    CERN Document Server

    Ambainis, A

    1999-01-01

    We show that any quantum algorithm searching an ordered list of n elements needs to examine at least 1/12 log n-O(1) of them. Classically, log n queries are both necessary and sufficient. This shows that quantum algorithms can achieve only a constant speedup for this problem. Our result improves lower bounds of Buhrman and de Wolf(quant-ph/9811046) and Farhi, Goldstone, Gutmann and Sipser (quant-ph/9812057).

  20. Metastability of Bose and Fermi gases on the upper branch

    Science.gov (United States)

    LeClair, André; Roditi, Itzhak; Squires, Joshua

    2016-12-01

    We study three-dimensional Bose and Fermi gases in the upper branch, a phase defined by the absence of bound states in the repulsive interaction regime, within an approximation that considers only two-body interactions. Employing a formalism based on the S matrix, we derive useful analytic expressions that hold on the upper branch in the weak coupling limit. We determine upper branch phase diagrams for both bosons and fermions with techniques valid for arbitrary positive scattering length.

  1. Path-valued branching processes and nonlocal branching superprocesses

    CERN Document Server

    Li, Zenghu

    2012-01-01

    A family of continuous-state branching processes with immigration are constructed as the solution flow of a stochastic equation system driven by time-space noises. The family can be regarded as an inhomogeneous increasing path-valued branching process with immigration. Two nonlocal branching immigration superprocesses can be defined from the flow. We identify explicitly the branching and immigration mechanisms of those processes. The results provide new perspectives into the tree-valued Markov processes of Aldous and Pitman [Ann. Inst. H. Poincare Probab. Statist. 34 (1998), 637--686] and Abraham and Delmas [Ann. Probab. To appear].

  2. On Entropy Bounds and Holography

    CERN Document Server

    Halyo, Edi

    2009-01-01

    We show that the holographic entropy bound for gravitational systems and the Bekenstein entropy bound for nongravitational systems are holographically related. Using the AdS/CFT correspondence, we find that the Bekenstein bound on the boundary is obtained from the holographic bound in the bulk by minimizing the boundary energy with respect the AdS radius or the cosmological constant. This relation may also ameliorate some problems associated with the Bekenstein bound.

  3. Polynomial Complexity Bounds of Mehrotra-typ e Predictor-corrector Algorithms for Linear Programming over Symmetric Cones

    Institute of Scientific and Technical Information of China (English)

    LIU Chang-he; SHANG You-lin; LI Zhen-guo

    2015-01-01

    We establish polynomial complexity bounds of the Mehrotra-type predictor-corrector algorithms for linear programming over symmetric cones. We first slightly modify the maximum step size in the predictor step of the safeguard based Mehrotra-type algorithm for linear programming, that was proposed by Salahi et al[18]. Then, using the machinery of Euclidean Jordan algebras, we extend the modified algorithm to symmetric cones. Based on the Nesterov-Todd direction, we obtain O(r logε−1) iteration complexity bound of this algorithm, where r is the rank of the Jordan algebras andεis the required precision. We also present a new variant of Mehrotra-type algorithm using a new adaptive updating scheme of centering parameter and show that this algorithm enjoys the same order of complexity bound as the safeguard algorithm. We illustrate the numerical behaviour of the methods on some small examples.

  4. On Geometric Upper Bounds for Positioning Algorithms in Wireless Sensor Networks

    CERN Document Server

    Gholami, Mohammad Reza; Wymeersch, Henk; Rydström, Mats

    2012-01-01

    This paper studies the possibility of upper bounding the position error of an estimate for range based positioning algorithms in wireless sensor networks. In this study, we argue that in certain situations when the measured distances between sensor nodes are positively biased, e.g., in non-line-of-sight conditions, the target node is confined to a closed bounded convex set (a feasible set) which can be derived from the measurements. Then, we formulate two classes of geometric upper bounds with respect to the feasible set. If an estimate is available, either feasible or infeasible, the worst-case position error can be defined as the maximum distance between the estimate and any point in the feasible set (the first bound). Alternatively, if an estimate given by a positioning algorithm is always feasible, we propose to get the maximum length of the feasible set as the worst-case position error (the second bound). These bounds are formulated as nonconvex optimization problems. To progress, we relax the nonconvex ...

  5. AN AFFINE SCALING INTERIOR ALGORITHM VIA CONJUGATE GRADIENT PATH FOR SOLVING BOUND-CONSTRAINED NONLINEAR SYSTEMS

    Institute of Scientific and Technical Information of China (English)

    Chunxia Jia; Detong Zhu

    2008-01-01

    In this paper we propose an affine scaling interior algorithm via conjugate gradient path for solving nonlinear equality systems subject to bounds on variables.By employing the affine scaling conjugate gradient path search strategy,we obtain an iterative direction by solving the linearize model.By using the line search technique,we will find an acceptable trial step length along this direction which is strictly feasible and makes the objective function nonmonotonically decreasing.The global convergence and fast local convergence rate of the proposed algorithm are established under some reasonable conditions.Furthermore,the numerical results of the proposed algorithm indicate to be effective.

  6. Quantum bounds for ordered searching and sorting

    CERN Document Server

    Hoyer, P; Shi, Y; Hoyer, Peter; Neerbek, Jan; Shi, Yaoyun

    2001-01-01

    We consider the quantum complexities of searching an ordered list and sorting an un-ordered list. For searching an ordered list of N elements, we prove a lower bound of \\frac{1}{\\pi}(\\ln(N)-1) on the number of oracle queries that access the list elements. This improves the previously best lower bound of ({1/12}\\log_2(N) - O(1)) due to Ambainis. For sorting N numbers, we prove a lower bound of \\frac{N}{2\\pi}(\\ln(N)-1) on the number of binary comparisons. The previously best lower bound is \\Omega(N). Our proofs are based on a weighted all-pairs inner product argument, and our results generalize to bounded error quantum algorithms. Both results are proven in the so-called quantum black box model, a quantum analogue of classical decision trees. In addition to our lower bound results, we give an exact quantum algorithm for ordered searching using (\\log_3(N) + O(1)) queries, which is roughly 0.631 \\log_2(N). Although our algorithm is worse than that of Farhi, Goldstone, Gutmann and Sipser, which makes 0.526 \\log_2(...

  7. An Improved Lower Bound Limit State Optimisation Algorithm

    DEFF Research Database (Denmark)

    Frier, Christian; Damkilde, Lars

    2010-01-01

    Limit State analysis has been used in engineering practice for many years e.g. the yield-line method for concrete slabs and slip-line solutions in geotechnics. In the recent years there has been an increased interest in numerical Limit State analysis, and today algorithms take into account the non......-linear yield criteria. The aim of the paper is to refine an earlier presented effective method which reduces the number of optimisation variables considerably by eliminating the equilibrium equations a priori and improvements are made on the interior point optimisation algorithm....

  8. Upper bound limit and shakedown analysis of elastic plastic bounded linearly kinematic hardening structures

    OpenAIRE

    2011-01-01

    This thesis develops a new FEM based algorithm for shakedown analysis of structures made of elastic plastic bounded linearly kinematic hardening material. Its concept can be briefly described as: Hardening law is simulated using a two-surface plastic model. One yield surface is the initial surface, defined by yield stress sigma_y, and the other one is the bounding surface, defined by ultimate strength sigma_u. The initial surface can translate inside the bounding surface without changing its ...

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

  10. A general non-linear optimization algorithm for lower bound limit analysis

    DEFF Research Database (Denmark)

    Krabbenhøft, Kristian; Damkilde, Lars

    2003-01-01

    The non-linear programming problem associated with the discrete lower bound limit analysis problem is treated by means of an algorithm where the need to linearize the yield criteria is avoided. The algorithm is an interior point method and is completely general in the sense that no particular...... load optimization problem. and finally the efficiency and accuracy of the method is demonstrated by means of examples of plate and slab structures obeying different non-linear yield criteria. Copyright (C) 2002 John Wiley Sons. Ltd....

  11. A weakly monotonic backward induction algorithm on finite bounded subsets of vector lattices

    Science.gov (United States)

    Dragut, A. B.

    2004-03-01

    We present a new efficient and robust backward induction algorithm, which is weakly monotonic, working on bounded subsets without holes of lattices. We prove all its properties, give examples of applications, and illustrate its behavior, comparing it with the natural extension of the unidimensional algorithm presented in Puterman (Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley, New York, 1994), in the sense of Topkis (Frontiers of Economic Research Series, Princeton University Press, Princeton, NJ, 1998) and White (Recent Developments in Markov Decision Processes, Academic Press, New York, 1980, 261) and showing, also experimentally, that it is much more efficient.

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

  13. Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations

    NARCIS (Netherlands)

    de Freitas, N.; Smola, A.J.; Zoghi, M.; Langford, J.; Pineau, J.

    2012-01-01

    This paper analyzes the problem of Gaussian process (GP) bandits with deterministic observations. The analysis uses a branch and bound algorithm that is related to the UCB algorithm of (Srinivas et al, 2010). For GPs with Gaussian observation noise, with variance strictly greater than zero, Srinivas

  14. EXACT ALGORITHM FOR BIN COVERING

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    This paper presents a new arc flow model for the one-dimensional bin covering problem and an algorithm to solve the problem exactly through a branch-and-bound procedure and the technique of column generation. The subproblems occuring in the procedure of branch-and-bound have the same structure and therefore can be solved by the same algorithm. In order to solve effectively the subproblems which are generally large scale, a column generation algorithm is employed. Many rules found in this paper can improve the performance of the methods.

  15. Lower and upper bounds for the two-echelon capacitated location-routing problem

    Science.gov (United States)

    Contardo, Claudio; Hemmelmayr, Vera; Crainic, Teodor Gabriel

    2012-01-01

    In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of finding good-quality solutions quickly. The computational results on a large set of instances from the literature show that the ALNS outperforms existing heuristics. Furthermore, the branch-and-cut method provides tight lower bounds and is able to solve small- and medium-size instances to optimality within reasonable computing times. PMID:24511176

  16. Lower and upper bounds for the two-echelon capacitated location-routing problem.

    Science.gov (United States)

    Contardo, Claudio; Hemmelmayr, Vera; Crainic, Teodor Gabriel

    2012-12-01

    In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of finding good-quality solutions quickly. The computational results on a large set of instances from the literature show that the ALNS outperforms existing heuristics. Furthermore, the branch-and-cut method provides tight lower bounds and is able to solve small- and medium-size instances to optimality within reasonable computing times.

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

  18. An efficient algorithm for upper bound on the partition function of nucleic acids.

    Science.gov (United States)

    Chitsaz, Hamidreza; Forouzmand, Elmirasadat; Haffari, Gholamreza

    2013-07-01

    It has been shown that minimum free-energy structure for RNAs and RNA-RNA interaction is often incorrect due to inaccuracies in the energy parameters and inherent limitations of the energy model. In contrast, ensemble-based quantities such as melting temperature and equilibrium concentrations can be more reliably predicted. Even structure prediction by sampling from the ensemble and clustering those structures by Sfold has proven to be more reliable than minimum free energy structure prediction. The main obstacle for ensemble-based approaches is the computational complexity of the partition function and base-pairing probabilities. For instance, the space complexity of the partition function for RNA-RNA interaction is O(n4) and the time complexity is O(n6), which is prohibitively large. Our goal in this article is to present a fast algorithm, based on sparse folding, to calculate an upper bound on the partition function. Our work is based on the recent algorithm of Hazan and Jaakkola (2012). The space complexity of our algorithm is the same as that of sparse folding algorithms, and the time complexity of our algorithm is O(MFE(n)ℓ) for single RNA and O(MFE(m, n)ℓ) for RNA-RNA interaction in practice, in which MFE is the running time of sparse folding and ℓ≤n (ℓ≤n+m) is a sequence-dependent parameter.

  19. Step Size Bound of the Sequential Partial Update LMS Algorithm with Periodic Input Signals

    Directory of Open Access Journals (Sweden)

    Pedro Ramos

    2006-12-01

    Full Text Available This paper derives an upper bound for the step size of the sequential partial update (PU LMS adaptive algorithm when the input signal is a periodic reference consisting of several harmonics. The maximum step size is expressed in terms of the gain in step size of the PU algorithm, defined as the ratio between the upper bounds that ensure convergence in the following two cases: firstly, when only a subset of the weights of the filter is updated during every iteration; and secondly, when the whole filter is updated at every cycle. Thus, this gain in step-size determines the factor by which the step size parameter can be increased in order to compensate the inherently slower convergence rate of the sequential PU adaptive algorithm. The theoretical analysis of the strategy developed in this paper excludes the use of certain frequencies corresponding to notches that appear in the gain in step size. This strategy has been successfully applied in the active control of periodic disturbances consisting of several harmonics, so as to reduce the computational complexity of the control system without either slowing down the convergence rate or increasing the residual error. Simulated and experimental results confirm the expected behavior.

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

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

  2. Sharper lower bounds on the performance of the empirical risk minimization algorithm

    CERN Document Server

    Lecué, Guillaume; 10.3150/09-BEJ225

    2011-01-01

    We present an argument based on the multidimensional and the uniform central limit theorems, proving that, under some geometrical assumptions between the target function $T$ and the learning class $F$, the excess risk of the empirical risk minimization algorithm is lower bounded by \\[\\frac{\\mathbb{E}\\sup_{q\\in Q}G_q}{\\sqrt{n}}\\delta,\\] where $(G_q)_{q\\in Q}$ is a canonical Gaussian process associated with $Q$ (a well chosen subset of $F$) and $\\delta$ is a parameter governing the oscillations of the empirical excess risk function over a small ball in $F$.

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

    DEFF Research Database (Denmark)

    David, Alexandre; Jacobsen, Lasse; Jacobsen, Morten

    2012-01-01

    in the presence of monotonicity-breaking features like age invariants and inhibitor arcs. We implement the algorithm within the model-checkerTAPAAL and the experimental results document an encouraging performance compared to verification approaches that translate TAPN models to UPPAAL timed automata.......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...

  4. The Out-bound and In-bound Travelling Market

    Institute of Scientific and Technical Information of China (English)

    Emily Yu

    2009-01-01

    @@ As the Spring Festival of China with a long vocation of seven days nationally is approaching,more and more attention is paid to the out-bound and inn-bound trayeling market.Will people hold their pockets firmly in the"cold winter"of world-wide financial crisis,or will they grab the great discount of traveling and take a good relax?

  5. Origin and diagenetic transformations of C sub 25 and C sub 30 highly branched isoprenoid sulfur compounds: Further evidence for the formation of organically bound sulfur during early diagenesis

    Energy Technology Data Exchange (ETDEWEB)

    Kohnen, M.E.L.; Damste, J.S.S.; Kock-Van Dalen, A.C.; de Leeuw, J.W. (Delft Univ. of Technology (Netherlands)); Ten Haven, H.L.; Rullkoetter, J. (Institute of Petroleum and Organic Geochemistry, Juelich (West Germany))

    1990-11-01

    A number of C{sub 25} and C{sub 30} highly branched isoprenoid (HBI) sulfur compounds (e.g., thiolanes, 1-oxo-thiolanes, thiophenes, and benzo(b)thiophenes) with 2,6,10,14-tetramethyl-7-(3-methylpentyl)pentadecane and 2,6,10,14,18-pentamethyl-7-(3-methylpentyl)nonadecane carbon skeletons were identified in sediments, ranging from Holocene to Upper Cretaceous. These identifications are based on mass spectral characterization, desulfurization, and, in some cases, by comparison of mass spectral and relative retention time data with those of authentic standards. The presence of unsaturated C{sub 25} and C{sub 30} HBI thiolanes in a Recent sediment from the Black Sea (age 3-6 {times} 10{sup 3} a) strongly supports their formation during early diagenesis. The co-occurrence of HBI polyenes (C{sub 25} and C{sub 30}) and unsaturated HBI thiolanes (C{sub 25} and C{sub 30}) possessing two double bonds less than the corresponding HBI polyenes, in this Recent sediment, testifies to the formation of unsaturated HBI thiolanes by a reaction of inorganic sulfur species with double bonds of the HBI polyenes. Furthermore, a diagenetic scheme for HBI sulfur compounds is proposed based on the identification of HBI sulfur compounds in sediment samples with different maturity levels.

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

  7. A Note on Multitype Branching Process with Bounded Immigration in Random Environment

    Institute of Scientific and Technical Information of China (English)

    Hua Ming WANG

    2013-01-01

    In this paper,we study the total number of progeny,W,before regenerating of multitype branching process with immigration in random environment.We show that the tail probability of |W| is of order t-κ as t → ∞,with κ some constant.As an application,we prove a stable law for (L-1) random walk in random environment,generalizing the stable law for the nearest random walk in random environment (see "Kesten,Kozlov,Spitzer:A limit law for random walk in a random environment.Compositio Math.,30,145-168 (1975)").

  8. A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times

    NARCIS (Netherlands)

    Z. Degraeve (Zeger); R.F. Jans (Raf)

    2007-01-01

    textabstractAlthough the textbook Dantzig-Wolfe decomposition reformulation for the capacitated lot-sizing problem, as already proposed by Manne [Manne, A. S. 1958. Programming of economic lot sizes. Management Sci. 4(2) 115-135], provides a strong lower bound, it also has an important structural de

  9. Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound

    CERN Document Server

    Magdon-Ismail, Malik

    2010-01-01

    We focus the use of \\emph{row sampling} for approximating matrix algorithms. We give applications to matrix multipication; sparse matrix reconstruction; and, \\math{\\ell_2} regression. For a matrix \\math{\\matA\\in\\R^{m\\times d}} which represents \\math{m} points in \\math{d\\ll m} dimensions, all of these tasks can be achieved in \\math{O(md^2)} via the singular value decomposition (SVD). For appropriate row-sampling probabilities (which typically depend on the norms of the rows of the \\math{m\\times d} left singular matrix of \\math{\\matA} (the \\emph{leverage scores}), we give row-sampling algorithms with linear (up to polylog factors) dependence on the stable rank of \\math{\\matA}. This result is achieved through the application of non-commutative Bernstein bounds. We then give, to our knowledge, the first algorithms for computing approximations to the appropriate row-sampling probabilities without going through the SVD of \\math{\\matA}. Thus, these are the first \\math{o(md^2)} algorithms for row-sampling based appro...

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

  11. UPDATING AND DOWNDATING FOR PARAMETER ESTIMATION WITH BOUNDED UNCERTAIN DATA

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    The bounded parameter estimation problem and its solution lead to moie meaningful results. Its superior performance is due to the fact that the new method guarantees that the effect of the uncertainties will never be unnecessarily overestimated.We then consider how to update and downdate the bounded parameter estimation problem. When updating and downdating of SVD are used to the new problem, special technologies are taken to avoid forming U and V explicitly, then increase the algorithm performance. Because of the link between the bounded parameter estimation and Tikhonov regularization procedure, we point out that our algorithms can also be used to modify regularization problem.

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

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

  14. Circuit Lower Bounds, Help Functions, and the Remote Point Problem

    CERN Document Server

    Arvind, Vikraman

    2009-01-01

    We investigate the power of Algebraic Branching Programs (ABPs) augmented with help polynomials, and constant-depth Boolean circuits augmented with help functions. We relate the problem of proving explicit lower bounds in both these models to the Remote Point Problem (introduced by Alon, Panigrahy, and Yekhanin (RANDOM '09)). More precisely, proving lower bounds for ABPs with help polynomials is related to the Remote Point Problem w.r.t. the rank metric, and for constant-depth circuits with help functions it is related to the Remote Point Problem w.r.t. the Hamming metric. For algebraic branching programs with help polynomials with some degree restrictions we show exponential size lower bounds for explicit polynomials.

  15. Weekly Fleet Assignment Model and Algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHU Xing-hui; ZHU Jin-fu; GONG Zai-wu

    2007-01-01

    A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity,and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a realworld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was $1591276 one week and the running time was no more than 4 min, which shows that the model and algorithm are fairly good for domestic airline.

  16. A Simplicial Algorithm for Concave Minimization and Its Performance as a Heuristic Tool

    OpenAIRE

    Kuno, Takahito; Shiguro, Yoshiyuki

    2007-01-01

    In this paper, we develop a kind of branch-and-bound algorithm for solving concaveminimization problems. We show that the algorithm converges to an optimalsolution of this multiextremal global optimization problem, and that it generatesa high-quality heuristic solution even if it is forced to terminate. Therefore, thealgorithm can be used in two ways, as an exact algorithm and as a heuristic tool.We also report some numerical results of a comparison with an existing algorithm,and show the per...

  17. Bounded Error Approximation Algorithms for Risk-Based Intrusion Response

    Science.gov (United States)

    2015-09-17

    bipartite graphs. Prior to our work, intrusion response had not been studied within a graph- theoretic framework. Some of our important contributions...include: (a) The partial vertex cover problem for matchings (PVCM) is poly time solvable, if either the vertices or the edges are weighted, but NP- hard , if...WPVCM is NP- hard . This means that partial vertex cover problem is unlikely to be solved exactly in polynomial time for vertex-weighted and edge

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

    NARCIS (Netherlands)

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

    2002-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 from above

  19. Algorithmic complexity and entanglement of quantum states.

    Science.gov (United States)

    Mora, Caterina E; Briegel, Hans J

    2005-11-11

    We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its algorithmic complexity.

  20. Recursion relations and branching rules for simple Lie algebras

    CERN Document Server

    Lyakhovsky, V D

    1995-01-01

    The branching rules between simple Lie algebras and its regular (maximal) simple subalgebras are studied. Two types of recursion relations for anomalous relative multiplicities are obtained. One of them is proved to be the factorized version of the other. The factorization property is based on the existence of the set of weights \\Gamma specific for each injection. The structure of \\Gamma is easily deduced from the correspondence between the root systems of algebra and subalgebra. The recursion relations thus obtained give rise to simple and effective algorithm for branching rules. The details are exposed by performing the explicit decomposition procedure for A_{3} \\oplus u(1) \\rightarrow B_{4} injection.

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

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

    Science.gov (United States)

    2013-03-26

    ... Agency Information Collection Activities; Comment Request; Upward Bound and Upward Bound Math Science... Upward Bound Math Science Annual Performance Report. OMB Control Number: 1840-NEW. Type of Review: New... under the regular Upward Bound (UB) and Upward Bound Math and Science (UBMS) Programs. The Department...

  3. On interpretations of bounded arithmetic and bounded set theory

    CERN Document Server

    Pettigrew, Richard

    2008-01-01

    In a recent paper, Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic. THEOREM: The first-order theories of Peano arithmetic and ZF with the axiom of infinity negated are mutually interpretable with interpretations that are inverse to each other. In this note, I describe a theory of sets that stands in the same relation to the bounded arithmetic IDelta0 + exp. Because of the weakness of this theory of sets, I cannot straightforwardly adapt Kaye and Wong's interpretation of the arithmetic in the set theory. Instead, I am forced to produce a different interpretation.

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

    DEFF Research Database (Denmark)

    Dohn, Anders Høeg; Mason, Andrew

    2013-01-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2002-05-01

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

  6. Cellular and physical mechanisms of branching morphogenesis

    Science.gov (United States)

    Varner, Victor D.; Nelson, Celeste M.

    2014-01-01

    Branching morphogenesis is the developmental program that builds the ramified epithelial trees of various organs, including the airways of the lung, the collecting ducts of the kidney, and the ducts of the mammary and salivary glands. Even though the final geometries of epithelial trees are distinct, the molecular signaling pathways that control branching morphogenesis appear to be conserved across organs and species. However, despite this molecular homology, recent advances in cell lineage analysis and real-time imaging have uncovered surprising differences in the mechanisms that build these diverse tissues. Here, we review these studies and discuss the cellular and physical mechanisms that can contribute to branching morphogenesis. PMID:25005470

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

  8. Fully adaptive algorithms for multivariate integral equations using the non-standard form and multiwavelets with applications to the Poisson and bound-state Helmholtz kernels in three dimensions

    Science.gov (United States)

    Frediani, Luca; Fossgaard, Eirik; Flå, Tor; Ruud, Kenneth

    2013-07-01

    We have developed and implemented a general formalism for fast numerical solution of time-independent linear partial differential equations as well as integral equations through the application of numerically separable integral operators in d ≥ 1 dimensions using the non-standard (NS) form. The proposed formalism is universal, compact and oriented towards the practical implementation into a working code using multiwavelets. The formalism is applied to the case of Poisson and bound-state Helmholtz operators in d = 3. Our algorithms are fully adaptive in the sense that the grid supporting each function is obtained on the fly while the function is being computed. In particular, when the function g = O f is obtained by applying an integral operator O, the corresponding grid is not obtained by transferring the grid from the input function f. This aspect has significant implications that will be discussed in the numerical section. The operator kernels are represented in a separated form with finite but arbitrary precision using Gaussian functions. Such a representation combined with the NS form allows us to build a sparse, banded representation of Green's operator kernel. We have implemented a code for the application of such operators in a separated NS form to a multivariate function in a finite but, in principle, arbitrary number of dimensions. The error of the method is controlled, while the low complexity of the numerical algorithm is kept. The implemented code explicitly computes all the 22d components of the d-dimensional operator. Our algorithms are described in detail in the paper through pseudo-code examples. The final goal of our work is to be able to apply this method to build a fast and accurate Kohn-Sham solver for density functional theory.

  9. Counting and Enumeration Problems with Bounded Treewidth

    Science.gov (United States)

    Pichler, Reinhard; Rümmele, Stefan; Woltran, Stefan

    By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. This result was extended to counting problems by Arnborg et al. and to enumeration problems by Flum et al. Despite the undisputed importance of these results for proving fixed-parameter tractability, they do not directly yield implementable algorithms. Recently, Gottlob et al. presented a new approach using monadic datalog to close the gap between theoretical tractability and practical computability for MSO-definable decision problems. In the current work we show how counting and enumeration problems can be tackled by an appropriate extension of the datalog approach.

  10. Exact entanglement bases and general bound entanglement

    CERN Document Server

    Zhong, Z Z

    2004-01-01

    In this paper, we give the more general bound entangled states associated with the unextendible product bases (UPB), i.e. by using of the exact entanglement bases (EEB) and the complete basis with unextendible product bases (CBUPB), we prove that the arbitrary convex sums of the uniform mixtures (bound entangled states) associated with UPBs are still bound entangled states. Further, we discuss the equivalent transformation group and classification of the CBUPBs, and by using this classification, we prove that in the meaning of indistinguishability, the set of the above all possible bound entangled states can be reduced to the set of all possible mixtures of some fixed basic bound entangled states. At last, we prove that every operating of the partial transposition (PT) map acting upon a density matrix under any bipartite partitioning induces a mapping from the above reduced set of bound entangled states to oneself, which corresponds to a non-identical permutation of the basic bound entangled states.

  11. Lower Bounds for Tropical Circuits and Dynamic Programs

    OpenAIRE

    Jukna, Stasys

    2014-01-01

    Tropical circuits are circuits with Min and Plus, or Max and Plus operations as gates. Their importance stems from their intimate relation to dynamic programming algorithms. The power of tropical circuits lies somewhere between that of monotone boolean circuits and monotone arithmetic circuits. In this paper we present some lower bounds arguments for tropical circuits, and hence, for dynamic programs.

  12. Pen Branch Delta and Savannah River Swamp Hydraulic Model

    Energy Technology Data Exchange (ETDEWEB)

    Chen, K.F.

    1999-05-13

    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.

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

    Directory of Open Access Journals (Sweden)

    Yina Guo

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

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

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

  16. On the Computational Complexity of Branch and Bound Search Strategies.

    Science.gov (United States)

    1979-11-01

    salesman problems. Evidence is presented which suggelts that the assymetric traveling salesma problem can be solved in time O(n ln2 (n)) on the...These results are illustrated by data from ran- dom traveling salesman problems. Evidence is presented which suggests that the assymetric traveling...the corresponding values . . . . . . . . . . . . . . . . . 74 2. Data from the solution of 790 randomly generated assymetric traveling salesman

  17. An improved algorithm to test copositivity

    NARCIS (Netherlands)

    Sponsel, Julia; Bundfuss, Stefan; Dur, Mirjam

    2012-01-01

    Copositivity plays a role in combinatorial and nonconvex quadratic optimization. However, testing copositivity of a given matrix is a co-NP-complete problem. We improve a previously given branch-and-bound type algorithm for testing copositivity and discuss its behavior in particular for the maximum

  18. Bayesian long branch attraction bias and corrections.

    Science.gov (United States)

    Susko, Edward

    2015-03-01

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

  19. Branching Processes with Immigration and Related Topics

    Institute of Scientific and Technical Information of China (English)

    LI Zeng-hu

    2006-01-01

    This is a survey on the recent progresses in the study of branching processes with immigration,generalized Ornstein-Uhlenbeck processes,and affine Markov processes.We mainly focus on the applications of skew convolution semigroups and the connections in those processes.

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

    DEFF Research Database (Denmark)

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

    2012-01-01

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

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

  2. Vulnerable Derivatives and Good Deal Bounds

    DEFF Research Database (Denmark)

    Murgoci, Agatha

    2013-01-01

    a new restriction in the arbitrage free model by setting upper bounds on the Sharpe ratios (SRs) of the assets. The potential prices that are eliminated represent unreasonably good deals. The constraint on the SR translates into a constraint on the stochastic discount factor. Thus, tight pricing bounds...... can be obtained. We provide a link between the objective probability measure and the range of potential risk-neutral measures, which has an intuitive economic meaning. We also provide tight pricing bounds for European calls and show how to extend the call formula to pricing other financial products...

  3. Expectation-maximization algorithm for determining natural selection of Y-linked genes through two-sex branching processes.

    Science.gov (United States)

    González, M; Gutiérrez, C; Martínez, R

    2012-09-01

    A two-dimensional bisexual branching process has recently been presented for the analysis of the generation-to-generation evolution of the number of carriers of a Y-linked gene. In this model, preference of females for males with a specific genetic characteristic is assumed to be determined by an allele of the gene. It has been shown that the behavior of this kind of Y-linked gene is strongly related to the reproduction law of each genotype. In practice, the corresponding offspring distributions are usually unknown, and it is necessary to develop their estimation theory in order to determine the natural selection of the gene. Here we deal with the estimation problem for the offspring distribution of each genotype of a Y-linked gene when the only observable data are each generation's total numbers of males of each genotype and of females. We set out the problem in a non parametric framework and obtain the maximum likelihood estimators of the offspring distributions using an expectation-maximization algorithm. From these estimators, we also derive the estimators for the reproduction mean of each genotype and forecast the distribution of the future population sizes. Finally, we check the accuracy of the algorithm by means of a simulation study.

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

  5. Branch Retinal Vein Occlusion and Its Management

    Institute of Scientific and Technical Information of China (English)

    Desmond; Archer

    1992-01-01

    The natural course of Branch Retinal Vein Occlusion is determined by the site and completeness of the occlusion, the integrity of arterial perfusion to the affected sector and the efficiency of the developing collateral circulation. Most patients with tributary vein occlusion have some capillary fall out and microvascular incompetence in the distribution of the affected retina and vision is significantly compromised in over 50% of patients who have either chronic macular oedema or ischemia involving the...

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

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

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

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

  9. On an Outer bound and an Inner Bound for the General Broadcast Channel

    CERN Document Server

    Gohari, Amin Aminzadeh; Anantharam, Venkat

    2010-01-01

    In this paper, we study the Nair-El Gamal outer bound and Marton's inner bound for general two-receiver broadcast channels. We show that the Nair-El Gamal outer bound can be made fully computable. For the inner bound, we show that, unlike in the Gaussian case, for a degraded broadcast channel even without a common message, Marton's coding scheme without a superposition variable is in general insufficient for obtaining the capacity region. Further, we prove various results that help to restrict the search space for computing the sum-rate for Marton's inner bound. We establish the capacity region along certain directions and show that it coincides with Marton's inner bound. Lastly, we discuss an idea that may lead to a larger inner bound.

  10. Lower and Upper Bounds in Zone-Based Abstractions of Timed Automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Bouyer, Patricia; Larsen, Kim Guldstrand;

    2005-01-01

    be obtained. We show soundness and completeness of the new abstractions w.r.t. reachability and demonstrate how information about lower and upper bounds can be used to optimise the algorithm for bringing a difference bound matrix into normal form. Finally, we experimentally demonstrate that the new techniques...

  11. Lower and Upper Bounds in Zone-Based Abstractions of Timed Automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Bouyer, P.; Larsen, Kim Guldstrand;

    2005-01-01

    , significantly coarser abstractions can be obtained. We show soundness and completeness of the new abstractions w.r.t. reachability. We demonstrate how information about lower and upper bounds can be used to optimise the algorithm for bringing a difference bound matrix into normal form. Finally, we...

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

    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.

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

  14. 5d Higgs branch localization, Seiberg-Witten equations and contact geometry

    Science.gov (United States)

    Pan, Yiwen

    2015-01-01

    In this paper we apply the idea of Higgs branch localization to 5d supersymmetric theories of vector multiplet and hypermultiplets, obtained as the rigid limit of = 1 supergravity with all auxiliary fields. On supersymmetric K-contact/Sasakian background, the Higgs branch BPS equations can be interpreted as 5d generalizations of the Seiberg-Witten equations. We discuss the properties and local behavior of the solutions near closed Reeb orbits. For U(1) gauge theories, which can be straight-forwardly generalized to theories whose gauge group can be completely broken, we show the suppression of the deformed Coulomb branch, and the partition function is dominated by 5d Seiberg-Witten solutions. For squashed S 5 and Y pq manifolds, we show the matching between poles in the perturbative Coulomb branch matrix model, and the bound on local winding numbers of the BPS solutions.

  15. A PSL Bounded Model Checking Method

    Institute of Scientific and Technical Information of China (English)

    YU Lei; ZHAO Zongtao

    2012-01-01

    SAT-based bounded model checking (BMC) is introduced as an important complementary technique to OBDD-based symbolic model checking, and is an efficient verification method for parallel and reactive systems. However, until now the properties verified by bounded model checking are very finite. Temporal logic PSL is a property specification language (IEEE-1850) describing parallel systems and is divided into two parts, i.e. the linear time logic FL and the branch time logic OBE. In this paper, the specification checked by BMC is extended to PSL and its algorithm is also proposed. Firstly, define the bounded semantics of PSL, and then reduce the bounded semantics into SAT by translating PSL specification formula and the state transition relation of the system to the propositional formula A and B, respectively. Finally, verify the satisfiability of the conjunction propositional formula of A and B. The algorithm results in the translation of the existential model checking of the temporal logic PSL into the satisfiability problem of propositional formula. An example of a queue controlling circuit is used to interpret detailedly the executing procedure of the algorithm.

  16. Branching time, indeterminism and tense logic

    DEFF Research Database (Denmark)

    Ploug, Thomas; Øhrstrøm, Peter

    2012-01-01

    was first suggested by Saul Kripke in a letter to A.N. Prior, dated September 3, 1958, and it is shown how the elaboration of the idea in the course of the correspondence was intimately intervowen with considerations of how to represent indeterminism and of the adequacy of tensed logic in light of special...... 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....

  17. Structural dynamics branch research and accomplishments to FY 1992

    Science.gov (United States)

    Lawrence, Charles

    1992-12-01

    This publication contains a collection of fiscal year 1992 research highlights from the Structural Dynamics Branch at NASA LeRC. Highlights from the branch's major work areas--Aeroelasticity, Vibration Control, Dynamic Systems, and Computational Structural Methods are included in the report as well as a listing of the fiscal year 1992 branch publications.

  18. Structural dynamics branch research and accomplishments for fiscal year 1987

    Science.gov (United States)

    1988-01-01

    This publication contains a collection of fiscal year 1987 research highlights from the Structural Dynamics Branch at NASA Lewis Research Center. Highlights from the branch's four major work areas, Aeroelasticity, Vibration Control, Dynamic Systems, and Computational Structural Methods, are included in the report as well as a complete listing of the FY87 branch publications.

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

  20. Weakly bound systems, continuum effects, and reactions

    CERN Document Server

    Jaganathen, Y; Ploszajczak, M

    2012-01-01

    Structure of weakly bound/unbound nuclei close to particle drip lines is different from that around the valley of beta stability. A comprehensive description of these systems goes beyond standard Shell Model and demands an open quantum system description of the nuclear many-body system. We approach this problem using the Gamow Shell Model which provides a fully microscopic description of bound and unbound nuclear states, nuclear decays, and reactions. We present in this paper the first application of the GSM for a description of the elastic and inelastic scattering of protons on 6He.

  1. Networks of companies and branches in Poland

    CERN Document Server

    Chmiel, A M; Sienkiewicz, J; Suchecki, K; Chmiel, Anna M.; Holyst, Janusz A.; Sienkiewicz, Julian; Suchecki, Krzysztof

    2006-01-01

    In this study we consider relations between companies in Poland taking into account common branches they belong to. It is clear that companies belonging to the same branch compete for similar customers, so the market induces correlations between them. On the other hand two branches can be related by companies acting in both of them. To remove weak, accidental links we shall use a concept of threshold filtering for weighted networks where a link weight corresponds to a number of existing connections (common companies or branches) between a pair of nodes.

  2. On Cosmic No-hair in Bimetric Gravity and the Higuchi Bound

    CERN Document Server

    Sakakihara, Yuki; Takahashi, Tomohiro

    2012-01-01

    We study the cosmic no-hair in the presence of spin-2 matter, i.e. in bimetric gravity. We obtain stable de Sitter solutions with the cosmological constant in the physical sector and find an evidence that the cosmic no-hair is correct. In the presence of the other cosmological constant, there are two branches of de Sitter solutions. Under anisotropic perturbations, one of them is always stable and there is no violation of the cosmic no-hair at the linear level. The stability of the other branch depends on parameters and the cosmic no-hair can be violated in general. Remarkably, the bifurcation point of two branches exactly coincides with the Higuchi bound. It turns out that there exists a de Sitter solution for which the cosmic no-hair holds at the linear level and the effective mass for the anisotropic perturbations is above the Higuchi bound.

  3. Lower bounds for unbounded operators and semigroups

    OpenAIRE

    2016-01-01

    Let $A$ be an unbounded operator on a Banach space $X$. It is sometimes useful to improve the operator $A$ by extending it to an operator $B$ on a larger Banach space $Y$ with smaller spectrum. It would be preferable to do this with some estimates for the resolvent of $B$, and also to extend bounded operators related to $A$, for example a semigroup generated by $A$. When $X$ is a Hilbert space, one may also want $Y$ to be Hilbert space. Results of this type for bounded operators have been giv...

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

  5. Covariant Entropy Bound and Padmanabhan's Emergent Paradigm

    CERN Document Server

    Hadi, H; Darabi, F

    2016-01-01

    The covariant entropy conjecture is invariant under time reversal and consequently its origin must be statistical rather than thermodynamical. This may impose a fundamental constraint on the number of degrees of freedom in nature. Indeed, the covariant entropy bound imposes an upper entropy bound for any physical system. Considering a cosmological system, we show that Padmanabhan's emergent paradigm, which indicates that the emergence of cosmic space is due to the discrepancy between the surface and bulk degrees of freedom, leads to a lower entropy bound. The lower and upper entropy bounds may coincide on the apparent horizon for the radiation field and dark energy with the equations of state $\\omega=\\frac{1}{3}$ and $\\omega=-1$, respectively. Moreover, the maximal entropy inside the apparent horizon occurs when it is filled completely by the radiation field or dark energy. It turns out that for dark energy case (pure de Sitter space)\\ the holographic principle is satisfied in the sense that the number of deg...

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

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

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

  9. Modified symmetrical reversible variable length code and its theoretical bounds

    Science.gov (United States)

    Tsai, Chien-Wu; Wu, Ja-Ling; Liu, Shu-Wei

    2000-04-01

    The reversible variable length codes (RVLCs) have been adopted in the emerging video coding standards -- H.263+ and MPEG- 4, to enhance their error-resilience capability which is important and essential in the error-prone environments. The most appealing advantage of symmetrical RVLCs compared with asymmetrical RVLCs is that only one code table is required to forward and backward decoding, however, two code tables are required for asymmetrical RVLCs. In this paper, we propose a simple and efficient algorithm that can produce a symmetrical RVLC from a given Huffman code, and we also discuss theoretical bounds of the proposed symmetrical RVLCs.

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

  11. Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems

    CERN Document Server

    Fukunaga, A S; 10.1613/jair.2106

    2011-01-01

    Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems can be used to model task and resource allocation problems in multi-agent systems and distributed systms, and can also be found as subproblems of scheduling problems. We propose bin completion, a branch-and-bound strategy for one-dimensional, multicontainer packing problems. Bin completion combines a bin-oriented search space with a powerful dominance criterion that enables us to prune much of the space. The performance of the basic bin completion framework can be enhanced by using a number of extensions, including nogood-based pruning techniques that allow further exploitation of the dominance criterion. Bin completion is applied to four problems: multiple knapsack, bin covering, min-cost covering, and bin packing. We show that our bin completion algorithms yield new, state-of-the-art results for the multiple knapsack, bin covering,...

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

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2004-01-01

    We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed...... link establishment costs and the link capacity costs into account. The hierarchical two layer ring network design problem is solved in two stages: First the bottom layer, i.e. the metro-rings are designed, implicitly taking into account the capacity cost of the federal-ring. Then the federal......-ring is designed connecting the metro-rings, minimizing fixed link establishment costs of the federal-ring. A branch-and-price algorithm is presented for the design of the bottom layer and it is suggested that existing methods are used for the design of the federal-ring. Computational results are given...

  13. POISSON REPRESENTATIONS OF BRANCHING MARKOV AND MEASURE-VALUED BRANCHING PROCESSES

    NARCIS (Netherlands)

    Kurtz, Thomas G.; Rodrigues, Eliane R.

    2011-01-01

    Representations of branching Markov processes and their measure-valued limits in terms of countable systems of particles are constructed for models with spatially varying birth and death rates. Each particle has a location and a "level," but unlike earlier constructions, the levels change with time.

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

    DEFF Research Database (Denmark)

    Hansen, Thomas Dueholm; Zwick, Uri

    2010-01-01

    Howard’s policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to weighted directed graphs, which may be viewed as Deterministic MDPs (DMDPs), Howard’s algorithm can be used to find Minimum ...

  15. Mutual information rate and bounds for it.

    Directory of Open Access Journals (Sweden)

    Murilo S Baptista

    Full Text Available The amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR, is calculated from the mutual information, which is rigorously defined only for random systems. Moreover, the definition of mutual information is based on probabilities of significant events. This work offers a simple alternative way to calculate the MIR in dynamical (deterministic networks or between two time series (not fully deterministic, and to calculate its upper and lower bounds without having to calculate probabilities, but rather in terms of well known and well defined quantities in dynamical systems. As possible applications of our bounds, we study the relationship between synchronisation and the exchange of information in a system of two coupled maps and in experimental networks of coupled oscillators.

  16. Mutual information rate and bounds for it.

    Science.gov (United States)

    Baptista, Murilo S; Rubinger, Rero M; Viana, Emilson R; Sartorelli, José C; Parlitz, Ulrich; Grebogi, Celso

    2012-01-01

    The amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR), is calculated from the mutual information, which is rigorously defined only for random systems. Moreover, the definition of mutual information is based on probabilities of significant events. This work offers a simple alternative way to calculate the MIR in dynamical (deterministic) networks or between two time series (not fully deterministic), and to calculate its upper and lower bounds without having to calculate probabilities, but rather in terms of well known and well defined quantities in dynamical systems. As possible applications of our bounds, we study the relationship between synchronisation and the exchange of information in a system of two coupled maps and in experimental networks of coupled oscillators.

  17. Mutual Information Rate and Bounds for It

    Science.gov (United States)

    Baptista, Murilo S.; Rubinger, Rero M.; Viana, Emilson R.; Sartorelli, José C.; Parlitz, Ulrich; Grebogi, Celso

    2012-01-01

    The amount of information exchanged per unit of time between two nodes in a dynamical network or between two data sets is a powerful concept for analysing complex systems. This quantity, known as the mutual information rate (MIR), is calculated from the mutual information, which is rigorously defined only for random systems. Moreover, the definition of mutual information is based on probabilities of significant events. This work offers a simple alternative way to calculate the MIR in dynamical (deterministic) networks or between two time series (not fully deterministic), and to calculate its upper and lower bounds without having to calculate probabilities, but rather in terms of well known and well defined quantities in dynamical systems. As possible applications of our bounds, we study the relationship between synchronisation and the exchange of information in a system of two coupled maps and in experimental networks of coupled oscillators. PMID:23112809

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

  19. Invariance and stability for bounded uncertain systems.

    Science.gov (United States)

    Peng, T. K. C.

    1972-01-01

    The positive limit sets of the solutions of a contingent differential equation are shown to possess an invariance property. In this connection the 'invariance principle' in the theory of Lyapunov stability is extended to systems with unknown, bounded, time-varying parameters, and thus to a large and important class of nonautonomous systems. Asymptotic stability criteria are obtained and applied to guaranteed cost control problems.

  20. Optimization of placing-in and taking-out wagons on branch-shaped railway lines based on genetic and ant colony algorithm%基于遗传蚁群算法的树枝型铁路取送车问题优化

    Institute of Scientific and Technical Information of China (English)

    雷友诚; 涂祖耀; 桂卫华; 吴志飞; 闫福全

    2011-01-01

    Aiming at the distribution of railway line and a combinatorial mode of placing-in and taking-out wagons at an enterprise railway freight station, a mathematical model of optimal operation for placing-in and taking-out wagons in the branch-shaped private line was established, which is deduced as a typical traveling salesman problem(TSP). Meanwhile, a combination of genetic algorithm and ant colony algorithm called GACA was presented to resolve the large-scale combinatorial optimization problem. The genetic algorithm was adopted to generate pheromone to distribute. And the ant colony algorithm was used to find an accurate solution. As a result, the searching efficiency and the time efficiency of the combinatorial algorithm are both greatly improved. Combined with an example, the optimal solution of the placing-in and taking-out wagons problem is found.%针对企业铁路货运站的铁路线分布特点和“连送带取”的作业方式,建立树枝型专用线取送车的数学模型,将其归纳为一个典型的旅行商问题.同时提出一种融合遗传算法和蚁群算法特点的遗传蚁群算法(GACA)来解决这种大规模组合优化问题;采用遗传算法生成信息素分布,利用蚁群算法求精确解,有效提高算法的时间效率和求解效率.结合实例计算求得了企业取送车作业问题的最优解.

  1. Data streams algorithms and applications

    CERN Document Server

    Muthukrishnan, S

    2014-01-01

    Data stream algorithms as an active research agenda emerged only over the past few years, even though the concept of making few passes over the data for performing computations has been around since the early days of Automata Theory. The data stream agenda now pervades many branches of Computer Science including databases, networking, knowledge discovery and data mining, and hardware systems. Industry is in synch too, with Data Stream Management Systems (DSMSs) and special hardware to deal with data speeds. Even beyond Computer Science, data stream concerns are emerging in physics, atmospheric

  2. Upper and lower bounds on quantum codes

    Science.gov (United States)

    Smith, Graeme Stewart Baird

    This thesis provides bounds on the performance of quantum error correcting codes when used for quantum communication and quantum key distribution. The first two chapters provide a bare-bones introduction to classical and quantum error correcting codes, respectively. The next four chapters present achievable rates for quantum codes in various scenarios. The final chapter is dedicated to an upper bound on the quantum channel capacity. Chapter 3 studies coding for adversarial noise using quantum list codes, showing there exist quantum codes with high rates and short lists. These can be used, together with a very short secret key, to communicate with high fidelity at noise levels for which perfect fidelity is, impossible. Chapter 4 explores the performance of a family of degenerate codes when used to communicate over Pauli channels, showing they can be used to communicate over almost any Pauli channel at rates that are impossible for a nondegenerate code and that exceed those of previously known degenerate codes. By studying the scaling of the optimal block length as a function of the channel's parameters, we develop a heuristic for designing even better codes. Chapter 5 describes an equivalence between a family of noisy preprocessing protocols for quantum key distribution and entanglement distillation protocols whose target state belongs to a class of private states called "twisted states." In Chapter 6, the codes of Chapter 4 are combined with the protocols of Chapter 5 to provide higher key rates for one-way quantum key distribution than were previously thought possible. Finally, Chapter 7 presents a new upper bound on the quantum channel capacity that is both additive and convex, and which can be interpreted as the capacity of the channel for communication given access to side channels from a class of zero capacity "cloning" channels. This "clone assisted capacity" is equal to the unassisted capacity for channels that are degradable, which we use to find new upper

  3. Nonminimal global monopoles and bound orbits

    CERN Document Server

    Nucamendi, U; Sudarsky, D; Nucamendi, Ulises; Salgado, Marcelo; Sudarsky, Daniel

    2000-01-01

    We perform a numerical analysis of the gravitational field of a global monopole coupled nonminimally to gravity, and find that, for some given nonminimal couplings (in constrast with the minimal coupling case), there is an attractive region where bound orbits exist. We exhibit the behavior of the frequency shifts that would be associated with `rotation curves' of stars in circular orbits in the spacetimes of such global monopoles.

  4. Preventing Death and Serious Injury from Falling Trees and Branches

    Science.gov (United States)

    Brookes, Andrew

    2007-01-01

    Of 128 outdoor education related deaths examined since 1960, 14 have been due to falling trees or branches. This article examines the grounds on which death or serious injury due to falling trees or branches can be regarded as an inherent risk in outdoor education, and the extent to which such incidents can be regarded as preventable. It compares…

  5. Coarrays, MUSIC, and the Cramér-Rao Bound

    Science.gov (United States)

    Wang, Mianzhi; Nehorai, Arye

    2017-02-01

    Sparse linear arrays, such as co-prime arrays and nested arrays, have the attractive capability of providing enhanced degrees of freedom. By exploiting the coarray structure, an augmented sample covariance matrix can be constructed and MUSIC (MUtiple SIgnal Classification) can be applied to identify more sources than the number of sensors. While such a MUSIC algorithm works quite well, its performance has not been theoretically analyzed. In this paper, we derive a simplified asymptotic mean square error (MSE) expression for the MUSIC algorithm applied to the coarray model, which is applicable even if the source number exceeds the sensor number. We show that the directly augmented sample covariance matrix and the spatial smoothed sample covariance matrix yield the same asymptotic MSE for MUSIC. We also show that when there are more sources than the number of sensors, the MSE converges to a positive value instead of zero when the signal-to-noise ratio (SNR) goes to infinity. This finding explains the "saturation" behavior of the coarray-based MUSIC algorithms in the high SNR region observed in previous studies. Finally, we derive the Cram\\'er-Rao bound (CRB) for sparse linear arrays, and conduct a numerical study of the statistical efficiency of the coarray-based estimator. Experimental results verify theoretical derivations and reveal the complex efficiency pattern of coarray-based MUSIC algorithms.

  6. The Acquisition of Bound and Free Anaphora.

    Science.gov (United States)

    Koster, Jan; Koster, Charlotte

    Most linguists assume that bound anaphors such as "himself" are connected with their antecedents in a different way from free anaphors such as "him." Bound anaphora resolution is deterministic, based on Principle A of Chomsky's binding theory. Free anaphors, pronominals, cannot be bound in the domain of reflexives (principle…

  7. Bounded rationality and heterogeneous expectations in macroeconomics

    NARCIS (Netherlands)

    D. Massaro

    2012-01-01

    This thesis studies the effect of individual bounded rationality on aggregate macroeconomic dynamics. Boundedly rational agents are specified as using simple heuristics in their decision making. An important aspect of the type of bounded rationality described in this thesis is that the population of

  8. Energy additivity in branched and cyclic hydrocarbons

    Energy Technology Data Exchange (ETDEWEB)

    Gao, H.; Bader, R.F.W. [McMaster Univ., Hamilton, ON (Canada). Dept. of Chemistry; Cortes-Guzman, F. [Univ. Nacional Autonoma de Mexico, (Mexico). Dept. de Fisicoquimica

    2009-11-15

    This paper reported on a study of the energetic relationships between hydrocarbon molecules and the heats of formation. The quantum theory of atoms in molecules (QTAIM) was used to investigate the degree to which branched hydrocarbons obey a group additivity scheme for energy and populations. The QTAIM defined the properties of the chemical groups. The experimental and theoretical transferability of the methyl and methylene groups of the linear hydrocarbons was also explored. The calculations were performed using a large basis set at the restricted Hartree-Fock and MP2(full) levels of theory. The study also investigated the deviations from additivity, noted for small ring hydrocarbons leading to the definition of strain energy. The QTAIM energies recovered the experimental values. The paper included details regarding the delocalization of the electron density over the surface of the cyclopropane ring, responsible for its homoaromatic properties. The calculations presented in this study satisfied the virial theorem for the atomic definition of energy. The paper discussed the problems associated with the use of the density functional theory (DFT) resulting from its failure to satisfy the virial theorem. 44 refs., 9 tabs., 2 figs.

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

  10. CBC bound proteins and RNA fate

    DEFF Research Database (Denmark)

    Giacometti, Simone

    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...... may therefore be determined by additional RNA features and/or by other RNA-binding proteins, which may synergize with the cap and drive the formation of one specific CBC subcomplex instead of another. In an attempt to identify yet unknown factors that may interact with cap-bound CBCAP and CBCN, we...

  11. Space-efficient parallel algorithms for combinatorial search problems

    DEFF Research Database (Denmark)

    Pietrcaprina, Andrea; Pucci, Geppino; Silvestri, Francesco;

    2015-01-01

    We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound , both involving the visit of an n-node tree of height h under the assumption that a node can be accessed only through its father or its children. For both...... problems we propose efficient algorithms that run on a p-processor distributed-memory machine. For backtrack search, we give a deterministic algorithm running in O(n/p+hlogp) time, and a Las Vegas algorithm requiring optimal O(n/p+h) time, with high probability. Building on the backtrack search algorithm...

  12. 20 CFR 422.5 - District offices and branch offices.

    Science.gov (United States)

    2010-04-01

    ... Section 422.5 Employees' Benefits SOCIAL SECURITY ADMINISTRATION ORGANIZATION AND PROCEDURES Organization and Functions of the Social Security Administration § 422.5 District offices and branch offices. There are over 700 social security district offices and branch offices located in the principal cities...

  13. Branching and annihilating random walks: exact results at low branching rate.

    Science.gov (United States)

    Benitez, Federico; Wschebor, Nicolás

    2013-05-01

    We present some exact results on the behavior of branching and annihilating random walks, both in the directed percolation and parity conserving universality classes. Contrary to usual perturbation theory, we perform an expansion in the branching rate around the nontrivial pure annihilation (PA) model, whose correlation and response function we compute exactly. With this, the nonuniversal threshold value for having a phase transition in the simplest system belonging to the directed percolation universality class is found to coincide with previous nonperturbative renormalization group (RG) approximate results. We also show that the parity conserving universality class has an unexpected RG fixed point structure, with a PA fixed point which is unstable in all dimensions of physical interest.

  14. Synthesis and Characterization of Branched Poly(ester urea)s with Different Branch Density

    Science.gov (United States)

    Yu, Jiayi; Becker, Matthew

    2015-03-01

    A new class of L-phenylalanine-based poly(ester urea)s (PEU) was developed that possess tunable mechanical properties, water uptake ability and degradation rates. Our preliminary data has shown that 1,6-hexanediol L - phenylalanine-based poly(ester urea)s possesses an elastic modulus nearly double that of poly(lactic acid). My work details the synthesis of a series of L - phenylalanine-based poly(ester urea)s possessing a variation in diol chain length and in branch density and shows how these subtle structural differences influence the mechanical properties and in vitro biodegradation rates. The elastic moduli span a range of values that overlap with several currently clinically available degradable polymers. Increasingly the diol chain lengths increases the amount of flexible segment in the chemical structure, which results in reduced elastic modulus values and increased values of elongation at break. Increasing the amount of branch monomer incorporated into the system reduces the molecular entanglement, which also results in decreased elastic modulus values and increased values of elongation at break. The L - phenylalanine-based poly(ester urea)s also exhibited a diol length dependent degradation process that varied between 1-5 % over 16 weeks. Compared with PLLA, PEUs degrade more quickly and the rate can be tuned by changing the diol chain length. PEUs absorb more water and the water uptake ability can be tuned by changing the branch density. This work was supported by Akron Functional Materials Center.

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

  16. Pebbling and Branching Programs Solving the Tree Evaluation Problem

    CERN Document Server

    Wehr, Dustin

    2010-01-01

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

  17. Valuation models and Simon's bounded rationality

    Directory of Open Access Journals (Sweden)

    Alexandra Strommer de Farias Godoi

    2009-09-01

    Full Text Available This paper aims at reconciling the evidence that sophisticated valuation models are increasingly used by companies in their investment appraisal with the literature of bounded rationality, according to which objective optimization is impracticable in the real world because it would demand an immense level of sophistication of the analytical and computational processes of human beings. We show how normative valuation models should rather be viewed as forms of reality representation, frameworks according to which the real world is perceived, fragmented for a better understanding, and recomposed, providing an orderly method for undertaking a task as complex as the investment decision.

  18. FY 1992 Measurements and Characterization Branch annual report

    Energy Technology Data Exchange (ETDEWEB)

    Dippo, P.C [ed.

    1993-03-01

    The Measurements and Characterization Branch actively supports the advancement of DOE/NREL goals for the development and implementation of the solar photovoltaic (PV) technology. The primary focus of the laboratories is to provide state-of-the-art analytical capabilities for materials and device characterization and fabrication. The branch houses a comprehensive facility that Is capable of providing information on the full range of PV components. A major objective of the branch is to aggressively pursue collaborative research with other government laboratories, universities, and industrial firms for the advancement of Pv technologies. Members of the branch disseminate research findings to the technical community in publications and presentations. The Measurements and Characterization Branch encompasses seven coordinated research groups, providing integrated research and development that covers all aspects of photovoltaic materials/devices characterization.

  19. Studying the R-branch and the Q-branch emission spectral lines of diatomic molecules using improved analytical formula

    Science.gov (United States)

    Jiang, Yonghong; Sun, Weiguo; Zhang, Yi; Fu, Jia; Fan, Qunchao; Li, Huidong; Feng, Hao

    2016-06-01

    The difference converging method (DCM) used to predict the R-branch and the Q-branch high-lying rotational lines for diatomic systems is improved in this study. The key analytical formulae of the DCM method are modified by adding a higher order spectral term Hυ, and adding a physical converging criterion to improve the accuracy of predictions. Applications of the improved DCM method to the R-branch of the TiF molecule and the Q-branch of the 193IrN molecule show that the accuracy of the R-branch and the Q-branch rotational lines is about one order of magnitude better than the results obtained using the previous formulae, which demonstrate the necessity of the added small term Hυ and the physical converging criterion. The DCM results are also shown to be better than the extrapolated rotational lines using the least-squares method.

  20. Branched nanostructures and method of synthesizing the same

    Science.gov (United States)

    Fonseca, Luis F. (Inventor); Resto, Oscar (Inventor); Sola, Francisco (Inventor)

    2009-01-01

    A branched nanostructure is synthesized. A porous material, with pores having a diameter of approximately 1 .mu.m or less, is placed in a vacuum. It is irradiated with an electron beam. This causes a trunk to grow from the porous material and further causes branches to grow from the trunk.

  1. Expression of an engineered granule-bound Escherichia coli glycogen branching enzyme in potato results in severe morphological changes in starch granules.

    Science.gov (United States)

    Huang, Xing-Feng; Nazarian-Firouzabadi, Farhad; Vincken, Jean-Paul; Ji, Qin; Suurs, Luc C J M; Visser, Richard G F; Trindade, Luisa M

    2013-05-01

    The Escherichia coli glycogen branching enzyme (GLGB) was fused to either the C- or N-terminus of a starch-binding domain (SBD) and expressed in two potato genetic backgrounds: the amylose-free mutant (amf) and an amylose-containing line (Kardal). Regardless of background or construct used, a large amount of GLGB/SBD fusion protein was accumulated inside the starch granules, however, without an increase in branching. The presence of GLGB/SBD fusion proteins resulted in altered morphology of the starch granules in both genetic backgrounds. In the amf genetic background, the starch granules showed both amalgamated granules and porous starch granules, whereas in Kardal background, the starch granules showed an irregular rough surface. The altered starch granules in both amf and Kardal backgrounds were visible from the initial stage of potato tuber development. High-throughput transcriptomic analysis showed that expression of GLGB/SBD fusion protein in potato tubers did not affect the expression level of most genes directly involved in the starch biosynthesis except for the up-regulation of a beta-amylase gene in Kardal background. The beta-amylase protein could be responsible for the degradation of the extra branches potentially introduced by GLGB.

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

  3. Linear and Branched PEIs (Polyethylenimines) and Their Property Space

    Science.gov (United States)

    Lungu, Claudiu N.; Diudea, Mircea V.; Putz, Mihai V.; Grudziński, Ireneusz P.

    2016-01-01

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

  4. Linear and Branched PEIs (Polyethylenimines) and Their Property Space.

    Science.gov (United States)

    Lungu, Claudiu N; Diudea, Mircea V; Putz, Mihai V; Grudziński, Ireneusz P

    2016-04-13

    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.

  5. Clinical Anatomy and Measurement of the Medial Branch of the Spinal Dorsal Ramus

    Science.gov (United States)

    Shuang, Feng; Hou, Shu-Xun; Zhu, Jia-Liang; Liu, Yan; Zhou, Ying; Zhang, Chun-Li; Tang, Jia-Guang

    2015-01-01

    Abstract Percutaneous block and neurotomy of the medial branch of the spinal dorsal ramus has shown excellent results in treating facet joint-mediated low back pain. This study aimed to describe the clinical anatomy of the medial branch and its measurements. We dissected the lumbar spine of 12 adult cadavers (24 sides) and measured the distances between the medial branch and various anatomical landmarks. The distances were compared between L1 and L5 vertebrae. The distance between the dorsal ramus bifurcation and the superior border of the root of the transverse process was 3.52 ± 1.15 mm, 3.63 ± 1.36 mm, 3.46 ± 1.31 mm, 3.38 ± 1.24 mm, and 1.87 ± 0.88 for L1 to L5, respectively. The medial branch of the dorsal ramus is enclosed in a fibro-osseous canal bounded by the accessory process, the mammillary process, and the mammilloaccessory ligament. For the percutaneous treatment of block and neurotomy, the first choice of target is the medial branch fibro-osseous canal near to the accessory process. The accessory process is not displayed in x-ray films; therefore, the junction of the superior articular process and the root of the transverse process can be targeted. PMID:26717379

  6. Bound and Radiation Fields in Rindler Frame

    CERN Document Server

    Hirayama, T

    2001-01-01

    Energy-momentum tensor of Li\\'enard-Wiechert field is split into bound and emitted parts in Rindler frame, by generalizing the reasoning of Teitelboim used in inertial frame. Our discussion proceeds with the the notion of ``energy'' defined with respect to the Killing vector field attached to the frame. We obtain the ``radiation formula in Rindler frame''(Rindler version of Larmor formula) and it is found that the radiation power is proportional to the square of ``acceleration $\\alpha^\\mu$ of the charge relative to the Rindler frame''. This result makes us split the Li\\'enard-Wiechert field into the part $\\tII$ which is linear in $\\alpha^\\mu$ and the part $\\tI$ which is independent of $\\alpha^\\mu$, and by using them, we split the energy-momentum tensor into two parts. We find that these are properly interpreted as the emitted and bound parts of the tensor in Rindler frame. In our identification of radiation, a charge does not radiate not only in the case where the charge is fixed to the Rindler frame, but als...

  7. Effects of branch height on leaf gas exchange, branch hydraulic conductance and branch sap flux in open-grown ponderosa pine.

    Science.gov (United States)

    Hubbard, Robert M; Bond, Barbara J; Senock, Randy S; Ryan, Michael G

    2002-06-01

    Recent studies have shown that stomata respond to changes in hydraulic conductance of the flow path from soil to leaf. In open-grown tall trees, branches of different heights may have different hydraulic conductances because of differences in path length and growth. We determined if leaf gas exchange, branch sap flux, leaf specific hydraulic conductance, foliar carbon isotope composition (delta13C) and ratios of leaf area to sapwood area within branches were dependent on branch height (10 and 25 m) within the crowns of four open-grown ponderosa pine (Pinus ponderosa Laws.) trees. We found no difference in leaf gas exchange or leaf specific hydraulic conductance from soil to leaf between the upper and lower canopy of our study trees. Branch sap flux per unit leaf area and per unit sapwood area did not differ between the 10- and 25-m canopy positions; however, branch sap flux per unit sapwood area at the 25-m position had consistently lower values. Branches at the 25-m canopy position had lower leaf to sapwood area ratios (0.17 m2 cm-2) compared with branches at the 10-m position (0.27 m2 cm-2) (P = 0.03). Leaf specific conductance of branches in the upper crown did not differ from that in the lower crown. Other studies at our site indicate lower hydraulic conductance, sap flux, whole-tree canopy conductance and photosynthesis in old trees compared with young trees. This study suggests that height alone may not explain these differences.

  8. On Pseudocodewords and Improved Union Bound of Linear Programming Decoding of HDPC Codes

    CERN Document Server

    Gidon, Ohad

    2012-01-01

    In this paper, we present an improved union bound on the Linear Programming (LP) decoding performance of the binary linear codes transmitted over an additive white Gaussian noise channels. The bounding technique is based on the second-order of Bonferroni-type inequality in probability theory, and it is minimized by Prim's minimum spanning tree algorithm. The bound calculation needs the fundamental cone generators of a given parity-check matrix rather than only their weight spectrum, but involves relatively low computational complexity. It is targeted to high-density parity-check codes, where the number of their generators is extremely large and these generators are spread densely in the Euclidean space. We explore the generator density and make a comparison between different parity-check matrix representations. That density effects on the improvement of the proposed bound over the conventional LP union bound. The paper also presents a complete pseudo-weight distribution of the fundamental cone generators for ...

  9. Minimal Change and Bounded Incremental Parsing

    CERN Document Server

    Wiren, M

    1994-01-01

    Ideally, the time that an incremental algorithm uses to process a change should be a function of the size of the change rather than, say, the size of the entire current input. Based on a formalization of ``the set of things changed'' by an incremental modification, this paper investigates how and to what extent it is possible to give such a guarantee for a chart-based parsing framework and discusses the general utility of a minimality notion in incremental processing.

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

  11. Hyperquarks and bosonic preon bound states

    Science.gov (United States)

    Schmid, Michael L.; Buchmann, Alfons J.

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

  12. Hyperquarks and bosonic preon bound states

    CERN Document Server

    Schmid, Michael L

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

  13. The Relationship between auxin transport and maize branching.

    Science.gov (United States)

    Gallavotti, Andrea; Yang, Yan; Schmidt, Robert J; Jackson, David

    2008-08-01

    Maize (Zea mays) plants make different types of vegetative or reproductive branches during development. Branches develop from axillary meristems produced on the flanks of the vegetative or inflorescence shoot apical meristem. Among these branches are the spikelets, short grass-specific structures, produced by determinate axillary spikelet-pair and spikelet meristems. We investigated the mechanism of branching in maize by making transgenic plants expressing a native expressed endogenous auxin efflux transporter (ZmPIN1a) fused to yellow fluorescent protein and a synthetic auxin-responsive promoter (DR5rev) driving red fluorescent protein. By imaging these plants, we found that all maize branching events during vegetative and reproductive development appear to be regulated by the creation of auxin response maxima through the activity of polar auxin transporters. We also found that the auxin transporter ZmPIN1a is functional, as it can rescue the polar auxin transport defects of the Arabidopsis (Arabidopsis thaliana) pin1-3 mutant. Based on this and on the groundbreaking analysis in Arabidopsis and other species, we conclude that branching mechanisms are conserved and can, in addition, explain the formation of axillary meristems (spikelet-pair and spikelet meristems) that are unique to grasses. We also found that BARREN STALK1 is required for the creation of auxin response maxima at the flanks of the inflorescence meristem, suggesting a role in the initiation of polar auxin transport for axillary meristem formation. Based on our results, we propose a general model for branching during maize inflorescence development.

  14. Risk Bounds for Regularized Least-Squares Algorithm with Operator-Value Kernels

    Science.gov (United States)

    2005-05-16

    for regularized least-squares algorithm with operator-valued kernels Ernesto De Vito a Andrea Caponnetto b aDipartimento di Matematica , Università...0915, National Science Foundation (ITR/SYS) Contract No. IIS - 0112991, National Science Foundation (ITR) Contract No. IIS -0209289, National Science

  15. STUDY OF BOUNDING BOX LOCALISATION ALGORITHM BASED ON WIRELESS SENSOR DISCRETE NETWORK MODEL%基于无线传感器离散网络模型的 Bounding Box定位算法研究

    Institute of Scientific and Technical Information of China (English)

    曾振东

    2013-01-01

    Bounding Box algorithm is a typical node localisation algorithm based on discrete network model in wireless sensor network (WSN).To overcome its disadvantages in low localisation accuracy and coverage rate , we propose an improved localisation algorithm which employs the virtual anchor nodes strategy .First, the unknown nodes will calculate their own coordinates by making use of the anchor nodes within their communication range .Secondly , the located unknown nodes will upgrade themselves as the virtual anchor nodes according to the promotion strategy selectively .Finally, those nodes which are unable to locate themselves will use the virtual anchor nodes to get their own location.Besides, the establishment of the network node model with double radius based on discrete network model further restrict the location of the unknown nodes .Theoretical analysis and simulation result all show that the proposed algorithm can effectively improve the localisation accuracy while significantly raise the coverage rate of localisation .%Bounding Box算法是一种典型的基于离散网络模型的无线传感器网络节点定位算法。针对Bounding Box算法定位误差大、覆盖率低的缺点,提出一种采用虚拟锚节点策略的改进定位算法。首先未知节点利用其通信范围内的锚节点进行定位;其次,已定位的节点根据升级策略有选择性的升级为虚拟锚节点;最后,无法定位的节点利用虚拟锚节点实现定位。另外,在离散网络模型的基础上,通过建立双半径网络节点模型从而进一步约束了未知节点的位置。理论分析及仿真结果均表明,该算法在显著提高定位覆盖率的同时,有效地提高了定位精度。

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

    DEFF Research Database (Denmark)

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

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

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

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

  19. D and Ds Hadronic Branching Fractions at B Factories

    Energy Technology Data Exchange (ETDEWEB)

    Pappagallo, Marco; /Bari U. /INFN, Bari

    2008-01-07

    Recent measurements of hadronic branching fractions of D and D{sub s} mesons, performed by the BABAR and Belle experiments at the asymmetric e{sup +}e{sup -} B factories colliders PEP II and KEKB, are reviewed.

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

    CERN Document Server

    Geloun, Joseph Ben

    2013-01-01

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

  1. ALUMINUM STIMULATES UPTAKE OF NON-TRANSFERRIN BOUND IRON AND TRANSFERRIN BOUND IRON IN HUMAN GLIAL CELLS

    OpenAIRE

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

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

  2. Antibiotics and renal branching morphogenesis: comparison of toxicities

    NARCIS (Netherlands)

    Bueters, R.R.G.; Kusters, L.J.; Klaasen, A.; Heuvel, L.P.W.J. van den; Schreuder, M.F.

    2014-01-01

    BACKGROUND: Many premature born neonates receive antibiotic drugs to treat infections, which are applied during active nephrogenesis. We studied the impact of clinical concentrations of gentamicin and alternatives, ceftazidime and meropenem, on ureteric branching. METHODS: Mice metanephroi were diss

  3. Inventory and Monitoring Plan Big Branch Marsh National Wildlife Refuge

    Data.gov (United States)

    US Fish and Wildlife Service, Department of the Interior — The Big Branch Marsh IMP was developed according to the Inventory and Monitoring (I 1) is an operational plan for one or more refuges that clearly states I 2)...

  4. Hierarchical Ring Network Design Using Branch-and-Price

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2005-01-01

    We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed l...... for jointly solving the clustering problem, the metro ring design problem and the routing problem. Computational results are given for networks with up to 36 nodes.......We consider the problem of designing hierarchical two layer ring networks. The top layer consists of a federal-ring which establishes connection between a number of node disjoint metro-rings in a bottom layer. The objective is to minimize the costs of links in the network, taking both the fixed...... link establishment costs and the link capacity costs into account. Hierarchical ring network design problems combines the following optimization problems: Clustering, hub selection, metro ring design, federal ring design and routing problems. In this paper a branch-and-price algorithm is presented...

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

  6. Scaling limits of Markov-Branching trees and applications

    OpenAIRE

    Haas, Bénédicte

    2016-01-01

    The goal of these lectures is to survey some of the recent progress on the description of large-scale structure of random trees. We use the framework of Markov-Branching sequences of trees and discuss several applications.

  7. Software Management Environment (SME): Components and algorithms

    Science.gov (United States)

    Hendrick, Robert; Kistler, David; Valett, Jon

    1994-01-01

    This document presents the components and algorithms of the Software Management Environment (SME), a management tool developed for the Software Engineering Branch (Code 552) of the Flight Dynamics Division (FDD) of the Goddard Space Flight Center (GSFC). The SME provides an integrated set of visually oriented experienced-based tools that can assist software development managers in managing and planning software development projects. This document describes and illustrates the analysis functions that underlie the SME's project monitoring, estimation, and planning tools. 'SME Components and Algorithms' is a companion reference to 'SME Concepts and Architecture' and 'Software Engineering Laboratory (SEL) Relationships, Models, and Management Rules.'

  8. Parallel ant colony algorithm and its application in the capacitated lot sizing problem for an agile supply chain

    Institute of Scientific and Technical Information of China (English)

    李树刚; 吴智铭; 庞小红

    2004-01-01

    In order to study the capacitated lot sizing problem for a supply chain of corporate multi-location fac-tories to minimize the total costs of production, inventory and transportation under the system capacity restriction and product due date, while at the same time considering the menu distributed balance, the mathematical pro-gramming models are decomposed and reduced from the 3 levels into 2 levels according to the idea of just-in-time production. In order to overcome the premature convergence of ACA (ant colony algorithms) , the idea of mute operation is adopted in genetic algorithms and a PACA (parallel ant colony algorithms) is proposed forsupply chain optimization. Finally, an illustrative example is given, and a comparison is made with standard BAR ( Branch and Bound) and PACA approach. The result shows that the latter is more effective and promis-ing.

  9. Coset construction of logarithmic minimal models: branching rules and branching functions

    CERN Document Server

    Pearce, Paul A

    2013-01-01

    Working in the Virasoro picture, it is argued that the logarithmic minimal models LM(p,p')=LM(p,p';1) can be extended to an infinite hierarchy of logarithmic conformal field theories LM(p,p';n) at higher fusion levels n=1,2,3,.... From the lattice, these theories are constructed by fusing together n x n elementary faces of the appropriate LM(p,p') models. It is further argued that all of these logarithmic theories are realized as diagonal cosets (A_1^{(1)})_k \\oplus (A_1^{(1)})_n / (A_1^{(1)})_{k+n} where n is the integer fusion level and k=np/(p'-p)-2 is a fractional level. These cosets mirror the cosets of the higher fusion level minimal models of the form M(m,m';n), but are associated with certain reducible representations. We present explicit branching rules for characters in the form of multiplication formulas arising in the logarithmic limit of the usual Goddard-Kent-Olive coset construction of the non-unitary minimal models M(m,m';n). The limiting branching functions play the role of Kac characters for...

  10. F-Theory, Spinning Black Holes and Multi-string Branches

    CERN Document Server

    Haghighat, Babak; Vafa, Cumrun; Vandoren, Stefan

    2015-01-01

    We study 5d supersymmetric black holes which descend from strings of generic $\\mathcal{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 l...

  11. Decoherence and the Branching of Chaos-less Classical Trajectory

    CERN Document Server

    Ishikawa, Takuji

    2016-01-01

    This study was started to know mysterious classicality of nuclei. This time, I found a new rule for decoherence. I used a model without chaos. As a result, it was shown that not only the intersection of classical trajectories but also branching of classical trajectories are needed for decoherence. In other words, it was shown that interactions between a main system and environments have to make enough branchings of classical trajectories of the main system for decoherence.

  12. Routing Flow-Shop with Buffers and Ready Times – Comparison of Selected Solution Algorithms

    Directory of Open Access Journals (Sweden)

    Józefczyk Jerzy

    2014-12-01

    Full Text Available This article extends the former results concerning the routing flow-shop problem to minimize the makespan on the case with buffers, non-zero ready times and different speeds of machines. The corresponding combinatorial optimization problem is formulated. The exact as well as four heuristic solution algorithms are presented. The branch and bound approach is applied for the former one. The heuristic algorithms employ known constructive idea proposed for the former version of the problem as well as the Tabu Search metaheuristics. Moreover, the improvement procedure is proposed to enhance the quality of both heuristic algorithms. The conducted simulation experiments allow evaluating all algorithms. Firstly, the heuristic algorithms are compared with the exact one for small instances of the problem in terms of the criterion and execution times. Then, for larger instances, the heuristic algorithms are mutually compared. The case study regarding the maintenance of software products, given in the final part of the paper, illustrates the possibility to apply the results for real-world manufacturing systems.

  13. Real weights, bound states and duality orbits

    CERN Document Server

    Marrani, Alessio; Romano, Luca

    2015-01-01

    We show that the duality orbits of extremal black holes in supergravity theories with symmetric scalar manifolds can be derived by studying the stabilizing subalgebras of suitable representatives, realized as bound states of specific weight vectors of the corresponding representation of the duality symmetry group. The weight vectors always correspond to weights that are real, where the reality properties are derived from the Tits-Satake diagram that identifies the real form of the Lie algebra of the duality symmetry group. Both N=2 magic Maxwell-Einstein supergravities and the semisimple infinite sequences of N=2 and N=4 theories in D=4 and 5 are considered, and various results, obtained over the years in the literature using different methods, are retrieved. In particular, we show that the stratification of the orbits of these theories occurs because of very specific properties of the representations: in the case of the theory based on the real numbers, whose symmetry group is maximally non-compact and there...

  14. Output-Feedback Adaptive SP-SD-Type Control with an Extended Continuous Adaptation Algorithm for the Global Regulation of Robot Manipulators with Bounded Inputs

    Directory of Open Access Journals (Sweden)

    Daniela J. López-Araujo

    2013-01-01

    Full Text Available In this work, an output‐feedback adaptive SP‐SD‐type control scheme for the global position stabilization of robot manipulators with bounded inputs is proposed. Compared with the output‐feedback adaptive approaches previously developed in a bounded‐ input context, the proposed velocity‐free feedback controller guarantees the adaptive regulation objective globally (i.e. for any initial condition, avoiding discontinuities throughout the scheme, preventing the inputs from reaching their natural saturation bounds and imposing no saturation-avoidance restrictions on the choice of the P and D control gains. Moreover, through its extended structure, the adaptation algorithm may be configured to evolve either in parallel (independently or interconnected to the velocity estimation (motion dissipation auxiliary dynamics, giving an additional degree of design flexibility. Furthermore, the proposed scheme is not restricted to the use of a specific saturation function to achieve the required boundedness, but may involve any one within a set of smooth and non‐smooth (Lipschitz‐continuous bounded passive functions that include the hyperbolic tangent and the conventional saturation as particular cases. Experimental results on a 3‐ degree‐of‐freedom manipulator corroborate the efficiency of the proposed scheme.

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

    Energy Technology Data Exchange (ETDEWEB)

    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.

  16. Black hole bombs and photon mass bounds

    CERN Document Server

    Pani, Paolo; Gualtieri, Leonardo; Berti, Emanuele; Ishibashi, Akihiro

    2012-01-01

    Generic extensions of the standard model predict the existence of ultralight bosonic degrees of freedom. Several ongoing experiments are aimed at detecting these particles or constraining their mass range. Here we show that massive vector fields around rotating black holes can give rise to a strong superradiant instability which extracts angular momentum from the hole. The observation of supermassive spinning black holes imposes limits on this mechanism. We show that current supermassive black hole spin estimates provide the tightest upper limits on the mass of the photon (mv<4x10^{-20} eV according to our most conservative estimate), and that spin measurements for the largest known supermassive black holes could further lower this bound to mv<10^{-22} eV. Our analysis relies on a novel framework to study perturbations of rotating Kerr black holes in the slow-rotation regime, that we developed up to second order in rotation, and that can be extended to other spacetime metrics and other theories.

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

    DEFF Research Database (Denmark)

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

    2008-01-01

    the physics, and the cuts (Combinatorial Benders’ and projected Chvátal–Gomory) come from an understanding of the particular mathematical structure of the reformulation. The impact of a stronger representation is investigated on several truss topology optimization problems in two and three dimensions....... to a mixed-integer linear program, which is solved with a parallel implementation of branch-and-bound. Additional valid inequalities and cuts are introduced to give a stronger representation of the problem, which improves convergence and speed up of the parallel method. The valid inequalities represent...

  18. Tensor Squeezed Limits and the Higuchi Bound

    CERN Document Server

    Bordin, Lorenzo; Mirbabayi, Mehrdad; Noreña, Jorge

    2016-01-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 con- sistency 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...

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

  20. Composition and Structural Features of Calcium—Bound and Iron—and Aluminium—Bound Humus in Soils

    Institute of Scientific and Technical Information of China (English)

    S.U.CHEEMA; XUJIAN-MIN; 等

    1994-01-01

    Calcium-bound and iron-and aluminium-bound humus extracted from different soils collected from north to south of China were characterized by chemical and spectroscopic methods.Meaningful differences in the composition and structure between them were revealed by 13 C NMR,visible spectroscopy and elemental analysis.Results showed that the contents of carbon,hydrogen and nitrogen were higher in iron-and aluminium-bound humus than in calcium-bound humus while oxygen content in calcium-bound humus was shown to be higher .The calcium-bound humus had higher C/N and O/C ratios than iron-and aluminiumbound humus.The calcium-bound humic acid(HA1) showed higher E4/E6 ratios than iron-and aluminumboud,humic acid(HA2)while iron-and aluminum-bound fulvic acid(FA2) showed higher E4/E6 ratios than calcium-bound fulvic acid(FA1).An inverse relationship between E4/E6 ratios and aromaticity as determined by 13C NMR spectra was observerd for HA and FA from black soil.The 13C NMR spectroscopy revealed that HA2 was more aromatic than HA1.On the other ,FA1 exhibited a higher aromaticity than FA2.

  1. Hybrid Steepest-Descent Methods for Solving Variational Inequalities Governed by Boundedly Lipschitzian and Strongly Monotone Operators

    OpenAIRE

    He Songnian; Liang Xiao-Lan

    2010-01-01

    Let be a real Hilbert space and let be a boundedly Lipschitzian and strongly monotone operator. We design three hybrid steepest descent algorithms for solving variational inequality of finding a point such that , for all , where is the set of fixed points of a strict pseudocontraction, or the set of common fixed points of finite strict pseudocontractions. Strong convergence of the algorithms is proved.

  2. An exact algorithm for graph partitioning

    CERN Document Server

    Hager, William; Zhang, Hongchao

    2009-01-01

    An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained by decomposing the objective function into convex and concave parts and replacing the concave part by an affine underestimate. It is shown that the best affine underestimate can be expressed in terms of the center and the radius of the smallest sphere containing the feasible set. The concave term is obtained either by a constant diagonal shift associated with the smallest eigenvalue of the objective function Hessian, or by a diagonal shift obtained by solving a semidefinite programming problem. Numerical results show that the proposed algorithm is competitive with state-of-the-art graph partitioning codes.

  3. Design and Performance Evaluation of Sequence Partition Algorithms

    Institute of Scientific and Technical Information of China (English)

    Bing Yang; Jing Chen; En-Yue Lu; Si-Qing Zheng

    2008-01-01

    Tradeoffs between time complexities and solution optimalities are important when selecting algorithms for an NP-hard problem in different applications. Also, the distinction between theoretical upper bound and actual solution optimality for realistic instances of an NP-hard problem is a factor in selecting algorithms in practice. We consider the problem of partitioning a sequence of n distinct numbers into minimum number of monotone (increasing or decreasing) case. We introduce a new algorithm, the modified version of the Yehuda-Fogel algorithm, that computes a solution of no on three algorithms, a known approximation algorithm of approximation ratio 1.71 and time complexity O(n3), a known greedy algorithm of time complexity O(n1.5 log n), and our new modified Yehuda-Fogel algorithm. Our results show that the solutions computed by the greedy algorithm and the modified Yehuda-Fogel algorithm are close to that computed by the approximation algorithm even though the theoretical worst-case error bounds of these two algorithms are not proved to be within a constant time of the optimal solution. Our study indicates that for practical use the greedy algorithm and the modified Yehuda-Fogel algorithm can be good choices if the running time is a major concern.

  4. Classical and quantum partition bound and detector inefficiency

    CERN Document Server

    Laplante, S; Roland, J

    2012-01-01

    In communication complexity, two players each have an input and they wish to compute some function of the joint inputs. This has been the object of much study and a wide variety of lower bound methods have been introduced to address the problem of showing lower bounds on communication. Recently, Jain and Klauck introduced the partition bound, which subsumes many of the known methods, in particular factorization norm, discrepancy, and the rectangle (corruption) bound. Physicists have considered a closely related scenario where two players share a predefined entangled state. Each is given a measurement as input, which they perform on their share of the system. The outcomes of the measurements follow a distribution which is predicted by quantum mechanics. In an experimental setting, Bell inequalities are used to distinguish truly quantum from classical behavior. We present a new lower bound technique based on the notion of detector inefficiency (where some runs are discarded by either of the players) for the ext...

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

  6. Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width

    OpenAIRE

    Meister, Daniel; Rotics, Udi

    2013-01-01

    In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show that (almost all of) these graphs are minimal in the class of all graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs for graphs of bounded clique-width and for graphs of bounded linear clique-width for arbitrary bounds.

  7. Stability of earthquake clustering models: criticality and branching ratios.

    Science.gov (United States)

    Zhuang, Jiancang; Werner, Maximilian J; Harte, David S

    2013-12-01

    We study the stability conditions of a class of branching processes prominent in the analysis and modeling of seismicity. This class includes the epidemic-type aftershock sequence (ETAS) model as a special case, but more generally comprises models in which the magnitude distribution of direct offspring depends on the magnitude of the progenitor, such as the branching aftershock sequence (BASS) model and another recently proposed branching model based on a dynamic scaling hypothesis. These stability conditions are closely related to the concepts of the criticality parameter and the branching ratio. The criticality parameter summarizes the asymptotic behavior of the population after sufficiently many generations, determined by the maximum eigenvalue of the transition equations. The branching ratio is defined by the proportion of triggered events in all the events. Based on the results for the generalized case, we show that the branching ratio of the ETAS model is identical to its criticality parameter because its magnitude density is separable from the full intensity. More generally, however, these two values differ and thus place separate conditions on model stability. As an illustration of the difference and of the importance of the stability conditions, we employ a version of the BASS model, reformulated to ensure the possibility of stationarity. In addition, we analyze the magnitude distributions of successive generations of the BASS model via analytical and numerical methods, and find that the compound density differs substantially from a Gutenberg-Richter distribution, unless the process is essentially subcritical (branching ratio less than 1) or the magnitude dependence between the parent event and the direct offspring is weak.

  8. Stability of earthquake clustering models: Criticality and branching ratios

    Science.gov (United States)

    Zhuang, Jiancang; Werner, Maximilian J.; Harte, David S.

    2013-12-01

    We study the stability conditions of a class of branching processes prominent in the analysis and modeling of seismicity. This class includes the epidemic-type aftershock sequence (ETAS) model as a special case, but more generally comprises models in which the magnitude distribution of direct offspring depends on the magnitude of the progenitor, such as the branching aftershock sequence (BASS) model and another recently proposed branching model based on a dynamic scaling hypothesis. These stability conditions are closely related to the concepts of the criticality parameter and the branching ratio. The criticality parameter summarizes the asymptotic behavior of the population after sufficiently many generations, determined by the maximum eigenvalue of the transition equations. The branching ratio is defined by the proportion of triggered events in all the events. Based on the results for the generalized case, we show that the branching ratio of the ETAS model is identical to its criticality parameter because its magnitude density is separable from the full intensity. More generally, however, these two values differ and thus place separate conditions on model stability. As an illustration of the difference and of the importance of the stability conditions, we employ a version of the BASS model, reformulated to ensure the possibility of stationarity. In addition, we analyze the magnitude distributions of successive generations of the BASS model via analytical and numerical methods, and find that the compound density differs substantially from a Gutenberg-Richter distribution, unless the process is essentially subcritical (branching ratio less than 1) or the magnitude dependence between the parent event and the direct offspring is weak.

  9. Free compact boson on branched covering of $\\mathbb{CP}^1$ and on branched covering of the torus

    CERN Document Server

    Liu, Feihu

    2016-01-01

    We have studied free compact boson on two special kinds of Riemann surfaces: One is branched covering of $\\mathbb{CP}^1$, and the other one is branched covering of the torus. We obtain the partition function for arbitrary higher genus by directly constructing the period matrix, which can be expressed in terms of simple contour integrals. The partition function is interesting because it is related to the \\emph{product} of correlation functions of twist fields in different sectors. Also, when the branched cuts are chosen to be real, it is related to the R\\'enyi entanglement entropy of multiple intervals in a infinite (finite) system at zero (finite) temperature.

  10. Two-Sided Tests and One-Sided Confidence Bounds

    OpenAIRE

    1994-01-01

    Based on the duality between tests and confidence sets we introduce a new method to derive one-sided confidence bounds following the rejection of a null hypothesis with two-sided alternatives. This method imputes that the experimenter is only interested in confidence bounds if the null hypothesis is rejected. Furthermore, we suppose that he is only interested in the direction and a lower confidence bound concerning the distance of the true parameter value to the parameter values in the null h...

  11. ELEMENTARY DENSITY BOUNDS FOR SELF-SIMILAR SETS AND APPLICATION

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Falconer[1] used the relationship between upper convex density and upper spherical density to obtain elementary density bounds for s-sets at HS-almost all points of the sets. In this paper, following Falconer[1], we first provide a basic method to estimate the lower bounds of these two classes of set densities for the self-similar s-sets satisfying the open set condition (OSC), and then obtain elementary density bounds for such fractals at all of their points. In addition, we apply the main results to the famous classical fractals and get some new density bounds.

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

  13. FY 1991 Measurements and Characterization Branch annual report

    Energy Technology Data Exchange (ETDEWEB)

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

    1992-11-01

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

  14. FY 1991 Measurements and Characterization Branch annual report

    Energy Technology Data Exchange (ETDEWEB)

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

    1992-11-01

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

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

  16. Low congestion online routing and an improved mistake bound for online prediction of graph labeling

    CERN Document Server

    Fakcharoenphol, Jittat

    2008-01-01

    In this paper, we show a connection between a certain online low-congestion routing problem and an online prediction of graph labeling. More specifically, we prove that if there exists a routing scheme that guarantees a congestion of $\\alpha$ on any edge, there exists an online prediction algorithm with mistake bound $\\alpha$ times the cut size, which is the size of the cut induced by the label partitioning of graph vertices. With previous known bound of $O(\\log n)$ for $\\alpha$ for the routing problem on trees with $n$ vertices, we obtain an improved prediction algorithm for graphs with high effective resistance. In contrast to previous approaches that move the graph problem into problems in vector space using graph Laplacian and rely on the analysis of the perceptron algorithm, our proof are purely combinatorial. Further more, our approach directly generalizes to the case where labels are not binary.

  17. Asynchronous Bounded Expected Delay Networks

    CERN Document Server

    Bakhshi, Rena; Fokkink, Wan; Pang, Jun

    2010-01-01

    The commonly used asynchronous bounded delay (ABD) network models assume a fixed bound on message delay. We propose a probabilistic network model, called asynchronous bounded expected delay (ABE) model. Instead of a strict bound, the ABE model requires only a bound on the expected message delay. While the conditions of ABD networks restrict the set of possible executions, in ABE networks all asynchronous executions are possible, but executions with extremely long delays are less probable. In contrast to ABD networks, ABE networks cannot be synchronised efficiently. At the example of an election algorithm, we show that the minimal assumptions of ABE networks are sufficient for the development of efficient algorithms. For anonymous, unidirectional ABE rings of known size N we devise a probabilistic leader election algorithm having average message and time complexity O(N).

  18. Computing Constrained Cramer Rao Bounds

    CERN Document Server

    Tune, Paul

    2012-01-01

    We revisit the problem of computing submatrices of the Cram\\'er-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter $\\vth$. We explore iterative methods that avoid direct inversion of the Fisher information matrix, which can be computationally expensive when the dimension of $\\vth$ is large. The computation of the bound is related to the quadratic matrix program, where there are highly efficient methods for solving it. We present several methods, and show that algorithms in prior work are special instances of existing optimization algorithms. Some of these methods converge to the bound monotonically, but in particular, algorithms converging non-monotonically are much faster. We then extend the work to encompass the computation of the CRB when the Fisher information matrix is singular and when the parameter $\\vth$ is subject to constraints. As an application, we consider the design of a data streaming algorithm for network measurement.

  19. Flow-induced pruning of branched systems and brittle reconfiguration

    CERN Document Server

    Lopez, Diego; de Langre, Emmanuel

    2011-01-01

    Whereas most plants are flexible structures that undergo large deformations under flow, another process can occur when the plant is broken by heavy fluid-loading. We investigate here the mechanism of such possible breakage, focusing on the flow-induced pruning that can be observed in plants or aquatic vegetation when parts of the structure break under flow. By computation on an actual tree geometry, a 20-yr-old walnut tree (Juglans Regia L.) and comparison with simple models, we analyze the influence of geometrical and physical parameters on the occurrence of branch breakage and on the successive breaking events occurring in a tree-like structure when the flow velocity is increased. We show that both the branching pattern and the slenderness exponent, defining the branch taper, play a major role in the breakage scenario. We identify a criterion for branch breakage to occur before breakage of the trunk. In that case, we show that the successive breakage of peripheral branches allows the plant to sustain higher...

  20. New exact algorithms for the vehicle routing problem

    Energy Technology Data Exchange (ETDEWEB)

    Mingozzi, A.; Galdacci, R.; Christofides, N.; Hadjiconstantinou, E.

    1994-12-31

    We consider the problem in which a fleet of M vehicles stationed at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. This problem is referred as the Vehicle Routing Problem (VRP). In this paper we present two exact branch and bound algorithms for solving the VRP based on a Set Partitioning formulation of the problem. The first algorithm is based on a bounding procedure that finds a heuristic solution of the dual of the LP-relaxation of the Set Partitioning formulation without generating the entire set partitioning matrix. The dual solution obtained is then used to limit the set of the feasible routes containing the optimal VRP solution. The resulting Set Partitioning problem is solved by using a branch and bound method. The second algorithm is based on a lower bound that makes use of a new surrogate relaxation of the Set Partitioning problem. The two algorithms can solve both symmetric and asymmetric VRPS. Computational results are presented for a number of problems derived from the literature.

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

  2. PLA branching with anhydrides and tri-functional aziridine

    Science.gov (United States)

    Gu, Liangliang; Xu, Yuewen; Naredla, Rajasekhar; Hoye, Thomas; Macosko, Christopher

    Branched PLA was prepared by melt blending with tri-functional aziridine (T-Az) and pyromellitic dianhydride (PMDA). 1HNMR, gel permeation chromatography (GPC) and rheology were used to characterize the topological structures of branched PLA. Fast reaction between PLA carboxyl end group and T-Az resulted in 3-arm stars and increased the molecular weight. However, the 3-arm stars did not show strain hardening behavior under extensional flow. After modifying PLA hydroxyl end group with PMDA, PLA can react with T-Az on both chain ends and form long chain branched structure, which showed strain hardening in extension. It was found that that only 10% of the PLA hydroxyl end groups reacted with PMDA. This work is supported by Center for Sustainable Polymers.

  3. Experiments on propagating and branching positive streamers in air

    CERN Document Server

    Briels, T M P; Ebert, Ute

    2008-01-01

    This proceedings paper from 2004 contains figures of discharges in different gap lengths at the same potential that are not available elsewhere. The 2004 abstract: The evolution of streamers is known to depend on gas composition and electrode geometry, on polarity and size of the voltage and also on the electric circuit that produces the high voltage pulse. To characterize the phenomena better and to compare with theory, a new larger experimental setup with vacuum enclosure has been built. We here present first results in this setup on positive streamers in air at fixed voltage and varying electrode distance. While next to the emitting anode tip, a similar number of streamers seems to emerge due to multiple branching, more streamers seem to survive over a fixed distance, when the gap is shorter. When lowering the voltage, streamers branch less at all distances from the anode tip or do not branch at all beyond a certain distance.

  4. Algorithm for quantifying advanced carotid artery atherosclerosis in humans using MRI and active contours

    Science.gov (United States)

    Adams, Gareth; Vick, G. W., III; Bordelon, Cassius; Insull, William; Morrisett, Joel

    2002-05-01

    A new algorithm for measuring carotid artery volumes and estimating atherosclerotic plaque volumes from MRI images has been developed and validated using pressure-perfusion-fixed cadaveric carotid arteries. Our method uses an active contour algorithm with the generalized gradient vector field force as the external force to localize the boundaries of the artery on each MRI cross-section. Plaque volume is estimated by an automated algorithm based on estimating the normal wall thickness for each branch of the carotid. Triplicate volume measurements were performed by a single observer on thirty-eight pairs of cadaveric carotid arteries. The coefficient of variance (COV) was used to quantify measurement reproducibility. Aggregate volumes were computed for nine contiguous slices bounding the carotid bifurcation. The median (mean +/- SD) COV for the 76 aggregate arterial volumes was 0.93% (1.47% +/- 1.52%) for the lumen volume, 0.95% (1.06% +/- 0.67%) for the total artery volume, and 4.69% (5.39% +/- 3.97%) for the plaque volume. These results indicate that our algorithm provides repeatable measures of arterial volumes and a repeatable estimate of plaque volume of cadaveric carotid specimens through analysis of MRI images. The algorithm also significantly decreases the amount of time necessary to generate these measurements.

  5. Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems

    CERN Document Server

    Jowhari, Hossein; Tardos, Gábor

    2010-01-01

    In this paper, we present near-optimal space bounds for Lp-samplers. Given a stream of updates (additions and subtraction) to the coordinates of an underlying vector x \\in R^n, a perfect Lp sampler outputs the i-th coordinate with probability |x_i|^p/||x||_p^p. In SODA 2010, Monemizadeh and Woodruff showed polylog space upper bounds for approximate Lp-samplers and demonstrated various applications of them. Very recently, Andoni, Krauthgamer and Onak improved the upper bounds and gave a O(\\epsilon^{-p} log^3 n) space \\epsilon relative error and constant failure rate Lp-sampler for p \\in [1,2]. In this work, we give another such algorithm requiring only O(\\epsilon^{-p} log^2 n) space for p \\in (1,2). For p \\in (0,1), our space bound is O(\\epsilon^{-1} log^2 n), while for the $p=1$ case we have an O(log(1/\\epsilon)\\epsilon^{-1} log^2 n) space algorithm. We also give a O(log^2 n) bits zero relative error L0-sampler, improving the O(log^3 n) bits algorithm due to Frahling, Indyk and Sohler. As an application of ou...

  6. Topology of Branched Polymers: Effect on Structure and Dynamic Properties

    Science.gov (United States)

    Ramachandran, Ramnath; Beaucage, Gregory; Kulkarni, Amit S.; Galiatsatos, Vassilios; McFaddin, Douglas C.

    2008-03-01

    We investigated linear and branched polyethylene (PE) using small-angle neutron scattering (SANS). The experiments were conducted on dilute solutions of PE in deuterated p-xylene. A variety of structural information^ such as fractal dimension (df), connectivity dimension (c), minimum path dimension (dmin), long chain branch fraction (φbr), radius of gyration (Rg) and persistence length (lp) were obtained. Such information presents a qualitative and quantitative assessment of branching in polymers. Theoretical models such as `binary contacts per pervaded volume' model^* were employed to correlate the structural information of the polymer to its entanglement molecular weight (Me). Me was used to predict physical properties of the polymer such as plateau modulus (GN^0 ) and zero-shear viscosity (η0). ^Beaucage G. Physical Review E 70,031401 (2004) ^*Colby et al. Macromolecules 25, p.996 (1992)

  7. Decay parameter and related properties of 2-type branching processes

    Institute of Scientific and Technical Information of China (English)

    LI JunPing

    2009-01-01

    We consider the decay parameter, invariant measures/vectors and quasi-stationary dis-tributions for 2-type Markov branching processes. Investigating such properties is crucial in realizing life period of branching models. In this paper, some important properties of the generating functions for 2-type Markov branching q-matrix are firstly investigated in detail. The exact value of the decay parameter λC of such model is given for the communicating class C = Z+2\\ 0. It is shown that this λC can be directly obtained from the generating functions of the corresponding q-matrix. Moreover, the λC-invariant measures/vectors and quasi-distributions of such processes are deeply considered. A λC-invariant vector for the q-matrix (or for the process) on C is given and the generating functions of λC-invariant measures and quasi-stationary distributions for the process on C are presented.

  8. Decay parameter and related properties of 2-type branching processes

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    We consider the decay parameter, invariant measures/vectors and quasi-stationary dis- tributions for 2-type Markov branching processes. Investigating such properties is crucial in realizing life period of branching models. In this paper, some important properties of the generating functions for 2-type Markov branching q-matrix are firstly investigated in detail. The exact value of the decay parameter λC of such model is given for the communicating class C = Z+2 \\ 0. It is shown that this λC can be directly obtained from the generating functions of the corresponding q-matrix. Moreover, the λC-invariant measures/vectors and quasi-distributions of such processes are deeply considered. A λC-invariant vector for the q-matrix (or for the process) on C is given and the generating functions of λC-invariant measures and quasi-stationary distributions for the process on C are presented.

  9. CONTROLLED ANIONIC SYNTHESIS OF FUNCTIONALIZED AND STAR-BRANCHED POLYMERS

    Institute of Scientific and Technical Information of China (English)

    RODERIC P. QUIRK; YIN Jian; GUO Shaohua; HU Xiaowei; GABRIEL SUMMERS; KIM Jungahn; ZHU Linfang; LAUREL E. SCHOCK

    1990-01-01

    The use of living, alkyllithium-initiated anionic polymerization to prepare chain-end functionalized polymers and heteroarm, star- branched polymers is discussed. The scope and limitations of specific termination reactions with a variety of electrophilic species are illustrated for carbonation, hydroxyethylation,amination, and sulfonation. The methodology of using substituted 1,1- diphenylethylenes to provide a general, quantitative functionalization procedure is outlined and illustrated with examples of amine and phenol end-functionalization. A methodology is described for the synthesis of functionalized,star-branched copolymers with compositionally heterogeneous arms of controlled molecular weight and narrow molecular weight distribution using 1, 3-bis (1-phenylethenyl) benzene.

  10. Bounds on Transverse Momentum Dependent Distribution and Fragmentation Functions

    Science.gov (United States)

    Bacchetta, A.; Boglione, M.; Henneman, A.; Mulders, P. J.

    2000-07-01

    We give bounds on the distribution and fragmentation functions that appear at leading order in deep inelastic one-particle inclusive leptoproduction or in Drell-Yan processes. These bounds simply follow from positivity of the defining matrix elements and are an important guidance in estimating the magnitude of the azimuthal and spin asymmetries in these processes.

  11. Bounds on transverse momentum dependent distribution and fragmentation functions

    CERN Document Server

    Bacchetta, A; Henneman, A A; Mulders, P J

    2000-01-01

    We give bounds on the distribution and fragmentation functions that appear at leading order in deep inelastic 1-particle inclusive leptoproduction or in Drell-Yan processes. These bounds simply follow from positivity of the defining matrix elements and are an important guidance in estimating the magnitude of the azimuthal and spin asymmetries in these processes.

  12. An Efficient Parallel Graph Edge Matching Algorithm and Its Applications

    Institute of Scientific and Technical Information of China (English)

    MA Jun; MA Shaohan

    1999-01-01

    A fast and efficient parallel algorithm for finding a maximal edge matching in an undirected graph G(V,E) is proposed. It runs inO (log n) time with O (m/log n+n) processors on an EREW PRAM for aclass of graph set Π, where n=|V|,m=|E| and Π includesat least (i) planar graphs;(ii) graphs of bounded genus; and (iii)graphs of bounded maximum degree and so on. Our algorithm improves thepreviously known best algorithms by a factor of logn in the timecomplexity with linear number of processors on EREW PRAMs when the inputis limited to Π.

  13. Implementation of Bounding Surface Model into ABAQUS and Its Application to Wellbore Stability Analysis

    Science.gov (United States)

    Chen, S.; Al-Muntasheri, G.; Abousleiman, Y. N.

    2014-12-01

    The critical state concept based bounding surface model is one of the most widely used elastoplastic constitutive models for geomaterials, attributed mainly to its essential feature of allowing plastic deformation to occur for stress points within the bounding surface and thus the capability to represent the realistic non-recoverable behaviour of soils and rocks observed under the cyclic loading. This paper develops an implicit integration algorithm for the bounding surface model, using the standard return mapping approach (elastic predictor-plastic corrector), to obtain the updated stresses for the given strain increments. The formulation of the constitutive integration requires the derivation of a supplementary differential equation to describe the evolution of a key variable, i.e., the ratio between the image stress and the current stress quantities. It is essentially an extension of the integration scheme presented in an earlier work used for the simple bounding surface version of modified Cam Clay associated with a substantially simplified hardening rule. The integration algorithm for the bounding surface model is implemented into the finite element analysis commercial program, ABAQUS, through the material interface of UMAT (user defined material subroutine), and then used for the analysis of wellbore stability problem. The predictions from the ABAQUS simulations are generally in excellent agreement with the available analytical solutions, thus demonstrating the accuracy and robustness of the proposed integration scheme.

  14. Partial branching enzyme treatment increases the low glycaemic property and α-1,6 branching ratio of maize starch.

    Science.gov (United States)

    Li, Xingfeng; Miao, Ming; Jiang, Huan; Xue, Jiangchao; Jiang, Bo; Zhang, Tao; Gao, Yaqi; Jia, Yingmin

    2014-12-01

    Partial branching enzyme treatment was used to modulate the starch fine chain structure responsible for a high content of slowly digestible starch fraction. Normal maize starch modified using branching enzyme for 4h showed a maximum slowly digestible starch content of 23.90%. The branching enzyme hydrolysis decreased the amylose content from 32.8% to 12.8%. The molecular weight distribution of enzyme-treated starches showed a larger proportion of low molecular weight fractions appeared in the enzyme treated starch sample compare to native starch. The number of shorter chains (DP30) from 20.11% to 11.95%. (1)H NMR spectra showed an increase of α-1,6 branching ratio from 4.7% to 9.4% during enzyme treatment. The increase in the amount of shorter chains and more α-1,6 linkages likely contribute to their slow digestion property. These results suggest that starches treated with partial branching enzyme synthesis a novel branched structure with slowly digestible character.

  15. A Matrix Hyperbolic Cosine Algorithm and Applications

    CERN Document Server

    Zouzias, Anastasios

    2011-01-01

    Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators. Based on their construction, we present a derandomization of the matrix Bernstein inequality which can be viewed as generalization of Spencer's hyperbolic cosine algorithm. We apply our construction to several problems by analyzing its computational efficiency under two special cases of matrix samples; one in which the samples have a group structure and the other in which they have rank-one outer-product structure. As a consequence of the former case, we present a deterministic algorithm that, given the multiplication table of a finite group of size n, constructs an Alon-Roichman expanding Cayley graph of logarithmic degree in O(n^2 log^3 n) time. For the latter case, we present a fast deterministic algorithm for spectral sparsification of positive semi-definite matrices (as defined in [Sri10]) which implies directly an improved deterministic algorithm for spectral graph sparsific...

  16. Lifetimes, branching fractions, and oscillator strengths of doubly ionized tungsten

    Energy Technology Data Exchange (ETDEWEB)

    Schultz-Johanning, M.; Schnabel, R.; Kock, M. [Inst. fuer Atom- and Molekuelphysik, Abt. Plasmaphysik, Univ. Hannover (Germany); Kling, R. [Inst. fuer Atom- and Molekuelphysik, Abt. Plasmaphysik, Univ. Hannover (Germany); National Inst. of Standards and Technology, Gaithersburg, MD (United States); Li, Z.; Lundberg, H. [Dept. of Physics, Lund Inst. of Tech. (Sweden); Johansson, S. [Atomic Spectroscopy, Dept. of Physics, Lund (Sweden)

    2001-05-01

    A first small set of W III oscillator strengths has been obtained from combined lifetime and branching fraction measurements. The branching fractions in the wavelength region of 154-334 nm were measured with a Penning discharge and a Fourier transform spectrometer. Three levels have been calibrated and absolute scales with lifetimes measured with the time-resolved laser-induced fluorescence technique. The f-values derived have uncertainties of about 8% at best. A comparison with Cowan-code calculations is given since no other data are available in the literature. (orig.)

  17. Scale dependence of branching in arterial and bronchial trees

    CERN Document Server

    Restrepo, J G; Hunt, B R; Restrepo, Juan G.; Ott, Edward; Hunt, Brian R.

    2005-01-01

    Although models of branching in arterial and bronchial trees often predict a dependence of bifurcation parameters on the scale of the bifurcating vessels, direct verifications of this dependence with data are uncommon. We compare measurements of bifurcation parameters in airways and arterial trees of different mammals as a function of scale to general features predicted by theoretical models. We find that the size dependence is more complex than existing theories based solely on energy minimization explain, and suggest additional factors that may govern the branching at different scales.

  18. Institutional tensions between the Executive and Legislative branches in Brazil

    Directory of Open Access Journals (Sweden)

    Margarita JIMÉNEZ BADILLO

    2011-06-01

    Full Text Available This study attempts to explain the mechanism through which the Brazilian president manages to govern in Brazil amidst a non majority parliamentary scenario with a highly fragmented party system, rising numbers of switchers, an ostensible lack of discipline of the political parties members, and a precarious party coalition. If the Brazilian political system has not yet fallen into an institutional paralysis of governability it is due to the ability of the Executive branch to obtain support from certain parliamentary coalitions and succeeding thereof to outdo actors with veto power, attempting to hinder relations between the Executive and the Legislative branches.

  19. 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/O-mod...... for range reporting problems in the pointer machine and the I/O-model. With this technique, we tighten the gap between the known upper bound and lower bound for the most fundamental range reporting problem, orthogonal range reporting. 5......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....../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...

  20. Randomized algorithms for matrices and data

    CERN Document Server

    Mahoney, Michael W

    2011-01-01

    Randomized algorithms for very large matrix problems have received a great deal of attention in recent years. Much of this work was motivated by problems in large-scale data analysis. Although this work had its origins within theoretical computer science, where researchers were interested in proving worst-case bounds, i.e., bounds without any assumptions at all on the input data, researchers from numerical linear algebra, statistics, applied mathematics, data analysis, and machine learning, as well as domain scientists have subsequently extended and applied these methods in important ways. Although this has been great for the development of the area and for the technology transfer of theoretical ideas into practical applications, this interdisciplinarity has thus far sometimes obscured the underlying simplicity and generality of the core ideas. This review will provide a detailed overview of recent work on randomized algorithms for matrix problems, with an emphasis on a few simple core ideas that underlie not...

  1. Lesson Eleven Transient and intermittent left bundle branch block

    Institute of Scientific and Technical Information of China (English)

    鲁端; 王劲

    2004-01-01

    @@ In transient left bundle branch block,normal intraventricular conduction subsequently returns,if only1temporarily.The condition has also been called paroxysmal,unstable,or temporary left bundle branch block. Its etiology is similar to that of the stable variety2, with the great majority of the patients having ischemic or hypertensive heart disease or both. Transient bundle branch block may complicate acute myocardial infarction or may occur during attacks of angina. It may appear during an episode of congestive heart failure and disappear with improvement of the cardiac status. Most patients eventually develop permanent block. Occasionally,however, the patient may revert to normal conduction even years after consistently demonstrating the block.

  2. Tight adversary bounds for composite functions

    NARCIS (Netherlands)

    Hoyer, P.; Spalek, R.

    2005-01-01

    The quantum adversary method is a very versatile method for proving lower bounds on quantum algorithms. It has many equivalent formulations, yields tight bounds for many computational problems, and has natural connections to classical lower bounds. One of its formulations is in terms of the spectral

  3. 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....... It captures important aspects of real-life routing problems that were not adequately modeled in previous VRP variants. Hence, its definition and investigation contribute to the development of rich VRPs. In this paper we present the first lower bound 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 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...

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

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  5. Person perception and the bounded rationality of social judgment.

    Science.gov (United States)

    Wright, J C; Dawson, V L

    1988-11-01

    In this article, we develop a bounded rationality view of the relation between person perception and social behavior. Two theses of this approach are that behaviors vary in their significance to observers, and that observers pursue bounded rather than global utility in forming personality impressions. Observers are expected to be sensitive to targets' overall behavioral tendencies and to the variability of their behavior across situations, but both sensitivities are bounded, being greater for behaviors that directly affect observers' outcomes. In two investigations involving extensive hourly and 6-s observations, we examined the bounded utility of people's impressions of personality, demonstrating how impression accuracy is linked to the significance of behaviors. Observers were sensitive to the organization of aggressive behaviors, but less sensitive to the organization of withdrawn behaviors, even when the consistency of those behaviors was comparable. The results clarify the relation between people's inferential shortcomings in laboratory paradigms and the bounded utility of person perception in the natural environment.

  6. Adaptive path planning: Algorithm and analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Pang C.

    1995-03-01

    To address the need for a fast path planner, we present a learning algorithm that improves path planning by using past experience to enhance future performance. The algorithm relies on an existing path planner to provide solutions difficult tasks. From these solutions, an evolving sparse work of useful robot configurations is learned to support faster planning. More generally, the algorithm provides a framework in which a slow but effective planner may be improved both cost-wise and capability-wise by a faster but less effective planner coupled with experience. We analyze algorithm by formalizing the concept of improvability and deriving conditions under which a planner can be improved within the framework. The analysis is based on two stochastic models, one pessimistic (on task complexity), the other randomized (on experience utility). Using these models, we derive quantitative bounds to predict the learning behavior. We use these estimation tools to characterize the situations in which the algorithm is useful and to provide bounds on the training time. In particular, we show how to predict the maximum achievable speedup. Additionally, our analysis techniques are elementary and should be useful for studying other types of probabilistic learning as well.

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

  8. Approach of generating parallel programs from parallelized algorithm design strategies

    Institute of Scientific and Technical Information of China (English)

    WAN Jian-yi; LI Xiao-ying

    2008-01-01

    Today, parallel programming is dominated by message passing libraries, such as message passing interface (MPI). This article intends to simplify parallel programming by generating parallel programs from parallelized algorithm design strategies. It uses skeletons to abstract parallelized algorithm design strategies, as well as parallel architectures. Starting from problem specification, an abstract parallel abstract programming language+ (Apla+) program is generated from parallelized algorithm design strategies and problem-specific function definitions. By combining with parallel architectures, implicity of parallelism inside the parallelized algorithm design strategies is exploited. With implementation and transformation, C++ and parallel virtual machine (CPPVM) parallel program is finally generated. Parallelized branch and bound (B&B) algorithm design strategy and parallelized divide and conquer (D & C) algorithm design strategy are studied in this article as examples. And it also illustrates the approach with a case study.

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

    Science.gov (United States)

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

    2016-07-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 nonzero 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.

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

    CERN Document Server

    Alberte, Lasma; Pujolas, 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.

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

  12. Floral bud damage compensation by branching and biomass allocation in genotypes of Brassica napus with different architecture and branching potential.

    Directory of Open Access Journals (Sweden)

    Amélie ePinet

    2015-02-01

    Full Text Available Plant branching is a key process in the yield elaboration of winter oilseed rape (WOSR. It is also involved in plant tolerance to flower damage because it allows the setting of new fertile inflorescences. Here we characterize the changes in the branching and distribution of the number of pods between primary and secondary inflorescences in response to floral bud clippings. Then we investigate the impacts of the modifications in branching on the biomass allocation and its consequence on the crop productivity (harvest index. These issues were addressed on plants with contrasted architecture and branching potential, using three genotypes (Exocet, Pollen, and Gamin grown under two levels of nitrogen fertilization. Clipping treatments of increasing intensities were applied to either inflorescences or flower buds.We were able to show that restoration of the number of pods after clipping is the main lever for the compensation. Genotypes presented different behaviors in branching and biomass allocation as a function of clipping treatments. The number of fertile ramifications increased for the high intensities of clipping. In particular, the growth of secondary ramifications carried by branches developed before clipping has been observed. The proportions of yield and of number of pods carried by these secondary axes increased and became almost equivalent to the proportion carried by primary inflorescences. In terms of biomass allocation, variations have also been evidenced in the relationship between pod dry mass on a given axis and the number of pods set, while the shoot/root ratio was not modified. The harvest index presented different responses: it decreased after flower buds clipping, while it was maintained after the clipping of the whole inflorescences. The results are discussed relative to their implications regarding the identification of interesting traits to be target in breeding programs in order to improve WOSR tolerance.

  13. Scaling properties of crack branching and brittle fragmentation

    Directory of Open Access Journals (Sweden)

    Uvarov S.

    2011-01-01

    Full Text Available The present study is focused on the correlation of scaling properties of crack branching and brittle fragmentation with damage accumulation and a change in the fracture mechanism. The experimental results obtained from the glass fragmentation tests indicate that the size distribution of fragments has a fractal character and is described by a power law.

  14. Special branches: organic greenhouse production, bulbs, ornamentals and aquaculture

    NARCIS (Netherlands)

    Sukkel, W.; Hommes, M.; Meijer, R.J.M.

    2009-01-01

    Organic production methods are gaining ground in Dutch specialised production branches. Interest is growing among greenhouse horticulturalists and growers of flower bulbs, ornamentals and mushrooms. In organic horticulture Dutch research is unique in the world in thinking up innovative concepts and

  15. Highly Branched Polyethylenes as Lubricant Viscosity and Friction Modifiers

    Energy Technology Data Exchange (ETDEWEB)

    Robinson, Joshua W.; Zhou, Yan; Qu, Jun; Bays, John T.; Cosimbescu, Lelia

    2016-10-08

    A series of highly branched polyethylenes (BPE) were prepared and used in a Group I base oil as potential viscosity and friction modifiers. The lubricating performance of these BPEs supports the expected dual functionality. Changes in polarity, topology, and molecular weight of the BPEs showed significant effects on the lubricants’ performance, which provide scientific insights for polymer design in future lubricant development.

  16. Stress-based upper-bound method and convex optimization: case of the Gurson material

    Science.gov (United States)

    Pastor, Franck; Trillat, Malorie; Pastor, Joseph; Loute, Etienne

    2006-04-01

    A nonlinear interior point method associated with the kinematic theorem of limit analysis is proposed. Associating these two tools enables one to determine an upper bound of the limit loading of a Gurson material structure from the knowledge of the sole yield criterion. We present the main features of the interior point algorithm and an original method providing a rigorous kinematic bound from a stress formulation of the problem. This method is tested by solving in plane strain the problem of a Gurson infinite bar compressed between rough rigid plates. To cite this article: F. Pastor et al., C. R. Mecanique 334 (2006).

  17. Majorana fermions and exotic surface Andreev bound states in topological superconductors: application to Cu(x)Bi2Se3.

    Science.gov (United States)

    Hsieh, Timothy H; Fu, Liang

    2012-03-09

    The recently discovered superconductor Cu(x)Bi2Se3 is a candidate for three-dimensional time-reversal-invariant topological superconductors, which are predicted to have robust surface Andreev bound states hosting massless Majorana fermions. In this work, we analytically and numerically find the linearly dispersing Majorana fermions at k=0, which smoothly evolve into a new branch of gapless surface Andreev bound states near the Fermi momentum. The latter is a new type of Andreev bound states resulting from both the nontrivial band structure and the odd-parity pairing symmetry. The tunneling spectra of these surface Andreev bound states agree well with a recent point-contact spectroscopy experiment [S. Sasaki et al., Phys. Rev. Lett. 107, 217001 (2011)] and yield additional predictions for low temperature tunneling and photoemission experiments.

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

  19. Linear and Branching Formats in Culture Assimilator Training

    Science.gov (United States)

    Malpass, Roy S.; Salancik, Gerald R.

    1977-01-01

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

  20. Algorithms and parallel computing

    CERN Document Server

    Gebali, Fayez

    2011-01-01

    There is a software gap between the hardware potential and the performance that can be attained using today's software parallel program development tools. The tools need manual intervention by the programmer to parallelize the code. Programming a parallel computer requires closely studying the target algorithm or application, more so than in the traditional sequential programming we have all learned. The programmer must be aware of the communication and data dependencies of the algorithm or application. This book provides the techniques to explore the possible ways to

  1. Trimmed Moebius Inversion and Graphs of Bounded Degree

    CERN Document Server

    Björklund, Andreas; Kaski, Petteri; Koivisto, Mikko

    2008-01-01

    We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius inversion that proceeds point by point, finishing the calculation at a subset before considering its supersets. For an $n$-element universe $U$ and a family $\\scr F$ of its subsets, trimmed Moebius inversion allows us to compute the number of packings, coverings, and partitions of $U$ with $k$ sets from $\\scr F$ in time within a polynomial factor (in $n$) of the number of supersets of the members of $\\scr F$. Relying on an intersection theorem of Chung et al. (1986) to bound the sizes of set families, we apply these ideas to well-studied combinatorial optimisation problems on graphs of maximum degree $\\Delta$. In particular, we show how to compute the Domatic Number in time within a polynomial factor of $(2^{\\Delta+1-2)^{n/(\\Delta+1)$ and the Chromatic Number in time within a polynomial factor of $(2^{\\Delta+1-\\Delta-1)^{n/(\\Delta+1)$. F...

  2. Polyphosphazene Based Star-Branched and Dendritic Molecular Brushes

    Science.gov (United States)

    Henke, Helena; Posch, Sandra; Brüggemann, Oliver; Teasdale, Ian

    2016-01-01

    A new synthetic procedure is described for the preparation of poly(organo)phosphazenes with star-branched and star dendritic molecular brush type structures, thus describing the first time it has been possible to prepare controlled, highly branched architectures for this type of polymer. Furthermore, as a result of the extremely high-arm density generated by the phosphazene repeat unit, the second-generation structures represent quite unique architectures for any type of polymer. Using two relativity straight forward iterative syntheses it is possible to prepare globular highly branched polymers with up to 30 000 functional end groups, while keeping relatively narrow polydispersities (1.2–1.6). Phosphine mediated polymerization of chlorophosphoranimine is first used to prepare three-arm star polymers. Subsequent substitution with diphenylphosphine moieties gives poly(organo)phosphazenes to function as multifunctional macroinitiators for the growth of a second generation of polyphosphazene arms. Macrosubstitution with Jeffamine oligomers gives a series of large, water soluble branched macromolecules with high-arm density and hydrodynamic diameters between 10 and 70 nm. PMID:27027404

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

    Science.gov (United States)

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

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

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

  6. Rigorous Performance Bounds for Quadratic and Nested Dynamical Decoupling

    CERN Document Server

    Xia, Yuhou; Lidar, Daniel A

    2011-01-01

    We present rigorous performance bounds for the quadratic dynamical decoupling (QDD) pulse sequence which protects a qubit from general decoherence, and for its nested generalization to an arbitrary number of qubits. Our bounds apply under the assumption of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in quantum dots. We prove that if the total sequence time is fixed then the trace-norm distance between the unperturbed and protected system states can be made arbitrarily small by increasing the number of applied pulses.

  7. New bounds for multi-dimensional packing

    OpenAIRE

    Seiden, S.; Stee, van, Rob

    2001-01-01

    New upper and lower bounds are presented for a multi-dimensional generalization of bin packing called box packing. Several variants of this problem, including bounded space box packing, square packing, variable sized box packing and resource augmented box packing are also studied. The main results, stated for d=2, are as follows: A new upper bound of 2.66013 for online box packing, a new $14/9 + varepsilon$ polynomial time offline approximation algorithm for square packing, a new upper bound ...

  8. Quantum CPU and Quantum Algorithm

    OpenAIRE

    Wang, An Min

    1999-01-01

    Making use of an universal quantum network -- QCPU proposed by me\\upcite{My1}, it is obtained that the whole quantum network which can implement some the known quantum algorithms including Deutsch algorithm, quantum Fourier transformation, Shor's algorithm and Grover's algorithm.

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

  10. An exact algorithm for optimal redundancy in a series system with multiple component choices%多选择串联系统最优冗余问题的精确算法

    Institute of Scientific and Technical Information of China (English)

    孙小玲; 阮宁

    2006-01-01

    In this paper, an exact algorithm was proposed for optimal redundancy in a series system with multiple component choices. A reformulation of the nonseparable reliability function was approximated by a separable integer programming problem. The resulting separable nonlinear integer programming problem is used to compute upper bounds by Lagrangian relaxation and dual search. A special partition scheme was derived to reduce the duality gap in a branch-and-bound process, thus ensure the convergence of the algorithm.Computational results show that the algorithm is efficient for solving this class of reliability optimization problems.

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

  12. Fusion ofK-means and Ncut algorithm to realize segmentation and reconstruction of two overlapped apples without blocking by branches and leaves%融合K-means与Ncut算法的无遮挡双重叠苹果目标分割与重建

    Institute of Scientific and Technical Information of China (English)

    王丹丹; 徐越; 宋怀波; 何东健; 张海辉

    2015-01-01

    result was compared with the comparison method. The comparison method is a method that uses the connection line of 2 concave points to segment overlapped apples, and then utilizes the Hough transform method to reconstruct the contour of apples. The experimental results showed that for unblocked apples in apple images, average segmentation error of the presented method was 3.15%, 7.73% less than that of comparison method (10.88%). Average overlap ratio of the presented method was 96.08% and was increased by 9.71% compared to comparison method (90.85%). In addition, this method could keep the complete contour information of unblocked apples and thus improved segmentation accuracy effectively. For blocked apples, average segmentation error and average overlap ratio were 5.24% and 93.81%, respectively. The segmentation error was decreased by 11.35% and average overlap ratio was increased by 12.74% compared to comparison method, which indicated that the method could reconstruct contour of blocked apples well. In conclusion, the presented algorithm is feasible to segment and reconstruct 2 overlapped apples without blocking by branches and leaves. However, for the images of overlapped apple blocked by branches and leaves, the images of more than 2 overlapped apples, and the images of 2 overlapped apples unblocked by branches and leaves with unclear contour at overlapped part, this method cannot complete the segmentation, and thus further research would be needed.%重叠苹果目标的准确分割是采摘机器人必须解决的关键问题之一。针对现有重叠苹果目标分割方法不能保留重叠部分轮廓信息的问题,提出了一种无枝叶遮挡的双果重叠苹果目标分割方法。该方法首先利用K-means聚类算法进行图像分割以提取苹果目标区域,然后利用Normalized Cut (Ncut)算法提取苹果目标轮廓,以实现未被遮挡苹果目标完整轮廓的准确提取,最后利用Spline插值算法对遮挡的苹果目标进

  13. Vulnerable Derivatives and Good Deal Bounds: A Structural Model

    DEFF Research Database (Denmark)

    Murgoci, Agatha

    2013-01-01

    a new restriction in the arbitrage free model by setting upper bounds on the Sharpe ratios (SRs) of the assets. The potential prices that are eliminated represent unreasonably good deals. The constraint on the SR translates into a constraint on the stochastic discount factor. Thus, tight pricing bounds...... can be obtained. We provide a link between the objective probability measure and the range of potential risk-neutral measures, which has an intuitive economic meaning. We also provide tight pricing bounds for European calls and show how to extend the call formula to pricing other financial products...

  14. Localization of negative energy and the Bekenstein bound.

    Science.gov (United States)

    Blanco, David D; Casini, Horacio

    2013-11-27

    A simple argument shows that negative energy cannot be isolated far away from positive energy in a conformal field theory and strongly constrains its possible dispersal. This is also required by consistency with the Bekenstein bound written in terms of the positivity of relative entropy. We prove a new form of the Bekenstein bound based on the monotonicity of the relative entropy, involving a "free" entropy enclosed in a region which is highly insensitive to space-time entanglement, and show that it further improves the negative energy localization bound.

  15. CADGbased neighbor search and bounding box algorithms for geometry navigation acceleration in Monte Carlo particle transport simulation%基于CAD邻居列表和包围盒的蒙特卡罗粒子输运几何跟踪加速方法研究

    Institute of Scientific and Technical Information of China (English)

    陈珍平; 宋婧; 吴斌; 郝丽娟; 胡丽琴; 孙光耀

    2016-01-01

    Geometry navigation plays the most fundamental role in Monte Carlo particle transport simulation. It’s mainly responsible for locating a particle inside which geometry volume it is and computing the distance to the volume boundary along the certain particle traj ectory during each particle history. Geometry navigation directly affects the run-time performance of the Monte Carlo particle transport simulation, especially for complicated fusion reactor models. Thus, two CAD-based geometry acceleration algorithms,the neighbor search and the bounding box,are presented for improving geometry navigation performance. The algorithms have been implemented in the Super Monte Carlo Simulation Program for Nuclear and Radiation Process (SuperMC). The fusion reactors of FDS-Ⅱ and ITER benchmark models have been tested to highlight the efficiency gains that can be achieved by using the acceleration algorithms. Testing results showed that efficiency of Monte Carlo simulation can be considerably enhanced by 50% to 60% with the acceleration algorithms.%几何跟踪主要进行蒙特卡罗粒子输运计算中粒子位置和径迹长度的计算,它是蒙特卡罗粒子输运计算的关键技术之一。由于聚变堆几何结构极其复杂,使得几何跟踪在整个蒙特卡罗粒子输运计算中占据30%~80%的计算时间,因此几何跟踪方法的效率是决定聚变堆蒙特卡罗粒子输运计算效率的重要因素之一。本文提出了基于CAD的邻居列表和包围盒加速方法,并基于 FDS 团队自主研发的超级蒙特卡罗核计算仿真软件系统 SuperMC进行实现。利用聚变堆 FDS-Ⅱ和 ITER模型对本文方法进行了数值验证,测试结果表明本文方法不影响计算结果,并能使程序计算效率提高50%~60%,证明了本文方法的正确性和有效性。

  16. Spectral bounds for percolation on directed and undirected graphs

    CERN Document Server

    Hamilton, Kathleen E

    2015-01-01

    We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.

  17. Hodograph computation and bound estimation for rational B-spline curves

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    It is necessary to compute the derivative and estimate the bound of rational B-spline curves in design system, which has not been studied to date. To improve the function of computer aided design (CAD) system, and to enhance the efficiency of different algorithms of rational B-spline curves, the representation of scaled hodograph and bound of derivative magnitude of uniform planar rational B-spline curves are derived by applying Dir function, which indicates the direction of Cartesian vector between homogeneous points, discrete B-spline theory and the formula of translating the product into a summation of B-spline functions. As an application of the result above,upper bound of parametric distance between any two points in a uniform planar rational B-spline curve is further presented.

  18. An Improved Bounding Box Localization Algorithm Based on the Virtual Anchor Nodes%一种基于虚拟锚节点策略改进的Bounding Box定位算法

    Institute of Scientific and Technical Information of China (English)

    周莹

    2014-01-01

    针对Bounding Box算法定位误差大、覆盖率低的缺点,提出了一种采用虚拟锚节点策略的改进定位算法。首先未知节点利用其通信范围内的锚节点进行定位;其次,已定位的节点根据升级策略有选择性的升级为虚拟锚节点;最后,无法定位的节点利用虚拟锚节点实现定位。另外,在离散网络模型的基础上,通过建立双半径网络节点模型从而进一步约束了未知节点的位置。理论分析及仿真结果均表明,该算法在显著提高定位覆盖率的同时,有效地提高了定位精度。%To overcome the disadvantages of localization accuracy and low coverage rate in current Bounding Box al-gorithm,an improved algorithm using the virtual anchor nodes was proposed. Firstly, the anchor nodes within the communication range of unknown nodes were used to calculate the coordinates of the unknown nodes. Secondly,the located unknown nodes were upgraded as the virtual anchor nodes according to the promotion strategy selectively. Finally,the nodes which were unable to locate themselves used the virtual anchor nodes to get their location. On the other hands,the network node model of double radius based on the discrete network model was introduced to restrict the location of the unknown nodes. The result of simulation and analysis shows that the proposed algorithm can improve the localization coverage rate as well as the estimation accuracy significantly.

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

  20. A New Global Optimization Algorithm for Solving a Class of Nonconvex Programming Problems

    Directory of Open Access Journals (Sweden)

    Xue-Gang Zhou

    2014-01-01

    Full Text Available A new two-part parametric linearization technique is proposed globally to a class of nonconvex programming problems (NPP. Firstly, a two-part parametric linearization method is adopted to construct the underestimator of objective and constraint functions, by utilizing a transformation and a parametric linear upper bounding function (LUBF and a linear lower bounding function (LLBF of a natural logarithm function and an exponential function with e as the base, respectively. Then, a sequence of relaxation lower linear programming problems, which are embedded in a branch-and-bound algorithm, are derived in an initial nonconvex programming problem. The proposed algorithm is converged to global optimal solution by means of a subsequent solution to a series of linear programming problems. Finally, some examples are given to illustrate the feasibility of the presented algorithm.

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

  2. Properties of squeezing functions and geometry of bounded domains

    CERN Document Server

    Deng, Fusheng; Zhang, Liyou

    2012-01-01

    In this article we continue the study of properties of squeezing functions and geometry of bounded domains. The limit of squeezing functions of a sequence of bounded domains is studied. We give comparisons of intrinsic positive forms and metrics on bounded domains in terms of squeezing functions. To study the boundary behavior of squeezing functions, we introduce the notions of (intrinsic) ball pinching radius, and give boundary estimate of squeezing functions in terms of these datum. Finally, we use these results to study geometric and analytic properties of some interesting domains, including planar domains, Cartan-Hartogs domains, and a strongly pseudoconvex Reinhardt domain which is not convex. As a corollary, all Cartan-Hartogs domains are homogenous regular, i.e., their squeezing functions admit positive lower bounds.

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

  4. US Forest Service Survey parcels described by metes and bounds

    Data.gov (United States)

    US Forest Service, Department of Agriculture — A map service on the www depicting survey parcels described by a metes and bounds description. Examples include: land lots, housing subdivision lots, mineral...

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

  6. Blood vessels restrain pancreas branching, differentiation and growth.

    Science.gov (United States)

    Magenheim, Judith; Ilovich, Ohad; Lazarus, Alon; Klochendler, Agnes; Ziv, Oren; Werman, Roni; Hija, Ayat; Cleaver, Ondine; Mishani, Eyal; Keshet, Eli; Dor, Yuval

    2011-11-01

    How organ size and form are controlled during development is a major question in biology. Blood vessels have been shown to be essential for early development of the liver and pancreas, and are fundamental to normal and pathological tissue growth. Here, we report that, surprisingly, non-nutritional signals from blood vessels act to restrain pancreas growth. Elimination of endothelial cells increases the size of embryonic pancreatic buds. Conversely, VEGF-induced hypervascularization decreases pancreas size. The growth phenotype results from vascular restriction of pancreatic tip cell formation, lateral branching and differentiation of the pancreatic epithelium into endocrine and acinar cells. The effects are seen both in vivo and ex vivo, indicating a perfusion-independent mechanism. Thus, the vasculature controls pancreas morphogenesis and growth by reducing branching and differentiation of primitive epithelial cells.

  7. An empirical assessment of tree branching networks and implications for plant allometric scaling models.

    Science.gov (United States)

    Bentley, Lisa Patrick; Stegen, James C; Savage, Van M; Smith, Duncan D; von Allmen, Erica I; Sperry, John S; Reich, Peter B; Enquist, Brian J

    2013-08-01

    Several theories predict whole-tree function on the basis of allometric scaling relationships assumed to emerge from traits of branching networks. To test this key assumption, and more generally, to explore patterns of external architecture within and across trees, we measure branch traits (radii/lengths) and calculate scaling exponents from five functionally divergent species. Consistent with leading theories, including metabolic scaling theory, branching is area preserving and statistically self-similar within trees. However, differences among scaling exponents calculated at node- and whole-tree levels challenge the assumption of an optimised, symmetrically branching tree. Furthermore, scaling exponents estimated for branch length change across branching orders, and exponents for scaling metabolic rate with plant size (or number of terminal tips) significantly differ from theoretical predictions. These findings, along with variability in the scaling of branch radii being less than for branch lengths, suggest extending current scaling theories to include asymmetrical branching and differential selective pressures in plant architectures.

  8. Higgs interchange and bound states of superheavy fermions

    Indian Academy of Sciences (India)

    M De Sanctis

    2013-09-01

    Hypothetical superheavy fourth-generation fermions with a very small coupling with the rest of the Standard Model can give rise to long enough lived bound states. The production and the detection of these bound states would be experimentally feasible at the LHC. Extending, in the present study, the analysis of other authors, a semirelativistic wave equation is solved using an accurate numerical method to determine the binding energies of these possible superheavy fermion-bound states. The interaction given by the Yukawa potential of the Higgs boson exchange is considered; the corresponding relativistic corrections are calculated by means of a model based on the covariance properties of the Hamiltonian. We study the effects given by the Coulomb force. Moreover, we calculate the contributions given by the Coulombic and confining terms of the strong interaction in the case of superheavy quark bound states. The results of the model are critically analysed.

  9. Alternation-Trading Proofs, Linear Programming, and Lower Bounds

    CERN Document Server

    Williams, Ryan

    2010-01-01

    A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT, Majority-of-Majority-SAT, and Tautologies, to name a few. The proofs of these lower bounds follow a certain proof-by-contradiction strategy that we call alternation-trading. An important open problem is to determine how powerful such proofs can possibly be. We propose a methodology for studying these proofs that makes them amenable to both formal analysis and automated theorem proving. We prove that the search for better lower bounds can often be turned into a problem of solving a large series of linear programming instances. Implementing a small-scale theorem prover based on this result, we extract new human-readable time lower bounds for several problems. This framework can also be used to prove concrete limitations on the current techniques.

  10. Adaptive correction method for an OCXO and investigation of analytical cumulative time error upper bound.

    Science.gov (United States)

    Zhou, Hui; Kunz, Thomas; Schwartz, Howard

    2011-01-01

    Traditional oscillators used in timing modules of CDMA and WiMAX base stations are large and expensive. Applying cheaper and smaller, albeit more inaccurate, oscillators in timing modules is an interesting research challenge. An adaptive control algorithm is presented to enhance the oscillators to meet the requirements of base stations during holdover mode. An oscillator frequency stability model is developed for the adaptive control algorithm. This model takes into account the control loop which creates the correction signal when the timing module is in locked mode. A recursive prediction error method is used to identify the system model parameters. Simulation results show that an oscillator enhanced by our adaptive control algorithm improves the oscillator performance significantly, compared with uncorrected oscillators. Our results also show the benefit of explicitly modeling the control loop. Finally, the cumulative time error upper bound of such enhanced oscillators is investigated analytically and comparison results between the analytical and simulated upper bound are provided. The results show that the analytical upper bound can serve as a practical guide for system designers.

  11. Mass Losing Asymptotic Giant Branch Stars and Supergiants

    CERN Document Server

    Whitelock, Patricia A; Höfner, Susanne; Wittkowski, Markus; Zijlstra, Albert A

    2016-01-01

    This paper presents a summary of four invited and twelve contributed presentations on asymptotic giant branch stars and red supergiants, given over the course of two afternoon splinter sessions at the 19th Cool Stars Workshop. It highlights both recent observations and recent theory, with some emphasis on high spatial resolution, over a wide range of wavelengths. Topics covered include 3D models, convection, binary interactions, mass loss, dust formation and magnetic fields.

  12. Lipschitz spaces and bounded mean oscillation of harmonic mappings

    CERN Document Server

    Chen, Sh; Vuorinen, M; Wang, X

    2012-01-01

    In this paper, we first study the bounded mean oscillation of planar harmonic mappings, then a relationship between Lipschitz-type spaces and equivalent modulus of real harmonic mappings is established. At last, we obtain sharp estimates on Lipschitz number of planar harmonic mappings in terms of bounded mean oscillation norm, which shows that the harmonic Bloch space is isomorphic to $BMO_{2}$ as a Banach space.

  13. Bounds for Regularity and Coregularity of Graded Modules

    Indian Academy of Sciences (India)

    Reza Sazeedeh

    2007-11-01

    Let be a finitely generated graded module over a Noetherian homogeneous ring with local base ring $(R_0,\\mathfrak{m}_0)$. If 0 is of dimension one, then we show that $\\mathrm{reg}^i+1(M)$ and $\\mathrm{coreg}^{i+1}(M)$ are bounded for all $i\\in\\mathbb{N}_0$. We improve these bounds, if in addition, 0 is either regular or analytically irreducible of unequal characteristic.

  14. Lower Bound for Convex Hull Area and Universal Cover Problems

    CERN Document Server

    Khandhawit, Tirasan; Sriswasdi, Sira

    2011-01-01

    In this paper, we provide a lower bound for an area of the convex hull of points and a rectangle in a plane. We then apply this estimate to establish a lower bound for a universal cover problem. We showed that a convex universal cover for a unit length curve has area at least 0.232239. In addition, we show that a convex universal cover for a unit closed curve has area at least 0.0879873.

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

    delivery point. The second leg is a direct trip – called a shuttle – between two delivery points. This optimization problem has practical applications in the transportation of people between a large set of pickup points and a restricted set of delivery points.This paper proposes three mathematical models...... 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...

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

  17. Signaling mechanisms in cortical axon growth, guidance and branching

    Directory of Open Access Journals (Sweden)

    Katherine eKalil

    2011-09-01

    Full Text Available Precise wiring of cortical circuits during development depends upon axon extension, guidance and branching to appropriate targets. Motile growth cones at axon tips navigate through the nervous system by responding to molecular cues, which modulate signaling pathways within axonal growth cones. Intracellular calcium signaling has emerged as a major transducer of guidance cues but exactly how calcium signaling pathways modify the actin and microtubule cytoskeleton to evoke growth cone behaviors and axon branching is still mysterious. Axons must often pause in their outgrowth while their branches extend into targets. Some evidence suggests a competition between growth of axons and branches but the mechanisms are poorly understood. Since it is difficult to study growing axons deep within the mammalian brain, much of what we know about signaling pathways and cytoskeletal dynamics has come from studies of axonal growth cones, in many cases from non-mammalian species, growing in tissue culture. Consequently it is not well understood how guidance cues relevant to mammalian neural development in vivo signal to the growth cone cytoskeleton during axon outgrowth and guidance. In this review we describe our recent work in dissociated cultures of developing rodent sensorimotor cortex in the context of the current literature on molecular guidance cues, calcium signaling pathways and cytoskeletal dynamics that regulate growth cone behaviors. A major challenge is to relate findings in tissue culture to mechanisms of cortical development in vivo. Toward this goal, we describe our recent work in cortical slices, which preserve the complex cellular and molecular environment of the mammalian brain but allow direct visualization of growth cone behaviors and calcium signaling. Findings from this work suggest that mechanisms regulating axon growth and guidance in dissociated culture neurons also underlie development of cortical connectivity in vivo.

  18. Isosurfaces geometry, topology, and algorithms

    CERN Document Server

    Wenger, Rephael

    2013-01-01

    Ever since Lorensen and Cline published their paper on the Marching Cubes algorithm, isosurfaces have been a standard technique for the visualization of 3D volumetric data. Yet there is no book exclusively devoted to isosurfaces. Isosurfaces: Geometry, Topology, and Algorithms represents the first book to focus on basic algorithms for isosurface construction. It also gives a rigorous mathematical perspective on some of the algorithms and results. In color throughout, the book covers the Marching Cubes algorithm and variants, dual contouring algorithms, multilinear interpolation, multiresolutio

  19. The chromomagnetic dipole operator and the B semileptonic branching ratio

    CERN Document Server

    Ciuchini, M; Giudice, Gian Francesco

    1996-01-01

    We consider the possibility of having a large branching ratio for the decay b\\to s g coming from an enhanced Wilson coefficient of the chromomagnetic dipole operator. We show that values of BR(b\\to s g) up to \\sim 10\\% or more are compatible with the constraints coming from the CLEO experimental results on BR(B\\to X_s\\gamma) and BR(B\\to X_s\\phi). Such large values can reconcile the predictions of both the semileptonic branching ratio and the charm counting with the present experimental results. We also discuss a supersymmetric model with gluino-mediated flavour violations, which can account for such large values of BR(b\\to s g).

  20. RADFLO physics and algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Symbalisty, E.M.D.; Zinn, J.; Whitaker, R.W.

    1995-09-01

    This paper describes the history, physics, and algorithms of the computer code RADFLO and its extension HYCHEM. RADFLO is a one-dimensional, radiation-transport hydrodynamics code that is used to compute early-time fireball behavior for low-altitude nuclear bursts. The primary use of the code is the prediction of optical signals produced by nuclear explosions. It has also been used to predict thermal and hydrodynamic effects that are used for vulnerability and lethality applications. Another closely related code, HYCHEM, is an extension of RADFLO which includes the effects of nonequilibrium chemistry. Some examples of numerical results will be shown, along with scaling expressions derived from those results. We describe new computations of the structures and luminosities of steady-state shock waves and radiative thermal waves, which have been extended to cover a range of ambient air densities for high-altitude applications. We also describe recent modifications of the codes to use a one-dimensional analog of the CAVEAT fluid-dynamics algorithm in place of the former standard Richtmyer-von Neumann algorithm.

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

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

  3. Algorithms for Planar Graphs and Graphs in Metric Spaces

    DEFF Research Database (Denmark)

    Wulff-Nilsen, Christian

    of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... preprocessing time, an O(n log n) time algorithm for the replacement paths problem, and a min st-cut oracle with nearlinear preprocessing time. We also give improved time bounds for computing various graph invariants such as diameter and girth. In the second part, we consider stretch factor problems...

  4. Goal programming with bounded variables and post analysis%有界变量目标规划及后分析

    Institute of Scientific and Technical Information of China (English)

    胡清淮; 魏一鸣

    2003-01-01

    This paper outlines the algorithm of linear goal programming with bounded variables and its post analysis. An application of this method for selection of a preferable solution within the multiple solutions is demonstrated.

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

  6. Genetic Algorithms and Local Search

    Science.gov (United States)

    Whitley, Darrell

    1996-01-01

    The first part of this presentation is a tutorial level introduction to the principles of genetic search and models of simple genetic algorithms. The second half covers the combination of genetic algorithms with local search methods to produce hybrid genetic algorithms. Hybrid algorithms can be modeled within the existing theoretical framework developed for simple genetic algorithms. An application of a hybrid to geometric model matching is given. The hybrid algorithm yields results that improve on the current state-of-the-art for this problem.

  7. Capacity Bounds for Parallel Optical Wireless Channels

    KAUST Repository

    Chaaban, Anas

    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.

  8. Parallel Architectures and Bioinspired Algorithms

    CERN Document Server

    Pérez, José; Lanchares, Juan

    2012-01-01

    This monograph presents examples of best practices when combining bioinspired algorithms with parallel architectures. The book includes recent work by leading researchers in the field and offers a map with the main paths already explored and new ways towards the future. Parallel Architectures and Bioinspired Algorithms will be of value to both specialists in Bioinspired Algorithms, Parallel and Distributed Computing, as well as computer science students trying to understand the present and the future of Parallel Architectures and Bioinspired Algorithms.

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

  10. Random hypergraphs and algorithmics

    CERN Document Server

    Andriamampianina, Tsiriniaina

    2008-01-01

    Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by mean of exponential generating functions. The number of hypergraph component is bounded, as a generalisation of Wright inequalities for graphs: the proof is a combinatorial understanding of the structure by inclusion exclusion. Asymptotic results are obtained, thanks to generating functions proofs are at the end very easy to read, through complex analysis by saddle point method. By this way, we characterized: - the components with a given number of vertices and of hyperedges by the expected size of a random hypermatching in these structures. - the random hypergraphs (evolving hyperedge by hyperedge) according to the expected number of hyperedges when the first cycle appears in the evolving structure. This work is an open road to further works on random hypergraphs such as threshold phenomenon, tools used here seem to be sufficien...

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

  12. Hybrid Steepest-Descent Methods for Solving Variational Inequalities Governed by Boundedly Lipschitzian and Strongly Monotone Operators

    Directory of Open Access Journals (Sweden)

    He Songnian

    2010-01-01

    Full Text Available Let be a real Hilbert space and let be a boundedly Lipschitzian and strongly monotone operator. We design three hybrid steepest descent algorithms for solving variational inequality of finding a point such that , for all , where is the set of fixed points of a strict pseudocontraction, or the set of common fixed points of finite strict pseudocontractions. Strong convergence of the algorithms is proved.

  13. Two-body bound state problem and nonsingular scattering equations

    Energy Technology Data Exchange (ETDEWEB)

    Bartnik, E.A.; Haberzettl, H.; Sandhas, W.

    1986-11-01

    We present a new momentum space approach to the two-body problem in partial waves. In contrast to the usual momentum space approaches, we treat the bound state case with the help of an inhomogeneous integral equation which possesses solutions for all (negative) energies. The bound state energies and corresponding wave functions are identified by an additional condition. This procedure straightforwardly leads to a nonsingular formulation of the scattering problem in terms of essentially the same equation and thus unifies the descriptions of both energy regimes. We show that the properties of our momentum-space approach can be understood in terms of the so-called regular solution of the Schroedinger equation in position space. The unified description of the bound state and scattering energy regimes in terms of one single, real, and manifestly nonsingular equation allows us to construct an exact representation of the two-body off-shell T matrix in which all the bound state pole and scattering cut information is contained in one single separable term, the remainder being real, nonsingular, and vanishing half on-shell. Such a representation may be of considerable advantage as input in three-body Faddeev-type integral equations. We demonstrate the applicability of our method by calculating bound state and scattering data for the two-nucleon system with the s-wave Malfliet--Tjon III potential.

  14. The Laplace Functional and Moments for Markov Branching Chains in Random Environments

    Institute of Scientific and Technical Information of China (English)

    HU Di-he; ZHANG Shu-lin

    2005-01-01

    The concepts of random Markov matrix, Markov branching chain in random environment (MBCRE) and Laplace functional of Markov branching chain in random environment (LFMBCRE) are introduced. The properties of LFMBCRE and the explicit formulas of moments of MBCRE are given.

  15. Starch Granule Re-Structuring by Starch Branching Enzyme and Glucan Water Dikinase Modulation Affects Caryopsis Physiology and Metabolism

    DEFF Research Database (Denmark)

    Shaik, Shahnoor S.; Obata, Toshihiro; Hebelstrup, Kim H;

    2016-01-01

    Starch is of fundamental importance for plant development and reproduction and its optimized molecular assembly is potentially necessary for correct starch metabolism. Re-structuring of starch granules in-planta can therefore potentially affect plant metabolism. Modulation of granule micro......-structure was achieved by decreasing starch branching and increasing starch-bound phosphate content in the barley caryopsis starch by RNAi suppression of all three Starch Branching Enzyme (SBE) isoforms or overexpression of potato Glucan Water Dikinase (GWD). The resulting lines displayed Amylose-Only (AO) and Hyper......-Phosphorylated (HP) starch chemotypes, respectively. We studied the influence of these alterations on primary metabolism, grain composition, starch structural features and starch granule morphology over caryopsis development at 10, 20 and 30 days after pollination (DAP) and at grain maturity. While HP showed...

  16. Starch Granule Re-Structuring by Starch Branching Enzyme and Glucan Water Dikinase Modulation Affects Caryopsis Physiology and Metabolism

    DEFF Research Database (Denmark)

    Shaik, Shahnoor S.; Obata, Toshihiro; Hebelstrup, Kim H;

    2016-01-01

    -structure was achieved by decreasing starch branching and increasing starch-bound phosphate content in the barley caryopsis starch by RNAi suppression of all three Starch Branching Enzyme (SBE) isoforms or overexpression of potato Glucan Water Dikinase (GWD). The resulting lines displayed Amylose-Only (AO) and Hyper...... relatively little effect, AO showed significant reduction in starch accumulation with re-direction to protein and β-glucan (BG) accumulation. Metabolite profiling indicated significantly higher sugar accumulation in AO, with re-partitioning of carbon to accumulate amino acids, and interestingly it also had...... high levels of some important stress-related metabolites and potentially protective metabolites, possibly to elude deleterious effects. Investigations on starch molecular structure revealed significant increase in starch phosphate and amylose content in HP and AO respectively with obvious differences...

  17. An Evaluation of a Modified Simulated Annealing Algorithm for Various Formulations

    Science.gov (United States)

    1990-08-01

    as tractable if and only if there is an algorithm for its solution whose running time is bounded by a polynomial in the size of its input ( Karp , 1972...NP. This concept was originally introduced by Cook (1971) and elaborated on by Karp (1972). Carey and Johnson (1979) list about 300 NP- complete...Lieberman, Gerald J. (1980). Introduction to operations research. San Francisco: Holden- Day. Ignall, E., & Schrage, L. E. (1965). Application of the branch

  18. Global optimization of truss topology with discrete bar areas-Part II: Implementation and numerical results

    DEFF Research Database (Denmark)

    Achtziger, Wolfgang; Stolpe, Mathias

    2009-01-01

    -and-bound search all have the same feasible set and differ from each other only in the objective function. This is one reason for making the resulting branch-and-bound method very efficient. The paper closes with several large-scale numerical examples. These examples are, to the knowledge of the authors, by far...... we use the theory developed in Part I to design a convergent nonlinear branch-and-bound method tailored to solve large-scale instances of the original discrete problem. The problem formulation and the needed theoretical results from Part I are repeated such that this paper is self-contained. We focus...... on the implementation details but also establish finite convergence of the branch-and-bound method. The algorithm is based on solving a sequence of continuous non-convex relaxations which can be formulated as quadratic programs according to the theory in Part I. The quadratic programs to be treated within the branch...

  19. Bound states in open coupled asymmetrical waveguides and quantum wires

    CERN Document Server

    Amore, Paolo; Terrero-Escalante, Cesar A

    2011-01-01

    The behavior of bound states in asymmetric cross, T and L shaped configurations is considered. Because of the symmetries of the wavefunctions, the analysis can be reduced to the case of an electron localized at the intersection of two orthogonal crossed wires of different width. Numerical calculations show that the fundamental mode of this system remains bound for the widths that we have been able to study directly; moreover, the extrapolation of the results obtained for finite widths suggests that this state remains bound even when the width of one arm becomes infinitesimal. We provide a qualitative argument which explains this behavior and that can be generalized to the lowest energy states in each symmetry class. In the case of odd-odd states of the cross we find that the lowest mode is bounded when the width of the two arms is the same and stays bound up to a critical value of the ratio between the widths; in the case of the even-odd states we find that the lowest mode is unbound up to a critical value of...

  20. Floquet bound states around defects and adatoms in graphene

    Science.gov (United States)

    Lovey, D. A.; Usaj, Gonzalo; Foa Torres, L. E. F.; Balseiro, C. A.

    2016-06-01

    Recent studies have focused on laser-induced gaps in graphene which have been shown to have a topological origin, thereby hosting robust states at the sample edges. While the focus has remained mainly on these topological chiral edge states, the Floquet bound states around defects lack a detailed study. In this paper we present such a study covering large defects of different shape and also vacancy-like defects and adatoms at the dynamical gap at ℏ Ω /2 (ℏ Ω being the photon energy). Our results, based on analytical calculations as well as numerics for full tight-binding models, show that the bound states are chiral and appear in a number which grows with the defect size. Furthermore, while the bound states exist regardless of the type of the defect's edge termination (zigzag, armchair, mixed), the spectrum is strongly dependent on it. In the case of top adatoms, the bound state quasienergies depend on the adatoms energy. The appearance of such bound states might open the door to the presence of topological effects on the bulk transport properties of dirty graphene.

  1. Radiation reaction reexamined: bound momentum and Schott term

    CERN Document Server

    Galtsov, D V; Gal'tsov, Dmitri V.; Spirin, Pavel

    2004-01-01

    We review and compare two different approaches to radiation reaction in classical electrodynamics of point charges: a local calculation of the self-force using the charge equation of motion and a global calculation consisting in integration of the electromagnetic energy-momentum flux through a hypersurface encircling the world-line. Both approaches are complementary and, being combined together, give rise to an identity relating the locally and globally computed forces. From this identity it follows that the Schott terms in the Abraham force should arise from the bound field momentum and can not be introduced by hand as an additional term in the mechanical momentum of an accelerated charge. This is in perfect agreement with the results of Dirac and Teitelboim, but disagrees with the recent calculation of the bound momentum in the retarded coordinates. We perform an independent calculation of the bound electromagnetic momentum and verify explicitly that the Schott term is the derivative of the finite part of t...

  2. The Largest Gravitationally Bound Structures: The Corona Borealis Supercluster - Mass and Bound Extent

    CERN Document Server

    Pearson, David W; Batuski, David J

    2014-01-01

    Recent simulations of the densest portion of the Corona Borealis supercluster (A2061, A2065, A2067, and A2089) have shown virtually no possibility of extended gravitationally bound structure without inter-cluster matter (Pearson & Batuski). In contrast, recent analyses of the dynamics found that the clusters had significant peculiar velocities towards the supercluster centroid (Batiste & Batuski). In this paper we present the results of a thorough investigation of the CSC: we determine redshifts and virial masses for all 8 clusters associated with the CSC; repeat the analysis of Batiste & Batuski with the inclusion of A2056 and CL1529+29; estimate the mass of the supercluster by applying the virial theorem on the supercluster scale (e.g. Small et al.), the caustics method (e.g. Reisenegger et al.), and a new procedure using the spherical collapse model (SCM) with the results of the dynamical analysis (SCM+FP); and perform a series of simulations to assess the likelihood of the CSC being a gravitat...

  3. Parton energy loss at strong coupling and the universal bound

    CERN Document Server

    Kharzeev, D E

    2008-01-01

    The apparent universality of jet quenching observed in heavy ion collisions at RHIC for light and heavy quarks, as well as for quarks and gluons, is very puzzling and calls for a theoretical explanation. Recently it has been proposed that the synchrotron--like radiation at strong coupling gives rise to a universal bound on the energy of a parton escaping from the medium. Since this bound appears quite low, almost all of the observed particles at high transverse momentum have to originate from the surface of the hot fireball. Here I make a first attempt of checking this scenario against the RHIC data and formulate a "Universal Bound Model" of jet quenching that can be further tested at RHIC and LHC.

  4. 40 CFR 721.2088 - Carboxylic acids, (C6-C9) branched and linear.

    Science.gov (United States)

    2010-07-01

    ... 40 Protection of Environment 30 2010-07-01 2010-07-01 false Carboxylic acids, (C6-C9) branched and... Specific Chemical Substances § 721.2088 Carboxylic acids, (C6-C9) branched and linear. (a) Chemical... as carboxylic acids, (C6-C9) branched and linear (PMNs P-93-313, 314, 315, and 316) are subject...

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

  6. Dissolution and Fractionation of Calcium—Bound and Iron—and Aluminum—Bound Humus in Soils

    Institute of Scientific and Technical Information of China (English)

    XUJIAN-MING; YUANKE-NENG

    1993-01-01

    This paper deals with the development of a sequential extraction method to separate the Ca-bound and Fe-and Al-bound humus from soils.First,comparative analyses were carried out on dissolution of synthetic organo-mineral complexes by different extractants,i.e.0.1M Na4P2O7,0.1M NaOH+0.1M Na4P2O7 mixture,0.1M NaOH,0.5M (NaPO3)6 and 0.5M neutral Na2SO4.Among the five extractants,0.1M NaOH+0.1M Na4P2O7 mixture was the most efficient in extracting humus from various complexes.0.5M Na2SO4 had a better specificity to Ca than 0.5M (NaPO3)6,by only extracting Ca-bound humus without destorying Fe-and Al-bound organo-mineral complexes.Then sequential extractions first with 0.5M Na2SO4 and then with 0.1M NaOH+0.1M Na4P2O7 mixture were applied to a series of soil samples with different degrees of base saturation.The cations were dominated by Ca in the 0.5M Na2SO4 extract and by Al in the 0.1M NaOH+0.1M Na4P2O7 mixture.The sequential extraction method can efficiently separate or isolate Ca-bound and Fe-and Al-bound humus from each other.

  7. A Methodology for Implementing Clinical Algorithms Using Expert-System and Database Tools

    OpenAIRE

    Rucker, Donald W.; Shortliffe, Edward H.

    1989-01-01

    The HyperLipid Advisory System is a combination of an expert system and a database that uses an augmented transition network methodology for implementing clinical algorithms. These algorithms exist as tables from which the separate expert-system rule base sequentially extracts the steps in the algorithm. The rule base assumes that the algorithm has a binary branching structure and models episodes of clinical care, but otherwise makes no assumption regarding the specific clinical domain. Hyper...

  8. Soft bounds on diffusion produce skewed distributions and Gompertz growth

    Science.gov (United States)

    Mandrà, Salvatore; Lagomarsino, Marco Cosentino; Gherardi, Marco

    2014-09-01

    Constraints can affect dramatically the behavior of diffusion processes. Recently, we analyzed a natural and a technological system and reported that they perform diffusion-like discrete steps displaying a peculiar constraint, whereby the increments of the diffusing variable are subject to configuration-dependent bounds. This work explores theoretically some of the revealing landmarks of such phenomenology, termed "soft bound." At long times, the system reaches a steady state irreversibly (i.e., violating detailed balance), characterized by a skewed "shoulder" in the density distribution, and by a net local probability flux, which has entropic origin. The largest point in the support of the distribution follows a saturating dynamics, expressed by the Gompertz law, in line with empirical observations. Finally, we propose a generic allometric scaling for the origin of soft bounds. These findings shed light on the impact on a system of such "scaling" constraint and on its possible generating mechanisms.

  9. Adaptive path planning: Algorithm and analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Pang C.

    1993-03-01

    Path planning has to be fast to support real-time robot programming. Unfortunately, current planning techniques are still too slow to be effective, as they often require several minutes, if not hours of computation. To alleviate this problem, we present a learning algorithm that uses past experience to enhance future performance. The algorithm relies on an existing path planner to provide solutions to difficult tasks. From these solutions, an evolving sparse network of useful subgoals is learned to support faster planning. The algorithm is suitable for both stationary and incrementally-changing environments. To analyze our algorithm, we use a previously developed stochastic model that quantifies experience utility. Using this model, we characterize the situations in which the adaptive planner is useful, and provide quantitative bounds to predict its behavior. The results are demonstrated with problems in manipulator planning. Our algorithm and analysis are sufficiently general that they may also be applied to task planning or other planning domains in which experience is useful.

  10. Quantum Algorithms for Finding Claws, Collisions and Triangles

    CERN Document Server

    Buhrman, H; Hoyer, P; Magniez, F; Santha, M; De Wolf, R; Buhrman, Harry; Durr, Christoph; Hoyer, Peter; Magniez, Frederic; Santha, Miklos; Wolf, Ronald de

    2000-01-01

    We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Hoyer, and Tapp, and imply an N^{3/4} log(N) quantum upper bound for the element distinctness problem (contrasting with N\\log(N) classical complexity). We also give an algorithm to finding a triangle in a graph more efficiently than classically.

  11. 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......-modification, countering barrelling effects through vertical stretching, and tracking of targets of interest....

  12. Synthesis, Characterization, and Flocculation Properties of Branched Cationic Polyacrylamide

    Directory of Open Access Journals (Sweden)

    Weimin Sun

    2013-01-01

    Full Text Available A water soluble branched cationic polyacrylamide (BCPAM was synthesized using solution polymerization. The polymerization was initiated using potassium diperiodatocuprate, K5[Cu(HIO62](Cu(III, initiating the self-condensing vinyl copolymerization of acrylamide and acryloxyethyltrimethyl ammonium chloride (DAC monomer. The resulting copolymer was characterized by the use of Fourier-transform infrared (FTIR spectroscopy and nuclear magnetic resonance (NMR spectroscopy. Its flocculation properties were evaluated with standard jar tests of sewage. The effects of initiator concentration, monomer concentration, reaction temperature, and the mass ratio of monomers on intrinsic viscosity and flocculation properties of the product were determined using single-factor experiments and orthogonal experiment.

  13. Properties of Super-Poisson Processes and Super-Random Walks with Spatially Dependent Branching Rates

    Institute of Scientific and Technical Information of China (English)

    Yan Xia REN

    2008-01-01

    The global supports of super-Poisson processes and super-random walks with a branching mechanism ψ(z)=z2 and constant branching rate are known to be noncompact. It turns out that, for any spatially dependent branching rate, this property remains true. However, the asymptotic extinction property for these two kinds of superprocesses depends on the decay rate of the branching-rate function at infinity.

  14. Tightened Exponential Bounds for Discrete-Time Conditionally Symmetric Martingales and Applications

    CERN Document Server

    Sason, Igal

    2012-01-01

    This paper revisits the derivation of some exponential bounds for discrete-time and real-valued martingales with bounded jumps in order to improve these bounds for conditionally symmetric martingales. The new bounds are extended to conditionally symmetric sub or super-martingales, and they are also considered in connection to some previously reported bounds in the literature. Two applications of these bounds are exemplified in the context of gambling, and the number of up-crossings of a super-martingale.

  15. Lower Bounds on Implementing Robust and Resilient Mediators

    CERN Document Server

    Abraham, Ittai; Halpern, Joseph Y

    2007-01-01

    We consider games that have (k,t)-robust equilibria when played with a mediator, where an equilibrium is (k,t)-robust if it tolerates deviations by coalitions of size up to k and deviations by up to $t$ players with unknown utilities. We prove lower bounds that match upper bounds on the ability to implement such mediators using cheap talk (that is, just allowing communication among the players). The bounds depend on (a) the relationship between k, t, and n, the total number of players in the system; (b) whether players know the exact utilities of other players; (c) whether there are broadcast channels or just point-to-point channels; (d) whether cryptography is available; and (e) whether the game has a $k+t)-punishment strategy; that is, a strategy that, if used by all but at most $k+t$ players, guarantees that every player gets a worse outcome than they do with the equilibrium strategy.

  16. Research on Power Line as Communication Channel with Multi-Tap and Multi-Branch Configuration

    Directory of Open Access Journals (Sweden)

    Yanhua Zheng

    2013-12-01

    Full Text Available To study the effect of different branch configuration on transmission characteristic in-home low-voltage (LV communication power line communication (PLC channel, the influences of branch length, number of branch and tap, and branch terminal impedance on the performance of PLC are investigated. The two type power line network structures of the one-tap with multi-branch (OTMB and the multi-tap with multi-branch (MTMB are studied. The transmission characteristics of the PLC channel are simulated by varying the length and terminal impedance of the branch for two configurations. Simulation results show that the length and terminal impedance of the branch have significant influence on the amplitude and phase response of the transfer function. The position and number of notches and crests in the amplitude responses are affected by different branch types and the configurations of branch length and branch terminal impedance. The models developed in this paper can easily handle an arbitrary topology of power line channel and provide accurate calculation for the channel responses of the all kinds of channel branch structures in indoor LV power line network

  17. Hilbert series and mixed branches of $T[SU(N)]$ theory

    CERN Document Server

    Carta, Federico

    2016-01-01

    We consider mixed branches of 3d $\\mathcal{N}=4$ $T[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.

  18. Flow Equations for N Point Functions and Bound States

    CERN Document Server

    Ellwanger, Ulrich

    1994-01-01

    We discuss the exact renormalization group or flow equation for the effective action and its decomposition into one particle irreducible N point functions. With the help of a truncated flow equation for the four point function we study the bound state problem for scalar fields. A combination of analytic and numerical methods is proposed, which is applied to the Wick-Cutkosky model and a QCD-motivated interaction. We present results for the bound state masses and the Bethe-Salpeter wave function. (Figs. 1-4 attached as separate uuencoded post-script files.)

  19. Stability and response bounds of non-conservative linear systems

    DEFF Research Database (Denmark)

    Kliem, Wolfhard; Pommer, Christian

    2004-01-01

    This paper develops a stability theorem and response bounds for non-conservative systems of the form MX + (D + G)x + (K + N)x = f(t), with hermitian positive-definite matrices M, D and K, and skew-hermitian matrices G and N. To this end, we first find a Lyapunov function by solving the Lyapunov...... matrix equation. Then, if a system satisfies the condition of the stability theorem, the associated Lyapunov function can be used to obtain response bounds for the norms as well as for the individual coordinates of the solution. Examples from rotor dynamics illustrate the results....

  20. Lyapunov Exponents for Branching Processes in a Random Environment: The Effect of Information

    Science.gov (United States)

    Hautphenne, Sophie; Latouche, Guy

    2016-04-01

    We consider multitype branching processes evolving in a Markovian random environment. To determine whether or not the branching process becomes extinct almost surely is akin to computing the maximal Lyapunov exponent of a sequence of random matrices, which is a notoriously difficult problem. We define Markov chains associated to the branching process, and we construct bounds for the Lyapunov exponent. The bounds are obtained by adding or by removing information: to add information results in a lower bound, to remove information results in an upper bound, and we show that adding less information improves the lower bound. We give a few illustrative examples and we observe that the upper bound is generally more accurate than the lower bounds.

  1. 31 CFR 359.71 - What is the role of Federal Reserve Banks and Branches?

    Science.gov (United States)

    2010-07-01

    ... UNITED STATES SAVINGS BONDS, SERIES I Miscellaneous Provisions § 359.71 What is the role of Federal Reserve Banks and Branches? (a) Federal Reserve Banks and Branches are fiscal agents of the United States... Federal Reserve Bank, Buffalo Branch, 160 Delaware Avenue, Buffalo, NY 14202 New York, Boston...

  2. 31 CFR 351.86 - What is the role of Federal Reserve Banks and Branches?

    Science.gov (United States)

    2010-07-01

    ... UNITED STATES SAVINGS BONDS, SERIES EE Miscellaneous Provisions § 351.86 What is the role of Federal Reserve Banks and Branches? (a) Federal Reserve Banks and Branches are fiscal agents of the United States... Federal Reserve Bank, Buffalo Branch, 160 Delaware Avenue, Buffalo, NY 14202 New York, Boston...

  3. THE EXISTENCE AND MOMENTS OF CANONICAL BRANCHING CHAIN IN RANDOM ENVIRONMENT

    Institute of Scientific and Technical Information of China (English)

    胡迪鹤

    2004-01-01

    The concepts of branching chain in random environmnet and canonical branching chain in random environment axe introduced. Moreover the existence of these chains is proved. Finally the exact formulas of mathematical expectation and variance of branching chain in random environment axe also given.

  4. Measure Estimates, Harnack Inequalities and Ricci Lower Bound

    CERN Document Server

    Wang, Yu

    2011-01-01

    On a Riemannian metric-measure space, we establish an Alexandrov-Bakelman-Pucci type measure estimate connecting Bakry-\\'Emery Ricci curvature lower bound, modified Laplacian and the measure of certain special sets. We apply this estimate to prove Harnack inequalities for the modified Laplacian operator and fully non-linear operators. These inequalities seem not available in the literature; And our proof, solely based on the ABP estimate, does not involve any Sobolev inequalities nor gradient estimate. We also propose a question regarding the characterization of Ricci lower bound by the Harnack inequality.

  5. Bound and continuum vibrational states of the bifluoride anion

    Science.gov (United States)

    Špirko, V.; Šindelka, M.; Shirsat, R. N.; Leszczynski, J.

    2003-07-01

    The energies of the bound vibrational states and energy density spectra of the continuum vibrational states of FHF - are calculated, 'exactly' and 'adiabatically', using a new ab initio (CCSD(T)) potential energy surface. Statistical properties of the bound states are probed in terms of the density of states and nearest neighbor level spacing distributions (NNSD). Importantly, the approximate 'adiabatic' densities coincide nearly quantitatively with their 'exact' counterparts. A quantitative fitting of the NNSDs is achieved with a new empirical modification of the Wigner distribution.

  6. Public Relations as Scientific Branch of Information and Communication Sciences

    Directory of Open Access Journals (Sweden)

    Hrvoje Jakopović

    2012-06-01

    Full Text Available Given that the field of information and communication sciences is a young field in the social sciences, it is important to consider how technology impacts the development of this field. This is especially relevant when looking at the area of public relations. Amid changing technological developments public relations is constantly being redefined in this complex environment. This work focuses on the development of public relations as a branch of study in the field of information and communication sciences. I review the scientific methods used to evaluate the influence and effects of public relations, while discussing the different methodological approaches.

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

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

  9. Opposite Degree Algorithm and Its Applications

    OpenAIRE

    Xiao-Guang Yue

    2015-01-01

    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.

  10. Genetic Algorithm for Optimization: Preprocessor and Algorithm

    Science.gov (United States)

    Sen, S. K.; Shaykhian, Gholam A.

    2006-01-01

    Genetic algorithm (GA) inspired by Darwin's theory of evolution and employed to solve optimization problems - unconstrained or constrained - uses an evolutionary process. A GA has several parameters such the population size, search space, crossover and mutation probabilities, and fitness criterion. These parameters are not universally known/determined a priori for all problems. Depending on the problem at hand, these parameters need to be decided such that the resulting GA performs the best. We present here a preprocessor that achieves just that, i.e., it determines, for a specified problem, the foregoing parameters so that the consequent GA is a best for the problem. We stress also the need for such a preprocessor both for quality (error) and for cost (complexity) to produce the solution. The preprocessor includes, as its first step, making use of all the information such as that of nature/character of the function/system, search space, physical/laboratory experimentation (if already done/available), and the physical environment. It also includes the information that can be generated through any means - deterministic/nondeterministic/graphics. Instead of attempting a solution of the problem straightway through a GA without having/using the information/knowledge of the character of the system, we would do consciously a much better job of producing a solution by using the information generated/created in the very first step of the preprocessor. We, therefore, unstintingly advocate the use of a preprocessor to solve a real-world optimization problem including NP-complete ones before using the statistically most appropriate GA. We also include such a GA for unconstrained function optimization problems.

  11. Bogoliubov Excited States and the Lyth Bound

    CERN Document Server

    Aravind, Aditya; Paban, Sonia

    2014-01-01

    We show that Bogoliubov excited scalar and tensor modes do not alleviate Planckian evolution during inflation if one assumes that $r$ and the Bogoliubov coefficients are approximately scale invariant. We constrain the excitation parameter for the scalar fluctuations, $\\beta$, and tensor perturbations, $\\tilde{\\beta}$, by requiring that there be at least three decades of scale invariance in the scalar and tensor power spectrum. For the scalar fluctuations this is motivated by the observed nearly scale invariant scalar power spectrum. For the tensor fluctuations this assumption may be shown to be valid or invalid by future experiments.

  12. Resource-Bounded Information Acquisition and Learning

    Science.gov (United States)

    2012-05-01

    45] apply the theory of value of information, but their method is mostly restricted to chain graphical models. Golovin et al. [33] tackle the problem...for information acquisition from large and redundant data. Tech. Rep. arXiv:1012.3502, Dec 2010. [33] Golovin , Daniel, Krause, Andreas, and Ray

  13. Size-change Termination and Bound Analysis

    DEFF Research Database (Denmark)

    Avery, James Emil

    2006-01-01

    Despite its simplicity, the size-change termination principle, presented by Lee, Jones and Ben-Amram in [LJB01], is surprisingly strong and is able to show termination for a large class of programs. A significant limitation for its use, however, is the fact that the SCT requires data types...

  14. Coupling limit order books and branching random walks

    OpenAIRE

    2014-01-01

    We consider a model for a one-sided limit order book proposed by Lakner, Reed and Stoikov (2013). We show that it can be coupled with a branching random walk and use this coupling to answer a nontrivial question about the long-term behavior of the price. The coupling relies on a classical idea of enriching the state space by artificially creating a filiation, in this context between orders of the book, which we believe has the potential of being useful for a broader class of...

  15. Hardness measures and resolution lower bounds

    OpenAIRE

    Beyersdorff, Olaf; Kullmann, Oliver

    2013-01-01

    Various "hardness" measures have been studied for resolution, providing theoretical insight into the proof complexity of resolution and its fragments, as well as explanations for the hardness of instances in SAT solving. In this report we aim at a unified view of a number of hardness measures, including different measures of width, space and size of resolution proofs. We also extend these measures to all clause-sets (possibly satisfiable).

  16. Decoding Cyclic Codes up to a New Bound on the Minimum Distance

    CERN Document Server

    Zeh, Alexander; Bezzateev, Sergey

    2011-01-01

    A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special cases of our bound. For some classes of codes the bound on the minimum distance is refined. Furthermore, a quadratic-time decoding algorithm up to this new bound is developed. The determination of the error locations is based on the Euclidean Algorithm and a modified Chien search. The error evaluation is done by solving a generalization of Forney's formula.

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

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

  19. Upper bounds for parabolic equations and the Landau equation

    Science.gov (United States)

    Silvestre, Luis

    2017-02-01

    We consider a parabolic equation in nondivergence form, defined in the full space [ 0 , ∞) ×Rd, with a power nonlinearity as the right-hand side. We obtain an upper bound for the solution in terms of a weighted control in Lp. This upper bound is applied to the homogeneous Landau equation with moderately soft potentials. We obtain an estimate in L∞ (Rd) for the solution of the Landau equation, for positive time, which depends only on the mass, energy and entropy of the initial data.

  20. Sharp Upper and Lower Bounds for the Laplacian Spectral Radius and the Spectral Radius of Graphs

    Institute of Scientific and Technical Information of China (English)

    Ji-ming Guo

    2008-01-01

    In this paper, sharp upper bounds for the Laplacian spectral radius and the spectral radius of graphs are given, respectively. We show that some known bounds can be obtained from our bounds. For a bipartite graph G, we also present sharp lower bounds for the Laplacian spectral radius and the spectral radius,respectively.

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

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

  3. EQUILIBRIUM PROBLEMS WITH LOWER AND UPPER BOUNDS IN TOPOLOGICAL SPACES

    Institute of Scientific and Technical Information of China (English)

    Ding Xieping

    2005-01-01

    By employing a fixed point theorem due to Ding, Park and Jung, some existence theorems of solutions for equilibrium problems with lower and upper bounds are proved in noncompact topological spaces. These results further answer the open problem raised by Isac, Sehgal and Singh under much weaker assumptions.

  4. Uniqueness and existence for bounded boundary value problems

    NARCIS (Netherlands)

    Ehme, J.; Lanz, A.

    2006-01-01

    The existence and uniqueness of solutions for the boundary value problems with general linear point evaluation boundary conditions is established. We assume that f is bounded and that there is uniqueness on a homogeneous problem and on the linear variational problems. (c) 2005 Elsevier Inc. All righ

  5. Narrow deeply bound K- and p atomic states

    Science.gov (United States)

    Friedman, E.; Gal, A.

    2000-01-01

    Examples of recently predicted narrow `deeply bound' K- and p atomic states are shown. The saturation of widths for strong absorptive potentials due to the induced repulsion, and the resulting suppression of atomic wave functions within the nucleus, are demonstrated. Production reactions for K- atomic states using φ(1020) decay, and the (p,p) reaction for p atomic states, are discussed.

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

  7. Formation of Anodic Aluminum Oxide with Branched and Meshed Pores.

    Science.gov (United States)

    Kim, Byeol; Lee, Jin Seok

    2016-06-01

    Anodic aluminum oxide (AAO), with a self-ordered hexagonal array, is important for various applications in nanofabrication including as the fabrication of nanotemplates and other nanostructures. With the consideration, there have been many efforts to control the characteristic parameters of porous anodic alumina by adjustment of the anodizing conditions such as the electrolyte, temperature, applied potential, and Al purity. In particular, impurities in Al are changing the morphology of an alumina film; however, the formation mechanism has not yet been explained. In this work, we anodized a high purity (99.999%, Al(high)) and low purity (99.8%, Al(low)) aluminum foil by a two-step anodization process in an oxalic acid solution or phosphoric acid. It was found that the purity of aluminum foil has influenced the morphology of the alumina film resulting in branched and meshed pores. Also, electrochemical analysis indicated that the branched and meshed pores in the low-purity Al foil formed by the presence of impurities. Impurities act as defects and change the general growth mechanism for pore formation by inducing an electric field imbalance during anodization. This work contributes to the research field of topographical chemistry and applied fields including nanofabrication.

  8. 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-p...... or the size of the LPs that are actually solved. Computational results on benchmark instances from the OR-Library show very signicant improvements over previous algorithms. Several open instances could be solved to optimality....

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

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

  10. An extracellular adhesion molecule complex patterns dendritic branching and morphogenesis.

    Science.gov (United States)

    Dong, Xintong; Liu, Oliver W; Howell, Audrey S; Shen, Kang

    2013-10-10

    Robust dendrite morphogenesis is a critical step in the development of reproducible neural circuits. However, little is known about the extracellular cues that pattern complex dendrite morphologies. In the model nematode Caenorhabditis elegans, the sensory neuron PVD establishes stereotypical, highly branched dendrite morphology. Here, we report the identification of a tripartite ligand-receptor complex of membrane adhesion molecules that is both necessary and sufficient to instruct spatially restricted growth and branching of PVD dendrites. The ligand complex SAX-7/L1CAM and MNR-1 function at defined locations in the surrounding hypodermal tissue, whereas DMA-1 acts as the cognate receptor on PVD. Mutations in this complex lead to dramatic defects in the formation, stabilization, and organization of the dendritic arbor. Ectopic expression of SAX-7 and MNR-1 generates a predictable, unnaturally patterned dendritic tree in a DMA-1-dependent manner. Both in vivo and in vitro experiments indicate that all three molecules are needed for interaction.

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

  12. Towards flavored bound states beyond rainbows and ladders

    CERN Document Server

    El-Bennich, B; Paracha, M A; de Melo, J P B C

    2013-01-01

    We give a snapshot of recent progress in solving the Dyson-Schwinger equation with a beyond rainbow-ladder ansatz for the dressed quark-gluon vertex which includes ghost contributions. We discuss the motivations for this approach with regard to heavy-flavored bound states and form factors and briefly describe future steps to be taken.

  13. INFLUENCES OF MOLECULAR WEIGHT AND BRANCHING PARAMETER OF LACQUER POLYSACCHARIDE ON THE GROWTH OF LEUCOCYTES

    Institute of Scientific and Technical Information of China (English)

    ZHANG Lina; DING Qiong

    1995-01-01

    A method of determining branching parameter of lacquer polysaccharide was established by acid-base back-titration of terminal uronic acid of branches. The branching factors obtained are in agreement with the values determined by colorimetric method with carbazole and the results estimated by using Zimm-Stockmayer equation from viscosity data. Influences of molecular weights and branching factors of five fractions of lacquer polysaccharide on the bioactivities were studied. The results show that the polysaccharides have bioactivities in motivating the growth of leucocytes, and the effect increases with the decrease of molecular weight and branching factor in the range studied(17×104>Mw>4×104).

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

  15. WW cross section and branching fraction measurements at LEP

    CERN Document Server

    Malgeri, L

    1999-01-01

    In two years of running at energies above WW production threshold, LEP-II provided each experiment an integrated luminosity of ~80 pb /sup -1/ until the end of 1997. The amount of collected events, ~1000 /experiment, allows to measure with high precision the total e/sup + /e/sup -/ to WW cross section: sigma /sub WW/( square root s=182.7 Ge V)=15.89+or-0.40 pb and the W-boson decay branching fractions: BR(W to qq)=68.79+or-0.77% and BR(W to l nu /sub l/)=10.40+or-0.26%, both in good agreement with Standard Model expectations. The W decay branching fractions and the total WW cross section are also used to extract a value for the Cabibbo-Kobayashi-Mas kawa matrix element V /sub cs/ and to put stringent limits on the invisible W width, Gamma /sub W//sup in upsilon /. A preliminary and incomplete look at the first data of this year, which is foreseen to increase the available statistics by four times, is also herein presented. (14 refs).

  16. Computational rationality: linking mechanism and behavior through bounded utility maximization.

    Science.gov (United States)

    Lewis, Richard L; Howes, Andrew; Singh, Satinder

    2014-04-01

    We propose a framework for including information-processing bounds in rational analyses. It is an application of bounded optimality (Russell & Subramanian, 1995) to the challenges of developing theories of mechanism and behavior. The framework is based on the idea that behaviors are generated by cognitive mechanisms that are adapted to the structure of not only the environment but also the mind and brain itself. We call the framework computational rationality to emphasize the incorporation of computational mechanism into the definition of rational action. Theories are specified as optimal program problems, defined by an adaptation environment, a bounded machine, and a utility function. Such theories yield different classes of explanation, depending on the extent to which they emphasize adaptation to bounds, and adaptation to some ecology that differs from the immediate local environment. We illustrate this variation with examples from three domains: visual attention in a linguistic task, manual response ordering, and reasoning. We explore the relation of this framework to existing "levels" approaches to explanation, and to other optimality-based modeling approaches.

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

  18. Improved Collision Detection Algorithm Based on Axis- Aligned Bounding Box%基于改进轴向包围盒的碰撞检测算法

    Institute of Scientific and Technical Information of China (English)

    孙毅刚; 段晓晔; 张红颖

    2011-01-01

    Airport emergency rescue is an important field of civil aviation, and the emergency rescue in the virtual scene can save resources largely.In order to improve the authenticity and accuracy of collision detection in the virtual scene, this paper proposed a collision deteetion algorithm based on feature - triangle.By adding the feature elements of vertex, edges and face in the triangle, feature -triangle was formed to solve the issue of queries in the triangulated model; then axis - aligned bounding box combined with feature - triangle was used to complete collision detection,and accurate intersection calculation was performed in the final stage of the algorithm to provide more collision informarion for the collision response.Experimental results show that the proposed algorithm can save time and has better performance.%研究机场应急救援是民航领域的问题.为防止机场地面车辆拥堵,要求在虚拟场景下的应急演练可全方位测试系统.为增强虚拟演练场景中碰撞检测的真实性与精确性,提出了一种基于特征三角形的碰撞检测算法.在基于三角形的模型中,通过在三角形中添加特征元素(点、边、面)形成特征三角形,利用特征三角形可以有效解决重复查询;通过轴向包围盒结合特征三角形,更好地完成碰撞检测,最后进行精确求交计算,为碰撞响应提供更多的碰撞信息.实验结果表明,算法可以缩短计算时间,提高检测精度,具有实际指导价值.

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

  20. In-medium K̄ interactions and bound states

    Directory of Open Access Journals (Sweden)

    Gal Avraham

    2014-01-01

    Full Text Available Correct treatment of subthreshold K̄ N dynamics is mandatory in K− -atom and K̄ -nuclear bound-state calculations, as demonstrated by using in-medium chirally-based models of K̄ N interactions. Recent studies of kaonic atom data reveal appreciable multi-nucleon contributions. K̄ -nuclear widths larger than 50 MeV are anticipated.

  1. Neutrino Bounds on Astrophysical Sources and New Physics

    CERN Document Server

    Anchordoqui, L A; Goldberg, H; Shapere, A D; Anchordoqui, Luis A.; Feng, Jonathan L; Goldberg, Haim; Shapere, Alfred D.

    2002-01-01

    Ultra-high energy cosmic neutrinos are incisive probes of both astrophysical sources and new TeV-scale physics. Such neutrinos would create extensive air showers deep in the atmosphere. The absence of such showers implies upper limits on incoming neutrino fluxes and cross sections. Combining the exposures of AGASA, the largest existing ground array, with the exposure of the Fly's Eye fluorescence detector integrated over all its operating epochs, we derive 95% CL bounds that substantially improve existing limits. We begin with model-independent bounds on astrophysical fluxes, assuming standard model cross sections, and model-independent bounds on new physics cross sections, assuming a conservative cosmogenic flux. We then derive model-dependent constraints on new components of neutrino flux for several assumed power spectra, and we update bounds on the fundamental Planck scale M_D in extra dimension scenarios from black hole production. For large numbers of extra dimensions, we find M_D > 2.0 (1.1) TeV for \\m...

  2. Key management and encryption under the bounded storage model.

    Energy Technology Data Exchange (ETDEWEB)

    Draelos, Timothy John; Neumann, William Douglas; Lanzone, Andrew J.; Anderson, William Erik

    2005-11-01

    There are several engineering obstacles that need to be solved before key management and encryption under the bounded storage model can be realized. One of the critical obstacles hindering its adoption is the construction of a scheme that achieves reliable communication in the event that timing synchronization errors occur. One of the main accomplishments of this project was the development of a new scheme that solves this problem. We show in general that there exist message encoding techniques under the bounded storage model that provide an arbitrarily small probability of transmission error. We compute the maximum capacity of this channel using the unsynchronized key-expansion as side-channel information at the decoder and provide tight lower bounds for a particular class of key-expansion functions that are pseudo-invariant to timing errors. Using our results in combination with Dziembowski et al. [11] encryption scheme we can construct a scheme that solves the timing synchronization error problem. In addition to this work we conducted a detailed case study of current and future storage technologies. We analyzed the cost, capacity, and storage data rate of various technologies, so that precise security parameters can be developed for bounded storage encryption schemes. This will provide an invaluable tool for developing these schemes in practice.

  3. Rigorous bounds on aerosol optical properties from measurement and/or model constraints

    Science.gov (United States)

    McGraw, Robert; Fierce, Laura

    2016-04-01

    Sparse-particle aerosol models are an attractive alternative to sectional and modal methods for representation of complex, generally mixed particle populations. In the quadrature method of moments (QMOM) a small set of abscissas and weights, determined from distributional moments, provides the sparse set. Linear programming (LP) yields a generalization of the QMOM that is especially convenient for sparse particle selection. In this paper we use LP to obtain rigorous, nested upper and lower bounds to aerosol optical properties in terms of a prescribed Bayesian-like sequence of model or simulated measurement constraints. Examples of such constraints include remotely-sensed light extinction at different wavelengths, modeled particulate mass, etc. Successive reduction in bound separation with each added constraint provides a quantitative measure of its contextual information content. The present study is focused on univariate populations as a first step towards development of new simulation algorithms for tracking the physical and optical properties of multivariate particle populations.

  4. Speed of sound bounds and neutron star structure

    CERN Document Server

    Moustakidis, Ch C; Margaritis, Ch; Lalazissis, G A

    2016-01-01

    The accurate determination of the maximum mass of the neutron stars is one of the most important tasks in Astrophysics. It is directly related with the identification of the black holes in the Universe, the production of neutron stars from the supernovae explosion and the Equation of State (EoS) of dense matter. However, not only the EoS is directly connected with neutron star masses, but also the speed of sound in dense matter is a crucial quantity which characterizes the stiffness of the EoS. The upper bound of the speed of sound imposes strong constraints on the maximum mass of neutron stars. However, this upper bound remains still an open issue. Recent observations, of binary neutron star systems, offer the possibility to measure with high accuracy both the mass and the tidal polarizability of the stars. We study possible effects of the upper bound of the speed of sound on the upper bound of the mass and the tidal polarizability. We conclude that this kind of measurements, combined with recent observation...

  5. Engineering the Divide-and-Conquer Closest Pair Algorithm

    Institute of Scientific and Technical Information of China (English)

    Ming-hui Jiang; Joel gillespie

    2007-01-01

    We improve the famous divide-and-conquer algorithm by Bentley and Shamos for the planar closest-pair problem. For n points on the plane, our algorithm keeps the optimal O(n log n) time complexity and, using a circle-packing property, computes at most 7n/2 Euclidean distances, which improves Ge et al.'s bound of (3n log n)/2 Euclidean distances. We present experimental results of our comparative studies on four different versions of the divide-and-conquer closest pair algorithm and propose two effective heuristics.

  6. Tau reconstruction and identification algorithm

    Indian Academy of Sciences (India)

    Raman Khurana

    2012-11-01

    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 measuring identification efficiency and misidentification rates from electrons, muons and hadronic jets. These algorithms enable extended reach for the searches for MSSM Higgs, and other exotic particles.

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

  8. Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning

    NARCIS (Netherlands)

    Dimitrakakis, C.; Filipe, J.; Fred, A.; Sharp, B.

    2010-01-01

    There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most problems of interest, the optimal solution involves planning in an infinitely large tree. However, it is possible to ob

  9. Complexity of stochastic branch and bound for belief tree search in Bayesian reinforcement learning

    NARCIS (Netherlands)

    Dimitrakakis, C.

    2009-01-01

    There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most problems of interest, the optimal solution involves planning in an infinitely large tree. However, it is possible to ob

  10. Scheduling Packets with Values and Deadlines in Size-bounded Buffers

    CERN Document Server

    Li, Fei

    2010-01-01

    Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm has been provided for this model (Azar and Levy. SWAT 2006), but no offline algorithms have been known yet. In this paper, We study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature. Thes...

  11. Constructions of hamiltonian graphs with bounded degree and diameter O (log n)

    CERN Document Server

    c, Aleksandar Ili\\'

    2011-01-01

    Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with $n$ vertices and maximum degree $\\Delta$ and diameter $O (\\log n)$, where $n$ is an arbitrary number. The number of edges is asymptotically bounded by $(2 - \\frac{1}{\\Delta - 1} - \\frac{(\\Delta - 2)^2}{(\\Delta - 1)^3}) n$. In particular, we construct a family of hamiltonian graphs with diameter at most $2 \\lfloor \\log_2 n \\rfloor$, maximum degree 3 and at most $1+11n/8$ edges.

  12. Structure and Hydration of Highly Branched, Monodisperse Phytoglycogen Nanoparticles

    Science.gov (United States)

    Atkinson, John; Nickels, Jonathan; Stanley, Christopher; Diallo, Souleymane; Katsaras, John; Dutcher, John

    Monodisperse phytoglycogen nanoparticles are a promising, new soft colloidal nanomaterial with many applications in the personal care, food, nutraceutical and pharmaceutical industries. These applications rely on exceptional properties that emerge from the highly branched structure of phytoglycogen and its interaction with water, such as extraordinarily high water retention, and low viscosity and exceptional stability in water. The structure and hydration of the nanoparticles was characterized using small angle neutron scattering (SANS) and quasielastic neutron scattering (QENS). SANS allowed us to determine the size of the nanoparticles, evaluate their radial density profile, quantify the particle-to-particle spacing, and determine their water content. The results show clearly that the nanoparticles are highly hydrated, with each nanoparticle containing 250% of its mass in water, and that aqueous dispersions approach a jamming transition at ~ 25% (w/w). QENS experiments provided an independent and consistent measure of the high level of hydration of the particles.

  13. Side Branch Interaction with Main Line Standing Waves and Related Signal Handling Approaches

    Directory of Open Access Journals (Sweden)

    Arthur Ruggles

    2013-01-01

    Full Text Available Data from a low pressure air test facility are used to quantify the influence of the acoustic field in the main line on side branch resonance behavior. The main line of diameter = 7.6 cm may accumulate acoustic energy broadcast from a resonating branch of diameter = 1.9 cm ( = 0.25. The side branch resonance amplitude is a strong function of branch position along the main line with the normalized pressure rising to 1.2 in the most favorable branch positions with Strouhal number near 0.3. Large time variation of the side branch and main line resonance amplitude is apparent for most branch positions. A moving window is used on the time history to collect an array of power spectral densities (PSDs. Peak amplitude values from the PSD array are represented in a probability density function (PDF that provides a repeatable characterization of data from the system.

  14. On the Applicability of Lower Bounds for Solving Rectilinear

    DEFF Research Database (Denmark)

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

    1998-01-01

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

  15. P 6- and triangle-free graphs revisited: structure and bounded clique-width

    Directory of Open Access Journals (Sweden)

    Andreas Brandstädt

    2006-01-01

    Full Text Available The Maximum Weight Stable Set (MWS Problem is one of the fundamental problems on graphs. It is well-known to be NP-complete for triangle-free graphs, and Mosca has shown that it is solvable in polynomial time when restricted to P 6- and triangle-free graphs. We give a complete structure analysis of (nonbipartite P 6- and triangle-free graphs which are prime in the sense of modular decomposition. It turns out that the structure of these graphs is extremely simple implying bounded clique-width and thus, efficient algorithms exist for all problems expressible in terms of Monadic Second Order Logic with quantification only over vertex predicates. The problems Vertex Cover, MWS, Maximum Clique, Minimum Dominating Set, Steiner Tree, and Maximum Induced Matching are among them. Our results improve the previous one on the MWS problem by Mosca with respect to structure and time bound but also extends a previous result by Fouquet, Giakoumakis and Vanherpe which have shown that bipartite P 6-free graphs have bounded clique-width. Moreover, it covers a result by Randerath, Schiermeyer and Tewes on polynomial time 3-colorability of P 6- and triangle-free graphs.

  16. Cramer-Rao bound of joint estimation of target location and velocity for coherent MIMO radar

    Institute of Scientific and Technical Information of China (English)

    Peilin Sun; Jun Tang; Shuang Wan

    2014-01-01

    The optimal estimation performance of target parame-ters is studied. First, the general form of Cramer-Rao bound (CRB) for joint estimation of target location and velocity is derived for co-herent multiple input multiple output (MIMO) radars. To gain some insight into the behavior of the CRB, the CRB with a set of given orthogonal waveforms is studied as a specific case. Second, a maximum likelihood (ML) estimation algorithm is proposed. The mean square error (MSE) of the ML estimation of target location and velocity is obtained by Monte Carlo simulation and it ap-proaches CRB in the high signal-to-noise ratio (SNR) region.

  17. Open string multi-branched and Kahler potentials

    CERN Document Server

    Carta, Federico; Staessens, Wieland; Zoccarato, Gianluca

    2016-01-01

    We consider type II string compactifications on Calabi-Yau orientifolds with fluxes and D-branes, and analyse the F-term scalar potential that simultaneously involves closed and open string modes. In type IIA models with D6-branes such potential can be directly computed by integrating out Minkowski three-forms. The result shows a multi-branched structure along the space of lifted open string moduli, in which discrete shifts in special Lagrangian and Wilson line deformations are compensated by changes in the RR flux quanta. The same sort of discrete shift symmetries are present in the superpotential and constrain the Kahler potential. As for the latter, inclusion of open string moduli breaks the factorisation between complex structure and Kahler moduli spaces. Nevertheless, the 4d Kahler metrics display a set of interesting relations that allow to rederive the scalar potential analytically. Similar results hold for type IIB flux compactifications with D7-brane Wilson lines.

  18. Branched chain amino acids requirements and metabolism in pigs

    DEFF Research Database (Denmark)

    Assadi Soumeh, Elham

    2015-01-01

    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...... reasons: first, BCAA share the same enzymes in their catabolic pathways, and there is an interaction among them in a way that excess Leu for example increases the catabolism of them all and changes the requirements. Second, BCAA are not only building blocks of protein biosynthesis, but are also involved...... in important regulatory mechanisms and biological functions, e.g. muscle protein synthesis, chronic diseases, neurotransmitter biosynthesis, and so on. Identifying biomarkers of the BCAA status may help to understand their biological effects. The objectives of the current study were first to estimate Ile, Val...

  19. Hamilton Model and Algorithm for Placing-in and Taking-out Wagon Problem on Branch-shaped Siding%树枝形专用线取送车问题哈密尔顿图模型及算法

    Institute of Scientific and Technical Information of China (English)

    郭垂江; 雷定猷

    2014-01-01

    Reasonable scheduling for placing-in and taking-out wagons in railway siding is of great significance to improve the operation efficiency of shunting locomotive and speeding up wagon’s turn-round. Under given conditions, taking the locomotive running time between sites as weights, the paper transforms the problem of placing-in (or taking-out) wagons into the shortest route problem of Hamilton graph and changed as assignment problem. The Hungarian algorithm is applied to calculate the optimal solution of the assignment problem. Then the lower bound or optimal solution of shortest route is obtained. If it is not a optimal solution, the broken-circle and connection method designed will be applied to find the satisfactory order of placing-in and taking-out wagons, and its computation complexity is O(n2). The paper simultaneously makes a deep discussion on other forms, such as placing-in and transferring combined, taking-out and transferring combined, placing-in and taking-out combined, placing-in-transferring and taking-out combined. Finally, an example is given to illustrate the model’s formulation and solution process. A large number of small cases also show that the algorithm’s average complexity and performance is relative superior.%合理安排铁路专用线取送车顺序,对提高调车机车作业效率、加速货车周转具有重要的意义。在已知条件下,以机车在装卸点间走行时间为权,把树枝形专用线取(送)车作业优化问题转换成哈密尔顿图最短路问题,并松弛为指派问题,采用匈牙利算法求出指派问题的最优解,可得到最短回路路长的下界或最优解。若未得到最优解,再利用破圈连接法求出满意的取(送)车顺序,此算法的复杂度为O(n2)。同时对送兼调移、取兼调移、取送结合、送调取结合作业形式进行了深入地讨论。最后举例说明了模型的构造及求解过程。大量小规模案例表明

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

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

  2. SILICA-SUPPORTED NICKEL AND ZIRCONIUM CATALYSTS FOR BRANCHED POLYETHYLENE

    Institute of Scientific and Technical Information of China (English)

    Ning Zhu; Yong Cui; Zi-long Li; Yong Chen; Wen-Hua Sun

    2003-01-01

    8-Aminoquinoline nickel dichloride and bis(cyclopentadienyl)zirconium dichloride (Cp2ZrC12) were supported simultaneously on silica to produce branched polyethylene successfully by combined polymerization. The supported polymerization results showed that the molecular weight of polyethylene increased while the molecular weight distribution became wider and the molecular chains of oligomers remaining in the final solution became shorter as compared to the oligomers obtained in polymerization processes with pure 8-aminoquinoline nickel dichloride catalysis, as well as the Cp2ZrC12 and nickel combination system. With decreasing amount of Ni catalyst in the supported catalyst, the molecular chains of oligomers in the resulting solution became shorter, while a-olefin selectivity increased.

  3. Bounded Community: Designing and facilitating learning communities in formal courses

    Directory of Open Access Journals (Sweden)

    Brent G. Wilson

    2004-11-01

    Full Text Available Learning communities can emerge spontaneously when people find common learning goals and pursue projects and tasks together in pursuit of those goals. Bounded learning communities (BLCs are groups that form within a structured teaching or training setting, typically a course. Unlike spontaneous communities, BLCs develop in direct response to guidance provided by an instructor, supported by a cumulative resource base. This article presents strategies that help learning communities develop within bounded frameworks, particularly online environments. Seven distinguishing features of learning communities are presented. When developing supports for BLCs, teachers should consider their developmental arc, from initial acquaintance and trust-building, through project work and skill development, and concluding with wind-down and dissolution of the community. Teachers contribute to BLCs by establishing a sense of teaching presence, including an atmosphere of trust and reciprocal concern. The article concludes with a discussion of assessment issues and the need for continuing research.

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

  5. Semileptonic branching fractions of charged and neutral B mesons

    CERN Document Server

    Athanas, M; Masek, G E; Paar, H P; Gronberg, J B; Kutschke, R; Menary, S R; 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, David G; Cho, H A; Coffman, D M; Crowcroft, D S; Drell, P S; Dumas, D J P; Ehrlich, R; Gaidarev, P B; García-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; Würthwein, F; Avery, P; Freyberger, A P; Rodríguez, 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 K; Davis, R; Hancock, N; Kelly, M S; Kotov, S A; Kravchenko, I V; Kwak, N; Lam, H; Kubota, Y; Lattery, M; Momayezi, M; Nelson, J K; Patton, S; Poling, R A; 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 L; Skovpen, Y; Sung, M; White, C; Zoeller, M M; Butler, F; Fu, X; Nemati, B; Ross, W R; Skubic, P L; 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 Pei Ning; Battle, M; Ernst, J; Gibbons, L K; Kwon, Y; Roberts, S; Thorndike, E H; Wang, C H; Dominick, J; Lambrecht, M; Sanghera, S; Shelkov, V; Skwarnicki, T; Stroynowski, R; Volobuev, I P; Wei, G; Zadorozhny, P; Artuso, M; Gao, M; Golberg, M; He, D; Horwitz, N; Kennett, R; Mountain, R; Moneti, G C; Muheim, F; Mukhin, Y; Playfer, S; Rozen, Y; Stone, S; Vasseur, G; Xing, X; Zhu, G; Bartelt, J; Csorna, S E; Egyed, Z; Jain, V; Gibaut, D; Kinoshita, K; Pomianowski, P A; Barish, B C; Chadha, M; Chan, S; Cowen, D F; Eigen, G; Miller, J S; O'Grady, C; Urheim, J; Weinstein, A J

    1994-01-01

    An examination of leptons in {\\Upsilon (4S)} events tagged by reconstructed B decays yields semileptonic branching fractions of b_-=(10.1 \\pm 1.8\\pm 1.4)\\% for charged and b_0=(10.9 \\pm 0.7\\pm 1.1)\\% for neutral B mesons. This is the first measurement for charged B. Assuming equality of the charged and neutral semileptonic widths, the ratio b_-/b_0=0.93 \\pm 0.18 \\pm 0.12 is equivalent to the ratio of lifetimes. A postscript version is available through World-Wide-Web in http://w4.lns.cornell.edu/publi c/CLNS/1994

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

  7. Randomized Algorithms for Matrices and Data

    Science.gov (United States)

    Mahoney, Michael W.

    2012-03-01

    often has an interpretation in terms of high degree nodes in data graphs, very small clusters in noisy data, coherence of information, articulation points between clusters, and so on. Historically, the first generation of randomized matrix algorithms (to be described in Section 29.3) did not gain a foothold in NLA and only heuristic variants of them were used in machine learning and data analysis applications. In the second generation of randomized matrix algorithms (to be described in Sections 29.4 and 29.5) that has led to high-quality numerical implementations and useful machine learning and data analysis applications, two key developments were crucial. - Decoupling the randomization from the linear algebra. This was originally implicit within the analysis of the second generation of randomized matrix algorithms, and then it was made explicit. By making this explicit, not only were improved quality of approximation bounds achieved, but also much finer control was achieved in the application of randomization. For example, it permitted easier exploitation of domain expertise, in both numerical analysis and data analysis applications. - Importance of statistical leverage scores. Although these scores have been used historically for outlier detection in statistical regression diagnostics, they have also been crucial in the recent development of randomized matrix algorithms. Roughly, the best random sampling algorithms use these scores to construct an importance sampling distribution to sample with respect to; while the best random projection algorithms rotate to a basis where these scores are approximately uniform and thus in which uniform sampling is appropriate.

  8. Geometric and spectral consequences of curvature bounds on tessellations

    OpenAIRE

    Keller, Matthias

    2016-01-01

    This is a chapter of a forthcoming Lecture Notes in Mathematics "Modern Approaches to Discrete Curvature" edited by L. Najman and P. Romon. It provides a survey on geometric and spectral consequences of curvature bounds. The geometric setting are tessellations of surfaces with finite and vanishing genus. We consider a curvature arising as an angular defect. Several of the results presented here have analogues in Riemannian geometry. In some cases one can go even beyond the Riemannian results ...

  9. total completion time with random and bounded setup times

    Directory of Open Access Journals (Sweden)

    Ali Allahverdi

    2003-01-01

    Full Text Available This paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT. Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are developed for the considered flowshops and an illustrative numerical example is given.

  10. Coding Bounds for Multiple Phased-Burst Correction and Single Burst Correction Codes

    CERN Document Server

    Fong, Wai Han

    2011-01-01

    In this paper, two upper bounds on the achievable code rate of linear block codes for multiple phased-burst correction (MPBC) are presented. One bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single burst correction (SBC), is shown to be the Abramson bound when the cyclic burst length is less than half the block length. The second MPBC bound is developed without the minimum error free gap constraint and is used as a comparison to the first bound.

  11. Angiographic Findings of Extrahepatic Branches Originating from Hepatic Artery and Its Clinical Significance

    Institute of Scientific and Technical Information of China (English)

    Xiao-dong Wang; Ren-jie Yang

    2009-01-01

    Objective: To observe the presentation and variation of extrahepatic branches originating from hepatic artery by hepatic arteriography.Methods: Hepatic arteriogram of 200 cases with unresectable hepatic primary or metastatic tumors before interventional therapy were retrospectively analyzed. Two interventional radiologists independently reviewed the type, originating artery, distribution and variation of extrahepatic artery.Results: Five types of extrahepatic artery were found, with the most common type of the right gastric artery (n=156, 78%), followed by the cystic artery (n=126, 63%), accessory left gastric artery (n=19, 9.5%), hepatic falciform artery (n=5, 2.5%), and accessory left inferior phrenic artery (n=4, 2%). In 188 cases, there were extrahepatic arteries derived from hepatic proper artery or its branches, and the most frequent originating site was the right hepatic artery (130 extrahepatic branches), followed by the proper hepatic artery (103 branches), left hepatic artery (56 branches) and middle hepatic artery (3 branches). The left hepatic artery was the arising site with the multiple types of extrahepatic branches including all above branches except the cystic artery.Conclusion: Many types of extrahepatic branches usually derive from the hepatic artery or its distal branches, and its originating sites are not constant. It is important to avoid damage of extrahepatic tissue during interventional therapy for liver tumors.

  12. Delivery of siRNA using ternary complexes containing branched cationic peptides: the role of peptide sequence, branching and targeting.

    Science.gov (United States)

    Kudsiova, Laila; Welser, Katharina; Campbell, Frederick; Mohammadi, Atefeh; Dawson, Natalie; Cui, Lili; Hailes, Helen C; Lawrence, M Jayne; Tabor, Alethea B

    2016-03-01

    Ternary nanocomplexes, composed of bifunctional cationic peptides, lipids and siRNA, as delivery vehicles for siRNA have been investigated. The study is the first to determine the optimal sequence and architecture of the bifunctional cationic peptide used for siRNA packaging and delivery using lipopolyplexes. Specifically three series of cationic peptides of differing sequence, degrees of branching and cell-targeting sequences were co-formulated with siRNA and vesicles prepared from a 1 : 1 molar ratio of the cationic lipid DOTMA and the helper lipid, DOPE. The level of siRNA knockdown achieved in the human alveolar cell line, A549-luc cells, in both reduced serum and in serum supplemented media was evaluated, and the results correlated to the nanocomplex structure (established using a range of physico-chemical tools, namely small angle neutron scattering, transmission electron microscopy, dynamic light scattering and zeta potential measurement); the conformational properties of each component (circular dichroism); the degree of protection of the siRNA in the lipopolyplex (using gel shift assays) and to the cellular uptake, localisation and toxicity of the nanocomplexes (confocal microscopy). Although the size, charge, structure and stability of the various lipopolyplexes were broadly similar, it was clear that lipopolyplexes formulated from branched peptides containing His-Lys sequences perform best as siRNA delivery agents in serum, with protection of the siRNA in serum balanced against efficient release of the siRNA into the cytoplasm of the cell.

  13. Causality, joint measurement and Tsirelson's bound

    Energy Technology Data Exchange (ETDEWEB)

    Choudhary, Sujit K. [Physics and Applied Mathematics Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata 700108 (India)], E-mail: sujit_r@isical.ac.in; Kar, Guruprasad [Physics and Applied Mathematics Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata 700108 (India)], E-mail: gkar@isical.ac.in; Kunkri, Samir [Physics and Applied Mathematics Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata 700108 (India)], E-mail: skunkri_r@isical.ac.in; Rahaman, Ramij [Physics and Applied Mathematics Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata 700108 (India)], E-mail: ramij_r@isical.ac.in

    2007-11-26

    Tsirelson showed that 2{radical}(2) is the maximum value that CHSH expression can take for quantum correlations [B.S. Tsirelson, Lett. Math. Phys. 4 (1980) 93]. This bound simply follows from the algebra of observables. Recently by exploiting the physical structure of quantum mechanics like unitarity and linearity, Buhrman and Massar [H. Buhrman, S. Massar, Phys. Rev. A 72 (2005) 052103] have established that violation of Tsirelson's bound in quantum mechanics will imply signalling. We prove the same with the help of realistic joint measurement in quantum mechanics and a Bell's inequality which has been derived under the assumption of existence of joint measurement and no signalling condition.

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

  15. Communication: Testing and using the Lewin-Lieb bounds in density functional theory

    Science.gov (United States)

    Feinblum, David V.; Kenison, John; Burke, Kieron

    2014-12-01

    Lewin and Lieb have recently proven several new bounds on the exchange-correlation energy that complement the Lieb-Oxford bound. We test these bounds for atoms, for slowly-varying gases, and for Hooke's atom, finding them usually less strict than the Lieb-Oxford bound. However, we also show that, if a generalized gradient approximation is to guarantee satisfaction of the new bounds for all densities, new restrictions on the exchange-correlation enhancement factor are implied.

  16. Communication: Testing and using the Lewin-Lieb bounds in density functional theory

    Energy Technology Data Exchange (ETDEWEB)

    Feinblum, David V. [Department of Chemistry, University of California, Irvine, California 92697 (United States); Kenison, John [Department of Physics and Astronomy, University of California, Irvine, California 92697 (United States); Burke, Kieron [Department of Chemistry, University of California, Irvine, California 92697 (United States); Department of Physics and Astronomy, University of California, Irvine, California 92697 (United States)

    2014-12-28

    Lewin and Lieb have recently proven several new bounds on the exchange-correlation energy that complement the Lieb-Oxford bound. We test these bounds for atoms, for slowly-varying gases, and for Hooke’s atom, finding them usually less strict than the Lieb-Oxford bound. However, we also show that, if a generalized gradient approximation is to guarantee satisfaction of the new bounds for all densities, new restrictions on the exchange-correlation enhancement factor are implied.

  17. Testing and Using the Lewin-Lieb Bound in Density Functional Theory

    CERN Document Server

    Feinblum, David V; Burke, Kieron

    2014-01-01

    Lewin and Lieb have recently proven several new bounds on the exchange-correlation energy that complement the Lieb-Oxford bound. We test these bounds for atoms, for slowly-varying gases, and for Hooke's atom, finding them usually (but not always) less strict than the Lieb-Oxford bound. However, we also show that, if a GGA is to guarantee satisfaction of the new bounds for all densities, new restrictions on the the exchange-correlation enhancement factor are implied.

  18. ABSTRACT FUNCTIONS OF BOUNDED VARIATION AND ABSOLUTE CONTINUITY

    Institute of Scientific and Technical Information of China (English)

    WuCongxin; LiuTiefu

    1994-01-01

    As well known that in 1938,I. M. Gelfand firstly introduced abstract functions of bounded variation from [a,b] to a Banach space. After Gelfand's work,many mathematicians investigated various properties and of this kind of abstract functions, and also paid attention to the abstract functions of absolute continuity In this paper, we summarize to explain our work [1-17] about this topic.

  19. Conjugate flows and amplitude bounds for internal solitary waves

    Directory of Open Access Journals (Sweden)

    N. I. Makarenko

    2009-03-01

    Full Text Available Amplitude bounds imposed by the conservation of mass, momentum and energy for strongly nonlinear waves in stratified fluid are considered. We discuss the theoretical scheme which allows to determine broadening limits for solitary waves in the terms of a given upstream density profile. Attention is focused on the continuously stratified flows having multiple broadening limits. The role of the mean density profile and the influence of fine-scale stratification are analyzed.

  20. Bounded Algebra and Current-Mode Digital Circuits

    Institute of Scientific and Technical Information of China (English)

    WU Xunwei; Massoud Pedram

    1999-01-01

    This paper proposes two boundedarithmetic operations, which are easily realized with current signals.Based on these two operations, a bounded algebra system suitable fordescribing current-mode digital circuits is developed and itsrelationship with the Boolean algebra, which is suitable for representingvoltage-mode digital circuits, is investigated. Design procedure forcurrent-mode circuits using the proposed algebra system is demonstratedon a number of common circuit elements which are used to realizearithmetic operations, such as adders and multipliers.