WorldWideScience

Sample records for shortest first-neighbor h-h

  1. Production of H H H and H H V (V =γ ,Z ) at the hadron colliders

    Science.gov (United States)

    Agrawal, Pankaj; Saha, Debashis; Shivaji, Ambresh

    2018-02-01

    We consider the production of two Higgs bosons in association with a gauge boson or another Higgs boson at the hadron colliders. We compute the cross sections and distributions for the processes p p →H H H and H H Z within the standard model. In particular, we compute the gluon-gluon fusion one-loop contributions mediated via heavy quarks in the loop. It is the leading order contribution to p p →H H H process. To the process p p →H H Z , it is next-to-next-to-leading-order (NNLO) contribution in QCD coupling. We also compare this contribution to the next-to-leading-order (NLO) QCD contribution to this process. The NNLO contribution can be similar to NLO contribution at the Large Hadron Collider (LHC), and significantly more at higher center-of-mass energy machines. We also study new physics effects in these processes by considering t t H , H H H , H H H H , H Z Z , and H H Z Z interactions as anomalous. The anomalous couplings can enhance the cross sections significantly. The g g →H H H process is specially sensitive to anomalous trilinear Higgs boson self-coupling. For the g g →H H Z process, there is some modest dependence on anomalous H Z Z couplings.

  2. Probability distributions for first neighbor distances between resonances that belong to two different families

    International Nuclear Information System (INIS)

    Difilippo, F.C.

    1994-01-01

    For a mixture of two families of resonances, we found the probability distribution for the distance, as first neighbors, between resonances that belong to different families. Integration of this distribution gives the probability of accidental overlapping of resonances of one isotope by resonances of the other, provided that the resonances of each isotope belong to a single family. (author)

  3. Shortest Paths and Vehicle Routing

    DEFF Research Database (Denmark)

    Petersen, Bjørn

    This thesis presents how to parallelize a shortest path labeling algorithm. It is shown how to handle Chvátal-Gomory rank-1 cuts in a column generation context. A Branch-and-Cut algorithm is given for the Elementary Shortest Paths Problem with Capacity Constraint. A reformulation of the Vehicle...... Routing Problem based on partial paths is presented. Finally, a practical application of finding shortest paths in the telecommunication industry is shown....

  4. An asymmetric shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1989-01-01

    In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length. he joins queue 1 say with probability q and queue 2

  5. Finding the K shortest hyperpaths using reoptimization

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan

    2006-01-01

    The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve...... the worst-case computational complexity of an algorithm for finding the K shortest hyperpaths in an acyclic hypergraph. This result is obtained by applying new reoptimization techniques for shortest hyperpaths. The algorithm turns out to be quite effective in practice and has already been successfully...

  6. H-H interactions in Pd

    DEFF Research Database (Denmark)

    Christensen, O. B.; Ditlevsen, Peter; Jacobsen, Karsten Wedel

    1989-01-01

    -medium theory to calculate total energies we show the same tendency for the short-range part of the H-H interaction when two H atoms are squeezed into a single site in Pd or PdH. At longer range (of the order a lattice constant) there is an attractive, lattice-mediated H-H interaction. On the basis...

  7. Euclidean shortest paths exact or approximate algorithms

    CERN Document Server

    Li, Fajie

    2014-01-01

    This book reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. The coverage includes mathematical proofs for many of the given statements.

  8. Analysis of the asymmetric shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W. H M

    1991-01-01

    In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

  9. Analysis of the shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1989-01-01

    In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length, he joins either queue with probability ½. We show

  10. Analysis of the symmetric shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1990-01-01

    In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On· arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability ½. By using

  11. Analysis of the symmetric shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1990-01-01

    In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability 1/2. By

  12. Analysis of the asymmetric shortest queue problem

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1990-01-01

    In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

  13. Double electron transfer in H- + H+ collisions

    International Nuclear Information System (INIS)

    Braeuning, H; Helm, H; Briggs, J S; Salzborn, E

    2007-01-01

    Absolute cross sections for double electron transfer in H - + H + collisions have been measured for center-of-mass energies from 0.5 keV to 12 keV. Clear oscillations in the cross section are observed which are in excellent agreement with earlier measurements at lower energies by Brouillard et al (1979) as well as Peart and Dolder (1979). After an oscillation maximum at 3 keV center-of-mass energy the cross section decreases for increasing energy with no indication of further oscillations

  14. Evaluation of Shortest Paths in Road Network

    Directory of Open Access Journals (Sweden)

    Farrukh Shehzad

    2009-06-01

    Full Text Available Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based on optimization of real road network by means of distances. Two main objectives arepursued in this research: 1 road distances among different routes are composed in detail; 2 two standardalgorithms (Dijkstra and Floyd-Warshall algoritms are applied to optimize/minimize these distances for bothsingle-source and all-pairs shortest path problems.

  15. A NEW APPROACH ON SHORTEST PATH IN FUZZY ENVIRONMENT

    OpenAIRE

    A. Nagoorgani; A. Mumtaj Begam

    2010-01-01

    This paper introduces a new type of fuzzy shortest path network problem using triangular fuzzy number. To find the smallest edge by the fuzzy distance using graded mean integration representation of generalized fuzzy number for every node. Thus the optimum shortest path for the given problem is obtained.

  16. comparative analysis and implementation of dijkstra's shortest path

    African Journals Online (AJOL)

    user

    path problem requires finding a single shortest-path between given vertices s and t; ... Bridge in 1735, [5 – 10]. This problem led to the .... their advancements from new design paradigms, data structures ..... .

  17. Shortest Path Problems in a Stochastic and Dynamic Environment

    National Research Council Canada - National Science Library

    Cho, Jae

    2003-01-01

    .... Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network...

  18. SPTH3: subroutine for finding shortest sabotage paths

    International Nuclear Information System (INIS)

    Hulme, B.L.; Holdridge, D.B.

    1977-07-01

    This document explains how to construct a sabotage graph which models any fixed-site facility and how to use the subroutine SPTH3 to find shortest paths in the graph. The shortest sabotage paths represent physical routes through the site which would allow an adversary to take advantage of the greatest weaknesses in the system of barriers and alarms. The subroutine SPTH3 is a tool with which safeguards designers and analysts can study the relative effects of design changes on the adversary routing problem. In addition to showing how to use SPTH3, this report discusses the methods used to find shortest paths and several implementation details which cause SPTH3 to be extremely efficient

  19. The shortest-path problem analysis and comparison of methods

    CERN Document Server

    Ortega-Arranz, Hector; Gonzalez-Escribano, Arturo

    2014-01-01

    Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques. Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements. To make methods more comprehensive and to facilitate their co

  20. Experiments with the auction algorithm for the shortest path problem

    DEFF Research Database (Denmark)

    Larsen, Jesper; Pedersen, Ib

    1999-01-01

    The auction approach for the shortest path problem (SPP) as introduced by Bertsekas is tested experimentally. Parallel algorithms using the auction approach are developed and tested. Both the sequential and parallel auction algorithms perform significantly worse than a state-of-the-art Dijkstra-l......-like reference algorithm. Experiments are run on a distributed-memory MIMD class Meiko parallel computer....

  1. Effective caching of shortest paths for location-based services

    DEFF Research Database (Denmark)

    Jensen, Christian S.; Thomsen, Jeppe Rishede; Yiu, Man Lung

    2012-01-01

    Web search is ubiquitous in our daily lives. Caching has been extensively used to reduce the computation time of the search engine and reduce the network traffic beyond a proxy server. Another form of web search, known as online shortest path search, is popular due to advances in geo...

  2. Special cases of the quadratic shortest path problem

    NARCIS (Netherlands)

    Sotirov, Renata; Hu, Hao

    2017-01-01

    The quadratic shortest path problem (QSPP) is the problem of finding a path with prespecified start vertex s and end vertex t in a digraph such that the sum of weights of arcs and the sum of interaction costs over all pairs of arcs on the path is minimized. We first consider a variant of the QSPP

  3. Ranking shortest paths in Stochastic time-denpendent networks

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele

    A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...

  4. K shortest paths in stochastic time-dependent networks

    DEFF Research Database (Denmark)

    Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan

    2004-01-01

    A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...

  5. Structural parcellation of the thalamus using shortest-path tractography

    DEFF Research Database (Denmark)

    Kasenburg, Niklas; Darkner, Sune; Hahn, Ute

    2016-01-01

    that parcellation of the thalamus results in p-value maps that are spatially coherent across subjects. Comparing to the state-of-the-art parcellation of Behrens et al. [1], we observe some agreement, but the soft segmentation exhibits better stability for voxels connected to multiple target regions.......We demonstrate how structural parcellation can be implemented using shortest-path tractography, thereby addressing some of the shortcomings of the conventional approaches. In particular, our algorithm quantifies, via p-values, the confidence that a voxel in the parcellated region is connected...... to each cortical target region. Calculation of these statistical measures is derived from a rank-based test on the histogram of tract-based scores from all the shortest paths found between the source voxel and each voxel within the target region. Using data from the Human Connectome Project, we show...

  6. Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

    Directory of Open Access Journals (Sweden)

    Zhenghao Xi

    2014-01-01

    Full Text Available To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

  7. Training shortest-path tractography: Automatic learning of spatial priors

    DEFF Research Database (Denmark)

    Kasenburg, Niklas; Liptrot, Matthew George; Reislev, Nina Linde

    2016-01-01

    Tractography is the standard tool for automatic delineation of white matter tracts from diffusion weighted images. However, the output of tractography often requires post-processing to remove false positives and ensure a robust delineation of the studied tract, and this demands expert prior...... knowledge. Here we demonstrate how such prior knowledge, or indeed any prior spatial information, can be automatically incorporated into a shortest-path tractography approach to produce more robust results. We describe how such a prior can be automatically generated (learned) from a population, and we...

  8. Shortest triplet clustering: reconstructing large phylogenies using representative sets

    Directory of Open Access Journals (Sweden)

    Sy Vinh Le

    2005-04-01

    Full Text Available Abstract Background Understanding the evolutionary relationships among species based on their genetic information is one of the primary objectives in phylogenetic analysis. Reconstructing phylogenies for large data sets is still a challenging task in Bioinformatics. Results We propose a new distance-based clustering method, the shortest triplet clustering algorithm (STC, to reconstruct phylogenies. The main idea is the introduction of a natural definition of so-called k-representative sets. Based on k-representative sets, shortest triplets are reconstructed and serve as building blocks for the STC algorithm to agglomerate sequences for tree reconstruction in O(n2 time for n sequences. Simulations show that STC gives better topological accuracy than other tested methods that also build a first starting tree. STC appears as a very good method to start the tree reconstruction. However, all tested methods give similar results if balanced nearest neighbor interchange (BNNI is applied as a post-processing step. BNNI leads to an improvement in all instances. The program is available at http://www.bi.uni-duesseldorf.de/software/stc/. Conclusion The results demonstrate that the new approach efficiently reconstructs phylogenies for large data sets. We found that BNNI boosts the topological accuracy of all methods including STC, therefore, one should use BNNI as a post-processing step to get better topological accuracy.

  9. An Efficient Shortest Path Routing Algorithm for Directed Indoor Environments

    Directory of Open Access Journals (Sweden)

    Sultan Alamri

    2018-03-01

    Full Text Available Routing systems for outdoor space have become the focus of many research works. Such routing systems are based on spatial road networks where moving objects (such as cars are affected by the directed roads and the movement of traffic, which may include traffic jams. Indoor routing, on the other hand, must take into account the features of indoor space such as walls and rooms. In this paper, we take indoor routing in a new direction whereby we consider the features that a building has in common with outdoor spaces. Inside some buildings, there may be directed floors where moving objects must move in a certain direction through directed corridors in order to reach a certain location. For example, on train platforms or in museums, movement in the corridors may be directed. In these directed floor spaces, a routing system enabling a visitor to take the shortest path to a certain location is essential. Therefore, this work proposes a new approach for buildings with directed indoor spaces, where each room can be affected by the density of the moving objects. The proposed system obtains the shortest path between objects or rooms taking into consideration the directed indoor space and the capacity of the objects to move within each room/cell.

  10. DiversePathsJ: diverse shortest paths for bioimage analysis.

    Science.gov (United States)

    Uhlmann, Virginie; Haubold, Carsten; Hamprecht, Fred A; Unser, Michael

    2018-02-01

    We introduce a formulation for the general task of finding diverse shortest paths between two end-points. Our approach is not linked to a specific biological problem and can be applied to a large variety of images thanks to its generic implementation as a user-friendly ImageJ/Fiji plugin. It relies on the introduction of additional layers in a Viterbi path graph, which requires slight modifications to the standard Viterbi algorithm rules. This layered graph construction allows for the specification of various constraints imposing diversity between solutions. The software allows obtaining a collection of diverse shortest paths under some user-defined constraints through a convenient and user-friendly interface. It can be used alone or be integrated into larger image analysis pipelines. http://bigwww.epfl.ch/algorithms/diversepathsj. michael.unser@epfl.ch or fred.hamprecht@iwr.uni-heidelberg.de. Supplementary data are available at Bioinformatics online. © The Author(s) 2017. Published by Oxford University Press.

  11. External Data Structures for Shortest Path Queries on Planar Digraphs

    DEFF Research Database (Denmark)

    Arge, Lars; Toma, Laura

    2005-01-01

    In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N 1 + ε) and S = O(N2/B), our main result is a family of structures that use S space and answer queries in O(N2/ S B) I/Os, thus obtaining...... optimal space-query product O(N2/B). An S space structure can be constructed in O(√S · sort(N)) I/Os, where sort(N) is the number of I/Os needed to sort N elements, B is the disk block size, and N is the size of the graph....

  12. Particle swarm optimization for determining shortest distance to voltage collapse

    Energy Technology Data Exchange (ETDEWEB)

    Arya, L.D.; Choube, S.C. [Electrical Engineering Department, S.G.S.I.T.S. Indore, MP 452 003 (India); Shrivastava, M. [Electrical Engineering Department, Government Engineering College Ujjain, MP 456 010 (India); Kothari, D.P. [Centre for Energy Studies, Indian Institute of Technology, Delhi (India)

    2007-12-15

    This paper describes an algorithm for computing shortest distance to voltage collapse or determination of CSNBP using PSO technique. A direction along CSNBP gives conservative results from voltage security view point. This information is useful to the operator to steer the system away from this point by taking corrective actions. The distance to a closest bifurcation is a minimum of the loadability given a slack bus or participation factors for increasing generation as the load increases. CSNBP determination has been formulated as an optimization problem to be used in PSO technique. PSO is a new evolutionary algorithm (EA) which is population based inspired by the social behavior of animals such as fish schooling and birds flocking. It can handle optimization problems with any complexity since mechanization is simple with few parameters to be tuned. The developed algorithm has been implemented on two standard test systems. (author)

  13. Calculating Graph Algorithms for Dominance and Shortest Path

    DEFF Research Database (Denmark)

    Sergey, Ilya; Midtgaard, Jan; Clarke, Dave

    2012-01-01

    We calculate two iterative, polynomial-time graph algorithms from the literature: a dominance algorithm and an algorithm for the single-source shortest path problem. Both algorithms are calculated directly from the definition of the properties by fixed-point fusion of (1) a least fixed point...... expressing all finite paths through a directed graph and (2) Galois connections that capture dominance and path length. The approach illustrates that reasoning in the style of fixed-point calculus extends gracefully to the domain of graph algorithms. We thereby bridge common practice from the school...... of program calculation with common practice from the school of static program analysis, and build a novel view on iterative graph algorithms as instances of abstract interpretation...

  14. Extended shortest path selection for package routing of complex networks

    Science.gov (United States)

    Ye, Fan; Zhang, Lei; Wang, Bing-Hong; Liu, Lu; Zhang, Xing-Yi

    The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.

  15. Solving fuzzy shortest path problem by genetic algorithm

    Science.gov (United States)

    Syarif, A.; Muludi, K.; Adrian, R.; Gen, M.

    2018-03-01

    Shortest Path Problem (SPP) is known as one of well-studied fields in the area Operations Research and Mathematical Optimization. It has been applied for many engineering and management designs. The objective is usually to determine path(s) in the network with minimum total cost or traveling time. In the past, the cost value for each arc was usually assigned or estimated as a deteministic value. For some specific real world applications, however, it is often difficult to determine the cost value properly. One way of handling such uncertainty in decision making is by introducing fuzzy approach. With this situation, it will become difficult to solve the problem optimally. This paper presents the investigations on the application of Genetic Algorithm (GA) to a new SPP model in which the cost values are represented as Triangular Fuzzy Number (TFN). We adopts the concept of ranking fuzzy numbers to determine how good the solutions. Here, by giving his/her degree value, the decision maker can determine the range of objective value. This would be very valuable for decision support system in the real world applications.Simulation experiments were carried out by modifying several test problems with 10-25 nodes. It is noted that the proposed approach is capable attaining a good solution with different degree of optimism for the tested problems.

  16. An Application of Multi-Criteria Shortest Path to a Customizable Hex-Map Environment

    Science.gov (United States)

    2015-03-26

    47 Appendix A. Shortest Path Code ( VBA ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 Appendix B. Quad Chart...efficient shortest path algorithm into the modeling environment, namely Excel VBA . While various algorithms offer the potential for more efficiency in...graphical interface is extremely intuitive and easily accessible to a user with no prior knowledge of the system. Since the Metz model is based on the

  17. Matrix-geometric analysis of the shortest queue problem with threshold jockeying

    NARCIS (Netherlands)

    Zijm, Willem H.M.; Adan, I.J.B.F.; Wessels, J.

    1993-01-01

    In this paper we study a system consisting of c parallel servers with possibly different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. An arriving job joins the shortest queue, where in case of multiple shortest queues, one of these

  18. The time-varying shortest path problem with fuzzy transit costs and speedup

    Directory of Open Access Journals (Sweden)

    Rezapour Hassan

    2016-08-01

    Full Text Available In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost. Speedup may also be a better decision to find the shortest path from a source vertex to a specified vertex.

  19. External Memory Algorithms for Diameter and All-Pair Shortest-Paths on Sparse Graphs

    DEFF Research Database (Denmark)

    Arge, Lars; Meyer, Ulrich; Toma, Laura

    2004-01-01

    We present several new external-memory algorithms for finding all-pairs shortest paths in a V -node, Eedge undirected graph. For all-pairs shortest paths and diameter in unweighted undirected graphs we present cache-oblivious algorithms with O(V · E B logM B E B) I/Os, where B is the block-size a...

  20. Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.

    Science.gov (United States)

    Rodríguez-Puente, Rafael; Lazo-Cortés, Manuel S

    2013-01-01

    The use of Geographic Information Systems has increased considerably since the eighties and nineties. As one of their most demanding applications we can mention shortest paths search. Several studies about shortest path search show the feasibility of using graphs for this purpose. Dijkstra's algorithm is one of the classic shortest path search algorithms. This algorithm is not well suited for shortest path search in large graphs. This is the reason why various modifications to Dijkstra's algorithm have been proposed by several authors using heuristics to reduce the run time of shortest path search. One of the most used heuristic algorithms is the A* algorithm, the main goal is to reduce the run time by reducing the search space. This article proposes a modification of Dijkstra's shortest path search algorithm in reduced graphs. It shows that the cost of the path found in this work, is equal to the cost of the path found using Dijkstra's algorithm in the original graph. The results of finding the shortest path, applying the proposed algorithm, Dijkstra's algorithm and A* algorithm, are compared. This comparison shows that, by applying the approach proposed, it is possible to obtain the optimal path in a similar or even in less time than when using heuristic algorithms.

  1. Comparative evaluation of H&H and WFNS grading scales with modified H&H (sans systemic disease): A study on 1000 patients with subarachnoid hemorrhage.

    Science.gov (United States)

    Aggarwal, Ashish; Dhandapani, Sivashanmugam; Praneeth, Kokkula; Sodhi, Harsimrat Bir Singh; Pal, Sudhir Singh; Gaudihalli, Sachin; Khandelwal, N; Mukherjee, Kanchan K; Tewari, M K; Gupta, Sunil Kumar; Mathuriya, S N

    2018-01-01

    The comparative studies on grading in subarachnoid hemorrhage (SAH) had several limitations such as the unclear grading of Glasgow Coma Scale 15 with neurological deficits in World Federation of Neurosurgical Societies (WFNS), and the inclusion of systemic disease in Hunt and Hess (H&H) scales. Their differential incremental impacts and optimum cut-off values for unfavourable outcome are unsettled. This is a prospective comparison of prognostic impacts of grading schemes to address these issues. SAH patients were assessed using WFNS, H&H (including systemic disease), modified H&H (sans systemic disease) and followed up with Glasgow Outcome Score (GOS) at 3 months. Their performance characteristics were analysed as incremental ordinal variables and different grading scale dichotomies using rank-order correlation, sensitivity, specificity, positive predictive value, negative predictive value, Youden's J and multivariate analyses. A total of 1016 patients were studied. As univariate incremental variable, H&H sans systemic disease had the best negative rank-order correlation coefficient (-0.453) with respect to lower GOS (p H&H sans systemic disease had the greatest adjusted incremental impact of 0.72 (95% confidence interval (CI) 0.54-0.91) against a lower GOS as compared to 0.6 (95% CI 0.45-0.74) and 0.55 (95% CI 0.42-0.68) for H&H and WFNS grades, respectively. In multivariate categorical analysis, H&H grades 4-5 sans systemic disease had the greatest impact on unfavourable GOS with an adjusted odds ratio of 6.06 (95% CI 3.94-9.32). To conclude, H&H grading sans systemic disease had the greatest impact on unfavourable GOS. Though systemic disease is an important prognostic factor, it should be considered distinctly from grading. Appropriate cut-off values suggesting unfavourable outcome for H&H and WFNS were 4-5 and 3-5, respectively, indicating the importance of neurological deficits in addition to level of consciousness.

  2. The shortest path algorithm performance comparison in graph and relational database on a transportation network

    Directory of Open Access Journals (Sweden)

    Mario Miler

    2014-02-01

    Full Text Available In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of the shortest path. The objective of this research is to compare the performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting and Neo4j graph database for the purpose of determining if there is any difference regarding the speed of the calculation. Benchmarking was done on commodity hardware using OpenStreetMap road network. The first assumption is that Neo4j graph database would be well suited for the shortest path calculation on transportation networks but this does not come without some cost. Memory proved to be an issue in Neo4j setup when dealing with larger transportation networks.

  3. Optimal solution for travelling salesman problem using heuristic shortest path algorithm with imprecise arc length

    Science.gov (United States)

    Bakar, Sumarni Abu; Ibrahim, Milbah

    2017-08-01

    The shortest path problem is a popular problem in graph theory. It is about finding a path with minimum length between a specified pair of vertices. In any network the weight of each edge is usually represented in a form of crisp real number and subsequently the weight is used in the calculation of shortest path problem using deterministic algorithms. However, due to failure, uncertainty is always encountered in practice whereby the weight of edge of the network is uncertain and imprecise. In this paper, a modified algorithm which utilized heuristic shortest path method and fuzzy approach is proposed for solving a network with imprecise arc length. Here, interval number and triangular fuzzy number in representing arc length of the network are considered. The modified algorithm is then applied to a specific example of the Travelling Salesman Problem (TSP). Total shortest distance obtained from this algorithm is then compared with the total distance obtained from traditional nearest neighbour heuristic algorithm. The result shows that the modified algorithm can provide not only on the sequence of visited cities which shown to be similar with traditional approach but it also provides a good measurement of total shortest distance which is lesser as compared to the total shortest distance calculated using traditional approach. Hence, this research could contribute to the enrichment of methods used in solving TSP.

  4. Prograph Based Analysis of Single Source Shortest Path Problem with Few Distinct Positive Lengths

    Directory of Open Access Journals (Sweden)

    B. Bhowmik

    2011-08-01

    Full Text Available In this paper we propose an experimental study model S3P2 of a fast fully dynamic programming algorithm design technique in finite directed graphs with few distinct nonnegative real edge weights. The Bellman-Ford’s approach for shortest path problems has come out in various implementations. In this paper the approach once again is re-investigated with adjacency matrix selection in associate least running time. The model tests proposed algorithm against arbitrarily but positive valued weighted digraphs introducing notion of Prograph that speeds up finding the shortest path over previous implementations. Our experiments have established abstract results with the intention that the proposed algorithm can consistently dominate other existing algorithms for Single Source Shortest Path Problems. A comparison study is also shown among Dijkstra’s algorithm, Bellman-Ford algorithm, and our algorithm.

  5. Finding Shortest Paths on Terrains by Killing Two Birds with One Stone

    DEFF Research Database (Denmark)

    Kaul, Manohar; Wong, Raymond Chi-Wing; Yang, Bin

    2013-01-01

    With the increasing availability of terrain data, e.g., from aerial laser scans, the management of such data is attracting increasing at- tention in both industry and academia. In particular, spatial queries, e.g., k -nearest neighbor and reverse nearest neighbor queries, in Euclidean and spatial...... network spaces are being extended to ter- rains. Such queries all rely on an important operation, that of finding shortest surface distances. However, shortest surface dis- tance computation is very time consuming. We propose techniques that enable efficient computation of lower and upper bounds...... of the shortest surface distance, which enable faster query processing by eliminating expensive distance computations. Empirical studies show that our bounds are much tighter than the best-known bounds in many cases and that they enable speedups of up to 43 times for some well-known spatial querie...

  6. The Resource constrained shortest path problem implemented in a lazy functional language

    NARCIS (Netherlands)

    Hartel, Pieter H.; Glaser, Hugh

    The resource constrained shortest path problem is an NP-hard problem for which many ingenious algorithms have been developed. These algorithms are usually implemented in Fortran or another imperative programming language. We have implemented some of the simpler algorithms in a lazy functional

  7. Approaching the Brachistochrone Using Inclined Planes--Striving for Shortest or Equal Travelling Times

    Science.gov (United States)

    Theilmann, Florian

    2017-01-01

    The classical "brachistochrone" problem asks for the path on which a mobile point M just driven by its own gravity will travel in the shortest possible time between two given points "A" and "B." The resulting curve, the cycloid, will also be the "tautochrone" curve, i.e. the travelling time of the mobile…

  8. Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism

    NARCIS (Netherlands)

    van Houtum, Geert-Jan; Adan, I.J.B.F.; Wessels, J.; Zijm, Willem H.M.

    In this paper we study a production system consisting of a group of parallel machines producing multiple job types. Each machine has its own queue and it can process a restricted set of job types only. On arrival a job joins the shortest queue among all queues capable of serving that job. Under the

  9. Children's route choice during active transportation to school: Difference between shortest and actual route

    NARCIS (Netherlands)

    Dessing, D.; Vries, S.I. de; Hegeman, G.; Verhagen, E.; Mechelen, W. van; Pierik, F.H.

    2016-01-01

    Background: The purpose of this study is to increase our understanding of environmental correlates that are associated with route choice during active transportation to school (ATS) by comparing characteristics of actual walking and cycling routes between home and school with the shortest possible

  10. Analysis of the asymmetric shortest queue problem : part 2: numerical analysis

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1990-01-01

    In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

  11. Analysis of the asymmetric shortest queue problem : Part 1: theoretical analysis

    NARCIS (Netherlands)

    Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

    1990-01-01

    In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths. be joins the first

  12. Spatial interpolation of fine particulate matter concentrations using the shortest wind-field path distance.

    Directory of Open Access Journals (Sweden)

    Longxiang Li

    Full Text Available Effective assessments of air-pollution exposure depend on the ability to accurately predict pollutant concentrations at unmonitored locations, which can be achieved through spatial interpolation. However, most interpolation approaches currently in use are based on the Euclidean distance, which cannot account for the complex nonlinear features displayed by air-pollution distributions in the wind-field. In this study, an interpolation method based on the shortest path distance is developed to characterize the impact of complex urban wind-field on the distribution of the particulate matter concentration. In this method, the wind-field is incorporated by first interpolating the observed wind-field from a meteorological-station network, then using this continuous wind-field to construct a cost surface based on Gaussian dispersion model and calculating the shortest wind-field path distances between locations, and finally replacing the Euclidean distances typically used in Inverse Distance Weighting (IDW with the shortest wind-field path distances. This proposed methodology is used to generate daily and hourly estimation surfaces for the particulate matter concentration in the urban area of Beijing in May 2013. This study demonstrates that wind-fields can be incorporated into an interpolation framework using the shortest wind-field path distance, which leads to a remarkable improvement in both the prediction accuracy and the visual reproduction of the wind-flow effect, both of which are of great importance for the assessment of the effects of pollutants on human health.

  13. MARKETING DATABASES – THE SHORTEST WAY TO CLIENT’S HEART

    Directory of Open Access Journals (Sweden)

    Popa Adela Laura

    2008-05-01

    Full Text Available The aim of this paper is to present the potential which could be offered by managing databases in direct marketing through gathering the information that could offer the shortest and efficient way to the clients needs. The paper includes the necessary steps to make this activity a real success

  14. Degree distribution of shortest path trees and bias of network sampling algorithms

    NARCIS (Netherlands)

    Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

    2013-01-01

    In this article, we explicitly derive the limiting distribution of the degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the power-law exponent of the degree distribution of this tree and compare it to the degree

  15. Degree distribution of shortest path trees and bias of network sampling algorithms

    NARCIS (Netherlands)

    Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

    2015-01-01

    In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large degrees of this tree and compare it to the degree distribution

  16. Shortest-path network analysis is a useful approach toward identifying genetic determinants of longevity.

    Directory of Open Access Journals (Sweden)

    J R Managbanag

    Full Text Available BACKGROUND: Identification of genes that modulate longevity is a major focus of aging-related research and an area of intense public interest. In addition to facilitating an improved understanding of the basic mechanisms of aging, such genes represent potential targets for therapeutic intervention in multiple age-associated diseases, including cancer, heart disease, diabetes, and neurodegenerative disorders. To date, however, targeted efforts at identifying longevity-associated genes have been limited by a lack of predictive power, and useful algorithms for candidate gene-identification have also been lacking. METHODOLOGY/PRINCIPAL FINDINGS: We have utilized a shortest-path network analysis to identify novel genes that modulate longevity in Saccharomyces cerevisiae. Based on a set of previously reported genes associated with increased life span, we applied a shortest-path network algorithm to a pre-existing protein-protein interaction dataset in order to construct a shortest-path longevity network. To validate this network, the replicative aging potential of 88 single-gene deletion strains corresponding to predicted components of the shortest-path longevity network was determined. Here we report that the single-gene deletion strains identified by our shortest-path longevity analysis are significantly enriched for mutations conferring either increased or decreased replicative life span, relative to a randomly selected set of 564 single-gene deletion strains or to the current data set available for the entire haploid deletion collection. Further, we report the identification of previously unknown longevity genes, several of which function in a conserved longevity pathway believed to mediate life span extension in response to dietary restriction. CONCLUSIONS/SIGNIFICANCE: This work demonstrates that shortest-path network analysis is a useful approach toward identifying genetic determinants of longevity and represents the first application of

  17. ESHOPPS: A COMPUTATIONAL TOOL TO AID THE TEACHING OF SHORTEST PATH ALGORITHMS

    Directory of Open Access Journals (Sweden)

    S. J. de A. LIMA

    2015-07-01

    Full Text Available The development of a computational tool called EShoPPS – Environment for Shortest Path Problem Solving, which is used to assist students in understanding the working of Dijkstra, Greedy search and A*(star algorithms is presented in this paper. Such algorithms are commonly taught in graduate and undergraduate courses of Engineering and Informatics and are used for solving many optimization problems that can be characterized as Shortest Path Problem. The EShoPPS is an interactive tool that allows students to create a graph representing the problem and also helps in developing their knowledge of each specific algorithm. Experiments performed with 155 students of undergraduate and graduate courses such as Industrial Engineering, Computer Science and Information Systems have shown that by using the EShoPPS tool students were able to improve their interpretation of investigated algorithms.

  18. Establishment Of The Shortest Route A Prototype For Facilitation In Road Network

    Directory of Open Access Journals (Sweden)

    Sumaira Yousuf Khan

    2015-08-01

    Full Text Available Calculating the shortest path between two locations in a road network is a significant problem in network analysis. Roads play a pivotal role in day to day activities of masses live in places and areas. They travel for various purposes that are to study to work to shop and to supply their goods and the like from one place to another place. Even in this modern era roads remain one of the mediums used most frequently for travel and transportation. Being ignorant of the shortest routes people sometimes have to travel long distances consume extra precious time money and bare undesirable mental stress. Karachi is the second most populated and the seventh biggest city of the world. It is the central place of Pakistan which is famous for industry banking trade and economic activity and there are places which frequently visit by the inhabitants for their miscellaneous requirements. Federal Board of Revenue FBR is one of the departments that deal with taxation and revenue generation in the country. A common man residing near or distant areas often visit FBR to settle their business property and tax related issues. In order to facilitate the masses an effort is being made to develop a prototype based on Dijkstras Algorithm DA to establish a shortest route that will help individuals in navigation and subsequently alleviate difficulties faced by them in travelling road networks.

  19. The Shortest Path Problems in Battery-Electric Vehicle Dispatching with Battery Renewal

    Directory of Open Access Journals (Sweden)

    Minfang Huang

    2016-06-01

    Full Text Available Electric vehicles play a key role for developing an eco-sustainable transport system. One critical component of an electric vehicle is its battery, which can be quickly charged or exchanged before it runs out. The problem of electric vehicle dispatching falls into the category of the shortest path problem with resource renewal. In this paper, we study the shortest path problems in (1 electric transit bus scheduling and (2 electric truck routing with time windows. In these applications, a fully-charged battery allows running a limited operational distance, and the battery before depletion needs to be quickly charged or exchanged with a fully-charged one at a battery management facility. The limited distance and battery renewal result in a shortest path problem with resource renewal. We develop a label-correcting algorithm with state space relaxation to find optimal solutions. In the computational experiments, real-world road geometry data are used to generate realistic travel distances, and other types of data are obtained from the real world or randomly generated. The computational results show that the label-correcting algorithm performs very well.

  20. A new approach to shortest paths on networks based on the quantum bosonic mechanism

    Energy Technology Data Exchange (ETDEWEB)

    Jiang Xin; Wang Hailong; Tang Shaoting; Ma Lili; Zhang Zhanli; Zheng Zhiming, E-mail: jiangxin@ss.buaa.edu.cn [Key Laboratory of Mathematics, Informatics and Behavioral Semantics, Ministry of Education, Beijing University of Aeronautics and Astronautics, 100191 Beijing (China)

    2011-01-15

    This paper presents quantum bosonic shortest path searching (QBSPS), a natural, practical and highly heuristic physical algorithm for reasoning about the recognition of network structure via quantum dynamics. QBSPS is based on an Anderson-like itinerant bosonic system in which a boson's Green function is used as a navigation pointer for one to accurately approach the terminals. QBSPS is demonstrated by rigorous mathematical and physical proofs and plenty of simulations, showing how it can be used as a greedy routing to seek the shortest path between different locations. In methodology, it is an interesting and new algorithm rooted in the quantum mechanism other than combinatorics. In practice, for the all-pairs shortest-path problem in a random scale-free network with N vertices, QBSPS runs in O({mu}(N) ln ln N) time. In application, we suggest that the corresponding experimental realizations are feasible by considering path searching in quantum optical communication networks; in this situation, the method performs a pure local search on networks without requiring the global structure that is necessary for current graph algorithms.

  1. Finding shortest non-trivial cycles in directed graphs on surfaces

    Directory of Open Access Journals (Sweden)

    Sergio Cabello

    2016-04-01

    Full Text Available Let $D$ be a weighted directed graph cellularly embedded in a surface of genus $g$, orientable or not, possibly with boundary.  We describe algorithms to compute shortest non-contractible and shortest surface non-separating cycles in $D$, generalizing previous results that dealt with undirected graphs.Our first algorithm computes such cycles in $O(n^2\\log n$ time, where $n$ is the total number of vertices and edges of $D$, thus matching the complexity of the best general algorithm in the undirected case.  It revisits and extends Thomassen's 3-path condition; the technique applies to other families of cycles as well.We also provide more efficient algorithms in special cases, such as graphs with small genus or bounded treewidth, using a divide-and-conquer technique that simplifies the graph while preserving the topological properties of its cycles.  Finally, we give an efficient output-sensitive algorithm, whose running time depends on the length of the shortest non-contractible or non-separating cycle.

  2. A Universal Concept for Robust Solving of Shortest Path Problems in Dynamically Reconfigurable Graphs

    Directory of Open Access Journals (Sweden)

    Jean Chamberlain Chedjou

    2015-01-01

    Full Text Available This paper develops a flexible analytical concept for robust shortest path detection in dynamically reconfigurable graphs. The concept is expressed by a mathematical model representing the shortest path problem solver. The proposed mathematical model is characterized by three fundamental parameters expressing (a the graph topology (through the “incidence matrix”, (b the edge weights (with dynamic external weights’ setting capability, and (c the dynamic reconfigurability through external input(s of the source-destination nodes pair. In order to demonstrate the universality of the developed concept, a general algorithm is proposed to determine the three fundamental parameters (of the mathematical model developed for all types of graphs regardless of their topology, magnitude, and size. It is demonstrated that the main advantage of the developed concept is that arc costs, the origin-destination pair setting, and the graph topology are dynamically provided by external commands, which are inputs of the shortest path solver model. This enables high flexibility and full reconfigurability of the developed concept, without any retraining need. To validate the concept developed, benchmarking is performed leading to a comparison of its performance with the performances of two well-known concepts based on neural networks.

  3. Evidence for CP violation in time-integrated $D^0 \\rightarrow h^-h^+$ decay rates

    CERN Document Server

    Aaij, R; Adeva, B; Adinolfi, M; Adrover, C; Affolder, A; Ajaltouni, Z; Albrecht, J; Alessio, F; Alexander, M; Alkhazov, G; Alvarez Cartelle, P; Alves, A A; Amato, S; Amhis, Y; Anderson, J; Appleby, R B; Aquines Gutierrez, O; Archilli, F; Arrabito, L; Artamonov, A; Artuso, M; Aslanides, E; Auriemma, G; Bachmann, S; Back, J J; Bailey, D S; Balagura, V; Baldini, W; Barlow, R J; Barschel, C; Barsuk, S; Barter, W; Bates, A; Bauer, C; Bauer, Th; Bay, A; Bediaga, I; Belogurov, S; Belous, K; Belyaev, I; Ben-Haim, E; Benayoun, M; Bencivenni, G; Benson, S; Benton, J; Bernet, R; Bettler, M-O; van Beuzekom, M; Bien, A; Bifani, S; Bird, T; Bizzeti, A; Bjørnstad, P M; Blake, T; Blanc, F; Blanks, C; Blouw, J; Blusk, S; Bobrov, A; Bocci, V; Bondar, A; Bondar, N; Bonivento, W; Borghi, S; Borgia, A; Bowcock, T J V; Bozzi, C; Brambach, T; van den Brand, J; Bressieux, J; Brett, D; Britsch, M; Britton, T; Brook, N H; Brown, H; Büchler-Germann, A; Burducea, I; Bursche, A; Buytaert, J; Cadeddu, S; Callot, O; Calvi, M; Calvo Gomez, M; Camboni, A; Campana, P; Carbone, A; Carboni, G; Cardinale, R; Cardini, A; Carson, L; Carvalho Akiba, K; Casse, G; Cattaneo, M; Cauet, Ch; Charles, M; Charpentier, Ph; Chiapolini, N; Ciba, K; Cid Vidal, X; Ciezarek, G; Clarke, P E L; Clemencic, M; Cliff, H V; Closier, J; Coca, C; Coco, V; Cogan, J; Collins, P; Comerma-Montells, A; Constantin, F; Contu, A; Cook, A; Coombes, M; Corti, G; Cowan, G A; Currie, R; D'Ambrosio, C; David, P; David, P N Y; De Bonis, I; De Capua, S; De Cian, M; De Lorenzi, F; De Miranda, J M; De Paula, L; De Simone, P; Decamp, D; Deckenhoff, M; Degaudenzi, H; Del Buono, L; Deplano, C; Derkach, D; Deschamps, O; Dettori, F; Dickens, J; Dijkstra, H; Diniz Batista, P; Domingo Bonal, F; Donleavy, S; Dordei, F; Dosil Suárez, A; Dossett, D; Dovbnya, A; Dupertuis, F; Dzhelyadin, R; Dziurda, A; Easo, S; Egede, U; Egorychev, V; Eidelman, S; van Eijk, D; Eisele, F; Eisenhardt, S; Ekelhof, R; Eklund, L; Elsasser, Ch; Elsby, D; Esperante Pereira, D; Estève, L; Falabella, A; Fanchini, E; Färber, C; Fardell, G; Farinelli, C; Farry, S; Fave, V; Fernandez Albor, V; Ferro-Luzzi, M; Filippov, S; Fitzpatrick, C; Fontana, M; Fontanelli, F; Forty, R; Frank, M; Frei, C; Frosini, M; Furcas, S; Gallas Torreira, A; Galli, D; Gandelman, M; Gandini, P; Gao, Y; Garnier, J-C; Garofoli, J; Garra Tico, J; Garrido, L; Gascon, D; Gaspar, C; Gauvin, N; Gersabeck, M; Gershon, T; Ghez, Ph; Gibson, V; Gligorov, V V; Göbel, C; Golubkov, D; Golutvin, A; Gomes, A; Gordon, H; Grabalosa Gándara, M; Graciani Diaz, R; Granado Cardoso, L A; Graugés, E; Graziani, G; Grecu, A; Greening, E; Gregson, S; Gui, B; Gushchin, E; Guz, Yu; Gys, T; Haefeli, G; Haen, C; Haines, S C; Hampson, T; Hansmann-Menzemer, S; Harji, R; Harnew, N; Harrison, J; Harrison, P F; Hartmann, T; He, J; Heijne, V; Hennessy, K; Henrard, P; Hernando Morata, J A; van Herwijnen, E; Hicks, E; Holubyev, K; Hopchev, P; Hulsbergen, W; Hunt, P; Huse, T; Huston, R S; Hutchcroft, D; Hynds, D; Iakovenko, V; Ilten, P; Imong, J; Jacobsson, R; Jaeger, A; Jahjah Hussein, M; Jans, E; Jansen, F; Jaton, P; Jean-Marie, B; Jing, F; John, M; Johnson, D; Jones, C R; Jost, B; Kaballo, M; Kandybei, S; Karacson, M; Karbach, T M; Keaveney, J; Kenyon, I R; Kerzel, U; Ketel, T; Keune, A; Khanji, B; Kim, Y M; Knecht, M; Koopman, R; Koppenburg, P; Kozlinskiy, A; Kravchuk, L; Kreplin, K; Kreps, M; Krocker, G; Krokovny, P; Kruse, F; Kruzelecki, K; Kucharczyk, M; Kvaratskheliya, T; La Thi, V N; Lacarrere, D; Lafferty, G; Lai, A; Lambert, D; Lambert, R W; Lanciotti, E; Lanfranchi, G; Langenbruch, C; Latham, T; Lazzeroni, C; Le Gac, R; van Leerdam, J; Lees, J-P; Lefèvre, R; Leflat, A; Lefrançois, J; Leroy, O; Lesiak, T; Li, L; Li Gioi, L; Lieng, M; Liles, M; Lindner, R; Linn, C; Liu, B; Liu, G; von Loeben, J; Lopes, J H; Lopez Asamar, E; Lopez-March, N; Lu, H; Luisier, J; Mac Raighne, A; Machefert, F; Machikhiliyan, I V; Maciuc, F; Maev, O; Magnin, J; Malde, S; Mamunur, R M D; Manca, G; Mancinelli, G; Mangiafave, N; Marconi, U; Märki, R; Marks, J; Martellotti, G; Martens, A; Martin, L; Martín Sánchez, A; Martinez Santos, D; Massafferri, A; Mathe, Z; Matteuzzi, C; Matveev, M; Maurice, E; Maynard, B; Mazurov, A; McGregor, G; McNulty, R; Meissner, M; Merk, M; Merkel, J; Messi, R; Miglioranzi, S; Milanes, D A; Minard, M-N; Molina Rodriguez, J; Monteil, S; Moran, D; Morawski, P; Mountain, R; Mous, I; Muheim, F; Müller, K; Muresan, R; Muryn, B; Muster, B; Musy, M; Mylroie-Smith, J; Naik, P; Nakada, T; Nandakumar, R; Nasteva, I; Nedos, M; Needham, M; Neufeld, N; Nguyen-Mau, C; Nicol, M; Niess, V; Nikitin, N; Nomerotski, A; Novoselov, A; Oblakowska-Mucha, A; Obraztsov, V; Oggero, S; Ogilvy, S; Okhrimenko, O; Oldeman, R; Orlandea, M; Otalorav Goicochea, J M; Owen, P; Pal, K; Palacios, J; Palano, A; Palutan, M; Panman, J; Papanestis, A; Pappagallo, M; Parkes, C; Parkinson, C J; Passaleva, G; Patel, G D; Patel, M; Paterson, S K; Patrick, G N; Patrignani, C; Pavel-Nicorescu, C; Pazos Alvarez, A; Pellegrino, A; Penso, G; Pepe Altarelli, M; Perazzini, S; Perego, D L; Perez Trigo, E; Pérez-Calero Yzquierdo, A; Perret, P; Perrin-Terrin, M; Pessina, G; Petrella, A; Petrolini, A; Phan, A; Picatoste Olloqui, E; Pie Valls, B; Pietrzyk, B; Pilař, T; Pinci, D; Plackett, R; Playfer, S; Plo Casasus, M; Polok, G; Poluektov, A; Polycarpo, E; Popov, D; Popovici, B; Potterat, C; Powell, A; Prisciandaro, J; Pugatch, V; Puig Navarro, A; Qian, W; Rademacker, J H; Rakotomiaramanana, B; Rangel, M S; Raniuk, I; Raven, G; Redford, S; Reid, M M; dos Reis, A C; Ricciardi, S; Rinnert, K; Roa Romero, D A; Robbe, P; Rodrigues, E; Rodrigues, F; Rodriguez Perez, P; Rogers, G J; Roiser, S; Romanovsky, V; Rosello, M; Rouvinet, J; Ruf, T; Ruiz, H; Sabatino, G; Saborido Silva, J J; Sagidova, N; Sail, P; Saitta, B; Salzmann, C; Sannino, M; Santacesaria, R; Santamarina Rios, C; Santinelli, R; Santovetti, E; Sapunov, M; Sarti, A; Satriano, C; Satta, A; Savrie, M; Savrina, D; Schaack, P; Schiller, M; Schleich, S; Schlupp, M; Schmelling, M; Schmidt, B; Schneider, O; Schopper, A; Schune, M-H; Schwemmer, R; Sciascia, B; Sciubba, A; Seco, M; Semennikov, A; Senderowska, K; Sepp, I; Serra, N; Serrano, J; Seyfert, P; Shapkin, M; Shapoval, I; Shatalov, P; Shcheglov, Y; Shears, T; Shekhtman, L; Shevchenko, O; Shevchenko, V; Shires, A; Silva Coutinho, R; Skwarnicki, T; Smith, A C; Smith, N A; Smith, E; Sobczak, K; Soler, F J P; Solomin, A; Soomro, F; Souza De Paula, B; Spaan, B; Sparkes, A; Spradlin, P; Stagni, F; Stahl, S; Steinkamp, O; Stoica, S; Stone, S; Storaci, B; Straticiuc, M; Straumann, U; Subbiah, V K; Swientek, S; Szczekowski, M; Szczypka, P; Szumlak, T; T'Jampens, S; Teodorescu, E; Teubert, F; Thomas, C; Thomas, E; van Tilburg, J; Tisserand, V; Tobin, M; Topp-Joergensen, S; Torr, N; Tournefier, E; Tran, M T; Tsaregorodtsev, A; Tuning, N; Ubeda Garcia, M; Ukleja, A; Urquijo, P; Uwer, U; Vagnoni, V; Valenti, G; Vazquez Gomez, R; Vazquez Regueiro, P; Vecchi, S; Velthuis, J J; Veltri, M; Viaud, B; Videau, I; Vilasis-Cardona, X; Visniakov, J; Vollhardt, A; Volyanskyy, D; Voong, D; Vorobyev, A; Voss, H; Wandernoth, S; Wang, J; Ward, D R; Watson, N K; Webber, A D; Websdale, D; Whitehead, M; Wiedner, D; Wiggers, L; Wilkinson, G; Williams, M P; Williams, M; Wilson, F F; Wishahi, J; Witek, M; Witzeling, W; Wotton, S A; Wyllie, K; Xie, Y; Xing, F; Xing, Z; Yang, Z; Young, R; Yushchenko, O; Zavertyaev, M; Zhang, F; Zhang, L; Zhang, W C; Zhang, Y; Zhelezov, A; Zhong, L; Zverev, E; Zvyagin, A

    2012-01-01

    A search for time-integrated $CP$ violation in $D^0 \\rightarrow h^-h^+$ ($h=K$, $\\pi$) decays is presented using 0.62~fb$^{-1}$ of data collected by LHCb in 2011. The flavor of the charm meson is determined by the charge of the slow pion in the $D^{*+} \\rightarrow D^0 \\pi^+$ and $D^{*-} \\rightarrow \\overline{D}^0 \\pi^-$ decay chains. The difference in $CP$ asymmetry between $D^0 \\rightarrow K^- K^+$ and $D^0 \\rightarrow \\pi^- \\pi^+$, $\\Delta A_{CP} \\equiv A_{CP}(K^-K^+) \\, - \\, A_{CP}(\\pi^-\\pi^+)$, is measured to be $\\left[ -0.82 \\pm 0.21 (\\mathrm{stat.}) \\pm 0.11 (\\mathrm{syst.}) \\right]\\%$. This differs from the hypothesis of $CP$ conservation by $3.5$ standard deviations.

  4. Sudden rotation reactive scattering: Theory and application to 3-D H+H2

    International Nuclear Information System (INIS)

    Bowman, J.M.; Lee, K.T.

    1980-01-01

    An approximate quantum mechanical theory of reactive scattering is presented and applied to the H+H 2 reaction in three dimensions. Centrifugal sudden and rotational sudden approximations are made in each arrangement channel, however, vibrational states are treated in a fully coupled manner. Matching of arrangement channel wave functions is done where the arrangement channel centrifugal potentials are equal. This matching is particularly appropriate for collinearly favored reactions. Integral and differential cross sections are calculated for the H+H 2 reaction for H 2 in the ground and first excited vibrational states. These calculations employ the Porter--Karplus potential energy surface mainly to allow for comparisons with previous accurate and approximate quantal and quasiclassical calculations

  5. Efficient evaluation of shortest travel-time path queries through spatial mashups

    KAUST Repository

    Zhang, Detian; Chow, Chi-Yin; Liu, An; Zhang, Xiangliang; Ding, Qingzhu; Li, Qing

    2017-01-01

    In the real world, the route/path with the shortest travel time in a road network is more meaningful than that with the shortest network distance for location-based services (LBS). However, not every LBS provider has adequate resources to compute/estimate travel time for routes by themselves. A cost-effective way for LBS providers to estimate travel time for routes is to issue external route requests to Web mapping services (e.g., Google Maps, Bing Maps, and MapQuest Maps). Due to the high cost of processing such external route requests and the usage limits of Web mapping services, we take the advantage of direction sharing, parallel requesting and waypoints supported by Web mapping services to reduce the number of external route requests and the query response time for shortest travel-time route queries in this paper. We first give the definition of sharing ability to reflect the possibility of sharing the direction information of a route with others, and find out the queries that their query routes are independent with each other for parallel processing. Then, we model the problem of selecting the optimal waypoints for an external route request as finding the longest simple path in a weighted complete digraph. As it is a MAX SNP-hard problem, we propose a greedy algorithm with performance guarantee to find the best set of waypoints in an external route request. We evaluate the performance of our approach using a real Web mapping service, a real road network, real and synthetic data sets. Experimental results show the efficiency, scalability, and applicability of our approach.

  6. Efficient evaluation of shortest travel-time path queries through spatial mashups

    KAUST Repository

    Zhang, Detian

    2017-01-07

    In the real world, the route/path with the shortest travel time in a road network is more meaningful than that with the shortest network distance for location-based services (LBS). However, not every LBS provider has adequate resources to compute/estimate travel time for routes by themselves. A cost-effective way for LBS providers to estimate travel time for routes is to issue external route requests to Web mapping services (e.g., Google Maps, Bing Maps, and MapQuest Maps). Due to the high cost of processing such external route requests and the usage limits of Web mapping services, we take the advantage of direction sharing, parallel requesting and waypoints supported by Web mapping services to reduce the number of external route requests and the query response time for shortest travel-time route queries in this paper. We first give the definition of sharing ability to reflect the possibility of sharing the direction information of a route with others, and find out the queries that their query routes are independent with each other for parallel processing. Then, we model the problem of selecting the optimal waypoints for an external route request as finding the longest simple path in a weighted complete digraph. As it is a MAX SNP-hard problem, we propose a greedy algorithm with performance guarantee to find the best set of waypoints in an external route request. We evaluate the performance of our approach using a real Web mapping service, a real road network, real and synthetic data sets. Experimental results show the efficiency, scalability, and applicability of our approach.

  7. Shortest path problem on a grid network with unordered intermediate points

    Science.gov (United States)

    Saw, Veekeong; Rahman, Amirah; Eng Ong, Wen

    2017-10-01

    We consider a shortest path problem with single cost factor on a grid network with unordered intermediate points. A two stage heuristic algorithm is proposed to find a feasible solution path within a reasonable amount of time. To evaluate the performance of the proposed algorithm, computational experiments are performed on grid maps of varying size and number of intermediate points. Preliminary results for the problem are reported. Numerical comparisons against brute forcing show that the proposed algorithm consistently yields solutions that are within 10% of the optimal solution and uses significantly less computation time.

  8. Influence of drag force upon the shortest time trajectory of an aircraft

    Directory of Open Access Journals (Sweden)

    Andrei CRAIFALEANU

    2015-06-01

    Full Text Available The shortest time trajectory of an aircraft between two given locations is determined using a simple mathematical model. By taking into account the drag force (viscous friction force with the air, a problem of variational calculus is obtained which consists in determining two functions that minimize a functional, subject to a non-holonomic constraint. The trajectory is determined directly, by numerical integration of Euler equations with multipliers. Three types of drag forces were considered: constant, linear and quadratic. The results are verified through comparison to the values obtained from numerical minimization of the involved functional approximate forms.

  9. Study on k-shortest paths with behavioral impedance domain from the intermodal public transportation system perspective

    OpenAIRE

    Pereira, Hernane Borges de Barros; Pérez Vidal, Lluís; Lozada, Eleazar G. Madrid

    2003-01-01

    Behavioral impedance domain consists of a theory on route planning for pedestrians, within which constraint management is considered. The goal of this paper is to present the k-shortest path model using the behavioral impedance approach. After the mathematical model building, optimization problem and resolution problem by a behavioral impedance algorithm, it is discussed how behavioral impedance cost function is embedded in the k-shortest path model. From the pedestrian's route planning persp...

  10. A shortest-path graph kernel for estimating gene product semantic similarity

    Directory of Open Access Journals (Sweden)

    Alvarez Marco A

    2011-07-01

    Full Text Available Abstract Background Existing methods for calculating semantic similarity between gene products using the Gene Ontology (GO often rely on external resources, which are not part of the ontology. Consequently, changes in these external resources like biased term distribution caused by shifting of hot research topics, will affect the calculation of semantic similarity. One way to avoid this problem is to use semantic methods that are "intrinsic" to the ontology, i.e. independent of external knowledge. Results We present a shortest-path graph kernel (spgk method that relies exclusively on the GO and its structure. In spgk, a gene product is represented by an induced subgraph of the GO, which consists of all the GO terms annotating it. Then a shortest-path graph kernel is used to compute the similarity between two graphs. In a comprehensive evaluation using a benchmark dataset, spgk compares favorably with other methods that depend on external resources. Compared with simUI, a method that is also intrinsic to GO, spgk achieves slightly better results on the benchmark dataset. Statistical tests show that the improvement is significant when the resolution and EC similarity correlation coefficient are used to measure the performance, but is insignificant when the Pfam similarity correlation coefficient is used. Conclusions Spgk uses a graph kernel method in polynomial time to exploit the structure of the GO to calculate semantic similarity between gene products. It provides an alternative to both methods that use external resources and "intrinsic" methods with comparable performance.

  11. Floyd-warshall algorithm to determine the shortest path based on android

    Science.gov (United States)

    Ramadiani; Bukhori, D.; Azainil; Dengen, N.

    2018-04-01

    The development of technology has made all areas of life easier now, one of which is the ease of obtaining geographic information. The use of geographic information may vary according to need, for example, the digital map learning, navigation systems, observations area, and much more. With the support of adequate infrastructure, almost no one will ever get lost to a destination even to foreign places or that have never been visited before. The reasons why many institutions and business entities use technology to improve services to consumers and to streamline the production process undertaken and so forth. Speaking of the efficient, there are many elements related to efficiency in navigation systems, and one of them is the efficiency in terms of distance. The shortest distance determination algorithm required in this research is used Floyd-Warshall Algorithm. Floyd-Warshall algorithm is the algorithm to find the fastest path and the shortest distance between 2 nodes, while the program is intended to find the path of more than 2 nodes.

  12. Comparison of Genetic Algorithm and Hill Climbing for Shortest Path Optimization Mapping

    Directory of Open Access Journals (Sweden)

    Fronita Mona

    2018-01-01

    Full Text Available Traveling Salesman Problem (TSP is an optimization to find the shortest path to reach several destinations in one trip without passing through the same city and back again to the early departure city, the process is applied to the delivery systems. This comparison is done using two methods, namely optimization genetic algorithm and hill climbing. Hill Climbing works by directly selecting a new path that is exchanged with the neighbour’s to get the track distance smaller than the previous track, without testing. Genetic algorithms depend on the input parameters, they are the number of population, the probability of crossover, mutation probability and the number of generations. To simplify the process of determining the shortest path supported by the development of software that uses the google map API. Tests carried out as much as 20 times with the number of city 8, 16, 24 and 32 to see which method is optimal in terms of distance and time computation. Based on experiments conducted with a number of cities 3, 4, 5 and 6 producing the same value and optimal distance for the genetic algorithm and hill climbing, the value of this distance begins to differ with the number of city 7. The overall results shows that these tests, hill climbing are more optimal to number of small cities and the number of cities over 30 optimized using genetic algorithms.

  13. Ab initio study of H + + H 2 collisions: Elastic/inelastic and charge transfer processes

    Science.gov (United States)

    Saieswari, A.; Kumar, Sanjay

    2007-12-01

    An ab initio full configuration interaction study has been undertaken to obtain the global potential energy surfaces for the ground and the first excited electronic state of the H + + H 2 system employing Dunning's cc-pVQZ basis set. Using the ab initio approach the corresponding quasi-diabatic potential energy surfaces and coupling potentials have been obtained. A time-independent quantum mechanical study has been also undertaken for both the inelastic and charge transfer processes at the experimental collision energy Ec.m. = 20.0 eV and the preliminary results show better agreement with the experimental data as compared to the earlier available theoretical studies.

  14. Search for the rare decays D →h (h('))e+e-

    Science.gov (United States)

    Ablikim, M.; Achasov, M. N.; Ahmed, S.; Albrecht, M.; Alekseev, M.; Amoroso, A.; An, F. F.; An, Q.; Bai, J. Z.; Bai, Y.; Bakina, O.; Baldini Ferroli, R.; Ban, Y.; Begzsuren, K.; Bennett, D. W.; Bennett, J. V.; Berger, N.; Bertani, M.; Bettoni, D.; Bianchi, F.; Boger, E.; Boyko, I.; Briere, R. A.; Cai, H.; Cai, X.; Cakir, O.; Calcaterra, A.; Cao, G. F.; Cetin, S. A.; Chai, J.; Chang, J. F.; Chelkov, G.; Chen, G.; Chen, H. S.; Chen, J. C.; Chen, M. L.; Chen, P. L.; Chen, S. J.; Chen, X. R.; Chen, Y. B.; Cheng, W.; Chu, X. K.; Cibinetto, G.; Cossio, F.; Dai, H. L.; Dai, J. P.; Dbeyssi, A.; Dedovich, D.; Deng, Z. Y.; Denig, A.; Denysenko, I.; Destefanis, M.; de Mori, F.; Ding, Y.; Dong, C.; Dong, J.; Dong, L. Y.; Dong, M. Y.; Dou, Z. L.; Du, S. X.; Duan, P. F.; Fang, J.; Fang, S. S.; Fang, Y.; Farinelli, R.; Fava, L.; Fegan, S.; Feldbauer, F.; Felici, G.; Feng, C. Q.; Fioravanti, E.; Fritsch, M.; Fu, C. D.; Gao, Q.; Gao, X. L.; Gao, Y.; Gao, Y. G.; Gao, Z.; Garillon, B.; Garzia, I.; Gilman, A.; Goetzen, K.; Gong, L.; Gong, W. X.; Gradl, W.; Greco, M.; Gu, M. H.; Gu, Y. T.; Guo, A. Q.; Guo, R. P.; Guo, Y. P.; Guskov, A.; Haddadi, Z.; Han, S.; Hao, X. Q.; Harris, F. A.; He, K. L.; He, X. Q.; Heinsius, F. H.; Held, T.; Heng, Y. K.; Hou, Z. L.; Hu, H. M.; Hu, J. F.; Hu, T.; Hu, Y.; Huang, G. S.; Huang, J. S.; Huang, X. T.; Huang, X. Z.; Huang, Z. L.; Hussain, T.; Ikegami Andersson, W.; Irshad, M.; Ji, Q.; Ji, Q. P.; Ji, X. B.; Ji, X. L.; Jiang, X. S.; Jiang, X. Y.; Jiao, J. B.; Jiao, Z.; Jin, D. P.; Jin, S.; Jin, Y.; Johansson, T.; Julin, A.; Kalantar-Nayestanaki, N.; Kang, X. S.; Kavatsyuk, M.; Ke, B. C.; Keshk, I. K.; Khan, T.; Khoukaz, A.; Kiese, P.; Kiuchi, R.; Kliemt, R.; Koch, L.; Kolcu, O. B.; Kopf, B.; Kornicer, M.; Kuemmel, M.; Kuessner, M.; Kupsc, A.; Kurth, M.; Kühn, W.; Lange, J. S.; Larin, P.; Lavezzi, L.; Leithoff, H.; Li, C.; Li, Cheng; Li, D. M.; Li, F.; Li, F. Y.; Li, G.; Li, H. B.; Li, H. J.; Li, J. C.; Li, J. W.; Li, Jin; Li, K. J.; Li, Kang; Li, Ke; Li, Lei; Li, P. L.; Li, P. R.; Li, Q. Y.; Li, W. D.; Li, W. G.; Li, X. L.; Li, X. N.; Li, X. Q.; Li, Z. B.; Liang, H.; Liang, Y. F.; Liang, Y. T.; Liao, G. R.; Liao, L. Z.; Libby, J.; Lin, C. X.; Lin, D. X.; Liu, B.; Liu, B. J.; Liu, C. X.; Liu, D.; Liu, D. Y.; Liu, F. H.; Liu, Fang; Liu, Feng; Liu, H. B.; Liu, H. L.; Liu, H. M.; Liu, Huanhuan; Liu, Huihui; Liu, J. B.; Liu, J. Y.; Liu, K.; Liu, K. Y.; Liu, Ke; Liu, L. D.; Liu, Q.; Liu, S. B.; Liu, X.; Liu, Y. B.; Liu, Z. A.; Liu, Zhiqing; Long, Y. F.; Lou, X. C.; Lu, H. J.; Lu, J. G.; Lu, Y.; Lu, Y. P.; Luo, C. L.; Luo, M. X.; Luo, T.; Luo, X. L.; Lusso, S.; Lyu, X. R.; Ma, F. C.; Ma, H. L.; Ma, L. L.; Ma, M. M.; Ma, Q. M.; Ma, T.; Ma, X. N.; Ma, X. Y.; Ma, Y. M.; Maas, F. E.; Maggiora, M.; Maldaner, S.; Malik, Q. A.; Mangoni, A.; Mao, Y. J.; Mao, Z. P.; Marcello, S.; Meng, Z. X.; Messchendorp, J. G.; Mezzadri, G.; Min, J.; Mitchell, R. E.; Mo, X. H.; Mo, Y. J.; Morales Morales, C.; Muchnoi, N. Yu.; Muramatsu, H.; Mustafa, A.; Nefedov, Y.; Nerling, F.; Nikolaev, I. B.; Ning, Z.; Nisar, S.; Niu, S. L.; Niu, X. Y.; Olsen, S. L.; Ouyang, Q.; Pacetti, S.; Pan, Y.; Papenbrock, M.; Patteri, P.; Pelizaeus, M.; Pellegrino, J.; Peng, H. P.; Peng, Z. Y.; Peters, K.; Pettersson, J.; Ping, J. L.; Ping, R. G.; Pitka, A.; Poling, R.; Prasad, V.; Qi, H. R.; Qi, M.; Qi, T. Y.; Qian, S.; Qiao, C. F.; Qin, N.; Qin, X. S.; Qin, Z. H.; Qiu, J. F.; Qu, S. Q.; Rashid, K. H.; Redmer, C. F.; Richter, M.; Ripka, M.; Rivetti, A.; Rolo, M.; Rong, G.; Rosner, Ch.; Sarantsev, A.; Savrié, M.; Schoenning, K.; Shan, W.; Shan, X. Y.; Shao, M.; Shen, C. P.; Shen, P. X.; Shen, X. Y.; Sheng, H. Y.; Shi, X.; Song, J. J.; Song, W. M.; Song, X. Y.; Sosio, S.; Sowa, C.; Spataro, S.; Sun, G. X.; Sun, J. F.; Sun, L.; Sun, S. S.; Sun, X. H.; Sun, Y. J.; Sun, Y. K.; Sun, Y. Z.; Sun, Z. J.; Sun, Z. T.; Tan, Y. T.; Tang, C. J.; Tang, G. Y.; Tang, X.; Tapan, I.; Tiemens, M.; Tsednee, B.; Uman, I.; Wang, B.; Wang, B. L.; Wang, D.; Wang, D. Y.; Wang, Dan; Wang, K.; Wang, L. L.; Wang, L. S.; Wang, M.; Wang, Meng; Wang, P.; Wang, P. L.; Wang, W. P.; Wang, X. F.; Wang, Y.; Wang, Y. F.; Wang, Z.; Wang, Z. G.; Wang, Z. Y.; Wang, Zongyuan; Weber, T.; Wei, D. H.; Weidenkaff, P.; Wen, S. P.; Wiedner, U.; Wolke, M.; Wu, L. H.; Wu, L. J.; Wu, Z.; Xia, L.; Xia, Y.; Xiao, D.; Xiao, Y. J.; Xiao, Z. J.; Xie, Y. G.; Xie, Y. H.; Xiong, X. A.; Xiu, Q. L.; Xu, G. F.; Xu, J. J.; Xu, L.; Xu, Q. J.; Xu, Q. N.; Xu, X. P.; Yan, F.; Yan, L.; Yan, W. B.; Yan, W. C.; Yan, Y. H.; Yang, H. J.; Yang, H. X.; Yang, L.; Yang, R. X.; Yang, Y. H.; Yang, Y. X.; Yang, Yifan; Yang, Z. Q.; Ye, M.; Ye, M. H.; Yin, J. H.; You, Z. Y.; Yu, B. X.; Yu, C. X.; Yu, J. S.; Yu, J. S.; Yuan, C. Z.; Yuan, Y.; Yuncu, A.; Zafar, A. A.; Zeng, Y.; Zhang, B. X.; Zhang, B. Y.; Zhang, C. C.; Zhang, D. H.; Zhang, H. H.; Zhang, H. Y.; Zhang, J.; Zhang, J. L.; Zhang, J. Q.; Zhang, J. W.; Zhang, J. Y.; Zhang, J. Z.; Zhang, K.; Zhang, L.; Zhang, T. J.; Zhang, X. Y.; Zhang, Y.; Zhang, Y. H.; Zhang, Y. T.; Zhang, Yang; Zhang, Yao; Zhang, Yu; Zhang, Z. H.; Zhang, Z. P.; Zhang, Z. Y.; Zhao, G.; Zhao, J. W.; Zhao, J. Y.; Zhao, J. Z.; Zhao, Lei; Zhao, Ling; Zhao, M. G.; Zhao, Q.; Zhao, S. J.; Zhao, T. C.; Zhao, Y. B.; Zhao, Z. G.; Zhemchugov, A.; Zheng, B.; Zheng, J. P.; Zheng, W. J.; Zheng, Y. H.; Zhong, B.; Zhou, L.; Zhou, Q.; Zhou, X.; Zhou, X. K.; Zhou, X. R.; Zhou, X. Y.; Zhou, Xiaoyu; Zhou, Xu; Zhu, A. N.; Zhu, J.; Zhu, J.; Zhu, K.; Zhu, K. J.; Zhu, S.; Zhu, S. H.; Zhu, X. L.; Zhu, Y. C.; Zhu, Y. S.; Zhu, Z. A.; Zhuang, J.; Zou, B. S.; Zou, J. H.; Besiii Collaboration

    2018-04-01

    We search for rare decays of D mesons to hadrons accompanied by an electron-positron pair (h (h('))e+e-), using an e+e- collision sample corresponding to an integrated luminosity of 2.93 fb-1 collected with the BESIII detector at √{s }=3.773 GeV . No significant signals are observed, and the corresponding upper limits on the branching fractions at the 90% confidence level are determined. The sensitivities of the results are at the level of 10-5- 10-6 , providing a large improvement over previous searches.

  15. Optimizing laboratory animal stress paradigms: The H-H* experimental design.

    Science.gov (United States)

    McCarty, Richard

    2017-01-01

    Major advances in behavioral neuroscience have been facilitated by the development of consistent and highly reproducible experimental paradigms that have been widely adopted. In contrast, many different experimental approaches have been employed to expose laboratory mice and rats to acute versus chronic intermittent stress. An argument is advanced in this review that more consistent approaches to the design of chronic intermittent stress experiments would provide greater reproducibility of results across laboratories and greater reliability relating to various neural, endocrine, immune, genetic, and behavioral adaptations. As an example, the H-H* experimental design incorporates control, homotypic (H), and heterotypic (H*) groups and allows for comparisons across groups, where each animal is exposed to the same stressor, but that stressor has vastly different biological and behavioral effects depending upon each animal's prior stress history. Implementation of the H-H* experimental paradigm makes possible a delineation of transcriptional changes and neural, endocrine, and immune pathways that are activated in precisely defined stressor contexts. Copyright © 2016 Elsevier Ltd. All rights reserved.

  16. Voltammetric Perspectives on the Acidity Scale and H+/H2 Process in Ionic Liquid Media.

    Science.gov (United States)

    Bentley, Cameron L; Bond, Alan M; Zhang, Jie

    2018-03-19

    Nonhaloaluminate ionic liquids (ILs) have received considerable attention as alternatives to molecular solvents in diverse applications spanning the fields of physical, chemical, and biological science. One important and often overlooked aspect of the implementation of these designer solvents is how the properties of the IL formulation affect (electro)chemical reactivity. This aspect is emphasized herein, where recent (voltammetric) studies on the energetics of proton (H + ) transfer and electrode reaction mechanisms of the H + H 2 process in IL media are highlighted and discussed. The energetics of proton transfer, quantified using the pK 3 a (minus logarithm of acidity equilibrium constant, K a ) formalism, is strongly governed by the constituent IL anion, and to a lesser extent, the IL cation. The H + /H 2 process, a model inner-sphere reaction, also displays electrochemical characteristics that are strongly IL-dependent. Overall, these studies highlight the need to carry out systematic investigations to resolve IL structure and function relationships in order to realize the potential of these diverse and versatile solvents. Expected final online publication date for the Annual Review of Analytical Chemistry Volume 11 is June 12, 2018. Please see http://www.annualreviews.org/page/journal/pubdates for revised estimates.

  17. The Shortest QRS Duration of an Electrocardiogram Might Be an Optimal Electrocardiographic Predictor for Response to Cardiac Resynchronization Therapy.

    Science.gov (United States)

    Chen, Jan-Yow; Lin, Kuo-Hung; Chang, Kuan-Cheng; Chou, Che-Yi

    2017-08-03

    QRS duration has been associated with the response to cardiac resynchronization therapy (CRT). However, the methods for defining QRS duration to predict the outcome of CRT have discrepancies in previous reports. The aim of this study was to determine an optimal measurement of QRS duration to predict the response to CRT.Sixty-one patients who received CRT were analyzed. All patients had class III-IV heart failure, left ventricular ejection fraction not more than 35%, and complete left bundle branch block. The shortest, longest, and average QRS durations from the 12 leads of each electrocardiogram (ECG) were measured. The responses to CRT were determined using the changes in echocardiography after 6 months. Thirty-five (57.4%) patients were responders and 26 (42.6%) patients were non-responders. The pre-procedure shortest, average, and longest QRS durations and the QRS shortening (ΔQRS) of the shortest QRS duration were significantly associated with the response to CRT in a univariate logistic regression analysis (P = 0.002, P = 0.03, P = 0.04 and P = 0.04, respectively). Based on the measurement of the area under curve of the receiver operating characteristic curve, only the pre-procedure shortest QRS duration and the ΔQRS of the shortest QRS duration showed significant discrimination for the response to CRT (P = 0.002 and P = 0.038, respectively). Multivariable logistic regression showed the pre-procedure shortest QRS duration is an independent predictor for the response to CRT.The shortest QRS duration from the 12 leads of the electrocardiogram might be an optimal measurement to predict the response to CRT.

  18. Study of CP violation in the B0 → h+h-(h = π, K) decay by the BaBar detector at SLAC

    International Nuclear Information System (INIS)

    Pivk, Muriel

    2003-01-01

    The absence of antimatter in the universe imposes the study of the CP symmetry violation. This phenomenon first uncovered in the K meson systems has been recently evidenced in the B meson systems. The B factories PEP-II and KEK-B produce e + e - in the Υ(4S) resonance, which undergoes a decay into charged or neutral BB-bar pairs. Evidencing the CP violation requires a measurement of the difference between the B meson decays towards a precise final state and the B-bar meson decay, i.e. of the CP conjugate antiparticle of B. The work described in this thesis has been carried out since January 2001 with the detector BABAR. Namely, the subject matter of the thesis was the study of the neutral B meson decay into two charmless bodies in the final state B 0 /B 0 -bar → h + h - (h = π, K). Since events in these channels are extremely rare a major task of the analysis is to lower the background as much as possible. The decays allow studying the CP violation namely, through the α angle of the unitarity triangle describing the CP violation in the Standard Model. This new information added to the β angle and to other CKM matrix parameters, already measured, permits strengthening the constraints on the Standard Model parameters. This thesis is structured in three parts. The first one deals with the theory. First it presents a general description of the weak interaction within in the frame of the Standard Model, as well as a description of the B 0 /B 0 -bar system. The second chapter presents the B 0 → π + π - decay which is indeed the core of this thesis. Four theoretical models studied for the interpretation of the results are also described. The second part is devoted to the experimental setup. The PEP-II collider and the BABAR detector are described thoroughly to comprehend the key points of the analysis. The third part presents details of the analysis of experimental results from the data acquisition up to extraction of measurement magnitudes. The chapter four

  19. Reduction of wind power induced reserve requirements by advanced shortest-term forecasts and prediction intervals

    Energy Technology Data Exchange (ETDEWEB)

    Dobschinski, Jan; Wessel, Arne; Lange, Bernhard; Bremen, Lueder von [Fraunhofer Institut fuer Windenergie und Energiesystemtechnik (IWES), Kassel (Germany)

    2009-07-01

    In electricity systems with large penetration of wind power, the limited predictability of the wind power generation leads to an increase in reserve and balancing requirements. At first the present study concentrates on the capability of dynamic day-ahead prediction intervals to reduce the wind power induced reserve and balancing requirements. Alternatively the reduction of large forecast errors of the German wind power generation by using advanced shortest-term predictions has been evaluated in a second approach. With focus on the allocation of minute reserve power the aim is to estimate the maximal remaining uncertainty after trading activities on the intraday market. Finally both approaches were used in a case study concerning the reserve requirements induced by the total German wind power expansion in 2007. (orig.)

  20. The tomography of human mobility - what do shortest-path trees reveal?

    Energy Technology Data Exchange (ETDEWEB)

    Thiemann, Christian [Eng. Sci. and Appl. Math, Northwestern University, Evanston, IL (United States); Max-Planck-Institute for Dynamics and Self-Organization, Goettingen (Germany); Grady, Daniel; Brockmann, Dirk [Eng. Sci. and Appl. Math, Northwestern University, Evanston, IL (United States)

    2010-07-01

    Similar to illustrating the anatomy of organs using pictures of tissue slices taken at various depths, we construct shortest-path trees of different nodes to create tomograms of large-scale human mobility networks. This tomography allows us to measure global properties of the system conditioned on a reference location in the network to gain a fuller characterization of a node. It also suggests a canonical coordinate system for representing complex networks and dynamical processes thereon in a simplified way, revealing a new symmetry in the human mobility networks we investigated. Furthermore, introducing the notion of tree similarity, we devised a new technique for clustering nodes with similar topological footprint, yielding a unique and efficient method for community identification and topological backbone extraction. We applied these methods to a multi-scale human mobility network obtained from the dollar-bill-tracking site wheresgoerge.com and to the U.S. and world-wide air transportation network.

  1. Study of Charmless Bd,s0 → h+h'-π0 decays in LHCb

    International Nuclear Information System (INIS)

    Roa Romero, D.A.

    2013-01-01

    This thesis work is about the identification of charmless three-body decays of neutral B mesons with a π 0 in the final state (B d,s 0 → h + h' - π 0 ) through the analysis of a 1.0 fb -1 data sample collected in 2011 by the LHCb experiment at the LHC. Those modes are sensitive to CKM parameters and allow to test Standard Model predictions related to CP violation. Some of them, such as B s 0 → K - π + π 0 and B s 0 → K + K - π 0 , have not been observed previously. This is the first analysis with energetic π 0 in LHCb. To evaluate the detector performance for π 0 , D *+ → D 0 (→ K - π + π 0 )π + decays have been selected. This provides a clean and high statistics sample of neutral pions used to study their energy calibration as well as the effectiveness of the π 0 /γ separation tool of the experiment. Radiative decays are indeed the most dangerous backgrounds for the study of B d,s 0 → h + h' - π 0 modes. To select B d,s 0 → h + h' - π 0 events, a dedicated trigger algorithm has been implemented. It complements the standard online selections and significantly improves the efficiency. Offline, obvious backgrounds, mainly from charm decays, are rejected applying simple criteria. The sample is then further purified using a multivariate classifier. At last, information from the ring imaging Cherenkov detectors allows to separate π + π - π 0 , K ± π ± π 0 and K + K - π 0 final states. A simultaneous fit of the reconstructed B mass spectra in the three sub-samples is used to extract the signal yields. It accounts for the different backgrounds remaining as well as for the signal cross-feeds from one sub-sample to the other. The B 0 → π + π - π 0 , B 0 → K + π - π 0 and B s 0 → K + K - π 0 contributions are clearly established. This is the first observation of the B s 0 → K + K - π 0 decay mode. (author)

  2. A minimum resource neural network framework for solving multiconstraint shortest path problems.

    Science.gov (United States)

    Zhang, Junying; Zhao, Xiaoxue; He, Xiaotao

    2014-08-01

    Characterized by using minimum hard (structural) and soft (computational) resources, a novel parameter-free minimal resource neural network (MRNN) framework is proposed for solving a wide range of single-source shortest path (SP) problems for various graph types. The problems are the k-shortest time path problems with any combination of three constraints: time, hop, and label constraints, and the graphs can be directed, undirected, or bidirected with symmetric and/or asymmetric traversal time, which can be real and time dependent. Isomorphic to the graph where the SP is to be sought, the network is activated by generating autowave at source neuron and the autowave travels automatically along the paths with the speed of a hop in an iteration. Properties of the network are studied, algorithms are presented, and computation complexity is analyzed. The framework guarantees globally optimal solutions of a series of problems during the iteration process of the network, which provides insight into why even the SP is still too long to be satisfied. The network facilitates very large scale integrated circuit implementation and adapt to very large scale problems due to its massively parallel processing and minimum resource utilization. When implemented in a sequentially processing computer, experiments on synthetic graphs, road maps of cities of the USA, and vehicle routing with time windows indicate that the MRNN is especially efficient for large scale sparse graphs and even dense graphs with some constraints, e.g., the CPU time taken and the iteration number used for the road maps of cities of the USA is even less than  ∼ 2% and 0.5% that of the Dijkstra's algorithm.

  3. A MODIFIED GENETIC ALGORITHM FOR FINDING FUZZY SHORTEST PATHS IN UNCERTAIN NETWORKS

    Directory of Open Access Journals (Sweden)

    A. A. Heidari

    2016-06-01

    Full Text Available In realistic network analysis, there are several uncertainties in the measurements and computation of the arcs and vertices. These uncertainties should also be considered in realizing the shortest path problem (SPP due to the inherent fuzziness in the body of expert's knowledge. In this paper, we investigated the SPP under uncertainty to evaluate our modified genetic strategy. We improved the performance of genetic algorithm (GA to investigate a class of shortest path problems on networks with vague arc weights. The solutions of the uncertain SPP with considering fuzzy path lengths are examined and compared in detail. As a robust metaheuristic, GA algorithm is modified and evaluated to tackle the fuzzy SPP (FSPP with uncertain arcs. For this purpose, first, a dynamic operation is implemented to enrich the exploration/exploitation patterns of the conventional procedure and mitigate the premature convergence of GA technique. Then, the modified GA (MGA strategy is used to resolve the FSPP. The attained results of the proposed strategy are compared to those of GA with regard to the cost, quality of paths and CPU times. Numerical instances are provided to demonstrate the success of the proposed MGA-FSPP strategy in comparison with GA. The simulations affirm that not only the proposed technique can outperform GA, but also the qualities of the paths are effectively improved. The results clarify that the competence of the proposed GA is preferred in view of quality quantities. The results also demonstrate that the proposed method can efficiently be utilized to handle FSPP in uncertain networks.

  4. Stopping power of antiprotons in H, H2, and He targets

    DEFF Research Database (Denmark)

    Lühr, Armin Christian; Saenz, Alejandro

    2009-01-01

    The stopping power of antiprotons in atomic and molecular hydrogen as well as helium was calculated in an impact-energy range from 1 keV to 6.4 MeV. In the case of H2 and He the targets were described with a single-active electron model centered on the target. The collision process was treated...... of the corrections to the first-order stopping number, the average energy transferred to the target electrons, and the relative importance of the excitation and the ionization process for the energy loss of the projectile was determined. Finally, the stopping powers of the H, H2, and He targets were directly...

  5. Search for direct $CP$ violation in $D^0 \\rightarrow h^- h^+$ modes using semileptonic $B$ decays

    CERN Document Server

    INSPIRE-00258707; Abellan Beteta, C; Adeva, B; Adinolfi, M; Adrover, C; Affolder, A; Ajaltouni, Z; Albrecht, J; Alessio, F; Alexander, M; Ali, S; Alkhazov, G; Alvarez Cartelle, P; Alves Jr, A A; Amato, S; Amerio, S; Amhis, Y; Anderlini, L; Anderson, J; Andreassen, R; Appleby, R B; Aquines Gutierrez, O; Archilli, F; Artamonov, A; Artuso, M; Aslanides, E; Auriemma, G; Bachmann, S; Back, J J; Baesso, C; Balagura, V; Baldini, W; Barlow, R J; Barschel, C; Barsuk, S; Barter, W; Bauer, Th; Bay, A; Beddow, J; Bedeschi, F; Bediaga, I; Belogurov, S; Belous, K; Belyaev, I; Ben-Haim, E; Benayoun, M; Bencivenni, G; Benson, S; Benton, J; Berezhnoy, A; Bernet, R; Bettler, M -O; van Beuzekom, M; Bien, A; Bifani, S; Bird, T; Bizzeti, A; Bjørnstad, P M; Blake, T; Blanc, F; Blouw, J; Blusk, S; Bocci, V; Bondar, A; Bondar, N; Bonivento, W; Borghi, S; Borgia, A; Bowcock, T J V; Bowen, E; Bozzi, C; Brambach, T; van den Brand, J; Bressieux, J; Brett, D; Britsch, M; Britton, T; Brook, N H; Brown, H; Burducea, I; Bursche, A; Busetto, G; Buytaert, J; Cadeddu, S; Callot, O; Calvi, M; Calvo Gomez, M; Camboni, A; Campana, P; Campora Perez, D; Carbone, A; Carboni, G; Cardinale, R; Cardini, A; Carranza-Mejia, H; Carson, L; Carvalho Akiba, K; Casse, G; Cattaneo, M; Cauet, Ch; Charles, M; Charpentier, Ph; Chen, P; Chiapolini, N; Chrzaszcz, M; Ciba, K; Cid Vidal, X; Ciezarek, G; Clarke, P E L; Clemencic, M; Cliff, H V; Closier, J; Coca, C; Coco, V; Cogan, J; Cogneras, E; Collins, P; Comerma-Montells, A; Contu, A; Cook, A; Coombes, M; Coquereau, S; Corti, G; Couturier, B; Cowan, G A; Craik, D; Cunliffe, S; Currie, R; D'Ambrosio, C; David, P; David, P N Y; De Bonis, I; De Bruyn, K; De Capua, S; De Cian, M; De Miranda, J M; De Paula, L; De Silva, W; De Simone, P; Decamp, D; Deckenhoff, M; Del Buono, L; Derkach, D; Deschamps, O; Dettori, F; Dijkstra, H; Dogaru, M; Donleavy, S; Dordei, F; Dosil Suárez, A; Dossett, D; Dovbnya, A; Dupertuis, F; Dzhelyadin, R; Dziurda, A; Dzyuba, A; Easo, S; Egede, U; Egorychev, V; Eidelman, S; van Eijk, D; Eisenhardt, S; Eitschberger, U; Ekelhof, R; Eklund, L; El Rifai, I; Elsasser, Ch; Elsby, D; Falabella, A; Färber, C; Fardell, G; Farinelli, C; Farry, S; Fave, V; Ferguson, D; Fernandez Albor, V; Ferreira Rodrigues, F; Ferro-Luzzi, M; Filippov, S; Fiore, M; Fitzpatrick, C; Fontana, M; Fontanelli, F; Forty, R; Francisco, O; Frank, M; Frei, C; Frosini, M; Furcas, S; Furfaro, E; Gallas Torreira, A; Galli, D; Gandelman, M; Gandini, P; Gao, Y; Garofoli, J; Garosi, P; Garra Tico, J; Garrido, L; Gaspar, C; Gauld, R; Gersabeck, E; Gersabeck, M; Gershon, T; Ghez, Ph; Gibson, V; Gligorov, V V; Göbel, C; Golubkov, D; Golutvin, A; Gomes, A; Gordon, H; Grabalosa Gándara, M; Graciani Diaz, R; Granado Cardoso, L A; Graugés, E; Graziani, G; Grecu, A; Greening, E; Gregson, S; Grünberg, O; Gui, B; Gushchin, E; Guz, Yu; Gys, T; Hadjivasiliou, C; Haefeli, G; Haen, C; Haines, S C; Hall, S; Hampson, T; Hansmann-Menzemer, S; Harnew, N; Harnew, S T; Harrison, J; Hartmann, T; He, J; Heijne, V; Hennessy, K; Henrard, P; Hernando Morata, J A; van Herwijnen, E; Hicks, E; Hill, D; Hoballah, M; Hombach, C; Hopchev, P; Hulsbergen, W; Hunt, P; Huse, T; Hussain, N; Hutchcroft, D; Hynds, D; Iakovenko, V; Idzik, M; Ilten, P; Jacobsson, R; Jaeger, A; Jans, E; Jaton, P; Jing, F; John, M; Johnson, D; Jones, C R; Jost, B; Kaballo, M; Kandybei, S; Karacson, M; Karbach, T M; Kenyon, I R; Kerzel, U; Ketel, T; Keune, A; Khanji, B; Kochebina, O; Komarov, I; Koopman, R F; Koppenburg, P; Korolev, M; Kozlinskiy, A; Kravchuk, L; Kreplin, K; Kreps, M; Krocker, G; Krokovny, P; Kruse, F; Kucharczyk, M; Kudryavtsev, V; Kvaratskheliya, T; La Thi, V N; Lacarrere, D; Lafferty, G; Lai, A; Lambert, D; Lambert, R W; Lanciotti, E; Lanfranchi, G; Langenbruch, C; Latham, T; Lazzeroni, C; Le Gac, R; van Leerdam, J; Lees, J -P; Lefèvre, R; Leflat, A; Lefrançois, J; Leo, S; Leroy, O; Leverington, B; Li, Y; Li Gioi, L; Liles, M; Lindner, R; Linn, C; Liu, B; Liu, G; Lohn, S; Longstaff, I; Lopes, J H; Lopez Asamar, E; Lopez-March, N; Lu, H; Lucchesi, D; Luisier, J; Luo, H; Machefert, F; Machikhiliyan, I V; Maciuc, F; Maev, O; Malde, S; Manca, G; Mancinelli, G; Marconi, U; Märki, R; Marks, J; Martellotti, G; Martens, A; Martin, L; Martín Sánchez, A; Martinelli, M; Martinez Santos, D; Martins Tostes, D; Massafferri, A; Matev, R; Mathe, Z; Matteuzzi, C; Maurice, E; Mazurov, A; McCarthy, J; McNulty, R; Mcnab, A; Meadows, B; Meier, F; Meissner, M; Merk, M; Milanes, D A; Minard, M -N; Molina Rodriguez, J; Monteil, S; Moran, D; Morawski, P; Morello, M J; Mountain, R; Mous, I; Muheim, F; Müller, K; Muresan, R; Muryn, B; Muster, B; Naik, P; Nakada, T; Nandakumar, R; Nasteva, I; Needham, M; Neufeld, N; Nguyen, A D; Nguyen, T D; Nguyen-Mau, C; Nicol, M; Niess, V; Niet, R; Nikitin, N; Nikodem, T; Nomerotski, A; Novoselov, A; Oblakowska-Mucha, A; Obraztsov, V; Oggero, S; Ogilvy, S; Okhrimenko, O; Oldeman, R; Orlandea, M; Otalora Goicochea, J M; Owen, P; Oyanguren, A; Pal, B K; Palano, A; Palutan, M; Panman, J; Papanestis, A; Pappagallo, M; Parkes, C; Parkinson, C J; Passaleva, G; Patel, G D; Patel, M; Patrick, G N; Patrignani, C; Pavel-Nicorescu, C; Pazos Alvarez, A; Pellegrino, A; Penso, G; Pepe Altarelli, M; Perazzini, S; Perego, D L; Perez Trigo, E; Pérez-Calero Yzquierdo, A; Perret, P; Perrin-Terrin, M; Pessina, G; Petridis, K; Petrolini, A; Phan, A; Picatoste Olloqui, E; Pietrzyk, B; Pilař, T; Pinci, D; Playfer, S; Plo Casasus, M; Polci, F; Polok, G; Poluektov, A; Polycarpo, E; Popov, D; Popovici, B; Potterat, C; Powell, A; Prisciandaro, J; Pugatch, V; Puig Navarro, A; Punzi, G; Qian, W; Rademacker, J H; Rakotomiaramanana, B; Rangel, M S; Raniuk, I; Rauschmayr, N; Raven, G; Redford, S; Reid, M M; dos Reis, A C; Ricciardi, S; Richards, A; Rinnert, K; Rives Molina, V; Roa Romero, D A; Robbe, P; Rodrigues, E; Rodriguez Perez, P; Roiser, S; Romanovsky, V; Romero Vidal, A; Rouvinet, J; Ruf, T; Ruffini, F; Ruiz, H; Ruiz Valls, P; Sabatino, G; Saborido Silva, J J; Sagidova, N; Sail, P; Saitta, B; Salzmann, C; Sanmartin Sedes, B; Sannino, M; Santacesaria, R; Santamarina Rios, C; Santovetti, E; Sapunov, M; Sarti, A; Satriano, C; Satta, A; Savrie, M; Savrina, D; Schaack, P; Schiller, M; Schindler, H; Schlupp, M; Schmelling, M; Schmidt, B; Schneider, O; Schopper, A; Schune, M -H; Schwemmer, R; Sciascia, B; Sciubba, A; Seco, M; Semennikov, A; Senderowska, K; Sepp, I; Serra, N; Serrano, J; Seyfert, P; Shapkin, M; Shapoval, I; Shatalov, P; Shcheglov, Y; Shears, T; Shekhtman, L; Shevchenko, O; Shevchenko, V; Shires, A; Silva Coutinho, R; Skwarnicki, T; Smith, N A; Smith, E; Smith, M; Sokoloff, M D; Soler, F J P; Soomro, F; Souza, D; Souza De Paula, B; Spaan, B; Sparkes, A; Spradlin, P; Stagni, F; Stahl, S; Steinkamp, O; Stoica, S; Stone, S; Storaci, B; Straticiuc, M; Straumann, U; Subbiah, V K; Swientek, S; Syropoulos, V; Szczekowski, M; Szczypka, P; Szumlak, T; T'Jampens, S; Teklishyn, M; Teodorescu, E; Teubert, F; Thomas, C; Thomas, E; van Tilburg, J; Tisserand, V; Tobin, M; Tolk, S; Topp-Joergensen, S; Torr, N; Tournefier, E; Tourneur, S; Tran, M T; Tresch, M; Tsaregorodtsev, A; Tsopelas, P; Tuning, N; Ubeda Garcia, M; Ukleja, A; Urner, D; Uwer, U; Vagnoni, V; Valenti, G; Vazquez Gomez, R; Vazquez Regueiro, P; Vecchi, S; Velthuis, J J; Veltri, M; Veneziano, G; Vesterinen, M; Viaud, B; Vieira, D; Vilasis-Cardona, X; Vollhardt, A; Volyanskyy, D; Voong, D; Vorobyev, A; Vorobyev, V; Voß, C; Voss, H; Waldi, R; Wallace, R; Wandernoth, S; Wang, J; Ward, D R; Watson, N K; Webber, A D; Websdale, D; Whitehead, M; Wicht, J; Wiechczynski, J; Wiedner, D; Wiggers, L; Wilkinson, G; Williams, M P; Williams, M; Wilson, F F; Wishahi, J; Witek, M; Wotton, S A; Wright, S; Wu, S; Wyllie, K; Xie, Y; Xing, F; Xing, Z; Yang, Z; Young, R; Yuan, X; Yushchenko, O; Zangoli, M; Zavertyaev, M; Zhang, F; Zhang, L; Zhang, W C; Zhang, Y; Zhelezov, A; Zhokhov, A; Zhong, L; Zvyagin, A

    2013-01-01

    A search for direct $CP$ violation in $D^0\\rightarrow h^-h^+$ (where $h=K$ or $\\pi$) is presented using data corresponding to an integrated luminosity of 1.0 fb$^{-1}$ collected in 2011 by LHCb in $pp$ collisions at a centre-of-mass energy of 7 TeV. The analysis uses $D^0$ mesons produced in inclusive semileptonic $b$-hadron decays to the $D^0\\mu X$ final state, where the charge of the accompanying muon is used to tag the flavour of the $D^0$ meson. The difference in the $CP$-violating asymmetries between the two decay channels is measured to be \\begin{equation} \\Delta A_{CP} = A_{CP}(K^-K^+)-A_{CP}(\\pi^-\\pi^+) = (0.49\\pm 0.30\\,\\rm{(stat)} \\pm 0.14\\,\\rm{(syst)})\\% \\ . \

  6. Quantum Theory of (H,H{Sub 2}) Scattering: Approximate Treatments of Reactive Scattering

    Science.gov (United States)

    Tang, K. T.; Karplus, M.

    1970-10-01

    A quantum mechanical study is made of reactive scattering in the (H, H{sub 2}) system. The problem is formulated in terms of a form of the distorted-wave Born approximation (DWBA) suitable for collisions in which all particles have finite mass. For certain incident energies, differential and total cross sections, as well as other attributes of the reactive collisions, (e.g. reaction configuration), are determined. Two limiting models in the DWBA formulation are compared; in one, the molecule is unperturbed by the incoming atom and in the other, the molecule adiabatically follows the incoming atom. For thermal incident energies and semi-empirical interaction potential employed, the adiabatic model seems to be more appropriate. Since the DWBA method is too complicated for a general study of the (H, H{sub 2}) reaction, a much simpler approximation method, the “linear model” is developed. This model is very different in concept from treatments in which the three atoms are constrained to move on a line throughout the collision. The present model includes the full three-dimensional aspect of the collision and it is only the evaluation of the transition matrix element itself that is simplified. It is found that the linear model, when appropriately normalized, gives results in good agreement with that of the DWBA method. By application of this model, the energy dependence, rotational state of dependence and other properties of the total and differential reactions cross sections are determined. These results of the quantum mechanical treatment are compared with the classical calculation for the same potential surface. The most important result is that, in agreement with the classical treatment, the differential cross sections are strongly backward peaked at low energies and shifts in the forward direction as the energy increases. Finally, the implications of the present calculations for a theory of chemical kinetics are discussed.

  7. The electronic structure and bonding of a H-H pair in the vicinity of a BCC Fe bulk vacancy

    Energy Technology Data Exchange (ETDEWEB)

    Juan, A.; Pistonesi, C.; Brizuela, G. [Universidad Nacional del Sur, Bahia Blanca (Argentina). Departamento de Fisica; Garcia, A.J. [Universidad Nacional del Sur, Bahia Blanca (Argentina). Departamento de Ciencias de la Computacion

    2003-09-01

    The H-Fe interaction near a bcc Fe vacancy is analysed using a semi-empirical theoretical method. Calculations were performed using a Fe{sub 86} cluster with a vacancy. Hydrogen atoms are positioned in their local energy minima configurations. Changes in the electronic structure of Fe atoms near a vacancy were analysed for the system without H, with one H and with two H atoms. Fe atoms surrounding the vacancy weaken their bond when hydrogen is present. This is due to the formation of H-Fe bonds. Hydrogen influences only its nearest-neighbour Fe atoms. The H-H interaction was also analysed. For H-H distance of 0.82 Angstrom an H-H association is formed, while H-Fe interaction and Fe-Fe weakening is markedly reduced, when compared with other H-H interactions. (author)

  8. A 2D analytical cylindrical gate tunnel FET (CG-TFET) model: impact of shortest tunneling distance

    Science.gov (United States)

    Dash, S.; Mishra, G. P.

    2015-09-01

    A 2D analytical tunnel field-effect transistor (FET) potential model with cylindrical gate (CG-TFET) based on the solution of Laplace’s equation is proposed. The band-to-band tunneling (BTBT) current is derived by the help of lateral electric field and the shortest tunneling distance. However, the analysis is extended to obtain the subthreshold swing (SS) and transfer characteristics of the device. The dependency of drain current, SS and transconductance on gate voltage and shortest tunneling distance is discussed. Also, the effect of scaling the gate oxide thickness and the cylindrical body diameter on the electrical parameters of the device is analyzed.

  9. A 2D analytical cylindrical gate tunnel FET (CG-TFET) model: impact of shortest tunneling distance

    International Nuclear Information System (INIS)

    Dash, S; Mishra, G P

    2015-01-01

    A 2D analytical tunnel field-effect transistor (FET) potential model with cylindrical gate (CG-TFET) based on the solution of Laplace’s equation is proposed. The band-to-band tunneling (BTBT) current is derived by the help of lateral electric field and the shortest tunneling distance. However, the analysis is extended to obtain the subthreshold swing (SS) and transfer characteristics of the device. The dependency of drain current, SS and transconductance on gate voltage and shortest tunneling distance is discussed. Also, the effect of scaling the gate oxide thickness and the cylindrical body diameter on the electrical parameters of the device is analyzed. (paper)

  10. H + H2 reaction barrier: A fixed-node quantum Monte Carlo study

    International Nuclear Information System (INIS)

    Barnett, R.N.; Reynolds, P.J.; Lester, W.A. Jr.

    1985-01-01

    The classical barrier height for the H+H 2 exchange reaction, as well as the energies at two other points along the reaction path, are calculated using fixed-node quantum Monte Carlo (FNQMC). Several single-determinant importance functions are used at the saddle point in order to relate the quality of the importance function to the accuracy and precision of the final result. The computed barrier is an upper bound since the energy of H and of H 2 is obtained exactly by FNQMC. Our best upper bound (9.70 +- 0.13 kcal/mol) has a mean within 0.1 kcal/mol of the presumed exact value. This best bound is obtained with a single determinant, double-zeta basis importance function. Contrary to experience with expansion methods, it is found that an importance function with a basis set of near Hartree--Fock quality, as well as one derived from a spin-unrestricted SCF calculation, are among the least efficient and least accurate of the importance functions used. Specifically, a nodal surface appearing in the lowest energy molecular orbital in these functions apparently increases the FNQMC energy. The FNQMC energy at the two other points along the reaction path is found to agree with the most accurate CI results of Liu to within statistical error

  11. Vibrational inelastic and charge transfer processes in H++H2 system: An ab initio study

    Science.gov (United States)

    Amaran, Saieswari; Kumar, Sanjay

    2007-12-01

    State-resolved differential cross sections, total and integral cross sections, average vibrational energy transfer, and the relative probabilities are computed for the H++H2 system using the newly obtained ab initio potential energy surfaces at the full CI/cc-pVQZ level of accuracy which allow for both the direct vibrational inelastic and the charge transfer processes. The quantum dynamics is treated within the vibrational close-coupling infinite-order-sudden approximation approach using the two ab initio quasidiabatic potential energy surfaces. The computed collision attributes for both the processes are compared with the available state-to-state scattering experiments at Ec.m.=20eV. The results are in overall good agreement with most of the observed scattering features such as rainbow positions, integral cross sections, and relative vibrational energy transfers. A comparison with the earlier theoretical study carried out on the semiempirical surfaces (diatomics in molecules) is also made to illustrate the reliability of the potential energy surfaces used in the present work.

  12. Lecturers' and Students’ Perception on Learning Dijkstra’s Shortest Path Algorithm Through Mobile Devices

    Directory of Open Access Journals (Sweden)

    Mazyar Seraj

    2014-06-01

    Full Text Available In recent years, many studies have been carried out on how to engage and support students in e-learning environments. Portable devices such as Personal Digital Assistants (PDAs, Tablet PCs, mobile phones and other mobile equipment have been used as parts of electronic learning environments to facilitate learning and teaching for both lecturers and students. However, there is still a dearth of study investigating the effects of small screen interfaces on mobile-based learning environments. This study aims to address two objectives: (i investigate lecturer and student difficulties encountered in teaching-learning process in traditional face-to-face classroom settings, and (ii to explore lecturer and student perceptions about learning the subject through mobile devices. This paper presents the results of a qualitative study using structured interviews to investigate lecturer and student experiences and perceptions on teaching and learning Dijkstra’s shortest path algorithm via mobile devices. The interview insights were then used as inputs to define user requirements for a mobile learning prototype. The findings show that the lecturers and students raised many issues about interactivity and the flexibility of effective learning applications on small screen devices, especially for a technical subject.

  13. Technical note: Quantification of neurocranial shape variation using the shortest paths connecting pairs of anatomical landmarks.

    Science.gov (United States)

    Morita, Yusuke; Ogihara, Naomichi; Kanai, Takashi; Suzuki, Hiromasa

    2013-08-01

    Three-dimensional geometric morphometric techniques have been widely used in quantitative comparisons of craniofacial morphology in humans and nonhuman primates. However, few anatomical landmarks can actually be defined on the neurocranium. In this study, an alternative method is proposed for defining semi-landmarks on neurocranial surfaces for use in detailed analysis of cranial shape. Specifically, midsagittal, nuchal, and temporal lines were approximated using Bezier curves and equally spaced points along each of the curves were defined as semi-landmarks. The shortest paths connecting pairs of anatomical landmarks as well as semi-landmarks were then calculated in order to represent the surface morphology between landmarks using equally spaced points along the paths. To evaluate the efficacy of this method, the previously outlined technique was used in morphological analysis of sexual dimorphism in modern Japanese crania. The study sample comprised 22 specimens that were used to generate 110 anatomical semi-landmarks, which were used in geometric morphometric analysis. Although variations due to sexual dimorphism in human crania are very small, differences could be identified using the proposed landmark placement, which demonstrated the efficacy of the proposed method. Copyright © 2013 Wiley Periodicals, Inc.

  14. A Hybrid Optimized Weighted Minimum Spanning Tree for the Shortest Intrapath Selection in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Matheswaran Saravanan

    2014-01-01

    Full Text Available Wireless sensor network (WSN consists of sensor nodes that need energy efficient routing techniques as they have limited battery power, computing, and storage resources. WSN routing protocols should enable reliable multihop communication with energy constraints. Clustering is an effective way to reduce overheads and when this is aided by effective resource allocation, it results in reduced energy consumption. In this work, a novel hybrid evolutionary algorithm called Bee Algorithm-Simulated Annealing Weighted Minimal Spanning Tree (BASA-WMST routing is proposed in which randomly deployed sensor nodes are split into the best possible number of independent clusters with cluster head and optimal route. The former gathers data from sensors belonging to the cluster, forwarding them to the sink. The shortest intrapath selection for the cluster is selected using Weighted Minimum Spanning Tree (WMST. The proposed algorithm computes the distance-based Minimum Spanning Tree (MST of the weighted graph for the multihop network. The weights are dynamically changed based on the energy level of each sensor during route selection and optimized using the proposed bee algorithm simulated annealing algorithm.

  15. K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks.

    Directory of Open Access Journals (Sweden)

    Yunyue He

    Full Text Available Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads. This paper investigates an evacuation routing problem that involves police resource allocation. We propose a novel k-th-shortest-path-based technique that uses explicit congestion control to optimize evacuation routing and police resource allocation. A nonlinear mixed-integer programming model is presented to formulate the problem. The model's objective is to minimize the overall evacuation clearance time. Two algorithms are given to solve the problem. The first one linearizes the original model and solves the linearized problem with CPLEX. The second one is a heuristic algorithm that uses a police resource utilization efficiency index to directly solve the original model. This police resource utilization efficiency index significantly aids in the evaluation of road links from an evacuation throughput perspective. The proposed algorithms are tested with a number of examples based on real data from cities of different sizes. The computational results show that the police resource utilization efficiency index is very helpful in finding near-optimal solutions. Additionally, comparing the performance of the heuristic algorithm and the linearization method by using randomly generated examples indicates that the efficiency of the heuristic algorithm is superior.

  16. A ring polymer molecular dynamics study of the isotopologues of the H + H2 reaction.

    Science.gov (United States)

    Suleimanov, Yury V; de Tudela, Ricardo Pérez; Jambrina, Pablo G; Castillo, Jesús F; Sáez-Rábanos, Vicente; Manolopoulos, David E; Aoiz, F Javier

    2013-03-14

    The inclusion of Quantum Mechanical (QM) effects such as zero point energy (ZPE) and tunneling in simulations of chemical reactions, especially in the case of light atom transfer, is an important problem in computational chemistry. In this respect, the hydrogen exchange reaction and its isotopic variants constitute an excellent benchmark for the assessment of approximate QM methods. In particular, the recently developed ring polymer molecular dynamics (RPMD) technique has been demonstrated to give very good results for bimolecular chemical reactions in the gas phase. In this work, we have performed a detailed RPMD study of the H + H(2) reaction and its isotopologues Mu + H(2), D + H(2) and Heμ + H(2), at temperatures ranging from 200 to 1000 K. Thermal rate coefficients and kinetic isotope effects have been computed and compared with exact QM calculations as well as with quasiclassical trajectories and experiment. The agreement with the QM results is good for the heaviest isotopologues, with errors ranging from 15% to 45%, and excellent for Mu + H(2), with errors below 15%. We have seen that RPMD is able to capture the ZPE effect very accurately, a desirable feature of any method based on molecular dynamics. We have also verified Richardson and Althorpe's prediction [J. O. Richardson and S. C. Althorpe, J. Chem. Phys., 2009, 131, 214106] that RPMD will overestimate thermal rates for asymmetric reactions and underestimate them for symmetric reactions in the deep tunneling regime. The ZPE effect along the reaction coordinate must be taken into account when assigning the reaction symmetry in the multidimensional case.

  17. Distribution of shortest path lengths in a class of node duplication network models

    Science.gov (United States)

    Steinbock, Chanania; Biham, Ofer; Katzav, Eytan

    2017-09-01

    We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks, and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability p to each one of its neighbors. The degree distribution of the resulting network turns out to follow a power-law distribution, thus the ND network is a scale-free network. To calculate the DSPL we derive a master equation for the time evolution of the probability Pt(L =ℓ ) , ℓ =1 ,2 ,⋯ , where L is the distance between a pair of nodes and t is the time. Finding an exact analytical solution of the master equation, we obtain a closed form expression for Pt(L =ℓ ) . The mean distance 〈L〉 t and the diameter Δt are found to scale like lnt , namely, the ND network is a small-world network. The variance of the DSPL is also found to scale like lnt . Interestingly, the mean distance and the diameter exhibit properties of a small-world network, rather than the ultrasmall-world network behavior observed in other scale-free networks, in which 〈L〉 t˜lnlnt .

  18. Shortest loops are pacemakers in random networks of electrically coupled axons

    Directory of Open Access Journals (Sweden)

    Nikita eVladimirov

    2012-04-01

    Full Text Available High-frequency oscillations (HFOs are an important part of brain activity in health and disease. However, their origins remain obscure and controversial. One possible mechanism depends on the presence of sparsely distributed gap junctions that electrically couple the axons of principal cells. A plexus of electrically coupled axons is modeled as a random network with bidirectional connections between its nodes. Under certain conditions the network can demonstrate one of two types of oscillatory activity. Type I oscillations (100-200 Hz are predicted to be caused by spontaneously spiking axons in a network with strong (high-conductance gap junctions. Type II oscillations (200-300 Hz require no spontaneous spiking and relatively weak (low-conductance gap junctions, across which spike propagation failures occur. The type II oscillations are reentrant and self-sustained. Here we examine what determines the frequency of type II oscillations. Using simulations we show that the distribution of loop lengths is the key factor for determining frequency in type II network oscillations. We first analyze spike failure between two electrically coupled cells using a model of anatomically reconstructed CA1 pyramidal neuron. Then network oscillations are studied by a cellular automaton model with random network connectivity, in which we control loop statistics. We show that oscillation periods can be predicted from the network's loop statistics. The shortest loop, around which a spike can travel, is the most likely pacemaker candidate.The principle of one loop as a pacemaker is remarkable, because random networks contain a large number of loops juxtaposed and superimposed, and their number rapidly grows with network size. This principle allows us to predict the frequency of oscillations from network connectivity and visa versa. We finally propose that type I oscillations may correspond to ripples, while type II oscillations correspond to so-called fast ripples.

  19. Small flow rate can supply inwardly migrating shortest-period planets

    Directory of Open Access Journals (Sweden)

    Taylor S.F.

    2013-04-01

    Full Text Available The number of exoplanets found with periods as short as one day and less was surprising given how fast these planets had been expected to migrate into the star due to the tides raised on the star by planets at such close distances. It has been seen as improbable that we would find planets in such a small final fraction of their lives [1]. The favored solution has been that the tidal dissipation is much weaker than expected, which would mean that the final infall would be a larger fraction of the planets’ life. We find no reason, however, to exclude the explanation that a small number of planets are continuously sent migrating inwards such that these planets indeed are in the last fraction of their lives. Following the observation that the distribution of medium planets disfavors tidal dissipation being significantly weaker than has been found from observations of binary stars [2], we now show that the numbers of planets in such a “flow” of excess planets migrating inwards is low enough that even depletion of the three-day pileup is a plausible source. Then the shortest period occurrence distribution would be shaped by planets continuously being sent into the star, which may explain the depletion of the pileup in the Kepler field relative to the solar neighborhood [3]. Because Kepler observes above the galactic plan, [3] suggested the Kepler field may include an older population of stars. The tidal dissipation strength in stars due to giant planets may be not greatly weaker than it is in binary stars.

  20. The highest velocity and the shortest duration permitting attainment of VO2max during running

    Directory of Open Access Journals (Sweden)

    Tiago Turnes

    2015-02-01

    Full Text Available DOI: http://dx.doi.org/10.5007/1980-0037.2015v17n2p226   The severe-intensity domain has important applications for the prescription of running training and the elaboration of experimental designs. The objectives of this study were: 1 to investigate the validity of a previously proposed model to estimate the shortest exercise duration (TLOW and the highest velocity (VHIGH at which VO2max is reached during running, and 2 to evaluate the effects of aerobic training status on these variables. Eight runners and eight physically active subjects performed several treadmill running exercise tests to fatigue in order to mathematically estimate and to experimentally determine TLOW and VHIGH. The relationship between the time to achieve VO2max and time to exhaustion (Tlim was used to estimate TLOW. VHIGH was estimated using the critical velocity model. VHIGH was assumed to be the highest velocity at which VO2 was equal to or higher than the average VO2max minus one standard deviation. TLOW was defined as Tlim associated with VHIGH. Runners presented better aerobic fitness and higher VHIGH (22.2 ± 1.9 km.h-1 than active subjects (20.0 ± 2.1 km.h-1. However, TLOW did not differ between groups (runners: 101 ± 39 s; active subjects: 100 ± 35 s. TLOW and VHIGH were not well estimated by the model proposed, with high coefficients of variation (> 6% and a low correlation coefficient (r<0.70, a fact reducing the validity of the model. It was concluded that aerobic training status positively affected only VHIGH. Furthermore, the model proposed presented low validity to estimate the upper boundary of the severe-intensity domain (i.e., VHIGH, irrespective of the subjects’ training status.

  1. Analytic cross sections for collisions of H, H2, He and Li atoms and ions with atoms and molecules, 1

    International Nuclear Information System (INIS)

    Ito, Rinsuke; Tabata, Tatsuo; Shirai, Toshizo; Phaneuf, R.A.

    1993-06-01

    Analytic expressions fitted to Barnett's recommended data are given for the cross sections of the following reactions: (1) electron capture by H, H + , H 2 + , He + , and He 2+ colliding with atoms, molecules, and ions and (2) electron capture into excited states by H + , He + , and He 2+ colliding with atoms and molecules. The latter category includes cross sections for photon emission due to electron capture. The expressions use the semiempirical functional forms proposed by Green and McNeal and some modified forms to make it possible not only to interpolate but also to extrapolate the recommended data. (author)

  2. Differential cross sections for transfer into the 2S state of hydrogen: H+ + H2, H+ + D2

    International Nuclear Information System (INIS)

    Williams, D.G.; Lee, A.R.; Butcher, E.C.

    1986-01-01

    Differential cross sections for electron capture into the 2S state of hydrogen are presented for the reactions H + + H 2 and H + + D 2 . The results are for laboratory collision energies between 3.3 and 24 keV and scattering angles between 30 and 90'. The measurements expand on the results previously presented. (author)

  3. Sequential application of ligand and structure based modeling approaches to index chemicals for their hH4R antagonism.

    Directory of Open Access Journals (Sweden)

    Matteo Pappalardo

    Full Text Available The human histamine H4 receptor (hH4R, a member of the G-protein coupled receptors (GPCR family, is an increasingly attractive drug target. It plays a key role in many cell pathways and many hH4R ligands are studied for the treatment of several inflammatory, allergic and autoimmune disorders, as well as for analgesic activity. Due to the challenging difficulties in the experimental elucidation of hH4R structure, virtual screening campaigns are normally run on homology based models. However, a wealth of information about the chemical properties of GPCR ligands has also accumulated over the last few years and an appropriate combination of these ligand-based knowledge with structure-based molecular modeling studies emerges as a promising strategy for computer-assisted drug design. Here, two chemoinformatics techniques, the Intelligent Learning Engine (ILE and Iterative Stochastic Elimination (ISE approach, were used to index chemicals for their hH4R bioactivity. An application of the prediction model on external test set composed of more than 160 hH4R antagonists picked from the chEMBL database gave enrichment factor of 16.4. A virtual high throughput screening on ZINC database was carried out, picking ∼ 4000 chemicals highly indexed as H4R antagonists' candidates. Next, a series of 3D models of hH4R were generated by molecular modeling and molecular dynamics simulations performed in fully atomistic lipid membranes. The efficacy of the hH4R 3D models in discrimination between actives and non-actives were checked and the 3D model with the best performance was chosen for further docking studies performed on the focused library. The output of these docking studies was a consensus library of 11 highly active scored drug candidates. Our findings suggest that a sequential combination of ligand-based chemoinformatics approaches with structure-based ones has the potential to improve the success rate in discovering new biologically active GPCR drugs and

  4. Sequential application of ligand and structure based modeling approaches to index chemicals for their hH4R antagonism.

    Science.gov (United States)

    Pappalardo, Matteo; Shachaf, Nir; Basile, Livia; Milardi, Danilo; Zeidan, Mouhammed; Raiyn, Jamal; Guccione, Salvatore; Rayan, Anwar

    2014-01-01

    The human histamine H4 receptor (hH4R), a member of the G-protein coupled receptors (GPCR) family, is an increasingly attractive drug target. It plays a key role in many cell pathways and many hH4R ligands are studied for the treatment of several inflammatory, allergic and autoimmune disorders, as well as for analgesic activity. Due to the challenging difficulties in the experimental elucidation of hH4R structure, virtual screening campaigns are normally run on homology based models. However, a wealth of information about the chemical properties of GPCR ligands has also accumulated over the last few years and an appropriate combination of these ligand-based knowledge with structure-based molecular modeling studies emerges as a promising strategy for computer-assisted drug design. Here, two chemoinformatics techniques, the Intelligent Learning Engine (ILE) and Iterative Stochastic Elimination (ISE) approach, were used to index chemicals for their hH4R bioactivity. An application of the prediction model on external test set composed of more than 160 hH4R antagonists picked from the chEMBL database gave enrichment factor of 16.4. A virtual high throughput screening on ZINC database was carried out, picking ∼ 4000 chemicals highly indexed as H4R antagonists' candidates. Next, a series of 3D models of hH4R were generated by molecular modeling and molecular dynamics simulations performed in fully atomistic lipid membranes. The efficacy of the hH4R 3D models in discrimination between actives and non-actives were checked and the 3D model with the best performance was chosen for further docking studies performed on the focused library. The output of these docking studies was a consensus library of 11 highly active scored drug candidates. Our findings suggest that a sequential combination of ligand-based chemoinformatics approaches with structure-based ones has the potential to improve the success rate in discovering new biologically active GPCR drugs and increase the

  5. Impacts of Different Mobile User Interfaces on Students’ Satisfaction for Learning Dijkstra’s Shortest Path Algorithm

    Directory of Open Access Journals (Sweden)

    Mazyar Seraj

    2014-10-01

    Full Text Available This paper describes an experimental study of learning Dijkstra’s shortest path algorithm on mobile devices. The aim of the study is to investigate and compare the impacts of two different mobile screen user interfaces on students’ satisfaction for learning the technical subject. A mobile learning prototype was developed for learning Dijkstra’s shortest path algorithm on Apple iPhone 4 operated on iPhone operating system (iOS, and Acer Inconia Tab operated on an Android operating system. Thirty students, who are either currently studying or had previously studied Computer Networks, were recruited for the usability trial. At the end of each single session, students’ satisfaction interacting with the two mobile devices was measured using QUIS questionnaire. Although there is no significant difference in students’ satisfaction between the two different mobile screen interfaces, the subjective findings indicate that Acer Inconia Tab gained higher scores as compared to Apple iPhone 4.

  6. CAL3JHH: a Java program to calculate the vicinal coupling constants (3J H,H) of organic molecules.

    Science.gov (United States)

    Aguirre-Valderrama, Alonso; Dobado, José A

    2008-12-01

    Here, we present a free web-accessible application, developed in the JAVA programming language for the calculation of vicinal coupling constant (3J(H,H)) of organic molecules with the H-Csp3-Csp3-H fragment. This JAVA applet is oriented to assist chemists in structural and conformational analyses, allowing the user to calculate the averaged 3J(H,H) values among conformers, according to its Boltzmann populations. Thus, the CAL3JHH program uses the Haasnoot-Leeuw-Altona equation, and, by reading the molecule geometry from a protein data bank (PDB) file format or from multiple pdb files, automatically detects all the coupled hydrogens, evaluating the data needed for this equation. Moreover, a "Graphical viewer" menu allows the display of the results on the 3D molecule structure, as well as the plotting of the Newman projection for the couplings.

  7. Speciation in the aqueous H+/H2VO4-/H2O2/citrate system of biomedical interest.

    Science.gov (United States)

    Gorzsás, András; Getty, Kendra; Andersson, Ingegärd; Pettersson, Lage

    2004-09-21

    The speciation in the quaternary aqueous H+/H2VO4-/H2O2/citrate (Cit3-) and H+/H2VO4-/Cit3-/L-(+)-lactate (Lac-) systems has been determined at 25 degrees C in the physiological medium of 0.150 M Na(Cl). A combination of 51V NMR integral intensities and chemical shift (Bruker AMX500) as well as potentiometric data (glass electrode) have been collected and evaluated with the computer program LAKE, which is able to treat multimethod data simultaneously. The pKa-values for citric acid have been determined as 2.94, 4.34 and 5.61. Altogether six vanadate-citrate species have been found in the ternary H+/H2VO4-/Cit3- system in the pH region 2-10, only two of which are mononuclear. Reduction of vanadium(V) becomes more pronounced at pH acidic solutions limited the final model to pH > 4. In the quaternary H+/H2VO4-/Cit3-/Lac- system, two mixed-ligand species have been determined, with the compositions V2CitLac2- and V2CitLac3- (pKa = 5.0). To our knowledge, this is the first time such complexes have been reported for vanadium(V). 51V NMR chemical shifts, compositions and formation constants are given, and equilibrium conditions are illustrated in distribution diagrams as well as the fit of the model to the experimental data. When suitable, structural proposals are given, based on 13C NMR measurements and available literature data of related compounds.

  8. Analytic cross sections for collisions of H, H2, He and Li Atoms and ions with atoms and molecules. 2

    International Nuclear Information System (INIS)

    Ito, Rinsuke; Tabata, Tatsuo; Shirai, Toshizo; Phaneuf, R.A.

    1994-07-01

    Analytic expressions fitted to Barnett's recommended data are given for the cross sections of excitation and spectral line emission by H, H + , He + , He, and He 2+ colliding with atoms and molecules. The expressions use the semiempirical functional forms proposed by Green and McNeal and some modified forms to make it possible not only to interpolate but also to extrapolate the recommended data. (author)

  9. Analytic cross sections for collisions of H, H2, He and Li atoms and ions with atoms and molecules. 3

    International Nuclear Information System (INIS)

    Ito, Rinsuke; Tabata, Tatsuo; Shirai, Toshizo; Phaneuf, R.A.

    1995-07-01

    Analytic expressions fitted to Barnett's recommended data are given for the collision cross sections of H, H 2 , He, and Li atoms and ions colliding with atoms and molecules. The collisions treated are ionization collisions, charge-production collisions, electron-loss collisions, and electron detachment collisions. The analytic expressions use the semiempirical functional forms proposed by Green and McNeal and some modified forms to make it possible not only to interpolate but also to extrapolate the recommended data. (author)

  10. H + H2 on LEPS and Porter-Karplus surfaces;Quasiclassical differential cross sections for reactive scattering

    International Nuclear Information System (INIS)

    Jorgensen, A.D.; Gislason, E.A.; Hillenbrand, E.A.

    1981-01-01

    The reactive differential cross section is determined by the use of a fourier sine series for the H + H 2 reaction on the Porter Karplus and LEPS surfaces. The A + BC program was used to run quasiclassical trajectories. Saddle-point properties are compared, including those for SLTH surfaces. The use of the Fourier sine series enables one to obtain very accurate differential cross sections, allowing precise comparison of the reaction dynamics on different potential energy surfaces and at different energies

  11. ACL2 Meets the GPU: Formalizing a CUDA-based Parallelizable All-Pairs Shortest Path Algorithm in ACL2

    Directory of Open Access Journals (Sweden)

    David S. Hardin

    2013-04-01

    Full Text Available As Graphics Processing Units (GPUs have gained in capability and GPU development environments have matured, developers are increasingly turning to the GPU to off-load the main host CPU of numerically-intensive, parallelizable computations. Modern GPUs feature hundreds of cores, and offer programming niceties such as double-precision floating point, and even limited recursion. This shift from CPU to GPU, however, raises the question: how do we know that these new GPU-based algorithms are correct? In order to explore this new verification frontier, we formalized a parallelizable all-pairs shortest path (APSP algorithm for weighted graphs, originally coded in NVIDIA's CUDA language, in ACL2. The ACL2 specification is written using a single-threaded object (stobj and tail recursion, as the stobj/tail recursion combination yields the most straightforward translation from imperative programming languages, as well as efficient, scalable executable specifications within ACL2 itself. The ACL2 version of the APSP algorithm can process millions of vertices and edges with little to no garbage generation, and executes at one-sixth the speed of a host-based version of APSP coded in C – a very respectable result for a theorem prover. In addition to formalizing the APSP algorithm (which uses Dijkstra's shortest path algorithm at its core, we have also provided capability that the original APSP code lacked, namely shortest path recovery. Path recovery is accomplished using a secondary ACL2 stobj implementing a LIFO stack, which is proven correct. To conclude the experiment, we ported the ACL2 version of the APSP kernels back to C, resulting in a less than 5% slowdown, and also performed a partial back-port to CUDA, which, surprisingly, yielded a slight performance increase.

  12. DESIGNING APPLICATION OF ANT COLONY SYSTEM ALGORITHM FOR THE SHORTEST ROUTE OF BANDA ACEH CITY AND ACEH BESAR REGENCY TOURISM BY USING GRAPHICAL USER INTERFACE MATLAB

    Directory of Open Access Journals (Sweden)

    Durisman Durisman

    2017-09-01

    Full Text Available Banda Aceh city and Aceh Besar Regency are two of the leading tourism areas located in the province of Aceh. For travelling, there are some important things to be considered, such as determining schedule and distance of tourism. Every tourist certainly chooses the shortest route to reach the destination since it can save time, energy, and money. The purpose of this reserach is to develop a method that can be used in calculating the shortest route and applied to the tourism of Banda Aceh city and Aceh Besar regency. In this reserach, Ant Colony Optimization algorithm is used to determine the shortest route to tourism of Banda Aceh city and Aceh Besar regency. From the analysis made by using both manual calculation and  GUI MATLAB program application test, the shortest route can be obtained with a minimum distance of 120.85 km in one travel. Based on the test result, the application for tourism (in Banda Aceh city and Aceh Besar regency shortest route searching built by utilizing the Ant Colony Optimization algorithm can find optimal route.  Keyword: tourism, the shortest route, Ant Colony Optimization

  13. Comparison of the efficiency of two algorithms which solve the shortest path problem with an emotional agent

    Directory of Open Access Journals (Sweden)

    Petruseva Silvana

    2006-01-01

    Full Text Available This paper discusses the comparison of the efficiency of two algorithms, by estimation of their complexity. For solving the problem, the Neural Network Crossbar Adaptive Array (NN-CAA is used as the agent architecture, implementing a model of an emotion. The problem discussed is how to find the shortest path in an environment with n states. The domains concerned are environments with n states, one of which is the starting state, one is the goal state, and some states are undesirable and they should be avoided. It is obtained that finding one path (one solution is efficient, i.e. in polynomial time by both algorithms. One of the algorithms is faster than the other only in the multiplicative constant, and it shows a step forward toward the optimality of the learning process. However, finding the optimal solution (the shortest path by both algorithms is in exponential time which is asserted by two theorems. It might be concluded that the concept of subgoal is one step forward toward the optimality of the process of the agent learning. Yet, it should be explored further on, in order to obtain an efficient, polynomial algorithm.

  14. Shortest multiple disconnected path for the analysis of entanglements in two- and three-dimensional polymeric systems

    Science.gov (United States)

    Kröger, Martin

    2005-06-01

    We present an algorithm which returns a shortest path and related number of entanglements for a given configuration of a polymeric system in 2 or 3 dimensions. Rubinstein and Helfand, and later Everaers et al. introduced a concept to extract primitive paths for dense polymeric melts made of linear chains (a multiple disconnected multibead 'path'), where each primitive path is defined as a path connecting the (space-fixed) ends of a polymer under the constraint of non-interpenetration (excluded volume) between primitive paths of different chains, such that the multiple disconnected path fulfills a minimization criterion. The present algorithm uses geometrical operations and provides a—model independent—efficient approximate solution to this challenging problem. Primitive paths are treated as 'infinitely' thin (we further allow for finite thickness to model excluded volume), and tensionless lines rather than multibead chains, excluded volume is taken into account without a force law. The present implementation allows to construct a shortest multiple disconnected path (SP) for 2D systems (polymeric chain within spherical obstacles) and an optimal SP for 3D systems (collection of polymeric chains). The number of entanglements is then simply obtained from the SP as either the number of interior kinks, or from the average length of a line segment. Further, information about structure and potentially also the dynamics of entanglements is immediately available from the SP. We apply the method to study the 'concentration' dependence of the degree of entanglement in phantom chain systems. Program summaryTitle of program:Z Catalogue number:ADVG Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVG Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Silicon Graphics (Irix), Sun (Solaris), PC (Linux) Operating systems or monitors under which the

  15. Fast and accurate global multiphase arrival tracking: the irregular shortest-path method in a 3-D spherical earth model

    Science.gov (United States)

    Huang, Guo-Jiao; Bai, Chao-Ying; Greenhalgh, Stewart

    2013-09-01

    The traditional grid/cell-based wavefront expansion algorithms, such as the shortest path algorithm, can only find the first arrivals or multiply reflected (or mode converted) waves transmitted from subsurface interfaces, but cannot calculate the other later reflections/conversions having a minimax time path. In order to overcome the above limitations, we introduce the concept of a stationary minimax time path of Fermat's Principle into the multistage irregular shortest path method. Here we extend it from Cartesian coordinates for a flat earth model to global ray tracing of multiple phases in a 3-D complex spherical earth model. The ray tracing results for 49 different kinds of crustal, mantle and core phases show that the maximum absolute traveltime error is less than 0.12 s and the average absolute traveltime error is within 0.09 s when compared with the AK135 theoretical traveltime tables for a 1-D reference model. Numerical tests in terms of computational accuracy and CPU time consumption indicate that the new scheme is an accurate, efficient and a practical way to perform 3-D multiphase arrival tracking in regional or global traveltime tomography.

  16. Adapting National Water Model Forecast Data to Local Hyper-Resolution H&H Models During Hurricane Irma

    Science.gov (United States)

    Singhofen, P.

    2017-12-01

    The National Water Model (NWM) is a remarkable undertaking. The foundation of the NWM is a 1 square kilometer grid which is used for near real-time modeling and flood forecasting of most rivers and streams in the contiguous United States. However, the NWM falls short in highly urbanized areas with complex drainage infrastructure. To overcome these shortcomings, the presenter proposes to leverage existing local hyper-resolution H&H models and adapt the NWM forcing data to them. Gridded near real-time rainfall, short range forecasts (18-hour) and medium range forecasts (10-day) during Hurricane Irma are applied to numerous detailed H&H models in highly urbanized areas of the State of Florida. Coastal and inland models are evaluated. Comparisons of near real-time rainfall data are made with observed gaged data and the ability to predict flooding in advance based on forecast data is evaluated. Preliminary findings indicate that the near real-time rainfall data is consistently and significantly lower than observed data. The forecast data is more promising. For example, the medium range forecast data provides 2 - 3 days advanced notice of peak flood conditions to a reasonable level of accuracy in most cases relative to both timing and magnitude. Short range forecast data provides about 12 - 14 hours advanced notice. Since these are hyper-resolution models, flood forecasts can be made at the street level, providing emergency response teams with valuable information for coordinating and dispatching limited resources.

  17. A Shortest-Path-Based Method for the Analysis and Prediction of Fruit-Related Genes in Arabidopsis thaliana.

    Science.gov (United States)

    Zhu, Liucun; Zhang, Yu-Hang; Su, Fangchu; Chen, Lei; Huang, Tao; Cai, Yu-Dong

    2016-01-01

    Biologically, fruits are defined as seed-bearing reproductive structures in angiosperms that develop from the ovary. The fertilization, development and maturation of fruits are crucial for plant reproduction and are precisely regulated by intrinsic genetic regulatory factors. In this study, we used Arabidopsis thaliana as a model organism and attempted to identify novel genes related to fruit-associated biological processes. Specifically, using validated genes, we applied a shortest-path-based method to identify several novel genes in a large network constructed using the protein-protein interactions observed in Arabidopsis thaliana. The described analyses indicate that several of the discovered genes are associated with fruit fertilization, development and maturation in Arabidopsis thaliana.

  18. Differences in physical environmental characteristics between adolescents' actual and shortest cycling routes: a study using a Google Street View-based audit.

    Science.gov (United States)

    Verhoeven, Hannah; Van Hecke, Linde; Van Dyck, Delfien; Baert, Tim; Van de Weghe, Nico; Clarys, Peter; Deforche, Benedicte; Van Cauwenberg, Jelle

    2018-05-29

    The objective evaluation of the physical environmental characteristics (e.g. speed limit, cycling infrastructure) along adolescents' actual cycling routes remains understudied, although it may provide important insights into why adolescents prefer one cycling route over another. The present study aims to gain insight into the physical environmental characteristics determining the route choice of adolescent cyclists by comparing differences in physical environmental characteristics between their actual cycling routes and the shortest possible cycling routes. Adolescents (n = 204; 46.5% boys; 14.4 ± 1.2 years) recruited at secondary schools in and around Ghent (city in Flanders, northern part of Belgium) were instructed to wear a Global Positioning System device in order to identify cycling trips. For all identified cycling trips, the shortest possible route that could have been taken was calculated. Actual cycling routes that were not the shortest possible cycling routes were divided into street segments. Segments were audited with a Google Street View-based tool to assess physical environmental characteristics along actual and shortest cycling routes. Out of 160 actual cycling trips, 73.1% did not differ from the shortest possible cycling route. For actual cycling routes that were not the shortest cycling route, a speed limit of 30 km/h, roads having few buildings with windows on the street side and roads without cycle lane were more frequently present compared to the shortest possible cycling routes. A mixed land use, roads with commercial destinations, arterial roads, cycle lanes separated from traffic by white lines, small cycle lanes and cycle lanes covered by lighting were less frequently present along actual cycling routes compared to the shortest possible cycling routes. Results showed that distance mainly determines the route along which adolescents cycle. In addition, adolescents cycled more along residential streets (even if no cycle lane was

  19. Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

    Directory of Open Access Journals (Sweden)

    Vatutin Eduard

    2017-12-01

    Full Text Available The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

  20. Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem

    Science.gov (United States)

    Vatutin, Eduard

    2017-12-01

    The article deals with the problem of analysis of effectiveness of the heuristic methods with limited depth-first search techniques of decision obtaining in the test problem of getting the shortest path in graph. The article briefly describes the group of methods based on the limit of branches number of the combinatorial search tree and limit of analyzed subtree depth used to solve the problem. The methodology of comparing experimental data for the estimation of the quality of solutions based on the performing of computational experiments with samples of graphs with pseudo-random structure and selected vertices and arcs number using the BOINC platform is considered. It also shows description of obtained experimental results which allow to identify the areas of the preferable usage of selected subset of heuristic methods depending on the size of the problem and power of constraints. It is shown that the considered pair of methods is ineffective in the selected problem and significantly inferior to the quality of solutions that are provided by ant colony optimization method and its modification with combinatorial returns.

  1. Formation of H(2s) atoms by excitation in 10-100 keV H+-H collisions

    International Nuclear Information System (INIS)

    Higgins, D.P.; Geddes, J.; Gilbody, H.B.

    1996-01-01

    Cross sections for 2s excitation of H atoms in 10-100 keV H + -H collisions have been determined using a modulated crossed-beam technique. The measurements have been based on observations of the Lyman alpha radiation emitted during electric-field-induced decay of the metastable H(2s) collision products. The results extend the range of the 5-26 keV cross sections measured by Morgan and co-workers to intermediate energies where theoretical predictions based on close-coupling methods are known to be strongly dependent on the choice of the expansion basis. The present cross sections pass through a broad maximum at about 40 keV. Over the range 5-100 keV the available experimental data exhibit an undulatory structure similar to that predicted by some close-coupling calculations but good quantitative agreement is very limited. Close-coupling calculations which employ large basis sets and include a large number of projectile states at the expense of target states are shown to agree less satisfactorily with experiment than those which include only the dominant 1s capture projectile channel. (Author)

  2. The localized vibrations of H-H-, D-D- and H-D- pairs in KCl, KBr, KI, RbCl and NaCl

    International Nuclear Information System (INIS)

    Robert, R.

    1974-01-01

    The localized vibrational modes of H - H - , D - D - and H - D - pairs in KCl, KBr, KI, RbCl and NaCl were studied for different pair configurations. The measured frequencies of the infrared active modes were found to be in good agreement with a model of two coupled harmonic oscillators. The line width for different modes in the salts studied is discussed. The temperature dependence for the transversal modes T 1 and T 2 of the line width for the H - H - pairs in KCl indicates that the broadening of these lines is due to the 'decomposition mechanism', that generates two phonons. The generated phonons due to the decay of the localized in phase mode are: -one acustic phonon of the lattice, -one localized phonon that corresponds to the out of phase vibration of the H - H - pair. The general properties, as the Ivey law and several particulars of the properties in the alkali-halides studied are presented [pt

  3. Inferring anatomical therapeutic chemical (ATC) class of drugs using shortest path and random walk with restart algorithms.

    Science.gov (United States)

    Chen, Lei; Liu, Tao; Zhao, Xian

    2018-06-01

    The anatomical therapeutic chemical (ATC) classification system is a widely accepted drug classification scheme. This system comprises five levels and includes several classes in each level. Drugs are classified into classes according to their therapeutic effects and characteristics. The first level includes 14 main classes. In this study, we proposed two network-based models to infer novel potential chemicals deemed to belong in the first level of ATC classification. To build these models, two large chemical networks were constructed using the chemical-chemical interaction information retrieved from the Search Tool for Interactions of Chemicals (STITCH). Two classic network algorithms, shortest path (SP) and random walk with restart (RWR) algorithms, were executed on the corresponding network to mine novel chemicals for each ATC class using the validated drugs in a class as seed nodes. Then, the obtained chemicals yielded by these two algorithms were further evaluated by a permutation test and an association test. The former can exclude chemicals produced by the structure of the network, i.e., false positive discoveries. By contrast, the latter identifies the most important chemicals that have strong associations with the ATC class. Comparisons indicated that the two models can provide quite dissimilar results, suggesting that the results yielded by one model can be essential supplements for those obtained by the other model. In addition, several representative inferred chemicals were analyzed to confirm the reliability of the results generated by the two models. This article is part of a Special Issue entitled: Accelerating Precision Medicine through Genetic and Genomic Big Data Analysis edited by Yudong Cai & Tao Huang. Copyright © 2017 Elsevier B.V. All rights reserved.

  4. RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules

    Directory of Open Access Journals (Sweden)

    Michaeli Shulamit

    2007-10-01

    Full Text Available Abstract Background In recent years, RNA molecules that are not translated into proteins (ncRNAs have drawn a great deal of attention, as they were shown to be involved in many cellular functions. One of the most important computational problems regarding ncRNA is to predict the secondary structure of a molecule from its sequence. In particular, we attempted to predict the secondary structure for a set of unaligned ncRNA molecules that are taken from the same family, and thus presumably have a similar structure. Results We developed the RNAspa program, which comparatively predicts the secondary structure for a set of ncRNA molecules in linear time in the number of molecules. We observed that in a list of several hundred suboptimal minimal free energy (MFE predictions, as provided by the RNAsubopt program of the Vienna package, it is likely that at least one suggested structure would be similar to the true, correct one. The suboptimal solutions of each molecule are represented as a layer of vertices in a graph. The shortest path in this graph is the basis for structural predictions for the molecule. We also show that RNA secondary structures can be compared very rapidly by a simple string Edit-Distance algorithm with a minimal loss of accuracy. We show that this approach allows us to more deeply explore the suboptimal structure space. Conclusion The algorithm was tested on three datasets which include several ncRNA families taken from the Rfam database. These datasets allowed for comparison of the algorithm with other methods. In these tests, RNAspa performed better than four other programs.

  5. Revisit the landscape of protonated water clusters H+(H2O)n with n = 10-17: An ab initio global search

    Science.gov (United States)

    Shi, Ruili; Li, Keyao; Su, Yan; Tang, Lingli; Huang, Xiaoming; Sai, Linwei; Zhao, Jijun

    2018-05-01

    Using a genetic algorithm incorporated with density functional theory, we explore the ground state structures of protonated water clusters H+(H2O)n with n = 10-17. Then we re-optimize the isomers at B97-D/aug-cc-pVDZ level of theory. The extra proton connects with a H2O molecule to form a H3O+ ion in all H+(H2O)10-17 clusters. The lowest-energy structures adopt a monocage form at n = 10-16 and core-shell structure at n = 17 based on the MP2/aug-cc-pVTZ//B97-D/aug-cc-pVDZ+ZPE single-point-energy calculation. Using second-order vibrational perturbation theory, we further calculate the infrared spectra with anharmonic correction for the ground state structures of H+(H2O)10-17 clusters at the PBE0/aug-cc-pVDZ level. The anharmonic correction to the spectra is crucial since it reproduces the experimental results quite well. The extra proton weakens the O-H bond strength in the H3O+ ion since the Wiberg bond order of the O-H bond in the H3O+ ion is smaller than that in H2O molecules, which causes a red shift of the O-H stretching mode in the H3O+ ion.

  6. The isolation of [Pd{OC(O)H}(H)(NHC)(PR3)] (NHC = N-heterocyclic carbene) and its role in alkene and alkyne reductions using formic acid

    KAUST Repository

    Broggi, Julie

    2013-03-27

    The [Pd(SIPr)(PCy3)] complex efficiently promotes a tandem process involving dehydrogenation of formic acid and hydrogenation of C-C multiple bonds using H2 formed in situ. The isolation of a key catalytic hydridoformatopalladium species, [Pd{OC(O)H}(H)(IPr)(PCy 3)], is reported. The complex plays a key role in the Pd(0)-mediated formation of hydrogen from formic acid. Mechanistic and computational studies delineate the operational role of the palladium complex in this efficient tandem sequence. © 2013 American Chemical Society.

  7. Nonperfect synchronization of bond-forming and bond-rupturing processes in the reaction H + H2 → H2 + H

    International Nuclear Information System (INIS)

    Chandra, A.K.; Rao, V.S.

    1996-01-01

    The simplest prototypical hydrogen transfer reaction, i.e., H + H 2 → H 2 + H, is studied by the quantum-mechanical ab initio methods. Results reveal that during this reaction free valence which almost equals the square of the spin density develops on the migrating hydrogen atom. Bond orders are calculated using Mayer's formalism. Both the variations of bond orders and bond lengths along the reaction path are examined. This analysis reveals that the bond formation and bond cleavage processes in this reaction are not perfectly synchronous. The bond clevage process is slightly more advanced on the reaction path. 38 refs., 6 figs., 2 tabs

  8. The isolation of [Pd{OC(O)H}(H)(NHC)(PR3)] (NHC = N-heterocyclic carbene) and its role in alkene and alkyne reductions using formic acid

    KAUST Repository

    Broggi, Julie; Jurčí k, Vá clav; Songis, Olivier; Poater, Albert; Cavallo, Luigi; Slawin, Alexandra M. Z.; Cazin, Catherine S J

    2013-01-01

    The [Pd(SIPr)(PCy3)] complex efficiently promotes a tandem process involving dehydrogenation of formic acid and hydrogenation of C-C multiple bonds using H2 formed in situ. The isolation of a key catalytic hydridoformatopalladium species, [Pd{OC(O)H}(H)(IPr)(PCy 3)], is reported. The complex plays a key role in the Pd(0)-mediated formation of hydrogen from formic acid. Mechanistic and computational studies delineate the operational role of the palladium complex in this efficient tandem sequence. © 2013 American Chemical Society.

  9. Estimation of the reaction rate for the formation of CH3O from H + H2CO - Implications for chemistry in the solar system

    Science.gov (United States)

    Yung, Yuk L.; Drew, William A.; Pinto, Joseph P.; Friedl, Randall R.

    1988-01-01

    Troe's (1977) approximate theory is presently used in conjunction with transition state theory to estimate the rate coefficient of the reaction by which CO is reduced to CH4; attention is given to the role that may be played in the reduction process by the formation of the CH3O radical from H + H2CO. Attention is given to the implications of such a reaction (1) for the CO chemistry on Jupiter and within the solar nebula, (2) for the interpretation of such experimental results as those of Bar-Nun and Shaviv (1975) and Bar-Nun and Chang (1983), and (3) for organic synthesis in the prebiotic terrestrial atmosphere.

  10. ttH, H → WW(*) analysis at Atlas, LHC and Very Low Energy electron studies of 2004 combined test beam

    International Nuclear Information System (INIS)

    Zhang, H.

    2008-06-01

    The Large Hadron Collider(LHC) at CERN is a proton-proton collider with a designed center of mass energy of 14 TeV. ATLAS is a general purpose particle detector located at one of the colliding point of the LHC. Using ATLAS Computing System Commissioning (CSC) Monte Carlo full simulation data of the tt-bar H, H → WW * channel, this thesis studies the feasibility of measuring top-quark Yukawa Coupling up to 30 fb -1 integrated luminosity, within the intermediate Higgs mass range from 120 to 200 GeV. For the first time, trigger, pileup effects as well as all possible systematic uncertainties are extensively studied. For a Higgs mass of 160 GeV, with the detailed systematics uncertainties studied, the signal significance is shown to exceed 2σ by combining 2 leptons and 3 leptons final states together. The combined branching ratio of σ tt -bar H *BR H→WW (*) can reach an accuracy of 47%, and gives important information on the top quark Yukawa Coupling. This is the first study of the tt-bar H, H → WW * channel based on full simulation data, including a complete and detailed study of the systematic uncertainties. The most difficult part of the tt-bar H, H → WW * analysis is to extract signal from an abundant background since the total cross section of signal is only 0.1% of the main background. Moreover, signals have a complex final state of at least 4 jets, 2 leptons, 2 neutrinos, making the Higgs mass reconstruction very difficult. Lepton isolation is one of the most powerful method to suppress reducible backgrounds. This thesis develops a special Cone Isolation procedure, which suppress by a factor 5 the main tt-bar background. Lepton energy scale uncertainty is one of the important systematics for the tt-bar H, H → WW * analysis. A good linearity of Very Low Energy (VLE) electrons can improve the performance of estimating electron energy scale. The second part of this thesis presents a study of the linearity of VLE electron from 2004 ATLAS Combined Test

  11. Population of the 3s state in hydrogen due to H+, H2+ and H3+ impact on ethylene, 1-butene and cis-2-butene

    International Nuclear Information System (INIS)

    Loyd, D.H.; Dawson, H.R.

    1983-01-01

    Absolute cross sections were measured for capture or dissociation into the 3s state of atomic hydrogen due to impact of 14-28 keV H + , H +2 and H +3 ions on ethylene, 1-butene and cis-2-butene. The cross sections obtained for the butene targets were almost identical and support the additive rule for cross sections. Ethylene cross sections were 21% lower than the values predicted by the additive rule, which agrees well with the observed trend toward reduction in total electron capture cross sections for protons on these gases at much higher energies

  12. Hamacantha (Hamacantha) boomerang sp. nov. from deep-sea coral mounds at Campos Basin, SW Atlantic, and redescription of H. (H.) schmidtii (Carter, 1882) (Hamacanthidae, Poecilosclerida, Demospongiae).

    Science.gov (United States)

    Hajdu, Eduardo; Castello-Branco, Cristiana

    2014-01-08

    There are 22 species of Hamacantha registered from all over the world, and frequently from deep-waters, only two of which had previously been reported from the SW Atlantic. Here we describe a third species for this area, Hamacantha (H.) boomerang sp. nov., collected from deep-sea coral mounds at Campos Basin (off Rio de Janeiro state). We found oxeas 271-630 µm long, diancistras in three size classes, 125-155, 45-69 and 20-29 µm, and toxas, 58-82 µm. This is the only Hamacantha combining oxeas and toxas, but the latter are very rare. The species approaches the Caribbean H. (H.) schmidtii (Carter, 1882), where we observed oxeas 390-495 µm long, and diancistras in three size classes, 109-124,  44-54 and 26-41 μm, however toxas appear to be absent. Both species are clearly distinct by micrometric values, as well as the overall morphology of the smaller diancistras, distinct from the intermediate category in the new species, but quite similar in H. (H.) schmidtii. Hamacantha (Vomerula) falcula approaches the new species very closely in microsclere dimensions and morphology, but is set apart by its styloid and smaller megascleres.

  13. Search for Doubly-charged Higgs Boson Production in the Decay H++ H-- ---> mu+ mu+ mu- mu- with 1.1 fb**(-1) at D0 Detector

    International Nuclear Information System (INIS)

    Kim, Tae Jeong; Korea U

    2007-01-01

    This work presents a search for the pair production of doubly-charged Higgs bosons in the process p(bar p) → H ++ H -- → μ + μ + μ - μ - using the data corresponding to an integrated luminosity of about 1.1 fb -1 . This is the complete dataset of RunIIa taken from April 19, 2002 to February 22, 2006 by the D0 experiment at the Fermilab Tevatron Collider. In the absence of significant excess above standard model background, 95% confidence level mass limits of M(H L ±± ) > 150 GeV and M(H R ±± ) > 126.5 GeV are set for left-handed and right-handed doubly-charged Higgs bosons respectively assuming a 100% branching ratio into muons

  14. Construction of the R-matrix for three-dimensional, reactive atom--diatom scattering: application to H+H2

    International Nuclear Information System (INIS)

    Stechel, E.B.; Walker, R.B.; Light, J.C.

    1977-01-01

    In an extension of previous work (R.B. Walker, J.C. Light and A. Altenberger-Siczek, J. Chem. Phys. 64, 1166(1976)), equations for the accurate quantum mechanical treatment of three body rearrangement collisions are presented in the R-matrix language. These equations describe how the solutions to Schrodinger's equation in three separate regions of configuration space (each containing one asymptotic atom + diatom arrangement) are matched smoothly to each other. The symmetry of the matching equations is discussed in detail. Within the R-matrix formalism, unitary S-matrices may be constructed for arbitrary atom-diatom mass combinations and for small target wave function basis expansions. Applications of this method to the three dimensional H + H 2 (labelled nuclei) exchange reaction are reported, and comparison is made to prior work

  15. Reversible Heterolytic Cleavage of the H-H Bond by Molybdenum Complexes: Controlling the Dynamics of Exchange Between Proton and Hydride

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Shaoguang; Appel, Aaron M.; Bullock, R. Morris

    2017-05-18

    Controlling the heterolytic cleavage of the H-H bond of dihydrogen is critically important in catalytic hydrogenations and in the catalytic oxidation of H2. We show how the rate of reversible heterolytic cleavage of H2 can be controlled over nearly four orders of magnitude at 25 °C, from 2.1 × 103 s-1 to ≥107 s-1. Bifunctional Mo complexes, [CpMo(CO)(κ3-P2N2)]+ (P2N2 = 1,5-diaza-3,7-diphosphacyclooctane with alkyl/aryl groups on N and P), have been developed for heterolytic cleavage of H2 into a proton and a hydride, akin to Frustrated Lewis Pairs. The H-H bond cleavage is enabled by the basic amine in the second coordination sphere. The products of heterolytic cleavage of H2, Mo hydride complexes bearing protonated amines, [CpMo(H)(CO)(P2N2H)]+, were characterized by spectroscopic studies and by X-ray crystallography. Variable temperature 1H, 15N and 2-D 1H-1H ROESY NMR spectra indicated rapid exchange of the proton and hydride. The exchange rates are in the order [CpMo(H)(CO)(PPh2NPh2H)]+ > [CpMo(H)(CO)(PtBu2NPh2H)]+ > [CpMo(H)(CO)(PPh2NBn2H)]+ > [CpMo(H)(CO)(PtBu2NBn2H)]+ > [CpMo(H)(CO)(PtBu2NtBu2H)]+. The pKa values determined in acetonitrile range from 9.3 to 17.7, and show a linear correlation with the logarithm of the exchange rates. Thus the exchange dynamics are controlled through the relative acidity of the [CpMo(H)(CO)(P2N2H)]+ and [CpMo(H2)(CO)(P2N2)]+ isomers, providing a design principle for controlling heterolytic cleavage of H2.

  16. Temperature-dependent transitions between normal and inverse isotope effects pertaining to the interaction of H-H and C-H bonds with transition metal centers.

    Science.gov (United States)

    Parkin, Gerard

    2009-02-17

    Deuterium kinetic isotope effects (KIEs) serve as versatile tools to infer details about reaction mechanisms and the nature of transition states, while equilibrium isotope effects (EIEs) associated with the site preferences of hydrogen and deuterium enable researchers to study aspects of molecular structure. Researchers typically interpret primary deuterium isotope effects based on two simple guidelines: (i) the KIE for an elementary reaction is normal (k(H)/k(D) > 1) and (ii) the EIE is dictated by deuterium preferring to be located in the site corresponding to the highest frequency oscillator. In this Account, we evaluate the applicability of these rules to the interactions of H-H and C-H bonds with a transition metal center. Significantly, experimental and computational studies question the predictability of primary EIEs in these systems based on the notion that deuterium prefers to occupy the highest frequency oscillator. In particular, the EIEs for (i) formation of sigma-complexes by coordination of H-H and C-H bonds and (ii) oxidative addition of dihydrogen exhibit unusual temperature dependencies, such that the same system may demonstrate both normal (i.e., K(H)/K(D) > 1) and inverse (i.e., K(H)/K(D) ZPE (where SYM is the symmetry factor, MMI is the mass-moment of inertia term, EXC is the excitation term, and ZPE is the zero-point energy term), and the distinctive temperature profile results from the inverse ZPE (enthalpy) and normal [SYM x MMI x EXC] (entropy) components opposing each other and having different temperature dependencies. At low temperatures, the ZPE component dominates and the EIE is inverse, while at high temperatures, the [SYM x MMI x EXC] component dominates and the EIE is normal. The inverse nature of the ZPE term is a consequence of the rotational and translational degrees of freedom of RH (R = H, CH(3)) becoming low-energy isotopically sensitive vibrations in the product, while the normal nature of the [SYM x MMI x EXC] component

  17. Heterogeneous nuclear ribonucleoproteins H, H', and F are members of a ubiquitously expressed subfamily of related but distinct proteins encoded by genes mapping to different chromosomes

    DEFF Research Database (Denmark)

    Honoré, B; Rasmussen, H H; Vorum, H

    1995-01-01

    Molecular cDNA cloning, two-dimensional gel immunoblotting, and amino acid microsequencing identified three sequence-unique and distinct proteins that constitute a subfamily of ubiquitously expressed heterogeneous nuclear ribonucleoproteins corresponding to hnRNPs H, H', and F. These proteins share...... epitopes and sequence identity with two other proteins, isoelectric focusing sample spot numbers 2222 (37.6 kDa; pI 6.5) and 2326 (39.5 kDa; pI 6.6), indicating that the subfamily may contain additional members. The identity between hnRNPs H and H' is 96%, between H and F 78%, and between H' and F 75......%, respectively. The three proteins contain three repeats, which we denote quasi-RRMs (qRRMs) since they have a remote similarity to the RNA recognition motif (RRM). The three qRRMs of hnRNP H, with a few additional NH2-terminal amino acids, were constructed by polymerase chain reaction amplification and used...

  18. Nicotinamide nucleotide transhydrogenase from Rhodobacter capsulatus; the H+/H- ratio and the activation state of the enzyme during reduction of acetyl pyridine adenine dinucleotide.

    Science.gov (United States)

    Palmer, T; Jackson, J B

    1992-02-21

    Chromatophores from Rhodobacter capsulatus were incubated in the dark with NADPH and acetylpyridineadenine dinucleotide (AcPdAD+) in the presence of different concentrations of myxothiazol. The transhydrogenase activity was monitored until an appropriate mass action ratio, [AcPdAD+][NADPH]/[AcPdADH][NADP+], was reached. The sample was then illuminated and the initial rate of either AcPdAD+ reduction by NADPH or AcPdADH oxidation by NADP+ was recorded. The ratio of H+ translocated per H- equivalent transferred by transhydrogenase was calculated from the value of the membrane potential (delta pH = 0) at which illumination caused no net reaction in either direction. The mean value for the H+/H- ratio was 0.55. At greater values of [AcPdAD+][NADPH]/[AcPdADH][NADP+] than were employed in the above experiments and over a wider range of concentrations of myxothiazol, it was found that incremental increases in the membrane potential always gave rise to a decrease, never an increase in the rate of AcPdAD+ reduction. In contrast to the H(+)-ATP synthase, there is no evidence of any activation/deactivation of H(+)-transhydrogenase by the protonmotive force.

  19. Decays A →Z γ γ and ϕ →Z γ γ (ϕ =h , H ) in two-Higgs doublet models

    Science.gov (United States)

    Sánchez-Vélez, R.; Tavares-Velasco, G.

    2018-05-01

    The one-loop contributions to the decays of the C P -odd and C P -even scalar bosons A →Z γ γ and ϕ →Z γ γ (ϕ =h , H ) are calculated within the framework of C P -conserving two-Higgs doublet models (THDMs), where they are induced by box and reducible Feynman diagrams. The behavior of the corresponding branching ratios are then analyzed within the type-II THDM in a region of the parameter space around the alignment limit and still consistent with experimental data. It is found that the A →Z γ γ branching ratio is only relevant when mA>mH+mZ , but it is negligible otherwise. For mA>600 GeV and tβ≃O (1 ), BR (A →Z γ γ ) can reach values of the order of 10-5-10-4, but it decreases by about 1 order of magnitude as tβ increases up to 10. A similar behavior is followed by the H →Z γ γ decay, which only has a non-negligible branching ratio when mH>mA+mZ and can reach the level of 10-4-10-3 for mH>600 GeV and tβ≃O (1 ). We also estimated the branching ratios of these rare decays in the type-I THDM, where they can be about 1 order of magnitude larger than in type-II THDM. As far as the h →Z γ γ decay is concerned, since the properties of this scalar boson must be nearly identical to those of the SM Higgs boson, the h →Z γ γ branching ratio does not deviate significantly from the SM prediction, where it is negligibly small, of the order of 10-9. This result is in agreement with previous calculations.

  20. A Comparison of the Cluster-Span Threshold and the Union of Shortest Paths as Objective Thresholds of EEG Functional Connectivity Networks from Beta Activity in Alzhaimer’s Disease

    OpenAIRE

    Smith, K; Abasolo, Daniel Emilio; Escudero, J

    2016-01-01

    The Cluster-Span Threshold (CST) is a recently introduced unbiased threshold for functional connectivity networks. This binarisation technique offers a natural trade-off of sparsity and density of information by balancing the ratio of closed to open triples in the network topology. Here we present findings comparing it with the Union of Shortest Paths (USP), another recently proposed objective method. We analyse standard network metrics of binarised networks for sensitivity to clinical Alzhei...

  1. Observations of Lambda(0)(b) -> Lambda K+pi(-) and Lambda(0)(b) -> Lambda K+K- decays and searches for other Lambda(0)(b) and Xi(0)(b) decays to Lambda h(+)h '(-) final states

    NARCIS (Netherlands)

    Aaij, R.; Beteta, C. Abelian; Adeva, B.; Adinolfi, M.; Ajaltouni, Z.; Akar, S.; Albrechtl, J.; Alessio, F.; Alexander, M.; Ali, S.; Alkhazov, G.; Cartelle, P. Alvarez; Alves, A. A.; Arnato, S.; Amerio, S.; Amhis, Y.; An, L.; Anderlini, L.; Andreassi, G.; Andreotti, M.; Andrews, J. E.; Appleby, R. B.; Gutierrez, O. Aquines; Archilli, F.; d'Argent, P.; Artamonov, A.; Artuso, M.; Aslanides, E.; Auriemma, G.; Baalouch, M.; Bachmann, S.; Back, J. J.; Badalov, A.; Baesso, C.; Baker, S.; Baldini, W.; Barlow, R. J.; Barschel, C.; Barsuk, S.; Barter, W.; Batozskaya, V.; Battista, V.; Beaucourt, L.; Beddow, J.; Bedeschi, F.; Bediaga, I.; Bel, L. J.; Onderwater, C. J. G.; Pellegrino, A.; Tolk, S.

    2016-01-01

    A search is performed for the charmless three-body decays of the Lambda(0)(b) and Xi(0)(b) baryons to the final states Lambda h(+)h'(-), where h(') = pi or K. The analysis is based on a data sample, corresponding to an integrated luminosity of 3 fb-1 of pp collisions, collected by the LHCb

  2. Do nonbonded H--H interactions in phenanthrene stabilize it relative to anthracene? A possible resolution to this question and its implications for ligands such as 2,2'-bipyridyl.

    Science.gov (United States)

    Hancock, Robert D; Nikolayenko, Igor V

    2012-08-23

    The problem of whether interactions between the hydrogen atoms at the 1,10-positions in the "cleft" of the "bent" phenanthrene stabilize the latter molecule thermodynamically relative to "linear" anthracene, or whether the higher stability of phenanthrene is due to a more energetically favorable π-system, is considered. DFT calculations at the X3LYP/cc-pVTZ(-f)++ level of the ground state energies (E) of anthracene, phenanthrene, and the set of five benzoquinolines are reported. In the gas phase, "bent" phenanthrene was computed to be thermodynamically more stable than "linear" anthracene by -28.5 kJ mol(-1). This fact was attributed predominantly to the phenomenon of higher aromatic stabilization of the π-system of phenanthrene relative to anthracene, and not to the stabilizing influence of the nonbonding H--H interactions in its cleft. In fact, these interactions in phenanthrene were shown to be destabilizing. Similar calculations for five benzoquinolines (bzq) indicate that ΔE values vary as: 6,7-bzq (linear) ≤ 2,3-bzq (linear) < 5,6-bzq (bent) ≤ 3,4-bzq (bent) < 7,8-bzq (bent, no H--H nonbonding interactions in cleft), supporting the idea that it is a more stable π-system that favors 7,8-bzq over 2,3-bzq and 6,7-bzq, and that the H--H interactions in the clefts of 3,4-bzq and 5,6-bzq are destabilizing. Intramolecular hydrogen bonding in the cleft of 7,8-bzq plays a secondary role in its stabilization relative 6,7-bzq. The question of whether H--H nonbonded interactions between H atoms at the 3 and 3' positions of 2,2'-bipyridyl (bpy) coordinated to metal ions are stabilizing or destabilizing is then considered. The energy of bpy is scanned as a function of N-C-C-N torsion angle (χ) in the gas-phase, and it is found that the trans form is 32.8 kJ mol(-1) more stable than the cis conformer. A relaxed coordinate scan of energy of bpy in aqueous solution as a function of χ is modeled using the PBF approach, and it is found that the trans conformer is

  3. On the Organization of Parallel Operation of Some Algorithms for Finding the Shortest Path on a Graph on a Computer System with Multiple Instruction Stream and Single Data Stream

    Directory of Open Access Journals (Sweden)

    V. E. Podol'skii

    2015-01-01

    Full Text Available The paper considers the implementing Bellman-Ford and Lee algorithms to find the shortest graph path on a computer system with multiple instruction stream and single data stream (MISD. The MISD computer is a computer that executes commands of arithmetic-logical processing (on the CPU and commands of structures processing (on the structures processor in parallel on a single data stream. Transformation of sequential programs into the MISD programs is a labor intensity process because it requires a stream of the arithmetic-logical processing to be manually separated from that of the structures processing. Algorithms based on the processing of data structures (e.g., algorithms on graphs show high performance on a MISD computer. Bellman-Ford and Lee algorithms for finding the shortest path on a graph are representatives of these algorithms. They are applied to robotics for automatic planning of the robot movement in-situ. Modification of Bellman-Ford and Lee algorithms for finding the shortest graph path in coprocessor MISD mode and the parallel MISD modification of these algorithms were first obtained in this article. Thus, this article continues a series of studies on the transformation of sequential algorithms into MISD ones (Dijkstra and Ford-Fulkerson 's algorithms and has a pronouncedly applied nature. The article also presents the analysis results of Bellman-Ford and Lee algorithms in MISD mode. The paper formulates the basic trends of a technique for parallelization of algorithms into arithmetic-logical processing stream and structures processing stream. Among the key areas for future research, development of the mathematical approach to provide a subsequently formalized and automated process of parallelizing sequential algorithms between the CPU and structures processor is highlighted. Among the mathematical models that can be used in future studies there are graph models of algorithms (e.g., dependency graph of a program. Due to the high

  4. Mo-Mo Quintuple Bond is Highly Reactive in H-H, C-H, and O-H σ-Bond Cleavages Because of the Polarized Electronic Structure in Transition State.

    Science.gov (United States)

    Chen, Yue; Sakaki, Shigeyoshi

    2017-04-03

    The recently reported high reactivity of the Mo-Mo quintuple bond of Mo 2 (N ∧ N) 2 (1) {N ∧ N = μ-κ 2 -CH[N(2,6-iPr 2 C 6 H 3 )] 2 } in the H-H σ-bond cleavage was investigated. DFT calculations disclosed that the H-H σ-bond cleavage by 1 occurs with nearly no barrier to afford the cis-dihydride species followed by cis-trans isomerization to form the trans-dihydride product, which is consistent with the experimental result. The O-H and C-H bond cleavages by 1 were computationally predicted to occur with moderate (ΔG° ⧧ = 9.0 kcal/mol) and acceptable activation energies (ΔG° ⧧ = 22.5 kcal/mol), respectively, suggesting that the Mo-Mo quintuple bond can be applied to various σ-bond cleavages. In these σ-bond cleavage reactions, the charge-transfer (CT Mo→XH ) from the Mo-Mo quintuple bond to the X-H (X = H, C, or O) bond and that (CT XH→Mo ) from the X-H bond to the Mo-Mo bond play crucial roles. Though the HOMO (dδ-MO) of 1 is at lower energy and the LUMO + 2 (dδ*-MO) of 1 is at higher energy than those of RhCl(PMe 3 ) 2 (LUMO and LUMO + 1 of 1 are not frontier MO), the H-H σ-bond cleavage by 1 more easily occurs than that by the Rh complex. Hence, the frontier MO energies are not the reason for the high reactivity of 1. The high reactivity of 1 arises from the polarization of dδ-type MOs of the Mo-Mo quintuple bond in the transition state. Such a polarized electronic structure enhances the bonding overlap between the dδ-MO of the Mo-Mo bond and the σ*-antibonding MO of the X-H bond to facilitate the CT Mo→XH and reduce the exchange repulsion between the Mo-Mo bond and the X-H bond. This polarized electronic structure of the transition state is similar to that of a frustrated Lewis pair. The easy polarization of the dδ-type MOs is one of the advantages of the metal-metal multiple bond, because such polarization is impossible in the mononuclear metal complex.

  5. Electron detachment by H- + H- collisions

    International Nuclear Information System (INIS)

    Chibisov, M.I.; Yavlinskii, Yu.N.

    1994-01-01

    The autoionization channels for electrons detachment in collisions of two negative hydrogen ions in the energy range 300 - 500 eV and > 500 eV are investigated. In small energy range at large inter-ion distances the asymptotic approximation is used; at high energies - perturbation theory and classical motion are used. 18 refs., 3 figs

  6. On Finding Shortest Paths on Convex Polyhedra.

    Science.gov (United States)

    1985-05-01

    versi ty of N laryhrid ml Collge :IJR-. M T) 207-12 COMPUTER SCIENCE TECHNICAL REPR SERWS .UE TE UNIVERSITY OF MARYLAND COLLEGE PARK, MARYLAND S 20742...planar layout can be physically interpreted as cutting the polyhedron along the ridges and unfolding the resulting object onto the plane. o% 4e.. ~16 A o

  7. Approximate Shortest Homotopic Paths in Weighted Regions

    KAUST Repository

    Cheng, Siu-Wing; Jin, Jiongxin; Vigneron, Antoine; Wang, Yajun

    2010-01-01

    Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈(0,1), we present the first algorithm to compute a path between s and t that can be deformed to P

  8. Approximate Shortest Homotopic Paths in Weighted Regions

    KAUST Repository

    Cheng, Siu-Wing

    2010-01-01

    Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈(0,1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1 + ε of the optimum. The running time is O(h 3/ε2 kn polylog(k, n, 1/ε)), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T, respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight. © 2010 Springer-Verlag.

  9. Approximate shortest homotopic paths in weighted regions

    KAUST Repository

    Cheng, Siuwing

    2012-02-01

    A path P between two points s and t in a polygonal subdivision T with obstacles and weighted regions defines a class of paths that can be deformed to P without passing over any obstacle. We present the first algorithm that, given P and a relative error tolerance ε (0, 1), computes a path from this class with cost at most 1 + ε times the optimum. The running time is O(h 3/ε 2kn polylog (k,n,1/ε)), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T, respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight. © 2012 World Scientific Publishing Company.

  10. Shortest-paths preserving metro maps

    NARCIS (Netherlands)

    Milea, T.Y.; Schrijvers, O.J.; Buchin, K.; Haverkort, H.J.; Kreveld, van M.J.; Speckmann, B.

    2012-01-01

    A metro map, or subway map, is a schematic representation of a metro system of a city. The main goal of a metro map is to provide a traveler with information on which lines to take to get from station A to station B, and at which stations he needs to switch lines. It is often not beneficial to use

  11. Bad Luck When Joining the Shortest Queue

    NARCIS (Netherlands)

    Blanc, J.P.C.

    2008-01-01

    A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in one’s own queue. This paper quantifies the probability that one’s service would have started earlier if one had joined another queue than the queue that was

  12. Approximate shortest homotopic paths in weighted regions

    KAUST Repository

    Cheng, Siuwing; Jin, Jiongxin; Vigneron, Antoine E.; Wang, Yajun

    2012-01-01

    A path P between two points s and t in a polygonal subdivision T with obstacles and weighted regions defines a class of paths that can be deformed to P without passing over any obstacle. We present the first algorithm that, given P and a relative

  13. Optimization of CMS Detector Performance and Detection of the Standard Model Higgs Boson via the $qqH, H \\to \\tau\\tau$ Channel with a Lepton + a Jet in the Final State

    CERN Document Server

    Takahashi, Maiko; CERN. Geneva

    2007-01-01

    The Compact Muon Solenoid (CMS) is a general purpose detector at the Large Hadron Collider (LHC) designed to enable physics studies in the multi-TeV energy range. This thesis contains simulation studies on the performance of two of the CMS sub-detectors, the Silicon Strip Tracker and the Electromagnetic Calorimeter (ECAL), and results from a study which investigated the potential of observing the Standard Model Higgs boson via the qqH, H -> tautau channel with a lepton and a jet in the final state. New algorithms have been developed to measure and monitor the pedestals of the Silicon Tracker during data taking, and to improve the online calculation of the common mode offset. The variation of the fraction of energy contained in reconstructed clusters of fixed size over the true energy for single photon and electron events in the barrel ECAL has been studied. Due to the ECAL geometry, the fractional energy varies by 0.7% in the pseudorapidity range between the centre (eta= 0) and the forward end (eta= 1.479) of...

  14. Effects of variation in background mixing ratios of N2, O2, and Ar on the measurement of δ18O-H2O and δ2H-H2O values by cavity ring-down spectroscopy

    Science.gov (United States)

    Johnson, Jennifer E.; Rella, Chris W.

    2017-08-01

    Cavity ring-down spectrometers have generally been designed to operate under conditions in which the background gas has a constant composition. However, there are a number of observational and experimental situations of interest in which the background gas has a variable composition. In this study, we examine the effect of background gas composition on a cavity ring-down spectrometer that measures δ18O-H2O and δ2H-H2O values based on the amplitude of water isotopologue absorption features around 7184 cm-1 (L2120-i, Picarro, Inc.). For background mixtures balanced with N2, the apparent δ18O values deviate from true values by -0.50 ± 0.001 ‰ O2 %-1 and -0.57 ± 0.001 ‰ Ar %-1, and apparent δ2H values deviate from true values by 0.26 ± 0.004 ‰ O2 %-1 and 0.42 ± 0.004 ‰ Ar %-1. The artifacts are the result of broadening, narrowing, and shifting of both the target absorption lines and strong neighboring lines. While the background-induced isotopic artifacts can largely be corrected with simple empirical or semi-mechanistic models, neither type of model is capable of completely correcting the isotopic artifacts to within the inherent instrument precision. The development of strategies for dynamically detecting and accommodating background variation in N2, O2, and/or Ar would facilitate the application of cavity ring-down spectrometers to a new class of observations and experiments.

  15. /sup 3/H)-(H-D-Phe-Cys-Tyr-D-Trp-Orn-Thr-Pen-Thr-NH2) ((/sup 3/H)CTOP), a potent and highly selective peptide for mu opioid receptors in rat brain

    Energy Technology Data Exchange (ETDEWEB)

    Hawkins, K.N.; Knapp, R.J.; Lui, G.K.; Gulya, K.; Kazmierski, W.; Wan, Y.P.; Pelton, J.T.; Hruby, V.J.; Yamamura, H.I.

    1989-01-01

    The cyclic, conformationally restricted octapeptide (3H)-(H-D-Phe-Cys-Tyr-D-Trp-Orn-Thr-Pen-Thr-NH2) ((3H)CTOP) was synthesized and its binding to mu opioid receptors was characterized in rat brain membrane preparations. Association rates (k+1) of 1.25 x 10(8) M-1 min-1 and 2.49 x 10(8) M-1 min-1 at 25 and 37 degrees C, respectively, were obtained, whereas dissociation rates (k-1) at the same temperatures were 1.93 x 10(-2) min-1 and 1.03 x 10(-1) min-1 at 25 and 37 degrees C, respectively. Saturation isotherms of (3H)CTOP binding to rat brain membranes gave apparent Kd values of 0.16 and 0.41 nM at 25 and 37 degrees C, respectively. Maximal number of binding sites in rat brain membranes were found to be 94 and 81 fmol/mg of protein at 25 and 37 degrees C, respectively. (3H)CTOP binding over a concentration range of 0.1 to 10 nM was best fit by a one site model consistent with binding to a single site. The general effect of different metal ions and guanyl-5'-yl-imidodiphosphate on (3H)CTOP binding was to reduce its affinity. High concentrations (100 mM) of sodium also produced a reduction of the apparent mu receptor density. Utilizing the delta opioid receptor specific peptide (3H)-(D-Pen2,D-Pen5)enkephalin, CTOP appeared to be about 2000-fold more specific for mu vs. delta opioid receptor than naloxone. Specific (3H)CTOP binding was inhibited by a large number of opioid or opiate ligands.

  16. Sh-h-h-h: Representations of Perpetrators of Sexual Child Abuse in Picturebooks

    Science.gov (United States)

    Lampert, Jo

    2012-01-01

    Children's picturebooks dealing with the topic of child sexual abuse first appeared in the early 1980s with the aim of addressing the need for age-appropriate texts to teach sexual abuse prevention concepts and to provide support for young children who may be at risk of or have already experienced sexual abuse. Despite the apparent potential of…

  17. Observations of $\\Lambda_b^0 \\to \\Lambda K^+\\pi^-$ and $\\Lambda_b^0 \\to \\Lambda K^+K^-$ decays and searches for other $\\Lambda_b^0$ and $\\Xi_b^0$ decays to $\\Lambda h^+h^{\\prime -}$ final states

    CERN Document Server

    Aaij, Roel; Adeva, Bernardo; Adinolfi, Marco; Ajaltouni, Ziad; Akar, Simon; Albrecht, Johannes; Alessio, Federico; Alexander, Michael; Ali, Suvayu; Alkhazov, Georgy; Alvarez Cartelle, Paula; Alves Jr, Antonio Augusto; Amato, Sandra; Amerio, Silvia; Amhis, Yasmine; An, Liupan; Anderlini, Lucio; Andreassi, Guido; Andreotti, Mirco; Andrews, Jason; Appleby, Robert; Aquines Gutierrez, Osvaldo; Archilli, Flavio; d'Argent, Philippe; Artamonov, Alexander; Artuso, Marina; Aslanides, Elie; Auriemma, Giulio; Baalouch, Marouen; Bachmann, Sebastian; Back, John; Badalov, Alexey; Baesso, Clarissa; Baker, Sophie; Baldini, Wander; Barlow, Roger; Barschel, Colin; Barsuk, Sergey; Barter, William; Batozskaya, Varvara; Battista, Vincenzo; Bay, Aurelio; Beaucourt, Leo; Beddow, John; Bedeschi, Franco; Bediaga, Ignacio; Bel, Lennaert; Bellee, Violaine; Belloli, Nicoletta; Belyaev, Ivan; Ben-Haim, Eli; Bencivenni, Giovanni; Benson, Sean; Benton, Jack; Berezhnoy, Alexander; Bernet, Roland; Bertolin, Alessandro; Betti, Federico; Bettler, Marc-Olivier; van Beuzekom, Martinus; Bifani, Simone; Billoir, Pierre; Bird, Thomas; Birnkraut, Alex; Bizzeti, Andrea; Blake, Thomas; Blanc, Frédéric; Blouw, Johan; Blusk, Steven; Bocci, Valerio; Bondar, Alexander; Bondar, Nikolay; Bonivento, Walter; Borgheresi, Alessio; Borghi, Silvia; Borisyak, Maxim; Borsato, Martino; Boubdir, Meriem; Bowcock, Themistocles; Bowen, Espen Eie; Bozzi, Concezio; Braun, Svende; Britsch, Markward; Britton, Thomas; Brodzicka, Jolanta; Buchanan, Emma; Burr, Christopher; Bursche, Albert; Buytaert, Jan; Cadeddu, Sandro; Calabrese, Roberto; Calvi, Marta; Calvo Gomez, Miriam; Campana, Pierluigi; Campora Perez, Daniel; Capriotti, Lorenzo; Carbone, Angelo; Carboni, Giovanni; Cardinale, Roberta; Cardini, Alessandro; Carniti, Paolo; Carson, Laurence; Carvalho Akiba, Kazuyoshi; Casse, Gianluigi; Cassina, Lorenzo; Castillo Garcia, Lucia; Cattaneo, Marco; Cauet, Christophe; Cavallero, Giovanni; Cenci, Riccardo; Charles, Matthew; Charpentier, Philippe; Chatzikonstantinidis, Georgios; Chefdeville, Maximilien; Chen, Shanzhen; Cheung, Shu-Faye; Chrzaszcz, Marcin; Cid Vidal, Xabier; Ciezarek, Gregory; Clarke, Peter; Clemencic, Marco; Cliff, Harry; Closier, Joel; Coco, Victor; Cogan, Julien; Cogneras, Eric; Cogoni, Violetta; Cojocariu, Lucian; Collazuol, Gianmaria; Collins, Paula; Comerma-Montells, Albert; Contu, Andrea; Cook, Andrew; Coombes, Matthew; Coquereau, Samuel; Corti, Gloria; Corvo, Marco; Couturier, Benjamin; Cowan, Greig; Craik, Daniel Charles; Crocombe, Andrew; Cruz Torres, Melissa Maria; Cunliffe, Samuel; Currie, Robert; D'Ambrosio, Carmelo; Dall'Occo, Elena; Dalseno, Jeremy; David, Pieter; Davis, Adam; De Aguiar Francisco, Oscar; De Bruyn, Kristof; De Capua, Stefano; De Cian, Michel; De Miranda, Jussara; De Paula, Leandro; De Simone, Patrizia; Dean, Cameron Thomas; Decamp, Daniel; Deckenhoff, Mirko; Del Buono, Luigi; Déléage, Nicolas; Demmer, Moritz; Derkach, Denis; Deschamps, Olivier; Dettori, Francesco; Dey, Biplab; Di Canto, Angelo; Di Ruscio, Francesco; Dijkstra, Hans; Dordei, Francesca; Dorigo, Mirco; Dosil Suárez, Alvaro; Dovbnya, Anatoliy; Dreimanis, Karlis; Dufour, Laurent; Dujany, Giulio; Dungs, Kevin; Durante, Paolo; Dzhelyadin, Rustem; Dziurda, Agnieszka; Dzyuba, Alexey; Easo, Sajan; Egede, Ulrik; Egorychev, Victor; Eidelman, Semen; Eisenhardt, Stephan; Eitschberger, Ulrich; Ekelhof, Robert; Eklund, Lars; El Rifai, Ibrahim; Elsasser, Christian; Ely, Scott; Esen, Sevda; Evans, Hannah Mary; Evans, Timothy; Falabella, Antonio; Färber, Christian; Farley, Nathanael; Farry, Stephen; Fay, Robert; Fazzini, Davide; Ferguson, Dianne; Fernandez Albor, Victor; Ferrari, Fabio; Ferreira Rodrigues, Fernando; Ferro-Luzzi, Massimiliano; Filippov, Sergey; Fiore, Marco; Fiorini, Massimiliano; Firlej, Miroslaw; Fitzpatrick, Conor; Fiutowski, Tomasz; Fleuret, Frederic; Fohl, Klaus; Fontana, Marianna; Fontanelli, Flavio; Forshaw, Dean Charles; Forty, Roger; Frank, Markus; Frei, Christoph; Frosini, Maddalena; Fu, Jinlin; Furfaro, Emiliano; Gallas Torreira, Abraham; Galli, Domenico; Gallorini, Stefano; Gambetta, Silvia; Gandelman, Miriam; Gandini, Paolo; Gao, Yuanning; García Pardiñas, Julián; Garra Tico, Jordi; Garrido, Lluis; Garsed, Philip John; Gascon, David; Gaspar, Clara; Gavardi, Laura; Gazzoni, Giulio; Gerick, David; Gersabeck, Evelina; Gersabeck, Marco; Gershon, Timothy; Ghez, Philippe; Gianì, Sebastiana; Gibson, Valerie; Girard, Olivier Göran; Giubega, Lavinia-Helena; Gligorov, V.V.; Göbel, Carla; Golubkov, Dmitry; Golutvin, Andrey; Gomes, Alvaro; Gotti, Claudio; Grabalosa Gándara, Marc; Graciani Diaz, Ricardo; Granado Cardoso, Luis Alberto; Graugés, Eugeni; Graverini, Elena; Graziani, Giacomo; Grecu, Alexandru; Griffith, Peter; Grillo, Lucia; Grünberg, Oliver; Gui, Bin; Gushchin, Evgeny; Guz, Yury; Gys, Thierry; Hadavizadeh, Thomas; Hadjivasiliou, Christos; Haefeli, Guido; Haen, Christophe; Haines, Susan; Hall, Samuel; Hamilton, Brian; Han, Xiaoxue; Hansmann-Menzemer, Stephanie; Harnew, Neville; Harnew, Samuel; Harrison, Jonathan; He, Jibo; Head, Timothy; Heister, Arno; Hennessy, Karol; Henrard, Pierre; Henry, Louis; Hernando Morata, Jose Angel; van Herwijnen, Eric; Heß, Miriam; Hicheur, Adlène; Hill, Donal; Hoballah, Mostafa; Hombach, Christoph; Hongming, Li; Hulsbergen, Wouter; Humair, Thibaud; Hushchyn, Mikhail; Hussain, Nazim; Hutchcroft, David; Idzik, Marek; Ilten, Philip; Jacobsson, Richard; Jaeger, Andreas; Jalocha, Pawel; Jans, Eddy; Jawahery, Abolhassan; John, Malcolm; Johnson, Daniel; Jones, Christopher; Joram, Christian; Jost, Beat; Jurik, Nathan; Kandybei, Sergii; Kanso, Walaa; Karacson, Matthias; Karbach, Moritz; Karodia, Sarah; Kecke, Matthieu; Kelsey, Matthew; Kenyon, Ian; Kenzie, Matthew; Ketel, Tjeerd; Khairullin, Egor; Khanji, Basem; Khurewathanakul, Chitsanu; Kirn, Thomas; Klaver, Suzanne; Klimaszewski, Konrad; Kolpin, Michael; Komarov, Ilya; Koopman, Rose; Koppenburg, Patrick; Kozeiha, Mohamad; Kravchuk, Leonid; Kreplin, Katharina; Kreps, Michal; Krokovny, Pavel; Kruse, Florian; Krzemien, Wojciech; Kucewicz, Wojciech; Kucharczyk, Marcin; Kudryavtsev, Vasily; Kuonen, Axel Kevin; Kurek, Krzysztof; Kvaratskheliya, Tengiz; Lacarrere, Daniel; Lafferty, George; Lai, Adriano; Lambert, Dean; Lanfranchi, Gaia; Langenbruch, Christoph; Langhans, Benedikt; Latham, Thomas; Lazzeroni, Cristina; Le Gac, Renaud; van Leerdam, Jeroen; Lees, Jean-Pierre; Lefèvre, Regis; Leflat, Alexander; Lefrançois, Jacques; Lemos Cid, Edgar; Leroy, Olivier; Lesiak, Tadeusz; Leverington, Blake; Li, Yiming; Likhomanenko, Tatiana; Lindner, Rolf; Linn, Christian; Lionetto, Federica; Liu, Bo; Liu, Xuesong; Loh, David; Longstaff, Iain; Lopes, Jose; Lucchesi, Donatella; Lucio Martinez, Miriam; Luo, Haofei; Lupato, Anna; Luppi, Eleonora; Lupton, Oliver; Lusardi, Nicola; Lusiani, Alberto; Lyu, Xiao-Rui; Machefert, Frederic; Maciuc, Florin; Maev, Oleg; Maguire, Kevin; Malde, Sneha; Malinin, Alexander; Manca, Giulia; Mancinelli, Giampiero; Manning, Peter Michael; Mapelli, Alessandro; Maratas, Jan; Marchand, Jean François; Marconi, Umberto; Marin Benito, Carla; Marino, Pietro; Marks, Jörg; Martellotti, Giuseppe; Martin, Morgan; Martinelli, Maurizio; Martinez Santos, Diego; Martinez Vidal, Fernando; Martins Tostes, Danielle; Massacrier, Laure Marie; Massafferri, André; Matev, Rosen; Mathad, Abhijit; Mathe, Zoltan; Matteuzzi, Clara; Mauri, Andrea; Maurin, Brice; Mazurov, Alexander; McCann, Michael; McCarthy, James; McNab, Andrew; McNulty, Ronan; Meadows, Brian; Meier, Frank; Meissner, Marco; Melnychuk, Dmytro; Merk, Marcel; Merli, Andrea; Michielin, Emanuele; Milanes, Diego Alejandro; Minard, Marie-Noelle; Mitzel, Dominik Stefan; Molina Rodriguez, Josue; Monroy, Ignacio Alberto; Monteil, Stephane; Morandin, Mauro; Morawski, Piotr; Mordà, Alessandro; Morello, Michael Joseph; Moron, Jakub; Morris, Adam Benjamin; Mountain, Raymond; Muheim, Franz; Müller, Dominik; Müller, Janine; Müller, Katharina; Müller, Vanessa; Mussini, Manuel; Muster, Bastien; Naik, Paras; Nakada, Tatsuya; Nandakumar, Raja; Nandi, Anita; Nasteva, Irina; Needham, Matthew; Neri, Nicola; Neubert, Sebastian; Neufeld, Niko; Neuner, Max; Nguyen, Anh Duc; Nguyen-Mau, Chung; Niess, Valentin; Nieswand, Simon; Niet, Ramon; Nikitin, Nikolay; Nikodem, Thomas; Novoselov, Alexey; O'Hanlon, Daniel Patrick; Oblakowska-Mucha, Agnieszka; Obraztsov, Vladimir; Ogilvy, Stephen; Okhrimenko, Oleksandr; Oldeman, Rudolf; Onderwater, Gerco; Osorio Rodrigues, Bruno; Otalora Goicochea, Juan Martin; Otto, Adam; Owen, Patrick; Oyanguren, Maria Aranzazu; Palano, Antimo; Palombo, Fernando; Palutan, Matteo; Panman, Jacob; Papanestis, Antonios; Pappagallo, Marco; Pappalardo, Luciano; Pappenheimer, Cheryl; Parker, William; Parkes, Christopher; Passaleva, Giovanni; Patel, Girish; Patel, Mitesh; Patrignani, Claudia; Pearce, Alex; Pellegrino, Antonio; Penso, Gianni; Pepe Altarelli, Monica; Perazzini, Stefano; Perret, Pascal; Pescatore, Luca; Petridis, Konstantinos; Petrolini, Alessandro; Petruzzo, Marco; Picatoste Olloqui, Eduardo; Pietrzyk, Boleslaw; Pikies, Malgorzata; Pinci, Davide; Pistone, Alessandro; Piucci, Alessio; Playfer, Stephen; Plo Casasus, Maximo; Poikela, Tuomas; Polci, Francesco; Poluektov, Anton; Polyakov, Ivan; Polycarpo, Erica; Popov, Alexander; Popov, Dmitry; Popovici, Bogdan; Potterat, Cédric; Price, Eugenia; Price, Joseph David; Prisciandaro, Jessica; Pritchard, Adrian; Prouve, Claire; Pugatch, Valery; Puig Navarro, Albert; Punzi, Giovanni; Qian, Wenbin; Quagliani, Renato; Rachwal, Bartolomiej; Rademacker, Jonas; Rama, Matteo; Ramos Pernas, Miguel; Rangel, Murilo; Raniuk, Iurii; Raven, Gerhard; Redi, Federico; Reichert, Stefanie; dos Reis, Alberto; Renaudin, Victor; Ricciardi, Stefania; Richards, Sophie; Rihl, Mariana; Rinnert, Kurt; Rives Molina, Vincente; Robbe, Patrick; Rodrigues, Ana Barbara; Rodrigues, Eduardo; Rodriguez Lopez, Jairo Alexis; Rodriguez Perez, Pablo; Rogozhnikov, Alexey; Roiser, Stefan; Romanovsky, Vladimir; Romero Vidal, Antonio; Ronayne, John William; Rotondo, Marcello; Ruf, Thomas; Ruiz Valls, Pablo; Saborido Silva, Juan Jose; Sagidova, Naylya; Saitta, Biagio; Salustino Guimaraes, Valdir; Sanchez Mayordomo, Carlos; Sanmartin Sedes, Brais; Santacesaria, Roberta; Santamarina Rios, Cibran; Santimaria, Marco; Santovetti, Emanuele; Sarti, Alessio; Satriano, Celestina; Satta, Alessia; Saunders, Daniel Martin; Savrina, Darya; Schael, Stefan; Schiller, Manuel; Schindler, Heinrich; Schlupp, Maximilian; Schmelling, Michael; Schmelzer, Timon; Schmidt, Burkhard; Schneider, Olivier; Schopper, Andreas; Schubiger, Maxime; Schune, Marie Helene; Schwemmer, Rainer; Sciascia, Barbara; Sciubba, Adalberto; Semennikov, Alexander; Sergi, Antonino; Serra, Nicola; Serrano, Justine; Sestini, Lorenzo; Seyfert, Paul; Shapkin, Mikhail; Shapoval, Illya; Shcheglov, Yury; Shears, Tara; Shekhtman, Lev; Shevchenko, Vladimir; Shires, Alexander; Siddi, Benedetto Gianluca; Silva Coutinho, Rafael; Silva de Oliveira, Luiz Gustavo; Simi, Gabriele; Sirendi, Marek; Skidmore, Nicola; Skwarnicki, Tomasz; Smith, Eluned; Smith, Iwan Thomas; Smith, Jackson; Smith, Mark; Snoek, Hella; Sokoloff, Michael; Soler, Paul; Soomro, Fatima; Souza, Daniel; Souza De Paula, Bruno; Spaan, Bernhard; Spradlin, Patrick; Sridharan, Srikanth; Stagni, Federico; Stahl, Marian; Stahl, Sascha; Stefkova, Slavomira; Steinkamp, Olaf; Stenyakin, Oleg; Stevenson, Scott; Stoica, Sabin; Stone, Sheldon; Storaci, Barbara; Stracka, Simone; Straticiuc, Mihai; Straumann, Ulrich; Sun, Liang; Sutcliffe, William; Swientek, Krzysztof; Swientek, Stefan; Syropoulos, Vasileios; Szczekowski, Marek; Szumlak, Tomasz; T'Jampens, Stephane; Tayduganov, Andrey; Tekampe, Tobias; Tellarini, Giulia; Teubert, Frederic; Thomas, Christopher; Thomas, Eric; van Tilburg, Jeroen; Tisserand, Vincent; Tobin, Mark; Tolk, Siim; Tomassetti, Luca; Tonelli, Diego; Topp-Joergensen, Stig; Tournefier, Edwige; Tourneur, Stephane; Trabelsi, Karim; Traill, Murdo; Tran, Minh Tâm; Tresch, Marco; Trisovic, Ana; Tsaregorodtsev, Andrei; Tsopelas, Panagiotis; Tuning, Niels; Ukleja, Artur; Ustyuzhanin, Andrey; Uwer, Ulrich; Vacca, Claudia; Vagnoni, Vincenzo; Valat, Sebastien; Valenti, Giovanni; Vallier, Alexis; Vazquez Gomez, Ricardo; Vazquez Regueiro, Pablo; Vázquez Sierra, Carlos; Vecchi, Stefania; van Veghel, Maarten; Velthuis, Jaap; Veltri, Michele; Veneziano, Giovanni; Vesterinen, Mika; Viaud, Benoit; Vieira, Daniel; Vieites Diaz, Maria; Vilasis-Cardona, Xavier; Volkov, Vladimir; Vollhardt, Achim; Voong, David; Vorobyev, Alexey; Vorobyev, Vitaly; Voß, Christian; de Vries, Jacco; Waldi, Roland; Wallace, Charlotte; Wallace, Ronan; Walsh, John; Wang, Jianchun; Ward, David; Watson, Nigel; Websdale, David; Weiden, Andreas; Whitehead, Mark; Wicht, Jean; Wilkinson, Guy; Wilkinson, Michael; Williams, Mark Richard James; Williams, Matthew; Williams, Mike; Williams, Timothy; Wilson, Fergus; Wimberley, Jack; Wishahi, Julian; Wislicki, Wojciech; Witek, Mariusz; Wormser, Guy; Wotton, Stephen; Wraight, Kenneth; Wright, Simon; Wyllie, Kenneth; Xie, Yuehong; Xu, Zhirui; Yang, Zhenwei; Yin, Hang; Yu, Jiesheng; Yuan, Xuhao; Yushchenko, Oleg; Zangoli, Maria; Zavertyaev, Mikhail; Zhang, Liming; Zhang, Yanxi; Zhelezov, Alexey; Zheng, Yangheng; Zhokhov, Anatoly; Zhong, Liang; Zhukov, Valery; Zucchelli, Stefano

    2016-05-13

    A search is performed for the charmless three-body decays of the $\\Lambda_b^0$ and $\\Xi_b^0$ baryons to the final states $\\Lambda h^+h^{\\prime -}$, where $h^{(\\prime)} = \\pi$ or $K$. The analysis is based on a data sample, corresponding to an integrated luminosity of $3 \\rm fb^{-1}$ of $pp$ collisions, collected by the LHCb experiment. The $\\Lambda_b^0 \\to \\Lambda K^+\\pi^-$ and $\\Lambda_b^0 \\to \\Lambda K^+K^-$ decays are observed for the first time and their branching fractions and $CP$ asymmetry parameters are measured. Evidence is seen for the $\\Lambda_b^0 \\to \\Lambda \\pi^+\\pi^-$ decay and limits are set on the branching fractions of $\\Xi_b^0$ baryon decays to the $\\Lambda h^+h^{\\prime -}$ final states.

  18. Observing shape resonances in ultraslow H^++H elastic scattering

    Science.gov (United States)

    Macek, J. H.; Schultz, D. R.; Ovchinnikov, S. Yu.; Krstic, P. S.

    2004-05-01

    We have calculated highly accurate elastic and charge transfer cross sections for proton-hydrogen scattering at energies 0.0001-10 eV, using fully quantal approach (P.S. Krstic and D.R. Schultz, J. Phys. B 32, 3485 (1999)). A number of resonances are observed. We calculate the positions and widths of the shape resonances in the effective potentials for various orbital angular momenta (J. H. Macek and S. Yu. Ovchinnikov, Phys. Rev. A 50, 468 (1994)). These correlate well with the observed resonances. We acknowledge support from the US DOE through ORNL, managed by UT-Battelle, LLC under contract DE-AC05-00OR22725.

  19. Resonant charge exchange for H-H+ in Debye plasmas

    Science.gov (United States)

    Laricchiuta, Annarita; Colonna, Gianpiero; Capitelli, Mario; Kosarim, Alexander; Smirnov, Boris M.

    2017-11-01

    The dynamics of resonant charge exchange in proton-hydrogen collisions embedded in plasma is investigated in the framework of the asymptotic approach, modified to account for the effect of Debye-Hückel screening in particle interactions. The cross sections exhibit a marked dependence on the Debye length in regimes of severe plasma confinement. Processes involving excited states H( n)-H+ are also discussed.

  20. Orientation and alignment in H+-H collisions

    International Nuclear Information System (INIS)

    Hansen, J.P.; Dubois, A.; Nielsen, S.E.

    1991-01-01

    We have calculated probabilities, orientation parameters, and alignment angles for 2p excitation and capture in proton-hydrogen collisions at 50- and 100-keV projectile energy. The results, obtained from solving the Schroedinger equation in a multistate atomic-orbital expansion, are compared to those of a similar, recently published investigation. In both studies, similar results for excitation are found, and also for capture at large impact parameters. The origin of different predictions for capture at intermediate impact parameters is discussed

  1. Triosmium cluster compounds containing isocyanide and hydride ligands. Crystal and molecular structures of (μ-H)(H)Os3(CO)10(CN-t-C4H9) and (μ-H)2Os3(CO)9(CN-t-C4H9)

    International Nuclear Information System (INIS)

    Adams, R.D.; Golembski, N.M.

    1979-01-01

    The structures of the compounds (μ-H)(H)Os 3 (CO) 10 (CN-t-C 4 H 9 ) and (μ-H) 2 Os 3 (CO) 9 (CN-t-C 4 H 9 ) have been revealed by x-ray crystallographic techniques. For (μ-H)(H)Os 3 (CO) 10 (CN-t-C 4 H 9 ): a = 9.064 (3), b = 12.225 (3), c = 20.364 (4) A; β = 98.73 (3) 0 ; space group P2 1 /c[C/sub 2h/ 5 ], No. 14; Z = 4; d/sub calcd/ = 2.79 g cm -3 . This compound contains a triangular cluster of three osmium atoms; Os(1)--Os(2) = 2.930 (1) A, Os(1)--Os(3) = 2.876 (1) A, and Os(2)--Os(3) = 3.000 (1) A. There are ten linear terminal carbonyl groups and one linear terminal isocyanide ligand which occupies an axial coordination site. The hydrogen atoms were not observed crystallographically, but their positions are strongly inferred from considerations of molecular geometry. For (μ-H) 2 Os 3 (CO) 9 (CN-t-C 4 H 9 ): a = 15.220 (8), b = 12.093 (6), c = 23.454 (5) A; space group Pbcn [D/sub 2h/ 14 ], No. 60; Z = 8; d/sub calcd/ = 2.79 g cm -3 . The compound is analogous to the parent carbonyl (μ-H) 2 Os 3 (CO) 10 and has two normal and one short osmium--osmium bonds: Os(1)--Os(2) = 2.827 (1) A, Os(1)--Os(3) = 2.828 (1) A, Os(2)--Os(3) = 2.691 (1) A. The isocyanide ligand resides in an equatorial coordination site on osmium Os(2). The hydrogen atoms were not observed but are believed to occupy bridging positions as in the parent carbonyl complex. 2 figures, 7 tables

  2. Dynamic shortest path problems : hybrid routing policies considering network disruptions

    NARCIS (Netherlands)

    Sever, D.; Dellaert, N.P.; Woensel, van T.; Kok, de A.G.

    2013-01-01

    Traffic network disruptions lead to significant increases in transportation costs. We consider networks in which a number of links are vulnerable to these disruptions leading to a significantly higher travel time on these links. For these vulnerable links, we consider known link disruption

  3. Minimizing Communication in All-Pairs Shortest Paths

    Science.gov (United States)

    2013-02-13

    on a 16,384 vertex, 5% dense graph, is slightly faster using our approach (18.6 vs . 22.6 seconds) than using the replicated Johnson’s algorithm...Oracle and Samsung , as well as MathWorks. Research is also supported by DOE grants DE-SC0004938, DE-SC0005136, DE-SC0003959, DE-SC0008700, and AC02...Brickell, I. S. Dhillon, S. Sra, and J. A. Tropp. The metric nearness problem. SIAM J. Matrix Anal. Appl ., 30:375–396, 2008. [11] A. Buluç, J. R. Gilbert

  4. k-Shortest routing of trains on shunting yards

    NARCIS (Netherlands)

    Riezebos, Jan; van Wezel, Wout

    2009-01-01

    We consider the problem of designing algorithmic support for k-best routing decisions in train shunting scheduling. A study at the Netherlands Railways revealed that planners like to interact with the solution process of finding suitable routes. Two types of interaction were required: the

  5. A Random Riemannian Metric for Probabilistic Shortest-Path Tractography

    DEFF Research Database (Denmark)

    Hauberg, Søren; Schober, Michael; Liptrot, Matthew George

    2015-01-01

    of the diffusion tensor as a “random Riemannian metric”, where a geodesic is a distribution over tracts. We approximate this distribution with a Gaussian process and present a probabilistic numerics algorithm for computing the geodesic distribution. We demonstrate SPT improvements on data from the Human Connectome...

  6. Analysis of the asymmetrical shortest two-server queueing model

    NARCIS (Netherlands)

    J.W. Cohen

    1995-01-01

    textabstractThis study presents the analytic solution for the asymmetrical two-server queueing model with arriving customers joining the shorter queue for the case with Poisson arrivals and negative exponentially distributed service times. The bivariate generating function of the stationary joint

  7. Distance estimation by computer vision and shortest path planning ...

    African Journals Online (AJOL)

    pc

    2018-03-22

    Mar 22, 2018 ... static or dynamic obstacle environment [1] [2] [3]. Several sensors as laser sensors, ultrasonic sensors ... decrement in processing time with higher speed. .... [1] A. Kynova, "Indoor Spatial Data Model for Wayfinding: A Case.

  8. Distance estimation by computer vision and shortest path planning ...

    African Journals Online (AJOL)

    Journal Home > Vol 10, No 6S (2018) > ... The proposed way also detects and avoids obstacles in an environment using a single ... This paper has a great importance because of its fast execution speed also vision is a smart sensor as it helps ...

  9. DFAs and PFAs with long shortest synchronizing word length

    NARCIS (Netherlands)

    De Bondt, M.; Don, H.; Zantema, H.; Charlier, E.; Leroy, J.; Rigo, M.

    2017-01-01

    It was conjectured by Černý in 1964, that a synchronizing DFA on n states always has a synchronizing word of length at most (n-1)2 and he gave a sequence of DFAs for which this bound is reached. Until now a full analysis of all DFAs reaching this bound was only given for n ≤ 4 and with bounds on the

  10. Study of $B_{\\scriptscriptstyle (s)}^0 \\to K_{\\rm \\scriptscriptstyle S}^0 h^{+} h^{\\prime -}$ decays with first observation of $B_{\\scriptscriptstyle s}^0 \\to K_{\\rm \\scriptscriptstyle S}^0 K^{\\pm} \\pi^{\\mp}$ and $B_{\\scriptscriptstyle s}^0 \\to K_{\\rm \\scriptscriptstyle S}^0 \\pi^{+} \\pi^{-}$

    CERN Document Server

    INSPIRE-00258707; Adeva, B; Adinolfi, M; Adrover, C; Affolder, A; Ajaltouni, Z; Albrecht, J; Alessio, F; Alexander, M; Ali, S; Alkhazov, G; Alvarez Cartelle, P; Alves Jr, A A; Amato, S; Amerio, S; Amhis, Y; Anderlini, L; Anderson, J; Andreassen, R; Andrews, J E; Appleby, R B; Aquines Gutierrez, O; Archilli, F; Artamonov, A; Artuso, M; Aslanides, E; Auriemma, G; Baalouch, M; Bachmann, S; Back, J J; Baesso, C; Balagura, V; Baldini, W; Barlow, R J; Barschel, C; Barsuk, S; Barter, W; Bauer, Th; Bay, A; Beddow, J; Bedeschi, F; Bediaga, I; Belogurov, S; Belous, K; Belyaev, I; Ben-Haim, E; Bencivenni, G; Benson, S; Benton, J; Berezhnoy, A; Bernet, R; Bettler, M -O; van Beuzekom, M; Bien, A; Bifani, S; Bird, T; Bizzeti, A; Bjørnstad, P M; Blake, T; Blanc, F; Blouw, J; Blusk, S; Bocci, V; Bondar, A; Bondar, N; Bonivento, W; Borghi, S; Borgia, A; Bowcock, T J V; Bowen, E; Bozzi, C; Brambach, T; van den Brand, J; Bressieux, J; Brett, D; Britsch, M; Britton, T; Brook, N H; Brown, H; Burducea, I; Bursche, A; Busetto, G; Buytaert, J; Cadeddu, S; Callot, O; Calvi, M; Calvo Gomez, M; Camboni, A; Campana, P; Campora Perez, D; Carbone, A; Carboni, G; Cardinale, R; Cardini, A; Carranza-Mejia, H; Carson, L; Carvalho Akiba, K; Casse, G; Castillo Garcia, L; Cattaneo, M; Cauet, Ch; Cenci, R; Charles, M; Charpentier, Ph; Chen, P; Chiapolini, N; Chrzaszcz, M; Ciba, K; Cid Vidal, X; Ciezarek, G; Clarke, P E L; Clemencic, M; Cliff, H V; Closier, J; Coca, C; Coco, V; Cogan, J; Cogneras, E; Collins, P; Comerma-Montells, A; Contu, A; Cook, A; Coombes, M; Coquereau, S; Corti, G; Couturier, B; Cowan, G A; Cowie, E; Craik, D C; Cunliffe, S; Currie, R; D'Ambrosio, C; David, P; David, P N Y; Davis, A; De Bonis, I; De Bruyn, K; De Capua, S; De Cian, M; De Miranda, J M; De Paula, L; De Silva, W; De Simone, P; Decamp, D; Deckenhoff, M; Del Buono, L; Déléage, N; Derkach, D; Deschamps, O; Dettori, F; Di Canto, A; Dijkstra, H; Dogaru, M; Donleavy, S; Dordei, F; Dosil Suárez, A; Dossett, D; Dovbnya, A; Dupertuis, F; Durante, P; Dzhelyadin, R; Dziurda, A; Dzyuba, A; Easo, S; Egede, U; Egorychev, V; Eidelman, S; van Eijk, D; Eisenhardt, S; Eitschberger, U; Ekelhof, R; Eklund, L; El Rifai, I; Elsasser, Ch; Falabella, A; Färber, C; Fardell, G; Farinelli, C; Farry, S; Ferguson, D; Fernandez Albor, V; Ferreira Rodrigues, F; Ferro-Luzzi, M; Filippov, S; Fiore, M; Fitzpatrick, C; Fontana, M; Fontanelli, F; Forty, R; Francisco, O; Frank, M; Frei, C; Frosini, M; Furcas, S; Furfaro, E; Gallas Torreira, A; Galli, D; Gandelman, M; Gandini, P; Gao, Y; Garofoli, J; Garosi, P; Garra Tico, J; Garrido, L; Gaspar, C; Gauld, R; Gersabeck, E; Gersabeck, M; Gershon, T; Ghez, Ph; Gibson, V; Giubega, L; Gligorov, V V; Göbel, C; Golubkov, D; Golutvin, A; Gomes, A; Gorbounov, P; Gordon, H; Gotti, C; Grabalosa Gándara, M; Graciani Diaz, R; Granado Cardoso, L A; Graugés, E; Graziani, G; Grecu, A; Greening, E; Gregson, S; Griffith, P; Grünberg, O; Gui, B; Gushchin, E; Guz, Yu; Gys, T; Hadjivasiliou, C; Haefeli, G; Haen, C; Haines, S C; Hall, S; Hamilton, B; Hampson, T; Hansmann-Menzemer, S; Harnew, N; Harnew, S T; Harrison, J; Hartmann, T; He, J; Head, T; Heijne, V; Hennessy, K; Henrard, P; Hernando Morata, J A; van Herwijnen, E; Hess, M; Hicheur, A; Hicks, E; Hill, D; Hoballah, M; Hombach, C; Hopchev, P; Hulsbergen, W; Hunt, P; Huse, T; Hussain, N; Hutchcroft, D; Hynds, D; Iakovenko, V; Idzik, M; Ilten, P; Jacobsson, R; Jaeger, A; Jans, E; Jaton, P; Jawahery, A; Jing, F; John, M; Johnson, D; Jones, C R; Joram, C; Jost, B; Kaballo, M; Kandybei, S; Kanso, W; Karacson, M; Karbach, T M; Kenyon, I R; Ketel, T; Keune, A; Khanji, B; Kochebina, O; Komarov, I; Koopman, R F; Koppenburg, P; Korolev, M; Kozlinskiy, A; Kravchuk, L; Kreplin, K; Kreps, M; Krocker, G; Krokovny, P; Kruse, F; Kucharczyk, M; Kudryavtsev, V; Kurek, K; Kvaratskheliya, T; La Thi, V N; Lacarrere, D; Lafferty, G; Lai, A; Lambert, D; Lambert, R W; Lanciotti, E; Lanfranchi, G; Langenbruch, C; Latham, T; Lazzeroni, C; Le Gac, R; van Leerdam, J; Lees, J -P; Lefèvre, R; Leflat, A; Lefrançois, J; Leo, S; Leroy, O; Lesiak, T; Leverington, B; Li, Y; Li Gioi, L; Liles, M; Lindner, R; Linn, C; Liu, B; Liu, G; Lohn, S; Longstaff, I; Lopes, J H; Lopez-March, N; Lu, H; Lucchesi, D; Luisier, J; Luo, H; Machefert, F; Machikhiliyan, I V; Maciuc, F; Maev, O; Malde, S; Manca, G; Mancinelli, G; Maratas, J; Marconi, U; Marino, P; Märki, R; Marks, J; Martellotti, G; Martens, A; Martín Sánchez, A; Martinelli, M; Martinez Santos, D; Martins Tostes, D; Martynov, A; Massafferri, A; Matev, R; Mathe, Z; Matteuzzi, C; Maurice, E; Mazurov, A; McCarthy, J; McNab, A; McNulty, R; McSkelly, B; Meadows, B; Meier, F; Meissner, M; Merk, M; Milanes, D A; Minard, M -N; Molina Rodriguez, J; Monteil, S; Moran, D; Morawski, P; Mordà, A; Morello, M J; Mountain, R; Mous, I; Muheim, F; Müller, K; Muresan, R; Muryn, B; Muster, B; Naik, P; Nakada, T; Nandakumar, R; Nasteva, I; Needham, M; Neubert, S; Neufeld, N; Nguyen, A D; Nguyen, T D; Nguyen-Mau, C; Nicol, M; Niess, V; Niet, R; Nikitin, N; Nikodem, T; Nomerotski, A; Novoselov, A; Oblakowska-Mucha, A; Obraztsov, V; Oggero, S; Ogilvy, S; Okhrimenko, O; Oldeman, R; Orlandea, M; Otalora Goicochea, J M; Owen, P; Oyanguren, A; Pal, B K; Palano, A; Palczewski, T; Palutan, M; Panman, J; Papanestis, A; Pappagallo, M; Parkes, C; Parkinson, C J; Passaleva, G; Patel, G D; Patel, M; Patrick, G N; Patrignani, C; Pavel-Nicorescu, C; Pazos Alvarez, A; Pellegrino, A; Penso, G; Pepe Altarelli, M; Perazzini, S; Perez Trigo, E; Pérez-Calero Yzquierdo, A; Perret, P; Perrin-Terrin, M; Pescatore, L; Pesen, E; Petridis, K; Petrolini, A; Phan, A; Picatoste Olloqui, E; Pietrzyk, B; Pilař, T; Pinci, D; Playfer, S; Plo Casasus, M; Polci, F; Polok, G; Poluektov, A; Polycarpo, E; Popov, A; Popov, D; Popovici, B; Potterat, C; Powell, A; Prisciandaro, J; Pritchard, A; Prouve, C; Pugatch, V; Puig Navarro, A; Punzi, G; Qian, W; Rademacker, J H; Rakotomiaramanana, B; Rangel, M S; Raniuk, I; Rauschmayr, N; Raven, G; Redford, S; Reid, M M; dos Reis, A C; Ricciardi, S; Richards, A; Rinnert, K; Rives Molina, V; Roa Romero, D A; Robbe, P; Roberts, D A; Rodrigues, E; Rodriguez Perez, P; Roiser, S; Romanovsky, V; Romero Vidal, A; Rouvinet, J; Ruf, T; Ruffini, F; Ruiz, H; Ruiz Valls, P; Sabatino, G; Saborido Silva, J J; Sagidova, N; Sail, P; Saitta, B; Salustino Guimaraes, V; Sanmartin Sedes, B; Sannino, M; Santacesaria, R; Santamarina Rios, C; Santovetti, E; Sapunov, M; Sarti, A; Satriano, C; Satta, A; Savrie, M; Savrina, D; Schaack, P; Schiller, M; Schindler, H; Schlupp, M; Schmelling, M; Schmidt, B; Schneider, O; Schopper, A; Schune, M -H; Schwemmer, R; Sciascia, B; Sciubba, A; Seco, M; Semennikov, A; Senderowska, K; Sepp, I; Serra, N; Serrano, J; Seyfert, P; Shapkin, M; Shapoval, I; Shatalov, P; Shcheglov, Y; Shears, T; Shekhtman, L; Shevchenko, O; Shevchenko, V; Shires, A; Silva Coutinho, R; Sirendi, M; Skidmore, N; Skwarnicki, T; Smith, N A; Smith, E; Smith, J; Smith, M; Sokoloff, M D; Soler, F J P; Soomro, F; Souza, D; Souza De Paula, B; Spaan, B; Sparkes, A; Spradlin, P; Stagni, F; Stahl, S; Steinkamp, O; Stevenson, S; Stoica, S; Stone, S; Storaci, B; Straticiuc, M; Straumann, U; Subbiah, V K; Sun, L; Swientek, S; Syropoulos, V; Szczekowski, M; Szczypka, P; Szumlak, T; T'Jampens, S; Teklishyn, M; Teodorescu, E; Teubert, F; Thomas, C; Thomas, E; van Tilburg, J; Tisserand, V; Tobin, M; Tolk, S; Tonelli, D; Topp-Joergensen, S; Torr, N; Tournefier, E; Tourneur, S; Tran, M T; Tresch, M; Tsaregorodtsev, A; Tsopelas, P; Tuning, N; Ubeda Garcia, M; Ukleja, A; Urner, D; Ustyuzhanin, A; Uwer, U; Vagnoni, V; Valenti, G; Vallier, A; Van Dijk, M; Vazquez Gomez, R; Vazquez Regueiro, P; Vázquez Sierra, C; Vecchi, S; Velthuis, J J; Veltri, M; Veneziano, G; Vesterinen, M; Viaud, B; Vieira, D; Vilasis-Cardona, X; Vollhardt, A; Volyanskyy, D; Voong, D; Vorobyev, A; Vorobyev, V; Voß, C; Voss, H; Waldi, R; Wallace, C; Wallace, R; Wandernoth, S; Wang, J; Ward, D R; Watson, N K; Webber, A D; Websdale, D; Whitehead, M; Wicht, J; Wiechczynski, J; Wiedner, D; Wiggers, L; Wilkinson, G; Williams, M P; Williams, M; Wilson, F F; Wimberley, J; Wishahi, J; Wislicki, W; Witek, M; Wotton, S A; Wright, S; Wu, S; Wyllie, K; Xie, Y; Xing, Z; Yang, Z; Young, R; Yuan, X; Yushchenko, O; Zangoli, M; Zavertyaev, M; Zhang, F; Zhang, L; Zhang, W C; Zhang, Y; Zhelezov, A; Zhokhov, A; Zhong, L; Zvyagin, A

    2013-01-01

    A search for charmless three-body decays of $B^0$ and $B_{\\scriptscriptstyle s}^0$ mesons with a $K_{\\rm \\scriptscriptstyle S}^0$ meson in the final state is performed using the $pp$ collision data, corresponding to an integrated luminosity of $1.0\\mathrm{\\,fb}^{-1}$, collected at a centre-of-mass energy of $7\\mathrm{\\,Te\\kern -0.1em V}$ recorded by the LHCb experiment. Branching fractions of the $B_{\\scriptscriptstyle (s)}^0 \\to K_{\\rm \\scriptscriptstyle S}^0 h^{+} h^{\\prime -}$ decay modes ($h^{(\\prime)} = \\pi, K$), relative to the well measured $B^0 \\to K_{\\rm \\scriptscriptstyle S}^0 \\pi^{+} \\pi^{-}$ decay, are obtained. First observation of the decay modes $B_s^0 \\to K_{\\rm \\scriptscriptstyle S}^0 K^{\\pm} \\pi^{\\mp}$ and $B_s^0 \\to K_{\\rm \\scriptscriptstyle S}^0 \\pi^{+} \\pi^{-}$ and confirmation of the decay $B^0 \\to K_{\\rm \\scriptscriptstyle S}^0 K^{\\pm} \\pi^{\\mp}$ are reported. The following relative branching fraction measurements or limits are obtained \\begin{eqnarray*} \

  11. Organización del mercado de generación de electricidad colombiano. Una aplicación de los índices de diversificación tecnológica y de concentración H-H y C-4, 1995-2004

    Directory of Open Access Journals (Sweden)

    Gustavo Castillo

    2005-06-01

    Full Text Available El objetivo de este artículo es analizar la evolución de la concentración del mercado de generación de electricidad colombiano, con base en los índices de diversificación tecnológica y de concentración H-H y C-4, en el período 1995-2004. Se entiende la concentración como un comportamiento empresarial que, desde la perspectiva del regulador, puede atentar contra los resultados de eficiencia esperados con la reforma de las reglas de juego para la industria. Del análisis se concluye, por un lado, que los niveles de concentración han disminuido en el período de estudio, pasando de oligopolio fuerte a moderado; sin embargo, por el otro, al agrupar las empresas por vínculos empresariales los índices se elevan. Curiosamente, las empresas generadoras que apuntalan los índices son aquellas con diversificación tecnológica alta.

  12. Organización del mercado de generación de electricidad colombiano.: Una aplicación de los índices de diversificación tecnológica y de concentración H-H y C-4, 1995-2004

    Directory of Open Access Journals (Sweden)

    David Tobón Orozco

    2005-01-01

    Full Text Available El objetivo de este artículo es analizar la evolución de la concentración del mercado de generación de electricidad colombiano, con base en los índices de diversificación tecnológica y de concentración H-H y C-4, en el período 1995-2004. Se entiende la concentración como un comportamiento empresarial que, desde la perspectiva del regulador, puede atentar contra los resultados de eficiencia esperados con la reforma de las reglas de juego para la industria. Del análisis se concluye, por un lado, que los niveles de concentración han disminuido en el periodo de estudio, pasando de oligopolio fuerte a moderado; sin embargo, por el otro, al agrupar las empresas por vínculos empresariales los índices se elevan. Curiosamente, las empresas generadoras que apuntalan los índices son aquellas con diversificación tecnológica alta.

  13. A quantum-rovibrational-state-selected study of the proton-transfer reaction H2+(X2Σ: v+ = 1-3; N+ = 0-3) + Ne → NeH+ + H using the pulsed field ionization-photoion method: observation of the rotational effect near the reaction threshold.

    Science.gov (United States)

    Xiong, Bo; Chang, Yih-Chung; Ng, Cheuk-Yiu

    2017-07-19

    Using the sequential electric field pulsing scheme for vacuum ultraviolet (VUV) laser pulsed field ionization-photoion (PFI-PI) detection, we have successfully prepared H 2 + (X 2 Σ: v + = 1-3; N + = 0-5) ions in the form of an ion beam in single quantum-rovibrational-states with high purity, high intensity, and narrow laboratory kinetic energy spread (ΔE lab ≈ 0.05 eV). This VUV-PFI-PI ion source, when coupled with the double-quadrupole double-octupole ion-molecule reaction apparatus, has made possible a systematic examination of the vibrational- as well as rotational-state effects on the proton transfer reaction of H 2 + (X 2 Σ: v + ; N + ) + Ne. Here, we present the integral cross sections [σ(v + ; N + )'s] for the H 2 + (v + = 1-3; N + = 0-3) + Ne → NeH + + H reaction observed in the center-of-mass kinetic energy (E cm ) range of 0.05-2.00 eV. The σ(v + = 1, N + = 1) exhibits a distinct E cm onset, which is found to agree with the endothermicity of 0.27 eV for the proton transfer process after taking into account of experimental uncertainties. Strong v + -vibrational enhancements are observed for σ(v + = 1-3, N + ) in the E cm range of 0.05-2.00 eV. While rotational excitations appear to have little effect on σ(v + = 3, N + ), a careful search leads to the observation of moderate N + -rotational enhancements at v + = 2: σ(v + = 2; N + = 0) quantum dynamics predictions. We hope that these new experimental results would further motivate more rigorous theoretical calculations on the dynamics of this prototypical ion-molecule reaction.

  14. Search for Dileptonic ttH(H->bb) with the ATLAS Detector

    CERN Document Server

    AUTHOR|(INSPIRE)INSPIRE-00403960

    A search for the Higgs boson produced in association with a pair of top quarks ttH is presented. The analysis uses 13.2 fb$^{-1}$ of proton-proton collision data with a centre of mass energy of 13 TeV, collected by the ATLAS experiment at the LHC in 2015 and 2016. The search is optimised for events in which the top quarks decay into electrons or muons and the Higgs boson decays into bottom quarks. The analysis proceeds by separating the events into categories determined by the number of jets present in the event, and the number of those jets which are identified as originating from bottom hadrons. Multivariate techniques are used in the most signal rich regions to provide optimal separation between the signal and background processes. Finally, a template likelihood fit is performed simultaneously across all the regions, constraining the uncertainties on the analysis and determining the most likely value for the production cross section of ttH. The search found the best fit production cross section to be $4.6^...

  15. Latest results on $\\mathrm{t\\bar{t}H~(H \\to bb)}$ production at CMS

    CERN Document Server

    Salerno, Daniel Nicholas

    2017-01-01

    Details of the search for the Higgs boson produced in association with top quarks and decaying to bottom quarks at CMS are presented. The data corresponds to the first 12.9\\,fb$^{-1}$ of 2016 proton-proton collisions at $\\sqrt{s}=13$\\,TeV delivered from the LHC and recorded by the CMS experiment. Candidate events are selected in the lepton+jets and dilepton decay channels of the \\ttbar system. Selected events are categorised into several categories with varying amounts of signal and background. In each category the signal extraction is performed using multivariate techniques combining the matrix element method and boosted decision trees. The results are presented in terms of the signal strength, i.e.~the observed \\tth cross section relative to the standard model prediction, $\\mu = \\sigma / \\sigma_\\mathrm{SM}$. A combined fit of the final discriminants across all categories results in an observed (expected) upper limit of $\\mu < 1.5 (1.7)$ at the 95\\% confidence level and a best-fit value of $\\mu = -0.19^{+...

  16. Collisions of carbon and oxygen ions with electrons, H, H2 and He: Volume 5

    International Nuclear Information System (INIS)

    Phaneuf, R.A.; Janev, R.K.; Pindzola, M.S.

    1987-02-01

    This report provides a handbook for fusion research of recommended cross-section and rate-coefficient data for collisions of carbon and oxygen ions with electrons, hydrogen atoms and molecules, and helium atoms. Published experimental and theoretical data have been collected and evaluated, and recommended data are presented in tabular, graphical, and parametrized form. Processes considered include exciation, ionization, and charge exchange at collision energies appropriate to applications in fusion-energy research

  17. Radon-222 exhalation from Danish building materials: H + H Industri A/S results

    DEFF Research Database (Denmark)

    Andersen, Claus Erik

    1999-01-01

    rate measurements for 10 samples of Danish building materials are reported. Samples include ordinary concrete, lightweight aggregate concrete,autoclaved aerated concrete, bricks, and gypsum board. The maximum mass-specific exhalation rate is about 20 m Bq h"-"1 kg "-"1. Under consideration...

  18. Nonadiabatic quantum wave packet dynamics of the H + H2 reaction ...

    Indian Academy of Sciences (India)

    Administrator

    intersections of the two JT split component states. The energetically ... between the theory and experiment,. 1 there remains ..... overhead raises by a factor of two for each WP .... Herzberg G and Longuet-Higgins H C 1963 Disscuss. Faraday.

  19. An equation state of h=h(s,p) type for water vapor

    International Nuclear Information System (INIS)

    Miyabe, Kiyoji; Fujii, Tetsu.

    1975-01-01

    Equations of specific enthalpy, temperature and the ratio of temperature to specific heat for water vapor as each respective function of specific entropy and pressure are presented in the region of entropy larger than its critical value

  20. ORION'S BAR: PHYSICAL CONDITIONS ACROSS THE DEFINITIVE H+/H0/H2 INTERFACE

    International Nuclear Information System (INIS)

    Pellegrini, E. W.; Baldwin, J. A.; Ferland, G. J.; Shaw, G.; Heathcote, S.

    2009-01-01

    Previous work has shown the Orion Bar to be an interface between ionized and molecular gas, viewed roughly edge-on, which is excited by the light from the Trapezium cluster. Much of the emission from any star-forming region will originate from such interfaces, so the Bar serves as a foundation test of any emission model. Here we combine X-ray, optical, infrared (IR), and radio data sets to derive emission spectra along the transition from H + to H 0 to H 2 regions. We then reproduce the spectra of these layers with a simulation that simultaneously accounts for the detailed microphysics of the gas, the grains, and molecules, especially H 2 and CO. The magnetic field, observed to be the dominant pressure in another region of the Orion Nebula, is treated as a free parameter, along with the density of cosmic rays. Our model successfully accounts for the optical, IR, and radio observations across the Bar by including a significant magnetic pressure and also heating by an excess density of cosmic rays, which we suggest is due to cosmic rays being trapped in the compressed magnetic field. In the Orion Bar, as we had previously found in M17, momentum carried by radiation and winds from the newly formed stars pushes back and compresses the surrounding gas. There is a rough balance between outward momentum in starlight and the total pressure in atomic and molecular gas surrounding the H + region. If the gas starts out with a weak magnetic field, the starlight from a newly formed cluster will push back the gas and compress the gas, magnetic field, and cosmic rays until magnetic pressure becomes an important factor.

  1. Electron capture and excitation processes in H+-H collisions in dense quantum plasmas

    Science.gov (United States)

    Jakimovski, D.; Markovska, N.; Janev, R. K.

    2016-10-01

    Electron capture and excitation processes in proton-hydrogen atom collisions taking place in dense quantum plasmas are studied by employing the two-centre atomic orbital close-coupling (TC-AOCC) method. The Debye-Hückel cosine (DHC) potential is used to describe the plasma screening effects on the Coulomb interaction between charged particles. The properties of a hydrogen atom with DHC potential are investigated as a function of the screening strength of the potential. It is found that the decrease in binding energy of nl levels with increasing screening strength is considerably faster than in the case of the Debye-Hückel (DH) screening potential, appropriate for description of charged particle interactions in weakly coupled classical plasmas. This results in a reduction in the number of bound states in the DHC potential with respect to that in the DH potential for the same plasma screening strength, and is reflected in the dynamics of excitation and electron capture processes for the two screened potentials. The TC-AOCC cross sections for total and state-selective electron capture and excitation cross sections with the DHC potential are calculated for a number of representative screening strengths in the 1-300 keV energy range and compared with those for the DH and pure Coulomb potential. The total capture cross sections for a selected number of screening strengths are compared with the available results from classical trajectory Monte Carlo calculations.

  2. H(2s) excitation in 10-100 keV H+ - H collisions

    International Nuclear Information System (INIS)

    Higgins, D.P.; Geddes, J.; Gilbody, H.B.

    1996-01-01

    The authors have used a crossed beam technique to determine cross sections for 2s excitation of H atoms in 10-100 keV collisions. The results extend their previous 4-26 keV measurements to intermediate energies where theoretical predictions based on close coupling methods are known to be strongly dependent on the choice of the expansion basis. The 4-100 keV cross sections exhibit an undulatory structure similar to that predicted by some of the many close coupling calculations but good quantitative agreement is shown to be very limited. Close coupling calculations which employ large basis sets at the expense of target states are shown to agree less satisfactorily with experiment than those which include only the dominant 1s capture channel

  3. Lorentz laser-assisted stripping (Lolas) for H-/H0 injection into proton drivers

    International Nuclear Information System (INIS)

    Gastaldi, Ugo

    2002-01-01

    We discuss the main components of schemes for Lorentz laser-assisted stripping (abbreviated Lolas henceforth) proposed for injection into proton driver accumulators: H- → H0 + e- Lorentz stripping, H0→H0(n) laser excitation, H0(n)→p+ + e- Lorentz stripping. We mention results obtained in practice of H- beam transport and storage and of experiments addressing physics of the H- ion, of the H0 atom and of vacuum, which prove the feasibility of each Lolas component. For high enough injection energies, it is feasible to split without losses the H0 beam sent towards the accumulator into a fraction stripped to p+s and stored inside the accumulator and a complementary fraction of H0s delivered to high duty-cycle users. The fraction of stored beam can exceed 50% with one single Fabry-Perot cavity used to enhance the laser power density. Aspects of Lolas integration and optimization are pointed out

  4. H.H. Meissner: H.P.F.du Preez and P.C. du Plessis

    African Journals Online (AJOL)

    Optimal levels of crude (CP) and undegraded (UDP) dietary protein were studied in feeding systems based on whole maize fed free-choice and on complete mixed diets composed from by-products of the milling industry. On the whole maize free-choice system, animal performance was improved when more CP and UDP ...

  5. Time-dependent CP violation in $B^0_{(s)} \\to h^+h^-$ decays

    CERN Multimedia

    Fazzini, Davide

    2018-01-01

    The direct and mixing-induced CP-violating asymmetries in $B^0 \\to \\pi^+ \\pi^-$ and $B_s \\to K^+ K^-$ decays have been measured using a sample of pp collisions collected by the LHCb experiment during the Run1 of the LHC and corresponding to an integrated luminosity of 3.0 fb$^{-1}$.The time-integrated CP asymmetries in $B^0 \\to K^+ \\pi^-$ and $B_s \\to \\pi^+ K^-$ decays have also been measured, using the same data sample.The measurements of the CP-violating asymmetries of the $B^0 \\to \\pi^+ \\pi^-$, $B_s \\to K^+\\pi^-$ and $B_s \\to \\pi^+K^-$ decays are the most precise from a single experiment. The measurements of the CP-violating asymmetries of the Bs->KK decays are compatible with the previous results from LHCb.

  6. Tailored Cyclic and Linear Polycarbosilazanes by Barium-Catalyzed N-H/H-Si Dehydrocoupling Reactions.

    Science.gov (United States)

    Bellini, Clément; Orione, Clément; Carpentier, Jean-François; Sarazin, Yann

    2016-03-07

    Ba[CH(SiMe3 )2 ]2 (THF)3 catalyzes the fast and controlled dehydrogenative polymerization of Ph2 SiH2 and p-xylylenediamine to afford polycarbosilazanes. The structure (cyclic versus linear; end-groups) and molecular weight of the macromolecules can be tuned by adjusting the Ph2 SiH2 /diamine feed ratio. A detailed analysis of the resulting materials (mol. wt up to ca. 10 000 g mol(-1) ) is provided. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  7. Collisions of H, H2 and He with metallic impurity ions

    International Nuclear Information System (INIS)

    Fritsch, W.; Gilbody, H.B.; Olson, R.E.; Cederquist, H.; Janev, R.K.; Katsonis, K.; Yudin, G.

    1990-01-01

    The reactions of relevance to a better understanding of the physics of the plasma edge in magnetic confinement devices, such as tokamaks, as well as to neutral beam diagnostics of these devices, are listed. Brief comments are made concerning total cross sections for electron capture, state-selective electron capture, ionization and excitation processes. 33 refs, 1 tab

  8. Collisions of Beq+ and Bq+ ions with H, H2 and He

    International Nuclear Information System (INIS)

    Phaneuf, R.A.; Janev, R.K.; Tawara, H.; Kimura, M.; Krstic, P.S.; Peach, G.; Mazing, M.A.

    1991-01-01

    This Working Group Report discusses the available data on cross sections for collisions of beryllium ions and boron ions with atomic and molecular hydrogen and helium for the purpose of applications for plasma diagnostics and modelling of the plasma edge for low energies, and for plasma diagnostics and energy deposition for high energies. In particular, charge exchange, excitation, ionization and two-electron processes are discussed. 43 refs, 1 tab

  9. Radon-222 exhalation from Danish building materials: H + H Industri A/S results

    International Nuclear Information System (INIS)

    Andersen, C.E.

    1999-08-01

    This report describes a closed-chamber method for laboratory measurements of the rate at which radon-222 degasses (exhales) from small building material samples. The chamber is 55 L in volume and the main sample geometry is a slab of dimensions 5x30x30 cm 3 . Numerical modelling is used to assess (and partly remove) the bias of the method relative to an ideal measurement of the free exhalation rate. Experimental results obtained with the method are found to be in agreement with the results of an open-chamber method (which is subject to different sources of error). Results of radon-222 exhalation rate measurements for 10 samples of Danish building materials are reported. Samples include ordinary concrete, lightweight aggregate concrete, autoclaved aerated concrete, bricks, and gypsum board. The maximum mass-specific exhalation rate is about 20 mBq h -1 kg -1 . Under consideration of the specific applications of the investigated building materials, the contribution to the indoor radon-222 concentration in a single-family reference house is calculated. Numerical modelling is used to help extrapolate the laboratory measurements on small samples to full scale walls. Application of typical materials will increase the indoor concentration by less than 10 Bq m -3 . (au)

  10. Blocked All-Pairs Shortest Paths Algorithm on Intel Xeon Phi KNL Processor: A Case Study

    OpenAIRE

    Rucci, Enzo; De Giusti, Armando Eduardo; Naiouf, Marcelo

    2017-01-01

    Manycores are consolidating in HPC community as a way of improving performance while keeping power efficiency. Knights Landing is the recently released second generation of Intel Xeon Phi architec- ture.While optimizing applications on CPUs, GPUs and first Xeon Phi’s has been largely studied in the last years, the new features in Knights Landing processors require the revision of programming and optimization techniques for these devices. In this work, we selected the Floyd-Warshall algorithm ...

  11. On Finding the Shortest Distance of a Point From a Line: Which ...

    Indian Academy of Sciences (India)

    One more application is in disaster management in the vicinity of high ... A proper safety dis- .... of a point in the n-dimensional Euclidean space Rn from a hyper- plane. Let the ... Let the coordinates in the new system be represented by. (x ,y ).

  12. Precise atmospheric parameters for the shortest-period binary white dwarfs: gravitational waves, metals, and pulsations

    International Nuclear Information System (INIS)

    Gianninas, A.; Kilic, Mukremin; Dufour, P.; Bergeron, P.; Brown, Warren R.; Hermes, J. J.

    2014-01-01

    We present a detailed spectroscopic analysis of 61 low-mass white dwarfs and provide precise atmospheric parameters, masses, and updated binary system parameters based on our new model atmosphere grids and the most recent evolutionary model calculations. For the first time, we measure systematic abundances of He, Ca, and Mg for metal-rich, extremely low mass white dwarfs and examine the distribution of these abundances as a function of effective temperature and mass. Based on our preliminary results, we discuss the possibility that shell flashes may be responsible for the presence of the observed He and metals. We compare stellar radii derived from our spectroscopic analysis to model-independent measurements and find good agreement except for white dwarfs with T eff ≲ 10,000 K. We also calculate the expected gravitational wave strain for each system and discuss their significance to the eLISA space-borne gravitational wave observatory. Finally, we provide an update on the instability strip of extremely low mass white dwarf pulsators.

  13. Precise atmospheric parameters for the shortest-period binary white dwarfs: gravitational waves, metals, and pulsations

    Energy Technology Data Exchange (ETDEWEB)

    Gianninas, A.; Kilic, Mukremin [Homer L. Dodge Department of Physics and Astronomy, University of Oklahoma, 440 West Brooks Street, Norman, OK 73019 (United States); Dufour, P.; Bergeron, P. [Département de Physique, Université de Montréal, C.P. 6128, Succ. Centre-Ville, Montréal, Québec H3C 3J7 (Canada); Brown, Warren R. [Smithsonian Astrophysical Observatory, 60 Garden Street, Cambridge, MA 02138 (United States); Hermes, J. J., E-mail: alexg@nhn.ou.edu [Department of Physics, University of Warwick, Coventry CV4 7AL (United Kingdom)

    2014-10-10

    We present a detailed spectroscopic analysis of 61 low-mass white dwarfs and provide precise atmospheric parameters, masses, and updated binary system parameters based on our new model atmosphere grids and the most recent evolutionary model calculations. For the first time, we measure systematic abundances of He, Ca, and Mg for metal-rich, extremely low mass white dwarfs and examine the distribution of these abundances as a function of effective temperature and mass. Based on our preliminary results, we discuss the possibility that shell flashes may be responsible for the presence of the observed He and metals. We compare stellar radii derived from our spectroscopic analysis to model-independent measurements and find good agreement except for white dwarfs with T {sub eff} ≲ 10,000 K. We also calculate the expected gravitational wave strain for each system and discuss their significance to the eLISA space-borne gravitational wave observatory. Finally, we provide an update on the instability strip of extremely low mass white dwarf pulsators.

  14. The Threshold Shortest Path Interdiction Problem for Critical Infrastructure Resilience Analysis

    Science.gov (United States)

    2017-09-01

    offered in the past by pizza delivery stores. A pizza parlor provides a delivery service to people living within a certain range from the restaurant ...disruptions that are outside of the pizza parlor’s control. Given this data, the owner of the restaurant can make decisions on offering the guarantee

  15. The Average Network Flow Problem: Shortest Path and Minimum Cost Flow Formulations, Algorithms, Heuristics, and Complexity

    Science.gov (United States)

    2012-09-13

    46, 1989. [75] S. Melkote and M.S. Daskin . An integrated model of facility location and transportation network design. Transportation Research Part A ... a work of the U.S. Government and is not subject to copyright protection in the United States. AFIT/DS/ENS/12-09 THE AVERAGE NETWORK FLOW PROBLEM...focused thinking (VFT) are used sparingly, as is the case across the entirety of the supply chain literature. We provide a VFT tutorial for supply chain

  16. The shortest-known-period star orbiting our Galaxy's supermassive black hole.

    Science.gov (United States)

    Meyer, L; Ghez, A M; Schödel, R; Yelda, S; Boehle, A; Lu, J R; Do, T; Morris, M R; Becklin, E E; Matthews, K

    2012-10-05

    Stars with short orbital periods at the center of our Galaxy offer a powerful probe of a supermassive black hole. Over the past 17 years, the W. M. Keck Observatory has been used to image the galactic center at the highest angular resolution possible today. By adding to this data set and advancing methodologies, we have detected S0-102, a star orbiting our Galaxy's supermassive black hole with a period of just 11.5 years. S0-102 doubles the number of known stars with full phase coverage and periods of less than 20 years. It thereby provides the opportunity, with future measurements, to resolve degeneracies in the parameters describing the central gravitational potential and to test Einstein's theory of general relativity in an unexplored regime.

  17. VLBI observations of the shortest orbital period black hole binary, MAXI J1659-152

    NARCIS (Netherlands)

    Paragi, Z.; van der Horst, A.J.; Belloni, T.; Miller-Jones, J.C.A.; Linford, J.; Taylor, G.; Yang, J.; Garrett, M.A.; Granot, J.; Kouveliotou, C.; Kuulkers, E.; Wijers, R.A.M.J.

    2013-01-01

    The X-ray transient MAXI J1659−152 was discovered by Swift/Burst Alert Telescope and it was initially identified as a gamma-ray burst. Soon its Galactic origin and binary nature were established. There exists a wealth of multiwavelength monitoring data for this source, providing a great coverage of

  18. Chronic wasting disease in bank voles: characterisation of the shortest incubation time model for prion diseases.

    Directory of Open Access Journals (Sweden)

    Michele Angelo Di Bari

    2013-03-01

    Full Text Available In order to assess the susceptibility of bank voles to chronic wasting disease (CWD, we inoculated voles carrying isoleucine or methionine at codon 109 (Bv109I and Bv109M, respectively with CWD isolates from elk, mule deer and white-tailed deer. Efficient transmission rate (100% was observed with mean survival times ranging from 156 to 281 days post inoculation. Subsequent passages in Bv109I allowed us to isolate from all CWD sources the same vole-adapted CWD strain (Bv(109ICWD, typified by unprecedented short incubation times of 25-28 days and survival times of ∼35 days. Neuropathological and molecular characterisation of Bv(109ICWD showed that the classical features of mammalian prion diseases were all recapitulated in less than one month after intracerebral inoculation. Bv(109ICWD was characterised by a mild and discrete distribution of spongiosis and relatively low levels of protease-resistant PrP(Sc (PrP(res in the same brain regions. Despite the low PrP(res levels and the short time lapse available for its accumulation, end-point titration revealed that brains from terminally-ill voles contained up to 10(8,4 i.c. ID50 infectious units per gram. Bv(109ICWD was efficiently replicated by protein misfolding cyclic amplification (PMCA and the infectivity faithfully generated in vitro, as demonstrated by the preservation of the peculiar Bv(109ICWD strain features on re-isolation in Bv109I. Overall, we provide evidence that the same CWD strain was isolated in Bv109I from the three-cervid species. Bv(109ICWD showed unique characteristics of "virulence", low PrP(res accumulation and high infectivity, thus providing exceptional opportunities to improve basic knowledge of the relationship between PrP(Sc, neurodegeneration and infectivity.

  19. Chronic Wasting Disease in Bank Voles: Characterisation of the Shortest Incubation Time Model for Prion Diseases

    NARCIS (Netherlands)

    Bari, Di M.A.; Nonno, R.; Castilla, J.; Augostino, D' C.; Pirisinu, L.; Riccardi, G.; Conte, M.; Richt, J.A.; Kunkle, R.; Langeveld, J.P.M.; Vaccari, G.; Agrimi, U.

    2013-01-01

    In order to assess the susceptibility of bank voles to chronic wasting disease (CWD), we inoculated voles carrying isoleucine or methionine at codon 109 (Bv109I and Bv109M, respectively) with CWD isolates from elk, mule deer and white-tailed deer. Efficient transmission rate (100%) was observed with

  20. MAXI J1659-152: The shortest orbital period black-hole transient in outburst

    DEFF Research Database (Denmark)

    Kuulkers, E.; Kouveliotou, C.; Belloni, T.

    2013-01-01

    MAXI J1659−152 is a bright X-ray transient black-hole candidate binary system discovered in September 2010. We report here on MAXI, RXTE, Swift, and XMM-Newton observations during its 2010/2011 outburst. We find that during the first one and a half week of the outburst the X-ray light curves disp...

  1. MAXI J1659-152: the shortest orbital period black-hole binary

    DEFF Research Database (Denmark)

    Kuulkers, E.; Kouveliotou, C.; van der Horst, A. J.

    Following the detection of a bright new X-ray source, MAXI J1659-152, a series of observations was triggered with almost all currently flying high-energy missions. We report here on XMM-Newton, INTEGRAL and RXTE observations during the early phase of the X-ray outburst of this transient black-hol...

  2. The shortest argument for the existence of God in Islamic philosophy

    Directory of Open Access Journals (Sweden)

    Halilović Seid

    2014-01-01

    Full Text Available The first cognitive frameworks of the undoubtedly most famous argument for the existence of God in Islamic philosophy were set by the notable Ibn Sina. Having proved the existence of God by considering existence itself, in his famous philosophical book al-Isharat he wrote that in that way he offered the 'argument of the veracious'. In the following stages of the development of this argument this syntagm will become one of the most popular scientific names in the history of philosophical and rational thought in Muslims. Numerous representatives of various schools of philosophy, dogmatic theology and doctrinal gnosis in Islam thoroughly analyzed the text of this part of the al-Isharat book and sometimes formulated new versions of the 'argument of the veracious'. In this paper we will focus on the basic cognitive milestones in the development of this argument and with a view to acquiring this we will use the method of detailed content analysis of the works of those Muslim philosophers who contributed significantly to that intellectual process. Given that scientific destiny of the 'argument of the veracious' quite attractively illustrates the various stages of the development of entire Islamic philosophy, we will try to show that in each new period Islamic philosophical heritage grew a more vital and dominant scientific discipline. On the other hand, we will conclude that throughout history Islamic philosophy and 'arguments of the veracious' have become more reminiscent of subtle intuition of Muslim gnostics and innermost spheres of the original understanding of the sacred Islamic texts and traditions.

  3. Probabilistic shortest path tractography in DTI using Gaussian Process ODE solvers

    DEFF Research Database (Denmark)

    Schober, Michael; Kasenburg, Niklas; Feragen, Aasa

    2014-01-01

    Tractography in diffusion tensor imaging estimates connectivity in the brain through observations of local diffusivity. These observations are noisy and of low resolution and, as a consequence, connections cannot be found with high precision. We use probabilistic numerics to estimate connectivity...

  4. Large and Dense Swarms: Simulation of a Shortest Path Alarm Propagation

    Directory of Open Access Journals (Sweden)

    Claudia Snels

    2015-07-01

    Full Text Available This paper deals with the transmission of alarm messages in large and dense underwater swarms of Autonomous Underwater Vehicles (AUVs and describes the verification process of the derived algorithm results by means of two simulation tools realized by the authors. A collision-free communication protocol has been developed, tailored to a case where a single AUV needs to send a message to a specific subset of swarm members regarding a perceived danger. The protocol includes a handshaking procedure that creates a silence region before the transmission of the message obtained through specific acoustic tones out of the normal transmission frequencies or through optical signals. This region will include all members of the swarm involved in the alarm message and their neighbours, preventing collisions between them. The AUV sending messages to a target area computes a delay function on appropriate arcs and runs a Dijkstra-like algorithm obtaining a multicast tree. After an explanation of the whole building of this collision-free multicast tree, a simulation has been carried out assuming different scenarios relevant to swarm density, signal power of the modem and the geometrical configuration of the nodes.

  5. Small flow rate can supply inwardly migrating shortest-period planets

    OpenAIRE

    Taylor, Stuart F.

    2013-01-01

    The number of exoplanets found with periods as short as one day and less was surprising given how fast these planets had been expected to migrate into the star due to the tides raised on the star by planets at such close distances. It has been seen as improbable that we would find planets in such a small final fraction of their lives. The favored solution has been that the tidal dissipation is much weaker than expected, which would mean that the final infall would be a larger fraction of the ...

  6. Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time

    DEFF Research Database (Denmark)

    Wulff-Nilsen, Christian

    2008-01-01

    We consider the problem of computing the Wiener index of a graph, defined as the sum of distances between all pairs of its vertices. It is an open problem whether the Wiener index of a planar graph can be found in subquadratic time. We solve this problem by presenting an algorithm with O(n^2*log...

  7. CO2 laser-inscribed low-cost, shortest-period long-period fibre ...

    Indian Academy of Sciences (India)

    2014-02-07

    up. Strain sensitivity of 1.77 dB/mε has been obtained for attenuation band corresponding to the turnaround point mode. TAP operation of LPG facilitates intensity-based detection using simple optical power meter instead.

  8. A model-independent Dalitz plot analysis of $B^\\pm \\to D K^\\pm$ with $D \\to K^0_{\\rm S} h^+h^-$ ($h=\\pi, K$) decays and constraints on the CKM angle $\\gamma$

    CERN Document Server

    Aaij, R.; Adametz, A.; Adeva, B.; Adinolfi, M.; Adrover, C.; Affolder, A.; Ajaltouni, Z.; Albrecht, J.; Alessio, F.; Alexander, M.; Ali, S.; Alkhazov, G.; Alvarez Cartelle, P.; Alves Jr, A.A.; Amato, S.; Amhis, Y.; Anderlini, L.; Anderson, J.; Appleby, R.B.; Aquines Gutierrez, O.; Archilli, F.; Artamonov, A.; Artuso, M.; Aslanides, E.; Auriemma, G.; Bachmann, S.; Back, J.J.; Baesso, C.; Baldini, W.; Barlow, R.J.; Barschel, C.; Barsuk, S.; Barter, W.; Bates, A.; Bauer, Th.; Bay, A.; Beddow, J.; Bediaga, I.; Belogurov, S.; Belous, K.; Belyaev, I.; Ben-Haim, E.; Benayoun, M.; Bencivenni, G.; Benson, S.; Benton, J.; Berezhnoy, A.; Bernet, R.; Bettler, M.O.; van Beuzekom, M.; Bien, A.; Bifani, S.; Bird, T.; Bizzeti, A.; Bjornstad, P.M.; Blake, T.; Blanc, F.; Blanks, C.; Blouw, J.; Blusk, S.; Bobrov, A.; Bocci, V.; Bondar, A.; Bondar, N.; Bonivento, W.; Borghi, S.; Borgia, A.; Bowcock, T.J.V.; Bozzi, C.; Brambach, T.; van den Brand, J.; Bressieux, J.; Brett, D.; Britsch, M.; Britton, T.; Brook, N.H.; Brown, H.; Buchler-Germann, A.; Burducea, I.; Bursche, A.; Buytaert, J.; Cadeddu, S.; Callot, O.; Calvi, M.; Calvo Gomez, M.; Camboni, A.; Campana, P.; Carbone, A.; Carboni, G.; Cardinale, R.; Cardini, A.; Carson, L.; Carvalho Akiba, K.; Casse, G.; Cattaneo, M.; Cauet, Ch.; Charles, M.; Charpentier, Ph.; Chen, P.; Chiapolini, N.; Chrzaszcz, M.; Ciba, K.; Cid Vidal, X.; Ciezarek, G.; Clarke, P.E.L.; Clemencic, M.; Cliff, H.V.; Closier, J.; Coca, C.; Coco, V.; Cogan, J.; Cogneras, E.; Collins, P.; Comerma-Montells, A.; Contu, A.; Cook, A.; Coombes, M.; Corti, G.; Couturier, B.; Cowan, G.A.; Craik, D.; Cunliffe, S.; Currie, R.; D'Ambrosio, C.; David, P.; David, P.N.Y.; De Bonis, I.; De Bruyn, K.; De Capua, S.; De Cian, M.; de Miranda, J.M.; De Paula, L.; De Simone, P.; Decamp, D.; Deckenhoff, M.; Degaudenzi, H.; Del Buono, L.; Deplano, C.; Derkach, D.; Deschamps, O.; Dettori, F.; Di Canto, A.; Dickens, J.; Dijkstra, H.; Diniz Batista, P.; Domingo Bonal, F.; Donleavy, S.; Dordei, F.; Dosil Suarez, A.; Dossett, D.; Dovbnya, A.; Dupertuis, F.; Dzhelyadin, R.; Dziurda, A.; Dzyuba, A.; Easo, S.; Egede, U.; Egorychev, V.; Eidelman, S.; van Eijk, D.; Eisenhardt, S.; Ekelhof, R.; Eklund, L.; El Rifai, I.; Elsasser, Ch.; Elsby, D.; Esperante Pereira, D.; Falabella, A.; Farber, C.; Fardell, G.; Farinelli, C.; Farry, S.; Fave, V.; Fernandez Albor, V.; Ferreira Rodrigues, F.; Ferro-Luzzi, M.; Filippov, S.; Fitzpatrick, C.; Fontana, M.; Fontanelli, F.; Forty, R.; Francisco, O.; Frank, M.; Frei, C.; Frosini, M.; Furcas, S.; Gallas Torreira, A.; Galli, D.; Gandelman, M.; Gandini, P.; Gao, Y.; Garnier, J-C.; Garofoli, J.; Garosi, P.; Garra Tico, J.; Garrido, L.; Gaspar, C.; Gauld, R.; Gersabeck, E.; Gersabeck, M.; Gershon, T.; Ghez, Ph.; Gibson, V.; Gligorov, V.V.; Gobel, C.; Golubkov, D.; Golutvin, A.; Gomes, A.; Gordon, H.; Grabalosa Gandara, M.; Graciani Diaz, R.; Granado Cardoso, L.A.; Grauges, E.; Graziani, G.; Grecu, A.; Greening, E.; Gregson, S.; Grunberg, O.; Gui, B.; Gushchin, E.; Guz, Yu.; Gys, T.; Hadjivasiliou, C.; Haefeli, G.; Haen, C.; Haines, S.C.; Hall, S.; Hampson, T.; Hansmann-Menzemer, S.; Harnew, N.; Harnew, S.T.; Harrison, J.; Harrison, P.F.; Hartmann, T.; He, J.; Heijne, V.; Hennessy, K.; Henrard, P.; Hernando Morata, J.A.; van Herwijnen, E.; Hicks, E.; Hill, D.; Hoballah, M.; Hopchev, P.; Hulsbergen, W.; Hunt, P.; Huse, T.; Hussain, N.; Hutchcroft, D.; Hynds, D.; Iakovenko, V.; Ilten, P.; Imong, J.; Jacobsson, R.; Jaeger, A.; Jahjah Hussein, M.; Jans, E.; Jansen, F.; Jaton, P.; Jean-Marie, B.; Jing, F.; John, M.; Johnson, D.; Jones, C.R.; Jost, B.; Kaballo, M.; Kandybei, S.; Karacson, M.; Karbach, T.M.; Keaveney, J.; Kenyon, I.R.; Kerzel, U.; Ketel, T.; Keune, A.; Khanji, B.; Kim, Y.M.; Kochebina, O.; Komarov, V.; Koopman, R.F.; Koppenburg, P.; Korolev, M.; Kozlinskiy, A.; Kravchuk, L.; Kreplin, K.; Kreps, M.; Krocker, G.; Krokovny, P.; Kruse, F.; Kucharczyk, M.; Kudryavtsev, V.; Kvaratskheliya, T.; La Thi, V.N.; Lacarrere, D.; Lafferty, G.; Lai, A.; Lambert, D.; Lambert, R.W.; Lanciotti, E.; Lanfranchi, G.; Langenbruch, C.; Latham, T.; Lazzeroni, C.; Le Gac, R.; van Leerdam, J.; Lees, J.P.; Lefevre, R.; Leflat, A.; Lefrancois, J.; Leroy, O.; Lesiak, T.; Li, Y.; Li Gioi, L.; Liles, M.; Lindner, R.; Linn, C.; Liu, B.; Liu, G.; von Loeben, J.; Lopes, J.H.; Lopez Asamar, E.; Lopez-March, N.; Lu, H.; Luisier, J.; Raighne, A.Mac; Machefert, F.; Machikhiliyan, I.V.; Maciuc, F.; Maev, O.; Magnin, J.; Maino, M.; Malde, S.; Manca, G.; Mancinelli, G.; Mangiafave, N.; Marconi, U.; Marki, R.; Marks, J.; Martellotti, G.; Martens, A.; Martin, L.; Martin Sanchez, A.; Martinelli, M.; Martinez Santos, D.; Massafferri, A.; Mathe, Z.; Matteuzzi, C.; Matveev, M.; Maurice, E.; Mazurov, A.; McCarthy, J.; McGregor, G.; McNulty, R.; Meissner, M.; Merk, M.; Merkel, J.; Milanes, D.A.; Minard, M.N.; Molina Rodriguez, J.; Monteil, S.; Moran, D.; Morawski, P.; Mountain, R.; Mous, I.; Muheim, F.; Muller, K.; Muresan, R.; Muryn, B.; Muster, B.; Mylroie-Smith, J.; Naik, P.; Nakada, T.; Nandakumar, R.; Nasteva, I.; Needham, M.; Neufeld, N.; Nguyen, A.D.; Nguyen-Mau, C.; Nicol, M.; Niess, V.; Nikitin, N.; Nikodem, T.; Nomerotski, A.; Novoselov, A.; Oblakowska-Mucha, A.; Obraztsov, V.; Oggero, S.; Ogilvy, S.; Okhrimenko, O.; Oldeman, R.; Orlandea, M.; Otalora Goicochea, J.M.; Owen, P.; Pal, B.K.; Palano, A.; Palutan, M.; Panman, J.; Papanestis, A.; Pappagallo, M.; Parkes, C.; Parkinson, C.J.; Passaleva, G.; Patel, G.D.; Patel, M.; Patrick, G.N.; Patrignani, C.; Pavel-Nicorescu, C.; Pazos Alvarez, A.; Pellegrino, A.; Penso, G.; Pepe Altarelli, M.; Perazzini, S.; Perego, D.L.; Perez Trigo, E.; Perez-Calero Yzquierdo, A.; Perret, P.; Perrin-Terrin, M.; Pessina, G.; Petridis, K.; Petrolini, A.; Phan, A.; Picatoste Olloqui, E.; Pie Valls, B.; Pietrzyk, B.; Pilar, T.; Pinci, D.; Playfer, S.; Plo Casasus, M.; Polci, F.; Polok, G.; Poluektov, A.; Polycarpo, E.; Popov, D.; Popovici, B.; Potterat, C.; Powell, A.; Prisciandaro, J.; Pugatch, V.; Puig Navarro, A.; Qian, W.; Rademacker, J.H.; Rakotomiaramanana, B.; Rangel, M.S.; Raniuk, I.; Rauschmayr, N.; Raven, G.; Redford, S.; Reid, M.M.; Reis, A.C.dos; Ricciardi, S.; Richards, A.; Rinnert, K.; Rives Molina, V.; Roa Romero, D.A.; Robbe, P.; Rodrigues, E.; Rodriguez Perez, P.; Rogers, G.J.; Roiser, S.; Romanovsky, V.; Romero Vidal, A.; Rouvinet, J.; Ruf, T.; Ruiz, H.; Sabatino, G.; Saborido Silva, J.J.; Sagidova, N.; Sail, P.; Saitta, B.; Salzmann, C.; Sanmartin Sedes, B.; Sannino, M.; Santacesaria, R.; Santamarina Rios, C.; Santinelli, R.; Santovetti, E.; Sapunov, M.; Sarti, A.; Satriano, C.; Satta, A.; Savrie, M.; Schaack, P.; Schiller, M.; Schindler, H.; Schleich, S.; Schlupp, M.; Schmelling, M.; Schmidt, B.; Schneider, O.; Schopper, A.; Schune, M.H.; Schwemmer, R.; Sciascia, B.; Sciubba, A.; Seco, M.; Semennikov, A.; Senderowska, K.; Sepp, I.; Serra, N.; Serrano, J.; Seyfert, P.; Shapkin, M.; Shapoval, I.; Shatalov, P.; Shcheglov, Y.; Shears, T.; Shekhtman, L.; Shevchenko, O.; Shevchenko, V.; Shires, A.; Silva Coutinho, R.; Skwarnicki, T.; Smith, N.A.; Smith, E.; Smith, M.; Sobczak, K.; Soler, F.J.P.; Soomro, F.; Souza, D.; Souza De Paula, B.; Spaan, B.; Sparkes, A.; Spradlin, P.; Stagni, F.; Stahl, S.; Steinkamp, O.; Stoica, S.; Stone, S.; Storaci, B.; Straticiuc, M.; Straumann, U.; Subbiah, V.K.; Swientek, S.; Szczekowski, M.; Szczypka, P.; Szumlak, T.; T'Jampens, S.; Teklishyn, M.; Teodorescu, E.; Teubert, F.; Thomas, C.; Thomas, E.; van Tilburg, J.; Tisserand, V.; Tobin, M.; Tolk, S.; Tonelli, D.; Topp-Joergensen, S.; Torr, N.; Tournefier, E.; Tourneur, S.; Tran, M.T.; Tsaregorodtsev, A.; Tsopelas, P.; Tuning, N.; Garcia, M.Ubeda; Ukleja, A.; Urner, D.; Uwer, U.; Vagnoni, V.; Valenti, G.; Vazquez Gomez, R.; Vazquez Regueiro, P.; Vecchi, S.; Velthuis, J.J.; Veltri, M.; Veneziano, G.; Vesterinen, M.; Viaud, B.; Videau, I.; Vieira, D.; Vilasis-Cardona, X.; Visniakov, J.; Vollhardt, A.; Volyanskyy, D.; Voong, D.; Vorobyev, A.; Vorobyev, V.; Voss, H.; Voss, C.; Waldi, R.; Wallace, R.; Wandernoth, S.; Wang, J.; Ward, D.R.; Watson, N.K.; Webber, A.D.; Websdale, D.; Whitehead, M.; Wicht, J.; Wiedner, D.; Wiggers, L.; Wilkinson, G.; Williams, M.P.; Williams, M.; Wilson, F.F.; Wishahi, J.; Witek, M.; Witzeling, W.; Wotton, S.A.; Wright, S.; Wu, S.; Wyllie, K.; Xie, Y.; Xing, F.; Xing, Z.; Yang, Z.; Young, R.; Yuan, X.; Yushchenko, O.; Zangoli, M.; Zavertyaev, M.; Zhang, F.; Zhang, L.; Zhang, W.C.; Zhang, Y.; Zhelezov, A.; Zhong, L.; Zvyagin, A.

    2013-07-16

    A binned Dalitz plot analysis of $B^\\pm \\to D K^\\pm$ decays, with $D \\to K^0_{\\rm S} \\pi^+\\pi^-$ and $D \\to K^0_{\\rm S} K^+ K^-$, is performed to measure the $CP$-violating observables $x_{\\pm}$ and $y_{\\pm}$ which are sensitive to the CKM angle $\\gamma$. The analysis exploits 1.0~$\\rm fb^{-1}$ of data collected by the LHCb experiment. The study makes no model-based assumption on the variation of the strong phase of the $D$ decay amplitude over the Dalitz plot, but uses measurements of this quantity from CLEO-c as input. The values of the parameters are found to be $x_- = (0.0 \\pm 4.3 \\pm 1.5 \\pm 0.6) \\times 10^{-2}$, $y_- = (2.7 \\pm 5.2 \\pm 0.8 \\pm 2.3) \\times 10^{-2}$, $x_+ = ( -10.3 \\pm 4.5 \\pm 1.8 \\pm 1.4 )\\times 10^{-2}$ and $y_+ = (-0.9 \\pm 3.7 \\pm 0.8 \\pm 3.0)\\times 10^{-2}$. The first, second, and third uncertainties are the statistical, the experimental systematic, and the error associated with the precision of the strong-phase parameters measured at CLEO-c, respectively. These results correspond to ...

  9. Prospects for $D^{0} \\rightarrow h^+h^- \\mu^+ \\mu^-$ $(h=K,\\pi)$ decays at LHCb

    CERN Multimedia

    Mitzel, Dominik Stefan

    2017-01-01

    This poster presents the current experimental status and prospects for the search of rare four-body charm decays with final states consisting of two oppositely charged kaons or pions and two oppositely charged muons at LHCb.

  10. Reconstruction of t anti tH (H → bb) events using deep neural networks with the CMS detector

    Energy Technology Data Exchange (ETDEWEB)

    Rieger, Marcel; Erdmann, Martin; Fischer, Benjamin; Fischer, Robert; Heidemann, Fabian; Quast, Thorben; Rath, Yannik [III. Physikalisches Institut A, RWTH Aachen University (Germany)

    2016-07-01

    The measurement of Higgs boson production in association with top-quark pairs (t anti tH) is an important goal of Run 2 of the LHC as it allows for a direct measurement of the underlying Yukawa coupling. Due to the complex final state, however, the analysis of semi-leptonic t anti tH events with the Higgs boson decaying into a pair of bottom-quarks is challenging. A promising method for tackling jet parton associations are Deep Neural Networks (DNN). While being a widely spread machine learning algorithm in modern industry, DNNs are on the way to becoming established in high energy physics. We present a study on the reconstruction of the final state using DNNs, comparing to Boosted Decision Trees (BDT) as benchmark scenario. This is accomplished by generating permutations of simulated events and comparing them with truth information to extract reconstruction efficiencies.

  11. Effects of H-H interactions on the heat of H absorption by β and delta Zr hydrides

    International Nuclear Information System (INIS)

    Ohta, Yutaka; Mabuchi, Mahito; Naito, Shizuo; Hashino, Tomoyasu

    1987-01-01

    The heat of H absorption by β and delta Zr hydrides has been measured by isoperibol calorimetry over the range of H concentration 0.1 - 1.6 H/Zr at temperatures 873-1273 K. In the β hydride the heat per H atom (differential heat) increases and then decreases as the H concentration increases. In the delta hydride only a decrease at large H concentrations is clearly observed. The increase in the β hydride is related by self-consistent calculations to a pair indirect interaction between H atoms; the decreases in the β and delta hydrides are due to a pair direct interaction which is of the form of a screened Coulomb potential. The differential heat is estimated from the pair indirect and direct interactions by the use of Monte Carlo simulations and compared with the measured differential heat. (author)

  12. hnRNPs H, H' and F behave differently with respect to posttranslational cleavage and subcellular localization

    DEFF Research Database (Denmark)

    Honoré, B; Vorum, H; Baandrup, U

    1999-01-01

    cytoplasmic localization in other cells. The different fates may reflect differences in functional roles that so far only have included nuclear functions. The presence of significant quantities of hnRNP F in the cytoplasm of many cells indicates that it also may have a functional role here. Udgivelsesdato...

  13. Compared behaviour of stainless steel and titanium tests lines for a L.H.H. grill launcher

    International Nuclear Information System (INIS)

    Rey, G.; Briand, P.; David, C.; Lamboley, G.; Moulin, D.; Tonon, G.

    1982-09-01

    The choice of the material as first wall of a grill is of major importance. It must satisfy eventually conficting demands: (i) mean secondary emission coefficient low enough to avoid multipactor effect, (ii) low gas absorption and desorption and (iii) easy manufacturing. Then two test lines, one made of pure titanium, the other made of 304 L stainless steel have been tested at RF power greater than 300 kW during 150 ms at 1,25 GHz. As reported in a previous paper, 360 kW have been transmitted in the titanium test line without or with a very slight change in phase between incident an transmitted wave ( 0 ) after application of low pressure argon glow discharges. We now report the first results obtained on a stainless steel test line after the use of the same conditioning procedure (baking and argon glow discharges) and the effects of a static magnetic field superimposed in the reduced size sections of the line (B parallel to the large dimension of the waveguide)

  14. The Shortest Period sdB Plus White Dwarf Binary CD-30 11223 (GALEX J1411-3053)

    Czech Academy of Sciences Publication Activity Database

    Vennes, Stephane; Kawka, Adela; O'Toole, S.J.; Németh, Péter; Burton, T.

    2012-01-01

    Roč. 759, č. 1 (2012), L25/1-L25/5 ISSN 2041-8205 R&D Projects: GA ČR GAP209/10/0967 Institutional support: RVO:67985815 Keywords : close binaries * white dwarf s Subject RIV: BN - Astronomy, Celestial Mechanics, Astrophysics Impact factor: 6.345, year: 2012

  15. Disinfection of drinking water by ultraviolet light. Minimum dose and shortest time of residence are central criteria when choosing plant

    Energy Technology Data Exchange (ETDEWEB)

    1977-06-23

    It is no longer mandatory that a given residue of chlorine is present in drinking water and this has led to interest in the use of ultraviolet radiation for disinfection of water in large public waterworks. After a brief discussion of the effect of ultraviolet radiation related to wavelength, the most usual type of irradiation equipment is briefly described. Practioal considerations regarding the installation, such as attenuation of the radiation due to water quality and deposits are presented. The requirements as to dose and residence time are also discussed and finally it is pointed out that hydraulic imperfections can reduce the effectiveness drastically.

  16. Weight of the Shortest Path to the First Encountered Peer in a Peer Group of Size m

    NARCIS (Netherlands)

    Van Mieghem, P.; Tang, S.

    We model the weight (e.g. delay, distance or cost) from an arbitrary node to the nearest (in weight) peer in a peer-to-peer (P2P) network. The exact probability generating function and an asymptotic analysis is presented for a random graph with i.i.d. exponential link weights. The asymptotic

  17. Generation of H-, H2(v double-prime), and H atoms by H2+ and H3+ ions incident upon barium surfaces

    International Nuclear Information System (INIS)

    Hiskes, J.R.; Karo, A.M.

    1989-01-01

    The generation of vibrationally excited molecules by electron excitation collisions and the subsequent generation of negative ions by dissociative attachment to these molecules has become a standard model for volume source operation. These processes have been supplemented recently by the demonstration of atom-surface recombination to form vibrationally excited molecules, and enhanced negative ion formation by protons incident upon barium electrodes. In this paper we consider the additional processes of molecular vibrational excitation generated by recombination of molecular ions on the electrode surfaces, and negative ion formation by vibrationally excited molecules rebounding from low work-function electrodes. 10 refs., 4 figs

  18. H+H- interaction up to higher orders of perturbation theory in the model with two Higgs doublets (self-energy and vertex diagrams)

    International Nuclear Information System (INIS)

    Dvoeglazov, V.V.; Skachkov, N.B.

    1991-01-01

    Self-energy and vertex blocks that enter into the amplitude of Higgs-Higgs-interaction are calculated up to the fourth order of perturbation theory in the framework of the model of electroweak interaction with two Higgs doublets and an arbitrary number of fermions. The renormalization is performed on the mass shell of the physical fields after a spontaneous symmetry breaking. The values of the coupling constants are, as a rule, not concretized in the paper. In the cases where it is needed to use them, their values obtained in the model with the minimal supersymmetric extension of the standard model (MSSM) are taken. 29 refs.; 1 tab

  19. Dollar Summary of Prime Contract Awards by Contractor, State or Country, and Place, FY 85. Part 2 (D & A Construction - H & H Service Corpor).

    Science.gov (United States)

    1985-01-01

    4c4 ’n 8:r--t n0 . I L .I 0 In -4i n 0-1. :8:. 0 If In W I &n U) I I U UNS U g’-u U4 cc) I 040 0e a 6 e1 a. c C46, 4 C 1 00 t" .4 .. a4 4l f6 I. M t Co...1 a a - 0 -- - a44 ’ 0 Om 3"% am" aCCa - -1 aC- a amm m a t- I N N N m mCr- I4 a 21 - 0 I N C) C) c - " C) x C) x r.)mX a C -I c 0 = I= N -4 Noo W...0 aL NA aL N’-4’C 0-a Co -4 N N o 1 4 40- n N ) (DO4a *w w I-I )Ia m - 0Q’ CI "I "ao~ (.) (N 0 Z C-4 m 2lm acca -a: U 0 0 . I.- I.-1 I- nV -0LL J I I

  20. A search for the ttH (H → bb) channel at the Large Hadron Collider with the ATLAS detector using a matrix element method

    CERN Document Server

    Basye, Austin Thomas

    A matrix element method analysis of the Standard Model Higgs boson, produced in association with two top quarks decaying to the lepton-plus-jets channel is presented. Based on 20.3 fb−1 of √s=8 TeV data, produced at the Large Hadron Collider and collected by the ATLAS detector, this analysis utilizes multiple advanced techniques to search for tt ̄H signatures with a 125 GeV Higgs boson decaying to two b-quarks. After categorizing selected events based on their jet and b-tag multiplicities, signal rich regions are analyzed using the matrix element method. Resulting variables are then propagated to two parallel multivariate analyses utilizing Neural Networks and Boosted Decision Trees respectively. As no significant excess is found, an observed (expected) limit of 3.4 (2.2) times the Standard Model cross-section is determined at 95% confidence, using the CLs method, for the Neural Network analysis. For the Boosted Decision Tree analysis, an observed (expected) limit of 5.2 (2.7) times the Standard Model cr...

  1. Solar Wind Implantation into Lunar Regolith II: Monte Carlo Simulations of Hydrogen Retention in a Surface with Defects and the Hydrogen (H, H2) Exosphere

    Science.gov (United States)

    Tucker, O. J.; Farrell, W. M.; Killen, R. M.; Hurley, D. M.

    2018-01-01

    Recently, the near-infrared observations of the OH veneer on the lunar surface by the Moon Mineralogy Mapper (M3) have been refined to constrain the OH content to 500-750 parts per million (ppm). The observations indicate diurnal variations in OH up to 200 ppm possibly linked to warmer surface temperatures at low latitude. We examine the M3 observations using a statistical mechanics approach to model the diffusion of implanted H in the lunar regolith. We present results from Monte Carlo simulations of the diffusion of implanted solar wind H atoms and the subsequently derived H and H2 exospheres.

  2. Commissioning of the Atlas pixel detector and search of the Higgs boson in the tt-H, H → bb- channel with the Atlas experiment at the LHC

    International Nuclear Information System (INIS)

    Aad, G.

    2009-09-01

    The global fit of Higgs boson quantum contributions to the electroweak experimental observables, computed within the Standard Model, favors a light Higgs boson with a mass of m H = 90 -27 +36 GeV, on the edge of the 95% Confidence Level region excluded by LEP. Finding a light Higgs boson at LHC is experimentally difficult and several channels with various signatures will be sought for. The associated production of the Higgs boson with a pair of top quarks, with the subsequent decay of the Higgs boson into b-quark pairs (dominant for m H <135 GeV), is one of the channels considered. This channel opens the possibility of measuring the top and b-quark Yukawa couplings. The potential of the ATLAS detector to observe this channel is described. Several ingredients are crucial: the reconstruction of the top-anti-top system with a high-purity, excellent b-tagging capabilities and good knowledge of the tt-bar+jets background. The pixel detector is the most important ATLAS sub-detectors for tagging b -jets. The ATLAS detector was commissioned with cosmic muon rays in autumn 2008. The pixel detector dead channels, calibration constants and slow control informations are described for this period. A detailed study about pixel noise determination and suppression is presented. Finally, the pixel detection efficiency is measured using cosmic muon rays. (author)

  3. Use of $B \\to h^+ h^{'-}$ as control channels for the measurement of BR$(B^0_s \\to \\mu^+ \\mu^-)$ at LHC$b$

    CERN Document Server

    López Asamar, Elías; Ruiz Pérez, H

    2011-01-01

    In spite of the impressive success of the Standard Model, some theoretical and experimental facts suggest that it might not be the $final$ theory, and hence that $new$ $physics$ exists. Decays of $B$ meson are an exceptional source of observables where physics beyond the SM could lead to unambiguous effects. Indeed, measurements in this sector provide some of the first possibilities of observing effects from new physics at the LHC. This is the case of the branching ratio of the yet unobserved decay $B^0_s \\to \\mu^+ \\mu^-$. This observable is precisely predicted by the Standard Model and hence it is also very sensitive to new physics. The conception of LHC$b$ as a dedicated experiment for $B$ physics studies puts it is an outstanding position for measuring this branching ratio with respect to other experiments operating at the LHC. The measurement of the branching ratio of $B^0_s \\to \\mu^+ \\mu^-$ at LHC$b$ widely uses methods for both calibrating and normalizing independently of the Monte Carlo simulations, ba...

  4. Chemical Reaction Rates from Ring Polymer Molecular Dynamics: Zero Point Energy Conservation in Mu + H2 → MuH + H.

    Science.gov (United States)

    Pérez de Tudela, Ricardo; Aoiz, F J; Suleimanov, Yury V; Manolopoulos, David E

    2012-02-16

    A fundamental issue in the field of reaction dynamics is the inclusion of the quantum mechanical (QM) effects such as zero point energy (ZPE) and tunneling in molecular dynamics simulations, and in particular in the calculation of chemical reaction rates. In this work we study the chemical reaction between a muonium atom and a hydrogen molecule. The recently developed ring polymer molecular dynamics (RPMD) technique is used, and the results are compared with those of other methods. For this reaction, the thermal rate coefficients calculated with RPMD are found to be in excellent agreement with the results of an accurate QM calculation. The very minor discrepancies are within the convergence error even at very low temperatures. This exceptionally good agreement can be attributed to the dominant role of ZPE in the reaction, which is accounted for extremely well by RPMD. Tunneling only plays a minor role in the reaction.

  5. Investigation of ZPE and temperature effects on the Eley-Rideal recombination of hydrogen atoms on graphene using a multidimensional graphene-H-H potential

    Science.gov (United States)

    Sizun, M.; Bachellerie, D.; Aguillon, F.; Sidis, V.

    2010-09-01

    We study the Eley-Rideal recombination of H atoms on graphene under the physical conditions of the interstellar medium. Effects of the ZPE motions of the chemisorbed H atom and of the graphene thermal motions are investigated. Classical molecular dynamics calculations undertaken with the multidimensional potential of Bachellerie et al. [Phys. Chem. Chem. Phys. 11 (2009) 2715] are reported. The ZPE effects are the strongest. The closer the collision energy is to the classical reaction threshold the more sizeable the effects. The quantum reaction cross section is also estimated below and above the classical threshold using a capture model.

  6. C-H and H-H Bond Activation via Ligand Dearomatization/Rearomatization of a PN3P-Rhodium(I) Complex

    KAUST Repository

    Huang, Kuo-Wei

    2015-04-13

    A neutral complex PN3P-Rh(I)Cl (2) was prepared from a reaction of the PN3P pincer ligand (1) with [Rh(COD)Cl]2 (COD = 1,5-cyclooctadiene). Upon treatment with a suitable base, H–H and Csp2–H activation reactions can be achieved through the deprotonation/reprotonation of one of the N–H arms and dearomatization/rearomatization of the central pyridine ring with the oxidation state of Rh remaining I.

  7. C-H and H-H Bond Activation via Ligand Dearomatization/Rearomatization of a PN3P-Rhodium(I) Complex

    KAUST Repository

    Huang, Kuo-Wei; Wang, Yuan; Zheng, Bin; Pan, Yupeng; Pan, Chengling; He, Lipeng

    2015-01-01

    A neutral complex PN3P-Rh(I)Cl (2) was prepared from a reaction of the PN3P pincer ligand (1) with [Rh(COD)Cl]2 (COD = 1,5-cyclooctadiene). Upon treatment with a suitable base, H–H and Csp2–H activation reactions can be achieved through

  8. Interconversion of η3-H2SiRR' σ-complexes and 16-electron silylene complexes via reversible H-H or C-H elimination.

    Science.gov (United States)

    Lipke, Mark C; Neumeyer, Felix; Tilley, T Don

    2014-04-23

    Solid samples of η(3)-silane complexes [PhBP(Ph)3]RuH(η(3)-H2SiRR') (R,R' = Et2, 1a; PhMe, 1b; Ph2, 1c, MeMes, 1d) decompose when exposed to dynamic vacuum. Gas-phase H2/D2 exchange between isolated, solid samples of 1c-d3 and 1c indicate that a reversible elimination of H2 is the first step in the irreversible decomposition. An efficient solution-phase trap for hydrogen, the 16-electron ruthenium benzyl complex [PhBP(Ph)3]Ru[η(3)-CH2(3,5-Me2C6H3)] (3) reacts quantitatively with H2 in benzene via elimination of mesitylene to form the η(5)-cyclohexadienyl complex [PhBP(Ph)3]Ru(η(5)-C6H7) (4). This H2 trapping reaction was utilized to drive forward and quantify the elimination of H2 from 1b,d in solution, which resulted in the decomposition of 1b,d to form 4 and several organosilicon products that could not be identified. Reaction of {[PhBP(Ph)3]Ru(μ-Cl)}2 (2) with (THF)2Li(SiHMes2) forms a new η(3)-H2Si species [PhBP(Ph)3]Ru[CH2(2-(η(3)-H2SiMes)-3,5-Me2C6H2)] (5) which reacts with H2 to form the η(3)-H2SiMes2 complex [PhBP(Ph)3]RuH(η(3)-H2SiMes2) (1e). Complex 1e was identified by NMR spectroscopy prior to its decomposition by elimination of Mes2SiH2 to form 4. DFT calculations indicate that an isomer of 5, the 16-electron silylene complex [PhBP(Ph)3]Ru(μ-H)(═SiMes2), is only 2 kcal/mol higher in energy than 5. Treatment of 5 with XylNC (Xyl = 2,6-dimethylphenyl) resulted in trapping of [PhBP(Ph)3]Ru(μ-H)(═SiMes2) to form the 18-electron silylene complex [PhBP(Ph)3]Ru(CNXyl)(μ-H)(═SiMes2) (6). A closely related germylene complex [PhBP(Ph)3]Ru[CN(2,6-diphenyl-4-MeC6H2)](H)(═GeH(t)Bu) (8) was prepared from reaction of (t)BuGeH3 with the benzyl complex [PhBP(Ph)3]Ru[CN(2,6-diphenyl-4-MeC6H2)][η(1)-CH2(3,5-Me2C6H3)] (7). Single crystal XRD analysis indicated that unlike for 6, the hydride ligand in 8 is a terminal hydride that does not engage in 3c-2e Ru-H → Ge bonding. Complex 1b is an effective precatalyst for the catalytic Ge-H dehydrocoupling of (t)BuGeH3 to form ((t)BuGeH2)2 (85% yield) and H2.

  9. THE VLT-FLAMES TARANTULA SURVEY: THE FASTEST ROTATING O-TYPE STAR AND SHORTEST PERIOD LMC PULSAR-REMNANTS OF A SUPERNOVA DISRUPTED BINARY?

    Energy Technology Data Exchange (ETDEWEB)

    Dufton, P. L.; Dunstall, P. R.; Fraser, M. [Astrophysics Research Centre, School of Mathematics and Physics, Queen' s University Belfast, Belfast BT7 1NN (United Kingdom); Evans, C. J. [UK Astronomy Technology Centre, Royal Observatory Edinburgh, Blackford Hill, Edinburgh EH9 3HJ (United Kingdom); Brott, I. [University of Vienna, Department of Astronomy, Tuerkenschanzstr. 17, A-1180 Vienna (Austria); Cantiello, M.; Langer, N. [Argelander Institut fuer Astronomie der Universitaet Bonn, Auf dem Huegel 71, 53121 Bonn (Germany); De Koter, A.; Sana, H. [Astronomical Institute ' Anton Pannekoek' , University of Amsterdam, Postbus 94249, 1090 GE Amsterdam (Netherlands); De Mink, S. E. [Space Telescope Science Institute, 3700 San Martin Drive, Baltimore, MD 21218 (United States); Henault-Brunet, V.; Taylor, W. D. [Scottish Universities Physics Alliance, Institute for Astronomy, University of Edinburgh, Royal Observatory Edinburgh, Blackford Hill, Edinburgh EH9 3HJ (United Kingdom); Howarth, I. D. [Department of Physics and Astronomy, University College London, Gower Street, London WC1E 6BT (United Kingdom); Lennon, D. J. [ESA, Space Telescope Science Institute, 3700 San Martin Drive, Baltimore, MD 21218 (United States); Markova, N., E-mail: p.dufton@qub.ac.uk [Institute of Astronomy with NAO, Bulgarian Academy of Sciences, P.O. Box 136, 4700 Smoljan (Bulgaria)

    2011-12-10

    We present a spectroscopic analysis of an extremely rapidly rotating late O-type star, VFTS102, observed during a spectroscopic survey of 30 Doradus. VFTS102 has a projected rotational velocity larger than 500 km s{sup -1} and probably as large as 600 km s{sup -1}; as such it would appear to be the most rapidly rotating massive star currently identified. Its radial velocity differs by 40 km s{sup -1} from the mean for 30 Doradus, suggesting that it is a runaway. VFTS102 lies 12 pc from the X-ray pulsar PSR J0537-6910 in the tail of its X-ray diffuse emission. We suggest that these objects originated from a binary system with the rotational and radial velocities of VFTS102 resulting from mass transfer from the progenitor of PSR J0537-691 and the supernova explosion, respectively.

  10. A tentação do bem: o caminho mais curto para o pior... The temptation of good: the shortest way to evil

    Directory of Open Access Journals (Sweden)

    Caterina Koltai

    2002-06-01

    Full Text Available Este trabalho pretende discutir os recentes acontecimentos políticos que abalaram o mundo e pensar a questão fundamentalista e o retorno ao religioso como sendo uma regressão que se manifesta quando os cidadãos se deparam com a falha do discurso da modernidade.This paper aims to discuss the recent political events that shook the world and think the problem of integrism and the return to religiosity as a regression that takes place when the citizens face the failure of the discourse of modernity.

  11. A GIS-based decision support system for determining the shortest and safest route to forest fires: a case study in Mediterranean Region of Turkey.

    Science.gov (United States)

    Akay, Abdullah E; Wing, Michael G; Sivrikaya, Fatih; Sakar, Dursun

    2012-03-01

    The ability of firefighting vehicles and staff to reach a fire area as quickly as possible is critical in fighting against forest fires. In this study, a Geographical Information System-based decision support system was developed to assist fire managers in determining the fastest and the safest or more reliable access routes from firefighting headquarters to fire areas. The decision support system was tested in the Kahramanmaras Forestry Regional Directoratein the Mediterranean region of Turkey. The study area consisted of forested lands which had been classified according to fire sensitivity. The fire response routing simulations considered firefighting teams located in 20 firefighting headquarter locations. The road network, the locations of the firefighting headquarters, and possible fire locations were mapped for simulation analysis. In alternative application simulations, inaccessible roads which might be closed due to fire or other reasons were indicated in the network analysis so that the optimum route was not only the fastest but also the safest and most reliable path. The selection of which firefighting headquarters to use was evaluated by considering critical response time to potential fire areas based on fire sensitivity levels. Results indicated that new firefighting headquarters should be established in the region in order to provide sufficient firefighting response to all forested lands. In addition, building new fire access roads and increasing the design speed on current roads could also increase firefighting response capabilities within the study area.

  12. Theoretical investigation of molecular hydrogen reactions with active centres in B6H5- and AlB6H5- clusters

    International Nuclear Information System (INIS)

    Mebel', A.M.; Charkin, O.P.

    1991-01-01

    Nonempirical calculations of sections of potential surface (PS) along the shortest way of reaction of hydrogen interaction with different active centres in AlB 5 H 5 - cluster were conducted. Mechanisms of reactions of valent-saturated hydrides (BH, AlH) and clusters (B 6 H 5 - , AlB 5 H 5 - ) with molecular hydrogen are correlated. Qualitative model enabling to form an opinion about the presence or the absence of barrier on PS of the shortest way of reactions of breaking σ-bond of H-H type on the active centre of cluster, is suggested. The model is based on analysis of the character of canonical MO reagents and products

  13. Studies towards the understanding of the effects of ionizing radiations at the molecular scale (20-150 keV H+/H + He Collisions; dissociative electron attachment to water)

    International Nuclear Information System (INIS)

    Coupier, B.

    2005-11-01

    This work comes within the scope of recent studies towards a better understanding of the effect of ionizing radiation at the molecular scale on biological systems. It is composed of two parts. The first one presents a new set of coincidence measurements of cross sections for the impact of protons or hydrogen atoms on helium in the energy range 20-150 keV of interest for the radiation biology. It is an archetypical system of interest for the theoreticians and there exists only a few studies on the impact of hydrogen atoms on helium. This study with helium was also motivated for the sake of performing a general test of functioning of the apparatus before investigating more complicated systems. Similar studies were then performed by replacing helium with water and biological molecules of relevance (Uracil, Thymine...) as target. This constitutes a study of direct effects of fast ionizing radiations on molecules of biological interest. The second part of the thesis deals with another type of ionizing radiations which can be seen as indirect effects of the first fast ionizing radiations studied in the first part. Low energy electrons emission in the energy range 1 to 16 eV follows the bombardment of the matter by swift protons/hydrogen atoms; these electrons have in turn an ionizing influence on the environment. A review of the dissociative electron attachment to water was undertaken motivated by the existing discrepancies between old studies on the same subject. A special attention was given to the problem of high energy kinetic ion discrimination in the trochoidal monochromator used for this work. (author)

  14. What is the effect of variations optimization of the transition state on α-deuterium secondary kinetic isotope effects? A prototype: CD3H + H right-reversible CD3 + H2

    International Nuclear Information System (INIS)

    Lu, Dahong; Maurice, D.; Truhlar, D.G.

    1990-01-01

    Variational Transition state theory calculations with semiclassical transmission coefficients have been carried out for a prototype case of α-deuterium secondary kinetic isotope effects (KIEs) in a reaction involving the transformation of an sp 3 carbon to sp 2 , in particular for the reactions of CH 4 and CD 3 H with H and D. The authors also study the KIE for the reverse direction and for the reactions of CH 4 and CD 3 H with D. They find that the variational transition states lead to significantly different nontunneling KIEs than the conventional ones, e.g., 1.22 vs. 1.07, and the inclusion of multidimensional tunneling effects increases the discrepancy even more. The origins of these variations and tunneling effects are examined in detail in terms of structures, vibrational frequencies, and the curvature of the reaction path. The conclusions have wide implications for the validity of conventional treatments of kinetic isotope effects. They predict some particularly large secondary KIEs at low temperature, and these predictions can be tested by future experiments

  15. Search for the tH(H$\\to \\text{b}\\bar{\\text{b}}$) process in pp collisions at $\\sqrt{s}=13\\,\\mathrm{TeV}$ and study of Higgs boson couplings

    CERN Document Server

    CMS Collaboration

    2018-01-01

    A search for the production of a Higgs boson in association with a single top quark (tH) is presented. The analysis focuses on Higgs boson decays to bottom quark-antiquark pairs and leptonic top quark decays. The full data set of pp collisions recorded by the CMS detector in 2016 at a center-of-mass energy of $13\\,\\mathrm{TeV}$, corresponding to an integrated luminosity of $35.9\\,\\mathrm{fb}^{-1}$, is analyzed. A multivariate classifier is used to discriminate signal candidates from the overwhelming background processes. Several scenarios for varied strength of the coupling of the Higgs boson to top quarks and to vector bosons are examined and limits on the combined cross section for Higgs boson production, either in association with a pair of top quarks or a single top quark, are derived. In addition, limits on the signal strength of Higgs boson production in association with a single top quark are set for two specific cases. The observed (expected) limit for tH production in the standard model is 89.5 ($41....

  16. Electrical tests of silicon detector modules for the ATLAS experiment and a study of the discovery potential of the $t\\overline{t}H, H \\to W^{+}W^{-}$ process

    CERN Document Server

    Ludwig, Inga

    2011-01-01

    The first part of this thesis was a contribution to the construction of the ATLAS Semiconductor Tracking detector (SCT). About 200 SCT endcap modules were assembled at the University of Freiburg. Before installation in the experiment, each module was subject to thorough testing in order to ensure their functionality within the ATLAS specifications. A large part of these tests concerned the electrical functionality of the readout electronics and the bias current behaviour of the sensors. The responsibility for the electrical characterization of the Freiburg modules was part of this thesis. To be suited for the analysis of physics processes, the signals measured in the detector need to be transferred into particle four-momenta, requiring the reconstruction and identification of different particle types. This thesis contributes to the physics object identification by a study of methods to separate isolated electrons from real electron background produced in the decays of heavy quarks. A standard set of four disc...

  17. N.M.R. study of organo-phosphorus compounds: non equivalence of methylenic protons in the {alpha} position of an asymmetric phosphorus atom. Application to study of coupling constants J{sub P,H} and J{sub H,H}; R.M.N. de composes organo-phosphores: non equivalence de protons methyleniques en {alpha} d'un phosphore asymetrique. Application a l'etude des constantes de couplage J{sub P,H} et J{sub H,H}

    Energy Technology Data Exchange (ETDEWEB)

    Albrand, J P [Commissariat a l' Energie Atomique, Grenoble (France). Centre d' Etudes Nucleaires

    1969-07-01

    Non-equivalent methylenic protons, with respect to an asymmetric center, have been observed in the n.m.r. spectra of some three- and tetra-coordinated phosphorus compounds. The analysis of these spectra yield the following results: in the studied secondary phosphines, the inversion rate at the phosphorus atom is slow on the n.m.r. time scale; the geminal coupling constant, for a free-rotating methylene group attached to a phosphorus atom, is negative; in phosphines the non equivalence of methylenic protons reveals two {sup 2}J{sub P-C-H} coupling constants which differ by about 5 Hz. This result is in agreement with previous studies on cyclic phosphines. In phosphine oxides, the {sup 2}J{sub P-C-H} values are negative. The {sup 3}J{sub H-P-C-H} coupling constant is positive in both phosphines and phosphine oxides. In phosphines, the non-equivalent methylenic protons exhibit two nearly equal values for this coupling constant. (author) [French] La non-equivalence de protons methyleniques observee dans quelques composes phosphores tricoordines et tetracoordines a apporte les resultats suivants, concernant la stereochimie et les constantes de couplage dans ces composes: dans les phosphines secondaires, la structure pyramidale des liaisons issues du phosphore est fixe a l'echelle de temps de mesure de la R.M.N.; la constante de couplage {sup 2}J{sub H-C-H}, pour un methylene en libre rotation en {alpha} d'un atome de phosphore, est negative; dans les phosphines etudiees, la non-equivalence. observee pour les protons methyleniques s'accompagne d'une difference importante (5 Hz) entre les deux constantes de couplage {sup 2}J{sub P-C-H} determinees par l'analyse; ce resultat est en accord avec la stereospecificite deja observee pour ce couplage dans les phosphines cycliques. Les valeurs observees pour {sup 2}J{sub P-C-H} dans les oxydes de phosphines sont negatives. Les valeurs de la constante de couplage {sup 3}J{sub H-P-C-H}, dans les phosphines et oxydes de phosphine etudies sont, toutes positives. Dans les phosphines, la non-equivalence des protons methyleniques n'entraine qu'une faible difference (0.5 Hz) entre les deux valeurs observees pour ce couplage. (auteur)

  18. Development of a Smart Diagnostics Platform for Early-Stage Screening of Breast Cancer

    Science.gov (United States)

    2007-04-01

    H H H H O H O HO OH OH H H H H OH F3 COCO O CO CF3 O H H H H O CF3 O F3 C O HO O CO CF 3 O H H H H O HF3 C O LiAlH4 /THF (CF3 CO )2 O NaHCO 3 THF/MeOH...Novel Fabrication of Janus Particles from the Surfaces of Electrospun Polymer Fibers . Langmuir 2008, 24, 5663–5666. 50. Chen, H. Y.; Rouillard, J. M

  19. Analysis of a Mathematical Model to Investigate the Dynamics of ...

    African Journals Online (AJOL)

    ADOWIE PERE

    4. 3. 6. **. DH. DV. H. H. H. H. H. H. H. DV. V. H. H. H. H. H. H. V. H. H. DH. DV. H. V. V. H. V. VH. DV gg ggg gggg gg ggg gggg gg g λλ γτ. µγ. µ. µ. λµ γτ. µγ. µ. µ. µ. µ λλ. µ γ. ηµ β λ. Λ. +. Λ+. Λ+. Λ+. Λ. +. Λ+. Λ+. Λ. +. +. Λ. = (33) substituting. **. DH λ to. **. DV λ we have. 0. 3. **. 2. 2**. 1. = +. +. A. A. A. Dv. Dv λ λ. (34) where.

  20. Retraction RETRACTION of "Methylation of the RASSFIA promoter in breast cancer" by Y. Ji, H.H. Jin, M.D. Wang, W.X. Cao, J.L. Bao - Genet. Mol. Res. 15 (2): gmr.15028261 (2016) - DOI: 10.4238/gmr.15028261.

    Science.gov (United States)

    Ji, Y; Jin, H H; Wang, M D; Cao, W X; Bao, J L

    2016-10-07

    The retracted article is: Ji Y, Jin HH, Wang MD, Cao WX, et al. (2016). Methylation of the RASSFIA promoter in breast cancer. Genet. Mol. Res. 15: gmr.15028261. There are significant parts of this article (particularly, in the discussion section) that are copied from "Methylation of HIN-1, RASSF1A, RIL and CDH13 in breast cancer is associated with clinical characteristics, but only RASSF1A methylation is associated with outcome", by Jia Xu, Priya B Shetty, Weiwei Feng, Carol Chenault, Robert C Bast Jr, Jean-Pierre J Issa, Susan G Hilsenbeck and Yinhua Yu, published in BMC Cancer 2012; 12: 243. DOI: 10.1186/1471-2407-12-243. The first paragraphs of both discussions are identical. This is concerning. The abstract and introduction sections have much of their text plagiarized. Overall, there is high plagiarism detected. The GMR editorial staff was alerted and after a thorough investigation, we have strong reason to believe that the peer review process was failure and, after review and contacting the authors, the editors of Genetics and Molecular Research decided to retract the article in accordance with the recommendations of the Committee on Publication Ethics (COPE). The authors and their institutions were advised of this serious breach of ethics.

  1. Análisis del "Curso sobre la Evolución del Pensamiento Juslaboralista" del Profesor Emérito Héctor-Hugo Barbagelata (El espejo retrovisor del Derecho del Trabajo y los Principios del Dr. H. H. Barbagelata

    Directory of Open Access Journals (Sweden)

    Helios Sarthou

    2014-01-01

    Full Text Available Los que sabíamos que el profesor Emérito de “Derecho del Trabajo y de la Seguridad Social" Dr. Hector Hugo Barbagelata, tenía en preparación un libro sobre Evolución del pensamiento Juslaboralista –de algún modo en la senda del Curso que había fundado en nuestra Facultad de Derecho- lo considerábamos de altísima importancia, no sólo en el plano técnico-jurídico, sino también por las implicancias históricas, sociales y políticas que la temática implicaba.- Y esto es así en esta época, en que el pensamiento neoliberal no obstante el camino ya recorrido, continúa buscando incidir en el Derecho del Trabajo, recurriendo a excusas para el retorno al Derecho Civil, o para alcanzar la flexibilidad con mengua del respeto a los principios de tuitividad y justicia social que debe garantizar el Derecho del Trabajo o, en otros casos directamente promoviendo la irrelevancia técnica de la disciplina en beneficio del Derecho Civil o del Derecho Procesal, en su caso.-

  2. Sistem Pengantaran Makanan dengan Pendayagunaan Vehicle Menggunakan Geographical Information System (GIS) dan Algoritma A Star (A*)

    OpenAIRE

    Lubis, Elita Sari

    2016-01-01

    Food delivery system is one various of geographical information systems (GIS) that can be applied through digitation process. The main case in food delivery service is the way to acquire shortest path and movement tracking of food delivery vehicle. Therefore, to accomplish the efficient food delivery system digitation process, it is needed to add facility of shortest path determination and food delivery vehicle tracking. This research uses A* shortest path algorithm to determine shortest path...

  3. Very low-excitation Herbig-Haro objects

    International Nuclear Information System (INIS)

    Boehm, K.H.; Brugel, E.W.; Mannery, E.

    1980-01-01

    Spectrophotometric observations show that H-H 7 and H-H 11 belong to a class of very low-excitation Herbig-Haro objects of which H-H 47 has been the only known example. Typical properties include line flux ratios [N I] (lambda5198+lambda5200)/Hβ and [S II] lambda/6717/Hα, which are both considerably larger than 1, very strong [O I] and [C I] lines, as well as relatively faint [O II] lines. So far no shock-wave models are available for these low-excitation objects. H-H 7 and H-H 11 have electron densities which are lower by about one order of magnitude, and electron temperatures which are slightly lower than those for high-excitation objects like H-H 1 and H-H 2. H-H 11 has a filling factor of about 1, much higher than other H-H objects

  4. Emission line spectra of Herbig-Haro objects

    International Nuclear Information System (INIS)

    Brugel, E.W.; Boehm, K.H.; Mannery, E.

    1981-01-01

    Spectrophotometric data have been obtained for 12 Herbig-Haro nebulae with the multichannel spectrometer on the Mt. Palomar 5.08 m telescope and with the image intensified dissector scanner on the Kitt Peak 2.13 m telescope. Optical emission line fluxes are presented for the following Herbig-Haro objects: H-H 1 (NW), H-H 1 (SE), H-H 2A, H-H 2G, H-H 2H, H-H 3, H-H 7, H-H 11, H-H 24A, H-H 30, H-H 32, and H-H 40. Values for the electron temperature and electron density have been determined for 10 of these condensations. Significant inhomogeneities in the line-forming regions of these H-H objects are indicated by the derived N/sub e/-T/sub e/ diagrams. Empirical two-component density models have been constructed to interpret the emission line spectra of the five brightest condensations. Slightly less satisfactory homogeneous models are presented for the remaining five objects

  5. Selected Manpower Statistics, FY-58

    Science.gov (United States)

    1959-01-31

    oro«nfn ■k i% « % A n «fc ^^^«s O m rtt r r-t vp O O CM H H o H H H H H H W HHHHHH «Or-lcot-t^t^ o«»^^«»!«^© irs...OOHriHH Ov O»«) rH rH HHHHHH CM HHHHHH 0\\ t~ ON ON IT ON H 0> ITi imss nail Is ►->•<« o a ö •-» ^ s par.60 t o s i |2

  6. Aircraft Armor an Empirical Approach to the Efficient Design of Armor for Aircraft

    Science.gov (United States)

    1944-01-31

    M2 Firings: Velocity Results Gal. .50 A 450 llj - 2179 CP-FPIP 1+5 ° 15 lost CP-PTP Exit hole 1/2» x 7/l6 n U50 16 2229 CP-PEP Exit hole 13...r CM mto y (0 *-: O 1--0 BO MOO BO CT»rH KO B0 o p C) o u Td H H H rH H H H H EH 1-1 cw <H Kl •H CM O in 3 s h- a H-i rH ^ U ,0 J- in J

  7. Zigzag graphene nanoribbon edge reconstruction with Stone-Wales defects

    DEFF Research Database (Denmark)

    Rodrigues, J. N. B.; Gonçalves, P. A. D; Rodrigues, N. F. G.

    2011-01-01

    In this paper, we study zigzag graphene nanoribbons with edges reconstructed with Stone-Wales defects, by means of an empirical (first-neighbor) tight-binding method, with parameters determined by ab initio calculations of very narrow ribbons. We explore the characteristics of the electronic band...

  8. Alpha current flow betweenness centrality

    NARCIS (Netherlands)

    Avrachenkov, K.; Litvak, Nelli; Medyanikov, V.; Sokol, M.

    2013-01-01

    A class of centrality measures called betweenness centralities reflects degree of participation of edges or nodes in communication between different parts of the network. The original shortest-path betweenness centrality is based on counting shortest paths which go through a node or an edge. One of

  9. Solving the replacement paths problem for planar directed graphs in O(n logn) time

    DEFF Research Database (Denmark)

    Wulff-Nilsen, Christian

    2010-01-01

    In a graph G with non-negative edge lengths, let P be a shortest path from a vertex s to a vertex t. We consider the problem of computing, for each edge e on P, the length of a shortest path in G from s to t that avoids e. This is known as the replacement paths problem. We give a linearspace...

  10. Within the genome, long telomeres are more informative than short telomeres with respect to fitness components in a long-lived seabird

    NARCIS (Netherlands)

    Bauch, Christina; Becker, Peter H.; Verhulst, Simon

    Telomeres, DNA-protein structures at chromosome ends, shorten with age, and telomere length has been linked to age-related diseases and survival. In vitro studies revealed that the shortest telomeres trigger cell senescence, but whether the shortest telomeres are also the best biomarker of ageing is

  11. Hydrogenation and crystal structures of the Nd(Ni1-xCux)(In1-yAly) intermetallics and their hydrides

    International Nuclear Information System (INIS)

    Riabov, A.B.; Denys, R.V.; Sato, Masashi; Delaplane, R.G.; Yartys, V.A.

    2005-01-01

    The crystal structure of NdNiInD 1.2 contains D-D pairs with the shortest known D...D separation of 1.56-bar A. This work was aimed on studies of the factors influencing the formation and the length of such a pair. We have studied the NdNiIn-based alloys, in which Ni or In are partially substituted by the chemically related elements, Cu or Al, respectively. Three equiatomic intermetallics, NdNiIn, NdCuIn and NdNiAl, are isostructural and crystallise with the ZrNiAl type of structure. In the NdNi 1-x Cu x In (x=0; 0.02; 0.05; 0.25; 0.50; 0.75 and 1.00) quaternary system a complete solid solubility range has been found. In contrast, in the Al-containing NdNiIn 1-x Al x alloys the range of a solid solution is limited to the region NdNiIn-NdNiIn 0.75 Al 0.25 . The substitutions result in regular changes in V, a, c and c/a of the hexagonal unit cells. Small substitutions by Cu and Al (x,y-bar 0.05) do not lead to significant changes in H content and types of the crystal structures formed (PND data). However, a decrease in the stability of the hydrides is observed. In NdNi 1-x Cu x In, Cu has a strong preference for the occupation of the 1b CuIn 6 trigonal prisms. An increase of the Cu content is accompanied by a decrease of the D/Nd(Ni 1-x Cu x )In ratio and a distinct growth of the distance between Ni(Cu) and D (from 1.51 to 1.84-bar A). H...H pairing is very sensitive to the content of both Al and Cu. When the level of substitution exceeds Cu/Ni(Al/In)>1/9, H pairing becomes unstable and H atoms favour other types of ordering in the metal sublattice

  12. Identification and characterization of the genes encoding the core histones and histone variants of Neurospora crassa.

    OpenAIRE

    Hays, Shan M; Swanson, Johanna; Selker, Eric U

    2002-01-01

    We have identified and characterized the complete complement of genes encoding the core histones of Neurospora crassa. In addition to the previously identified pair of genes that encode histones H3 and H4 (hH3 and hH4-1), we identified a second histone H4 gene (hH4-2), a divergently transcribed pair of genes that encode H2A and H2B (hH2A and hH2B), a homolog of the F/Z family of H2A variants (hH2Az), a homolog of the H3 variant CSE4 from Saccharomyces cerevisiae (hH3v), and a highly diverged ...

  13. The cost of the muse: poets die young.

    Science.gov (United States)

    Kaufman, James C

    2003-11-01

    Although several investigations have found that poets tend to die younger than other types of writers, these studies often do not take into account variables of gender and culture. This study examines 1,987 deceased writers from four different cultures: American, Chinese, Turkish, and Eastern European. Both male and female poets had the shortest life spans of all four types of writers (fiction writers, poets, playwrights, and non-fiction writers), and poets had the shortest life spans in three of the four cultures (and the second shortest life span among Eastern European writers). Possible reasons for the poet's shorter life span are then discussed.

  14. A performance evaluation of ACO and SA TSP in a supply chain network

    Science.gov (United States)

    Rao, T. Srinivas

    2017-07-01

    Supply Chain management and E commerce business solutions are one of the prominent areas of active research. In our paper we have modelled a supply chain model which aggregates all the manufacturers requirement and the products are supplied to all the manufacturer through a common vehicle routing algorithm. An appropriate tsp has been constructed for all the manufacturers which determines the shortest route thru which the aggregated material can be supplied in the shortest possible time. In this paper we have solved the shortest route through constructing a Simulated annealing algorithm and Ant colony algorithm and their performance is evaluated.

  15. Investigation of the Dynamics Of NH{sup +}{sub 4} and H{sub 2}O Molecular Groups in Crystals; Etude de la Dynamique des Groupes Moleculaires NH{sup +}{sub 4} et H{sub 2}O dans les Cristaux; 0418 0421 0421 041b 0415 0414 041e 0412 0410 041d 0418 0415 0414 0418 041d 0410 041c 0418 041a 0418 041c 041e 041b 0415 041a 0423 041b 042f 0420 041d 042b 0425 0413 0420 0423 041f 041f NH{sup +}{sub 4} H H{sub 2}O 0412 041a 0420 0418 0421 0422 0410 041b 041b 0410 0425 ; Estudio de la Dinamica de los Grupos Moleculares NH{sup +}{sub 4} Y H{sub 2}O en Cristales

    Energy Technology Data Exchange (ETDEWEB)

    Bajorek, A.; Machehina, T. A.; Parlin' Ski, K. [Ob' edinennyj Institut Jadernyh Issledovanij, Dubna, SSSR (Russian Federation)

    1965-06-15

    The authors give the results of thermal neutron scattering measurements in crystals containing ammonium ion (NH{sub 4}CI, NH{sub 4}Br, NH{sub 4}I, NH{sub 4}F, NH{sub 4}NO{sub 3}, NH{sub 4}CNS, (NH{sub 4}){sub 2}SO{sub 4}, (NH{sub 4}){sub 2}S{sub 2}O{sub 8}, (NH{sub 4}){sub 2}Cr{sub 2}O{sub 7}, (NH{sub 4}){sub 2}CO{sub 3}) and water of crystallization (BaCl{sub 2} * 2H{sub 2}O, SrCl{sub 2} * 6H{sub 2}O, CuSO{sub 4} * 5H{sub 2}O) . The investigations were made to study the influence of various crystal lattices on the dynamics of these groups and the connection between scattering processes and phase transitions. In spite of the structural differences of the substances examined, the spectra obtained at the temperature of liquid nitrogen proved to be similar. As a rule, there are two peaks, one in the 15-20 meV energy transfer range, and the other in the 35-70 meV range, associated with the torsional vibrations of.ammonium ions. The intensity of the peaks depends on the structure of the substances under examination and falls as the sample temperature rises. It was found that there is a jump in the elastic region of the spectrum at certain phase transitions (in the cases of NH{sub 4}I, NH{sub 4}NO{sub 3} and (NH{sub 4}){sub 2}SO{sub 4}). At increased temperatures an additional peak appears in NH{sub 4}Cl, NH{sub 4}Br and (NH{sub 4}){sub 2}(COO){sub 2} to the lower energy side of the rotational retardation peak. The spectra of neutrons scattered in crystals containing water of crystallization also resemble one another. Three groups of peaks are observed in the spectra, associated with optical vibrations and rotational retardation of the water molecules. (author) [French] Us auteurs indiquent les resultats qu'ils ont obtenus en mesurant la diffusion des neutrons thermiques par des cristaux contenant un ion ammonium (NH{sub 4}CI, NH{sub 4}Br, NH{sub 4}I, NH{sub 4}F, NH{sub 4}NO{sub 3}, NH{sub 4}CNS, (NH{sub 4}){sub 2}SO{sub 4}, (NH{sub 4}){sub 2}S{sub 2}O{sub 8}, (NH{sub 4}){sub 2}Cr{sub 2}O{sub 7}, (NH{sub 4}){sub 2}CO{sub 3}) et de l'eau liee (BaCl{sub 2} * 2H{sub 2}O, SrCl{sub 2} * 6H{sub 2}O, CuSO{sub 4} * 5H{sub 2}O). Les travaux avaient pour objet d'etudier l'influence exercee par differents reseaux cristallins sur la dynamique des groupes mentionnes, et les liens existant entre les phenomenes de diffusion et les transitions de phase. Malgre les differences de structure des substances etudiees, on obtient a la temperature de l'azote liquide des spectres analogues; en regle generale, ils accusent deux pics: le premier est situe dans la region des transferts d'energie de 15 a 20 meV; le second dans celle de 35 a 70 meV, qui est associee aux oscillations de torsion des ions ammonium. L'intensite des pics depend de la structure des substances et diminue avec l'augmentation de la temperature de l'echantillon. On a constaute que, lors de certaines transitions de phase, l'intensite de la partie elastique du spectre se modifie brusquement (dans les cas de NH{sub 4}I, NH{sub 4}NO{sub 3} et (NH{sub 4}){sub 2}SO{sub 4}). Lorsque la temperature de NH{sub 4}Cl, NH{sub 4}Br et (NH{sub 4}){sub 2}(COO){sub 2} augmente, il apparait un pic supplementaire, deplace dans la direction des faibles energies par rapport aux pics de rotation differee. Les spectres des neutrons diffuses par des cristaux contenant de l'eau liee se ressemblent egalement. On y observe trois groupes de pics associes aux oscillations optiques et a la rotation differee des molecules d'eau. (author) [Spanish] En la memoria se presentan los resultados de las mediciones de la dispersion de neutrones termicos en cristales que contienen el ion amonio (NH{sub 4}CI, NH{sub 4}Br, NH{sub 4}I, NH{sub 4}F, NH{sub 4}NO{sub 3}, NH{sub 4}CNS, (NH{sub 4}){sub 2}SO{sub 4}, (NH{sub 4}){sub 2}S{sub 2}O{sub 8}, (NH{sub 4}){sub 2}Cr{sub 2}O{sub 7}, (NH{sub 4}){sub 2}CO{sub 3}) y agua de cristalizacion (BaCl{sub 2} * 2H{sub 2}O, SrCl{sub 2} * 6H{sub 2}O, CuSO{sub 4} * 5H{sub 2}O). La finalidad de las investigaciones era estudiar la influencia ejercida por las distintas redes cristalinas sobre la dinamica de los mencionados grupos, y la relacion existente entre los procesos de dispersion y las transiciones de fase. A pesar de la distinta estructura de las sustancias estudiadas, los espectros obtenidos a la temperatura del nitrogeno liquido son analogos; por regla'general, se observan dos picos: el primero en la region de transferencia energetica de 15 a 20 meV, el segundo en la region correspondiente a 35-70 meV, que esta relacionado con las oscilaciones de torsion de los iones amonio. La intensidad de los picos, que depende de la estructura de las sustancias estudiadas, disminuye al aumentar la temperatura de la muestra. Se observo que la intensidad de la parte elastica del espectro, en ciertas transiciones de fase, presenta discontinuidades (en los casos del NH{sub 4}I, NH{sub 4}NO{sub 3} y (NH{sub 4}){sub 2}SO{sub 4}). Al aumentar la temperatura del NH{sub 4}Cl, NH{sub 4}Br y (NH{sub 4}){sub 2}(COO){sub 2}, aparece otro pico, desplazado hacia las energias mas bajas con respecto a los picos de rotacion restringida. ' Los espectros correspondientes a los neutrones dispersos en cristales que contienen agua de cristalizacion tambien presentan analogias. Se observaron tres grupos de picos, asociados a las oscilaciones opticas y a la rotacion restringida de las moleculas de agua. (author) [Russian] V doklade predstavleny rezul'taty izmerenij rassejanija teplovyh nejtronov na kristallah, soderzhashhih ammonievyj ion (NH{sub 4}CI, NH{sub 4}Br, NH{sub 4}I, NH{sub 4}F, NH{sub 4}NO{sub 3}, NH{sub 4}CNS, (NH{sub 4}){sub 2}SO{sub 4}, (NH{sub 4}){sub 2}S{sub 2}O{sub 8}, (NH{sub 4}){sub 2}Cr{sub 2}O{sub 7}, (NH{sub 4}){sub 2}CO{sub 3}) i kristallizacionnuju vodu (BaCl{sub 2} * 2H{sub 2}O, SrCl{sub 2} * 6H{sub 2}O, CuSO{sub 4} * 5H{sub 2}O). Cel'ju issledovanija bylo izuchenie vlijanija razlichnyh kristallicheskih reshetok na dinamiku ukazannyh grupp, i svjazi processov rassejanija s fazovymi perehodami. Nesmotrja na razlichie struktur issleduemyh veshhestv, poluchaemye spektry pri temperature zhidkogo azota okazyvajutsja pohozhimi drug na druga: kak pravilo, nabljudajutsja dva pika - pervyj v oblasti peredach jenergii 15 - 20 mjev, drugoj v oblasti 35 - 70 mjev, svjazannyj s torsionnymi kolebanijami ammonievyh ionov. Intensivnost' pikov zavisit ot struktury issleduemyh veshhestv i umen'shaetsja s uvelicheniem temperatury obrazca. Obnaruzheno, chto intensivnost' uprugoj chasti spektra pri nekotoryh fazovyh perehodah sovershaet skachok (v sluchajah NH{sub 4}I, NH{sub 4}NO{sub 3} i (NH{sub 4}){sub 2}SO{sub 4}). S uvelicheniem temperatury v NH{sub 4}Cl, NH{sub 4}Br, (NH{sub 4}){sub 2}(COO){sub 2} voznikaet dopolnitel'nyj pik, sdvinutyj v storonu men'shih jenergij ot pika zatormozhennogo vrashhenija. Spektry nejtronov, rassejannyh na kristallah, soderzhashhih kristallizacionnuju vodu, takzhe shozhi mezhdu soboj. V spektrah nabljudajutsja tri gruppy pikov, svjazannyh s opticheskimi kolebanijami i zatormozhennym vrashheniem molekul vody. (author)

  16. Resistance and Stock Propulsion on the High Speed Sealift (HSS) Hybrid Contra-Rotating Shaft-Pod (HCRSP) Concept, Model 5653-3A

    Science.gov (United States)

    2008-09-01

    34 0N mD " ’ H 0 WMaH MW0WN N m 1-4 ~ ~ ~ Hq H4- 4 4r4 H H H H H mN( OD.D o t-)(~(aHr(arC0~)N(HAa((NLH ri) H 0~~ W-- HHHHHH "HHH(m((N(N m 1-4CC’ C ) LA...34 0000000000000000000000000000 OO OO HH HH HHHHHH iH H r,cl NC14ONmO W. M~ W W WWMWWkD-4IDM V-Wr-M 0WW W -4r- - MM C ; a) 000000000000000000000000000 w N mNwom- o oo0...82174HNO.~O.LflWN(4LAO.OW.4 + 0 - HHHHHHHHH HHHHHH H 00 ~~~~~1 ~ ~ r 0;c A bIDH~.L ~C C 0’ M,IDO r- 0(1 M - H W 0 M* 0 ~H H H H H H4 H 0 MU C AW4W 00 D WV

  17. 32 CFR 746.2 - Policy.

    Science.gov (United States)

    2010-07-01

    ... developed to the point of practical application and made available to the public in the shortest possible... may assist in the accomplishment of the national objective to achieve a dynamic and efficient economy...

  18. Integrated Coastal Observation Network (ICON) for real-time monitoring of sea-level, sea-state, and surface-meteorological data

    Digital Repository Service at National Institute of Oceanography (India)

    Desai, R.G.P.; Joseph, A.; Agarvadekar, Y.; Mehra, P.; VijayKumar, K.; Luis, R.

    ). Real-time reporting capability of ICON yields several benefits, such as (i) remote monitoring of proper working condition of individual stations; (ii) implementation of repair/maintenance in the shortest possible time, thereby minimizing break...

  19. Food Delivery System with the Utilization of Vehicle Using Geographical Information System (GIS) and A Star Algorithm

    Science.gov (United States)

    Siregar, B.; Gunawan, D.; Andayani, U.; Sari Lubis, Elita; Fahmi, F.

    2017-01-01

    Food delivery system is one kind of geographical information systems (GIS) that can be applied through digitation process. The main case in food delivery system is the way to determine the shortest path and food delivery vehicle movement tracking. Therefore, to make sure that the digitation process of food delivery system can be applied efficiently, it is needed to add shortest path determination facility and food delivery vehicle tracking. This research uses A Star (A*) algorithm for determining shortest path and location-based system (LBS) programming for moving food delivery vehicle object tracking. According to this research, it is generated the integrated system that can be used by food delivery driver, customer, and administrator in terms of simplifying the food delivery system. Through the application of shortest path and the tracking of moving vehicle, thus the application of food delivery system in the scope of geographical information system (GIS) can be executed.

  20. Influence of Inoculation Method and Spawn Level on Biological ...

    African Journals Online (AJOL)

    ADOWIE PERE

    in and layering) and spawn levels (3, 5, 7, 9, 11, and 13%) on the mushroom. The results ... grows faster and has more energy available for fruiting body formation, hence the increased .... The shortest spawn running time obtained when the.

  1. Clinical Trials

    Medline Plus

    Full Text Available ... at the smallest dose and for the shortest time possible. Clinical trials, like the two described above, ... in a clinical trial, find out ahead of time about costs and coverage. You should learn about ...

  2. Biometry: the principles and practice of statistics in biological research

    National Research Council Canada - National Science Library

    Sokal, R.R; Rohlf, F.J

    1969-01-01

    .... The text is the first in biometry to present such techniques as the simultaneous test procedures, goodness of fit tests by means of the information statistic, and shortest unbiased confidence intervals for the variance...

  3. Infrared presensitization photography at deuterium fluoride laser wavelengths

    International Nuclear Information System (INIS)

    Geary, J.M.; Ross, K.; Suter, K.

    1989-01-01

    Near-field irradiance distributions of a deuterium flouride laser system are obtained using infrared presensitization photography. This represents the shortest wavelength region to employ this technique thus far

  4. Capacity Constrained Routing Algorithms for Evacuation Route Planning

    National Research Council Canada - National Science Library

    Lu, Qingsong; George, Betsy; Shekhar, Shashi

    2006-01-01

    .... In this paper, we propose a new approach, namely a capacity constrained routing planner which models capacity as a time series and generalizes shortest path algorithms to incorporate capacity constraints...

  5. Observational study of Herbig-Haro nebulae

    International Nuclear Information System (INIS)

    Brugel, E.W.

    1981-01-01

    Spectrophotometric data have been obtained for twelve Herbig-Haro nebulae with the multichannel spectrometer on the Mt. Palomar 5.08 meter telescope and with the image intensified dissector scanner on the Kitt Peak 2.13 meter telescope. Energy distributions of the continuous spectra of the Herbig-Haro objects H-H 1 (NW), H-H 2A, H-H 2G, H-H 2H, H-H 24A and H-H 32 have been determined in the wavelength range 3300 to 8000A. The signal-to-noise ratio has been improved in comparison to an earlier attempt to measure the continuum in H-H 1 and H-H 2H. Reddening corrections are based on Miller's [SII] method. The [FeII] emission line spectra have also been utilized as a secondary method for determining the interstellar reddening. In all continua the flux F/sub lambda/ increases rapidly with decreasing wavelength after the small scale structure has been averaged out. A power law interpolation F/sub lambda/ proportional lambda/sup -n/ demonstrates that for all observed H-H objects n lies in the range between 2.04 (H-H 2A, H-H 2H) and 2.92 (H-H 32). The relation of these results to recent I.U.E. observations of H-H 1 is discussed. It is also found that the ratio of the total optical continuum flux to Hβ flux is almost the same for all observed H-H objects with the sole exception of H-H 24A in which the continuum is considerably stronger than in other objects. This fact leads to difficulties in the usual dust scattering hypothesis for the interpretation of H-H continua. It is argued, if these energy distributions are really due to dust scattering in stellar continua as has been usually assumed, the original source must be a hot object and cannot be a T Tauri star.An interpretation in terms of transition radiation (as suggested by Gurzadyan) does not seem to be possible because the observed rise of F/sub lambda/ towards the ultraviolet is too steep

  6. Branching geodesics in normed spaces

    International Nuclear Information System (INIS)

    Ivanov, A O; Tuzhilin, A A

    2002-01-01

    We study branching extremals of length functionals on normed spaces. This is a natural generalization of the Steiner problem in normed spaces. We obtain criteria for a network to be extremal under deformations that preserve the topology of networks as well as under deformations with splitting. We discuss the connection between locally shortest networks and extremal networks. In the important particular case of the Manhattan plane, we get a criterion for a locally shortest network to be extremal

  7. Measurement and Control of Attosecond Pulses

    Science.gov (United States)

    2016-04-25

    highest power or the shortest duration attosecond pulses. Results: We have adapted the attosecond lighthouse to gases and confirmed isolated...simplifying attosecond metrology so it becomes more widely accessible. Result: This goal was completely accomplished. Aim 2: To exploit few- cycle ...μm driver. Aim 3: To compare attosecond gating methods, selecting the most efficient way to produce the highest power or the shortest duration

  8. Effective carrier sweepout in a silicon waveguide by a metal-semiconductor-metal structure

    DEFF Research Database (Denmark)

    Ding, Yunhong; Hu, Hao; Ou, Haiyan

    2015-01-01

    We demonstrate effective carrier depletion by metal-semiconductor-metal junctions for a silicon waveguide. Photo-generated carriers are efficiently swept out by applying bias voltages, and a shortest carrier lifetime of only 55 ps is demonstrated.......We demonstrate effective carrier depletion by metal-semiconductor-metal junctions for a silicon waveguide. Photo-generated carriers are efficiently swept out by applying bias voltages, and a shortest carrier lifetime of only 55 ps is demonstrated....

  9. Spreading paths in partially observed social networks

    Science.gov (United States)

    Onnela, Jukka-Pekka; Christakis, Nicholas A.

    2012-03-01

    Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

  10. Spreading paths in partially observed social networks.

    Science.gov (United States)

    Onnela, Jukka-Pekka; Christakis, Nicholas A

    2012-03-01

    Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using static, structurally realistic social networks as platforms for simulations, we juxtapose three distinct paths: (1) the stochastic path taken by a simulated spreading process from source to target; (2) the topologically shortest path in the fully observed network, and hence the single most likely stochastic path, between the two nodes; and (3) the topologically shortest path in a partially observed network. In a sampled network, how closely does the partially observed shortest path (3) emulate the unobserved spreading path (1)? Although partial observation inflates the length of the shortest path, the stochastic nature of the spreading process also frequently derails the dynamic path from the shortest path. We find that the partially observed shortest path does not necessarily give an inflated estimate of the length of the process path; in fact, partial observation may, counterintuitively, make the path seem shorter than it actually is.

  11. Assessment of Oropharyngeal Dysphagia in Patients With Parkinson Disease: Use of Ultrasonography.

    Science.gov (United States)

    Oh, Eun Hyun; Seo, Jin Seok; Kang, Hyo Jung

    2016-04-01

    To compare tongue thickness, the shortest hyoid-thyroid approximation (distance between the hyoid bone and thyroid cartilage), and the time interval between the initiation of tongue movement and the time of the shortest hyoid-thyroid approximation, by using ultrasonography in healthy controls and patients with Parkinson disease (PD). Healthy controls and PD patients with dysphagia were compared. Ultrasonography was performed 3 times for the evaluation of tongue thickness, the shortest hyoid-thyroid approximation, and the time between the initiation of tongue movement and the shortest hyoid-thyroid approximation. A total of 24 healthy controls and 24 PD patients with dysphagia were enrolled. No significant differences were demonstrated between the two groups for the shortest hyoid-thyroid approximation (controls, 1.19±0.34 cm; PD patients, 1.37±0.5 cm; p=0.15) and tongue thickness (controls, 4.42±0.46 cm; PD patients, 4.27±0.51 cm; p=0.3). In contrast, the time to the shortest hyoid-thyroid approximation was significantly different between the two groups (controls, 1.53±0.87 ms; PD patients, 2.4±1.4 ms, p=0.048). Ultrasonography can be useful in evaluating dysphagia in patients with PD by direct visualization and measurement of the hyoid bone. Moreover, ultrasonography might contribute to a greater understanding of the pathophysiology of dysphagia in PD.

  12. Ratio of tritiated water and hydrogen generated in mercury through a nuclear reaction

    Energy Technology Data Exchange (ETDEWEB)

    Manabe, K. [Nuclear Science and Engineering Directorate, Japan Atomic Energy Agency (JAEA), Tokai, Naka-gun, Ibaraki 319-1195 (Japan)], E-mail: manabe.kentaro@jaea.go.jp; Yokoyama, S. [Nuclear Science and Engineering Directorate, Japan Atomic Energy Agency (JAEA), Tokai, Naka-gun, Ibaraki 319-1195 (Japan)

    2008-02-15

    Tritium generated in a mercury target is a source of potential exposure of personnel at high-energy accelerator facilities. Knowledge of the chemical form of tritium is necessary to estimate the internal doses. We studied the tritium generation upon thermal neutron irradiation of a mercury target modified into liquid lithium amalgam to examine the ratio of tritiated water ([{sup 3}H]H{sub 2}O) and tritiated hydrogen ([{sup 3}H]H{sub 2}). The ratio between [{sup 3}H]H{sub 2}O and [{sup 3}H]H{sub 2} generated in lithium amalgam was 4:6 under these experimental conditions.

  13. The dynamics of histone H2A ubiquitination in HeLa cells exposed to rapamycin, ethanol, hydroxyurea, ER stress, heat shock and DNA damage.

    Science.gov (United States)

    Nakata, Shiori; Watanabe, Tadashi; Nakagawa, Koji; Takeda, Hiroshi; Ito, Akihiro; Fujimuro, Masahiro

    2016-03-25

    Polyubiquitination plays key roles in proteasome-dependent and independent cellular events, whereas monoubiquitination is involved in gene expression, DNA repair, protein-protein interaction, and protein trafficking. We previously developed an FK2 antibody, which specifically recognizes poly-Ub moieties but not free Ub. To elucidate the role of Ub conjugation in response to cellular stress, we used FK2 to investigate whether chemical stress (rapamycin, ethanol, or hydroxyurea), ER stress (thapsigargin or tunicamycin), heat shock or DNA damage (H2O2 or methyl methanesulfonate) affect the formation of Ub conjugates including histone H2A (hH2A) ubiquitination. First, we found that all forms of stress tested increased poly-ubiquitinated proteins in HeLa cells. Furthermore, rapamycin and hydroxyurea treatment, and ER stress increased ubiquitination of hH2A, while methyl methanesulfonate (MMS) treatment induced deubiquitination of hH2A. The ethanol and H2O2 treatments, and heat shock transiently induced hH2A de-ubiquitination, although deubiquitinated hH2A were ubiquitinated again by subsequent cultivation. We also revealed that FK2 reacts with not only polyubiquitinated proteins but also mono-ubiquitinated hH2A. With the exception of MMS, all forms of stress tested increased the acetylation of K5-hH2A, K9-hH3 and K8-hH4 in addition to ubiquitination. K118 and K119 of hH2A were ubiquitinated in cells under normal conditions, and K119 was the major ubiquitination site. The MMS-treatment and heat shock induced the deubiquitination of both K118 and K119-histone H2A. Interestingly, MMS treatment did not affect cell HeLa cell viability expressing double-mutant hH2A (KK118,119AA-hH2A), while heat shock slightly but significantly decreased viability of double-mutant hH2A expressing cells, indicating that ubiquitination of both sites associates with recovery from heat shock but not MMS treatment. Thus, we characterized FK2 reactivity and demonstrated that various stresses alter

  14. Isomyosin expression patterns in tubular stages of chicken heart development: a 3-D immunohistochemical analysis

    NARCIS (Netherlands)

    de Jong, F.; Geerts, W. J.; Lamers, W. H.; Los, J. A.; Moorman, A. F.

    1987-01-01

    The 3-D distribution of atrial and ventricular isomyosins is analysed in tubular chicken hearts (stage 12+ to 17 (H/H)) using antibodies specific for adult chicken atrial and ventricular myosin heavy chains, respectively. At stage 12+ (H/H) all myocytes express the atrial isomyosin; furthermore, all

  15. Safety of Mixed Model Access Control in a Multilevel System

    Science.gov (United States)

    2014-06-01

    42  H.  FIREWALL AND IPS LANGUAGES...Research Laboratory AIS automated information system ANOA advance notice of arrival APT advanced persistent threat BFM boundary flow modeling...of Investigation FW firewall GENSER general service xvi GUI graphical user interface HAG high-assurance guard HGS high-grade service H-H-H High

  16. Novel chalcone-based fluorescent human histamine H3 receptor ligands as pharmacological tools

    Directory of Open Access Journals (Sweden)

    Holger eStark

    2012-03-01

    Full Text Available Novel fluorescent chalcone-based ligands at human histamine H3 receptors (hH3R have been designed, synthesized and characterized. Compounds described are non-imidazole analogues of ciproxifan with a tetralone motif. Tetralones as chemical precursors and related fluorescent chalcones exhibit affinities at hH3R in the same concentration range like that of the reference antagonist ciproxifan (hH3R pKi value of 7.2. Fluorescence characterization of our novel ligands shows emission maxima about 570 nm for yellow fluorescent chalcones and ≥600 nm for the red fluorescent derivatives. Interferences to cellular autofluorescence could be excluded. All synthesized chalcone compounds could be taken to visualize hH3R proteins in stably transfected HEK-293 cells using confocal laser scanning fluorescence microscopy. These novel fluorescent ligands possess high potential to be used as pharmacological tools for hH3R visualization in different tissues.

  17. Absorption spectra for collinear (nonreactive) H3: Comparison between quantal and classical calculations

    International Nuclear Information System (INIS)

    Engel, V.; Bacic, Z.; Schinke, R.; Shapiro, M.

    1985-01-01

    Absorption spectra for the collinear (nonreactive) H+H 2 →H/sup number-sign/ 3 →H+H 2 are calculated quantum mechanically, using the Siegbahn--Liu--Truhlar--Horowitz (SLTH) ab initio potential and a model H( 3 surface as the ground and excited H 3 surface, respectively. They are compared to classical spectra previously computed by Mayne, Poirier, and Polanyi using the same potential energy surfaces [J. Chem. Phys. 80, 4025 (1984)]. The spectra are calculated at several collision energies and for both H+H 2 (v = 0) and H+H 2 (v = 1). The quantal and classical spectra are shown to agree with respect to basic features and trends. Nevertheless, the two sets of spectra differ considerably in their overall appearance because of some purely quantum aspects of the H+H 2 system

  18. A combinatorial approach to the design of vaccines.

    Science.gov (United States)

    Martínez, Luis; Milanič, Martin; Legarreta, Leire; Medvedev, Paul; Malaina, Iker; de la Fuente, Ildefonso M

    2015-05-01

    We present two new problems of combinatorial optimization and discuss their applications to the computational design of vaccines. In the shortest λ-superstring problem, given a family S1,...,S(k) of strings over a finite alphabet, a set Τ of "target" strings over that alphabet, and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ target strings as substrings of S(i). In the shortest λ-cover superstring problem, given a collection X1,...,X(n) of finite sets of strings over a finite alphabet and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ elements of X(i) as substrings. The two problems are polynomially equivalent, and the shortest λ-cover superstring problem is a common generalization of two well known combinatorial optimization problems, the shortest common superstring problem and the set cover problem. We present two approaches to obtain exact or approximate solutions to the shortest λ-superstring and λ-cover superstring problems: one based on integer programming, and a hill-climbing algorithm. An application is given to the computational design of vaccines and the algorithms are applied to experimental data taken from patients infected by H5N1 and HIV-1.

  19. The extracellular loop 2 (ECL2 of the human histamine H4 receptor substantially contributes to ligand binding and constitutive activity.

    Directory of Open Access Journals (Sweden)

    David Wifling

    Full Text Available In contrast to the corresponding mouse and rat orthologs, the human histamine H4 receptor (hH4R shows extraordinarily high constitutive activity. In the extracellular loop (ECL, replacement of F169 by V as in the mouse H4R significantly reduced constitutive activity. Stabilization of the inactive state was even more pronounced for a double mutant, in which, in addition to F169V, S179 in the ligand binding site was replaced by M. To study the role of the FF motif in ECL2, we generated the hH4R-F168A mutant. The receptor was co-expressed in Sf9 insect cells with the G-protein subunits Gαi2 and Gβ1γ2, and the membranes were studied in [3H]histamine binding and functional [35S]GTPγS assays. The potency of various ligands at the hH4R-F168A mutant decreased compared to the wild-type hH4R, for example by 30- and more than 100-fold in case of the H4R agonist UR-PI376 and histamine, respectively. The high constitutive activity of the hH4R was completely lost in the hH4R-F168A mutant, as reflected by neutral antagonism of thioperamide, a full inverse agonist at the wild-type hH4R. By analogy, JNJ7777120 was a partial inverse agonist at the hH4R, but a partial agonist at the hH4R-F168A mutant, again demonstrating the decrease in constitutive activity due to F168A mutation. Thus, F168 was proven to play a key role not only in ligand binding and potency, but also in the high constitutive activity of the hH4R.

  20. Effects of proton irradiation on structure of NdFeB permanent magnets studied by X-ray diffraction and X-ray absorption fine structure

    International Nuclear Information System (INIS)

    Yang, L.; Zhen, L.; Xu, C.Y.; Sun, X.Y.; Shao, W.Z.

    2011-01-01

    The effects of proton irradiation on the structure of NdFeB permanent magnet were investigated by X-ray diffraction and X-ray absorption fine structure (XAFS). The results reveal that proton irradiation has no effect on the long-range structure, but significantly affects the atomic local structure of the NdFeB magnet. The alignment degree of the magnet decreases and the internal stress of the lattice increases after proton irradiation. XAFS results show that the coordination number of Fe-Nd in the first neighboring coordination shell of the Fe atoms decreases and the disorder degree increases.

  1. Effects of proton irradiation on structure of NdFeB permanent magnets studied by X-ray diffraction and X-ray absorption fine structure

    Energy Technology Data Exchange (ETDEWEB)

    Yang, L. [School of Materials Science and Engineering, Harbin Institute of Technology, Harbin 150001 (China); Zhen, L., E-mail: lzhen@hit.edu.c [School of Materials Science and Engineering, Harbin Institute of Technology, Harbin 150001 (China); Xu, C.Y.; Sun, X.Y.; Shao, W.Z. [School of Materials Science and Engineering, Harbin Institute of Technology, Harbin 150001 (China)

    2011-01-15

    The effects of proton irradiation on the structure of NdFeB permanent magnet were investigated by X-ray diffraction and X-ray absorption fine structure (XAFS). The results reveal that proton irradiation has no effect on the long-range structure, but significantly affects the atomic local structure of the NdFeB magnet. The alignment degree of the magnet decreases and the internal stress of the lattice increases after proton irradiation. XAFS results show that the coordination number of Fe-Nd in the first neighboring coordination shell of the Fe atoms decreases and the disorder degree increases.

  2. Structures of high and low density amorphous ice by neutron diffraction

    International Nuclear Information System (INIS)

    Finney, J.L.; Hallbrucker, A.; Kohl, I.; Soper, A.K.; Bowron, D.T.

    2002-01-01

    Neutron diffraction with isotope substitution is used to determine the structures of high (HDA) and low (LDA) density amorphous ice. Both 'phases' are fully hydrogen bonded, tetrahedral networks, with local order similarities between LDA and ice Ih, and HDA and liquid water. Moving from HDA, through liquid water and LDA to ice Ih, the second shell radial order increases at the expense of spatial order. This is linked to a fifth first neighbor 'interstitial' that restricts the orientations of first shell waters. This 'lynch pin' molecule which keeps the HDA structure intact has implications for the nature of the HDA-LDA transition that bear on the current metastable water debate

  3. Split-plot designs for robotic serial dilution assays.

    Science.gov (United States)

    Buzas, Jeffrey S; Wager, Carrie G; Lansky, David M

    2011-12-01

    This article explores effective implementation of split-plot designs in serial dilution bioassay using robots. We show that the shortest path for a robot to fill plate wells for a split-plot design is equivalent to the shortest common supersequence problem in combinatorics. We develop an algorithm for finding the shortest common supersequence, provide an R implementation, and explore the distribution of the number of steps required to implement split-plot designs for bioassay through simulation. We also show how to construct collections of split plots that can be filled in a minimal number of steps, thereby demonstrating that split-plot designs can be implemented with nearly the same effort as strip-plot designs. Finally, we provide guidelines for modeling data that result from these designs. © 2011, The International Biometric Society.

  4. Personal computer based decision support system for routing nuclear spent fuel

    International Nuclear Information System (INIS)

    Chin, Shih-Miao; Joy, D.S.; Johnson, P.E.; Bobic, S.M.; Miaou, Shaw-Pin

    1989-01-01

    An approach has been formulated to route nuclear spent fuel over the US Interstate highway network. This approach involves the generation of alternative routes so that any potential adverse impacts will not only concentrate on regions along the shortest path between the nuclear power plant and repository. Extensive literature research on the shortest path finding algorithms has been carried out. Consequently, an extremely efficient shortest path algorithm has been implemented and significantly increases the overall system performance. State-of-the-art interactive computer graphics is used. In addition to easy-to-use pop-up menus, full color mapping and display capabilities are also incorporated. All of these features have been implemented on commonly available personal computers. 6 figs., 2 tabs

  5. Optimal improvement of graphs related to nuclear safeguards problems

    International Nuclear Information System (INIS)

    Jacobsen, S.E.

    1977-08-01

    This report develops the methodology for optimally improving graphs related to nuclear safeguards issues. In particular, given a fixed number of dollars, the report provides a method for optimally allocating such dollars over the arcs of a weighted graph (the weights vary as a function of dollars spent on arcs) so as to improve the system effectiveness measure which is the shortest of all shortest paths to several targets. Arc weights can be either clock times or detection probabilities and the algorithm does not explicitly consider all paths to the targets

  6. Multi-Energy Processing for Novel Coating Technologies

    Science.gov (United States)

    2014-12-18

    shape bounced back with increased inner flame lengths and reduced diameters. At 10.532 ^m, the length of the inner flame was the shortest, 3 mm, with a...brighter and shorter. At 10.22 ^m, the inner flame length was the shortest, 4 mm with 2 m expansion in diameter, indicating accelerated combustion...absorption rates less than 1/3 of that at 9 219 um the lame length shrank further and became brighter. With a laser irradiation at 9.219 ^m the flame

  7. Effect of crosstalk on component savings in multi-core fiber networks

    DEFF Research Database (Denmark)

    Nooruzzaman, Md; Morioka, Toshio

    2017-01-01

    We estimate potential component savings in MCF-based networks by using shortest path traffic routing and compare them with the current SCF-based systems. We also investigate the potential impact of various inter-core crosstalk values on the number of needed transponders in MCF networks.......We estimate potential component savings in MCF-based networks by using shortest path traffic routing and compare them with the current SCF-based systems. We also investigate the potential impact of various inter-core crosstalk values on the number of needed transponders in MCF networks....

  8. Estimation of membrane hydration status for active proton exchange membrane fuel cell systems by impedance measurement

    DEFF Research Database (Denmark)

    Török, Lajos; Sahlin, Simon Lennart; Kær, Søren Knudsen

    2016-01-01

    Fuel cells are getting growing interest in industrial areas like backup systems for telecom applications or power source for electric vehicles. Although these systems are characterized by long periods of inactivity, they must be able to start at any instant in the shortest time. However, the memb......Fuel cells are getting growing interest in industrial areas like backup systems for telecom applications or power source for electric vehicles. Although these systems are characterized by long periods of inactivity, they must be able to start at any instant in the shortest time. However...

  9. Optimal Patrol to Detect Attacks at Dispersed Heterogeneous Locations

    Science.gov (United States)

    2013-12-01

    solution RALP Random-attacker linear program SALP Strategic-attacker linear program SMDP Semi-Markov decision process SP Shortest path SPR1 Shortest...average cost per attack among all vertices, which we refer to as the strategic-attacker linear program ( SALP ): min x zOPT (3.1a) subject to ∑ (k,l)∈A c...the SALP is indicated by zOPT. The lower bound that is obtained from using the LBLP is indicated by zLB. Solutions obtained from using a heuristic

  10. Ranking the Stars: Network Analysis of Bilateral Tax Treaties

    OpenAIRE

    Maarten van 't Riet; Arjan Lejour

    2014-01-01

    With a novel approach this paper sheds light on the international tax planning possibilities of multinationals. The international corporate tax system is considered a network, just like for transportation, and ‘shortest’ paths are computed, minimizing tax payments for the multinationals when repatriating profits. Read the accompanying press release and background document A and B . The network consists of 108 jurisdictions, and the ‘shortest’ paths are constructed from the rates of co...

  11. Graph reconstruction with a betweenness oracle

    DEFF Research Database (Denmark)

    Abrahamsen, Mikkel; Bodwin, Greg; Rotenberg, Eva

    2016-01-01

    Graph reconstruction algorithms seek to learn a hidden graph by repeatedly querying a blackbox oracle for information about the graph structure. Perhaps the most well studied and applied version of the problem uses a distance oracle, which can report the shortest path distance between any pair...... of nodes. We introduce and study the betweenness oracle, where bet(a, m, z) is true iff m lies on a shortest path between a and z. This oracle is strictly weaker than a distance oracle, in the sense that a betweenness query can be simulated by a constant number of distance queries, but not vice versa...

  12. Combinatorial algorithms

    CERN Document Server

    Hu, T C

    2002-01-01

    Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9

  13. An efficient strategy for enhancing traffic capacity by removing links in scale-free networks

    International Nuclear Information System (INIS)

    Huang, Wei; Chow, Tommy W S

    2010-01-01

    An efficient link-removal strategy, called the variance-of-neighbor-degree-reduction (VNDR) strategy, for enhancing the traffic capacity of scale-free networks is proposed in this paper. The VNDR strategy, which considers the important role of hub nodes, balances the amounts of packets routed from each node to the node's neighbors. Compared against the outcomes of strategies that remove links among hub nodes, our results show that the traffic capacity can be greatly enhanced, especially under the shortest path routing strategy. It is also found that the average transport time is effectively reduced by using the VNDR strategy only under the shortest path routing strategy

  14. Toxicity of pyrolysis gases from some cellular polymers

    Science.gov (United States)

    Hilado, C. J.; Machado, A. M.

    1978-01-01

    Various samples of cellular polymers were evaluated for toxicity of pyrolysis gases, using the screening test method developed at the University of San Francisco. The cellular polymer samples included polyimide, polymethacrylimide, polybismaleimide, polyurethane, polyisocyanurate, polyethylene, polychloroprene, polyvinyl chloride, polystyrene, polysiloxane, and polyphosphazene. The cellular polymers exhibited varying levels of toxicity under these test conditions. Among the rigid cellular polymers, times to death were shortest with the imide type foams and longest with polyvinyl chloride and polystyrene. Among the flexible cellular polymers, times to death were shortest with polyimide and polyester, and longest with polychloroprene and polysiloxane. Increased char yield was not necessarily associated with reduced toxicity.

  15. Terminal Area Forecasts, FY 1993-2005

    Science.gov (United States)

    1993-07-01

    4 6 0 H -4 ~ M 0~) mo~io oo o o moo- ~ ~ 7~I~~ HHHHH HHHH H H HHHHHH H H C~6HHHHHHH- HHHH H H 0 I Iv En 6O 01~0 0 0HH H HH H H H0 HHHNHHHH 0H0H H H Ci...OD o IWWWn W 0no-D A % MMH NM ww H mo 1-4IHr- i14 4H - ’ H~~ H. HOHOHHH 444 HHH N H r, In~o- v v𔃺wr, - - C4~~4CC( C44Ce (4 C4C M4 C NMVMV NNNm HHHHHH ...HHHH H ei I ~ u~o- O~0H a)I 4 HHHHHH HHHH r-4 Nl H xmoHmm virewee o In HHnw Hwm0H HHH H HnW 0 H 0C4lHO 1HH H HM M M MMMMO 0 0 0 0 4HHHH-OHHHHHN N

  16. Search for the charged Higgs boson in Z0 decay

    International Nuclear Information System (INIS)

    Adeva, B.; Adriani, O.; Anguilar-Benitez, M.; Akbari, H.; Alcaraz, J.; Aloisio, A.; Alverson, G.; Alviggi, M.G.; An, Q.; Anderhub, H.; Anderson, A.L.; Andreev, V.P.; Angelov, T.; Antonov, L.; Antreasyan, D.; Arce, P.; Arefiev, A.; Azemoon, T.; Aziz, T.; Baba, P.V.K.S.; Bagnaia, P.; Bakken, J.A.; Baksay, L.; Ball, R.C.; Banerjee, S.; Bao, J.; Barone, L.; Bay, A.; Becker, U.; Behrens, J.; Beingessner, S.; Bencze, Gy.L.; Berdugo, J.; Berges, P.; Bertucci, B.; Betev, B.L.; Biland, A.; Bizzarri, R.; Blaising, J.J.; Bloemeke, P.; Blumenfeld, B.; Bobbink, G.J.; Bocciolini, M.; Boehlen, W.; Boehm, A.; Boehringer, T.; Borgia, B.; Bourilkov, D.; Bourquin, M.; Boutigny, D.; Bouwens, B.; Branson, J.G.; Brock, I.C.; Bruyant, F.; Buisson, C.; Bujak, A.; Burger, J.D.; Burq, J.P.; Busenitz, J.; Cai, X.D.; Camps, C.; Capell, M.; Carbonara, F.; Carminati, F.; Cartacci, A.M.; Cerrada, M.; Cesaroni, F.; Chang, Y.H.; Chaturvedi, U.K.; Chemarin, M.; Chen, A.; Chen, C.; Chen, G.M.; Chen, H.F.; Chen, H.S.; Chen, M.; Chen, M.C.; Chen, M.L.; Chiefari, G.; Chien, C.Y.; Chollet, F.; Civinini, C.; Clare, I.; Clare, R.; Coignet, G.; Colino, N.; Commichau, V.; Conforto, G.; Contin, A.; Crijns, F.; Cui, X.Y.; Dai, T.S.; D'Alessandro, R.; De Asmundis, R.; Degre, A.; Deiters, K.; Denes, E.; Denes, P.; DeNotaristefani, F.; Dhina, M.; DiBitonto, D.; Diemoz, M.; Diez-Hedo, F.; Dimitrov, H.R.; Dionisi, C.; Dittus, F.; Dolin, R.; Drago, E.; Driever, T.; Duchesneau, D.; Duinker, P.; Duran, I.; El Mamouni, H.; Engler, A.; Eppling, F.J.; Erne, F.C.; Extermann, P.; Fabbretti, R.; Faber, G.; Falciano, S.; Fan, Q.; Fan, S.J.; Fabre, M.; Fay, J.; Fehlmann, J.; Fenker, H.; Ferguson, T.; Fernandez, G.; Ferroni, F.; Fesefeldt, H.; Field, J.; Filthaut, F.; Finocchiaro, G.; Fisher, P.H.; Forconi, G.; Foreman, T.; Freudenreich, K.; Friebel, W.; Fukushima, M.; Gailloud, M.; Galaktionov, Yu.; Gallo, E.; Ganguli, S.N.; Garcia-Abia, P.; Gau, S.S.; Gentile, S.; Glaubman, M.; Goldfarb, S.; Gong, Z.F.; Gonzalez, E.; Gordeev, A.; Goettlicher, P.; Goujon, D.; Gratta, G.; Grinnell, C.; Gruenewald, M.; Guanziroli, M.; Gurtu, A.; Gustafson, H.R.; Gutay, L.J.; Haan, H.; Hancke, S.; Hangarter, K.; Harris, M.; Hasan, A.; Hauschildt, D.; He, C.F.; Hebbeker, T.; Hebert, M.; Herten, G.; Herten, U.; Herve, A.; Hilgers, K.; Hofer, H.; Hoorani, H.; Hsu, L.S.; Hu, G.; Hu, G.Q.; Ille, B.; Ilyas, M.M.; Innocente, V.; Isiksal, E.; Jagel, E.; Jin, B.N.; Jones, L.W.; Khan, R.A.; Kamyshkov, Yu.; Karyotakis, Y.; Kaur, M.; Khokhar, S.; Khoze, V.; Kirkby, D.; Kittel, W.; Klimentov, A.; Koenig, A.C.; Kornadt, O.; Koutsenko, V.; Kraemer, R.W.; Kramer, T.; Krastev, V.R.; Krenz, W.; Krizmanic, J.; Kuhn, A.; Kumar, K.S.; Kumar, V.; Kunin, A.; Laak, A. van; Lalieu, V.; Landi, G.; Lanius, K.; Lanske, D.

    1990-01-01

    We have searched for the pair produced charged Higgs particles in the decays of Z 0 for the decay channels of H + H - →τ + ντ - anti ν, H + H - →τνcs and H + H - →canti santi cs. The data sample analyzed corresponds to approximately 50 000 hadronic decays of Z 0 . A lower limit of 36.5 GeV is obtained at the 95% confidence level for the mass of charged Higgs particle, independent of its decay branching ratio. (orig.)

  17. Annual Gaseous Electronics Conference (41st) Held in Minneapolis, Minnesota on 18-21 October 1988

    Science.gov (United States)

    1989-09-01

    IMPEDANCE J. W. Butterbaugh, L. D. Baston and H. H. Sawin E-34. TEMPORAL AND SPATIAL PLASMA POTENTIAL MEASUREMENT IN PARALLEL PLATE RF GLOW DISCHARGE C...DISCHARGES P. J. Hargis, Jr. and K. E. Grecr.’ 10:51 - 11:04 LA-4. CHARACTERIZATION OF CF4 PLASMA KINETICS BY MODULATED POWER RELAXATION L. D. Baston and H. H...No. ECS-8704529 5n, E-33 Measurement and Analysis of RF Glow Discharge Electrical Impedance, J.W. BUTTERBAUGH, L.D. BASTON , and H.H. SAWIN

  18. Tight-binding study of the hole subband structure properties of p-type delta-doped quantum wells in Si by using a Thomas-Fermi-Dirac potential

    International Nuclear Information System (INIS)

    Rodriguez-Vargas, I; Madrigal-Melchor, J; Vlaev, S J

    2009-01-01

    We present the hole subband structure of p-type delta-doped single, double, multiple and superlattice quantum wells in Si. We use the first neighbors sp 3 s' tight-binding approximation including spin for the hole level structure analysis. The parameters of the tight-binding hamiltonian were taken from Klimeck et al. [Klimeck G, Bowen R C, Boykin T B, Salazar-Lazaro C, Cwik T A and Stoica A 2000 Superlattice. Microst. 27 77], first neighbors parameters that give realiable results for the valence band of Si. The calculations are based on a scheme previously proposed and applied to delta-doped quantum well systems [Vlaev S J and Gaggero-Sager L M 1998 Phys. Rev. B 58 1142]. The scheme relies on the incorporation of the delta-doped quantum well potential in the diagonal terms of the tight-binding hamiltonian. We give a detail description of the delta-doped quantum well structures, this is, we study the hole subband structure behavior as a function of the impurity density, the interwell distance of the doped planes and the superlattice period. We also compare our results with the available theoretical and experimental data, obtaining a reasonable agreement.

  19. Calculation of the probability of overlapping one family of nuclear levels with resonances of an independent family

    International Nuclear Information System (INIS)

    Difilippo, F.C.

    1982-01-01

    Calculations of the resonance integrals of particular isotopes in a mixture of isotopes show that the overlapping of the resonances of one isotope by resonances of other isotopes affects the final values of effective cross sections. The same effect might adversely influence those nondestructive techniques which assay fissile materials on the basis of resonance effects. Of relevance for these applications is the knowledge of the probability of overlapping resonances of a family of nuclear levels (class 1) with resonances of an independent family (class 2). For the sequence of class 1 resonances we calculate the probability distribution, p(delta), to find a class 2, first-neighbor resonance at distance (in energy) delta from a class 1 resonance; integration of p(delta) over the average finite width of the resonances would give the aforementioned probability of overlapping. Because a class 1 resonance can have a class 1 or a class 2 resonance as a first neighbor, the resultant p(delta) is not given by the distribution of spacings of the composite family

  20. On the particle-hole symmetry of the fermionic spinless Hubbard model in D=1

    Directory of Open Access Journals (Sweden)

    M.T. Thomaz

    2014-06-01

    Full Text Available We revisit the particle-hole symmetry of the one-dimensional (D=1 fermionic spinless Hubbard model, associating that symmetry to the invariance of the Helmholtz free energy of the one-dimensional spin-1/2 XXZ Heisenberg model, under reversal of the longitudinal magnetic field and at any finite temperature. Upon comparing two regimes of that chain model so that the number of particles in one regime equals the number of holes in the other, one finds that, in general, their thermodynamics is similar, but not identical: both models share the specific heat and entropy functions, but not the internal energy per site, the first-neighbor correlation functions, and the number of particles per site. Due to that symmetry, the difference between the first-neighbor correlation functions is proportional to the z-component of magnetization of the XXZ Heisenberg model. The results presented in this paper are valid for any value of the interaction strength parameter V, which describes the attractive/null/repulsive interaction of neighboring fermions.

  1. The silicon neighborhood across the a-Si:H to {mu}c-Si transition by X-ray absorption spectroscopy (XAS)

    Energy Technology Data Exchange (ETDEWEB)

    Tessler, Leandro R.; Wang Qi; Branz, Howard M

    2003-04-22

    We report a synchrotron X-ray absorption spectroscopy study of the average neighborhood of Si near the transition from a-Si:H to {mu}c-Si on wedge-shaped samples prepared by hot-wire CVD in a chamber using a movable shutter. The thickness of the wedge varies from 30 to 160 nm. Nucleation of {mu}c-Si occurs at a critical thickness of approximately 100 nm. X-Ray absorption was measured at the Si K-edge (1.84 keV) by total electron photoemission yield. The absorption oscillations in the EXAFS region are very similar to all along the wedge. Analysis indicates an average tetrahedral first neighbor shell with radial disorder decreasing with crystallization. In the near-edge (XANES) region multiple scattering effects appear at the onset of crystallinity. Unlike single crystal silicon, these effects involve only double scattering within the first neighbor shell, indicating an ill-formed second shell in {mu}c-Si.

  2. Inducing and manipulating magnetization in 2D zinc–oxide by strain and external voltage

    Science.gov (United States)

    Taivansaikhan, P.; Tsevelmaa, T.; Rhim, S. H.; Hong, S. C.; Odkhuu, D.

    2018-04-01

    Two-dimensional (2D) structures that exhibit intriguing magnetic phenomena such as perpendicular magnetic anisotropy and its switchable feature are of great interests in spintronics research. Herein, the density functional theory studies reveal the critical impacts of strain and external gating on vacancy-induced magnetism and its spin direction in a graphene-like single layer of zinc oxide (ZnO). In contrast to the pristine and defective ZnO with an O-vacancy, the presence of a Zn-vacancy induces significant magnetic moments to its first neighboring O and Zn atoms due to the charge deficit. We further predict that the direction of magnetization easy axis reverses from an in-plane to perpendicular orientation under a practically achievable biaxial compressive strain of only ~1–2% or applying an electric field by means of the charge density modulation. This magnetization reversal is mainly driven by the strain- and electric-field-induced changes in the spin–orbit coupled d states of the first-neighbor Zn atom to a Zn-vacancy. These findings open interesting prospects for exploiting strain and electric field engineering to manipulate magnetism and magnetization orientation of 2D materials.

  3. Tight-binding study of the hole subband structure properties of p-type delta-doped quantum wells in Si by using a Thomas-Fermi-Dirac potential

    Energy Technology Data Exchange (ETDEWEB)

    Rodriguez-Vargas, I; Madrigal-Melchor, J; Vlaev, S J, E-mail: isaac@planck.reduaz.m [Unidad Academica de Fisica, Universidad Autonoma de Zacatecas, Calzada Solidaridad Esquina Con Paseo La Bufa S/N, 98060 Zacatecas, ZAC. (Mexico)

    2009-05-01

    We present the hole subband structure of p-type delta-doped single, double, multiple and superlattice quantum wells in Si. We use the first neighbors sp{sup 3}s' tight-binding approximation including spin for the hole level structure analysis. The parameters of the tight-binding hamiltonian were taken from Klimeck et al. [Klimeck G, Bowen R C, Boykin T B, Salazar-Lazaro C, Cwik T A and Stoica A 2000 Superlattice. Microst. 27 77], first neighbors parameters that give realiable results for the valence band of Si. The calculations are based on a scheme previously proposed and applied to delta-doped quantum well systems [Vlaev S J and Gaggero-Sager L M 1998 Phys. Rev. B 58 1142]. The scheme relies on the incorporation of the delta-doped quantum well potential in the diagonal terms of the tight-binding hamiltonian. We give a detail description of the delta-doped quantum well structures, this is, we study the hole subband structure behavior as a function of the impurity density, the interwell distance of the doped planes and the superlattice period. We also compare our results with the available theoretical and experimental data, obtaining a reasonable agreement.

  4. Data of evolutionary structure change: 1GCVA-2ZLWD [Confc[Archive

    Lifescience Database Archive (English)

    Full Text Available 1GCVA-2ZLWD 1GCV 2ZLW A D -AFTACEKQTIGKIAQVLAKSPEAYGAECLARLFVTHPG...R VQLSGEEKAAVLALWDKV--NEEEVGGEALGRLLVVYPWTQRFFDSFGDLSNPGAVMGNPKVKAHGKKVLHSFGEGVHHLDNLKGTFAALSEL...in>D 2ZLWD FGDLSNPGAVMGNPK 2ZLW D 2ZLWD... 2ZLWD LWDKV--NEEEV H -- H

  5. General/Flag Officer Worldwide Roster, December 1986

    Science.gov (United States)

    1986-12-01

    H O t- ON O o O H 00 H J" 00 00 00 cO H ON O ^r CO t>*- in ITN o o o O vH NO VD vo ^t CO CO CO CO 8 S § § o HHHHHH ^HHHH OOOOOOOOOOO...8 e § u. OS r.% ̂ l^J^,^^ a üJ H (0 O DC UJ a i D -I a O $ a UJ ü o -J < cc UJ z UJ o 8 HHHHHH <MHHr-»r-(HHH...4h-HN r4 r4 r4 T4 CM H O O OOOO o o CM <n t- H o m H H H O O H H O lT\\\\f\\)0 CM CO CO CO CO \\0 CM H H CO 00 CO GO HHHHHH -SON-H OOOOOOCMHHO

  6. Krovavõi pretsedent

    Index Scriptorium Estoniae

    2001-01-01

    Eestis on toime pandud esimene massi-meedia suurärimehe tellimusmõrv. Suhtumisest V. Haitovi mõrva kommenteerivad P. Põiklik, J. Ragrin, N. Solovei, N. Maspanov, A. Zõbin, H. H. Luik, J. Kogan, A. Tõnisson

  7. Hans H. Luik liigutas Julianus Grupi aktsiaid / Kadri Bank

    Index Scriptorium Estoniae

    Bank, Kadri

    2010-01-01

    Krediidihaldus- ja inkassofirma Julianus Grupi aktsiapakk liikus LHV Panga esindajakontole, Julianus Grupi tütarettevõtte Julianus Inkasso aktsiad liikusid finantstagatiskontole. Delfi portaali väitel ostis LHV Pank H. H. Luigelt Julianus Inkasso

  8. (Smith) (Decapoda: Parastacidae)

    African Journals Online (AJOL)

    feeding. R.A. van den Berg,* H.J. Schoonbee and. H.H. du Preez. Research Unit for Aquatic and Terrestrial Ecosystems,. Department of .... crustacean larvae, big protozoa, unicellular algae and clusters of bacteria on ... Habits, functional.

  9. Proceedings of the International Symposium on quantitative description of metal extraction processes

    International Nuclear Information System (INIS)

    Themelis, N.J.

    1991-01-01

    This book contains the proceedings of the H.H. Kellogg International Symposium. Topics include: Extractive metallurgy; Thermochemical phenomena in metallurgy; Thermodynamic modeling of metallurgical processes; and Transport and rate phenomena in metallurgical extraction

  10. Ecohydrology_GoldenHeaher_Data_052316

    Data.gov (United States)

    U.S. Environmental Protection Agency — Table of data used for statistical analyses. This dataset is associated with the following publication: Golden , H., H. Sander, C. Lane , C. Zhao, K. Price, E....

  11. Structural stability of the square flux line lattice in YNi2B2C and LuNi2B2C studied with small angle neutron scattering

    DEFF Research Database (Denmark)

    Eskildsen, M.R.; Gammel, P.L.; Barber, B.P.

    1997-01-01

    We have studied the flux line lattice in YNi2B2C and LuNi2B2C, the nonmagnetic end members of the borocarbide superconductors using small angle neutron scattering and transport. For fields, H parallel to c, we find a square symmetric lattice which disorders rapidly above H/H-c2 similar to 0.2, well...... below the ''peak effect'' at H/H-c2 = 0.9. The results for H/H-c2 controlled by the tilt modulus c(44). For H/H-c2 > 0.2, the disordering appears to be associated with the field dependence of the shear modulus, C-66....

  12. Radiographic and Functional Outcome in Adolescent Idiopathic Scoliosis Operated With Hook/Hybrid Versus All-Pedicle Screw Instrumentation-A Retrospective Study in 149 Patients

    DEFF Research Database (Denmark)

    Ohrt-Nissen, Søren; Hallager, Dennis W; Karbo, Ture

    2017-01-01

    largely replaced H/H in the surgical treatment of AIS but whether a normalized sagittal profile can be obtained with the PS construct is still debated. Additionally, comparative studies assessing HRQL and surgical complications are needed. METHODS: Two consecutive series of surgically treated AIS patients...... were included. Surgical treatment consisted of H/H or low-profile all-PS instrumentation. Radiographic and clinical follow-up, including SRS-22r questionnaires, was performed a minimum of two years postoperatively. RESULTS: There were 85 and 64 patients in the H/H and PS group, respectively. The groups...... 4° (p kyphosis was significantly higher in the H/H group (27° ± 11° vs. 22° ± 11° in the PS group) with a mean change in kyphosis of 3° ± 9° versus -3° ± 12...

  13. Fulltext PDF

    Indian Academy of Sciences (India)

    galore) guided by the interests expressed by the selected participants. Selected participants (up to 25) will be provided local hospitality and round trip train fare to Mavelikara (I Class or II Class. AlC) by the shortest route. Research Students who wish to partici- pate may also apply. Last date for receipt of applications: July 31 ...

  14. Capacitated Vehicle Routing with Nonuniform Speeds

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Molinaro, Marco; Nagarajan, Viswanath

    2016-01-01

    is the distance traveled divided by its speed.Our algorithm relies on a new approximate minimum spanning tree construction called Level-Prim, which is related to but different from Light Approximate Shortest-path Trees. We also extend the widely used tour-splitting technique to nonuniform speeds, using ideas from...

  15. Choice of optimal replacement of equipment in the warehouse of the company

    Science.gov (United States)

    Baeva, Silvia; Tomov, Kiril

    2016-12-01

    The aim of this paper is to find an optimal replacement of equipment in the warehouse of the company. Real data for the machines are used and are processed with appropriate software. The mathematical model is made for this problem as problem for the shortest path from graph theory. The solution is made by Bellman's principle.

  16. 77 FR 421 - Drawbridge Operation Regulation; Long Island, New York Inland Waterway From East Rockaway Inlet...

    Science.gov (United States)

    2012-01-05

    ..., mile 6.1, across Narrow Bay, between Smith Point and Fire Island, New York. This temporary final rule..., (76 FR 60733) and that work was unexpectedly delayed. This rule provides a time extension so that the rehabilitation can be completed in the shortest possible time frame. Without this rule the work would have to be...

  17. The active sequence in the acth molecule responsible for inhibition of the extinction of conditioned avoidance behaviour in rats

    NARCIS (Netherlands)

    Greven, H.M.; Wied, D. de

    1967-01-01

    The effect of structural analogues of the N-terminal decapeptide of ACTH on inhibition of extinction of a conditioned avoidance response in rats has been studied. Studies involving the relation between chain length and behavioural activity revealed that the sequence 4–10 is the shortest peptide

  18. STECH,4(1), S/NO 9, FEBRUARY, 2015

    African Journals Online (AJOL)

    ZTE

    2015-02-09

    Feb 9, 2015 ... respond to visual and sound cues on the screen that are generated by ... dictionaries that make the user engage with the content in an active manner. ..... shortest possible run time to his students; Instagram can help him share.

  19. MARRT: Medial Axis biased rapidly-exploring random trees

    KAUST Repository

    Denny, Jory; Greco, Evan; Thomas, Shawna; Amato, Nancy M.

    2014-01-01

    © 2014 IEEE. Motion planning is a difficult and widely studied problem in robotics. Current research aims not only to find feasible paths, but to ensure paths have certain properties, e.g., shortest or safest paths. This is difficult for current

  20. Fulltext PDF

    Indian Academy of Sciences (India)

    IAS Admin

    laws and principles and yield reasonably accurate results. The Course is particularly aimed at teachers teaching at UG/PG level. College/University teachers ... will be intimated through e-mail by 1 May 2016. Selected participants will be provided with local hospitality and round-trip bus/train (III AC) fare by the shortest route.

  1. Fulltext PDF

    Indian Academy of Sciences (India)

    IAS Admin

    2015-08-22

    Aug 22, 2015 ... All experiments verify physical laws and principles and yield reasonably accurate results. The Course is particularly aimed at teachers teaching at UG/PG ... through Email by 26 August 2015. Selected participants will be provided with local hospitality and round-trip bus/train (III AC) fare by the shortest route.

  2. Geodetic achievement and avoidance games for graphs | Haynes ...

    African Journals Online (AJOL)

    Let G = (V,E) be a nontrivial connected graph. For a subset S ⊆ V, the geodesic closure (S) of S is the set of all vertices on geodesics (shortest paths) between two vertices of S. We study the geodetic achievement and avoidance games defined by Buckley and Harary (Geodetic games for graphs, Quaestiones Math.

  3. The Place of Special / Gifted Children in the Universal Basic ...

    African Journals Online (AJOL)

    (e) children with learning disabilities. (f) children with special talents and ... education, create conducive learning environment and eradicate illiteracy in Nigeria in the shortest possible time, Babalola ... that level, type and form of learning needed to build a firm foundation for literacy and numeracy to inculcate basic life skills.

  4. The effect of vitamin E supplementation on the libido and ...

    African Journals Online (AJOL)

    The effect of vitamin E supplementation on the libido and reproductive capacity of Large White boars. ... The 70 IU supplementation of dietary vitamin E per kg diet to pigs resulted in the highest number of mounts, combats, head-kicks and anogenital sniffs with the shortest RT in comparison to the 40 and 0 IU vitamin E ...

  5. The toroidal Hausdorff dimension of 2d Euclidean quantum gravity

    DEFF Research Database (Denmark)

    Ambjorn, Jan; Budd, Timothy George

    2013-01-01

    The lengths of shortest non-contractible loops are studied numerically in 2d Euclidean quantum gravity on a torus coupled to conformal field theories with central charge less than one. We find that the distribution of these geodesic lengths displays a scaling in agreement with a Hausdorff dimension...

  6. Does access to invasive examination and treatment influence socioeconomic differences in case fatality for patients admitted for the first time with non-ST-elevation myocardial infarction or unstable angina?

    DEFF Research Database (Denmark)

    Mårtensson, Solvej; Gyrd-Hansen, Dorte; Prescott, Eva

    2016-01-01

    nominal equal access to health care, social inequality in case fatality after NSTEMI and unstable angina exists in Denmark. The patients with the shortest education waited longer for angiography; however, this did not seem to explain inequality in case fatality. This register-based study was approved...

  7. Multi-objective decision-making for soil remediation problems

    NARCIS (Netherlands)

    Drunen, van M.A.; Beinat, E.; Nijboer, M.; Okx, J.P.

    2005-01-01

    After deciding whether or not a soil clean-up operation is necessary, the question remains which remedial strategy and technique should be applied. Traditionally, remediation techniques aim at reaching environmental threshold values within the shortest possible time. There is, however, a growing

  8. Lattice and Molecular Vibrations in Single Crystal I2 at 77 K by Inelastic Neutron Scattering

    DEFF Research Database (Denmark)

    Smith, H. G.; Nielsen, Mourits; Clark, C. B.

    1975-01-01

    Phonon dispersion curves of single crystal iodine at 77 K have been measured by one-phonon coherent inelastic neutron scattering techniques. The data are analysed in terms of two Buckingham-six intermolecular potentials; one to represent the shortest intermolecular interaction (3.5 Å) and the other...

  9. Network features and pathway analyses of a signal transduction cascade

    Directory of Open Access Journals (Sweden)

    Ryoji Yanashima

    2009-05-01

    Full Text Available The scale-free and small-world network models reflect the functional units of networks. However, when we investigated the network properties of a signaling pathway using these models, no significant differences were found between the original undirected graphs and the graphs in which inactive proteins were eliminated from the gene expression data. We analyzed signaling networks by focusing on those pathways that best reflected cellular function. Therefore, our analysis of pathways started from the ligands and progressed to transcription factors and cytoskeletal proteins. We employed the Python module to assess the target network. This involved comparing the original and restricted signaling cascades as a directed graph using microarray gene expression profiles of late onset Alzheimer's disease. The most commonly used method of shortest-path analysis neglects to consider the influences of alternative pathways that can affect the activation of transcription factors or cytoskeletal proteins. We therefore introduced included k-shortest paths and k-cycles in our network analysis using the Python modules, which allowed us to attain a reasonable computational time and identify k-shortest paths. This technique reflected results found in vivo and identified pathways not found when shortest path or degree analysis was applied. Our module enabled us to comprehensively analyse the characteristics of biomolecular networks and also enabled analysis of the effects of diseases considering the feedback loop and feedforward loop control structures as an alternative path.

  10. [Not Available].

    Science.gov (United States)

    Yanashima, Ryoji; Kitagawa, Noriyuki; Matsubara, Yoshiya; Weatheritt, Robert; Oka, Kotaro; Kikuchi, Shinichi; Tomita, Masaru; Ishizaki, Shun

    2009-01-01

    The scale-free and small-world network models reflect the functional units of networks. However, when we investigated the network properties of a signaling pathway using these models, no significant differences were found between the original undirected graphs and the graphs in which inactive proteins were eliminated from the gene expression data. We analyzed signaling networks by focusing on those pathways that best reflected cellular function. Therefore, our analysis of pathways started from the ligands and progressed to transcription factors and cytoskeletal proteins. We employed the Python module to assess the target network. This involved comparing the original and restricted signaling cascades as a directed graph using microarray gene expression profiles of late onset Alzheimer's disease. The most commonly used method of shortest-path analysis neglects to consider the influences of alternative pathways that can affect the activation of transcription factors or cytoskeletal proteins. We therefore introduced included k-shortest paths and k-cycles in our network analysis using the Python modules, which allowed us to attain a reasonable computational time and identify k-shortest paths. This technique reflected results found in vivo and identified pathways not found when shortest path or degree analysis was applied. Our module enabled us to comprehensively analyse the characteristics of biomolecular networks and also enabled analysis of the effects of diseases considering the feedback loop and feedforward loop control structures as an alternative path.

  11. A cut locus for finite graphs and the farthest point mapping

    DEFF Research Database (Denmark)

    Maddaloni, Alessandro; Zamfirescu, Carol T.

    2016-01-01

    We reflect upon an analogue of the cut locus, a notion classically studied in Differential Geometry, for finite graphs. The cut locus C(x) of a vertex x shall be the graph induced by the set of all vertices y with the property that no shortest path between x and z, z≠y, contains y. The cut locus ...

  12. 10 CFR 781.2 - Policy.

    Science.gov (United States)

    2010-01-01

    ... available to the public in the shortest possible time. This may be accomplished by the granting of express... be negotiated on terms and conditions most favorable to the interests of the United States and the general public. (d) No license shall be granted or implied under a DOE invention except as provided for in...

  13. V–V delay interval optimization in CRT using echocardiography compared to QRS width in surface ECG

    Directory of Open Access Journals (Sweden)

    Amr Nawar

    2012-09-01

    Conclusion: Significant correlation appeared to exist during optimization of CRT between VV programming based on the shortest QRS interval at 12-lead ECG pacing and that based on highest LVOT VTI by echocardiography. A combined ECG and echocardiographic approach could be a more convenient solution in performing V–V optimization.

  14. Rancang Bangun Transportasi Logistik Kakao Agroindustri Coklat Kabupaten Pidie Jaya Provinsi Aceh

    Directory of Open Access Journals (Sweden)

    Yusriana Yusriana

    2013-02-01

    Full Text Available Factual problems of the cocoa bean agroindustry at Pidie Jaya District, Aceh Province were large distances between farmers and processor, thus determining the shortest part route, backhaul location and quality risk becomes critically to the assess. The objective this research are to determine shortest route based on the location of suppliers, back location, and risk quality recommendations. Requirement of shortest part route solved by Algorithm Djisktra, Backhaul location with MPE and Risk management quality by Multi Expert Multi Criteria Decision Making, aggregation criteria with OWA. The result of the study shows that the shortest distance suppliers Aceh Timur District was 282km, Aceh Utara District 116km, Bireuen District 57km, Pidie District 24km and Aceh Tenggara District 391km. Backhaul location sat Aceh Tengah District with a value of MPE(6533. Alternative of quality risk management were direct fermentation, improvement of transport facilities and container with a high rating criteria, thus the agroindustry has to focus on this dimension.

  15. The Impact of Culture: Communicating with Iran

    Science.gov (United States)

    2009-03-01

    respect to their dealings.48 American business/negotiating philosophy is very simple; make as much money or profit as you can in the shortest amount of...Behavior, Conference Report (Tel Aviv: Institute for Policy and Strategy, Interdisciplinary Center Herzliya Lauder School of Government, Diplomacy and

  16. Inactivation of Escherichia coli on blueberries using cold plasma with chemical augmentation inside a partial vacuum

    Science.gov (United States)

    Justification: The mechanism by which cold plasma inactivates pathogens is through the production of free reactive chemical species. Unfortunately, the most reactive chemical species have the shortest half-life. In a vacuum their half-life is believed to be prolonged. Additionally, these reactive sp...

  17. Response of Musa species to macro-propagation. I: Genetic and ...

    African Journals Online (AJOL)

    Days to emergence of the first and fifth plantlet were shortest in 'FHIA 17\\' (a dessert banana hybrid) and longest in 'PITA 25\\' (a plantain hybrid). Emergence of the first three plantlets in landrace plantain ('Agbagba\\') was earlier than in dessert banana landrace ('Nsukka Local\\'). A higher proportion of plantlets excised from ...

  18. Partial Path Column Generation for the ESPPRC

    DEFF Research Database (Denmark)

    Jepsen, Mads Kehlet; Petersen, Bjørn

    This talk introduces a decomposition of the Elementary Shortest Path Problem with Resource Constraints(ESPPRC), where the path is combined by smaller sub paths. We show computational result by comparing different approaches for the decomposition and compare the best of these with existing algorit...

  19. A local search heuristic for the Multi-Commodity k-splittable Maximum Flow Problem

    DEFF Research Database (Denmark)

    Gamst, Mette

    2014-01-01

    , a local search heuristic for solving the problem is proposed. The heuristic is an iterative shortest path procedure on a reduced graph combined with a local search procedure to modify certain path flows and prioritize the different commodities. The heuristic is tested on benchmark instances from...

  20. Oncogenic activation of FOXR1 by 11q23 intrachromosomal deletion-fusions in neuroblastoma

    NARCIS (Netherlands)

    Santo, E. E.; Ebus, M. E.; Koster, J.; Schulte, J. H.; Lakeman, A.; van Sluis, P.; Vermeulen, J.; Gisselsson, D.; Øra, I.; Lindner, S.; Buckley, P. G.; Stallings, R. L.; Vandesompele, J.; Eggert, A.; Caron, H. N.; Versteeg, R.; Molenaar, J. J.

    2012-01-01

    Neuroblastoma tumors frequently show loss of heterozygosity of chromosome 11q with a shortest region of overlap in the 11q23 region. These deletions are thought to cause inactivation of tumor suppressor genes leading to haploinsufficiency. Alternatively, micro-deletions could lead to gene fusion

  1. E-Learning Technologies: Employing Matlab Web Server to Facilitate the Education of Mathematical Programming

    Science.gov (United States)

    Karagiannis, P.; Markelis, I.; Paparrizos, K.; Samaras, N.; Sifaleras, A.

    2006-01-01

    This paper presents new web-based educational software (webNetPro) for "Linear Network Programming." It includes many algorithms for "Network Optimization" problems, such as shortest path problems, minimum spanning tree problems, maximum flow problems and other search algorithms. Therefore, webNetPro can assist the teaching process of courses such…

  2. On a low intensity 241 Am Compton spectrometer for measurement ...

    Indian Academy of Sciences (India)

    In this paper, a new design and construction of a low intensity (100 mCi) 241Am -ray Compton spectrometer is presented. The planar spectrometer is based on a small disc source with the shortest geometry. Measurement of the momentum density of polycrystalline Al is used to evaluate the performance of the new design.

  3. RJHS Vol 4(2).cdr

    African Journals Online (AJOL)

    ABEOLUGBENGAS

    uncomplicated malaria within 24 hours of onset of symptoms. CCMm aims to train ... 3European Center for Disease Prevention and Control Stockholm, Sweden. 4University of .... shortest possible time after development of fever. (6). Most recently a change of name from HMM .... three days. .... This work was presented at.

  4. The Shorth Plot

    NARCIS (Netherlands)

    Einmahl, J.H.J.; Gantner, M.; Sawitzki, G.

    2008-01-01

    The shorth plot is a tool to investigate probability mass concentration. It is a graphical representation of the length of the shorth, the shortest interval covering a certain fraction of the distribution, localized by forcing the intervals considered to contain a given point x. It is easy to

  5. Resonance – Journal of Science Education | Indian Academy of ...

    Indian Academy of Sciences (India)

    The formula for the shortest distance of a point from a linecan be derived in several different ways. Some typical methodsare taught at the elementary (i.e., high-school and juniorcollege) level. However, solving such 'school-book' problemsusing advanced mathematical methods is often overlookedand neglected. This article ...

  6. A verified LLL algorithm

    NARCIS (Netherlands)

    Divasón, Jose; Joosten, Sebastiaan; Thiemann, René; Yamada, Akihisa

    2018-01-01

    The Lenstra-Lenstra-Lovász basis reduction algorithm, also known as LLL algorithm, is an algorithm to find a basis with short, nearly orthogonal vectors of an integer lattice. Thereby, it can also be seen as an approximation to solve the shortest vector problem (SVP), which is an NP-hard problem,

  7. Insensitive versus efficient dynamic load balancing in networks without blocking

    NARCIS (Netherlands)

    Jonckheere, M.

    2006-01-01

    So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing policies such as joining the shortest queue. In the present paper, we turn the attention to networks without blocking. To

  8. Development of new photocatalysts for efficient removal of ethylene

    DEFF Research Database (Denmark)

    Nielsen, Morten Godtfred

    The aim of this thesis has been to remove ethylene/ethene (from here on called ethene because it is shortest) photocatalytically with the primary purpose of preventing fruit ripening during shipping. This has been achieved based on TiO2. The topic has been approached from different angles. The most...

  9. Vehicle Routing With User Generated Trajectory Data

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    Rapidly increasing volumes of GPS data collected from vehicles provide new and increasingly comprehensive insight into the routes that drivers prefer. While routing services generally compute shortest or fastest routes, recent studies suggest that local drivers often prefer routes that are neithe...

  10. A century of trends in adult human height

    DEFF Research Database (Denmark)

    Damsgaard, Camilla Trab; Michaelsen, Kim F.; Molbo, Drude

    2016-01-01

    the century of analysis. The tallest people over these 100 years are men born in the Netherlands in the last quarter of 20th century, whose average heights surpassed 182.5 cm, and the shortest were women born in Guatemala in 1896 (140.3 cm; 135.8-144.8). The height differential between the tallest...

  11. Evaluation of different feeds for optimal growth and survival of parthenogenetic brine shrimp, Artemia

    Digital Repository Service at National Institute of Oceanography (India)

    Sumitra-Vijayaraghavan; Krishnakumari, L.; Royan, J.P.

    intestinalis and Ulva fasciata). Rice bran yielded best growth at an optimal level of 0.1 and 0.5 mg.ml-1 d-1 respectively for 1-4 and 4-8 d old larvae. Rice bran was also the best food for outdoor cultures. Artemia fed rice bran took shortest time to reach...

  12. Efficient graph algorithms

    Indian Academy of Sciences (India)

    Shortest path problems. Road network on cities and we want to navigate between cities. . – p.8/30 ..... The rest of the talk... Computing connectivities between all pairs of vertices good algorithm wrt both space and time to compute the exact solution. . – p.15/30 ...

  13. Fulltext PDF

    Indian Academy of Sciences (India)

    well as hands-on exercises by way of computer analysis and interpretation of data using differen t types of software. Teachers who wish to participate in this Refresher ... provided local hospitality and round trip train fare (three-tier A/C) by the shortest route. Last date for receipt of application: 10 May 2006. --------~--------. 106.

  14. Comparison of neural networks for solving the travelling salesman problem

    NARCIS (Netherlands)

    Maire, La B.F.J.; Mladenov, V.M.

    2012-01-01

    The TSP deals with finding a shortest path through a number of cities. This seemingly simple problem is hard to solve because of the amount of possible solutions. Which is why methods that give a good suboptimal solution in a reasonable time are generally used. In this paper three methods were

  15. Infections and treatment of patients with rheumatic diseases

    DEFF Research Database (Denmark)

    Atzeni, F; Bendtzen, K; Bobbio-Pallavicini, F

    2008-01-01

    , and for the shortest possible time should therefore greatly reduce the risk of infections. Infection is a major co-morbidity in rheumatoid arthritis (RA), and conventional disease-modifying anti-rheumatic drugs (DMARDs) can increase the risk of their occurrence, including tuberculosis. TNF-alpha plays a key role...

  16. Combinatorial optimization networks and matroids

    CERN Document Server

    Lawler, Eugene

    2011-01-01

    Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.

  17. (Electro-) mechanical characteristics of electrostatically driven vacuum encapsulated polysilicon resonators

    NARCIS (Netherlands)

    Tilmans, H.A.C.; Tilmans, H.A.C.; Legtenberg, Rob; Legtenberg, R.; Schurer, H.; Schurer, H.; IJntema, D.J.; Ijntema, D.J.; Elwenspoek, Michael Curt; Fluitman, J.H.J.

    The design, fabrication and performance of vacuum-encapsulated electrostatically driven polysilicon resonating beams, 210-510 μm long, 100 μm wide, and 1.5 μm thick, are described. The shortest beams have a fundamental frequency of 324 kHz, a gauge factor of 2400 and a quality factor of 600 at

  18. COMPARATIVE ANALYSIS AND IMPLEMENTATION OF ...

    African Journals Online (AJOL)

    TransRoute: a web-based vehicle route planning application is proposed in this paper. This application leverages existing input-output (I/O) efficient implementations of shortest path algorithms (SPAs) to implement the proposed system that will fundamentally address the problems experienced in moving people, goods and ...

  19. Integrated remediation of soil and groundwater

    International Nuclear Information System (INIS)

    Dykes, R.S.; Howles, A.C.

    1992-01-01

    Remediation of sites contaminated with petroleum hydrocarbons and other organic chemicals frequently focuses on a single phase of the chemical in question. This paper describes an integrated approach to remediation involving selection of complimentary technologies designed to create a remedial system which achieves cleanup goals in affected media in the shortest possible time consistent with overall environmental protection

  20. An energy-aware engineered control plane for wavelength-routed networks

    DEFF Research Database (Denmark)

    Ricciardi, Sergio; Wang, Jiayuan; Palmieri, Francesco

    2015-01-01

    ' operational expenditures. To face this problem, we propose a single-stage routing and wavelength assignment scheme, based on several network engineering extensions to the Generalised Multi-Protocol Label Switching (GMPLS) control plane protocols, mainly Open Shortest Path First, with new composed metrics...

  1. Short and user-friendly: the development and validation of the Mini-DBQ

    DEFF Research Database (Denmark)

    Martinussen, Laila Marianne; Lajunen, Timo; Møller, Mette

    -order structure further indicates the validity of the DBQ and its theoretical structure. Confirmatory factor analysis (CFA) was used to test the fit (i.e., how well the models explain the data) of the original DBQ versus the fit of the shortest possible DBQ, as well as the presence of a second-order structure...

  2. Traffic Load on Interconnection Lines of Generalized Double Ring Network Structures

    DEFF Research Database (Denmark)

    Pedersen, Jens Myrup; Riaz, Muhammad Tahir; Madsen, Ole Brun

    2005-01-01

    consists of two planar rings, which are easily embedded by fiber or other wired solutions. It is shown that for large N2R structures, the interconnection lines carry notably lower loads than the other lines if shortest-path routing is used, and the effects of two other routing schemes are explored, leading...

  3. Review of A* (A Star Navigation Mesh Pathfinding as the Alternative of Artificial Intelligent for Ghosts Agent on the Pacman Game

    Directory of Open Access Journals (Sweden)

    Moh. Zikky

    2016-08-01

    Full Text Available Shortest pathfinding problem has become a populer issue in Game’s Artificial Intelligent (AI. This paper discussed the effective way to optimize the shortest pathfinding problem, namely Navigation Mesh (NavMesh. This method is very interesting because it has a large area of implementation, especially in games world. In this paper, NavMesh was implemented by using A* (A star algorithm and examined in Unity 3D game engine. A* was an effective algorithm in shortest pathfinding problem because its optimization was made with effective tracing using segmentation line. Pac-Man game was chosen as the example of the shortest pathfinding by using NavMesh in Unity 3D. A* algorithm was implemented on the enemies of Pac-Man (three ghosts,  which path was designed by using NavMesh concept. Thus, the movement of ghosts in catching Pac-Man was the result of this review of the effectiveness of this concept. In further research, this method could be implemented on several optimization programmes, such as Geographic Information System (GIS, robotics, and statistics.

  4. Estimation of Membrane Hydration Status for Standby Proton Exchange Membrane Fuel Cell Systems by Impedance Measurement: First Results on Variable Temperature Stack Characterization

    DEFF Research Database (Denmark)

    Bidoggia, Benoit; Kær, Søren Knudsen

    2013-01-01

    Fuel cells are getting growing interest in both backup systems and electric vehicles. Although these systems are characterized by periods of standby, they must be able to start at any instant in the shortest possible time. However, the membranes of which proton exchange membrane fuel cells are made...

  5. Estimation of membrane hydration status for standby proton exchange membrane fuel cell systems by impedance measurement

    DEFF Research Database (Denmark)

    Bidoggia, Benoit; Rugholt, Mark; Nielsen, Morten Busk

    2014-01-01

    Fuel cells are getting growing interest in both backup systems and electric vehicles. Although these systems are characterized by long periods of inactivity, they must be able to start at any instant in the shortest time. However, the membrane of which PEMFCs are made tends to dry out when...

  6. Complexity in human transportation networks: a comparative analysis of worldwide air transportation and global cargo-ship movements

    Science.gov (United States)

    Woolley-Meza, O.; Thiemann, C.; Grady, D.; Lee, J. J.; Seebens, H.; Blasius, B.; Brockmann, D.

    2011-12-01

    We present a comparative network-theoretic analysis of the two largest global transportation networks: the worldwide air-transportation network (WAN) and the global cargo-ship network (GCSN). We show that both networks exhibit surprising statistical similarities despite significant differences in topology and connectivity. Both networks exhibit a discontinuity in node and link betweenness distributions which implies that these networks naturally segregate into two different classes of nodes and links. We introduce a technique based on effective distances, shortest paths and shortest path trees for strongly weighted symmetric networks and show that in a shortest path tree representation the most significant features of both networks can be readily seen. We show that effective shortest path distance, unlike conventional geographic distance measures, strongly correlates with node centrality measures. Using the new technique we show that network resilience can be investigated more precisely than with contemporary techniques that are based on percolation theory. We extract a functional relationship between node characteristics and resilience to network disruption. Finally we discuss the results, their implications and conclude that dynamic processes that evolve on both networks are expected to share universal dynamic characteristics.

  7. Evaluating CoLiDeS + Pic: The Role of Relevance of Pictures in User Navigation Behaviour

    Science.gov (United States)

    Karanam, Saraschandra; van Oostendorp, Herre; Indurkhya, Bipin

    2012-01-01

    CoLiDeS + Pic is a cognitive model of web-navigation that incorporates semantic information from pictures into CoLiDeS. In our earlier research, we have demonstrated that by incorporating semantic information from pictures, CoLiDeS + Pic can predict the hyperlinks on the shortest path more frequently, and also with greater information scent,…

  8. Robustness of roundabout metering systems (RMS)

    NARCIS (Netherlands)

    Fortuijn, L.G.H.

    2014-01-01

    A simple explorative study shows that roundabouts are too small to be equipped with permanently operating traffic lights. The conclusion of a recent, more detailed study was not fundamentally different to this: at a small two-lane roundabout with four legs and with leg-by-leg control the shortest

  9. Efficiency of indigenous ground phosphate rocks, organic fertilizer ...

    African Journals Online (AJOL)

    ) while the untreated ones were the shortest (55.1cm). In the second cropping, differences in height between plants given the various fertilizer treatments were recorded as early as the 3rd week of growth but there was no difference due to soil ...

  10. Selective attention and the auditory vertex potential. 1: Effects of stimulus delivery rate

    Science.gov (United States)

    Schwent, V. L.; Hillyard, S. A.; Galambos, R.

    1975-01-01

    Enhancement of the auditory vertex potentials with selective attention to dichotically presented tone pips was found to be critically sensitive to the range of inter-stimulus intervals in use. Only at the shortest intervals was a clear-cut enhancement of the latency component to stimuli observed for the attended ear.

  11. Penguins and Plagiarism: Stemming the Tide of Plagiarism in Elementary School

    Science.gov (United States)

    Mitchell, Sara

    2007-01-01

    Plagiarism is on the rise on high school and college campuses. There are many reasons why students tend to plagiarize. One of these is that many students are interested in the shortest possible route through a course. Some students also fear that their writing ability is inadequate. If student plagiarism and lack of academic integrity are…

  12. Local search for Steiner tree problems in graphs

    NARCIS (Netherlands)

    Verhoeven, M.G.A.; Severens, M.E.M.; Aarts, E.H.L.; Rayward-Smith, V.J.; Reeves, C.R.; Smith, G.D.

    1996-01-01

    We present a local search algorithm for the Steiner tree problem in graphs, which uses a neighbourhood in which paths in a steiner tree are exchanged. The exchange function of this neigbourhood is based on multiple-source shortest path algorithm. We present computational results for a known

  13. Banach spaces that realize minimal fillings

    International Nuclear Information System (INIS)

    Bednov, B. B.; Borodin, P. A.

    2014-01-01

    It is proved that a real Banach space realizes minimal fillings for all its finite subsets (a shortest network spanning a fixed finite subset always exists and has the minimum possible length) if and only if it is a predual of L 1 . The spaces L 1 are characterized in terms of Steiner points (medians). Bibliography: 25 titles. (paper)

  14. Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Lenstra, J.K.; Veltman, B.

    1996-01-01

    In 1954, Johnson gave an efficient algorithm for minimizing makespan in a two-machine flow shop; there is no advantage to preemption in this case. McNaughton's wrap-around rule of 1959 finds a shortest preemptive schedule on identical parallel machines in linear time. A similarly efficient algorithm

  15. COM-LOC: A Distributed Range-Free Localization Algorithm in Wireless Networks

    NARCIS (Netherlands)

    Dil, B.J.; Havinga, Paul J.M.; Marusic, S; Palaniswami, M; Gubbi, J.; Law, Y.W.

    2009-01-01

    This paper investigates distributed range-free localization in wireless networks using a communication protocol called sum-dist which is commonly employed by localization algorithms. With this protocol, the reference nodes flood the network in order to estimate the shortest distance between the

  16. Combining Vertex-centric Graph Processing with SPARQL for Large-scale RDF Data Analytics

    KAUST Repository

    Abdelaziz, Ibrahim; Al-Harbi, Mohammad Razen; Salihoglu, Semih; Kalnis, Panos

    2017-01-01

    , but not both. We bridge the gap by introducing Spartex, a versatile framework for complex RDF analytics. Spartex extends SPARQL to support programs that combine seamlessly generic graph algorithms (e.g., PageRank, Shortest Paths, etc.) with SPARQL queries

  17. A Hybrid 3D Path Planning Method for UAVs

    DEFF Research Database (Denmark)

    Ortiz-Arroyo, Daniel

    2015-01-01

    This paper presents a hybrid method for path planning in 3D spaces. We propose an improvement to a near-optimal 2D off-line algorithm and a flexible normalized on-line fuzzy controller to find shortest paths. Our method, targeted to low altitude domains, is simple and efficient. Our preliminary resu...

  18. Enabling obstacle avoidance for Google maps' navigation service

    NARCIS (Netherlands)

    Nedkov, S.; Zlatanova, S.

    2011-01-01

    City infrastructures are sensitive to disasters. To aid rescue workers and citizens, a system is needed which determines the shortest route to a certain location, taking the damages of the infrastructure into account. The biggest disadvantage of current navigation systems is that they are “closed”

  19. Chinese Enterprises' Overseas M&A Spree

    Institute of Scientific and Technical Information of China (English)

    State-owned Enterprise Magazine

    2010-01-01

    @@ Merger and acquisition is the most important move and shortest cut in an enterprise's growth strategy to expand itself. George Stigler, a famous American economist, once said that there was not a large American enterprise that did not grow up through merger and acquisition to some extent in some way, and almost no large companies grew up by internal accumulation.

  20. Nearby Search Indekos Based Android Using A Star (A*) Algorithm

    Science.gov (United States)

    Siregar, B.; Nababan, EB; Rumahorbo, JA; Andayani, U.; Fahmi, F.

    2018-03-01

    Indekos or rented room is a temporary residence for months or years. Society of academicians who come from out of town need a temporary residence, such as Indekos or rented room during their education, teaching, or duties. They are often found difficulty in finding a Indekos because lack of information about the Indekos. Besides, new society of academicians don’t recognize the areas around the campus and desire the shortest path from Indekos to get to the campus. The problem can be solved by implementing A Star (A*) algorithm. This algorithm is one of the shortest path algorithm to a finding shortest path from campus to the Indekos application, where the faculties in the campus as the starting point of the finding. Determination of the starting point used in this study aims to allow students to determine the starting point in finding the Indekos. The mobile based application facilitates the finding anytime and anywhere. Based on the experimental results, A* algorithm can find the shortest path with 86,67% accuracy.

  1. Craniofacial Morphology and Growth Comparisons in Children With Robin Sequence, Isolated Cleft Palate, and Unilateral Complete Cleft Lip and Palate

    DEFF Research Database (Denmark)

    Hermann, N. V.; Kreiborg, S.; Darvann, Tron Andre

    2003-01-01

    and posterior height, wide nasal cavity, short mandible, bimaxillary retrognathia, and reduced pharyngeal airway. The shortest mandible was found in RS followed by ICP and UCCLP; the pharyngeal airway was reduced in RS and ICP, compared with UCCLP; and the maxillary complex and nasal cavity were wider in UCCLP...

  2. Intragenomic diversity and geographical adaptability of diploid ...

    African Journals Online (AJOL)

    SERVER

    2007-06-18

    Jun 18, 2007 ... The longest chromosome length ranged between 2.4 - 5.03. µm, and the shortest chromosome length ranged from 1.2 to 2.23 µm. Chromosome volume ranged from 4.37 µm3. (Mahallat landrace) to 9.32 µm3 (in Mehrize Bah. and. Sabzevar 60-1). Pearson coefficient for total length of the chromosomes.

  3. A new technique for accelerating routing information process in ...

    African Journals Online (AJOL)

    Previous works on the shortest path are limited to sequential and parallel algorithms on general-purpose architectures. Researchers are increasingly interested in hardware's solutions. In this work , we propose an approach for implementing a routing algorithm which is effective than Dijkstra using a FPGA development ...

  4. Development of the PEBLebl Traveling Salesman Problem Computerized Testbed

    Science.gov (United States)

    Mueller, Shane T.; Perelman, Brandon S.; Tan, Yin Yin; Thanasuan, Kejkaew

    2015-01-01

    The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding the shortest path through a set of points ("cities") that returns to the starting point. Because humans provide heuristic near-optimal solutions to Euclidean versions of the problem, it has sometimes been used to investigate human visual…

  5. 76 FR 23794 - Stock Status Determination for Atlantic Highly Migratory Scalloped Hammerhead Shark

    Science.gov (United States)

    2011-04-28

    ...) published in the North American Journal of Fisheries Management a stock assessment of the Atlantic... conservation and management measures to rebuild overfished stocks within 2 years of making this determination... to rebuilding the fishery within the shortest time possible in accordance with 16 U.S.C. 1854(e)(4...

  6. Integrated emerging contractor development model for the construction industry: practical implementation and statistical quantification

    CSIR Research Space (South Africa)

    Hauptfleisch, Dries

    2007-05-01

    Full Text Available , in the shortest possible time. An empowered model has thus been created to ensure the rapid development of emerging construction contractors. This model has a sound theoretical base, is supported by extensive filed research and has been introduced in practice...

  7. Load Balancing Routing with Bounded Stretch

    Directory of Open Access Journals (Sweden)

    Chen Siyuan

    2010-01-01

    Full Text Available Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routing method, called Circular Sailing Routing (CSR, which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by a newly defined "circular distance" on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network, the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path. We also extend CSR to a localized version, Localized CSR, by modifying greedy routing without any additional communication overhead. In addition, we investigate how to design CSR routing for 3D networks. For all proposed methods, we conduct extensive simulations to study their performances and compare them with global shortest path routing or greedy routing in 2D and 3D wireless networks.

  8. Science Academies' Refresher Course in Plant Taxonomy and ...

    Indian Academy of Sciences (India)

    Selected participants will be provided with round-trip bus/train (III AC) fare by the shortest route and local hospitality during the course in addition to course material. Interested applicants must submit their application ONLINE by clicking on the following link. http://web-japps.ias.ac.in:8080/Refreshcourse/RPPP.jsp. A copy of ...

  9. Pathfinding in graph-theoretic sabotage models. I. Simultaneous attack by several teams

    International Nuclear Information System (INIS)

    Hulme, B.L.

    1976-07-01

    Graph models are developed for fixed-site safeguards systems. The problem of finding optimal routes for several sabotage teams is cast as a problem of finding shortest paths in a graph. The motivation, rationale, and interpretation of the mathematical models are discussed in detail, and an algorithm for efficiently solving the associated path problem is described

  10. Quality Management in the Design of TLC Call Centers

    Directory of Open Access Journals (Sweden)

    Andrea Fronzetti Colladon

    2013-09-01

    typically larger than those spent waiting for a human agent and to excessively long announcements, with a negative impact on the overall QoS. Imbalances in the popularity of the services offered by the IVR can be exploited to reduce remarkably the average service time, by properly matching the most popular services with the shortest service times.

  11. The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches

    DEFF Research Database (Denmark)

    Petersen, Hanne Løhmann; Madsen, Oli B.G.

    2009-01-01

    This paper introduces the double travelling salesman problem with multiple stacks and presents four different metaheuristic approaches to its solution. The double TSP with multiple stacks is concerned with determining the shortest route performing pickups and deliveries in two separated networks...

  12. The establishment of vegetation in civil engineering work | G ...

    African Journals Online (AJOL)

    Wherever civil engineering construction is carried out soil is denuded of vegetation. To prevent soil erosion these areas must be revegetated in the shortest possible time. Recently advances have been made with methods of spraying seed into steep banks - called hydroseeding, and with soil stabilizing materials. Plastics ...

  13. Clinical Trials

    Medline Plus

    Full Text Available ... As a result, the U.S. Food and Drug Administration now recommends never using HT to prevent heart disease. When HT is used for menopausal symptoms, it should be taken only at the smallest dose and for the shortest time possible. Clinical trials, like the two described above, ...

  14. R.T. Naude

    African Journals Online (AJOL)

    and which has been produced with the minimum amount of feed in the shortest possible time, ... the maximum amount of muscle or lean. In short there- fore, it is the .... masking effect of the mass and length measurements of bones as well as ...

  15. Optimal event handling by multiple unmanned aerial vehicles

    NARCIS (Netherlands)

    de Roo, Martijn; Frasca, Paolo; Carloni, Raffaella

    This paper proposes a control architecture for a fleet of unmanned aerial vehicles that is responsible for handling the events that take place in a given area. The architecture guarantees that each event is handled by the required number of vehicles in the shortest time, while the rest of the fleet

  16. Application of supernetworks in modeling activity-travel behaviour

    NARCIS (Netherlands)

    Liao, F.; Arentze, T.A.; Timmermans, H.J.P.

    2011-01-01

    Network representation and optimization has for long been applied to address vast engineering and scientific problems. Examples are originated from the Seven Bridges of Konigsberg, to a variety of classic P and NP-hard problems such minimum spanning tree, shortest path, and traveling salesman

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

    DEFF Research Database (Denmark)

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

    2014-01-01

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

  18. Vitamin G : Green environments - Healthy environments

    NARCIS (Netherlands)

    Maas, J.

    2009-01-01

    The shortest summary of the thesis is in its title “Vitamin G”, where the G stands for the green space around us and Vitamin stands for the possible positive relationship between green space and people’s health. In the first part of this thesis we investigate whether green space in people’s living

  19. Maximizing the peak production rate in off-line comprehensive two-dimensional liquid chromatography with mass spectrometry detection

    NARCIS (Netherlands)

    Eeltink, S.; Dolman, S.; Ursem, M.; Swart, R.; McLeod, F.; Schoenmakers, P.J.

    2009-01-01

    This article describes an optimization strategy to obtain the best possible performance in the shortest analysis time—called the peak production rate—for comprehensive off-line two-dimensional liquid chromatography. The demands on column technology (particle size and column length) and LC conditions

  20. Faktorer af betydning for tidlig og sen indlaeggelse af patienter med apopleksi og transitorisk cerebral iskaemi

    DEFF Research Database (Denmark)

    Rasmussen, Berit H; Germer, Ulla; Kammersgaard, Lars Peter

    2003-01-01

    predictors of early admission. DISCUSSION: Patients with stroke or TIA in a Danish metropolitan area arrive at hospital a median of 2.6 hours after the stroke. Admission by ambulance after calling emergency was associated with the shortest onset to admission time. Udgivelsesdato: 2003-Jan-13...

  1. The Spider and the Fly

    Science.gov (United States)

    Mellinger, Keith E.; Viglione, Raymond

    2012-01-01

    The Spider and the Fly puzzle, originally attributed to the great puzzler Henry Ernest Dudeney, and now over 100 years old, asks for the shortest path between two points on a particular square prism. We explore a generalization, find that the original solution only holds in certain cases, and suggest how this discovery might be used in the…

  2. Non-homogeneous Behaviour of the Spatial Distribution of ...

    Indian Academy of Sciences (India)

    Hungarian Academy of Sciences, Debrecen, P.O. Box 30, H-4010, Hungary. ... between the active longitude (determined by sunspot groups) and the lon- ... They are explosive jet-like features extending up to, on average, 29 Mm .... means, this quantity represents the shortest phase difference between the longitudinal.

  3. On the relationship between travel time and travel distance of commuters

    NARCIS (Netherlands)

    Rietveld, P.; Zwart, A.P.; Wee, van G.P.; Hoorn, van der T.

    1999-01-01

    This paper gives a detailed empirical analysis of the relationships between different indicators of costs of commuting trips by car: difference as the crow flies, shortest travel time according to route planner, corresponding travel distance, and reported travel time. Reported travel times are

  4. On the relationship between travel time and travel distance in the Netherlands

    NARCIS (Netherlands)

    Rietveld, P.; Zwart, B.; van Wee, B.; van der Hoorn, A.I.J.M.

    1999-01-01

    This paper gives a detailed empirical analysis of the relationships between different indicators of costs of commuting trips by car: difference as the crow flies, shortest travel time according to route planner, corresponding travel distance, and reported travel time. Reported travel times are

  5. From Fermat principle to wave equation - quantization of 'particle mechanics of light'

    International Nuclear Information System (INIS)

    Ogawa, Naohisa

    2004-01-01

    The Fermat principle states that light chooses the temporally shortest path. The action for this 'motion' is the observed time, and it has no Lorentz invariance. In this Letter we show how this action can be obtained from a relativistic action of massive particle, and how the classical wave equation of light can be obtained from this action

  6. Competitive Survival of Escherichia coli, Vibrio cholerae, Salmonella typhimurium and Shigella dysenteriae in Riverbed Sediments

    CSIR Research Space (South Africa)

    Abia, AL

    2016-11-01

    Full Text Available °C, only E. coli and S. typhimurium survived throughout the 28 experimental days. V. cholerae had the shortest survival time at this temperature and was not detected in any of the sediment chambers 24 h after inoculation. S. dysenteriae only survived...

  7. Resonance – Journal of Science Education | Indian Academy of ...

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education. Bhalchandra W Gore. Articles written in Resonance – Journal of Science Education. Volume 22 Issue 7 July 2017 pp 705-714 Classroom. On Finding the Shortest Distance of a Point From a Line: Which Method Do You Prefer? Bhalchandra W Gore · More Details ...

  8. Efficient Guiding Towards Cost-Optimality in Uppaal

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Fehnker, Ansgar; Hune, Thomas S.

    2001-01-01

    with prices on both locations and transitions. The presented algorithm is based on a symbolic semantics of UTPA, and an efficient representation and operations based on difference bound matrices. In analogy with Dijkstra’s shortest path algorithm, we show that the search order of the algorithm can be chosen...

  9. The world according to MARP

    NARCIS (Netherlands)

    Ter Mors, A.W.

    2010-01-01

    In multi-agent route planning (MARP), there is a set of agents each with a start location and a destination location on a shared infrastructure, and the goal of each agent is to reach its destination in the shortest possible time, without coming into conflict (e.g. because of a collision) with any

  10. Starting Point: A Proposed Framework for Unconventional Warfare Planning

    Science.gov (United States)

    2014-06-01

    level Regime Change? Communist Forces Gov’t 1958 Anti Communist Rebels Pathet Lao 1958– 1960 M M H H H M Y Anti Communist Rebels Iraqi...1979 Cambodia 1980 North Korea 1951 Guatemala 1954 Indonesia 1956 Laos 1958 Dominican Republic 1961 Cuba 1962 Vietnam 1963 Chile 1970...leader of China and the Chinese Nationalist Party, had joined forces with the communist insurgency inside his country, led by Mao Tse - Tung, to defeat

  11. The four-body system made up of hydrogen and antihydrogen

    International Nuclear Information System (INIS)

    Armour, E.A.G.; Chamberlain, C.W.

    2002-01-01

    In view of current interest in the trapping of antihydrogen (H) atoms at low temperatures, we have investigated the reasons for considering that H-H does not have a bound state. We go on to carry out a four-body variational calculation for s-wave hydrogen-antihydrogen scattering, using the Kohn variational method. This is a continuation of earlier work on H-H interactions. Refs. 21 (author)

  12. Experimental study on negative hydrogen ion formation in the quiescent plasma machine at INPE

    International Nuclear Information System (INIS)

    Ferreira, J.L.; Ferreira, J.G.; Damasio, W.C.

    1989-01-01

    The preliminary results from the study on generation of positive and negative hydrogen ions in plasma produced by thermionic discharge confined superficially by magnetic fields, are presented. In the interior of this discharge was inserted a Langmuir electrostatic probe to measure H - , H + , H + 2 and H + 3 concentrations in the plasma produced from argon (Ar) and hydrogen (H 2 ) gas mixture. (M.C.K.) [pt

  13. 144 Sanchita Hati and Dipankar Datta

    Indian Academy of Sciences (India)

    Lit is a hard (h) acid, Cs" a soft (s) acid, F a hard base and I a soft base. Li+ i + Cst F = Lit F + Cs"I AH = - 12.1 kcal mol. (1) h S S h h h s is. As indicated by the AH value, reaction (1) proceeds in a direction where h binds hand s binds s, in conformity with the HSAB principle. This principle can be said to be the first step ...

  14. Structure-Based Prediction of Subtype Selectivity of Histamine H3 Receptor Selective Antagonists in Clinical Trials

    DEFF Research Database (Denmark)

    Kim, Soo-Kyung; Fristrup, Peter; Abrol, Ravinder

    2011-01-01

    applications, including treatment of Alzheimer’s disease, attention deficit hyperactivity disorder (ADHD), epilepsy, and obesity.(1) However, many of these drug candidates cause undesired side effects through the cross-reactivity with other histamine receptor subtypes. In order to develop improved selectivity...... and antagonists. We find that E2065.46 contributes most in binding H3 selective agonists (5, 6, 7) in agreement with experimental mutation studies. We also find that conserved E5.46/S5.43 in both of hH3HR and hH4HR are involved in H3/ H4 subtype selectivity. In addition, we find that M3786.55 in hH3HR provides...... additional hydrophobic interactions different from hH4HR (the corresponding amino acid of T3236.55 in hH4HR) to provide additional subtype bias. From these studies, we developed a pharmacophore model based on our predictions for known hH3HR selective antagonists in clinical study [ABT-239 1, GSK-189,254 2...

  15. Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail.

    Science.gov (United States)

    Teichroeb, Julie Annette; Smeltzer, Eve Ann

    2018-01-01

    Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP demands a return to the start, while the SPP does not. Vervet monkeys are very efficient in solving TSPs but this species is a multiple central place forager that does not always return to the same sleeping site and thus theoretically should be selected to find solutions to SPPs rather than TSPs. We examined path choice by wild vervets in an SPP experimental array where the shortest paths usually differed from those consistent with common heuristic strategies, the nearest-neighbor rule (NNR-go to the closest resource that has not been visited), and the convex hull (put a mental loop around sites, adding inner targets in order of distance from the edge)-an efficient strategy for TSPs but not SPPs. In addition, humans solving SPPs use an initial segment strategy (ISS-choose the straightest path at the beginning, only turning when necessary) and we looked at vervet paths consistent with this strategy. In 615 trials by single foragers, paths usually conformed to the NNR and rarely the slightly more efficient convex hull, supporting that vervets may be selected to solve SPPs. Further, like humans solving SPPs, vervets showed a tendency to use the ISS. Paths consistent with heuristics dropped off sharply, and use of the shortest path increased, when heuristics led to longer paths showing trade-offs in efficiency versus cognitive load. Two individuals out of 17, found the shortest path most often, showing inter-individual variation in path planning. Given support for the NNR and the ISS, we propose a new rule-of-thumb termed the "region heuristic" that vervets may apply in multi-destination routes.

  16. Implementasi Algoritma Best-First Search (BeFS pada Penyelesaian Traveling Salesman Problem (TSP (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta

    Directory of Open Access Journals (Sweden)

    Muchammad Abrori

    2015-10-01

    Full Text Available Yogyakarta offers many tourist attractions, from nature based tourism, culinary tourism until cultural tourism. With so many tourist attractions offered by Yogyakarta, tourist often finds it difficult to arrange their travel schedule (from choosing which tourist attractions to be visited until choosing which route tourist should takes to maximize their vacation time. Therefore, it’s required to have a way to determine the shortest tour route so tourist can make their tour in the Yogyakarta effective. This problem can be categorized as Traveling Salesman Problem (TSP case. There are a lot of methods can be used to find the shortest route in Travelling Salesman Problems (TSP case. To solve the problem, which is to find the shortest tour route in Yogyakarta, Algorithm Best-First Travelling will be used in this undergraduate thesis. The implementation of Algorithm Best-First Search to find the shortest tour route in Yogyakarta can be used to produce a solution for tourist to choose the shortest tour package and decide which route they should take. The premium tour package produces tour route from Adi Sucipto Airport-Gembira Loka Zoo- Purawisata-N’dalem Gamelan Hotel-Yogyakarta Palace-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Adi Sucipto Airport with distance covered 20.297 meter. The middle tour package produces tour route from Tugu railway station-Benteng Vredeburg Museum- Taman Pintar-Yogyakarta Palace-Mawar Asri Hotel-Tamansari-Purawisata-Gembira Loka Zoo-Tugu railway station with distance covered 11.772 meter. The economy tour package produces tour route from Giwangan bus station- Gembira Loka zoo-Purawisata-Yogyakarta Palace-Mitra Hotel-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Giwangan bus station with distance covered 14.037 meter.

  17. Predicted bond length variation in wurtzite and zinc-blende InGaN and AlGaN alloys

    International Nuclear Information System (INIS)

    Mattila, T.; Zunger, A.

    1999-01-01

    Valence force field simulations utilizing large supercells are used to investigate the bond lengths in wurtzite and zinc-blende In x Ga 1-x N and Al x Ga 1-x N random alloys. We find that (i) while the first-neighbor cation endash anion shell is split into two distinct values in both wurtzite and zinc-blende alloys (R Ga-N 1 ≠R In-N 1 ), the second-neighbor cation endash anion bonds are equal (R Ga-N 2 =R In-N 2 ). (ii) The second-neighbor cation endash anion bonds exhibit a crucial difference between wurtzite and zinc-blende binary structures: in wurtzite we find two bond distances which differ in length by 13% while in the zinc-blende structure there is only one bond length. This splitting is preserved in the alloy, and acts as a fingerprint, distinguishing the wurtzite from the zinc-blende structure. (iii) The small splitting of the first-neighbor cation endash anion bonds in the wurtzite structure due to nonideal c/a ratio is preserved in the alloy, but is obscured by the bond length broadening. (iv) The cation endash cation bond lengths exhibit three distinct values in the alloy (Ga endash Ga, Ga endash In, and In endash In), while the anion endash anion bonds are split into two values corresponding to N endash Ga endash N and N endash In endash N. (v) The cation endash related splitting of the bonds and alloy broadening are considerably larger in InGaN alloy than in AlGaN alloy due to larger mismatch between the binary compounds. (vi) The calculated first-neighbor cation endash anion and cation endash cation bond lengths in In x Ga 1-x N alloy are in good agreement with the available experimental data. The remaining bond lengths are provided as predictions. In particular, the predicted splitting for the second-neighbor cation endash anion bonds in the wurtzite structure awaits experimental testing. copyright 1999 American Institute of Physics

  18. The Ultimatum Game in complex networks

    International Nuclear Information System (INIS)

    Sinatra, R; Gómez-Gardeñes, J; Latora, V; Iranzo, J; Floría, L M; Moreno, Y

    2009-01-01

    We address the problem of how cooperative (altruistic-like) behavior arises in natural and social systems by analyzing an Ultimatum Game in complex networks. Specifically, players of three types are considered: (a) empathetic, whose aspiration levels, and offers, are equal, (b) pragmatic, who do not distinguish between the different roles and aim to obtain the same benefit, and (c) agents whose aspiration levels, and offers, are independent. We analyze the asymptotic behavior of pure populations with different topologies using two kinds of strategic update rules: natural selection, which relies on replicator dynamics, and social penalty, inspired by the Bak–Sneppen dynamics, in which players are subject to a social selection rule penalizing not only the less fit individuals, but also their first neighbors. We discuss the emergence of fairness in the different settings and network topologies

  19. The hard-core model on random graphs revisited

    International Nuclear Information System (INIS)

    Barbier, Jean; Krzakala, Florent; Zhang, Pan; Zdeborová, Lenka

    2013-01-01

    We revisit the classical hard-core model, also known as independent set and dual to vertex cover problem, where one puts particles with a first-neighbor hard-core repulsion on the vertices of a random graph. Although the case of random graphs with small and very large average degrees respectively are quite well understood, they yield qualitatively different results and our aim here is to reconciliate these two cases. We revisit results that can be obtained using the (heuristic) cavity method and show that it provides a closed-form conjecture for the exact density of the densest packing on random regular graphs with degree K ≥ 20, and that for K > 16 the nature of the phase transition is the same as for large K. This also shows that the hard-code model is the simplest mean-field lattice model for structural glasses and jamming

  20. Short-range disorder in pseudobinary ionic alloys

    International Nuclear Information System (INIS)

    Di Cicco, Andrea; Principi, Emiliano; Filipponi, Adriano

    2002-01-01

    The short-range distribution functions of the RbBr 1-x I x solid and molten ionic alloys have been accurately measured using multiple-edge refinement of the K-edge extended x-ray absorption fine structure spectra (EXAFS). The local structure is characterized by two well-defined first-neighbor peaks associated with the Rb-I and Rb-Br distributions, both for solid and liquid alloys. The distribution of distances in solid alloys gives experimental evidence to available theoretical models. In the liquid, the two distance distributions are found to be practically independent of the concentration x. The effect of different effective charge screening of the ions is observed in the molten systems for limiting concentrations

  1. Dielectric discontinuity at interfaces in the atomic-scale limit: permittivity of ultrathin oxide films on silicon.

    Science.gov (United States)

    Giustino, Feliciano; Umari, Paolo; Pasquarello, Alfredo

    2003-12-31

    Using a density-functional approach, we study the dielectric permittivity across interfaces at the atomic scale. Focusing on the static and high-frequency permittivities of SiO2 films on silicon, for oxide thicknesses from 12 A down to the atomic scale, we find a departure from bulk values in accord with experiment. A classical three-layer model accounts for the calculated permittivities and is supported by the microscopic polarization profile across the interface. The local screening varies on length scales corresponding to first-neighbor distances, indicating that the dielectric transition is governed by the chemical grading. Silicon-induced gap states are shown to play a minor role.

  2. The N-terminal domain determines the affinity and specificity of H1 binding to chromatin

    International Nuclear Information System (INIS)

    Öberg, Christine; Belikov, Sergey

    2012-01-01

    Highlights: ► wt Human histone H1.4 and hH1.4 devoid of N-terminal domain, ΔN-hH1.4, were compared. ► Both histones bind to chromatin, however, ΔN-hH1.4 displays lower binding affinity. ► Interaction of ΔN-hH1.4 with chromatin includes a significant unspecific component. ► N-terminal domain is a determinant of specificity of histone H1 binding to chromatin. -- Abstract: Linker histone H1, one of the most abundant nuclear proteins in multicellular eukaryotes, is a key component of the chromatin structure mainly due to its role in the formation and maintenance of the 30 nm chromatin fiber. It has a three-domain structure; a central globular domain flanked by a short N-terminal domain and a long, highly basic C-terminal domain. Previous studies have shown that the binding abilities of H1 are at large determined by the properties of the C-terminal domain; much less attention has been paid to role of the N-terminal domain. We have previously shown that H1 can be reconstituted via cytoplasmic mRNA injection in Xenopus oocytes, cells that lack somatic H1. The heterologously expressed H1 proteins are incorporated into in vivo assembled chromatin at specific sites and the binding event is monitored as an increase in nucleosomal repeat length (NRL). Using this setup we have here compared the binding properties of wt-H1.4 and hH1.4 devoid of its N-terminal domain (ΔN-hH1.4). The ΔN-hH1.4 displays a drastically lower affinity for chromatin binding as compared to the wild type hH1.4. Our data also indicates that ΔN-hH1.4 is more prone to unspecific chromatin binding than the wild type. We conclude that the N-terminal domain of H1 is an important determinant of affinity and specificity of H1-chromatin interactions.

  3. In silico modeling techniques for predicting the tertiary structure of human H4 receptor.

    Science.gov (United States)

    Zaid, Hilal; Raiyn, Jamal; Osman, Midhat; Falah, Mizied; Srouji, Samer; Rayan, Anwar

    2016-01-01

    First cloned in 2000, the human Histamine H4 Receptor (hH4R) is the last member of the histamine receptors family discovered so far, it belongs to the GPCR super-family and is involved in a wide variety of immunological and inflammatory responses. Potential hH4R antagonists are proposed to have therapeutic potential for the treatment of allergies, inflammation, asthma and colitis. So far, no hH4R ligands have been successfully introduced to the pharmaceutical market, which creates a strong demand for new selective ligands to be developed. in silico techniques and structural based modeling are likely to facilitate the achievement of this goal. In this review paper we attempt to cover the fundamental concepts of hH4R structure modeling and its implementations in drug discovery and development, especially those that have been experimentally tested and to highlight some ideas that are currently being discussed on the dynamic nature of hH4R and GPCRs, in regards to computerized techniques for 3-D structure modeling.

  4. Predicting the components of the total hemispherical solar radiation from sunshine duration measurements in Lagos, Nigeria

    International Nuclear Information System (INIS)

    Maduekwe, A.A.L.; Chendo, M.A.C.

    1994-06-01

    Correlations for the city of Lagos (latitude 6.58 deg. N, longitude 3.33 deg. E) have been found between the records of bright sunshine hours and the daily and monthly components of the total hemispherical solar radiation. Four new models have been developed which include H/H 0 as a predictor in the Angstrom type models for the diffuse and beam fractions. They contain the quadratic term of the sunshine index, (n/N) and are given as follows: Q/H 0 =a+b(H/H 0 )+c(n/N)+d(n/N) 2 Q/H 0 =a+b(H/H 0 )+d(n/N) 2 ; Q/H 0 =a+b(H/H 0 )+c(n/N)+d(n/N) 2 ; Q/H 0 =a+b(H/H 0 )+d(n/N) 2 ; where Q is the diffuse or beam radiation on a horizontal plane. The statistical test carried out showed that the new equations generally improved the prediction of the beam or diffuse components from the Angstrom type equations by over 25%. (author). 21 refs, 3 tabs

  5. Determination of collective behavior of the financial market.

    Science.gov (United States)

    Li, Shouwei; Xu, Tao; He, Jianmin

    2016-01-01

    In this paper, we adopt the network synchronization to measure the collective behavior in the financial market, and then analyze the factors that affect the collective behavior. Based on the data from the Chinese financial market, we find that the clustering coefficient, the average shortest path length and the volatility fluctuation have a positive effect on the collective behavior respectively, while the average return has a negative effect on it; the effect of the average shortest path length on the collective behavior is the greatest in the above four variables; the above results are robust against the window size and the time interval between adjacent windows of the stock network; the effect of network structures and stock market properties on the collective behavior during the financial crisis is the same as those during other periods.

  6. Perbandingan Algoritma Simulated Annealing dan Harmony Search dalam Penerapan Picking Order Sequence

    Directory of Open Access Journals (Sweden)

    Tanti Octavia

    2017-12-01

    Full Text Available Implementation of mobile rack warehouse is commonly used in manufacturing industry because it can minimize the warehouse area used. Applying picking orders in taking of Stock Keeping Unit (SKU on mobile rack warehouses could give fast loading order. This research aims to find out which algorithm is better in applying picking order sequence in mobile rack warehouse. The algorithm used is Simualted Annealing (SA and Harmony Search (HS algorithm. Both of these algorithms will be compared in terms of the gap with the shortest path method.The result shows that the HS algorithm produces a better solution than the SA algorithm with lower CPU time, but the convergence rate of HS is lower than that of SA.HS was able to produce a better solution than the shortest path method of 9 cases, while SA only 8 cases from 15 cases.

  7. INTERLINE, a railroad routing model: program description and user's manual

    International Nuclear Information System (INIS)

    Peterson, B.E.

    1985-11-01

    INTERLINE is an interactive computer program that finds likely routes for shipments over the US railroad system. It is based on a shortest path algorithm modified both to reflect the nature of railroad company operations and to accommodate computer resource limitations in dealing with a large transportation network. The first section of the report discusses the nature of railroad operations and routing practices in the United States, including the tendency to concentrate traffic on a limited number of mainlines, the competition for traffic by different companies operating in the same corridors, and the tendency of originating carriers to retain traffic on their systems before transferring it to terminating carriers. The theoretical foundation and operation of shortest path algorithms are described, as well as the techniques used to simulate actual operating practices within this framework. The second section is a user's guide that describes the program operation and data structures, program features, and user access. 11 refs., 11 figs

  8. Observations and light curve solutions of four ultrashort-period binaries

    Directory of Open Access Journals (Sweden)

    Kjurkchieva D.

    2016-01-01

    Full Text Available The paper presents light curve solutions of our observations of four new ultrashort-period eclipsing binaries with MS components. Two of them have periods almost at the upper limit (0.22 days of the ultrashort-period binaries, while the periods of around 0.18 days of CSS J171508.5+350658 and CSS J214633.8+120016 are amongst the shortest known orbital periods. CSS J171410.0+ 445850, CSS J214633.8+120016 and CSS J224326.0+154532 are over contact binaries with fill out factors around 0.25 while CSS J171508.5+350658 is a semidetached system. The two targets with shortest periods consist of M dwarfs.

  9. Optimizing Completion Time and Energy Consumption in a Bidirectional Relay Network

    DEFF Research Database (Denmark)

    Liu, Huaping; Sun, Fan; Thai, Chan

    2012-01-01

    consumption required for multiple flows depends on the current channel realizations, transmission methods used and, notably, the relation between the data sizes of different source nodes. In this paper we investigate the shortest completion time and minimal energy consumption in a two-way relay wireless...... arises for the minimal required energy. While the requirement for minimal energy consumption is obvious, the shortest completion time is relevant when certain multi-node network needs to reserve the wireless medium in order to carry out the data exchange among its nodes. The completion time/energy...... network. The system applies optimal time multiplexing of several known transmission methods, including one-way relaying and wireless network coding (WNC). We show that when the relay applies Amplify-and-Forward (AF), both minimizations are linear optimization problems. On the other hand, when the relay...

  10. Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

    Science.gov (United States)

    Hyman, J.; Hagberg, A.; Srinivasan, G.; Mohd-Yusof, J.; Viswanathan, H. S.

    2017-12-01

    We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.

  11. Economic Efficiency and Investment Implementation in Energy Saving Projects

    Directory of Open Access Journals (Sweden)

    Venelin Terziev

    2017-09-01

    Full Text Available Investment in building thermoinsulation is a subject to appraisal for efficiency from the position of discounted cash flows taken specifically by energy saving. The appraisal of investment as optimal is attended by achieving the shortest term for investment implementation, the lowest investment outlays, the maximum total net value of energy savings, the shortest investment payback period. The complex application of the dynamic methods for appraising economic efficiency of an investment – net present value, internal rate of return, profitability index and discounted payback period, involves drawing of particular values which comparison definitely will show if this kind of investment is practically “attractive”. However, the question for significance weight of each of these indicators above in decision making for implementation a particular real investment still remains unsolved. This requires working out a system of criteria, priorities that can determine which of the indicators for economic efficiency of specific investment project will have the highest significance.

  12. An adaptive routing strategy for packet delivery in complex networks

    International Nuclear Information System (INIS)

    Zhang, Huan; Liu, Zonghua; Tang, Ming; Hui, P.M.

    2007-01-01

    We present an efficient routing approach for delivering packets in complex networks. On delivering a message from a node to a destination, a node forwards the message to a neighbor by estimating the waiting time along the shortest path from each of its neighbors to the destination. This projected waiting time is dynamical in nature and the path through which a message is delivered would be adapted to the distribution of messages in the network. Implementing the approach on scale-free networks, we show that the present approach performs better than the shortest-path approach and another approach that takes into account of the waiting time only at the neighboring nodes. Key features in numerical results are explained by a mean field theory. The approach has the merit that messages are distributed among the nodes according to the capabilities of the nodes in handling messages

  13. Walks on SPR neighborhoods.

    Science.gov (United States)

    Caceres, Alan Joseph J; Castillo, Juan; Lee, Jinnie; St John, Katherine

    2013-01-01

    A nearest-neighbor-interchange (NNI)-walk is a sequence of unrooted phylogenetic trees, T1, T2, . . . , T(k) where each consecutive pair of trees differs by a single NNI move. We give tight bounds on the length of the shortest NNI-walks that visit all trees in a subtree-prune-and-regraft (SPR) neighborhood of a given tree. For any unrooted, binary tree, T, on n leaves, the shortest walk takes Θ(n²) additional steps more than the number of trees in the SPR neighborhood. This answers Bryant’s Second Combinatorial Challenge from the Phylogenetics Challenges List, the Isaac Newton Institute, 2011, and the Penny Ante Problem List, 2009.

  14. Standalone Mobile Application for Shipping Services Based on Geographic Information System and A-Star Algorithm

    Science.gov (United States)

    Gunawan, D.; Marzuki, I.; Candra, A.

    2018-03-01

    Geographic Information Systems (GIS) plays an essential role in shipping service related application. By utilizing GIS, the courier can find the route to deliver goods for its customer. This research proposes a standalone mobile application to provide the shortest route to the destinations by utilizing geographic information systems with A-Star algorithm. This application is intended to be used although the area has no Internet network available. The developed application can handle several drop off points then calculates the shortest route that passes through all the drop off points. According to the conducted testing, the number of drop off points that can be calculated is influenced by the specification of the smartphone. More destinations require more smartphone resources and time to process.

  15. Nanosecond-pulsed Q-switched Nd:YAG laser at 1064 nm with a gold nanotriangle saturable absorber

    Science.gov (United States)

    Chen, Xiaohan; Li, Ping; Dun, Yangyang; Song, Teng; Ma, Baomin

    2018-06-01

    Gold nanotriangles (GNTs) were successfully employed as a saturable absorber (SA) to achieve passively Q-switched lasers for the first time. The performance of the Q-switched Nd:YAG laser at 1064 nm has been systematically investigated. The corresponding shortest pulsewidth, the threshold pump power and the maximum Q-switched average output power were 275.5 ns, 1.37 W, and 171 mW, respectively. To our knowledge, this is the shortest pulsewidth and the lowest threshold in a passively Q-switched laser at approximately 1.1 µm based on a gold nanoparticle SA (GNPs-SA). Our experimental results proved that the GNTs-SA can be used as a promising saturable absorber for nanosecond-pulsed lasers.

  16. Epidemic metapopulation model with traffic routing in scale-free networks

    International Nuclear Information System (INIS)

    Huang, Wei; Chen, Shengyong

    2011-01-01

    In this paper, we propose a model incorporating both the traffic routing dynamics and the virus prevalence dynamics. In this model, each packet may be isolated from the network on its transporting path, which means that the packet cannot be successfully delivered to its destination. In contrast, a successful transport means that a packet can be delivered from source to destination without being isolated. The effects of model parameters on the delivery success rate and the delivery failure rate are intensively studied and analyzed. Several routing strategies are performed for our model. Results show that the shortest path routing strategy is the most effective for enhancing the delivery success rate, especially when each packet is only allowed to be delivered to the neighbor with the lowest degree along the shortest path. We also find that, by minimizing the sum of the nodes' degree along the transporting path, we can also obtain a satisfactory delivery success rate

  17. A century of trends in adult human height

    DEFF Research Database (Denmark)

    Damsgaard, Camilla Trab; Michaelsen, Kim F.; Molbo, Drude

    2016-01-01

    in adult height over the past century has occurred in South Korean women and Iranian men, who became 20.2 cm (95% credible interval 17.5-22.7) and 16.5 cm (13.3-19.7) taller, respectively. In contrast, there was little change in adult height in some sub-Saharan African countries and in South Asia over...... the century of analysis. The tallest people over these 100 years are men born in the Netherlands in the last quarter of 20th century, whose average heights surpassed 182.5 cm, and the shortest were women born in Guatemala in 1896 (140.3 cm; 135.8-144.8). The height differential between the tallest...... and shortest populations was 19-20 cm a century ago, and has remained the same for women and increased for men a century later despite substantial changes in the ranking of countries....

  18. Complex proofs of real theorems

    CERN Document Server

    Lax, Peter D

    2011-01-01

    Complex Proofs of Real Theorems is an extended meditation on Hadamard's famous dictum, "The shortest and best way between two truths of the real domain often passes through the imaginary one." Directed at an audience acquainted with analysis at the first year graduate level, it aims at illustrating how complex variables can be used to provide quick and efficient proofs of a wide variety of important results in such areas of analysis as approximation theory, operator theory, harmonic analysis, and complex dynamics. Topics discussed include weighted approximation on the line, Müntz's theorem, Toeplitz operators, Beurling's theorem on the invariant spaces of the shift operator, prediction theory, the Riesz convexity theorem, the Paley-Wiener theorem, the Titchmarsh convolution theorem, the Gleason-Kahane-Żelazko theorem, and the Fatou-Julia-Baker theorem. The discussion begins with the world's shortest proof of the fundamental theorem of algebra and concludes with Newman's almost effortless proof of the prime ...

  19. Optimal parallel algorithms for problems modeled by a family of intervals

    Science.gov (United States)

    Olariu, Stephan; Schwing, James L.; Zhang, Jingyuan

    1992-01-01

    A family of intervals on the real line provides a natural model for a vast number of scheduling and VLSI problems. Recently, a number of parallel algorithms to solve a variety of practical problems on such a family of intervals have been proposed in the literature. Computational tools are developed, and it is shown how they can be used for the purpose of devising cost-optimal parallel algorithms for a number of interval-related problems including finding a largest subset of pairwise nonoverlapping intervals, a minimum dominating subset of intervals, along with algorithms to compute the shortest path between a pair of intervals and, based on the shortest path, a parallel algorithm to find the center of the family of intervals. More precisely, with an arbitrary family of n intervals as input, all algorithms run in O(log n) time using O(n) processors in the EREW-PRAM model of computation.

  20. Improved routing strategies for data traffic in scale-free networks

    International Nuclear Information System (INIS)

    Wu, Zhi-Xi; Peng, Gang; Wong, Wing-Ming; Yeung, Kai-Hau

    2008-01-01

    We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets and the critical packet generation rate (above which packet aggregation occurs in the network). We found that the routing strategies which integrate ingredients of both global and local topological information of the underlying networks perform much better than the traditional shortest path routing protocol taking into account the global topological information only. Moreover, by doing comparative studies with some related works, we found that the performance of our proposed method shows universal efficiency characteristic against the amount of traffic

  1. Improvement of algorithm using Kohonen`s self-organizing feature map for the traveling salesman problem; Kohonen jiko soshikika tokucho mappu wo mochiita ukai serusuman mondai kaiho no kairyo

    Energy Technology Data Exchange (ETDEWEB)

    Fujimura, K.; Tokutaka, H.; Tanaka, H.; Kishida, S. [Tottori Univ., Tottori (Japan); Oshima, Y. [Mita Industrial Co. Ltd., Osaka (Japan)

    1996-02-20

    Traveling salesman problem (TSP) is one of the combinatorial optimization problems. The solution of this problem is to seek the way of how to visit every city only once within the shortest traveling distance. The solutions of this problem are studied a lot hitherto since they are the index for observing the basic properties of optimization algorithm. The method of Angeniol using the elf-organizing feature map is greatly forceful from the viewpoint of its short calculating time. In this study, regarding the algorithm of Angeniol, the conditions of obtaining the shortest tour length within shorter time are examined. Namely, a half of calculating time is reduced by changing Angeniol method into the method of making the node create after the searches of M cities. Additionally, the calculating time for unchanged tour length is reduced to one fourth by adding an inertia item in accordance with the variation of the number of total nodes. 14 refs., 8 figs.

  2. Structural factoring approach for analyzing stochastic networks

    Science.gov (United States)

    Hayhurst, Kelly J.; Shier, Douglas R.

    1991-01-01

    The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

  3. Effect of photoperiods and photointensities on the mass rearing of the olive fruit fly dacus oleae Gmel. (Diptera - Tephritidae)

    International Nuclear Information System (INIS)

    Roushdy, M.M.; Abdel-Rahman, M.A.; El-Moursy, A.A.; Ali, G.M.

    1986-01-01

    The highest mean egg production was produced by females exposed to a photoperiod of 20 hr. On the other hand, the lowest one was obtained when the females were exposed only to a photoperiod of 4 hr. The highest percent hatchability was obtained when the females were exposed to a photoperiod of 16 hr whereas the lowest one was obtained when a photoperiod of 8 hr was applied. Adult males exposed to a photoperiod of 16 hr had the longest mean life span, whereas the shortest one was recorded when a photoperiod of 20 hr was applied. Adult females that were exposed to a photoperiod of 16 hr had the longest mean life span, whereas the shortest one was recorded when females were exposed to a photo period of 4 hr

  4. Sistem Pencarian Hotel Berdasarkan Rute Perjalanan Terpendek Dengan Mempertimbangkan Daya Tarik Wisata Menggunakan Algoritma Greedy

    Directory of Open Access Journals (Sweden)

    Audrey Maximillian Herli

    2015-04-01

    Full Text Available Hotel search was an important thingfor travelers in their traveling journey. Travelers would consider criteria such as class, price and review of the hotel.Beside those things, distance between Hotel and tourist attractionswasalsoimportant factor to be considered. In this research, system was constructed to perform a hotels search by shortest travelling route using Greedy Algorithm. This research was conducted through four stages, the first stage wasdata and information collectingof tourist attraction and hotel. Second stagewasdata analysis with greedy algorithm in purpose to classify the data and implementing greedy algorithm with manual calculation to the problem research. The third stage was the development of the system, and the last stage wasevaluating the system with the experts who are experienced in the field of tourism and the prospective user of this application. Results from this study was the system can provide recommendations and sequence the shortest journey between the hotel and tourist attraction based on the greedy algorithm.

  5. Imaging of Pericardiophrenic Bundles Using Multislice Spiral Computed Tomography for Phrenic Nerve Anatomy.

    Science.gov (United States)

    Wang, Yan-Jing; Liu, Lin; Zhang, Meng-Chao; Sun, Huan; Zeng, Hong; Yang, Ping

    2016-08-01

    Phrenic nerve injury and diaphragmatic stimulation are common complications following arrhythmia ablation and pacing therapies. Preoperative comprehension of phrenic nerve anatomy via non-invasive CT imaging may help to minimize the electrophysiological procedure-related complications. Coronary CT angiography data of 121 consecutive patients were collected. Imaging of left and right pericardiophrenic bundles was performed with volume rendering and multi-planar reformation techniques. The shortest spatial distances between phrenic nerves and key electrophysiology-related structures were determined. The frequencies of the shortest distances ≤5 mm, >5 mm and direct contact between phrenic nerves and adjacent structures were calculated. Left and right pericardiophrenic bundles were identified in 86.8% and 51.2% of the patients, respectively. The right phrenic nerve was phrenic nerve, phrenic nerve was phrenic nerve had a distance phrenic nerve showed a distance phrenic nerve anatomy, which might facilitate avoidance of the phrenic nerve-related complications in interventional electrophysiology. © 2016 Wiley Periodicals, Inc.

  6. Krótkie formy liryczne wobec problemów przedstawiania rzeczywistości

    Directory of Open Access Journals (Sweden)

    Marcin Telicki

    2007-09-01

    Full Text Available An expression "the shortest poem" as a genre term seems to be imprecise, however, both its functioning amongst other literary forms and unstabilised boundaries of the modern genology make it that it is a necessary definition. Outstanding modern poets (Białoszewski, Miłosz, Grochowiak and others, reach for this undefined attractive form, trying to make it a key to the world (hence the problems of mimesis which are discussed in this article and to the other world (category of transgression. What is more "the shortest poems" appear most often in their later work, and minimalisation of the form leads to condensation of meanings (like a sage, they utter fewer words, but important ones. The article is also a point of departure for the discussion on the state of modern culture and condition of man who continuously faces the same fundamental questions.

  7. THE AGGREGATE IMPACT OF ONLINE RETAIL

    OpenAIRE

    Allen Tran

    2014-01-01

    To study the impact of online retail on aggregate welfare, I use a spatial model to calculate a new measure of store level retail productivity and each store's equilibrium response to increased competitive pressure from online retailers. The model is estimated on confidential store-level data spanning the universe of US retail stores, detailed local-level demographic data and shortest-route data between locations. From counterfactual exercises mimicking improvements in shipping and increased ...

  8. First demonstration of InGaP/InAlGaP based orange laser emitting at 608 nm

    KAUST Repository

    Majid, Mohammed Abdul

    2015-06-26

    The fabrication of orange-emitting semiconductor laser on interdiffused InGaP/InAlGaP structure is reported. The lasers lased at 22°C at a wavelength as short as 608 nm with threshold current density of 3.4 KAcm −2 and a maximum output power of ∼46 mW. This is the shortest wavelength electrically pumped semiconductor laser emission from the InGaP/InAlGaP structure.

  9. The high temperature orthorhombic ⇄ hexagonal phase transformation of FeMnP

    Science.gov (United States)

    Chenevier, B.; Soubeyroux, J. L.; Bacmann, M.; Fruchart, D.; Fruchart, R.

    1987-10-01

    The compound FeMnP has the hexagonal Fe 2P structure above 1473K. The metal atoms are disordered. The disorder rate decreases with temperature and at 1413K a transition Hex → Orth. takes place. The low temperature phase is of Co 2P type. A simple transition model is proposed based on the displacement of phosphorus chains along the shortest axis of the structure. The thermal evolution of the orthorhombic cell parameters evidences the strong anisotropy of the bondings.

  10. Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications

    DEFF Research Database (Denmark)

    Wulff-Nilsen, C.

    2011-01-01

    . As corollaries of our results, we get improved algorithms for shortest paths and maximum matching. Furthermore, for integers l and h, we give an O(m + n(2+is an element of)/l) time algorithm that either produces a K(h)-minor of depth O(l log n) or a separator of size at most O(n/l + lh(2) log n). This improves...

  11. An industrial robot singular trajectories planning based on graphs and neural networks

    Science.gov (United States)

    Łęgowski, Adrian; Niezabitowski, Michał

    2016-06-01

    Singular trajectories are rarely used because of issues during realization. A method of planning trajectories for given set of points in task space with use of graphs and neural networks is presented. In every desired point the inverse kinematics problem is solved in order to derive all possible solutions. A graph of solutions is made. The shortest path is determined to define required nodes in joint space. Neural networks are used to define the path between these nodes.

  12. Indications to radical surgical interventions in chondrosarcomas of the limbs

    International Nuclear Information System (INIS)

    Korolev, V.I.

    1988-01-01

    On the basis of analysis carried out in treatment of 229 patients suffering from chondrosarcomas of the limbs it is established that radical surgical intervention in bulk of amputation or exarticulation is the choice of the treatment method at the 3d clinical stage of disease. Sex does not influence the chondrosarcomas prognosis. 20-years age patients have the shortest life-time after operation. Radiotherapy and chemotherapy does not improve the results of surgical treatment

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

  14. ACT OF IMPLEMENTATION OF TOYOTA SYSTEM

    OpenAIRE

    Damjan Stanojević; Slobodan Stefanović; Branislav Stanisavljević; Dragoslav Ilić

    2013-01-01

    The production system developed by Toyota Motor Corporation was developed to provide best quality, lowest costs, and shortest lead time through the elimination of losts. Kiichiro Toyota, son of Sakichi and founder of the Toyota automobile factory, developed the concept of Just-in-Time in the 1930's. He decreed that by this act Toyota would contain no excess inventory and that Toyota would strive to work both in partnership with suppliers and level production. The Toyot...

  15. Heuristic Solution Approaches to the Double TSP with Multiple Stacks

    DEFF Research Database (Denmark)

    Petersen, Hanne Løhmann

    This paper introduces the Double Travelling Salesman Problem with Multiple Stacks and presents a three different metaheuristic approaches to its solution. The Double Travelling Salesman Problem with Multiple Stacks is concerned with finding the shortest route performing pickups and deliveries in ...... are developed for the problem and used with each of the heuristics. Finally some computational results are given along with lower bounds on the objective value....

  16. Heuristic Solution Approaches to the Double TSP with Multiple Stacks

    DEFF Research Database (Denmark)

    Petersen, Hanne Løhmann

    2006-01-01

    This paper introduces the Double Travelling Salesman Problem with Multiple Stacks and presents a three different metaheuristic approaches to its solution. The Double Travelling Salesman Problem with Multiple Stacks is concerned with finding the shortest route performing pickups and deliveries in ...... are developed for the problem and used with each of the heuristics. Finally some computational results are given along with lower bounds on the objective value....

  17. A Note on the Geometry of Kullback-Leibler Information Numbers.

    Science.gov (United States)

    1983-04-01

    distributions, certain analogies exist between the properties of distributions and Zaclidean *’ geometry. Zn particular, he proved an analogue of Pythagoras ...8217 theorem . Zn this note we extend these geometrical properties by defining the "shortest line" between two distributions and the "aid-pointu of the line...P,R) A similar result holds if both signs are replaced with U signs. 4. Main reslts We •oa pcyv our main theorem , which says that the romential

  18. Piston membrane pumps for slurries transport; Kolbenmembranpumpen fuer den Schlammtransport

    Energy Technology Data Exchange (ETDEWEB)

    Wiechmann, F. [Abel GmbH und Co. KG, Buechen (Germany)

    2006-03-15

    As raw materials prices are rising, ore and coal mines in remote parts of the world have become profitable. Local infrastructures in these regions are not comparable with Europe. There are no rods or railways, and pipelines must be constructed parallel to rivers through deserts, mountains and rainforests. As a rule, pipelines do not follow favourable geological conditions but are constructed along the shortest possible rout to the nearest port or the nearest processing plant. Slurries are transported by pumping. (orig.)

  19. On the Development of Methodology for Planning and Cost-Modeling of a Wide Area Network

    OpenAIRE

    Ahmedi, Basri; Mitrevski, Pece

    2014-01-01

    The most important stages in designing a computer network in a wider geographical area include: definition of requirements, topological description, identification and calculation of relevant parameters (i.e. traffic matrix), determining the shortest path between nodes, quantification of the effect of various levels of technical and technological development of urban areas involved, the cost of technology, and the cost of services. These parameters differ for WAN networks in different regions...

  20. Wait times in Canada.

    Science.gov (United States)

    MacKinnon, Janice Christine

    2017-07-01

    A significant barrier to accessing healthcare in Canada is long waiting lists, which can be linked to the way that Medicare was structured. After significant pressure, provincial governments began to address wait times. An example of a successful strategy to reduce wait times for elective surgery is the Saskatchewan Surgical Initiative, which saw wait times in the province change from being among the longest in Canada to the shortest.

  1. Least-Present-Value-of-Revenue Auctions and Highway Franchising

    OpenAIRE

    Eduardo M.R.A. Engel; Ronald D. Fischer; Alexander Galetovic

    1998-01-01

    In recent years several countries have started massive highway franchising programs auctioned to private firms. In these auctions, the regulator typically sets the franchise term and firms bid on tolls, or, alternatively, the regulator sets tolls and the winner is the firm that asks for the shortest franchise term. In this paper we argue that many of the problems that highway franchises have encountered are due to the fact that the franchise term cannot adjust to demand realizations. We propo...

  2. INVESTIGATING THE CONSUMER BEHAVIOR AND FACTORS CAUSING CONSUMER DISTRUST – A CASE STUDY IN ARVAND FREE ZONE

    OpenAIRE

    Feridoun Omidi; Babak Darabinejad; Aref Loveymi; Hasan Cheraghi Kutiani

    2017-01-01

    In line with rapid growth of the transportation industry that facilitates the trade and business, companies send their products easily in the shortest time to most distant points of the world. Despite development in recent years, the business future of Arvand Free Zone in Khuzestan Province and markets related to it are at risk. The most important reason in this regard is consumer distrust in various stages of advertising. This investigation uses quantitative and qualitative method in order t...

  3. A simulation study regarding different aircraft boarding strategies

    OpenAIRE

    Mas, Sílvia; Juan Pérez, Angel Alejandro; Arias, Pol; Fonseca Casas, Pau

    2013-01-01

    The airline industry is constantly subject to the search of new methods in order to increase efficiency, profitability, and customer satisfaction. Since airlines only generate revenue when their airplanes are on the air, the time they spend at the airports should be the shortest possible. Hence, the airplane turnaround time becomes a process which airlines pay special attention on. The boarding process has a very important role, since it is one of the significant elements of...

  4. Computed tomography of Wallerian degeneration

    International Nuclear Information System (INIS)

    Uchino, Akira; Maeda, Fumihiko

    1986-01-01

    CT findings of wallerian degeneration of the pyramidal tract at the midbrain (atrophy of cerebral peduncle following cerebrovascular accident) were studied in 34 patients (44 CT scans) with old cerebrovascular accidents. Severe atrophy of cerebral peduncle was noted when the ipsilateral motor cortex was involved. However, when the posterior limb of the internal capsule was involved, atrophy of the ipsilateral cerebral peduncle was mild. In this series, the shortest interval between cerebrovascular accident and wallerian degeneration was 8 month. (author)

  5. Net Stable Funding Ratio: Impact on Funding Value Adjustment

    OpenAIRE

    Siadat, Medya; Hammarlid, Ola

    2017-01-01

    In this paper we investigate the relationship between Funding Value Adjustment (FVA) and Net Stable Funding Ratio (NSFR). FVA is defined in a consistent way with NSFR such that the new framework of FVA monitors the costs due to keeping NSFR at an acceptable level, as well. In addition, the problem of choosing the optimal funding strategy is formulated as a shortest path problem where the proposed FVA framework is applied in the optimization process. The solution provides us with the optimal f...

  6. Broad-band monitoring tracing the evolution of the jet and disc in the black hole candidate X-ray binary MAXI J1659-152

    NARCIS (Netherlands)

    van der Horst, A.J.; Curran, P.A.; Miller-Jonis, J.C.A.; Linford, J.D.; Gorosabel, J.; Russell, D.M.; De Ugarte Postigo, A.; Lundgren, A.A.; Taylor, G.B.; Maitra, D.; Guziy, S.; Belloni, T.M.; Kouveliotou, C.; Jonker, P.G.; Kamble, A.; Paragi, Z.; Homan, J.; Kuulkers, E.; Granot, J.; Altamirano, D.; Buxton, M.M.; Castro-Tirado, A.; Fender, R.P.; Garret, M.A.; Gehrels, N.; Hartmann, D.H.; Kennea, J.A.; Krimm, H.A.; Mangano, V.; Ramirez-Ruiz, E.; Romano, P.; Wijers, R.A.M.J.; Wijnands, R.; Yang, Y.J.

    2013-01-01

    MAXI J1659−152 was discovered on 2010 September 25 as a new X-ray transient, initially identified as a gamma-ray burst, but was later shown to be a new X-ray binary with a black hole as the most likely compact object. Dips in the X-ray light curves have revealed that MAXI J1659−152 is the shortest

  7. Geometry of quantum computation with qutrits.

    Science.gov (United States)

    Li, Bin; Yu, Zu-Huan; Fei, Shao-Ming

    2013-01-01

    Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum computation with n qutrits. We show that the optimal quantum circuits are essentially equivalent to the shortest path between two points in a certain curved geometry of SU(3(n)). As an example, three-qutrit systems are investigated in detail.

  8. An Optimization Method of Passenger Assignment for Customized Bus

    OpenAIRE

    Yang Cao; Jian Wang

    2017-01-01

    This study proposes an optimization method of passenger assignment on customized buses (CB). Our proposed method guarantees benefits to passengers by balancing the elements of travel time, waiting time, delay, and economic cost. The optimization problem was solved using a Branch and Bound (B&B) algorithm based on the shortest path for the selected stations. A simulation-based evaluation of the proposed optimization method was conducted. We find that a CB service can save 38.33% in average tra...

  9. Virginia Power's nuclear operations: Leading by example

    International Nuclear Information System (INIS)

    Kuehn, S.E.

    1995-01-01

    Success has been a long time coming for Virginia Power's nuclear units, but after a record run and some of the shortest refueling outages ever, the rest of the industry could learn a few things. This article describes the changes made by Virginia Power at its Surry and North Anna plants. Virginia Power's recipe for success called for equal amounts of individual initiative, management savvy, engineering discipline, organization, dedication, perseverance, pride, introspection, motivation, and humility

  10. Virginia Power's nuclear operations: Leading by example

    Energy Technology Data Exchange (ETDEWEB)

    Kuehn, S.E.

    1995-02-01

    Success has been a long time coming for Virginia Power's nuclear units, but after a record run and some of the shortest refueling outages ever, the rest of the industry could learn a few things. This article describes the changes made by Virginia Power at its Surry and North Anna plants. Virginia Power's recipe for success called for equal amounts of individual initiative, management savvy, engineering discipline, organization, dedication, perseverance, pride, introspection, motivation, and humility.

  11. Droplet Traffic at a Simple Junction at Low Capillary Numbers

    Science.gov (United States)

    Engl, Wilfried; Roche, Matthieu; Colin, Annie; Panizza, Pascal; Ajdari, Armand

    2005-11-01

    We report that, when a train of confined droplets flowing through a channel reaches a junction, the droplets either are alternately distributed between the different outlets or all collect into the shortest one. We argue that this behavior is due to the hydrodynamic feedback of droplets in the different outlets on the selection process occurring at the junction. A “mean field” model, yielding semiquantitative results, offers a first guide to predict droplet traffic in branched networks.

  12. Absolute Positioning Using The Earth’s Magnetic Anomaly Field

    Science.gov (United States)

    2016-09-15

    field has been fully sampled according to the Nyquist theorem . If an aircraft flew with 8 kilometer line spacing at 1 kilometer altitude, the true...if the sample spacing is one half that of the height. This fact, along with the Nyquist frequency theorem , indicates the shortest expected wavelength...channel and will quickly diverge without altitude aiding. We apply altitude aiding directly to the mechanization equations to constrain the vertical channel

  13. How can attosecond pulse train interferometry interrogate electron dynamics?

    Science.gov (United States)

    Arnold, C. L.; Isinger, M.; Busto, D.; Guénot, D.; Nandi, S.; Zhong, S.; Dahlström, J. M.; Gisselbrecht, M.; l'Huillier, A.

    2018-04-01

    Light pulses of sub-100 as (1 as=10-18 s) duration, with photon energies in the extreme-ultraviolet (XUV) spectral domain, represent the shortest event in time ever made and controlled by human beings. Their first experimental observation in 2001 has opened the door to investigating the fundamental dynamics of the quantum world on the natural time scale for electrons in atoms, molecules and solids and marks the beginning of the scientific field now called attosecond science.

  14. Reasons for the appearance of pulsations in gas-lift wells and methods of eliminating them

    Energy Technology Data Exchange (ETDEWEB)

    Sibirev, A P; Grekhov, V V; Leonov, V A; Shigapov, R R

    1985-01-01

    It is shown that the main reason for pulsation in the gas-lift well output is lack of coordinated operation between the bed and the gas-lift lifter. A plan is suggested for making decisions to conduct work to detect and eliminate pulsations in the gas-lift well output which permit elimination of the pulsation in the shortest time and with the least outlays.

  15. Dietetic characteristics of a sample of Mayan dual burden households in Merida, Yucatan, Mexico

    OpenAIRE

    Azcorra, Hugo; Wilson, Hannah; Bogin, Barry; Varela-Silva, Maria Inês; Vázquez-Vázquez, Adriana; Dickinson, Federico

    2013-01-01

    The Maya are the most populous and shortest in stature Native American ethnic group. The Maya provide us a good opportunity to study the dietetic characteristics of a group who experience nutritional dual burden (the combination of under and overnutrition) at the individual, mother-child dyad and population level. The aim of this study is to describe general dietetic patterns of a sample of Maya mothers and children who experienced nutritional dual burden and were living in the city of Merida...

  16. Female Psychology in August Strindberg's the Stronger

    OpenAIRE

    Sutandio, Anton; Apriliani, Erica

    2017-01-01

    This research aimed to offer interpretations of August Strindberg's The Stronger through the lens of female psychology. The Stronger is unique as it seemed very simple yet so intense and powerful with layers of interpretations. Written during 1888-1889, The Stronger, which only had two characters and only one speaking character, had become one of Strindberg's shortest yet important plays during his career. The female psychology approach used in the analysis would cover the discussion of gende...

  17. Puzzles, paradoxes, and problem solving an introduction to mathematical thinking

    CERN Document Server

    Reba, Marilyn A

    2014-01-01

    Graphs: Puzzles and Optimization Graphical Representation and Search Greedy Algorithms and Dynamic Programming Shortest Paths, DNA Sequences, and GPS Systems Routing Problems and Optimal Circuits Traveling Salesmen and Optimal Orderings Vertex Colorings and Edge Matchings Logic: Rational Inference and Computer Circuits Inductive and Deductive Arguments Deductive Arguments and Truth-Tables Deductive Arguments and Derivations Deductive Logic and Equivalence Modeling Using Deductive Logic Probability: Predictions and Expectations Probability and Counting Counting and Unordered Outcomes Independen

  18. Uniqueness of Steiner minimal trees on boundaries in general position

    International Nuclear Information System (INIS)

    Ivanov, A O; Tuzhilin, A A

    2006-01-01

    The following result is proved: there exists an open dense subset U of R 2n such that each P element of U (regarded as an enumerated subset of the standard Euclidean plane R 2 ) is spanned by a unique Steiner minimal tree, that is, a shortest non-degenerate network. Several interesting consequences are also obtained: in particular, it is proved that each planar Steiner tree is planar equivalent to a Steiner minimal tree.

  19. Hard dental tissue minimal-invasive preparation using contemporary polymer rotating instruments and laser

    OpenAIRE

    Beloica Miloš; Vulićević Zoran R.; Mandinić Zoran; Radović Ivana; Jovičić Olivera; Carević Momir; Tekić Jasmina

    2014-01-01

    Goal of contemporary dentistry is to decrease the patient’s discomfort during treatment. Dentists aim to achieve maximum with the newly developed dental materials as well as with new cavity preparation techniques in the shortest time span. Since the development of the first constructed borer (drilling machine) for caries removal, the preparation techniques have considerably changed. The progress of dental materials as well as the cavity preparation techniqu...

  20. Nature-Inspired and Energy Efficient Route Planning

    DEFF Research Database (Denmark)

    Schlichtkrull, Anders; Christensen, J. B. S.; Feld, T.

    2015-01-01

    Cars are responsible for substantial CO2 emission worldwide. Computers can help solve this problem by computing shortest routes on maps. A good example of this is the popular Google Maps service. However, such services often require the order of the stops on the route to be fixed. By not enforcing....... The app is aimed at private persons and small businesses. The app works by using a nature-inspired algorithm called Ant Colony Optimization....

  1. Self-compression of femtosecond deep-ultraviolet pulses by filamentation in krypton.

    Science.gov (United States)

    Adachi, Shunsuke; Suzuki, Toshinori

    2017-05-15

    We demonstrate self-compression of deep-ultraviolet (DUV) pulses by filamentation in krypton. In contrast to self-compression in the near-infrared, that in the DUV is associated with a red-shifted sub-pulse appearing in the pulse temporal profile. The achieved pulse width of 15 fs is the shortest among demonstrated sub-mJ deep-ultraviolet pulses.

  2. Timeliness of notification in infectious disease cases.

    OpenAIRE

    Domínguez, A; Coll, J J; Fuentes, M; Salleras, L

    1992-01-01

    Records of notification in cases of eight infectious diseases in the "Servei Territorial de Salut Publica" of the Province of Barcelona, Spain, between 1982 and 1986 were reviewed. Time from onset of symptoms to notification, time from notification to completion of data collection, and time from onset to completion of the case investigation were analyzed. For the period from onset to notification, the shortest mean was registered for meningococcal infection (6.31 days) and the longest was for...

  3. Resource-Aware Load Balancing Scheme using Multi-objective Optimization in Cloud Computing

    OpenAIRE

    Kavita Rana; Vikas Zandu

    2016-01-01

    Cloud computing is a service based, on-demand, pay per use model consisting of an interconnected and virtualizes resources delivered over internet. In cloud computing, usually there are number of jobs that need to be executed with the available resources to achieve optimal performance, least possible total time for completion, shortest response time, and efficient utilization of resources etc. Hence, job scheduling is the most important concern that aims to ensure that use’s requirement are ...

  4. Sustainable humanitarian supply chain management: exploring new theory

    OpenAIRE

    Kunz, Nathan; Gold, Stefan

    2015-01-01

    Disaster response operations aim at helping as many victims as possible in the shortest time, with limited consideration of the socio-economic context. During the disaster rehabilitation phase, the perspective needs to broaden and comprehensively take into account the local environment. We propose a framework of sustainable humanitarian supply chain management (SCM) that facilitates such comprehensive performance. We conceptualize the framework by combining literature from the fields of susta...

  5. MULTISHAPE TASK SCHEDULING ALGORITHM FOR REAL TIME MICRO-CONTROLLER BASED APPLICATION

    OpenAIRE

    Ankur Jain

    2017-01-01

    Embedded Systems are usually microcontroller-based systems that represent a class of reliable and dependable dedicated computer systems designed for specific purposes. Micro-controllers are used in most electronic devices in an endless variety of ways. Some micro-controller-based embedded systems are required to respond to external events in the shortest possible time and such systems are known as realtime embedded systems. So in multitasking system there is a need of task Scheduling, there a...

  6. An Approximation Approach for Solving the Subpath Planning Problem

    OpenAIRE

    Safilian, Masoud; Tashakkori, S. Mehdi; Eghbali, Sepehr; Safilian, Aliakbar

    2016-01-01

    The subpath planning problem is a branch of the path planning problem, which has widespread applications in automated manufacturing process as well as vehicle and robot navigation. This problem is to find the shortest path or tour subject for travelling a set of given subpaths. The current approaches for dealing with the subpath planning problem are all based on meta-heuristic approaches. It is well-known that meta-heuristic based approaches have several deficiencies. To address them, we prop...

  7. The Value of Information in Distributed Decision Networks

    Science.gov (United States)

    2016-03-04

    formulation, and then we describe the various results at- tained. 1 Mathematical description of Distributed Decision Network un- der Information...Constraints We now define a mathematical framework for networks. Let G = (V,E) be an undirected random network (graph) drawn from a known distribution pG, 1...to any linear, combinatorial problem like shortest path optimization, and, further, so long as the original combinatorial problem can be solved in

  8. A cadaveric study of surgical landmarks for retrograde parotidectomy

    Directory of Open Access Journals (Sweden)

    Wenjie Zhong

    2016-08-01

    Conclusion: The findings indicate that all three landmarks are useful for surgeons to locate the facial nerve branches during retrograde parotidectomy. Since all three landmarks were consistent indicators for the corresponding facial nerve branches, the surgeon has more than one option should one landmark be obscured by tumors. The optimal landmark is the distance from A to MM because it is shortest and most reliable, followed by RMV to MM, and Z to B.

  9. Trajectory Stability in the Traveling Salesman Problem

    Directory of Open Access Journals (Sweden)

    Sergio Sánchez

    2018-01-01

    Full Text Available Two generalizations of the traveling salesman problem in which sites change their position in time are presented. The way the rank of different trajectory lengths changes in time is studied using the rank diversity. We analyze the statistical properties of rank distributions and rank dynamics and give evidence that the shortest and longest trajectories are more predictable and robust to change, that is, more stable.

  10. Is a wind turbine a point source? (L).

    Science.gov (United States)

    Makarewicz, Rufin

    2011-02-01

    Measurements show that practically all noise of wind turbine noise is produced by turbine blades, sometimes a few tens of meters long, despite that the model of a point source located at the hub height is commonly used. The plane of rotating blades is the critical location of the receiver because the distances to the blades are the shortest. It is shown that such location requires certain condition to be met. The model is valid far away from the wind turbine as well.

  11. K2-137 b: an Earth-sized planet in a 4.3-h orbit around an M-dwarf

    DEFF Research Database (Denmark)

    Smith, A. M. S.; Cabrera, J.; Csizmadia, Sz

    2018-01-01

    We report the discovery in K2's Campaign 10 of a transiting terrestrial planet in an ultra-short-period orbit around an M3-dwarf. K2-137 b completes an orbit in only 4.3 h, the second shortest orbital period of any known planet, just 4 min longer than that of KOI 1843.03, which also orbits an M-d...

  12. Proceedings of the International Conference on Lasers 󈨜 Held in Lake Tahoe, Nevada on 4-9 December 1988.

    Science.gov (United States)

    1989-01-01

    Multiphoton Double Ionization of Ba T. F. Gallagher, R. R. Jones, Y. Ziiu, U. Eichmann +, and W. Sandner + Department of Physics University of Virginia... Eichmann , Y. Zhu and T. F. Gallagher J. Phys. B 20 4461 tions, not necessarily at the shortest wavelengths. This is contrary (1987). to much of our...and J. M. Watson; Abstract 13.18, 10th International Free-Electron Laser Conference, Jerusalem , Israel, August 29-September 2, 1988. 2. "High-Extraction

  13. Assessment of disintegrant efficacy with fractal dimensions from real-time MRI.

    OpenAIRE

    Quodbach, J.; Moussavi, A.; Tammer, R.; Frahm, J.; Kleinebudde, P.

    2014-01-01

    An efficient disintegrant is capable of breaking up a tablet in the smallest possible particles in the shortest time. Until now, comparative data on the efficacy of different disintegrants is based on dissolution studies or the disintegration time. Extending these approaches, this study introduces a method, which defines the evolution of fractal dimensions of tablets as surrogate parameter for the available surface area. Fractal dimensions are a measure for the tortuosity of a line, in this c...

  14. Lattice and magnetic anisotropies in uranium intermetallic compounds

    DEFF Research Database (Denmark)

    Havela, L.; Mašková, S.; Adamska, A.

    2013-01-01

    Examples of UNiAlD and UCoGe illustrate that the soft crystallographic direction coincides quite generally with the shortest U-U links in U intermetallics. Added to existing experimental evidence on U compounds it leads to a simple rule, that the easy magnetization direction and the soft crystall...... crystallographic direction (in the sense of highest compressibility under hydrostatic pressure) must be mutually orthogonal....

  15. 1,3-Dimethyl-1H-indole-2-carbonitrile

    Directory of Open Access Journals (Sweden)

    Jiang-Sheng Li

    2009-08-01

    Full Text Available The title compound, C11H10N2, crystallizes with two molecules in the asymmetric unit, both of which are essentially planar (r.m.s. deviations = 0.014 and 0.016 Å. In the crystal, aromatic π–π stacking interactions occur [shortest centroid–centroid separation = 3.5569 (11 Å].

  16. Approaches to Topical Issues in Music and Aesthetic Education of Students

    OpenAIRE

    Smirnov, Alexander V.; Grigorieva, Elena I.; Illarionova, Nadezhda N.; Shcherbinina, Valentina M.; Yushchenko, Natalia S.

    2016-01-01

    The paper presents different educational systems to work out effective approaches to solving the problems in music and aesthetic education of students. Thus, one of the main tasks in the professional activity of a music educator is to master unique methods of optimizing the education process that will make it possible to educate a brilliant musician from a music gifted student within the shortest period. Modern person-oriented approach to education provides for the creation of a favorable art...

  17. Clausewitzian Friction and Future War Revised Edition

    Science.gov (United States)

    2004-01-01

    Hanoverian general Rudolf von Hammerstein was ordered to occupy the town of Menin in southern Belgium, Scharnhorst served as his principal staff offi...their own files. 100 ENDNOTES FOR PAGES 38–41 156 The intractability of the traveling salesman, or Steiner shortest network, problem is as fol- lows...the class of “hard” problems epitomized by the Steiner problem remains “the preeminent problem in theoretical computer science” (Marshall W. Bern and

  18. Rapid Operational Access and Maneuver Support (ROAMS) Platform for Improved Military Logistics Lines of Communication and Operational Vessel Routing

    Science.gov (United States)

    2017-06-01

    discussed in detail. Toolbox: AdH. AdH is a finite element engine capable of solving the 2D and three-dimensional (3D) shallow water equations, the...sites will be the shortest that exists on the mesh. However, the algorithm neither guarantees that the found path will satisfy all navigation...between resolution and computation time. Penalty Function: Draft. The draft constraint ensures that the vessel operates only in sufficiently deep

  19. Radford's biproducts and Yetter-Drinfeld modules for monoidal Hom-Hopf algebras

    Energy Technology Data Exchange (ETDEWEB)

    Liu, Ling, E-mail: ntliuling@gmail.com [College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua 321004 (China); Shen, Bingliang [Shanghai University of Finance and Economics Zhejiang College, Jinhua 321013 (China)

    2014-03-15

    Let (H, α) be a monoidal Hom-bialgebra and (B, β) be a left (H, α)-Hom-module algebra and also a left (H, α)-Hom-comodule coalgebra. Then in this paper, we first introduce the notion of a Hom-smash coproduct, which is a monoidal Hom-coalgebra. Second, we find sufficient and necessary conditions for the Hom-smash product algebra structure and the Hom-smash coproduct coalgebra structure on B ⊗ H to afford B ⊗ H a monoidal Hom-bialgebra structure, generalizing the well-known Radford's biproduct, where the conditions are equivalent to that (B, β) is a bialgebra in the category of Hom-Yetter-Drinfeld modules H/H HYD. Finally, we illustrate the category of Hom-Yetter-Drinfeld modules H/H HYD and prove that the category H/H HYD is a braided monoidal category.

  20. On radiative corrections to supersymmetric Higgs boson masses and their implications for LEP searches

    International Nuclear Information System (INIS)

    Ellis, J.; Zwirner, F.

    1991-01-01

    We present calculations of the one-loop radiative corrections to the mass of the neutral CP-odd Higgs boson (A) in the minimal supersymmetric extension of the standard model, as well as to the neutral CP-even Higgs (h, H) masses and mixing angles. We use these results to recalculate the cross-sections for Higgs production at LEP in the h + (Z * + fanti f), h (H)Z 0 and h (H) A final states. We delineate the domains of parameter space accessible at LEP at the Z 0 peak and at LEP II with a center-of-mass energy of 180, 190 or 200 GeV. (orig.)