WorldWideScience

Sample records for shortest lattice paths

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  12. Lattice Paths and the Constant Term

    International Nuclear Information System (INIS)

    Brak, R; Essam, J; Osborn, J; Owczarek, A L; Rechnitzer, A

    2006-01-01

    We firstly review the constant term method (CTM), illustrating its combinatorial connections and show how it can be used to solve a certain class of lattice path problems. We show the connection between the CTM, the transfer matrix method (eigenvectors and eigenvalues), partial difference equations, the Bethe Ansatz and orthogonal polynomials. Secondly, we solve a lattice path problem first posed in 1971. The model stated in 1971 was only solved for a special case - we solve the full model

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  14. Return polynomials for non-intersecting paths above a surface on the directed square lattice

    Energy Technology Data Exchange (ETDEWEB)

    Brak, R. [Deartment of Mathematics, University of Melbourne, Parkville, VIC (Australia)]. E-mail: r.brak@ms.unimelb.edu.au; Essam, J.W. [Department of Mathematics, Royal Holloway College, University of London, Egham, Surrey (United Kingdom)]. E-mail: j.essam@alpha1.rhul.ac.uk

    2001-12-14

    We enumerate sets of n non-intersecting, t-step paths on the directed square lattice which are excluded from the region below the surface y=0 to which they are initially attached. In particular we obtain a product formula for the number of star configurations in which the paths have arbitrary fixed endpoints. We also consider the 'return' polynomial, R-'{sup W}{sub t}(y;k)={sigma}{sub m{>=}}{sub 0}r-'{sup W}{sub t}(y;m)k{sup m} where r-'{sup W}{sub t}(y;m) is the number of n-path configurations of watermelon type having deviation {gamma} for which the path closest to the surface returns to the surface m times. The 'marked return' polynomial is defined by u-'{sup W}{sub t}(y;k{sub 1}){identical_to}R-'{sup W}{sub 1}(y;k{sub 1}+l)={sigma}{sub m{>=}}{sub 0}u-'{sup W}{sub t}(y;m)k{sub 1}{sup m} where u-'{sup W}{sub t}(y;m) is the number of marked configurations having at least m returns, just m of which are marked. Both r-'{sup W}{sub t}(y;m) and u-'{sup W}(y;m) are expressed in terms of the numbers of paths ignoring returns but introducing a suitably modified endpoint condition. This enables u-'{sup W}{sub t}(y;m) to be written in product form for arbitrary y, but for r-'{sup W}{sub t}(y;m) this can only be done in the case y=0. (author)

  15. Field-controlled randomness of colloidal paths on a magnetic bubble lattice

    International Nuclear Information System (INIS)

    Jungnickel, C; Fischer, Th M; Khattari, Z; Johansen, T H

    2011-01-01

    Paramagnetic colloidal particles move in the potential energy landscape of a magnetically modulated bubble lattice of a magnetic garnet film. The modulation causes the energy minima to alternate between positions above the centres of the bubbles and interstitial positions. The particles deterministically follow the time-dependent positions of the energy minima until the minima become unstable in one or several directions and allow the particles to hop to a new minimum. We control the time delay between instabilities of the minima in alternative directions by the angle of the external magnetic field with the crystallographic directions of the bubble lattice. When the time delay is large, the particles deterministically hop to the next minimum along the direction that becomes unstable first. When the time delay is short, diffusion of the particle in the marginal potential randomizes the choice of the hopping directions or the choice of the transport network. Gradual changes of the external field direction from 0 0 to 30 0 lead to a continuous crossover from a deterministic to a fully stochastic path of the colloids.

  16. A quartet of fermionic expressions for M(k,2k±1 Virasoro characters via half-lattice paths

    Directory of Open Access Journals (Sweden)

    Olivier Blondeau-Fournier

    2017-11-01

    We also derive a bosonic version of the generating functions of length L half-lattice paths, this expression being notable in that it involves q-trinomial coefficients. Taking the L→∞ limit shows that the generating functions for infinite length half-lattice paths are indeed the Virasoro characters χr,sk,2k±1.

  17. From Enumerating to Generating: A Linear Time Algorithm for Generating 2D Lattice Paths with a Given Number of Turns

    Directory of Open Access Journals (Sweden)

    Ting Kuo

    2015-05-01

    Full Text Available We propose a linear time algorithm, called G2DLP, for generating 2D lattice L(n1, n2 paths, equivalent to two-item  multiset permutations, with a given number of turns. The usage of turn has three meanings: in the context of multiset permutations, it means that two consecutive elements of a permutation belong to two different items; in lattice path enumerations, it means that the path changes its direction, either from eastward to northward or from northward to eastward; in open shop scheduling, it means that we transfer a job from one type of machine to another. The strategy of G2DLP is divide-and-combine; the division is based on the enumeration results of a previous study and is achieved by aid of an integer partition algorithm and a multiset permutation algorithm; the combination is accomplished by a concatenation algorithm that constructs the paths we require. The advantage of G2DLP is twofold. First, it is optimal in the sense that it directly generates all feasible paths without visiting an infeasible one. Second, it can generate all paths in any specified order of turns, for example, a decreasing order or an increasing order. In practice, two applications, scheduling and cryptography, are discussed.

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

  19. Quantum interference between two phonon paths and reduced heat transport in diamond lattice with atomic-scale planar defects

    Science.gov (United States)

    Kosevich, Yu. A.; Strelnikov, I. A.

    2018-02-01

    Destructive quantum interference between the waves propagating through laterally inhomogeneous layer can result in their total reflection, which in turn reduces energy flux carried by these waves. We consider the systems of Ge atoms, which fully or partly, in the chequer-wise order, fill a crystal plane in diamond-like Si lattice. We have revealed that a single type of the atomic defects, which are placed in identical positions in different unit cells in the defect crystal plane, can result in double transmission antiresonances of phonon wave packets. This new effect we relate with the complex structure of the diamond-like unit cell, which comprises two atoms in different positions and results in two distinct vibration resonances in two interfering phonon paths. We also consider the propagation of phonon wave packets in the superlatticies made of the defect planes, half-filled in the chequer-wise order with Ge atoms. We have revealed relatively broad phonon stop bands with center frequencies at the transmission antiresonances. We elaborate the equivalent analytical quasi-1D lattice model of the two phonon paths through the complex planar defect in the diamond-like lattice and describe the reduction of phonon heat transfer through the atomic-scale planar defects.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  4. Lattice QCD

    International Nuclear Information System (INIS)

    Hasenfratz, P.

    1983-01-01

    The author presents a general introduction to lattice gauge theories and discusses non-perturbative methods in the gauge sector. He then shows how the lattice works in obtaining the string tension in SU(2). Lattice QCD at finite physical temperature is discussed. Universality tests in SU(2) lattice QCD are presented. SU(3) pure gauge theory is briefly dealt with. Finally, fermions on the lattice are considered. (Auth.)

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

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

  7. Formal language constrained path problems

    Energy Technology Data Exchange (ETDEWEB)

    Barrett, C.; Jacob, R.; Marathe, M.

    1997-07-08

    In many path finding problems arising in practice, certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Motivated by such applications as intermodal transportation planning, the authors investigate the complexity of finding feasible paths in a labeled network, where the mode choice for each traveler is specified by a formal language. The main contributions of this paper include the following: (1) the authors show that the problem of finding a shortest path between a source and destination for a traveler whose mode choice is specified as a context free language is solvable efficiently in polynomial time, when the mode choice is specified as a regular language they provide algorithms with improved space and time bounds; (2) in contrast, they show that the problem of finding simple paths between a source and a given destination is NP-hard, even when restricted to very simple regular expressions and/or very simple graphs; (3) for the class of treewidth bounded graphs, they show that (i) the problem of finding a regular language constrained simple path between source and a destination is solvable in polynomial time and (ii) the extension to finding context free language constrained simple paths is NP-complete. Several extensions of these results are presented in the context of finding shortest paths with additional constraints. These results significantly extend the results in [MW95]. As a corollary of the results, they obtain a polynomial time algorithm for the BEST k-SIMILAR PATH problem studied in [SJB97]. The previous best algorithm was given by [SJB97] and takes exponential time in the worst case.

  8. Welding Robot Collision-Free Path Optimization

    Directory of Open Access Journals (Sweden)

    Xuewu Wang

    2017-02-01

    Full Text Available Reasonable welding path has a significant impact on welding efficiency, and a collision-free path should be considered first in the process of welding robot path planning. The shortest path length is considered as an optimization objective, and obstacle avoidance is considered as the constraint condition in this paper. First, a grid method is used as a modeling method after the optimization objective is analyzed. For local collision-free path planning, an ant colony algorithm is selected as the search strategy. Then, to overcome the shortcomings of the ant colony algorithm, a secondary optimization is presented to improve the optimization performance. Finally, the particle swarm optimization algorithm is used to realize global path planning. Simulation results show that the desired welding path can be obtained based on the optimization strategy.

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

  10. Path Dependency

    OpenAIRE

    Mark Setterfield

    2015-01-01

    Path dependency is defined, and three different specific concepts of path dependency – cumulative causation, lock in, and hysteresis – are analyzed. The relationships between path dependency and equilibrium, and path dependency and fundamental uncertainty are also discussed. Finally, a typology of dynamical systems is developed to clarify these relationships.

  11. Void lattices

    International Nuclear Information System (INIS)

    Chadderton, L.T.; Johnson, E.; Wohlenberg, T.

    1976-01-01

    Void lattices in metals apparently owe their stability to elastically anisotropic interactions. An ordered array of voids on the anion sublattice in fluorite does not fit so neatly into this scheme of things. Crowdions may play a part in the formation of the void lattice, and stability may derive from other sources. (Auth.)

  12. Lattice fermions

    International Nuclear Information System (INIS)

    Randjbar-Daemi, S.

    1995-12-01

    The so-called doubling problem in the lattice description of fermions led to a proof that under certain circumstances chiral gauge theories cannot be defined on the lattice. This is called the no-go theorem. It implies that if Γ/sub/A is defined on a lattice then its infrared limit, which should correspond to the quantum description of the classical action for the slowly varying fields on lattice scale, is inevitably a vector like theory. In particular, if not circumvented, the no-go theorem implies that there is no lattice formulation of the Standard Weinberg-Salam theory or SU(5) GUT, even though the fermions belong to anomaly-free representations of the gauge group. This talk aims to explain one possible attempt at bypassing the no-go theorem. 20 refs

  13. Lattice fermions

    Energy Technology Data Exchange (ETDEWEB)

    Randjbar-Daemi, S

    1995-12-01

    The so-called doubling problem in the lattice description of fermions led to a proof that under certain circumstances chiral gauge theories cannot be defined on the lattice. This is called the no-go theorem. It implies that if {Gamma}/sub/A is defined on a lattice then its infrared limit, which should correspond to the quantum description of the classical action for the slowly varying fields on lattice scale, is inevitably a vector like theory. In particular, if not circumvented, the no-go theorem implies that there is no lattice formulation of the Standard Weinberg-Salam theory or SU(5) GUT, even though the fermions belong to anomaly-free representations of the gauge group. This talk aims to explain one possible attempt at bypassing the no-go theorem. 20 refs.

  14. Multi-AGV path planning with double-path constraints by using an improved genetic algorithm.

    Directory of Open Access Journals (Sweden)

    Zengliang Han

    Full Text Available This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, double-path constraints of both minimizing the total path distance of all AGVs and minimizing single path distances of each AGV are exerted, gaining the optimal shortest total path distance. The simulation results show that the total path distance of all AGVs and the longest single AGV path distance are shortened by using the improved genetic algorithm.

  15. Lattice strings

    International Nuclear Information System (INIS)

    Thorn, C.B.

    1988-01-01

    The possibility of studying non-perturbative effects in string theory using a world sheet lattice is discussed. The light-cone lattice string model of Giles and Thorn is studied numerically to assess the accuracy of ''coarse lattice'' approximations. For free strings a 5 by 15 lattice seems sufficient to obtain better than 10% accuracy for the bosonic string tachyon mass squared. In addition a crude lattice model simulating string like interactions is studied to find out how easily a coarse lattice calculation can pick out effects such as bound states which would qualitatively alter the spectrum of the free theory. The role of the critical dimension in obtaining a finite continuum limit is discussed. Instead of the ''gaussian'' lattice model one could use one of the vertex models, whose continuum limit is the same as a gaussian model on a torus of any radius. Indeed, any critical 2 dimensional statistical system will have a stringy continuum limit in the absence of string interactions. 8 refs., 1 fig. , 9 tabs

  16. ISABELLE lattice

    International Nuclear Information System (INIS)

    Smith, L.

    1975-01-01

    An analysis is given of a number of variants of the basic lattice of the planned ISABELLE storage rings. The variants were formed by removing cells from the normal part of the lattice and juggling the lengths of magnets, cells, and insertions in order to maintain a rational relation of circumference to that of the AGS and approximately the same dispersion. Special insertions, correction windings, and the working line with nonlinear resonances are discussed

  17. Supersymmetric lattices

    International Nuclear Information System (INIS)

    Catterall, Simon

    2013-01-01

    Discretization of supersymmetric theories is an old problem in lattice field theory. It has resisted solution until quite recently when new ideas drawn from orbifold constructions and topological field theory have been brought to bear on the question. The result has been the creation of a new class of lattice gauge theory in which the lattice action is invariant under one or more supersymmetries. The resultant theories are local and free of doublers and in the case of Yang-Mills theories also possess exact gauge invariance. In principle they form the basis for a truly non-perturbative definition of the continuum supersymmetric field theory. In this talk these ideas are reviewed with particular emphasis being placed on N = 4 super Yang-Mills theory.

  18. Path Expressions

    Science.gov (United States)

    1975-06-01

    Traditionally, synchronization of concurrent processes is coded in line by operations on semaphores or similar objects. Path expressions move the...discussion about a variety of synchronization primitives . An analysis of their relative power is found in [3]. Path expressions do not introduce yet...another synchronization primitive . A path expression relates to such primitives as a for- or while-statement of an ALGOL-like language relates to a JUMP

  19. Reaction-diffusion path planning in a hybrid chemical and cellular-automaton processor

    International Nuclear Information System (INIS)

    Adamatzky, Andrew; Lacy Costello, Benjamin de

    2003-01-01

    To find the shortest collision-free path in a room containing obstacles we designed a chemical processor and coupled it with a cellular-automaton processor. In the chemical processor obstacles are represented by sites of high concentration of potassium iodide and a planar substrate is saturated with palladium chloride. Potassium iodide diffuses into the substrate and reacts with palladium chloride. A dark coloured precipitate of palladium iodide is formed almost everywhere except sites where two or more diffusion wavefronts collide. The less coloured sites are situated at the furthest distance from obstacles. Thus, the chemical processor develops a repulsive field, generated by obstacles. A snapshot of the chemical processor is inputted to a cellular automaton. The automaton behaves like a discrete excitable media; also, every cell of the automaton is supplied with a pointer that shows an origin of the cell's excitation. The excitation spreads along the cells corresponding to precipitate depleted sites of the chemical processor. When the destination-site is excited, waves travel on the lattice and update the orientations of the pointers. Thus, the automaton constructs a spanning tree, made of pointers, that guides a traveler towards the destination point. Thus, the automaton medium generates an attractive field and combination of this attractive field with the repulsive field, generated by the chemical processor, provides us with a solution of the collision-free path problem

  20. Lattice overview

    International Nuclear Information System (INIS)

    Creutz, M.

    1984-01-01

    After reviewing some recent developments in supercomputer access, the author discusses a few areas where perturbation theory and lattice gauge simulations make contact. The author concludes with a brief discussion of a deterministic dynamics for the Ising model. This may be useful for numerical studies of nonequilibrium phenomena. 13 references

  1. Robots and lattice automata

    CERN Document Server

    Adamatzky, Andrew

    2015-01-01

    The book gives a comprehensive overview of the state-of-the-art research and engineering in theory and application of Lattice Automata in design and control of autonomous Robots. Automata and robots share the same notional meaning. Automata (originated from the latinization of the Greek word “αυτόματον”) as self-operating autonomous machines invented from ancient years can be easily considered the first steps of robotic-like efforts. Automata are mathematical models of Robots and also they are integral parts of robotic control systems. A Lattice Automaton is a regular array or a collective of finite state machines, or automata. The Automata update their states by the same rules depending on states of their immediate neighbours. In the context of this book, Lattice Automata are used in developing modular reconfigurable robotic systems, path planning and map exploration for robots, as robot controllers, synchronisation of robot collectives, robot vision, parallel robotic actuators. All chapters are...

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

  3. Lattice QCD on fine lattices

    Energy Technology Data Exchange (ETDEWEB)

    Schaefer, Stefan [DESY (Germany). Neumann Inst. for Computing

    2016-11-01

    These configurations are currently in use in many on-going projects carried out by researchers throughout Europe. In particular this data will serve as an essential input into the computation of the coupling constant of QCD, where some of the simulations are still on-going. But also projects computing the masses of hadrons and investigating their structure are underway as well as activities in the physics of heavy quarks. As this initial project of gauge field generation has been successful, it is worthwhile to extend the currently available ensembles with further points in parameter space. These will allow to further study and control systematic effects like the ones introduced by the finite volume, the non-physical quark masses and the finite lattice spacing. In particular certain compromises have still been made in the region where pion masses and lattice spacing are both small. This is because physical pion masses require larger lattices to keep the effects of the finite volume under control. At light pion masses, a precise control of the continuum extrapolation is therefore difficult, but certainly a main goal of future simulations. To reach this goal, algorithmic developments as well as faster hardware will be needed.

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

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

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

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

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

  9. Path Dependence

    DEFF Research Database (Denmark)

    Madsen, Mogens Ove

    Begrebet Path Dependence blev oprindelig udviklet inden for New Institutionel Economics af bl.a. David, Arthur og North. Begrebet har spredt sig vidt i samfundsvidenskaberne og undergået en udvikling. Dette paper propagerer for at der er sket så en så omfattende udvikling af begrebet, at man nu kan...... tale om 1. og 2. generation af Path Dependence begrebet. Den nyeste udvikling af begrebet har relevans for metodologi-diskusionerne i relation til Keynes...

  10. Lattice-Like Total Perfect Codes

    Directory of Open Access Journals (Sweden)

    Araujo Carlos

    2014-02-01

    Full Text Available A contribution is made to the classification of lattice-like total perfect codes in integer lattices Λn via pairs (G, Φ formed by abelian groups G and homomorphisms Φ: Zn → G. A conjecture is posed that the cited contribution covers all possible cases. A related conjecture on the unfinished work on open problems on lattice-like perfect dominating sets in Λn with induced components that are parallel paths of length > 1 is posed as well.

  11. Area of Lattice Polygons

    Science.gov (United States)

    Scott, Paul

    2006-01-01

    A lattice is a (rectangular) grid of points, usually pictured as occurring at the intersections of two orthogonal sets of parallel, equally spaced lines. Polygons that have lattice points as vertices are called lattice polygons. It is clear that lattice polygons come in various shapes and sizes. A very small lattice triangle may cover just 3…

  12. Path Creation

    DEFF Research Database (Denmark)

    Karnøe, Peter; Garud, Raghu

    2012-01-01

    This paper employs path creation as a lens to follow the emergence of the Danish wind turbine cluster. Supplier competencies, regulations, user preferences and a market for wind power did not pre-exist; all had to emerge in a tranformative manner involving multiple actors and artefacts. Competenc......This paper employs path creation as a lens to follow the emergence of the Danish wind turbine cluster. Supplier competencies, regulations, user preferences and a market for wind power did not pre-exist; all had to emerge in a tranformative manner involving multiple actors and artefacts....... Competencies emerged through processes and mechanisms such as co-creation that implicated multiple learning processes. The process was not an orderly linear one as emergent contingencies influenced the learning processes. An implication is that public policy to catalyse clusters cannot be based...

  13. LATTICE: an interactive lattice computer code

    International Nuclear Information System (INIS)

    Staples, J.

    1976-10-01

    LATTICE is a computer code which enables an interactive user to calculate the functions of a synchrotron lattice. This program satisfies the requirements at LBL for a simple interactive lattice program by borrowing ideas from both TRANSPORT and SYNCH. A fitting routine is included

  14. Generalized hydrodynamic transport in lattice-gas automata

    Science.gov (United States)

    Luo, Li-Shi; Chen, Hudong; Chen, Shiyi; Doolen, Gary D.; Lee, Yee-Chun

    1991-01-01

    The generalized hydrodynamics of two-dimensional lattice-gas automata is solved analytically in the linearized Boltzmann approximation. The dependence of the transport coefficients (kinematic viscosity, bulk viscosity, and sound speed) upon wave number k is obtained analytically. Anisotropy of these coefficients due to the lattice symmetry is studied for the entire range of wave number, k. Boundary effects due to a finite mean free path (Knudsen layer) are analyzed, and accurate comparisons are made with lattice-gas simulations.

  15. Determining the scale in lattice QCD

    Energy Technology Data Exchange (ETDEWEB)

    Bornyakov, V.G. [Institute for High Energy Physics, Protvino (Russian Federation); Institute of Theoretical and Experimental Physics, Moscow (Russian Federation); Far Eastern Federal Univ., Vladivostok (Russian Federation). School of Biomedicine; Horsley, R. [Edinburgh Univ. (United Kingdom). School of Physics and Astronomy; Hudspith, R. [York Univ., Toronto, ON (Canada). Dept. of Physics and Astronomy; and others

    2015-12-15

    We discuss scale setting in the context of 2+1 dynamical fermion simulations where we approach the physical point in the quark mass plane keeping the average quark mass constant. We have simulations at four beta values, and after determining the paths and lattice spacings, we give an estimation of the phenomenological values of various Wilson flow scales.

  16. The propagator for the step potential and delta function potential using the path decomposition expansion

    Energy Technology Data Exchange (ETDEWEB)

    Yearsley, James M [Blackett Laboratory, Imperial College, London SW7 2BZ (United Kingdom)

    2008-07-18

    We present a derivation of the propagator for a particle in the presence of the step and delta function potentials. These propagators are known, but we present a direct path integral derivation, based on the path decomposition expansion and the Brownian motion definition of the path integral. The derivation exploits properties of the Catalan numbers, which enumerate certain classes of lattice paths.

  17. Fuel lattice design using heuristics and new strategies

    Energy Technology Data Exchange (ETDEWEB)

    Ortiz S, J. J.; Castillo M, J. A.; Torres V, M.; Perusquia del Cueto, R. [ININ, Carretera Mexico-Toluca s/n, Ocoyoacac 52750, Estado de Mexico (Mexico); Pelta, D. A. [ETS Ingenieria Informatica y Telecomunicaciones, Universidad de Granada, Daniel Saucedo Aranda s/n, 18071 Granada (Spain); Campos S, Y., E-mail: juanjose.ortiz@inin.gob.m [IPN, Escuela Superior de Fisica y Matematicas, Unidad Profesional Adolfo Lopez Mateos, Edif. 9, 07738 Mexico D. F. (Mexico)

    2010-10-15

    This work show some results of the fuel lattice design in BWRs when some allocation pin rod rules are not taking into account. Heuristics techniques like Path Re linking and Greedy to design fuel lattices were used. The scope of this work is to search about how do classical rules in design fuel lattices affect the heuristics techniques results and the fuel lattice quality. The fuel lattices quality is measured by Power Peaking Factor and Infinite Multiplication Factor at the beginning of the fuel lattice life. CASMO-4 code to calculate these parameters was used. The analyzed rules are the following: pin rods with lowest uranium enrichment are only allocated in the fuel lattice corner, and pin rods with gadolinium cannot allocated in the fuel lattice edge. Fuel lattices with and without gadolinium in the main diagonal were studied. Some fuel lattices were simulated in an equilibrium cycle fuel reload, using Simulate-3 to verify their performance. So, the effective multiplication factor and thermal limits can be verified. The obtained results show a good performance in some fuel lattices designed, even thought, the knowing rules were not implemented. A fuel lattice performance and fuel lattice design characteristics analysis was made. To the realized tests, a dell workstation was used, under Li nux platform. (Author)

  18. Fuel lattice design using heuristics and new strategies

    International Nuclear Information System (INIS)

    Ortiz S, J. J.; Castillo M, J. A.; Torres V, M.; Perusquia del Cueto, R.; Pelta, D. A.; Campos S, Y.

    2010-10-01

    This work show some results of the fuel lattice design in BWRs when some allocation pin rod rules are not taking into account. Heuristics techniques like Path Re linking and Greedy to design fuel lattices were used. The scope of this work is to search about how do classical rules in design fuel lattices affect the heuristics techniques results and the fuel lattice quality. The fuel lattices quality is measured by Power Peaking Factor and Infinite Multiplication Factor at the beginning of the fuel lattice life. CASMO-4 code to calculate these parameters was used. The analyzed rules are the following: pin rods with lowest uranium enrichment are only allocated in the fuel lattice corner, and pin rods with gadolinium cannot allocated in the fuel lattice edge. Fuel lattices with and without gadolinium in the main diagonal were studied. Some fuel lattices were simulated in an equilibrium cycle fuel reload, using Simulate-3 to verify their performance. So, the effective multiplication factor and thermal limits can be verified. The obtained results show a good performance in some fuel lattices designed, even thought, the knowing rules were not implemented. A fuel lattice performance and fuel lattice design characteristics analysis was made. To the realized tests, a dell workstation was used, under Li nux platform. (Author)

  19. Lattice gauge theory

    International Nuclear Information System (INIS)

    Mack, G.

    1982-01-01

    After a description of a pure Yang-Mills theory on a lattice, the author considers a three-dimensional pure U(1) lattice gauge theory. Thereafter he discusses the exact relation between lattice gauge theories with the gauge groups SU(2) and SO(3). Finally he presents Monte Carlo data on phase transitions in SU(2) and SO(3) lattice gauge models. (HSI)

  20. Lattices with unique complements

    CERN Document Server

    Saliĭ, V N

    1988-01-01

    The class of uniquely complemented lattices properly contains all Boolean lattices. However, no explicit example of a non-Boolean lattice of this class has been found. In addition, the question of whether this class contains any complete non-Boolean lattices remains unanswered. This book focuses on these classical problems of lattice theory and the various attempts to solve them. Requiring no specialized knowledge, the book is directed at researchers and students interested in general algebra and mathematical logic.

  1. Positroids Induced by Rational Dyck Paths

    OpenAIRE

    Gotti, Felix

    2017-01-01

    A rational Dyck path of type $(m,d)$ is an increasing unit-step lattice path from $(0,0)$ to $(m,d) \\in \\mathbb{Z}^2$ that never goes above the diagonal line $y = (d/m)x$. On the other hand, a positroid of rank $d$ on the ground set $[d+m]$ is a special type of matroid coming from the totally nonnegative Grassmannian. In this paper we describe how to naturally assign a rank $d$ positroid on the ground set $[d+m]$, which we name rational Dyck positroid, to each rational Dyck path of type $(m,d...

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

  3. Nonperturbative path integral expansion II

    International Nuclear Information System (INIS)

    Kaiser, H.J.

    1976-05-01

    The Feynman path integral representation of the 2-point function for a self-interacting Bose field is investigated using an expansion ('Path Integral Expansion', PIE) of the exponential of the kinetic term of the Lagrangian. This leads to a series - illustrated by a graph scheme - involving successively a coupling of more and more points of the lattice space commonly employed in the evaluation of path integrals. The values of the individual PIE graphs depend of course on the lattice constant. Two methods - Pade approximation and Borel-type extrapolation - are proposed to extract information about the continuum limit from a finite-order PIE. A more flexible PIE is possible by expanding besides the kinetic term a suitably chosen part of the interaction term too. In particular, if the co-expanded part is a mass term the calculation becomes only slightly more complicated than in the original formulation and the appearance of the graph scheme is unchanged. A significant reduction of the number of graphs and an improvement of the convergence of the PIE can be achieved by performing certain sums over an infinity of graph elements. (author)

  4. Path planning of decentralized multi-quadrotor based on fuzzy-cell decomposition algorithm

    Science.gov (United States)

    Iswanto, Wahyunggoro, Oyas; Cahyadi, Adha Imam

    2017-04-01

    The paper aims to present a design algorithm for multi quadrotor lanes in order to move towards the goal quickly and avoid obstacles in an area with obstacles. There are several problems in path planning including how to get to the goal position quickly and avoid static and dynamic obstacles. To overcome the problem, therefore, the paper presents fuzzy logic algorithm and fuzzy cell decomposition algorithm. Fuzzy logic algorithm is one of the artificial intelligence algorithms which can be applied to robot path planning that is able to detect static and dynamic obstacles. Cell decomposition algorithm is an algorithm of graph theory used to make a robot path map. By using the two algorithms the robot is able to get to the goal position and avoid obstacles but it takes a considerable time because they are able to find the shortest path. Therefore, this paper describes a modification of the algorithms by adding a potential field algorithm used to provide weight values on the map applied for each quadrotor by using decentralized controlled, so that the quadrotor is able to move to the goal position quickly by finding the shortest path. The simulations conducted have shown that multi-quadrotor can avoid various obstacles and find the shortest path by using the proposed algorithms.

  5. New integrable lattice hierarchies

    International Nuclear Information System (INIS)

    Pickering, Andrew; Zhu Zuonong

    2006-01-01

    In this Letter we give a new integrable four-field lattice hierarchy, associated to a new discrete spectral problem. We obtain our hierarchy as the compatibility condition of this spectral problem and an associated equation, constructed herein, for the time-evolution of eigenfunctions. We consider reductions of our hierarchy, which also of course admit discrete zero curvature representations, in detail. We find that our hierarchy includes many well-known integrable hierarchies as special cases, including the Toda lattice hierarchy, the modified Toda lattice hierarchy, the relativistic Toda lattice hierarchy, and the Volterra lattice hierarchy. We also obtain here a new integrable two-field lattice hierarchy, to which we give the name of Suris lattice hierarchy, since the first equation of this hierarchy has previously been given by Suris. The Hamiltonian structure of the Suris lattice hierarchy is obtained by means of a trace identity formula

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

  7. Path Generation by Avoiding Obstacles using the Intersection of Bodies

    Directory of Open Access Journals (Sweden)

    Komák Martin

    2018-02-01

    Full Text Available We will discuss the problem of path finding in 3D space with an obstacle. The thesis deals with the problem of searching for the shortest path between the individual points in the space so that this path does not come into collision with an obstacle. A system has been designed to construct paths in cross-sectional planes of the given object representing an obstacle, based on its surface contour. The system solves the issue of loading STL format, creating cross-sectional planes of the object, intersection between geometric shapes, and generation of lines around the contour of the object in 2D. An experiment was performed, in which we have been moving around a model of a jet aircraft and its results are described in the conclusion.

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

  9. Statistical mechanics of directed models of polymers in the square lattice

    CERN Document Server

    Rensburg, J V

    2003-01-01

    Directed square lattice models of polymers and vesicles have received considerable attention in the recent mathematical and physical sciences literature. These are idealized geometric directed lattice models introduced to study phase behaviour in polymers, and include Dyck paths, partially directed paths, directed trees and directed vesicles models. Directed models are closely related to models studied in the combinatorics literature (and are often exactly solvable). They are also simplified versions of a number of statistical mechanics models, including the self-avoiding walk, lattice animals and lattice vesicles. The exchange of approaches and ideas between statistical mechanics and combinatorics have considerably advanced the description and understanding of directed lattice models, and this will be explored in this review. The combinatorial nature of directed lattice path models makes a study using generating function approaches most natural. In contrast, the statistical mechanics approach would introduce...

  10. Generalized isothermic lattices

    International Nuclear Information System (INIS)

    Doliwa, Adam

    2007-01-01

    We study multi-dimensional quadrilateral lattices satisfying simultaneously two integrable constraints: a quadratic constraint and the projective Moutard constraint. When the lattice is two dimensional and the quadric under consideration is the Moebius sphere one obtains, after the stereographic projection, the discrete isothermic surfaces defined by Bobenko and Pinkall by an algebraic constraint imposed on the (complex) cross-ratio of the circular lattice. We derive the analogous condition for our generalized isothermic lattices using Steiner's projective structure of conics, and we present basic geometric constructions which encode integrability of the lattice. In particular, we introduce the Darboux transformation of the generalized isothermic lattice and we derive the corresponding Bianchi permutability principle. Finally, we study two-dimensional generalized isothermic lattices, in particular geometry of their initial boundary value problem

  11. The Global Optimal Algorithm of Reliable Path Finding Problem Based on Backtracking Method

    Directory of Open Access Journals (Sweden)

    Liang Shen

    2017-01-01

    Full Text Available There is a growing interest in finding a global optimal path in transportation networks particularly when the network suffers from unexpected disturbance. This paper studies the problem of finding a global optimal path to guarantee a given probability of arriving on time in a network with uncertainty, in which the travel time is stochastic instead of deterministic. Traditional path finding methods based on least expected travel time cannot capture the network user’s risk-taking behaviors in path finding. To overcome such limitation, the reliable path finding algorithms have been proposed but the convergence of global optimum is seldom addressed in the literature. This paper integrates the K-shortest path algorithm into Backtracking method to propose a new path finding algorithm under uncertainty. The global optimum of the proposed method can be guaranteed. Numerical examples are conducted to demonstrate the correctness and efficiency of the proposed algorithm.

  12. Computing paths and cycles in biological interaction graphs

    Directory of Open Access Journals (Sweden)

    von Kamp Axel

    2009-06-01

    Full Text Available Abstract Background Interaction graphs (signed directed graphs provide an important qualitative modeling approach for Systems Biology. They enable the analysis of causal relationships in cellular networks and can even be useful for predicting qualitative aspects of systems dynamics. Fundamental issues in the analysis of interaction graphs are the enumeration of paths and cycles (feedback loops and the calculation of shortest positive/negative paths. These computational problems have been discussed only to a minor extent in the context of Systems Biology and in particular the shortest signed paths problem requires algorithmic developments. Results We first review algorithms for the enumeration of paths and cycles and show that these algorithms are superior to a recently proposed enumeration approach based on elementary-modes computation. The main part of this work deals with the computation of shortest positive/negative paths, an NP-complete problem for which only very few algorithms are described in the literature. We propose extensions and several new algorithm variants for computing either exact results or approximations. Benchmarks with various concrete biological networks show that exact results can sometimes be obtained in networks with several hundred nodes. A class of even larger graphs can still be treated exactly by a new algorithm combining exhaustive and simple search strategies. For graphs, where the computation of exact solutions becomes time-consuming or infeasible, we devised an approximative algorithm with polynomial complexity. Strikingly, in realistic networks (where a comparison with exact results was possible this algorithm delivered results that are very close or equal to the exact values. This phenomenon can probably be attributed to the particular topology of cellular signaling and regulatory networks which contain a relatively low number of negative feedback loops. Conclusion The calculation of shortest positive

  13. Path Creation, Path Dependence and Breaking Away from the Path

    OpenAIRE

    Wang, Jens; Hedman, Jonas; Tuunainen, Virpi Kristiina

    2016-01-01

    The explanation of how and why firms succeed or fail is a recurrent research challenge. This is particularly important in the context of technological innovations. We focus on the role of historical events and decisions in explaining such success and failure. Using a case study of Nokia, we develop and extend a multi-layer path dependence framework. We identify four layers of path dependence: technical, strategic and leadership, organizational, and external collaboration. We show how path dep...

  14. Microcanonical ensemble formulation of lattice gauge theory

    International Nuclear Information System (INIS)

    Callaway, D.J.E.; Rahman, A.

    1982-01-01

    A new formulation of lattice gauge theory without explicit path integrals or sums is obtained by using the microcanonical ensemble of statistical mechanics. Expectation values in the new formalism are calculated by solving a large set of coupled, nonlinear, ordinary differential equations. The average plaquette for compact electrodynamics calculated in this fashion agrees with standard Monte Carlo results. Possible advantages of the microcanonical method in applications to fermionic systems are discussed

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

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

  17. Lattice theory for nonspecialists

    International Nuclear Information System (INIS)

    Hari Dass, N.D.

    1984-01-01

    These lectures were delivered as part of the academic training programme at the NIKHEF-H. These lectures were intended primarily for experimentalists, and theorists not specializing in lattice methods. The goal was to present the essential spirit behind the lattice approach and consequently the author has concentrated mostly on issues of principle rather than on presenting a large amount of detail. In particular, the author emphasizes the deep theoretical infra-structure that has made lattice studies meaningful. At the same time, he has avoided the use of heavy formalisms as they tend to obscure the basic issues for people trying to approach this subject for the first time. The essential ideas are illustrated with elementary soluble examples not involving complicated mathematics. The following subjects are discussed: three ways of solving the harmonic oscillator problem; latticization; gauge fields on a lattice; QCD observables; how to solve lattice theories. (Auth.)

  18. Lattice gauge theories

    International Nuclear Information System (INIS)

    Creutz, M.

    1983-04-01

    In the last few years lattice gauge theory has become the primary tool for the study of nonperturbative phenomena in gauge theories. The lattice serves as an ultraviolet cutoff, rendering the theory well defined and amenable to numerical and analytical work. Of course, as with any cutoff, at the end of a calculation one must consider the limit of vanishing lattice spacing in order to draw conclusions on the physical continuum limit theory. The lattice has the advantage over other regulators that it is not tied to the Feynman expansion. This opens the possibility of other approximation schemes than conventional perturbation theory. Thus Wilson used a high temperature expansion to demonstrate confinement in the strong coupling limit. Monte Carlo simulations have dominated the research in lattice gauge theory for the last four years, giving first principle calculations of nonperturbative parameters characterizing the continuum limit. Some of the recent results with lattice calculations are reviewed

  19. Global anomalies in chiral gauge theories on the lattice

    International Nuclear Information System (INIS)

    Baer, O.; Campos, I.

    2000-01-01

    We discuss the issue of global anomalies in chiral gauge theories on the lattice. In Luescher's approach, these obstructions make it impossible to define consistently a fermionic measure for the path integral. We show that an SU(2) theory has such a global anomaly if the Weyl fermion is in the fundamental representation. The anomaly in higher representations is also discussed. We finally show that this obstruction is the lattice analogue of the SU(2) anomaly first discovered by Witten. (orig.)

  20. On Traveling Waves in Lattices: The Case of Riccati Lattices

    Science.gov (United States)

    Dimitrova, Zlatinka

    2012-09-01

    The method of simplest equation is applied for analysis of a class of lattices described by differential-difference equations that admit traveling-wave solutions constructed on the basis of the solution of the Riccati equation. We denote such lattices as Riccati lattices. We search for Riccati lattices within two classes of lattices: generalized Lotka-Volterra lattices and generalized Holling lattices. We show that from the class of generalized Lotka-Volterra lattices only the Wadati lattice belongs to the class of Riccati lattices. Opposite to this many lattices from the Holling class are Riccati lattices. We construct exact traveling wave solutions on the basis of the solution of Riccati equation for three members of the class of generalized Holling lattices.

  1. Lattice degeneracies of fermions

    International Nuclear Information System (INIS)

    Raszillier, H.

    1983-10-01

    We present a detailed description of the minimal degeneracies of geometric (Kaehler) fermions on all the lattices of maximal symmetries in n = 1, ..., 4 dimensions. We also determine the isolated orbits of the maximal symmetry groups, which are related to the minimal numbers of ''naive'' fermions on the reciprocals of these lattices. It turns out that on the self-reciprocal lattices the minimal numbers of naive fermions are equal to the minimal numbers of degrees of freedom of geometric fermions. The description we give relies on the close connection of the maximal lattice symmetry groups with (affine) Weyl groups of root systems of (semi-) simple Lie algebras. (orig.)

  2. Twisted mass lattice QCD

    International Nuclear Information System (INIS)

    Shindler, A.

    2007-07-01

    I review the theoretical foundations, properties as well as the simulation results obtained so far of a variant of the Wilson lattice QCD formulation: Wilson twisted mass lattice QCD. Emphasis is put on the discretization errors and on the effects of these discretization errors on the phase structure for Wilson-like fermions in the chiral limit. The possibility to use in lattice simulations different lattice actions for sea and valence quarks to ease the renormalization patterns of phenomenologically relevant local operators, is also discussed. (orig.)

  3. Twisted mass lattice QCD

    Energy Technology Data Exchange (ETDEWEB)

    Shindler, A. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC

    2007-07-15

    I review the theoretical foundations, properties as well as the simulation results obtained so far of a variant of the Wilson lattice QCD formulation: Wilson twisted mass lattice QCD. Emphasis is put on the discretization errors and on the effects of these discretization errors on the phase structure for Wilson-like fermions in the chiral limit. The possibility to use in lattice simulations different lattice actions for sea and valence quarks to ease the renormalization patterns of phenomenologically relevant local operators, is also discussed. (orig.)

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

  5. Feynman's path integrals and Bohm's particle paths

    International Nuclear Information System (INIS)

    Tumulka, Roderich

    2005-01-01

    Both Bohmian mechanics, a version of quantum mechanics with trajectories, and Feynman's path integral formalism have something to do with particle paths in space and time. The question thus arises how the two ideas relate to each other. In short, the answer is, path integrals provide a re-formulation of Schroedinger's equation, which is half of the defining equations of Bohmian mechanics. I try to give a clear and concise description of the various aspects of the situation. (letters and comments)

  6. Constraint-Based Local Search for Constrained Optimum Paths Problems

    Science.gov (United States)

    Pham, Quang Dung; Deville, Yves; van Hentenryck, Pascal

    Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algorithms, which are often hard to extend with side constraints and to apply widely. This paper proposes a constraint-based local search (CBLS) framework for COP applications, bringing the compositionality, reuse, and extensibility at the core of CBLS and CP systems. The modeling contribution is the ability to express compositional models for various COP applications at a high level of abstraction, while cleanly separating the model and the search procedure. The main technical contribution is a connected neighborhood based on rooted spanning trees to find high-quality solutions to COP problems. The framework, implemented in COMET, is applied to Resource Constrained Shortest Path (RCSP) problems (with and without side constraints) and to the edge-disjoint paths problem (EDP). Computational results show the potential significance of the approach.

  7. Path coupling and aggregate path coupling

    CERN Document Server

    Kovchegov, Yevgeniy

    2018-01-01

    This book describes and characterizes an extension to the classical path coupling method applied to statistical mechanical models, referred to as aggregate path coupling. In conjunction with large deviations estimates, the aggregate path coupling method is used to prove rapid mixing of Glauber dynamics for a large class of statistical mechanical models, including models that exhibit discontinuous phase transitions which have traditionally been more difficult to analyze rigorously. The book shows how the parameter regions for rapid mixing for several classes of statistical mechanical models are derived using the aggregate path coupling method.

  8. Forces in Motzkin paths in a wedge

    International Nuclear Information System (INIS)

    Janse van Rensburg, E J

    2006-01-01

    Entropic forces in models of Motzkin paths in a wedge geometry are considered as models of forces in polymers in confined geometries. A Motzkin path in the square lattice is a path from the origin to a point in the line Y = X while it never visits sites below this line, and it is constrained to give unit length steps only in the north and east directions and steps of length √2 in the north-east direction. Motzkin path models may be generalized to ensembles of NE-oriented paths above the line Y = rX, where r > 0 is an irrational number. These are paths giving east, north and north-east steps from the origin in the square lattice, and confined to the r-wedge formed by the Y-axis and the line Y = rX. The generating function g r of these paths is not known, but if r > 1, then I determine its radius of convergence to be t r = min (r-1)/r≤y≤r/(r+1) [y y (1-r(1-y)) 1-r(1-y) (r(1-y)-y) r(1-y)-y ] and if r is an element of (0, 1), then t r = 1/3. The entropic force the path exerts on the line Y rX may be computed from this. An asymptotic expression for the force for large values of r is given by F(r) = log(2r)/r 2 - (1+2log(2r))/2r 3 + O (log(2r)/r 4 ). In terms of the vertex angle α of the r-wedge, the moment of the force about the origin has leading terms F(α) log(2/α) - (α/2)(1+2log(2/α)) + O(α 2 log(2/α)) as α → 0 + and F(α) = 0 if α is element of [π/4, π/2]. Moreover, numerical integration of the force shows that the total work done by closing the wedge is 1.085 07... lattice units. An alternative ensemble of NE-oriented paths may be defined by slightly changing the generating function g r . In this model, it is possible to determine closed-form expressions for the limiting free energy and the force. The leading term in an asymptotic expansions for this force agrees with the leading term in the asymptotic expansion of the above model, and the subleading term only differs by a factor of 2

  9. Lattice thermal conductivity in layered BiCuSeO

    KAUST Repository

    Kumar, S.

    2016-06-30

    We quantify the low lattice thermal conductivity in layered BiCuSeO (the oxide with the highest known figure of merit). It turns out that the scattering of acoustical into optical phonons is strongly enhanced in the material because of the special structure of the phonon dispersion. For example, at room temperature the optical phonons account for an enormous 42% of the lattice thermal conductivity. We also quantify the anisotropy of the lattice thermal conductivity and determine the distribution of the mean free path of the phonons at different temperatures to provide a guide for tuning the thermal properties. © the Owner Societies 2016.

  10. Monte Carlo numerical study of lattice field theories

    International Nuclear Information System (INIS)

    Gan Cheekwan; Kim Seyong; Ohta, Shigemi

    1997-01-01

    The authors are interested in the exact first-principle calculations of quantum field theories which are indeed exact ones. For quantum chromodynamics (QCD) at low energy scale, a nonperturbation method is needed, and the only known such method is the lattice method. The path integral can be evaluated by putting a system on a finite 4-dimensional volume and discretizing space time continuum into finite points, lattice. The continuum limit is taken by making the lattice infinitely fine. For evaluating such a finite-dimensional integral, the Monte Carlo numerical estimation of the path integral can be obtained. The calculation of light hadron mass in quenched lattice QCD with staggered quarks, 3-dimensional Thirring model calculation and the development of self-test Monte Carlo method have been carried out by using the RIKEN supercomputer. The motivation of this study, lattice QCD formulation, continuum limit, Monte Carlo update, hadron propagator, light hadron mass, auto-correlation and source size dependence are described on lattice QCD. The phase structure of the 3-dimensional Thirring model for a small 8 3 lattice has been mapped. The discussion on self-test Monte Carlo method is described again. (K.I.)

  11. Nuclear lattice simulations

    Directory of Open Access Journals (Sweden)

    Epelbaum E.

    2010-04-01

    Full Text Available We review recent progress on nuclear lattice simulations using chiral effective field theory. We discuss lattice results for dilute neutron matter at next-to-leading order, three-body forces at next-to-next-toleading order, isospin-breaking and Coulomb effects, and the binding energy of light nuclei.

  12. Lattice Higgs models

    International Nuclear Information System (INIS)

    Jersak, J.

    1986-01-01

    This year has brought a sudden interest in lattice Higgs models. After five years of only modest activity we now have many new results obtained both by analytic and Monte Carlo methods. This talk is a review of the present state of lattice Higgs models with particular emphasis on the recent development

  13. Based on Short Motion Paths and Artificial Intelligence Method for Chinese Chess Game

    Directory of Open Access Journals (Sweden)

    Chien-Ming Hung

    2017-08-01

    Full Text Available The article develops the decision rules to win each set of the Chinese chess game using evaluation algorithm and artificial intelligence method, and uses the mobile robot to be instead of the chess, and presents the movement scenarios using the shortest motion paths for mobile robots. Player can play the Chinese chess game according to the game rules with the supervised computer. The supervised computer decides the optimal motion path to win the set using artificial intelligence method, and controls mobile robots according to the programmed motion paths of the assigned chesses moving on the platform via wireless RF interface. We uses enhance A* searching algorithm to solve the shortest path problem of the assigned chess, and solve the collision problems of the motion paths for two mobile robots moving on the platform simultaneously. We implement a famous set to be called lwild horses run in farmr using the proposed method. First we use simulation method to display the motion paths of the assigned chesses for the player and the supervised computer. Then the supervised computer implements the simulation results on the chessboard platform using mobile robots. Mobile robots move on the chessboard platform according to the programmed motion paths and is guided to move on the centre line of the corridor, and avoid the obstacles (chesses, and detect the cross point of the platform using three reflective IR modules.

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

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

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

  17. Essentially Entropic Lattice Boltzmann Model

    Science.gov (United States)

    Atif, Mohammad; Kolluru, Praveen Kumar; Thantanapally, Chakradhar; Ansumali, Santosh

    2017-12-01

    The entropic lattice Boltzmann model (ELBM), a discrete space-time kinetic theory for hydrodynamics, ensures nonlinear stability via the discrete time version of the second law of thermodynamics (the H theorem). Compliance with the H theorem is numerically enforced in this methodology and involves a search for the maximal discrete path length corresponding to the zero dissipation state by iteratively solving a nonlinear equation. We demonstrate that an exact solution for the path length can be obtained by assuming a natural criterion of negative entropy change, thereby reducing the problem to solving an inequality. This inequality is solved by creating a new framework for construction of Padé approximants via quadrature on appropriate convex function. This exact solution also resolves the issue of indeterminacy in case of nonexistence of the entropic involution step. Since our formulation is devoid of complex mathematical library functions, the computational cost is drastically reduced. To illustrate this, we have simulated a model setup of flow over the NACA-0012 airfoil at a Reynolds number of 2.88 ×106.

  18. On singularities of lattice varieties

    OpenAIRE

    Mukherjee, Himadri

    2013-01-01

    Toric varieties associated with distributive lattices arise as a fibre of a flat degeneration of a Schubert variety in a minuscule. The singular locus of these varieties has been studied by various authors. In this article we prove that the number of diamonds incident on a lattice point $\\a$ in a product of chain lattices is more than or equal to the codimension of the lattice. Using this we also show that the lattice varieties associated with product of chain lattices is smooth.

  19. Ants Colony Optimisation of a Measuring Path of Prismatic Parts on a CMM

    Directory of Open Access Journals (Sweden)

    Stojadinovic Slavenko M.

    2016-03-01

    Full Text Available This paper presents optimisation of a measuring probe path in inspecting the prismatic parts on a CMM. The optimisation model is based on: (i the mathematical model that establishes an initial collision-free path presented by a set of points, and (ii the solution of Travelling Salesman Problem (TSP obtained with Ant Colony Optimisation (ACO. In order to solve TSP, an ACO algorithm that aims to find the shortest path of ant colony movement (i.e. the optimised path is applied. Then, the optimised path is compared with the measuring path obtained with online programming on CMM ZEISS UMM500 and with the measuring path obtained in the CMM inspection module of Pro/ENGINEER® software. The results of comparing the optimised path with the other two generated paths show that the optimised path is at least 20% shorter than the path obtained by on-line programming on CMM ZEISS UMM500, and at least 10% shorter than the path obtained by using the CMM module in Pro/ENGINEER®.

  20. User's guide to Monte Carlo methods for evaluating path integrals

    Science.gov (United States)

    Westbroek, Marise J. E.; King, Peter R.; Vvedensky, Dimitri D.; Dürr, Stephan

    2018-04-01

    We give an introduction to the calculation of path integrals on a lattice, with the quantum harmonic oscillator as an example. In addition to providing an explicit computational setup and corresponding pseudocode, we pay particular attention to the existence of autocorrelations and the calculation of reliable errors. The over-relaxation technique is presented as a way to counter strong autocorrelations. The simulation methods can be extended to compute observables for path integrals in other settings.

  1. Scattering theory for lattice phi4sub(D+1) theory

    International Nuclear Information System (INIS)

    Garczynski, W.

    1983-01-01

    Feynman rules are derived for a lattice version of the phi 4 sub(D+1) theory. The lattice values are transcribed, via a quasicontinual representation, into a continuous, non-local in spatial variables field theory, which is then quantized by the path integral method. (orig.)

  2. Statistics of equally weighted random paths on a class of self-similar structures

    International Nuclear Information System (INIS)

    Knezevic, Milan; Knezevic, Dragica; Spasojevic, Djordje

    2004-01-01

    We study the statistics of equally weighted random walk paths on a family of Sierpinski gasket lattices whose members are labelled by an integer b (2 ≤ b 2, mean path end-to-end distance grows more slowly than any power of its length N. We provide arguments for the emergence of usual power law critical behaviour in the limit b → ∞ when fractal lattices become almost compact

  3. MEETING: Lattice 88

    International Nuclear Information System (INIS)

    Mackenzie, Paul

    1989-01-01

    The forty-year dream of understanding the properties of the strongly interacting particles from first principles is now approaching reality. Quantum chromodynamics (QCD - the field theory of the quark and gluon constituents of strongly interacting particles) was initially handicapped by the severe limitations of the conventional (perturbation) approach in this picture, but Ken Wilson's inventions of lattice gauge theory and renormalization group methods opened new doors, making calculations of masses and other particle properties possible. Lattice gauge theory became a major industry around 1980, when Monte Carlo methods were introduced, and the first prototype calculations yielded qualitatively reasonable results. The promising developments over the past year were highlighted at the 1988 Symposium on Lattice Field Theory - Lattice 88 - held at Fermilab

  4. Angles in hyperbolic lattices

    DEFF Research Database (Denmark)

    Risager, Morten S.; Södergren, Carl Anders

    2017-01-01

    It is well known that the angles in a lattice acting on hyperbolic n -space become equidistributed. In this paper we determine a formula for the pair correlation density for angles in such hyperbolic lattices. Using this formula we determine, among other things, the asymptotic behavior of the den......It is well known that the angles in a lattice acting on hyperbolic n -space become equidistributed. In this paper we determine a formula for the pair correlation density for angles in such hyperbolic lattices. Using this formula we determine, among other things, the asymptotic behavior...... of the density function in both the small and large variable limits. This extends earlier results by Boca, Pasol, Popa and Zaharescu and Kelmer and Kontorovich in dimension 2 to general dimension n . Our proofs use the decay of matrix coefficients together with a number of careful estimates, and lead...

  5. Reactor lattice codes

    International Nuclear Information System (INIS)

    Kulikowska, T.

    1999-01-01

    The present lecture has a main goal to show how the transport lattice calculations are realised in a standard computer code. This is illustrated on the example of the WIMSD code, belonging to the most popular tools for reactor calculations. Most of the approaches discussed here can be easily modified to any other lattice code. The description of the code assumes the basic knowledge of reactor lattice, on the level given in the lecture on 'Reactor lattice transport calculations'. For more advanced explanation of the WIMSD code the reader is directed to the detailed descriptions of the code cited in References. The discussion of the methods and models included in the code is followed by the generally used homogenisation procedure and several numerical examples of discrepancies in calculated multiplication factors based on different sources of library data. (author)

  6. MEETING: Lattice 88

    Energy Technology Data Exchange (ETDEWEB)

    Mackenzie, Paul

    1989-03-15

    The forty-year dream of understanding the properties of the strongly interacting particles from first principles is now approaching reality. Quantum chromodynamics (QCD - the field theory of the quark and gluon constituents of strongly interacting particles) was initially handicapped by the severe limitations of the conventional (perturbation) approach in this picture, but Ken Wilson's inventions of lattice gauge theory and renormalization group methods opened new doors, making calculations of masses and other particle properties possible. Lattice gauge theory became a major industry around 1980, when Monte Carlo methods were introduced, and the first prototype calculations yielded qualitatively reasonable results. The promising developments over the past year were highlighted at the 1988 Symposium on Lattice Field Theory - Lattice 88 - held at Fermilab.

  7. Computers for Lattice QCD

    International Nuclear Information System (INIS)

    Christ, Norman H

    2000-01-01

    The architecture and capabilities of the computers currently in use for large-scale lattice QCD calculations are described and compared. Based on this present experience, possible future directions are discussed

  8. Reactor lattice codes

    International Nuclear Information System (INIS)

    Kulikowska, T.

    2001-01-01

    The description of reactor lattice codes is carried out on the example of the WIMSD-5B code. The WIMS code in its various version is the most recognised lattice code. It is used in all parts of the world for calculations of research and power reactors. The version WIMSD-5B is distributed free of charge by NEA Data Bank. The description of its main features given in the present lecture follows the aspects defined previously for lattice calculations in the lecture on Reactor Lattice Transport Calculations. The spatial models are described, and the approach to the energy treatment is given. Finally the specific algorithm applied in fuel depletion calculations is outlined. (author)

  9. Lattice gauge theories

    International Nuclear Information System (INIS)

    Petronzio, R.

    1992-01-01

    Lattice gauge theories are about fifteen years old and I will report on the present status of the field without making the elementary introduction that can be found in the proceedings of the last two conferences. The talk covers briefly the following subjects: the determination of α s , the status of spectroscopy, heavy quark physics and in particular the calculation of their hadronic weak matrix elements, high temperature QCD, non perturbative Higgs bounds, chiral theories on the lattice and induced theories

  10. Permutohedral Lattice CNNs

    OpenAIRE

    Kiefel, Martin; Jampani, Varun; Gehler, Peter V.

    2014-01-01

    This paper presents a convolutional layer that is able to process sparse input features. As an example, for image recognition problems this allows an efficient filtering of signals that do not lie on a dense grid (like pixel position), but of more general features (such as color values). The presented algorithm makes use of the permutohedral lattice data structure. The permutohedral lattice was introduced to efficiently implement a bilateral filter, a commonly used image processing operation....

  11. Fractional path planning and path tracking

    International Nuclear Information System (INIS)

    Melchior, P.; Jallouli-Khlif, R.; Metoui, B.

    2011-01-01

    This paper presents the main results of the application of fractional approach in path planning and path tracking. A new robust path planning design for mobile robot was studied in dynamic environment. The normalized attractive force applied to the robot is based on a fictitious fractional attractive potential. This method allows to obtain robust path planning despite robot mass variation. The danger level of each obstacles is characterized by the fractional order of the repulsive potential of the obstacles. Under these conditions, the robot dynamic behavior was studied by analyzing its X - Y path planning with dynamic target or dynamic obstacles. The case of simultaneously mobile obstacles and target is also considered. The influence of the robot mass variation is studied and the robustness analysis of the obtained path shows the robustness improvement due to the non integer order properties. Pre shaping approach is used to reduce system vibration in motion control. Desired systems inputs are altered so that the system finishes the requested move without residual vibration. This technique, developed by N.C. Singer and W.P.Seering, is used for flexible structure control, particularly in the aerospace field. In a previous work, this method was extended for explicit fractional derivative systems and applied to second generation CRONE control, the robustness was also studied. CRONE (the French acronym of C ommande Robuste d'Ordre Non Entier ) control system design is a frequency-domain based methodology using complex fractional integration.

  12. Additive lattice kirigami.

    Science.gov (United States)

    Castle, Toen; Sussman, Daniel M; Tanis, Michael; Kamien, Randall D

    2016-09-01

    Kirigami uses bending, folding, cutting, and pasting to create complex three-dimensional (3D) structures from a flat sheet. In the case of lattice kirigami, this cutting and rejoining introduces defects into an underlying 2D lattice in the form of points of nonzero Gaussian curvature. A set of simple rules was previously used to generate a wide variety of stepped structures; we now pare back these rules to their minimum. This allows us to describe a set of techniques that unify a wide variety of cut-and-paste actions under the rubric of lattice kirigami, including adding new material and rejoining material across arbitrary cuts in the sheet. We also explore the use of more complex lattices and the different structures that consequently arise. Regardless of the choice of lattice, creating complex structures may require multiple overlapping kirigami cuts, where subsequent cuts are not performed on a locally flat lattice. Our additive kirigami method describes such cuts, providing a simple methodology and a set of techniques to build a huge variety of complex 3D shapes.

  13. MultiPaths Revisited - A novel approach using OpenFlow-enabled devices

    CERN Document Server

    Al-Shabibi, Ali; Martin, Brian

    2011-06-11

    This thesis presents novel approaches enhancing the performance of computer networks using multipaths. Our enhancements take the form of congestion-aware routing protocols. We present three protocols called MultiRoute, Step-Route, and finally PathRoute. Each of these protocols leverage both local and remote congestion statistics and build different representations (or views) of the network congestion by using an innovative representation of congestion for router-router links. These congestion statistics are then distributed via an aggregation protocol to other routers in the network. For many years, multipath routing protocols have only been used in simple situations, such as Link Aggregation and/or networks where paths of equal cost (and therefore equal delay) exist. But, paths of unequal costs are often discarded to the benefit of shortest path only routing because it is known that paths of unequal length present different delays and therefore cause out of order packets which cause catastrophic network per...

  14. Gauge theory on a lattice, 1984: proceedings

    International Nuclear Information System (INIS)

    Zachos, C.; Celmaster, W.; Kovacs, E.; Sivers, D.

    1984-06-01

    In the past few years there have been rapid advances in understanding quantum field theory by making discrete approximations of the path integral functional. This approach offers a systematic alternative to perturbation theory and opens up the possibility of first-principles calculation of new classes of observables. Computer simulations based on lattice regularization have already provided intriguing insights into the long-distance behavior of quantum chromodynamics. The objective of the workshop was to bring together researchers using lattice techniques for a discussion of current projects and problems. These proceedings aim to communicate the results to a broader segment of the research community. Separate entries were made in the data base for 26 of the 31 papers presented. Five papers were previously included in the data base

  15. Lattice regularized chiral perturbation theory

    International Nuclear Information System (INIS)

    Borasoy, Bugra; Lewis, Randy; Ouimet, Pierre-Philippe A.

    2004-01-01

    Chiral perturbation theory can be defined and regularized on a spacetime lattice. A few motivations are discussed here, and an explicit lattice Lagrangian is reviewed. A particular aspect of the connection between lattice chiral perturbation theory and lattice QCD is explored through a study of the Wess-Zumino-Witten term

  16. Vortex lattices in layered superconductors

    International Nuclear Information System (INIS)

    Prokic, V.; Davidovic, D.; Dobrosavljevic-Grujic, L.

    1995-01-01

    We study vortex lattices in a superconductor--normal-metal superlattice in a parallel magnetic field. Distorted lattices, resulting from the shear deformations along the layers, are found to be unstable. Under field variation, nonequilibrium configurations undergo an infinite sequence of continuous transitions, typical for soft lattices. The equilibrium vortex arrangement is always a lattice of isocell triangles, without shear

  17. An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning

    Directory of Open Access Journals (Sweden)

    Nizar Hadi Abbas

    2016-07-01

    Full Text Available This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In order to evaluate the proposed algorithm in term of finding the best solution, six benchmark test functions are used to make a comparison between AMOPSO and the standard MOPSO. The results show that the AMOPSO has a better ability to get away from local optimums with a quickest convergence than the MOPSO. The simulation results using Matlab 2014a, indicate that this methodology is extremely valuable for every robot in multi-robot framework to discover its own particular proper pa‌th from the start to the destination position with minimum distance and time.

  18. Information spread of emergency events: path searching on social networks.

    Science.gov (United States)

    Dai, Weihui; Hu, Hongzhi; Wu, Tunan; Dai, Yonghui

    2014-01-01

    Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning.

  19. Information Spread of Emergency Events: Path Searching on Social Networks

    Directory of Open Access Journals (Sweden)

    Weihui Dai

    2014-01-01

    Full Text Available Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning.

  20. Vervet monkeys use paths consistent with context-specific spatial movement heuristics.

    Science.gov (United States)

    Teichroeb, Julie A

    2015-10-01

    Animal foraging routes are analogous to the computationally demanding "traveling salesman problem" (TSP), where individuals must find the shortest path among several locations before returning to the start. Humans approximate solutions to TSPs using simple heuristics or "rules of thumb," but our knowledge of how other animals solve multidestination routing problems is incomplete. Most nonhuman primate species have shown limited ability to route plan. However, captive vervets were shown to solve a TSP for six sites. These results were consistent with either planning three steps ahead or a risk-avoidance strategy. I investigated how wild vervet monkeys (Chlorocebus pygerythrus) solved a path problem with six, equally rewarding food sites; where site arrangement allowed assessment of whether vervets found the shortest route and/or used paths consistent with one of three simple heuristics to navigate. Single vervets took the shortest possible path in fewer than half of the trials, usually in ways consistent with the most efficient heuristic (the convex hull). When in competition, vervets' paths were consistent with different, more efficient heuristics dependent on their dominance rank (a cluster strategy for dominants and the nearest neighbor rule for subordinates). These results suggest that, like humans, vervets may solve multidestination routing problems by applying simple, adaptive, context-specific "rules of thumb." The heuristics that were consistent with vervet paths in this study are the same as some of those asserted to be used by humans. These spatial movement strategies may have common evolutionary roots and be part of a universal mental navigational toolkit. Alternatively, they may have emerged through convergent evolution as the optimal way to solve multidestination routing problems.

  1. Wess-Zumino-Witten term on the lattice

    International Nuclear Information System (INIS)

    Fujiwara, Takanori; Suzuki, Hiroshi; Matsui, Kosuke; Yamamoto, Masaru

    2003-01-01

    We construct the Wess-Zumino-Witten (WZW) term in lattice gauge theory by using a Dirac operator which obeys the Ginsparg-Wilson relation. Topological properties of the WZW term known in the continuum are reproduced on the lattice as a consequence of a non-trivial topological structure of the space of admissible lattice gauge fields. In the course of this analysis, we observe that the gauge anomaly generally implies that there is no basis of a Weyl fermion which leads to a single-valued expectation value in the fermion sector. The lattice Witten term, which carries information of a gauge path along which the gauge anomaly is integrated, is separated from the WZW term and the multivaluedness of the Witten term is shown to be related to the homotopy group π 2n+1 (G). We also discuss the global SU(2) anomaly on the basis of the WZW term. (author)

  2. Path-dependent functions

    International Nuclear Information System (INIS)

    Khrapko, R.I.

    1985-01-01

    A uniform description of various path-dependent functions is presented with the help of expansion of the type of the Taylor series. So called ''path-integrals'' and ''path-tensor'' are introduced which are systems of many-component quantities whose values are defined for arbitrary paths in coordinated region of space in such a way that they contain a complete information on the path. These constructions are considered as elementary path-dependent functions and are used instead of power monomials in the usual Taylor series. Coefficients of such an expansion are interpreted as partial derivatives dependent on the order of the differentiations or else as nonstandard cavariant derivatives called two-point derivatives. Some examples of pathdependent functions are presented.Space curvature tensor is considered whose geometrica properties are determined by the (non-transitive) translator of parallel transport of a general type. Covariant operation leading to the ''extension'' of tensor fiels is pointed out

  3. Iterated Leavitt Path Algebras

    International Nuclear Information System (INIS)

    Hazrat, R.

    2009-11-01

    Leavitt path algebras associate to directed graphs a Z-graded algebra and in their simplest form recover the Leavitt algebras L(1,k). In this note, we introduce iterated Leavitt path algebras associated to directed weighted graphs which have natural ± Z grading and in their simplest form recover the Leavitt algebras L(n,k). We also characterize Leavitt path algebras which are strongly graded. (author)

  4. Pulled Motzkin paths

    Energy Technology Data Exchange (ETDEWEB)

    Janse van Rensburg, E J, E-mail: rensburg@yorku.c [Department of Mathematics and Statistics, York University, Toronto, ON, M3J 1P3 (Canada)

    2010-08-20

    In this paper the models of pulled Dyck paths in Janse van Rensburg (2010 J. Phys. A: Math. Theor. 43 215001) are generalized to pulled Motzkin path models. The generating functions of pulled Motzkin paths are determined in terms of series over trinomial coefficients and the elastic response of a Motzkin path pulled at its endpoint (see Orlandini and Whittington (2004 J. Phys. A: Math. Gen. 37 5305-14)) is shown to be R(f) = 0 for forces pushing the endpoint toward the adsorbing line and R(f) = f(1 + 2cosh f))/(2sinh f) {yields} f as f {yields} {infinity}, for forces pulling the path away from the X-axis. In addition, the elastic response of a Motzkin path pulled at its midpoint is shown to be R(f) = 0 for forces pushing the midpoint toward the adsorbing line and R(f) = f(1 + 2cosh (f/2))/sinh (f/2) {yields} 2f as f {yields} {infinity}, for forces pulling the path away from the X-axis. Formal combinatorial identities arising from pulled Motzkin path models are also presented. These identities are the generalization of combinatorial identities obtained in directed paths models to their natural trinomial counterparts.

  5. Pulled Motzkin paths

    Science.gov (United States)

    Janse van Rensburg, E. J.

    2010-08-01

    In this paper the models of pulled Dyck paths in Janse van Rensburg (2010 J. Phys. A: Math. Theor. 43 215001) are generalized to pulled Motzkin path models. The generating functions of pulled Motzkin paths are determined in terms of series over trinomial coefficients and the elastic response of a Motzkin path pulled at its endpoint (see Orlandini and Whittington (2004 J. Phys. A: Math. Gen. 37 5305-14)) is shown to be R(f) = 0 for forces pushing the endpoint toward the adsorbing line and R(f) = f(1 + 2cosh f))/(2sinh f) → f as f → ∞, for forces pulling the path away from the X-axis. In addition, the elastic response of a Motzkin path pulled at its midpoint is shown to be R(f) = 0 for forces pushing the midpoint toward the adsorbing line and R(f) = f(1 + 2cosh (f/2))/sinh (f/2) → 2f as f → ∞, for forces pulling the path away from the X-axis. Formal combinatorial identities arising from pulled Motzkin path models are also presented. These identities are the generalization of combinatorial identities obtained in directed paths models to their natural trinomial counterparts.

  6. Pulled Motzkin paths

    International Nuclear Information System (INIS)

    Janse van Rensburg, E J

    2010-01-01

    In this paper the models of pulled Dyck paths in Janse van Rensburg (2010 J. Phys. A: Math. Theor. 43 215001) are generalized to pulled Motzkin path models. The generating functions of pulled Motzkin paths are determined in terms of series over trinomial coefficients and the elastic response of a Motzkin path pulled at its endpoint (see Orlandini and Whittington (2004 J. Phys. A: Math. Gen. 37 5305-14)) is shown to be R(f) = 0 for forces pushing the endpoint toward the adsorbing line and R(f) = f(1 + 2cosh f))/(2sinh f) → f as f → ∞, for forces pulling the path away from the X-axis. In addition, the elastic response of a Motzkin path pulled at its midpoint is shown to be R(f) = 0 for forces pushing the midpoint toward the adsorbing line and R(f) = f(1 + 2cosh (f/2))/sinh (f/2) → 2f as f → ∞, for forces pulling the path away from the X-axis. Formal combinatorial identities arising from pulled Motzkin path models are also presented. These identities are the generalization of combinatorial identities obtained in directed paths models to their natural trinomial counterparts.

  7. Dynamical lattice theory

    International Nuclear Information System (INIS)

    Chodos, A.

    1978-01-01

    A version of lattice gauge theory is presented in which the shape of the lattice is not assumed at the outset but is a consequence of the dynamics. Other related features which are not specified a priori include the internal and space-time symmetry groups and the dimensionality of space-time. The theory possesses a much larger invariance group than the usual gauge group on a lattice, and has associated with it an integer k 0 analogous to the topological quantum numer of quantum chromodynamics. Families of semiclassical solutions are found which are labeled by k 0 and a second integer x, but the analysis is not carried far enough to determine which space-time and internal symmetry groups characterize the lowest-lying states of the theory

  8. Graphene antidot lattice waveguides

    DEFF Research Database (Denmark)

    Pedersen, Jesper Goor; Gunst, Tue; Markussen, Troels

    2012-01-01

    We introduce graphene antidot lattice waveguides: nanostructured graphene where a region of pristine graphene is sandwiched between regions of graphene antidot lattices. The band gaps in the surrounding antidot lattices enable localized states to emerge in the central waveguide region. We model...... the waveguides via a position-dependent mass term in the Dirac approximation of graphene and arrive at analytical results for the dispersion relation and spinor eigenstates of the localized waveguide modes. To include atomistic details we also use a tight-binding model, which is in excellent agreement...... with the analytical results. The waveguides resemble graphene nanoribbons, but without the particular properties of ribbons that emerge due to the details of the edge. We show that electrons can be guided through kinks without additional resistance and that transport through the waveguides is robust against...

  9. Lattice Methods and the Nuclear Few- and Many-Body Problem

    Science.gov (United States)

    Lee, Dean

    This chapter builds upon the review of lattice methods and effective field theory of the previous chapter. We begin with a brief overview of lattice calculations using chiral effective field theory and some recent applications. We then describe several methods for computing scattering on the lattice. After that we focus on the main goal, explaining the theory and algorithms relevant to lattice simulations of nuclear few- and many-body systems. We discuss the exact equivalence of four different lattice formalisms, the Grassmann path integral, transfer matrix operator, Grassmann path integral with auxiliary fields, and transfer matrix operator with auxiliary fields. Along with our analysis we include several coding examples and a number of exercises for the calculations of few- and many-body systems at leading order in chiral effective field theory.

  10. Exact Lattice Supersymmetry

    Energy Technology Data Exchange (ETDEWEB)

    Catterall, Simon; Kaplan, David B.; Unsal, Mithat

    2009-03-31

    We provide an introduction to recent lattice formulations of supersymmetric theories which are invariant under one or more real supersymmetries at nonzero lattice spacing. These include the especially interesting case of N = 4 SYM in four dimensions. We discuss approaches based both on twisted supersymmetry and orbifold-deconstruction techniques and show their equivalence in the case of gauge theories. The presence of an exact supersymmetry reduces and in some cases eliminates the need for fine tuning to achieve a continuum limit invariant under the full supersymmetry of the target theory. We discuss open problems.

  11. Multi-Dimensional Path Queries

    DEFF Research Database (Denmark)

    Bækgaard, Lars

    1998-01-01

    to create nested path structures. We present an SQL-like query language that is based on path expressions and we show how to use it to express multi-dimensional path queries that are suited for advanced data analysis in decision support environments like data warehousing environments......We present the path-relationship model that supports multi-dimensional data modeling and querying. A path-relationship database is composed of sets of paths and sets of relationships. A path is a sequence of related elements (atoms, paths, and sets of paths). A relationship is a binary path...

  12. Unique Path Partitions

    DEFF Research Database (Denmark)

    Bessenrodt, Christine; Olsson, Jørn Børling; Sellers, James A.

    2013-01-01

    We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions.......We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions....

  13. Hamiltonian path integrals

    International Nuclear Information System (INIS)

    Prokhorov, L.V.

    1982-01-01

    The properties of path integrals associated with the allowance for nonstandard terms reflecting the operator nature of the canonical variables are considered. Rules for treating such terms (''equivalence rules'') are formulated. Problems with a boundary, the behavior of path integrals under canonical transformations, and the problem of quantization of dynamical systems with constraints are considered in the framework of the method

  14. Quarks, gluons and lattices

    International Nuclear Information System (INIS)

    Krojts, M.

    1987-01-01

    The book by the known american physicist-theoretist M.Kreuts represents the first monography in world literature, where a new perspective direction in elementary particle physics and quantum field theory - lattice formulation of gauge theories is stated systematically. Practically all main ideas of this direction are given. Material is stated in systematic and understandable form

  15. Phenomenology Using Lattice QCD

    Science.gov (United States)

    Gupta, R.

    2005-08-01

    This talk provides a brief summary of the status of lattice QCD calculations of the light quark masses and the kaon bag parameter BK. Precise estimates of these four fundamental parameters of the standard model, i.e., mu, md, ms and the CP violating parameter η, help constrain grand unified models and could provide a window to new physics.

  16. Baryons on the lattice

    International Nuclear Information System (INIS)

    Bali, G.S.

    2005-01-01

    I comment on progress of lattice QCD techniques and calculations. Recent results on pentaquark masses as well as of the spectrum of excited baryons are summarized and interpreted. The present state of calculations of quantities related to the nucleon structure and of electromagnetic transition form factors is surveyed

  17. Finite lattice extrapolation algorithms

    International Nuclear Information System (INIS)

    Henkel, M.; Schuetz, G.

    1987-08-01

    Two algorithms for sequence extrapolation, due to von den Broeck and Schwartz and Bulirsch and Stoer are reviewed and critically compared. Applications to three states and six states quantum chains and to the (2+1)D Ising model show that the algorithm of Bulirsch and Stoer is superior, in particular if only very few finite lattice data are available. (orig.)

  18. Lattice Multiverse Models

    OpenAIRE

    Williamson, S. Gill

    2010-01-01

    Will the cosmological multiverse, when described mathematically, have easily stated properties that are impossible to prove or disprove using mathematical physics? We explore this question by constructing lattice multiverses which exhibit such behavior even though they are much simpler mathematically than any likely cosmological multiverse.

  19. Quantum lattice problems

    NARCIS (Netherlands)

    de Raedt, Hans; von der Linden, W.; Binder, K

    1995-01-01

    In this chapter we review methods currently used to perform Monte Carlo calculations for quantum lattice models. A detailed exposition is given of the formalism underlying the construction of the simulation algorithms. We discuss the fundamental and technical difficulties that are encountered and

  20. Convex Lattice Polygons

    Science.gov (United States)

    Scott, Paul

    2006-01-01

    A "convex" polygon is one with no re-entrant angles. Alternatively one can use the standard convexity definition, asserting that for any two points of the convex polygon, the line segment joining them is contained completely within the polygon. In this article, the author provides a solution to a problem involving convex lattice polygons.

  1. Lattices for antiproton rings

    International Nuclear Information System (INIS)

    Autin, B.

    1984-01-01

    After a description of the constraints imposed by the cooling of Antiprotons on the lattice of the rings, the reasons which motivate the shape and the structure of these machines are surveyed. Linear and non-linear beam optics properties are treated with a special amplification to the Antiproton Accumulator. (orig.)

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

  3. Unquenched lattice upsilon spectroscopy

    International Nuclear Information System (INIS)

    Marcantonio, L.M.

    2001-03-01

    A non-relativistic effective theory of QCD (NRQCD) is used in calculations of the upsilon spectrum. Simultaneous multi-correlation fitting routines are used to yield lattice channel energies and amplitudes. The lattice configurations used were both dynamical, with two flavours of sea quarks included in the action; and quenched, with no sea quarks. These configurations were generated by the UKQCD collaboration. The dynamical configurations used were ''matched'', having the same lattice spacing, but differing in the sea quark mass. Thus, it was possible to analyse trends of observables with sea quark mass, in the certainty that the trend isn't partially due to varying lattice spacing. The lattice spacing used for spectroscopy was derived from the lattice 1 1 P 1 - 1 3 S 1 splitting. On each set of configurations two lattice bare b quark masses were used, giving kinetic masses bracketing the physical Υ mass. The only quantity showing a strong dependence on these masses was the hyperfine splitting, so it was interpolated to the real Υ mass. The radial and orbital splittings gave good agreement with experiment. The hyperfine splitting results showed a clear signal for unquenching and the dynamical hyperfine splitting results were extrapolated to a physical sea quark mass. This result, combined with the quenched result yielded a value for the hyperfine splitting at n f = 3, predicting an η b mass of 9.517(4) GeV. The NRQCD technique for obtaining a value of the strong coupling constant in the M-barS-bar scheme was followed. Using quenched and dynamical results a value was extrapolated to n f = 3. Employing a three loop beta function to run the coupling, with suitable matching conditions at heavy quark thresholds, the final result was obtained for n f = 5 at a scale equal to the Z boson mass. This result was α(5)/MS(Mz)=0.110(4). Two methods for finding the mass of the b quark in the MS scheme were employed. The results of both methods agree within error but the

  4. Mobile Robots Path Planning Using the Overall Conflict Resolution and Time Baseline Coordination

    Directory of Open Access Journals (Sweden)

    Yong Ma

    2014-01-01

    Full Text Available This paper aims at resolving the path planning problem in a time-varying environment based on the idea of overall conflict resolution and the algorithm of time baseline coordination. The basic task of the introduced path planning algorithms is to fulfill the automatic generation of the shortest paths from the defined start poses to their end poses with consideration of generous constraints for multiple mobile robots. Building on this, by using the overall conflict resolution, within the polynomial based paths, we take into account all the constraints including smoothness, motion boundary, kinematics constraints, obstacle avoidance, and safety constraints among robots together. And time baseline coordination algorithm is proposed to process the above formulated problem. The foremost strong point is that much time can be saved with our approach. Numerical simulations verify the effectiveness of our approach.

  5. A space-time lattice version of scalar electrodynamics

    International Nuclear Information System (INIS)

    Kijowski, J.; Thielmann, A.

    1993-10-01

    A Minkowski-lattice version of quantum scalar electrodynamics is constructed. Quantum field is consequently described in a gauge-independent way, i.e. the algebra of quantum observables of the theory is generated by gauge-invariant operators assigned to zero-, one-, and two-dimensional elements of the lattice. The operators satisfy canonical commutation relations. Field dynamics is formulated in terms of difference equations imposed on the field operators. The dynamics is obtained from a discrete version of the path-integral. (author). 19 refs

  6. Feasible Path Generation Using Bezier Curves for Car-Like Vehicle

    Science.gov (United States)

    Latip, Nor Badariyah Abdul; Omar, Rosli

    2017-08-01

    When planning a collision-free path for an autonomous vehicle, the main criteria that have to be considered are the shortest distance, lower computation time and completeness, i.e. a path can be found if one exists. Besides that, a feasible path for the autonomous vehicle is also crucial to guarantee that the vehicle can reach the target destination considering its kinematic constraints such as non-holonomic and minimum turning radius. In order to address these constraints, Bezier curves is applied. In this paper, Bezier curves are modeled and simulated using Matlab software and the feasibility of the resulting path is analyzed. Bezier curve is derived from a piece-wise linear pre-planned path. It is found that the Bezier curves has the capability of making the planned path feasible and could be embedded in a path planning algorithm for an autonomous vehicle with kinematic constraints. It is concluded that the length of segments of the pre-planned path have to be greater than a nominal value, derived from the vehicle wheelbase, maximum steering angle and maximum speed to ensure the path for the autonomous car is feasible.

  7. Covariant path integrals on hyperbolic surfaces

    Science.gov (United States)

    Schaefer, Joe

    1997-11-01

    DeWitt's covariant formulation of path integration [B. De Witt, "Dynamical theory in curved spaces. I. A review of the classical and quantum action principles," Rev. Mod. Phys. 29, 377-397 (1957)] has two practical advantages over the traditional methods of "lattice approximations;" there is no ordering problem, and classical symmetries are manifestly preserved at the quantum level. Applying the spectral theorem for unbounded self-adjoint operators, we provide a rigorous proof of the convergence of certain path integrals on Riemann surfaces of constant curvature -1. The Pauli-DeWitt curvature correction term arises, as in DeWitt's work. Introducing a Fuchsian group Γ of the first kind, and a continuous, bounded, Γ-automorphic potential V, we obtain a Feynman-Kac formula for the automorphic Schrödinger equation on the Riemann surface ΓH. We analyze the Wick rotation and prove the strong convergence of the so-called Feynman maps [K. D. Elworthy, Path Integration on Manifolds, Mathematical Aspects of Superspace, edited by Seifert, Clarke, and Rosenblum (Reidel, Boston, 1983), pp. 47-90] on a dense set of states. Finally, we give a new proof of some results in C. Grosche and F. Steiner, "The path integral on the Poincare upper half plane and for Liouville quantum mechanics," Phys. Lett. A 123, 319-328 (1987).

  8. Directed paths in a layered environment

    International Nuclear Information System (INIS)

    Alvarez, J; Janse van Rensburg, E J

    2008-01-01

    A polymer in a layered environment is modeled as a directed path in a layered square lattice composed of alternating A-layers of width w a and B-layers of width w b . In this paper we consider general cases of this model, where edges in the path interact with the layers, and vertices in the path interact with interfaces between adjacent layers. The phase diagram exhibits different regimes. In particular, we found that the path may be localized to one layer, be adsorbed on an interface between two layers or be delocalized across layers. We examine special aspects of the model in detail: the asymptotic regimes of the models are examined, and entropic forces on the interfaces are determined. We focus on several different cases, including models with layers of equal or similar width. More general models of layers with different but finite widths, or with one layer of infinite width, are also examined in detail. Several of these models exhibit phase behavior which relate to well-studied polymer phase behavior such as adsorption at an impenetrable wall, pinning at an interface between two immiscible solvents, steric stabilization of colloidal particles and sensitized flocculation of colloidal particles by polymers

  9. Superspace approach to lattice supersymmetry

    International Nuclear Information System (INIS)

    Kostelecky, V.A.; Rabin, J.M.

    1984-01-01

    We construct a cubic lattice of discrete points in superspace, as well as a discrete subgroup of the supersymmetry group which maps this ''superlattice'' into itself. We discuss the connection between this structure and previous versions of lattice supersymmetry. Our approach clarifies the mathematical problems of formulating supersymmetric lattice field theories and suggests new methods for attacking them

  10. Basis reduction for layered lattices

    NARCIS (Netherlands)

    Torreão Dassen, Erwin

    2011-01-01

    We develop the theory of layered Euclidean spaces and layered lattices. We present algorithms to compute both Gram-Schmidt and reduced bases in this generalized setting. A layered lattice can be seen as lattices where certain directions have infinite weight. It can also be

  11. An overview of lattice QCD

    International Nuclear Information System (INIS)

    Woloshyn, R.M.

    1988-03-01

    The basic concepts of the Lagrangian formulation of lattice field theory are discussed. The Wilson and staggered schemes for dealing with fermions on the lattice are described. Some recent results for hadron masses and vector and axial vector current matrix elements in lattice QCD are reviewed. (Author) (118 refs., 16 figs.)

  12. Basis reduction for layered lattices

    NARCIS (Netherlands)

    E.L. Torreão Dassen (Erwin)

    2011-01-01

    htmlabstractWe develop the theory of layered Euclidean spaces and layered lattices. With this new theory certain problems that usually are solved by using classical lattices with a "weighting" gain a new, more natural form. Using the layered lattice basis reduction algorithms introduced here these

  13. Path integration quantization

    International Nuclear Information System (INIS)

    DeWitt-Morette, C.

    1983-01-01

    Much is expected of path integration as a quantization procedure. Much more is possible if one recognizes that path integration is at the crossroad of stochastic and differential calculus and uses the full power of both stochastic and differential calculus in setting up and computing path integrals. In contrast to differential calculus, stochastic calculus has only comparatively recently become an instrument of thought. It has nevertheless already been used in a variety of challenging problems, for instance in the quantization problem. The author presents some applications of the stochastic scheme. (Auth.)

  14. Two dimensional simplicial paths

    International Nuclear Information System (INIS)

    Piso, M.I.

    1994-07-01

    Paths on the R 3 real Euclidean manifold are defined as 2-dimensional simplicial strips which are orbits of the action of a discrete one-parameter group. It is proven that there exists at least one embedding of R 3 in the free Z-module generated by S 2 (x 0 ). The speed is defined as the simplicial derivative of the path. If mass is attached to the simplex, the free Lagrangian is proportional to the width of the path. In the continuum limit, the relativistic form of the Lagrangian is recovered. (author). 7 refs

  15. Zero-Slack, Noncritical Paths

    Science.gov (United States)

    Simons, Jacob V., Jr.

    2017-01-01

    The critical path method/program evaluation and review technique method of project scheduling is based on the importance of managing a project's critical path(s). Although a critical path is the longest path through a network, its location in large projects is facilitated by the computation of activity slack. However, logical fallacies in…

  16. Datagrids for lattice QCD

    Energy Technology Data Exchange (ETDEWEB)

    Buechner, O. [Zentralinstitut fuer Angewandte Mathematik ZAM, 52425 Juelich (Germany); Ernst, M. [Deutsches Elektronen-Synchrotron DESY, 22603 Hamburg (Germany); Jansen, K. [John von Neumann-Institut fuer Computing NIC/DESY, 15738 Zeuthen (Germany); Lippert, Th. [Zentralinstitut fuer Angewandte Mathematik ZAM, 52425 Juelich (Germany); Melkumyan, D. [Deutsches Elektronen-Synchrotron DESY, 15738 Zeuthen (Germany); Orth, B. [Zentralinstitut fuer Angewandte Mathematik ZAM, 52425 Juelich (Germany); Pleiter, D. [John von Neumann-Institut fuer Computing NIC/DESY, 15738 Zeuthen (Germany)]. E-mail: dirk.pleiter@desy.de; Stueben, H. [Konrad-Zuse-Institut fuer Informationstechnik ZIB, 14195 Berlin (Germany); Wegner, P. [Deutsches Elektronen-Synchrotron DESY, 15738 Zeuthen (Germany); Wollny, S. [Konrad-Zuse-Institut fuer Informationstechnik ZIB, 14195 Berlin (Germany)

    2006-04-01

    As the need for computing resources to carry out numerical simulations of Quantum Chromodynamics (QCD) formulated on a lattice has increased significantly, efficient use of the generated data has become a major concern. To improve on this, groups plan to share their configurations on a worldwide level within the International Lattice DataGrid (ILDG). Doing so requires standardized description of the configurations, standards on binary file formats and common middleware interfaces. We describe the requirements and problems, and discuss solutions. Furthermore, an overview is given on the implementation of the LatFor DataGrid [http://www-zeuthen.desy.de/latfor/ldg], a France/German/Italian grid that will be one of the regional grids within the ILDG grid-of-grids concept.

  17. Lattice QCD for cosmology

    International Nuclear Information System (INIS)

    Borsanyi, Sz.; Kampert, K.H.; Fodor, Z.; Forschungszentrum Juelich; Eoetvoes Univ., Budapest

    2016-06-01

    We present a full result for the equation of state (EoS) in 2+1+1 (up/down, strange and charm quarks are present) flavour lattice QCD. We extend this analysis and give the equation of state in 2+1+1+1 flavour QCD. In order to describe the evolution of the universe from temperatures several hundreds of GeV to the MeV scale we also include the known effects of the electroweak theory and give the effective degree of freedoms. As another application of lattice QCD we calculate the topological susceptibility (χ) up to the few GeV temperature region. These two results, EoS and χ, can be used to predict the dark matter axion's mass in the post-inflation scenario and/or give the relationship between the axion's mass and the universal axionic angle, which acts as a initial condition of our universe.

  18. Lattice vibration spectra. 16

    International Nuclear Information System (INIS)

    Lutz, H.D.; Willich, P.

    1977-01-01

    The FIR absorption spectra of pyrite type compounds RuS 2 , RuSsub(2-x)Sesub(x), RuSe 2 , RuTe 2 , OsS 2 , OsSe 2 , and PtP 2 as well as loellingite type phosphides FeP 2 , RuP 2 , and OsP 2 are reported. For RuS 2 , RuSe 2 , RuTe 2 , OsS 2 , and PtP 2 all of the five infrared allowed modes (k = 0) are observed. As a first result of a numerical normal coordinate treatment vibration forms of pyrite structure are communicated. The spectra show that lattice forces of corresponding sulfides, tellurides, and phosphides are about the same strength, but increase strongly by substitution of iron by ruthenium and especially of ruthenium by osmium. The lattice constants of the RuSsub(2-x)Sesub(x) solid solution obey Vegard's rule. (author)

  19. Lattice Wigner equation

    Science.gov (United States)

    Solórzano, S.; Mendoza, M.; Succi, S.; Herrmann, H. J.

    2018-01-01

    We present a numerical scheme to solve the Wigner equation, based on a lattice discretization of momentum space. The moments of the Wigner function are recovered exactly, up to the desired order given by the number of discrete momenta retained in the discretization, which also determines the accuracy of the method. The Wigner equation is equipped with an additional collision operator, designed in such a way as to ensure numerical stability without affecting the evolution of the relevant moments of the Wigner function. The lattice Wigner scheme is validated for the case of quantum harmonic and anharmonic potentials, showing good agreement with theoretical results. It is further applied to the study of the transport properties of one- and two-dimensional open quantum systems with potential barriers. Finally, the computational viability of the scheme for the case of three-dimensional open systems is also illustrated.

  20. Lattice Quantum Chromodynamics

    CERN Document Server

    Sachrajda, C T

    2016-01-01

    I review the the application of the lattice formulation of QCD and large-scale numerical simulations to the evaluation of non-perturbative hadronic effects in Standard Model Phenomenology. I present an introduction to the elements of the calculations and discuss the limitations both in the range of quantities which can be studied and in the precision of the results. I focus particularly on the extraction of the QCD parameters, i.e. the quark masses and the strong coupling constant, and on important quantities in flavour physics. Lattice QCD is playing a central role in quantifying the hadronic effects necessary for the development of precision flavour physics and its use in exploring the limits of the Standard Model and in searches for inconsistencies which would signal the presence of new physics.

  1. Lattices of dielectric resonators

    CERN Document Server

    Trubin, Alexander

    2016-01-01

    This book provides the analytical theory of complex systems composed of a large number of high-Q dielectric resonators. Spherical and cylindrical dielectric resonators with inferior and also whispering gallery oscillations allocated in various lattices are considered. A new approach to S-matrix parameter calculations based on perturbation theory of Maxwell equations, developed for a number of high-Q dielectric bodies, is introduced. All physical relationships are obtained in analytical form and are suitable for further computations. Essential attention is given to a new unified formalism of the description of scattering processes. The general scattering task for coupled eigen oscillations of the whole system of dielectric resonators is described. The equations for the  expansion coefficients are explained in an applicable way. The temporal Green functions for the dielectric resonator are presented. The scattering process of short pulses in dielectric filter structures, dielectric antennas  and lattices of d...

  2. Lattice gauge theories

    International Nuclear Information System (INIS)

    Hasenfratz, A.; Hasenfratz, P.

    1985-01-01

    This paper deals almost exclusively with applications in QCD. Presumably QCD will remain in the center of lattice calculations in the near future. The existing techniques and the available computer resources should be able to produce trustworthy results in pure SU(3) gauge theory and in quenched hadron spectroscopy. Going beyond the quenched approximation might require some technical breakthrough or exceptional computer resources, or both. Computational physics has entered high-energy physics. From this point of view, lattice QCD is only one (although the most important, at present) of the research fields. Increasing attention is devoted to the study of other QFTs. It is certain that the investigation of nonasymptotically free theories, the Higgs phenomenon, or field theories that are not perturbatively renormalizable will be important research areas in the future

  3. Groebner Finite Path Algebras

    OpenAIRE

    Leamer, Micah J.

    2004-01-01

    Let K be a field and Q a finite directed multi-graph. In this paper I classify all path algebras KQ and admissible orders with the property that all of their finitely generated ideals have finite Groebner bases. MS

  4. Lattice degeneracies of geometric fermions

    International Nuclear Information System (INIS)

    Raszillier, H.

    1983-05-01

    We give the minimal numbers of degrees of freedom carried by geometric fermions on all lattices of maximal symmetries in d = 2, 3, and 4 dimensions. These numbers are lattice dependent, but in the (free) continuum limit, part of the degrees of freedom have to escape to infinity by a Wilson mechanism built in, and 2sup(d) survive for any lattice. On self-reciprocal lattices we compare the minimal numbers of degrees of freedom of geometric fermions with the minimal numbers of naive fermions on these lattices and argue that these numbers are equal. (orig.)

  5. Light water lattices

    International Nuclear Information System (INIS)

    1962-01-01

    The panel was attended by prominent physicists from most of the well-known laboratories in the field of light-water lattices, who exchanged the latest information on the status of work in their countries and discussed both the theoretical and the experimental aspects of the subjects. The supporting papers covered most problems, including criticality, resonance absorption, thermal utilization, spectrum calculations and the physics of plutonium bearing systems. Refs, figs and tabs

  6. Diffusion in heterogeneous lattices

    Czech Academy of Sciences Publication Activity Database

    Tarasenko, Alexander; Jastrabík, Lubomír

    2010-01-01

    Roč. 256, č. 17 (2010), s. 5137-5144 ISSN 0169-4332 R&D Projects: GA AV ČR KAN301370701; GA MŠk(CZ) 1M06002 Institutional research plan: CEZ:AV0Z10100522 Keywords : lattice- gas systems * diffusion * Monte Carlo simulations Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 1.795, year: 2010

  7. Automated lattice data generation

    Directory of Open Access Journals (Sweden)

    Ayyar Venkitesh

    2018-01-01

    Full Text Available The process of generating ensembles of gauge configurations (and measuring various observables over them can be tedious and error-prone when done “by hand”. In practice, most of this procedure can be automated with the use of a workflow manager. We discuss how this automation can be accomplished using Taxi, a minimal Python-based workflow manager built for generating lattice data. We present a case study demonstrating this technology.

  8. Automated lattice data generation

    Science.gov (United States)

    Ayyar, Venkitesh; Hackett, Daniel C.; Jay, William I.; Neil, Ethan T.

    2018-03-01

    The process of generating ensembles of gauge configurations (and measuring various observables over them) can be tedious and error-prone when done "by hand". In practice, most of this procedure can be automated with the use of a workflow manager. We discuss how this automation can be accomplished using Taxi, a minimal Python-based workflow manager built for generating lattice data. We present a case study demonstrating this technology.

  9. Lattice dynamics of thorium

    Energy Technology Data Exchange (ETDEWEB)

    Kumar, J [Agra Coll. (India). Dept. of Physics

    1977-03-01

    In the present work, a local model pseudopotential has been proposed to study the lattice dynamics of thorium. The model potential depends on the core and ionic radii, and accounts for the s-d-f hybridization effects in a phenomenological way. When this form of potential is applied to derive the photon dispersion curves of Th, sufficiently good agreement is found between the computed and experimental results.

  10. Computing: Lattice work

    International Nuclear Information System (INIS)

    Bowler, Ken

    1990-01-01

    One of the major recent developments in particle theory has been the use of very high performance computers to obtain approximate numerical solutions of quantum field theories by formulating them on a finite space-time lattice. The great virtue of this new technique is that it avoids the straitjacket of perturbation theory and can thus attack new, but very fundamental problems, such as the calculation of hadron masses in quark-gluon field theory (quantum chromodynamics - QCD)

  11. Digital lattice gauge theories

    Science.gov (United States)

    Zohar, Erez; Farace, Alessandro; Reznik, Benni; Cirac, J. Ignacio

    2017-02-01

    We propose a general scheme for a digital construction of lattice gauge theories with dynamical fermions. In this method, the four-body interactions arising in models with 2 +1 dimensions and higher are obtained stroboscopically, through a sequence of two-body interactions with ancillary degrees of freedom. This yields stronger interactions than the ones obtained through perturbative methods, as typically done in previous proposals, and removes an important bottleneck in the road towards experimental realizations. The scheme applies to generic gauge theories with Lie or finite symmetry groups, both Abelian and non-Abelian. As a concrete example, we present the construction of a digital quantum simulator for a Z3 lattice gauge theory with dynamical fermionic matter in 2 +1 dimensions, using ultracold atoms in optical lattices, involving three atomic species, representing the matter, gauge, and auxiliary degrees of freedom, that are separated in three different layers. By moving the ancilla atoms with a proper sequence of steps, we show how we can obtain the desired evolution in a clean, controlled way.

  12. Dielectric lattice gauge theory

    International Nuclear Information System (INIS)

    Mack, G.

    1983-06-01

    Dielectric lattice gauge theory models are introduced. They involve variables PHI(b)epsilong that are attached to the links b = (x+esub(μ),x) of the lattice and take their values in the linear space g which consists of real linear combinations of matrices in the gauge group G. The polar decomposition PHI(b)=U(b)osub(μ)(x) specifies an ordinary lattice gauge field U(b) and a kind of dielectric field epsilonsub(ij)proportionalosub(i)osub(j)sup(*)deltasub(ij). A gauge invariant positive semidefinite kinetic term for the PHI-field is found, and it is shown how to incorporate Wilson fermions in a way which preserves Osterwalder Schrader positivity. Theories with G = SU(2) and without matter fields are studied in some detail. It is proved that confinement holds, in the sense that Wilson loop expectation values show an area law decay, if the Euclidean action has certain qualitative features which imply that PHI = 0 (i.e. dielectric field identical 0) is the unique maximum of the action. (orig.)

  13. Dielectric lattice gauge theory

    International Nuclear Information System (INIS)

    Mack, G.

    1984-01-01

    Dielectric lattice gauge theory models are introduced. They involve variables PHI(b)element ofG that are attached to the links b = (x+esub(μ), x) of the lattice and take their values in the linear space G which consists of real linear combinations of matrices in the gauge group G. The polar decomposition PHI(b)=U(b)sigmasub(μ)(x) specifies an ordinary lattice gauge field U(b) and a kind of dielectric field epsilonsub(ij)proportional sigmasub(i)sigmasub(j)sup(*)deltasub(ij). A gauge invariant positive semidefinite kinetic term for the PHI-field is found, and it is shown how to incorporate Wilson fermions in a way which preserves Osterwalder-Schrader positivity. Theories with G = SU(2) and without matter fields are studied in some detail. It is proved that confinement holds, in the sense that Wilson-loop expectation values show an area law decay, if the euclidean action has certain qualitative features which imply that PHI=0 (i.e. dielectric field identical 0) is the unique maximum of the action. (orig.)

  14. Path planning in changeable environments

    NARCIS (Netherlands)

    Nieuwenhuisen, D.

    2007-01-01

    This thesis addresses path planning in changeable environments. In contrast to traditional path planning that deals with static environments, in changeable environments objects are allowed to change their configurations over time. In many cases, path planning algorithms must facilitate quick

  15. Toward lattice fractional vector calculus

    Science.gov (United States)

    Tarasov, Vasily E.

    2014-09-01

    An analog of fractional vector calculus for physical lattice models is suggested. We use an approach based on the models of three-dimensional lattices with long-range inter-particle interactions. The lattice analogs of fractional partial derivatives are represented by kernels of lattice long-range interactions, where the Fourier series transformations of these kernels have a power-law form with respect to wave vector components. In the continuum limit, these lattice partial derivatives give derivatives of non-integer order with respect to coordinates. In the three-dimensional description of the non-local continuum, the fractional differential operators have the form of fractional partial derivatives of the Riesz type. As examples of the applications of the suggested lattice fractional vector calculus, we give lattice models with long-range interactions for the fractional Maxwell equations of non-local continuous media and for the fractional generalization of the Mindlin and Aifantis continuum models of gradient elasticity.

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

  17. Lattice-induced nonadiabatic frequency shifts in optical lattice clocks

    International Nuclear Information System (INIS)

    Beloy, K.

    2010-01-01

    We consider the frequency shift in optical lattice clocks which arises from the coupling of the electronic motion to the atomic motion within the lattice. For the simplest of three-dimensional lattice geometries this coupling is shown to affect only clocks based on blue-detuned lattices. We have estimated the size of this shift for the prospective strontium lattice clock operating at the 390-nm blue-detuned magic wavelength. The resulting fractional frequency shift is found to be on the order of 10 -18 and is largely overshadowed by the electric quadrupole shift. For lattice clocks based on more complex geometries or other atomic systems, this shift could potentially be a limiting factor in clock accuracy.

  18. Lattice topology dictates photon statistics.

    Science.gov (United States)

    Kondakci, H Esat; Abouraddy, Ayman F; Saleh, Bahaa E A

    2017-08-21

    Propagation of coherent light through a disordered network is accompanied by randomization and possible conversion into thermal light. Here, we show that network topology plays a decisive role in determining the statistics of the emerging field if the underlying lattice is endowed with chiral symmetry. In such lattices, eigenmode pairs come in skew-symmetric pairs with oppositely signed eigenvalues. By examining one-dimensional arrays of randomly coupled waveguides arranged on linear and ring topologies, we are led to a remarkable prediction: the field circularity and the photon statistics in ring lattices are dictated by its parity while the same quantities are insensitive to the parity of a linear lattice. For a ring lattice, adding or subtracting a single lattice site can switch the photon statistics from super-thermal to sub-thermal, or vice versa. This behavior is understood by examining the real and imaginary fields on a lattice exhibiting chiral symmetry, which form two strands that interleave along the lattice sites. These strands can be fully braided around an even-sited ring lattice thereby producing super-thermal photon statistics, while an odd-sited lattice is incommensurate with such an arrangement and the statistics become sub-thermal.

  19. Quivers of Bound Path Algebras and Bound Path Coalgebras

    Directory of Open Access Journals (Sweden)

    Dr. Intan Muchtadi

    2010-09-01

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

  20. A cornucopia of lattices

    International Nuclear Information System (INIS)

    Kilcup, G.

    1986-01-01

    A progress report on a lattice project at Los Alamos is presented. The projects are basically of two sorts: approaching the continuum (determination of MCRG flows under the blocking transformation, and beta-function along Wilson and improved action lines); and arriving at the continuum (hadron spectrum, coupling constants, and matrix elements). Since the ultimate goal is to determine matrix elements for which chiral symmetry is very relevant, the authors choose the formalism whose chiral properties are easier to understand, i.e., staggered fermions

  1. Lattice of quantum predictions

    Science.gov (United States)

    Drieschner, Michael

    1993-10-01

    What is the structure of reality? Physics is supposed to answer this question, but a purely empiristic view is not sufficient to explain its ability to do so. Quantum mechanics has forced us to think more deeply about what a physical theory is. There are preconditions every physical theory must fulfill. It has to contain, e.g., rules for empirically testable predictions. Those preconditions give physics a structure that is “a priori” in the Kantian sense. An example is given how the lattice structure of quantum mechanics can be understood along these lines.

  2. Lattice Vibrations in Chlorobenzenes:

    DEFF Research Database (Denmark)

    Reynolds, P. A.; Kjems, Jørgen; White, J. W.

    1974-01-01

    Lattice vibrational dispersion curves for the ``intermolecular'' modes in the triclinic, one molecule per unit cell β phase of p‐C6D4Cl2 and p‐C6H4Cl2 have been obtained by inelastic neutron scattering. The deuterated sample was investigated at 295 and at 90°K and a linear extrapolation to 0°K...... was applied in order to correct for anharmonic effects. Calculations based on the atom‐atom model for van der Waals' interaction and on general potential parameters for the aromatic compounds agree reasonably well with the experimental observations. There is no substantial improvement in fit obtained either...

  3. Diamond lattice Heisenberg antiferromagnet

    Science.gov (United States)

    Oitmaa, J.

    2018-04-01

    We investigate ground-state and high-temperature properties of the nearest-neighbour Heisenberg antiferromagnet on the three-dimensional diamond lattice, using series expansion methods. The ground-state energy and magnetization, as well as the magnon spectrum, are calculated and found to be in good agreement with first-order spin-wave theory, with a quantum renormalization factor of about 1.13. High-temperature series are derived for the free energy, and physical and staggered susceptibilities for spin S  =  1/2, 1 and 3/2, and analysed to obtain the corresponding Curie and Néel temperatures.

  4. Lattice cell burnup calculation

    International Nuclear Information System (INIS)

    Pop-Jordanov, J.

    1977-01-01

    Accurate burnup prediction is a key item for design and operation of a power reactor. It should supply information on isotopic changes at each point in the reactor core and the consequences of these changes on the reactivity, power distribution, kinetic characters, control rod patterns, fuel cycles and operating strategy. A basic stage in the burnup prediction is the lattice cell burnup calculation. This series of lectures attempts to give a review of the general principles and calculational methods developed and applied in this area of burnup physics

  5. Renormalons on the lattice

    CERN Document Server

    Crisafulli, M.; Martinelli, G.; Sachrajda, Christopher T.; Crisafulli, M; Gimenez, V; Martinelli, G; Sachrajda, C T

    1994-01-01

    We present the first lattice calculation of the B-meson binding energy \\labar and of the kinetic energy \\lambda_1/2 m_Q of the heavy-quark inside the pseudoscalar B-meson. In order to cancel the ambiguities due to the ultraviolet renormalons present in the operator matrix elements, this calculation has required the non-perturbative subtraction of the power divergences present in the Lagrangian operator \\energy and in the kinetic energy operator \\kkinetic. The non-perturbative renormalization of the relevant operators has been implemented by imposing suitable renormalization conditions on quark matrix elements in the Landau gauge.

  6. Study of Gd lattices

    International Nuclear Information System (INIS)

    Vidovsky, I.; Kereszturi, A.

    1991-11-01

    The results of experiments and calculations on Gd lattices are presented, and a comparison of experimental and calculational data is given. This latter can be divided into four groups. The first belongs to the comparison of criticality parameters, the second group is related with the comparison of 2D distributions, the third one relates the comparison of intra-macrocell distributions, whereas the fourth group is devoted for the comparison of spectral parameters. For comparison, the computer code RFIT based on strict statistical criteria has been used. The calculated and measured results agree, in most cases, sufficiently. (R.P.) 11 refs.; 13 figs.; 9 tabs

  7. Paths correlation matrix.

    Science.gov (United States)

    Qian, Weixian; Zhou, Xiaojun; Lu, Yingcheng; Xu, Jiang

    2015-09-15

    Both the Jones and Mueller matrices encounter difficulties when physically modeling mixed materials or rough surfaces due to the complexity of light-matter interactions. To address these issues, we derived a matrix called the paths correlation matrix (PCM), which is a probabilistic mixture of Jones matrices of every light propagation path. Because PCM is related to actual light propagation paths, it is well suited for physical modeling. Experiments were performed, and the reflection PCM of a mixture of polypropylene and graphite was measured. The PCM of the mixed sample was accurately decomposed into pure polypropylene's single reflection, pure graphite's single reflection, and depolarization caused by multiple reflections, which is consistent with the theoretical derivation. Reflection parameters of rough surface can be calculated from PCM decomposition, and the results fit well with the theoretical calculations provided by the Fresnel equations. These theoretical and experimental analyses verify that PCM is an efficient way to physically model light-matter interactions.

  8. Leavitt path algebras

    CERN Document Server

    Abrams, Gene; Siles Molina, Mercedes

    2017-01-01

    This book offers a comprehensive introduction by three of the leading experts in the field, collecting fundamental results and open problems in a single volume. Since Leavitt path algebras were first defined in 2005, interest in these algebras has grown substantially, with ring theorists as well as researchers working in graph C*-algebras, group theory and symbolic dynamics attracted to the topic. Providing a historical perspective on the subject, the authors review existing arguments, establish new results, and outline the major themes and ring-theoretic concepts, such as the ideal structure, Z-grading and the close link between Leavitt path algebras and graph C*-algebras. The book also presents key lines of current research, including the Algebraic Kirchberg Phillips Question, various additional classification questions, and connections to noncommutative algebraic geometry. Leavitt Path Algebras will appeal to graduate students and researchers working in the field and related areas, such as C*-algebras and...

  9. Extracting the Single-Particle Gap in Carbon Nanotubes with Lattice Quantum Monte Carlo

    Directory of Open Access Journals (Sweden)

    Berkowitz Evan

    2018-01-01

    Full Text Available We show how lattice Quantum Monte Carlo simulations can be used to calculate electronic properties of carbon nanotubes in the presence of strong electron-electron correlations. We employ the path integral formalism and use methods developed within the lattice QCD community for our numerical work and compare our results to empirical data of the Anti-Ferromagnetic Mott Insulating gap in large diameter tubes.

  10. The Thinnest Path Problem

    Science.gov (United States)

    2016-07-22

    be reduced to TP in -D UDH for any . We then show that the 2-D disk hypergraph constructed in the proof of Theorem 1 can be modified to an exposed...transmission range that induces hy- peredge , i.e., (3) GAO et al.: THINNEST PATH PROBLEM 1181 Theorem 5 shows that the covered area of the path...representation of (the two hyperedges rooted at from the example given in Fig. 6 are illustrated in green and blue, respectively). step, we show in this

  11. Path dependence and creation

    DEFF Research Database (Denmark)

    Garud, Raghu; Karnøe, Peter

    This edited volume stems from a conference held in Copenhagen that the authors ran in August of 1997. The authors, aware of the recent work in evolutionary theory and the science of chaos and complexity, challenge the sometimes deterministic flavour of this work. They are interested in uncovering...... the place of agency in these theories that take history so seriously. In the end, they are as interested in path creation and destruction as they are in path dependence. This book is compiled of both theoretical and empirical writing. It shows relatively well-known industries such as the automobile...

  12. Reparametrization in the path integral

    International Nuclear Information System (INIS)

    Storchak, S.N.

    1983-01-01

    The question of the invariance of a measure in the n-dimensional path integral under the path reparametrization is considered. The non-invariance of the measure through the jacobian is suggeste. After the path integral reparametrization the representatioq for the Green's function of the Hamilton operator in terms of the path integral with the classical Hamiltonian has been obtained

  13. Lattice Transparency of Graphene.

    Science.gov (United States)

    Chae, Sieun; Jang, Seunghun; Choi, Won Jin; Kim, Youn Sang; Chang, Hyunju; Lee, Tae Il; Lee, Jeong-O

    2017-03-08

    Here, we demonstrated the transparency of graphene to the atomic arrangement of a substrate surface, i.e., the "lattice transparency" of graphene, by using hydrothermally grown ZnO nanorods as a model system. The growth behaviors of ZnO nanocrystals on graphene-coated and uncoated substrates with various crystal structures were investigated. The atomic arrangements of the nucleating ZnO nanocrystals exhibited a close match with those of the respective substrates despite the substrates being bound to the other side of the graphene. By using first-principles calculations based on density functional theory, we confirmed the energetic favorability of the nucleating phase following the atomic arrangement of the substrate even with the graphene layer present in between. In addition to transmitting information about the atomic lattice of the substrate, graphene also protected its surface. This dual role enabled the hydrothermal growth of ZnO nanorods on a Cu substrate, which otherwise dissolved in the reaction conditions when graphene was absent.

  14. Introduction to lattice gauge theories

    International Nuclear Information System (INIS)

    La Cock, P.

    1988-03-01

    A general introduction to Lattice Gauge Theory (LGT) is given. The theory is discussed from first principles to facilitate an understanding of the techniques used in LGT. These include lattice formalism, gauge invariance, fermions on the lattice, group theory and integration, strong coupling methods and mean field techniques. A review of quantum chromodynamics on the lattice at finite temperature and density is also given. Monte Carlo results and analytical methods are discussed. An attempt has been made to include most relevant data up to the end of 1987, and to update some earlier reviews existing on the subject. 224 refs., 33 figs., 14 tabs

  15. Hadron structure from lattice QCD

    International Nuclear Information System (INIS)

    Schaefer, Andreas

    2008-01-01

    Some elements and current developments of lattice QCD are reviewed, with special emphasis on hadron structure observables. In principle, high precision experimental and lattice data provide nowadays a very detailled picture of the internal structure of hadrons. However, to relate both, a very good controle of perturbative QCD is needed in many cases. Finally chiral perturbation theory is extremely helpful to boost the precision of lattice calculations. The mutual need and benefit of all four elements: experiment, lattice QCD, perturbative QCD and chiral perturbation theory is the main topic of this review

  16. Lattice formulations of reggeon interactions

    International Nuclear Information System (INIS)

    Brower, R.C.; Ellis, J.; Savit, R.; Zinn-Justin, J.

    1976-01-01

    A class of lattice analogues to reggeon field theory is examined. First the transition from a continuum to a lattice field theory is discussed, emphasizing the necessity of a Wick rotation and the consideration of symmetry properties. Next the theory is transformed to a discrete system with two spins at each lattice site, and the problems of the triple-reggeon interaction and the reggeon energy gap are discussed. It is pointed out that transferring the theory from the continuum to a lattice necesarily introduces new relevant operators not normally present in reggeon field theory. (Auth.)

  17. Lattice QCD Calculation of Nucleon Structure

    International Nuclear Information System (INIS)

    Liu, Keh-Fei; Draper, Terrence

    2016-01-01

    anomalous Ward identity. Recently, we have started to include multiple lattices with different lattice spacings and different volumes including large lattices at the physical pion mass point. We are getting quite close to being able to calculate the hadron structure at the physical point and to do the continuum and large volume extrapolations, which is our ultimate aim. We have now finished several projects which have included these systematic corrections. They include the leptonic decay width of the ρ, the πN sigma and strange sigma terms, and the strange quark magnetic moment. Over the years, we have also studied hadron spectroscopy with lattice calculations and in phenomenology. These include Roper resonance, pentaquark state, charmonium spectrum, glueballs, scalar mesons a_0(1450) and σ(600) and other scalar mesons, and the 1"-"+ meson. In addition, we have employed the canonical approach to explore the first-order phase transition and the critical point at finite density and finite temperature. We have also discovered a new parton degree of freedom -- the connected sea partons, from the path-integral formulation of the hadronic tensor, which explains the experimentally observed Gottfried sum rule violation. Combining experimental result on the strange parton distribution, the CT10 global fitting results of the total u and d anti-partons and the lattice result of the ratio of the momentum fraction of the strange vs that of u or d in the disconnected insertion, we have shown that the connected sea partons can be isolated. In this final technical report, we shall present a few representative highlights that have been achieved in the project.

  18. Lattice QCD Calculation of Nucleon Structure

    Energy Technology Data Exchange (ETDEWEB)

    Liu, Keh-Fei [University of Kentucky, Lexington, KY (United States). Dept. of Physics and Astronomy; Draper, Terrence [University of Kentucky, Lexington, KY (United States). Dept. of Physics and Astronomy

    2016-08-30

    decomposition and the strange quark spin from the anomalous Ward identity. Recently, we have started to include multiple lattices with different lattice spacings and different volumes including large lattices at the physical pion mass point. We are getting quite close to being able to calculate the hadron structure at the physical point and to do the continuum and large volume extrapolations, which is our ultimate aim. We have now finished several projects which have included these systematic corrections. They include the leptonic decay width of the ρ, the πN sigma and strange sigma terms, and the strange quark magnetic moment. Over the years, we have also studied hadron spectroscopy with lattice calculations and in phenomenology. These include Roper resonance, pentaquark state, charmonium spectrum, glueballs, scalar mesons a0(1450) and σ(600) and other scalar mesons, and the 1-+ meson. In addition, we have employed the canonical approach to explore the first-order phase transition and the critical point at finite density and finite temperature. We have also discovered a new parton degree of freedom -- the connected sea partons, from the path-integral formulation of the hadronic tensor, which explains the experimentally observed Gottfried sum rule violation. Combining experimental result on the strange parton distribution, the CT10 global fitting results of the total u and d anti-partons and the lattice result of the ratio of the momentum fraction of the strange vs that of u or d in the disconnected insertion, we have shown that the connected sea partons can be isolated. In this final technical report, we shall present a few representative highlights that have been achieved in the project.

  19. MEASURING PATH DEPENDENCY

    Directory of Open Access Journals (Sweden)

    Peter Juhasz

    2017-03-01

    Full Text Available While risk management gained popularity during the last decades even some of the basic risk types are still far out of focus. One of these is path dependency that refers to the uncertainty of how we reach a certain level of total performance over time. While decision makers are careful in accessing how their position will look like the end of certain periods, little attention is given how they will get there through the period. The uncertainty of how a process will develop across a shorter period of time is often “eliminated” by simply choosing a longer planning time interval, what makes path dependency is one of the most often overlooked business risk types. After reviewing the origin of the problem we propose and compare seven risk measures to access path. Traditional risk measures like standard deviation of sub period cash flows fail to capture this risk type. We conclude that in most cases considering the distribution of the expected cash flow effect caused by the path dependency may offer the best method, but we may need to use several measures at the same time to include all the optimisation limits of the given firm

  20. Convection-diffusion lattice Boltzmann scheme for irregular lattices

    NARCIS (Netherlands)

    Sman, van der R.G.M.; Ernst, M.H.

    2000-01-01

    In this paper, a lattice Boltzmann (LB) scheme for convection diffusion on irregular lattices is presented, which is free of any interpolation or coarse graining step. The scheme is derived using the axioma that the velocity moments of the equilibrium distribution equal those of the

  1. Elimination of spurious lattice fermion solutions and noncompact lattice QCD

    Energy Technology Data Exchange (ETDEWEB)

    Lee, T.D.

    1997-09-22

    It is well known that the Dirac equation on a discrete hyper-cubic lattice in D dimension has 2{sup D} degenerate solutions. The usual method of removing these spurious solutions encounters difficulties with chiral symmetry when the lattice spacing l {ne} 0, as exemplified by the persistent problem of the pion mass. On the other hand, we recall that in any crystal in nature, all the electrons do move in a lattice and satisfy the Dirac equation; yet there is not a single physical result that has ever been entangled with a spurious fermion solution. Therefore it should not be difficult to eliminate these unphysical elements. On a discrete lattice, particle hop from point to point, whereas in a real crystal the lattice structure in embedded in a continuum and electrons move continuously from lattice cell to lattice cell. In a discrete system, the lattice functions are defined only on individual points (or links as in the case of gauge fields). However, in a crystal the electron state vector is represented by the Bloch wave functions which are continuous functions in {rvec {gamma}}, and herein lies one of the essential differences.

  2. A novel approach for multiple mobile objects path planning: Parametrization method and conflict resolution strategy

    International Nuclear Information System (INIS)

    Ma, Yong; Wang, Hongwei; Zamirian, M.

    2012-01-01

    We present a new approach containing two steps to determine conflict-free paths for mobile objects in two and three dimensions with moving obstacles. Firstly, the shortest path of each object is set as goal function which is subject to collision-avoidance criterion, path smoothness, and velocity and acceleration constraints. This problem is formulated as calculus of variation problem (CVP). Using parametrization method, CVP is converted to time-varying nonlinear programming problems (TNLPP) and then resolved. Secondly, move sequence of object is assigned by priority scheme; conflicts are resolved by multilevel conflict resolution strategy. Approach efficiency is confirmed by numerical examples. -- Highlights: ► Approach with parametrization method and conflict resolution strategy is proposed. ► Approach fits for multi-object paths planning in two and three dimensions. ► Single object path planning and multi-object conflict resolution are orderly used. ► Path of each object obtained with parameterization method in the first phase. ► Conflict-free paths gained by multi-object conflict resolution in the second phase.

  3. Detection of deregulated modules using deregulatory linked path.

    Directory of Open Access Journals (Sweden)

    Yuxuan Hu

    Full Text Available The identification of deregulated modules (such as induced by oncogenes is a crucial step for exploring the pathogenic process of complex diseases. Most of the existing methods focus on deregulation of genes rather than the links of the path among them. In this study, we emphasize on the detection of deregulated links, and develop a novel and effective regulatory path-based approach in finding deregulated modules. Observing that a regulatory pathway between two genes might involve in multiple rather than a single path, we identify condition-specific core regulatory path (CCRP to detect the significant deregulation of regulatory links. Using time-series gene expression, we define the regulatory strength within each gene pair based on statistical dependence analysis. The CCRPs in regulatory networks can then be identified using the shortest path algorithm. Finally, we derive the deregulated modules by integrating the differential edges (as deregulated links of the CCRPs between the case and the control group. To demonstrate the effectiveness of our approach, we apply the method to expression data associated with different states of Human Epidermal Growth Factor Receptor 2 (HER2. The experimental results show that the genes as well as the links in the deregulated modules are significantly enriched in multiple KEGG pathways and GO biological processes, most of which can be validated to suffer from impact of this oncogene based on previous studies. Additionally, we find the regulatory mechanism associated with the crucial gene SNAI1 significantly deregulated resulting from the activation of HER2. Hence, our method provides not only a strategy for detecting the deregulated links in regulatory networks, but also a way to identify concerning deregulated modules, thus contributing to the target selection of edgetic drugs.

  4. O (a) improvement of 2D N = (2 , 2) lattice SYM theory

    Science.gov (United States)

    Hanada, Masanori; Kadoh, Daisuke; Matsuura, So; Sugino, Fumihiko

    2018-04-01

    We perform a tree-level O (a) improvement of two-dimensional N = (2 , 2) supersymmetric Yang-Mills theory on the lattice, motivated by the fast convergence in numerical simulations. The improvement respects an exact supersymmetry Q which is needed for obtaining the correct continuum limit without a parameter fine tuning. The improved lattice action is given within a milder locality condition in which the interactions are decaying as the exponential of the distance on the lattice. We also prove that the path-integral measure is invariant under the improved Q-transformation.

  5. Coolant Void Reactivity Analysis of CANDU Lattice

    Energy Technology Data Exchange (ETDEWEB)

    Park, Jin Su; Lee, Hyun Suk; Tak, Tae Woo; Lee, Deok Jung [UNIST, Ulsan (Korea, Republic of)

    2016-05-15

    Models of CANDU-6 and ACR-700 fuel lattices were constructed for a single bundle and 2 by 2 checkerboard to understand the physics related to CVR. Also, a familiar four factor formula was used to predict the specific contributions to reactivity change in order to achieve an understanding of the physics issues related to the CVR. At the same time, because the situation of coolant voiding should bring about a change of neutron behavior, the spectral changes and neutron current were also analyzed. The models of the CANDU- 6 and ACR-700 fuel lattices were constructed using the Monte Carlo code MCNP6 using the ENDF/B-VII.0 continuous energy cross section library based on the specification from AECL. The CANDU fuel lattice was searched through sensitivity studies of each design parameter such as fuel enrichment, fuel pitch, and types of burnable absorber for obtaining better behavior in terms of CVR. Unlike the single channel coolant voiding, the ACR-700 bundle has a positive reactivity change upon 2x2 checkerboard coolant voiding. Because of the new path for neutron moderation, the neutrons from the voided channel move to the no-void channel where they lose energy and come back to the voided channel as thermal neutrons. This phenomenon causes the positive CVR when checkerboard voiding occurs. The sensitivity study revealed the effects of the moderator to fuel volume ratio, fuel enrichment, and burnable absorber on the CVR. A fuel bundle with low moderator to fuel volume ratio and high fuel enrichment can help achieve negative CVR.

  6. Classical ground states of Heisenberg and X Y antiferromagnets on the windmill lattice

    Science.gov (United States)

    Jeevanesan, Bhilahari; Orth, Peter P.

    2014-10-01

    We investigate the classical Heisenberg and planar (X Y ) spin models on the windmill lattice. The windmill lattice is formed out of two widely occurring lattice geometries: a triangular lattice is coupled to its dual honeycomb lattice. Using a combination of iterative minimization, heat-bath Monte Carlo simulations, and analytical calculations, we determine the complete ground-state phase diagram of both models and find the exact energies of the phases. The phase diagram shows a rich phenomenology due to competing interactions and hosts, in addition to collinear and various coplanar phases, also intricate noncoplanar phases. We briefly outline different paths to an experimental realization of these spin models. Our extensive study provides a starting point for the investigation of quantum and thermal fluctuation effects.

  7. Lattice quantum chromodynamics

    International Nuclear Information System (INIS)

    Hassenfratz, P.

    1983-01-01

    It is generally accepted that relativistic field theory is relevant in high energy physics. It is also recognized that even in QCD, which is asymptotically free, the scope of perturbation theory is very limited. Despite the tremendous theoretical and experimental effort to study scaling, scaling violations, e + e - , lepton pair creation, jets, etc., the answer to the question whether and to what extent is QCD the theory of strong interactions is vague. At present-day energies it is difficult to disentangle perturbative and non-perturbative effects. The author states that QCD must be understood and that quantitative non-perturbative methods are needed. He states that the lattice formulation of field theories is a promising approach to meeting this need and discusses the formulation in detail in this paper

  8. Geometry of lattice field theory

    International Nuclear Information System (INIS)

    Honan, T.J.

    1986-01-01

    Using some tools of algebraic topology, a general formalism for lattice field theory is presented. The lattice is taken to be a simplicial complex that is also a manifold and is referred to as a simplicial manifold. The fields on this lattice are cochains, that are called lattice forms to emphasize the connections with differential forms in the continuum. This connection provides a new bridge between lattice and continuum field theory. A metric can be put onto this simplicial manifold by assigning lengths to every link or I-simplex of the lattice. Regge calculus is a way of defining general relativity on this lattice. A geometric discussion of Regge calculus is presented. The Regge action, which is a discrete form of the Hilbert action, is derived from the Hilbert action using distribution valued forms. This is a new derivation that emphasizes the underlying geometry. Kramers-Wannier duality in statistical mechanics is discussed in this general setting. Nonlinear field theories, which include gauge theories and nonlinear sigma models are discussed in the continuum and then are put onto a lattice. The main new result here is the generalization to curved spacetime, which consists of making the theory compatible with Regge calculus

  9. Homogenization theory in reactor lattices

    International Nuclear Information System (INIS)

    Benoist, P.

    1986-02-01

    The purpose of the theory of homogenization of reactor lattices is to determine, by the mean of transport theory, the constants of a homogeneous medium equivalent to a given lattice, which allows to treat the reactor as a whole by diffusion theory. In this note, the problem is presented by laying emphasis on simplicity, as far as possible [fr

  10. Remarks on lattice gauge models

    International Nuclear Information System (INIS)

    Grosse, H.

    1981-01-01

    The author reports a study of the phase structure of lattice gauge models where one takes as a gauge group a non-abelian discrete subgroup of SU(3). In addition he comments on a lattice action proposed recently by Manton and observes that it violates a positivity property. (Auth.)

  11. Remarks on lattice gauge models

    International Nuclear Information System (INIS)

    Grosse, H.

    1981-01-01

    The author reports on a study of the phase structure of lattice gauge models where one takes as a gauge group a non-abelian discrete subgroup of SU(3). In addition he comments on a lattice action proposed recently by Manton (1980) and observes that it violates a positivity property. (Auth.)

  12. Lattices, supersymmetry and Kaehler fermions

    International Nuclear Information System (INIS)

    Scott, D.M.

    1984-01-01

    It is shown that a graded extension of the space group of a (generalised) simple cubic lattice exists in any space dimension, D. The fermionic variables which arise admit a Kaehlerian interpretation. Each graded space group is a subgroup of a graded extension of the appropriate Euclidean group, E(D). The relevance of this to the construction of lattice theories is discussed. (author)

  13. Lattice polytopes in coding theory

    Directory of Open Access Journals (Sweden)

    Ivan Soprunov

    2015-05-01

    Full Text Available In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also include a new inductive bound for the minimum distance of generalized toric codes. As an application, we give new formulas for the minimum distance of generalized toric codes for special lattice point configurations.

  14. Covariant path integrals on hyperbolic surfaces

    International Nuclear Information System (INIS)

    Schaefer, J.

    1997-01-01

    DeWitt close-quote s covariant formulation of path integration [B. De Witt, open-quotes Dynamical theory in curved spaces. I. A review of the classical and quantum action principles,close quotes Rev. Mod. Phys. 29, 377 endash 397 (1957)] has two practical advantages over the traditional methods of open-quotes lattice approximations;close quotes there is no ordering problem, and classical symmetries are manifestly preserved at the quantum level. Applying the spectral theorem for unbounded self-adjoint operators, we provide a rigorous proof of the convergence of certain path integrals on Riemann surfaces of constant curvature -1. The Pauli endash DeWitt curvature correction term arises, as in DeWitt close-quote s work. Introducing a Fuchsian group Γ of the first kind, and a continuous, bounded, Γ-automorphic potential V, we obtain a Feynman endash Kac formula for the automorphic Schroedinger equation on the Riemann surface Γ backslash H. We analyze the Wick rotation and prove the strong convergence of the so-called Feynman maps [K. D. Elworthy, Path Integration on Manifolds, Mathematical Aspects of Superspace, edited by Seifert, Clarke, and Rosenblum (Reidel, Boston, 1983), pp. 47 endash 90] on a dense set of states. Finally, we give a new proof of some results in C. Grosche and F. Steiner, open-quotes The path integral on the Poincare upper half plane and for Liouville quantum mechanics,close quotes Phys. Lett. A 123, 319 endash 328 (1987). copyright 1997 American Institute of Physics

  15. Computing the writhe on lattices

    International Nuclear Information System (INIS)

    Laing, C; Sumners, D W

    2006-01-01

    Given a polygonal closed curve on a lattice or space group, we describe a method for computing the writhe of the curve as the average of weighted projected writhing numbers of the polygon in a few directions. These directions are determined by the lattice geometry, the weights are determined by areas of regions on the unit 2-sphere, and the regions are formed by the tangent indicatrix to the polygonal curve. We give a new formula for the writhe of polygons on the face centred cubic lattice and prove that the writhe of polygons on the body centred cubic lattice, the hexagonal simple lattice, and the diamond space group is always a rational number, and discuss applications to ring polymers

  16. Nonadiabatic transition path sampling

    International Nuclear Information System (INIS)

    Sherman, M. C.; Corcelli, S. A.

    2016-01-01

    Fewest-switches surface hopping (FSSH) is combined with transition path sampling (TPS) to produce a new method called nonadiabatic path sampling (NAPS). The NAPS method is validated on a model electron transfer system coupled to a Langevin bath. Numerically exact rate constants are computed using the reactive flux (RF) method over a broad range of solvent frictions that span from the energy diffusion (low friction) regime to the spatial diffusion (high friction) regime. The NAPS method is shown to quantitatively reproduce the RF benchmark rate constants over the full range of solvent friction. Integrating FSSH within the TPS framework expands the applicability of both approaches and creates a new method that will be helpful in determining detailed mechanisms for nonadiabatic reactions in the condensed-phase.

  17. Statistical mechanics of directed models of polymers in the square lattice

    International Nuclear Information System (INIS)

    Rensburg, E J Janse van

    2003-01-01

    Directed square lattice models of polymers and vesicles have received considerable attention in the recent mathematical and physical sciences literature. These are idealized geometric directed lattice models introduced to study phase behaviour in polymers, and include Dyck paths, partially directed paths, directed trees and directed vesicles models. Directed models are closely related to models studied in the combinatorics literature (and are often exactly solvable). They are also simplified versions of a number of statistical mechanics models, including the self-avoiding walk, lattice animals and lattice vesicles. The exchange of approaches and ideas between statistical mechanics and combinatorics have considerably advanced the description and understanding of directed lattice models, and this will be explored in this review. The combinatorial nature of directed lattice path models makes a study using generating function approaches most natural. In contrast, the statistical mechanics approach would introduce partition functions and free energies, and then investigate these using the general framework of critical phenomena. Generating function and statistical mechanics approaches are closely related. For example, questions regarding the limiting free energy may be approached by considering the radius of convergence of a generating function, and the scaling properties of thermodynamic quantities are related to the asymptotic properties of the generating function. In this review the methods for obtaining generating functions and determining free energies in directed lattice path models of linear polymers is presented. These methods include decomposition methods leading to functional recursions, as well as the Temperley method (that is implemented by creating a combinatorial object, one slice at a time). A constant term formulation of the generating function will also be reviewed. The thermodynamic features and critical behaviour in models of directed paths may be

  18. PATHS groundwater hydrologic model

    Energy Technology Data Exchange (ETDEWEB)

    Nelson, R.W.; Schur, J.A.

    1980-04-01

    A preliminary evaluation capability for two-dimensional groundwater pollution problems was developed as part of the Transport Modeling Task for the Waste Isolation Safety Assessment Program (WISAP). Our approach was to use the data limitations as a guide in setting the level of modeling detail. PATHS Groundwater Hydrologic Model is the first level (simplest) idealized hybrid analytical/numerical model for two-dimensional, saturated groundwater flow and single component transport; homogeneous geology. This document consists of the description of the PATHS groundwater hydrologic model. The preliminary evaluation capability prepared for WISAP, including the enhancements that were made because of the authors' experience using the earlier capability is described. Appendixes A through D supplement the report as follows: complete derivations of the background equations are provided in Appendix A. Appendix B is a comprehensive set of instructions for users of PATHS. It is written for users who have little or no experience with computers. Appendix C is for the programmer. It contains information on how input parameters are passed between programs in the system. It also contains program listings and test case listing. Appendix D is a definition of terms.

  19. Lattice gas cellular automata and lattice Boltzmann models an introduction

    CERN Document Server

    Wolf-Gladrow, Dieter A

    2000-01-01

    Lattice-gas cellular automata (LGCA) and lattice Boltzmann models (LBM) are relatively new and promising methods for the numerical solution of nonlinear partial differential equations. The book provides an introduction for graduate students and researchers. Working knowledge of calculus is required and experience in PDEs and fluid dynamics is recommended. Some peculiarities of cellular automata are outlined in Chapter 2. The properties of various LGCA and special coding techniques are discussed in Chapter 3. Concepts from statistical mechanics (Chapter 4) provide the necessary theoretical background for LGCA and LBM. The properties of lattice Boltzmann models and a method for their construction are presented in Chapter 5.

  20. Irreversible stochastic processes on lattices

    International Nuclear Information System (INIS)

    Nord, R.S.

    1986-01-01

    Models for irreversible random or cooperative filling of lattices are required to describe many processes in chemistry and physics. Since the filling is assumed to be irreversible, even the stationary, saturation state is not in equilibrium. The kinetics and statistics of these processes are described by recasting the master equations in infinite hierarchical form. Solutions can be obtained by implementing various techniques: refinements in these solution techniques are presented. Programs considered include random dimer, trimer, and tetramer filling of 2D lattices, random dimer filling of a cubic lattice, competitive filling of two or more species, and the effect of a random distribution of inactive sites on the filling. Also considered is monomer filling of a linear lattice with nearest neighbor cooperative effects and solve for the exact cluster-size distribution for cluster sizes up to the asymptotic regime. Additionally, a technique is developed to directly determine the asymptotic properties of the cluster size distribution. Finally cluster growth is considered via irreversible aggregation involving random walkers. In particular, explicit results are provided for the large-lattice-size asymptotic behavior of trapping probabilities and average walk lengths for a single walker on a lattice with multiple traps. Procedures for exact calculation of these quantities on finite lattices are also developed

  1. Toward lattice fractional vector calculus

    International Nuclear Information System (INIS)

    Tarasov, Vasily E

    2014-01-01

    An analog of fractional vector calculus for physical lattice models is suggested. We use an approach based on the models of three-dimensional lattices with long-range inter-particle interactions. The lattice analogs of fractional partial derivatives are represented by kernels of lattice long-range interactions, where the Fourier series transformations of these kernels have a power-law form with respect to wave vector components. In the continuum limit, these lattice partial derivatives give derivatives of non-integer order with respect to coordinates. In the three-dimensional description of the non-local continuum, the fractional differential operators have the form of fractional partial derivatives of the Riesz type. As examples of the applications of the suggested lattice fractional vector calculus, we give lattice models with long-range interactions for the fractional Maxwell equations of non-local continuous media and for the fractional generalization of the Mindlin and Aifantis continuum models of gradient elasticity. (papers)

  2. Introduction to lattice gauge theory

    International Nuclear Information System (INIS)

    Gupta, R.

    1987-01-01

    The lattice formulation of Quantum Field Theory (QFT) can be exploited in many ways. We can derive the lattice Feynman rules and carry out weak coupling perturbation expansions. The lattice then serves as a manifestly gauge invariant regularization scheme, albeit one that is more complicated than standard continuum schemes. Strong coupling expansions: these give us useful qualitative information, but unfortunately no hard numbers. The lattice theory is amenable to numerical simulations by which one calculates the long distance properties of a strongly interacting theory from first principles. The observables are measured as a function of the bare coupling g and a gauge invariant cut-off ≅ 1/α, where α is the lattice spacing. The continuum (physical) behavior is recovered in the limit α → 0, at which point the lattice artifacts go to zero. This is the more powerful use of lattice formulation, so in these lectures the author focuses on setting up the theory for the purpose of numerical simulations to get hard numbers. The numerical techniques used in Lattice Gauge Theories have their roots in statistical mechanics, so it is important to develop an intuition for the interconnection between quantum mechanics and statistical mechanics. This will be the emphasis of the first lecture. In the second lecture, the author reviews the essential ingredients of formulating QCD on the lattice and discusses scaling and the continuum limit. In the last lecture the author summarizes the status of some of the main results. He also mentions the bottlenecks and possible directions for research. 88 refs

  3. Lattice Methods for Quantum Chromodynamics

    CERN Document Server

    DeGrand, Thomas

    2006-01-01

    Numerical simulation of lattice-regulated QCD has become an important source of information about strong interactions. In the last few years there has been an explosion of techniques for performing ever more accurate studies on the properties of strongly interacting particles. Lattice predictions directly impact many areas of particle and nuclear physics theory and phenomenology. This book provides a thorough introduction to the specialized techniques needed to carry out numerical simulations of QCD: a description of lattice discretizations of fermions and gauge fields, methods for actually do

  4. Localized structures in Kagome lattices

    Energy Technology Data Exchange (ETDEWEB)

    Saxena, Avadh B [Los Alamos National Laboratory; Bishop, Alan R [Los Alamos National Laboratory; Law, K J H [UNIV OF MASSACHUSETTS; Kevrekidis, P G [UNIV OF MASSACHUSETTS

    2009-01-01

    We investigate the existence and stability of gap vortices and multi-pole gap solitons in a Kagome lattice with a defocusing nonlinearity both in a discrete case and in a continuum one with periodic external modulation. In particular, predictions are made based on expansion around a simple and analytically tractable anti-continuum (zero coupling) limit. These predictions are then confirmed for a continuum model of an optically-induced Kagome lattice in a photorefractive crystal obtained by a continuous transformation of a honeycomb lattice.

  5. Lattice QCD: Status and Prospect

    International Nuclear Information System (INIS)

    Ukawa, Akira

    2006-01-01

    A brief review is given of the current status and near-future prospect of lattice QCD studies of the Standard Model. After summarizing a bit of history, we describe current attempts toward inclusion of dynamical up, down and strange quarks. Recent results on the light hadron mass spectrum as well as those on the heavy quark quantities are described. Recent work on lattice pentaquark search is summarized. We touch upon the PACS-CS Project for building our next machine for lattice QCD, and conclude with a summary of computer situation and the physics possibilities over the next several years

  6. Lattice sums then and now

    CERN Document Server

    Borwein, J M; McPhedran, R C

    2013-01-01

    The study of lattice sums began when early investigators wanted to go from mechanical properties of crystals to the properties of the atoms and ions from which they were built (the literature of Madelung's constant). A parallel literature was built around the optical properties of regular lattices of atoms (initiated by Lord Rayleigh, Lorentz and Lorenz). For over a century many famous scientists and mathematicians have delved into the properties of lattices, sometimes unwittingly duplicating the work of their predecessors. Here, at last, is a comprehensive overview of the substantial body of

  7. Quantum phases of dipolar rotors on two-dimensional lattices.

    Science.gov (United States)

    Abolins, B P; Zillich, R E; Whaley, K B

    2018-03-14

    The quantum phase transitions of dipoles confined to the vertices of two-dimensional lattices of square and triangular geometry is studied using path integral ground state quantum Monte Carlo. We analyze the phase diagram as a function of the strength of both the dipolar interaction and a transverse electric field. The study reveals the existence of a class of orientational phases of quantum dipolar rotors whose properties are determined by the ratios between the strength of the anisotropic dipole-dipole interaction, the strength of the applied transverse field, and the rotational constant. For the triangular lattice, the generic orientationally disordered phase found at zero and weak values of both dipolar interaction strength and applied field is found to show a transition to a phase characterized by net polarization in the lattice plane as the strength of the dipole-dipole interaction is increased, independent of the strength of the applied transverse field, in addition to the expected transition to a transverse polarized phase as the electric field strength increases. The square lattice is also found to exhibit a transition from a disordered phase to an ordered phase as the dipole-dipole interaction strength is increased, as well as the expected transition to a transverse polarized phase as the electric field strength increases. In contrast to the situation with a triangular lattice, on square lattices, the ordered phase at high dipole-dipole interaction strength possesses a striped ordering. The properties of these quantum dipolar rotor phases are dominated by the anisotropy of the interaction and provide useful models for developing quantum phases beyond the well-known paradigms of spin Hamiltonian models, implementing in particular a novel physical realization of a quantum rotor-like Hamiltonian that possesses an anisotropic long range interaction.

  8. Quantum phases of dipolar rotors on two-dimensional lattices

    Science.gov (United States)

    Abolins, B. P.; Zillich, R. E.; Whaley, K. B.

    2018-03-01

    The quantum phase transitions of dipoles confined to the vertices of two-dimensional lattices of square and triangular geometry is studied using path integral ground state quantum Monte Carlo. We analyze the phase diagram as a function of the strength of both the dipolar interaction and a transverse electric field. The study reveals the existence of a class of orientational phases of quantum dipolar rotors whose properties are determined by the ratios between the strength of the anisotropic dipole-dipole interaction, the strength of the applied transverse field, and the rotational constant. For the triangular lattice, the generic orientationally disordered phase found at zero and weak values of both dipolar interaction strength and applied field is found to show a transition to a phase characterized by net polarization in the lattice plane as the strength of the dipole-dipole interaction is increased, independent of the strength of the applied transverse field, in addition to the expected transition to a transverse polarized phase as the electric field strength increases. The square lattice is also found to exhibit a transition from a disordered phase to an ordered phase as the dipole-dipole interaction strength is increased, as well as the expected transition to a transverse polarized phase as the electric field strength increases. In contrast to the situation with a triangular lattice, on square lattices, the ordered phase at high dipole-dipole interaction strength possesses a striped ordering. The properties of these quantum dipolar rotor phases are dominated by the anisotropy of the interaction and provide useful models for developing quantum phases beyond the well-known paradigms of spin Hamiltonian models, implementing in particular a novel physical realization of a quantum rotor-like Hamiltonian that possesses an anisotropic long range interaction.

  9. Rocket Flight Path

    Directory of Open Access Journals (Sweden)

    Jamie Waters

    2014-09-01

    Full Text Available This project uses Newton’s Second Law of Motion, Euler’s method, basic physics, and basic calculus to model the flight path of a rocket. From this, one can find the height and velocity at any point from launch to the maximum altitude, or apogee. This can then be compared to the actual values to see if the method of estimation is a plausible. The rocket used for this project is modeled after Bullistic-1 which was launched by the Society of Aeronautics and Rocketry at the University of South Florida.

  10. JAVA PathFinder

    Science.gov (United States)

    Mehhtz, Peter

    2005-01-01

    JPF is an explicit state software model checker for Java bytecode. Today, JPF is a swiss army knife for all sort of runtime based verification purposes. This basically means JPF is a Java virtual machine that executes your program not just once (like a normal VM), but theoretically in all possible ways, checking for property violations like deadlocks or unhandled exceptions along all potential execution paths. If it finds an error, JPF reports the whole execution that leads to it. Unlike a normal debugger, JPF keeps track of every step how it got to the defect.

  11. Hamiltonian path integrals

    International Nuclear Information System (INIS)

    Prokhorov, L.V.

    1982-01-01

    Problems related to consideration of operator nonpermutability in Hamiltonian path integral (HPI) are considered in the review. Integrals are investigated using trajectories in configuration space (nonrelativistic quantum mechanics). Problems related to trajectory integrals in HPI phase space are discussed: the problem of operator nonpermutability consideration (extra terms problem) and corresponding equivalence rules; ambiguity of HPI usual recording; transition to curvilinear coordinates. Problem of quantization of dynamical systems with couplings has been studied. As in the case of canonical transformations, quantization of the systems with couplings of the first kind requires the consideration of extra terms

  12. Path to Prosperity

    OpenAIRE

    Wolfowitz,Paul

    2006-01-01

    Paul Wolfowitz, President of the World Bank, discussed Singapore's remarkable progress along the road from poverty to prosperity which has also been discovered by many other countries in East Asia and around the world. He spoke of how each country must find its own path for people to pursue the same dreams of the chance to go to school, the security of a good job, and the ability to provide a better future for their children. Throughout the world, and importantly in the developing world, ther...

  13. The Spiral and the Lattice: Changes in Cognitive Learning Theory with Implications for Art Education.

    Science.gov (United States)

    Efland, Arthur D.

    1995-01-01

    Contrasts recent views of learning and cognition with cognitive learning theories of the late 1950s and early 1960s. Maintains that Jerome Bruner's spiral curriculum approach, still valuable, is not sufficient to explain cognitive development. Proposes a lattice-like cognitive development structure, inviting differing paths of exploration. (CFR)

  14. Quantum gravitation. The Feynman path integral approach

    International Nuclear Information System (INIS)

    Hamber, Herbert W.

    2009-01-01

    The book covers the theory of Quantum Gravitation from the point of view of Feynman path integrals. These provide a manifestly covariant approach in which fundamental quantum aspects of the theory such as radiative corrections and the renormalization group can be systematically and consistently addressed. The path integral method is suitable for both perturbative as well as non-perturbative studies, and is known to already provide a framework of choice for the theoretical investigation of non-abelian gauge theories, the basis for three of the four known fundamental forces in nature. The book thus provides a coherent outline of the present status of the theory gravity based on Feynman's formulation, with an emphasis on quantitative results. Topics are organized in such a way that the correspondence to similar methods and results in modern gauge theories becomes apparent. Covariant perturbation theory are developed using the full machinery of Feynman rules, gauge fixing, background methods and ghosts. The renormalization group for gravity and the existence of non-trivial ultraviolet fixed points are investigated, stressing a close correspondence with well understood statistical field theory models. Later the lattice formulation of gravity is presented as an essential tool towards an understanding of key features of the non-perturbative vacuum. The book ends with a discussion of contemporary issues in quantum cosmology such as scale dependent gravitational constants and quantum effects in the early universe. (orig.)

  15. Non-Abelian vortex lattices

    Science.gov (United States)

    Tallarita, Gianni; Peterson, Adam

    2018-04-01

    We perform a numerical study of the phase diagram of the model proposed in [M. Shifman, Phys. Rev. D 87, 025025 (2013)., 10.1103/PhysRevD.87.025025], which is a simple model containing non-Abelian vortices. As per the case of Abrikosov vortices, we map out a region of parameter space in which the system prefers the formation of vortices in ordered lattice structures. These are generalizations of Abrikosov vortex lattices with extra orientational moduli in the vortex cores. At sufficiently large lattice spacing the low energy theory is described by a sum of C P (1 ) theories, each located on a vortex site. As the lattice spacing becomes smaller, when the self-interaction of the orientational field becomes relevant, only an overall rotation in internal space survives.

  16. Lattice Studies of Hyperon Spectroscopy

    Energy Technology Data Exchange (ETDEWEB)

    Richards, David G. [Thomas Jefferson National Accelerator Facility (TJNAF), Newport News, VA (United States)

    2016-04-01

    I describe recent progress at studying the spectrum of hadrons containing the strange quark through lattice QCD calculations. I emphasise in particular the richness of the spectrum revealed by lattice studies, with a spectrum of states at least as rich as that of the quark model. I conclude by prospects for future calculations, including in particular the determination of the decay amplitudes for the excited states.

  17. Harmonic oscillator on a lattice

    International Nuclear Information System (INIS)

    Ader, J.P.; Bonnier, B.; Hontebeyrie, M.; Meyers, C.

    1983-01-01

    The continuum limit of the ground state energy for the harmonic oscillator with discrete time is derived for all possible choices of the lattice derivative. The occurrence of unphysical values is shown to arise whenever the lattice laplacian is not strictly positive on its Brillouin zone. These undesirable limits can either be finite and arbitrary (multiple spectrum) or infinite (overlapping sublattices with multiple spectrum). (orig.)

  18. Lattice gauge theory for QCD

    International Nuclear Information System (INIS)

    DeGrand, T.

    1997-01-01

    These lectures provide an introduction to lattice methods for nonperturbative studies of Quantum Chromodynamics. Lecture 1: Basic techniques for QCD and results for hadron spectroscopy using the simplest discretizations; lecture 2: Improved actions--what they are and how well they work; lecture 3: SLAC physics from the lattice-structure functions, the mass of the glueball, heavy quarks and α s (M z ), and B-anti B mixing. 67 refs., 36 figs

  19. Wigner Functions on a Lattice

    OpenAIRE

    Takami, A.; Hashimoto, T.; Horibe, M.; Hayashi, A.

    2000-01-01

    The Wigner functions on the one dimensional lattice are studied. Contrary to the previous claim in literature, Wigner functions exist on the lattice with any number of sites, whether it is even or odd. There are infinitely many solutions satisfying the conditions which reasonable Wigner functions should respect. After presenting a heuristic method to obtain Wigner functions, we give the general form of the solutions. Quantum mechanical expectation values in terms of Wigner functions are also ...

  20. Lattice gauge theory for QCD

    Energy Technology Data Exchange (ETDEWEB)

    DeGrand, T. [Univ. of Colorado, Boulder, CO (United States). Dept. of Physics

    1997-06-01

    These lectures provide an introduction to lattice methods for nonperturbative studies of Quantum Chromodynamics. Lecture 1: Basic techniques for QCD and results for hadron spectroscopy using the simplest discretizations; lecture 2: Improved actions--what they are and how well they work; lecture 3: SLAC physics from the lattice-structure functions, the mass of the glueball, heavy quarks and {alpha}{sub s} (M{sub z}), and B-{anti B} mixing. 67 refs., 36 figs.

  1. Investigation of hadronic structure by solving QCD on a lattice

    International Nuclear Information System (INIS)

    Grandy, J.M.

    1992-01-01

    Various aspects of hadronic structure are investigated by means of lattice calculations. The measurements focus on equal-time quark wavefunctions, correlations of density operators, and vacuum correlators of hadronic currents, with additional measurements of Wilson loops and hadron masses as a consistency check. The wavefunctions are shown to be consistent with a confinement model prediction. The effect of hyperfine splitting on the wavefunctions is shown to agree closely with the quark model prediction. The computed quark density correlations for the pion, rho, and proton at long range are compared with the expected asymptotic behavior. The density correlation also provides a basis for comparing the spatial extent of quark pairs surrounding the hadron with the extent of the valence quark wavefunction. Vacuum correlation functions of hadronic currents are compared with phenomenological fits to experimental data and sum rule calculations. Hadronic observable calculations are performed by evaluating path integrals in imaginary time using a Monte Carlo technique. Lattices with 16 points in the time direction and spatial volume of 12 3 and 16 3 points are used. The physical lattice spacing is 0.2 fm, and the physical volume of the lattice is large enough that the effect of spatial boundary conditions on the long range structure of the particles can be corrected in a linear fashion

  2. World nuclear energy paths

    International Nuclear Information System (INIS)

    Connolly, T.J.; Hansen, U.; Jaek, W.; Beckurts, K.H.

    1979-01-01

    In examing the world nuclear energy paths, the following assumptions were adopted: the world economy will grow somewhat more slowly than in the past, leading to reductions in electricity demand growth rates; national and international political impediments to the deployment of nuclear power will gradually disappear over the next few years; further development of nuclear power will proceed steadily, without serious interruption but with realistic lead times for the introduction of advanced technologies. Given these assumptions, this paper attempts a study of possible world nuclear energy developments, disaggregated on a regional and national basis. The scenario technique was used and a few alternative fuel-cycle scenarios were developed. Each is an internally consistent model of technically and economically feasible paths to the further development of nuclear power in an aggregate of individual countries and regions of the world. The main purpose of this modeling exercise was to gain some insight into the probable international locations of reactors and other nuclear facilities, the future requirements for uranium and for fuel-cycle services, and the problems of spent-fuel storage and waste management. The study also presents an assessment of the role that nuclear power might actually play in meeting future world energy demand

  3. Controllable photon and phonon localization in optomechanical Lieb lattices.

    Science.gov (United States)

    Wan, Liang-Liang; Lü, Xin-You; Gao, Jin-Hua; Wu, Ying

    2017-07-24

    The Lieb lattice featuring flat band is not only important in strongly-correlated many-body physics, but also can be utilized to inspire new quantum devices. Here we propose an optomechanical Lieb lattice, where the flat-band physics of photon-phonon polaritons is demonstrated. The tunability of the band structure of the optomechanical arrays allows one to obtain an approximate photon or phonon flat band as well as the transition between them. This ultimately leads to the result that the controllable photon or phonon localization could be realized by the path interference effects. This study offers an alternative approach to explore the exotic photon and phonon many-body effects, which has potential applications in the future hybrid-photon-phonon quantum network and engineering new type solid-state quantum devices.

  4. Racetrack lattices for the TRIUMF KAON factory

    International Nuclear Information System (INIS)

    Servranckx, R.V.; Wienands, U.; Craddock, M.K.; Rees, G.H.

    1989-03-01

    Separated-function racetrack lattices have been developed for the KAON Factory accelerators that have more flexibility than the old circular lattices. Straight sections with zero dispersion are provided for rf cavities and fast injection and extraction, and with controlled dispersion for H - injection and slow extraction. In addition the new lattices have fewer depolarizing resonances than the old circular lattices

  5. Lattice gauge theory using parallel processors

    International Nuclear Information System (INIS)

    Lee, T.D.; Chou, K.C.; Zichichi, A.

    1987-01-01

    The book's contents include: Lattice Gauge Theory Lectures: Introduction and Current Fermion Simulations; Monte Carlo Algorithms for Lattice Gauge Theory; Specialized Computers for Lattice Gauge Theory; Lattice Gauge Theory at Finite Temperature: A Monte Carlo Study; Computational Method - An Elementary Introduction to the Langevin Equation, Present Status of Numerical Quantum Chromodynamics; Random Lattice Field Theory; The GF11 Processor and Compiler; and The APE Computer and First Physics Results; Columbia Supercomputer Project: Parallel Supercomputer for Lattice QCD; Statistical and Systematic Errors in Numerical Simulations; Monte Carlo Simulation for LGT and Programming Techniques on the Columbia Supercomputer; Food for Thought: Five Lectures on Lattice Gauge Theory

  6. Optimal path planning for a mobile robot using cuckoo search algorithm

    Science.gov (United States)

    Mohanty, Prases K.; Parhi, Dayal R.

    2016-03-01

    The shortest/optimal path planning is essential for efficient operation of autonomous vehicles. In this article, a new nature-inspired meta-heuristic algorithm has been applied for mobile robot path planning in an unknown or partially known environment populated by a variety of static obstacles. This meta-heuristic algorithm is based on the levy flight behaviour and brood parasitic behaviour of cuckoos. A new objective function has been formulated between the robots and the target and obstacles, which satisfied the conditions of obstacle avoidance and target-seeking behaviour of robots present in the terrain. Depending upon the objective function value of each nest (cuckoo) in the swarm, the robot avoids obstacles and proceeds towards the target. The smooth optimal trajectory is framed with this algorithm when the robot reaches its goal. Some simulation and experimental results are presented at the end of the paper to show the effectiveness of the proposed navigational controller.

  7. Benefit of adaptive FEC in shared backup path protected elastic optical network.

    Science.gov (United States)

    Guo, Hong; Dai, Hua; Wang, Chao; Li, Yongcheng; Bose, Sanjay K; Shen, Gangxiang

    2015-07-27

    We apply an adaptive forward error correction (FEC) allocation strategy to an Elastic Optical Network (EON) operated with shared backup path protection (SBPP). To maximize the protected network capacity that can be carried, an Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed. Simulation results show that the FEC coding overhead required by the adaptive FEC scheme is significantly lower than that needed by a fixed FEC allocation strategy resulting in higher network capacity for the adaptive strategy. The adaptive FEC allocation strategy can also significantly outperform the fixed FEC allocation strategy both in terms of the spare capacity redundancy and the average FEC coding overhead needed per optical channel. The proposed heuristic algorithm is efficient and not only performs closer to the ILP model but also does much better than the shortest-path algorithm.

  8. Mechanism of fast lattice diffusion of hydrogen in palladium: Interplay of quantum fluctuations and lattice strain

    Science.gov (United States)

    Kimizuka, Hajime; Ogata, Shigenobu; Shiga, Motoyuki

    2018-01-01

    Understanding the underlying mechanism of the nanostructure-mediated high diffusivity of H in Pd is of recent scientific interest and also crucial for industrial applications. Here, we present a decisive scenario explaining the emergence of the fast lattice-diffusion mode of interstitial H in face-centered cubic Pd, based on the quantum mechanical natures of both electrons and nuclei under finite strains. Ab initio path-integral molecular dynamics was applied to predict the temperature- and strain-dependent free energy profiles for H migration in Pd over a temperature range of 150-600 K and under hydrostatic tensile strains of 0.0%-2.4%; such strain conditions are likely to occur in real systems, especially around the elastic fields induced by nanostructured defects. The simulated results revealed that, for preferential H location at octahedral sites, as in unstrained Pd, the activation barrier for H migration (Q ) was drastically increased with decreasing temperature owing to nuclear quantum effects. In contrast, as tetrahedral sites increased in stability with lattice expansion, nuclear quantum effects became less prominent and ceased impeding H migration. This implies that the nature of the diffusion mechanism gradually changes from quantum- to classical-like as the strain is increased. For H atoms in Pd at the hydrostatic strain of ˜2.4 % , we determined that the mechanism promoted fast lattice diffusion (Q =0.11 eV) of approximately 20 times the rate of conventional H diffusion (Q =0.23 eV) in unstrained Pd at a room temperature of 300 K.

  9. Paths of Cultural Systems

    Directory of Open Access Journals (Sweden)

    Paul Ballonoff

    2017-12-01

    Full Text Available A theory of cultural structures predicts the objects observed by anthropologists. We here define those which use kinship relationships to define systems. A finite structure we call a partially defined quasigroup (or pdq, as stated by Definition 1 below on a dictionary (called a natural language allows prediction of certain anthropological descriptions, using homomorphisms of pdqs onto finite groups. A viable history (defined using pdqs states how an individual in a population following such history may perform culturally allowed associations, which allows a viable history to continue to survive. The vector states on sets of viable histories identify demographic observables on descent sequences. Paths of vector states on sets of viable histories may determine which histories can exist empirically.

  10. Propagators and path integrals

    Energy Technology Data Exchange (ETDEWEB)

    Holten, J.W. van

    1995-08-22

    Path-integral expressions for one-particle propagators in scalar and fermionic field theories are derived, for arbitrary mass. This establishes a direct connection between field theory and specific classical point-particle models. The role of world-line reparametrization invariance of the classical action and the implementation of the corresponding BRST-symmetry in the quantum theory are discussed. The presence of classical world-line supersymmetry is shown to lead to an unwanted doubling of states for massive spin-1/2 particles. The origin of this phenomenon is traced to a `hidden` topological fermionic excitation. A different formulation of the pseudo-classical mechanics using a bosonic representation of {gamma}{sub 5} is shown to remove these extra states at the expense of losing manifest supersymmetry. (orig.).

  11. innovation path exploration

    Directory of Open Access Journals (Sweden)

    Li Jian

    2016-01-01

    Full Text Available The world has entered the information age, all kinds of information technologies such as cloud technology, big data technology are in rapid development, and the “Internet plus” appeared. The main purpose of “Internet plus” is to provide an opportunity for the further development of the enterprise, the enterprise technology, business and other aspects of factors combine. For enterprises, grasp the “Internet plus” the impact of the market economy will undoubtedly pave the way for the future development of enterprises. This paper will be on the innovation path of the enterprise management “Internet plus” era tied you study, hope to be able to put forward some opinions and suggestions.

  12. Embedded Lattice and Properties of Gram Matrix

    Directory of Open Access Journals (Sweden)

    Futa Yuichi

    2017-03-01

    Full Text Available In this article, we formalize in Mizar [14] the definition of embedding of lattice and its properties. We formally define an inner product on an embedded module. We also formalize properties of Gram matrix. We formally prove that an inverse of Gram matrix for a rational lattice exists. Lattice of Z-module is necessary for lattice problems, LLL (Lenstra, Lenstra and Lov´asz base reduction algorithm [16] and cryptographic systems with lattice [17].

  13. Arctic curves in path models from the tangent method

    Science.gov (United States)

    Di Francesco, Philippe; Lapa, Matthew F.

    2018-04-01

    Recently, Colomo and Sportiello introduced a powerful method, known as the tangent method, for computing the arctic curve in statistical models which have a (non- or weakly-) intersecting lattice path formulation. We apply the tangent method to compute arctic curves in various models: the domino tiling of the Aztec diamond for which we recover the celebrated arctic circle; a model of Dyck paths equivalent to the rhombus tiling of a half-hexagon for which we find an arctic half-ellipse; another rhombus tiling model with an arctic parabola; the vertically symmetric alternating sign matrices, where we find the same arctic curve as for unconstrained alternating sign matrices. The latter case involves lattice paths that are non-intersecting but that are allowed to have osculating contact points, for which the tangent method was argued to still apply. For each problem we estimate the large size asymptotics of a certain one-point function using LU decomposition of the corresponding Gessel–Viennot matrices, and a reformulation of the result amenable to asymptotic analysis.

  14. Mean field with corrections in lattice gauge theory

    International Nuclear Information System (INIS)

    Flyvbjerg, H.; Zuber, J.B.; Lautrup, B.

    1981-12-01

    A systematic expansion of the path integral for lattice gauge theory is performed around the mean field solution. In this letter the authors present the results for the pure gauge groups Z(2), SU(2) and SO(3). The agreement with Monte Carlo calculations is excellent. For the discrete group the calculation is performed with and without gauge fixing, whereas for the continuous groups gauge fixing is mandatory. In the case of SU(2) the absence of a phase transition is correctly signalled by mean field theory. (Auth.)

  15. Research on Navigation Path Planning for An Underground Load Haul Dump

    Directory of Open Access Journals (Sweden)

    Qi Yulong

    2015-11-01

    Full Text Available The improved A * algorithm is a method of navigation path planning for articulated underground scrapers. Firstly, an environment model based on a mining Geographic Information System (GIS map is established, and then combined with improved A * algorithm, the underground global path planning problem of the intelligent Load Haul Dump (LHD is solved. In this paper, for the articulated structure, the method of expanding nodes by articulation angle is adopted to make expanded nodes meet the trajectory characteristics. In addition, collision threat cost is introduced in the evaluation function to avoid collisions between the LHD and the tunnel walls. As peran analysis of the simulation test to verify the effectiveness of the improved A * algorithm and a comparison with the traditional A * algorithm, the improved A * algorithm can enhance search efficiency. Acontrast of multiple sets of test parameters suggests that when the price weighted coefficient of collision is 0.2, the shortest path can be derived to avoid impact. Finally, tracking results indicate that the proposed algorithm for navigation path planning can maintain the tracking error to within 0.2 m in line with the structural characteristics of the scraper in the laboratory environment to realize the path planning of unmanned scrapers and trajectory tracking. Moreover, the algorithm can enhance the safety of scrapers and prevent roadway collisions. The feasibility and practicality of the proposed method is verified in this work.

  16. Path integral in Snyder space

    Energy Technology Data Exchange (ETDEWEB)

    Mignemi, S., E-mail: smignemi@unica.it [Dipartimento di Matematica e Informatica, Università di Cagliari, Viale Merello 92, 09123 Cagliari (Italy); INFN, Sezione di Cagliari, Cittadella Universitaria, 09042 Monserrato (Italy); Štrajn, R. [Dipartimento di Matematica e Informatica, Università di Cagliari, Viale Merello 92, 09123 Cagliari (Italy); INFN, Sezione di Cagliari, Cittadella Universitaria, 09042 Monserrato (Italy)

    2016-04-29

    The definition of path integrals in one- and two-dimensional Snyder space is discussed in detail both in the traditional setting and in the first-order formalism of Faddeev and Jackiw. - Highlights: • The definition of the path integral in Snyder space is discussed using phase space methods. • The same result is obtained in the first-order formalism of Faddeev and Jackiw. • The path integral formulation of the two-dimensional Snyder harmonic oscillator is outlined.

  17. Path integral in Snyder space

    International Nuclear Information System (INIS)

    Mignemi, S.; Štrajn, R.

    2016-01-01

    The definition of path integrals in one- and two-dimensional Snyder space is discussed in detail both in the traditional setting and in the first-order formalism of Faddeev and Jackiw. - Highlights: • The definition of the path integral in Snyder space is discussed using phase space methods. • The same result is obtained in the first-order formalism of Faddeev and Jackiw. • The path integral formulation of the two-dimensional Snyder harmonic oscillator is outlined.

  18. Path Planning for Mobile Objects in Four-Dimension Based on Particle Swarm Optimization Method with Penalty Function

    Directory of Open Access Journals (Sweden)

    Yong Ma

    2013-01-01

    Full Text Available We present one algorithm based on particle swarm optimization (PSO with penalty function to determine the conflict-free path for mobile objects in four-dimension (three spatial and one-time dimensions with obstacles. The shortest path of the mobile object is set as goal function, which is constrained by conflict-free criterion, path smoothness, and velocity and acceleration requirements. This problem is formulated as a calculus of variation problem (CVP. With parametrization method, the CVP is converted to a time-varying nonlinear programming problem (TNLPP. Constraints of TNLPP are transformed to general TNLPP without any constraints through penalty functions. Then, by using a little calculations and applying the algorithm PSO, the solution of the CVP is consequently obtained. Approach efficiency is confirmed by numerical examples.

  19. Time optimized path-choice in the termite hunting ant Megaponera analis.

    Science.gov (United States)

    Frank, Erik T; Hönle, Philipp O; Linsenmair, K Eduard

    2018-05-10

    Trail network systems among ants have received a lot of scientific attention due to their various applications in problem solving of networks. Recent studies have shown that ants select the fastest available path when facing different velocities on different substrates, rather than the shortest distance. The progress of decision-making by these ants is determined by pheromone-based maintenance of paths, which is a collective decision. However, path optimization through individual decision-making remains mostly unexplored. Here we present the first study of time-optimized path selection via individual decision-making by scout ants. Megaponera analis scouts search for termite foraging sites and lead highly organized raid columns to them. The path of the scout determines the path of the column. Through installation of artificial roads around M. analis nests we were able to influence the pathway choice of the raids. After road installation 59% of all recorded raids took place completely or partly on the road, instead of the direct, i.e. distance-optimized, path through grass from the nest to the termites. The raid velocity on the road was more than double the grass velocity, the detour thus saved 34.77±23.01% of the travel time compared to a hypothetical direct path. The pathway choice of the ants was similar to a mathematical model of least time allowing us to hypothesize the underlying mechanisms regulating the behavior. Our results highlight the importance of individual decision-making in the foraging behavior of ants and show a new procedure of pathway optimization. © 2018. Published by The Company of Biologists Ltd.

  20. Finite-lattice-spacing corrections to masses and g factors on a lattice

    International Nuclear Information System (INIS)

    Roskies, R.; Wu, J.C.

    1986-01-01

    We suggest an alternative method for extracting masses and g factors from lattice calculations. Our method takes account of more of the infrared and ultraviolet lattice effects. It leads to more reasonable results in simulations of QED on a lattice

  1. Quantum lattice model solver HΦ

    Science.gov (United States)

    Kawamura, Mitsuaki; Yoshimi, Kazuyoshi; Misawa, Takahiro; Yamaji, Youhei; Todo, Synge; Kawashima, Naoki

    2017-08-01

    HΦ [aitch-phi ] is a program package based on the Lanczos-type eigenvalue solution applicable to a broad range of quantum lattice models, i.e., arbitrary quantum lattice models with two-body interactions, including the Heisenberg model, the Kitaev model, the Hubbard model and the Kondo-lattice model. While it works well on PCs and PC-clusters, HΦ also runs efficiently on massively parallel computers, which considerably extends the tractable range of the system size. In addition, unlike most existing packages, HΦ supports finite-temperature calculations through the method of thermal pure quantum (TPQ) states. In this paper, we explain theoretical background and user-interface of HΦ. We also show the benchmark results of HΦ on supercomputers such as the K computer at RIKEN Advanced Institute for Computational Science (AICS) and SGI ICE XA (Sekirei) at the Institute for the Solid State Physics (ISSP).

  2. Frustrated lattices of Ising chains

    International Nuclear Information System (INIS)

    Kudasov, Yurii B; Korshunov, Aleksei S; Pavlov, V N; Maslov, Dmitrii A

    2012-01-01

    The magnetic structure and magnetization dynamics of systems of plane frustrated Ising chain lattices are reviewed for three groups of compounds: Ca 3 Co 2 O 6 , CsCoCl 3 , and Sr 5 Rh 4 O 12 . The available experimental data are analyzed and compared in detail. It is shown that a high-temperature magnetic phase on a triangle lattice is normally and universally a partially disordered antiferromagnetic (PDA) structure. The diversity of low-temperature phases results from weak interactions that lift the degeneracy of a 2D antiferromagnetic Ising model on the triangle lattice. Mean-field models, Monte Carlo simulation results on the static magnetization curve, and results on slow magnetization dynamics obtained with Glauber's theory are discussed in detail. (reviews of topical problems)

  3. Lattice QCD for nuclear physics

    CERN Document Server

    Meyer, Harvey

    2015-01-01

    With ever increasing computational resources and improvements in algorithms, new opportunities are emerging for lattice gauge theory to address key questions in strongly interacting systems, such as nuclear matter. Calculations today use dynamical gauge-field ensembles with degenerate light up/down quarks and the strange quark and it is possible now to consider including charm-quark degrees of freedom in the QCD vacuum. Pion masses and other sources of systematic error, such as finite-volume and discretization effects, are beginning to be quantified systematically. Altogether, an era of precision calculation has begun, and many new observables will be calculated at the new computational facilities.  The aim of this set of lectures is to provide graduate students with a grounding in the application of lattice gauge theory methods to strongly interacting systems, and in particular to nuclear physics.  A wide variety of topics are covered, including continuum field theory, lattice discretizations, hadron spect...

  4. Nucleon structure from lattice QCD

    Energy Technology Data Exchange (ETDEWEB)

    Dinter, Simon

    2012-11-13

    In this thesis we compute within lattice QCD observables related to the structure of the nucleon. One part of this thesis is concerned with moments of parton distribution functions (PDFs). Those moments are essential elements for the understanding of nucleon structure and can be extracted from a global analysis of deep inelastic scattering experiments. On the theoretical side they can be computed non-perturbatively by means of lattice QCD. However, since the time lattice calculations of moments of PDFs are available, there is a tension between these lattice calculations and the results from a global analysis of experimental data. We examine whether systematic effects are responsible for this tension, and study particularly intensively the effects of excited states by a dedicated high precision computation. Moreover, we carry out a first computation with four dynamical flavors. Another aspect of this thesis is a feasibility study of a lattice QCD computation of the scalar quark content of the nucleon, which is an important element in the cross-section of a heavy particle with the nucleon mediated by a scalar particle (e.g. Higgs particle) and can therefore have an impact on Dark Matter searches. Existing lattice QCD calculations of this quantity usually have a large error and thus a low significance for phenomenological applications. We use a variance-reduction technique for quark-disconnected diagrams to obtain a precise result. Furthermore, we introduce a new stochastic method for the calculation of connected 3-point correlation functions, which are needed to compute nucleon structure observables, as an alternative to the usual sequential propagator method. In an explorative study we check whether this new method is competitive to the standard one. We use Wilson twisted mass fermions at maximal twist in all our calculations, such that all observables considered here have only O(a{sup 2}) discretization effects.

  5. Nucleon structure from lattice QCD

    International Nuclear Information System (INIS)

    Dinter, Simon

    2012-01-01

    In this thesis we compute within lattice QCD observables related to the structure of the nucleon. One part of this thesis is concerned with moments of parton distribution functions (PDFs). Those moments are essential elements for the understanding of nucleon structure and can be extracted from a global analysis of deep inelastic scattering experiments. On the theoretical side they can be computed non-perturbatively by means of lattice QCD. However, since the time lattice calculations of moments of PDFs are available, there is a tension between these lattice calculations and the results from a global analysis of experimental data. We examine whether systematic effects are responsible for this tension, and study particularly intensively the effects of excited states by a dedicated high precision computation. Moreover, we carry out a first computation with four dynamical flavors. Another aspect of this thesis is a feasibility study of a lattice QCD computation of the scalar quark content of the nucleon, which is an important element in the cross-section of a heavy particle with the nucleon mediated by a scalar particle (e.g. Higgs particle) and can therefore have an impact on Dark Matter searches. Existing lattice QCD calculations of this quantity usually have a large error and thus a low significance for phenomenological applications. We use a variance-reduction technique for quark-disconnected diagrams to obtain a precise result. Furthermore, we introduce a new stochastic method for the calculation of connected 3-point correlation functions, which are needed to compute nucleon structure observables, as an alternative to the usual sequential propagator method. In an explorative study we check whether this new method is competitive to the standard one. We use Wilson twisted mass fermions at maximal twist in all our calculations, such that all observables considered here have only O(a 2 ) discretization effects.

  6. Kondo length in bosonic lattices

    Science.gov (United States)

    Giuliano, Domenico; Sodano, Pasquale; Trombettoni, Andrea

    2017-09-01

    Motivated by the fact that the low-energy properties of the Kondo model can be effectively simulated in spin chains, we study the realization of the effect with bond impurities in ultracold bosonic lattices at half filling. After presenting a discussion of the effective theory and of the mapping of the bosonic chain onto a lattice spin Hamiltonian, we provide estimates for the Kondo length as a function of the parameters of the bosonic model. We point out that the Kondo length can be extracted from the integrated real-space correlation functions, which are experimentally accessible quantities in experiments with cold atoms.

  7. Supersymmetry on the noncommutative lattice

    International Nuclear Information System (INIS)

    Nishimura, Jun; Rey, Soo-Jong; Sugino, Fumihiko

    2003-01-01

    Built upon the proposal of Kaplan et al. (heplat{0206109}), we construct noncommutative lattice gauge theory with manifest supersymmetry. We show that such theory is naturally implementable via orbifold conditions generalizing those used by Kaplan et al. We present the prescription in detail and illustrate it for noncommutative gauge theories latticized partially in two dimensions. We point out a deformation freedom in the defining theory by a complex-parameter, reminiscent of discrete torsion in string theory. We show that, in the continuum limit, the supersymmetry is enhanced only at a particular value of the deformation parameter, determined solely by the size of the noncommutativity. (author)

  8. Machines for lattice gauge theory

    International Nuclear Information System (INIS)

    Mackenzie, P.B.

    1989-05-01

    The most promising approach to the solution of the theory of strong interactions is large scale numerical simulation using the techniques of lattice gauge theory. At the present time, computing requirements for convincing calculations of the properties of hadrons exceed the capabilities of even the most powerful commercial supercomputers. This has led to the development of massively parallel computers dedicated to lattice gauge theory. This talk will discuss the computing requirements behind these machines, and general features of the components and architectures of the half dozen major projects now in existence. 20 refs., 1 fig

  9. Graphene on graphene antidot lattices

    DEFF Research Database (Denmark)

    Gregersen, Søren Schou; Pedersen, Jesper Goor; Power, Stephen

    2015-01-01

    Graphene bilayer systems are known to exhibit a band gap when the layer symmetry is broken by applying a perpendicular electric field. The resulting band structure resembles that of a conventional semiconductor with a parabolic dispersion. Here, we introduce a bilayer graphene heterostructure......, where single-layer graphene is placed on top of another layer of graphene with a regular lattice of antidots. We dub this class of graphene systems GOAL: graphene on graphene antidot lattice. By varying the structure geometry, band-structure engineering can be performed to obtain linearly dispersing...

  10. Unconventional superconductivity in honeycomb lattice

    Directory of Open Access Journals (Sweden)

    P Sahebsara

    2013-03-01

    Full Text Available   ‎ The possibility of symmetrical s-wave superconductivity in the honeycomb lattice is studied within a strongly correlated regime, using the Hubbard model. The superconducting order parameter is defined by introducing the Green function, which is obtained by calculating the density of the electrons ‎ . In this study showed that the superconducting order parameter appears in doping interval between 0 and 0.5, and x=0.25 is the optimum doping for the s-wave superconductivity in honeycomb lattice.

  11. [Lattice degeneration of the retina].

    Science.gov (United States)

    Boĭko, E V; Suetov, A A; Mal'tsev, D S

    2014-01-01

    Lattice degeneration of the retina is a clinically important type of peripheral retinal dystrophies due to its participation in the pathogenesis of rhegmatogenous retinal detachment. In spite of extensive epidemiological, morphological, and clinical data, the question on causes of this particular type of retinal dystrophies currently remains debatable. Existing hypotheses on pathogenesis of retinal structural changes in lattice degeneration explain it to a certain extent. In clinical ophthalmology it is necessary to pay close attention to this kind of degenerations and distinguish between cases requiring preventive treatment and those requiring monitoring.

  12. Lattice calculations in gauge theory

    International Nuclear Information System (INIS)

    Rebbi, C.

    1985-01-01

    The lattice formulation of quantum gauge theories is discussed as a viable technique for quantitative studies of nonperturbative effects in QCD. Evidence is presented to ascertain that whole classes of lattice actions produce a universal continuum limit. Discrepancies between numerical results from Monto Carlo simulations for the pure gauge system and for the system with gauge and quark fields are discussed. Numerical calculations for QCD require very substantial computational resources. The use of powerful vector processors of special purpose machines, in extending the scope and magnitude or the calculations is considered, and one may reasonably expect that in the near future good quantitative predictions will be obtained for QCD

  13. Chiral symmetry on the lattice

    International Nuclear Information System (INIS)

    Creutz, M.

    1994-11-01

    The author reviews some of the difficulties associated with chiral symmetry in the context of a lattice regulator. The author discusses the structure of Wilson Fermions when the hopping parameter is in the vicinity of its critical value. Here one flavor contrasts sharply with the case of more, where a residual chiral symmetry survives anomalies. The author briefly discusses the surface mode approach, the use of mirror Fermions to cancel anomalies, and finally speculates on the problems with lattice versions of the standard model

  14. Nuclear Physics from Lattice QCD

    Energy Technology Data Exchange (ETDEWEB)

    William Detmold, Silas Beane, Konstantinos Orginos, Martin Savage

    2011-01-01

    We review recent progress toward establishing lattice Quantum Chromodynamics as a predictive calculational framework for nuclear physics. A survey of the current techniques that are used to extract low-energy hadronic scattering amplitudes and interactions is followed by a review of recent two-body and few-body calculations by the NPLQCD collaboration and others. An outline of the nuclear physics that is expected to be accomplished with Lattice QCD in the next decade, along with estimates of the required computational resources, is presented.

  15. The mean free path of mobile dislocations in ionic crystals

    International Nuclear Information System (INIS)

    Alsem, W.H.M.

    1981-01-01

    In this thesis results are presented of investigations on dislocation motion in deforming NaCl single crystals using the technique of pulsed nuclear magnetic resonance. In particular, the spin-locking pulse sequence is used to measure Tsub(lrho), which is the spin-lattice relaxation time in the presence of a resonant rf magnetic field. Tsub(lrho) depends strongly on the mean free path L, which is covered by the dislocations during successive jumps between obstacles in their glide plane. (Auth.)

  16. Representation theory of lattice current algebras

    International Nuclear Information System (INIS)

    Alekseev, A.Yu.; Eidgenoessische Technische Hochschule, Zurich; Faddeev, L.D.; Froehlich, L.D.; Schomerus, V.; Kyoto Univ.

    1996-04-01

    Lattice current algebras were introduced as a regularization of the left-and right moving degrees of freedom in the WZNW model. They provide examples of lattice theories with a local quantum symmetry U q (G). Their representation theory is studied in detail. In particular, we construct all irreducible representations along with a lattice analogue of the fusion product for representations of the lattice current algebra. It is shown that for an arbitrary number of lattice sites, the representation categories of the lattice current algebras agree with their continuum counterparts. (orig.)

  17. Two Generations of Path Dependence

    DEFF Research Database (Denmark)

    Madsen, Mogens Ove

      Even if there is no fully articulated and generally accepted theory of Path Dependence it has eagerly been taken up across a wide range of social sciences - primarily coming from economics. Path Dependence is most of all a metaphor that offers reason to believe, that some political, social...

  18. Chromatic roots and hamiltonian paths

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2000-01-01

    We present a new connection between colorings and hamiltonian paths: If the chromatic polynomial of a graph has a noninteger root less than or equal to t(n) = 2/3 + 1/3 (3)root (26 + 6 root (33)) + 1/3 (3)root (26 - 6 root (33)) = 1.29559.... then the graph has no hamiltonian path. This result...

  19. On Hilbert space of paths

    International Nuclear Information System (INIS)

    Exner, P.; Kolerov, G.I.

    1980-01-01

    A Hilbert space of paths, the elements of which are determined by trigonometric series, was proposed and used recently by Truman. This space is shown to consist precisely of all absolutely continuous paths ending in the origin with square-integrable derivatives

  20. Hard paths, soft paths or no paths? Cross-cultural perceptions of water solutions

    Science.gov (United States)

    Wutich, A.; White, A. C.; White, D. D.; Larson, K. L.; Brewis, A.; Roberts, C.

    2014-01-01

    In this study, we examine how development status and water scarcity shape people's perceptions of "hard path" and "soft path" water solutions. Based on ethnographic research conducted in four semi-rural/peri-urban sites (in Bolivia, Fiji, New Zealand, and the US), we use content analysis to conduct statistical and thematic comparisons of interview data. Our results indicate clear differences associated with development status and, to a lesser extent, water scarcity. People in the two less developed sites were more likely to suggest hard path solutions, less likely to suggest soft path solutions, and more likely to see no path to solutions than people in the more developed sites. Thematically, people in the two less developed sites envisioned solutions that involve small-scale water infrastructure and decentralized, community-based solutions, while people in the more developed sites envisioned solutions that involve large-scale infrastructure and centralized, regulatory water solutions. People in the two water-scarce sites were less likely to suggest soft path solutions and more likely to see no path to solutions (but no more likely to suggest hard path solutions) than people in the water-rich sites. Thematically, people in the two water-rich sites seemed to perceive a wider array of unrealized potential soft path solutions than those in the water-scarce sites. On balance, our findings are encouraging in that they indicate that people are receptive to soft path solutions in a range of sites, even those with limited financial or water resources. Our research points to the need for more studies that investigate the social feasibility of soft path water solutions, particularly in sites with significant financial and natural resource constraints.

  1. Computers for lattice field theories

    International Nuclear Information System (INIS)

    Iwasaki, Y.

    1994-01-01

    Parallel computers dedicated to lattice field theories are reviewed with emphasis on the three recent projects, the Teraflops project in the US, the CP-PACS project in Japan and the 0.5-Teraflops project in the US. Some new commercial parallel computers are also discussed. Recent development of semiconductor technologies is briefly surveyed in relation to possible approaches toward Teraflops computers. (orig.)

  2. Synthesis of spatially variant lattices.

    Science.gov (United States)

    Rumpf, Raymond C; Pazos, Javier

    2012-07-02

    It is often desired to functionally grade and/or spatially vary a periodic structure like a photonic crystal or metamaterial, yet no general method for doing this has been offered in the literature. A straightforward procedure is described here that allows many properties of the lattice to be spatially varied at the same time while producing a final lattice that is still smooth and continuous. Properties include unit cell orientation, lattice spacing, fill fraction, and more. This adds many degrees of freedom to a design such as spatially varying the orientation to exploit directional phenomena. The method is not a coordinate transformation technique so it can more easily produce complicated and arbitrary spatial variance. To demonstrate, the algorithm is used to synthesize a spatially variant self-collimating photonic crystal to flow a Gaussian beam around a 90° bend. The performance of the structure was confirmed through simulation and it showed virtually no scattering around the bend that would have arisen if the lattice had defects or discontinuities.

  3. From lattice gases to polymers

    NARCIS (Netherlands)

    Frenkel, D.

    1990-01-01

    The modification of a technique that was developed to study time correlations in lattice-gas cellular automata to facilitate the numerical simulation of chain molecules is described. As an example, the calculation of the excess chemical potential of an ideal polymer in a dense colloidal

  4. Flavor extrapolation in lattice QCD

    International Nuclear Information System (INIS)

    Duffy, W.C.

    1984-01-01

    Explicit calculation of the effect of virtual quark-antiquark pairs in lattice QCD has eluded researchers. To include their effect explicitly one must calculate the determinant of the fermion-fermion coupling matrix. Owing to the large number of sites in a continuum limit size lattice, direct evaluation of this term requires an unrealistic amount of computer time. The effect of the virtual pairs can be approximated by ignoring this term and adjusting lattice couplings to reproduce experimental results. This procedure is called the valence approximation since it ignores all but the minimal number of quarks needed to describe hadrons. In this work the effect of the quark-antiquark pairs has been incorporated in a theory with an effective negative number of quark flavors contributing to the closed loops. Various particle masses and decay constants have been calculated for this theory and for one with no virtual pairs. The author attempts to extrapolate results towards positive numbers of quark flavors. The results show approximate agreement with experimental measurements and demonstrate the smoothness of lattice expectations in the number of quark flavors

  5. Nuclear physics on the lattice?

    International Nuclear Information System (INIS)

    Koonin, S.E.

    1985-01-01

    The goal of the paper is to try to adapt lattice gauge theory to build in some biases in order for being applicable to nuclear physics. In so doing the calculations are made more precise, and the author can address questions like the size of the nucleon, the nucleon-nucleon potential, the modifications of the nucleon in the nuclear medium, etc. (Auth.)

  6. Differential geometry of group lattices

    International Nuclear Information System (INIS)

    Dimakis, Aristophanes; Mueller-Hoissen, Folkert

    2003-01-01

    In a series of publications we developed ''differential geometry'' on discrete sets based on concepts of noncommutative geometry. In particular, it turned out that first-order differential calculi (over the algebra of functions) on a discrete set are in bijective correspondence with digraph structures where the vertices are given by the elements of the set. A particular class of digraphs are Cayley graphs, also known as group lattices. They are determined by a discrete group G and a finite subset S. There is a distinguished subclass of ''bicovariant'' Cayley graphs with the property ad(S)S subset of S. We explore the properties of differential calculi which arise from Cayley graphs via the above correspondence. The first-order calculi extend to higher orders and then allow us to introduce further differential geometric structures. Furthermore, we explore the properties of ''discrete'' vector fields which describe deterministic flows on group lattices. A Lie derivative with respect to a discrete vector field and an inner product with forms is defined. The Lie-Cartan identity then holds on all forms for a certain subclass of discrete vector fields. We develop elements of gauge theory and construct an analog of the lattice gauge theory (Yang-Mills) action on an arbitrary group lattice. Also linear connections are considered and a simple geometric interpretation of the torsion is established. By taking a quotient with respect to some subgroup of the discrete group, generalized differential calculi associated with so-called Schreier diagrams are obtained

  7. Lattice dynamics of lithium oxide

    Indian Academy of Sciences (India)

    Abstract. Li2O finds several important technological applications, as it is used in solid- state batteries, can be used as a blanket breeding material in nuclear fusion reactors, etc. Li2O exhibits a fast ion phase, characterized by a thermally induced dynamic disorder in the anionic sub-lattice of Li+, at elevated temperatures ...

  8. Lattice fields and strong interactions

    International Nuclear Information System (INIS)

    Creutz, M.

    1989-06-01

    I review the lattice formulation of gauge theories and the use of numerical methods to investigate nonperturbative phenomena. These methods are directly applicable to studying hadronic matter at high temperatures. Considerable recent progress has been made in numerical algorithms for including dynamical fermions in such calculations. Dealing with a nonvanishing baryon density adds new unsolved challenges. 33 refs

  9. Mean-field lattice trees

    NARCIS (Netherlands)

    Borgs, C.; Chayes, J.T.; Hofstad, van der R.W.; Slade, G.

    1999-01-01

    We introduce a mean-field model of lattice trees based on embeddings into d of abstract trees having a critical Poisson offspring distribution. This model provides a combinatorial interpretation for the self-consistent mean-field model introduced previously by Derbez and Slade [9], and provides an

  10. Lattice quantum chromodynamics: Some topics

    Indian Academy of Sciences (India)

    I will begin with a lightning quick overview of the basic lattice gauge theory and then go on to .... The Monte Carlo technique to evaluate C(t), or the expectation value of any other observable ... x }occurs with a probability proportional to. 890.

  11. Lattice continuum and diffusional creep.

    Science.gov (United States)

    Mesarovic, Sinisa Dj

    2016-04-01

    Diffusional creep is characterized by growth/disappearance of lattice planes at the crystal boundaries that serve as sources/sinks of vacancies, and by diffusion of vacancies. The lattice continuum theory developed here represents a natural and intuitive framework for the analysis of diffusion in crystals and lattice growth/loss at the boundaries. The formulation includes the definition of the Lagrangian reference configuration for the newly created lattice, the transport theorem and the definition of the creep rate tensor for a polycrystal as a piecewise uniform, discontinuous field. The values associated with each crystalline grain are related to the normal diffusional flux at grain boundaries. The governing equations for Nabarro-Herring creep are derived with coupled diffusion and elasticity with compositional eigenstrain. Both, bulk diffusional dissipation and boundary dissipation accompanying vacancy nucleation and absorption, are considered, but the latter is found to be negligible. For periodic arrangements of grains, diffusion formally decouples from elasticity but at the cost of a complicated boundary condition. The equilibrium of deviatorically stressed polycrystals is impossible without inclusion of interface energies. The secondary creep rate estimates correspond to the standard Nabarro-Herring model, and the volumetric creep is small. The initial (primary) creep rate is estimated to be much larger than the secondary creep rate.

  12. Fields on a random lattice

    International Nuclear Information System (INIS)

    Itzykson, C.

    1983-10-01

    We review the formulation of field theory and statistical mechanics on a Poissonian random lattice. Topics discussed include random geometry, the construction of field equations for arbitrary spin, the free field spectrum and the question of localization illustrated in the one dimensional case

  13. Disconnected Diagrams in Lattice QCD

    Science.gov (United States)

    Gambhir, Arjun Singh

    In this work, we present state-of-the-art numerical methods and their applications for computing a particular class of observables using lattice quantum chromodynamics (Lattice QCD), a discretized version of the fundamental theory of quarks and gluons. These observables require calculating so called "disconnected diagrams" and are important for understanding many aspects of hadron structure, such as the strange content of the proton. We begin by introducing the reader to the key concepts of Lattice QCD and rigorously define the meaning of disconnected diagrams through an example of the Wick contractions of the nucleon. Subsequently, the calculation of observables requiring disconnected diagrams is posed as the computationally challenging problem of finding the trace of the inverse of an incredibly large, sparse matrix. This is followed by a brief primer of numerical sparse matrix techniques that overviews broadly used methods in Lattice QCD and builds the background for the novel algorithm presented in this work. We then introduce singular value deflation as a method to improve convergence of trace estimation and analyze its effects on matrices from a variety of fields, including chemical transport modeling, magnetohydrodynamics, and QCD. Finally, we apply this method to compute observables such as the strange axial charge of the proton and strange sigma terms in light nuclei. The work in this thesis is innovative for four reasons. First, we analyze the effects of deflation with a model that makes qualitative predictions about its effectiveness, taking only the singular value spectrum as input, and compare deflated variance with different types of trace estimator noise. Second, the synergy between probing methods and deflation is investigated both experimentally and theoretically. Third, we use the synergistic combination of deflation and a graph coloring algorithm known as hierarchical probing to conduct a lattice calculation of light disconnected matrix elements

  14. Disconnected Diagrams in Lattice QCD

    Energy Technology Data Exchange (ETDEWEB)

    Gambhir, Arjun [College of William and Mary, Williamsburg, VA (United States)

    2017-08-01

    In this work, we present state-of-the-art numerical methods and their applications for computing a particular class of observables using lattice quantum chromodynamics (Lattice QCD), a discretized version of the fundamental theory of quarks and gluons. These observables require calculating so called \\disconnected diagrams" and are important for understanding many aspects of hadron structure, such as the strange content of the proton. We begin by introducing the reader to the key concepts of Lattice QCD and rigorously define the meaning of disconnected diagrams through an example of the Wick contractions of the nucleon. Subsequently, the calculation of observables requiring disconnected diagrams is posed as the computationally challenging problem of finding the trace of the inverse of an incredibly large, sparse matrix. This is followed by a brief primer of numerical sparse matrix techniques that overviews broadly used methods in Lattice QCD and builds the background for the novel algorithm presented in this work. We then introduce singular value deflation as a method to improve convergence of trace estimation and analyze its effects on matrices from a variety of fields, including chemical transport modeling, magnetohydrodynamics, and QCD. Finally, we apply this method to compute observables such as the strange axial charge of the proton and strange sigma terms in light nuclei. The work in this thesis is innovative for four reasons. First, we analyze the effects of deflation with a model that makes qualitative predictions about its effectiveness, taking only the singular value spectrum as input, and compare deflated variance with different types of trace estimator noise. Second, the synergy between probing methods and deflation is investigated both experimentally and theoretically. Third, we use the synergistic combination of deflation and a graph coloring algorithm known as hierarchical probing to conduct a lattice calculation of light disconnected matrix elements

  15. Invasion percolation of single component, multiphase fluids with lattice Boltzmann models

    International Nuclear Information System (INIS)

    Sukop, M.C.; Or, Dani

    2003-01-01

    Application of the lattice Boltzmann method (LBM) to invasion percolation of single component multiphase fluids in porous media offers an opportunity for more realistic modeling of the configurations and dynamics of liquid/vapor and liquid/solid interfaces. The complex geometry of connected paths in standard invasion percolation models arises solely from the spatial arrangement of simple elements on a lattice. In reality, fluid interfaces and connectivity in porous media are naturally controlled by the details of the pore geometry, its dynamic interaction with the fluid, and the ambient fluid potential. The multiphase LBM approach admits realistic pore geometry derived from imaging techniques and incorporation of realistic hydrodynamics into invasion percolation models

  16. A New Adaptive Structural Signature for Symbol Recognition by Using a Galois Lattice as a Classifier.

    Science.gov (United States)

    Coustaty, M; Bertet, K; Visani, M; Ogier, J

    2011-08-01

    In this paper, we propose a new approach for symbol recognition using structural signatures and a Galois lattice as a classifier. The structural signatures are based on topological graphs computed from segments which are extracted from the symbol images by using an adapted Hough transform. These structural signatures-that can be seen as dynamic paths which carry high-level information-are robust toward various transformations. They are classified by using a Galois lattice as a classifier. The performance of the proposed approach is evaluated based on the GREC'03 symbol database, and the experimental results we obtain are encouraging.

  17. Probing many-body interactions in an optical lattice clock

    Energy Technology Data Exchange (ETDEWEB)

    Rey, A.M., E-mail: arey@jilau1.colorado.edu [JILA, NIST and University of Colorado, Department of Physics, Boulder, CO 80309 (United States); Gorshkov, A.V. [Joint Quantum Institute, NIST and University of Maryland, Department of Physics, College Park, MD 20742 (United States); Kraus, C.V. [Institute for Quantum Optics and Quantum Information of the Austrian Academy of Sciences, A-6020 Innsbruck (Austria); Institute for Theoretical Physics, University of Innsbruck, A-6020 Innsbruck (Austria); Martin, M.J. [JILA, NIST and University of Colorado, Department of Physics, Boulder, CO 80309 (United States); Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, CA 91125 (United States); Bishof, M.; Swallows, M.D.; Zhang, X.; Benko, C.; Ye, J. [JILA, NIST and University of Colorado, Department of Physics, Boulder, CO 80309 (United States); Lemke, N.D.; Ludlow, A.D. [National Institute of Standards and Technology, Boulder, CO 80305 (United States)

    2014-01-15

    We present a unifying theoretical framework that describes recently observed many-body effects during the interrogation of an optical lattice clock operated with thousands of fermionic alkaline earth atoms. The framework is based on a many-body master equation that accounts for the interplay between elastic and inelastic p-wave and s-wave interactions, finite temperature effects and excitation inhomogeneity during the quantum dynamics of the interrogated atoms. Solutions of the master equation in different parameter regimes are presented and compared. It is shown that a general solution can be obtained by using the so called Truncated Wigner Approximation which is applied in our case in the context of an open quantum system. We use the developed framework to model the density shift and decay of the fringes observed during Ramsey spectroscopy in the JILA {sup 87}Sr and NIST {sup 171}Yb optical lattice clocks. The developed framework opens a suitable path for dealing with a variety of strongly-correlated and driven open-quantum spin systems. -- Highlights: •Derived a theoretical framework that describes many-body effects in a lattice clock. •Validated the analysis with recent experimental measurements. •Demonstrated the importance of beyond mean field corrections in the dynamics.

  18. Optimal Paths in Gliding Flight

    Science.gov (United States)

    Wolek, Artur

    Underwater gliders are robust and long endurance ocean sampling platforms that are increasingly being deployed in coastal regions. This new environment is characterized by shallow waters and significant currents that can challenge the mobility of these efficient (but traditionally slow moving) vehicles. This dissertation aims to improve the performance of shallow water underwater gliders through path planning. The path planning problem is formulated for a dynamic particle (or "kinematic car") model. The objective is to identify the path which satisfies specified boundary conditions and minimizes a particular cost. Several cost functions are considered. The problem is addressed using optimal control theory. The length scales of interest for path planning are within a few turn radii. First, an approach is developed for planning minimum-time paths, for a fixed speed glider, that are sub-optimal but are guaranteed to be feasible in the presence of unknown time-varying currents. Next the minimum-time problem for a glider with speed controls, that may vary between the stall speed and the maximum speed, is solved. Last, optimal paths that minimize change in depth (equivalently, maximize range) are investigated. Recognizing that path planning alone cannot overcome all of the challenges associated with significant currents and shallow waters, the design of a novel underwater glider with improved capabilities is explored. A glider with a pneumatic buoyancy engine (allowing large, rapid buoyancy changes) and a cylindrical moving mass mechanism (generating large pitch and roll moments) is designed, manufactured, and tested to demonstrate potential improvements in speed and maneuverability.

  19. Statistical hydrodynamics of lattice-gas automata

    OpenAIRE

    Grosfils, Patrick; Boon, Jean-Pierre; Brito López, Ricardo; Ernst, M. H.

    1993-01-01

    We investigate the space and time behavior of spontaneous thermohydrodynamic fluctuations in a simple fluid modeled by a lattice-gas automaton and develop the statistical-mechanical theory of thermal lattice gases to compute the dynamical structure factor, i.e., the power spectrum of the density correlation function. A comparative analysis of the theoretical predictions with our lattice gas simulations is presented. The main results are (i) the spectral function of the lattice-gas fluctuation...

  20. Perfect discretization of path integrals

    International Nuclear Information System (INIS)

    Steinhaus, Sebastian

    2012-01-01

    In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

  1. Perfect discretization of path integrals

    Science.gov (United States)

    Steinhaus, Sebastian

    2012-05-01

    In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

  2. Lattice QCD. A critical status report

    Energy Technology Data Exchange (ETDEWEB)

    Jansen, Karl

    2008-10-15

    The substantial progress that has been achieved in lattice QCD in the last years is pointed out. I compare the simulation cost and systematic effects of several lattice QCD formulations and discuss a number of topics such as lattice spacing scaling, applications of chiral perturbation theory, non-perturbative renormalization and finite volume effects. Additionally, the importance of demonstrating universality is emphasized. (orig.)

  3. Lattice QCD. A critical status report

    International Nuclear Information System (INIS)

    Jansen, Karl

    2008-10-01

    The substantial progress that has been achieved in lattice QCD in the last years is pointed out. I compare the simulation cost and systematic effects of several lattice QCD formulations and discuss a number of topics such as lattice spacing scaling, applications of chiral perturbation theory, non-perturbative renormalization and finite volume effects. Additionally, the importance of demonstrating universality is emphasized. (orig.)

  4. Gauge theories on a small lattice

    International Nuclear Information System (INIS)

    Robson, D.; Webber, D.M.

    1980-01-01

    We present exact solutions to U(1), SU(2), and SU(3) lattice gauge theories on a Kogut-Susskind lattice consisting of a single plaquette. We demonstrate precise equivalence between the U(1) theory and the harmonic oscillator on an infinite one-dimensional lattice, and between the SU(N) theory and an N-fermion Schroedinger equation. (orig.)

  5. Spatiotemporal complexity in coupled map lattices

    International Nuclear Information System (INIS)

    Kaneko, Kunihiko

    1986-01-01

    Some spatiotemporal patterns of couple map lattices are presented. The chaotic kink-like motions are shown for the phase motion of the coupled circle lattices. An extension of the couple map lattice approach to Hamiltonian dynamics is briefly reported. An attempt to characterize the high-dimensional attractor by the extension of the correlation dimension is discussed. (author)

  6. Clar sextets in square graphene antidot lattices

    DEFF Research Database (Denmark)

    Petersen, Rene; Pedersen, Thomas Garm; Jauho, Antti-Pekka

    2011-01-01

    A periodic array of holes transforms graphene from a semimetal into a semiconductor with a band gap tuneable by varying the parameters of the lattice. In earlier work only hexagonal lattices have been treated. Using atomistic models we here investigate the size of the band gap of a square lattice...

  7. Spatial classification with fuzzy lattice reasoning

    NARCIS (Netherlands)

    Mavridis, Constantinos; Athanasiadis, I.N.

    2017-01-01

    This work extends the Fuzzy Lattice Reasoning (FLR) Classifier to manage spatial attributes, and spatial relationships. Specifically, we concentrate on spatial entities, as countries, cities, or states. Lattice Theory requires the elements of a Lattice to be partially ordered. To match such

  8. The Robot Path Planning Based on Improved Artificial Fish Swarm Algorithm

    Directory of Open Access Journals (Sweden)

    Yi Zhang

    2016-01-01

    Full Text Available Path planning is critical to the efficiency and fidelity of robot navigation. The solution of robot path planning is to seek a collision-free and the shortest path from the start node to target node. In this paper, we propose a new improved artificial fish swarm algorithm (IAFSA to process the mobile robot path planning problem in a real environment. In IAFSA, an attenuation function is introduced to improve the visual of standard AFSA and get the balance of global search and local search; also, an adaptive operator is introduced to enhance the adaptive ability of step. Besides, a concept of inertia weight factor is proposed in IAFSA inspired by PSO intelligence algorithm to improve the convergence rate and accuracy of IAFSA. Five unconstrained optimization test functions are given to illustrate the strong searching ability and ideal convergence of IAFSA. Finally, the ROS (robot operation system based experiment is carried out on a Pioneer 3-DX mobile robot; the experiment results also show the superiority of IAFSA.

  9. Integrated flight path planning system and flight control system for unmanned helicopters.

    Science.gov (United States)

    Jan, Shau Shiun; Lin, Yu Hsiang

    2011-01-01

    This paper focuses on the design of an integrated navigation and guidance system for unmanned helicopters. The integrated navigation system comprises two systems: the Flight Path Planning System (FPPS) and the Flight Control System (FCS). The FPPS finds the shortest flight path by the A-Star (A*) algorithm in an adaptive manner for different flight conditions, and the FPPS can add a forbidden zone to stop the unmanned helicopter from crossing over into dangerous areas. In this paper, the FPPS computation time is reduced by the multi-resolution scheme, and the flight path quality is improved by the path smoothing methods. Meanwhile, the FCS includes the fuzzy inference systems (FISs) based on the fuzzy logic. By using expert knowledge and experience to train the FIS, the controller can operate the unmanned helicopter without dynamic models. The integrated system of the FPPS and the FCS is aimed at providing navigation and guidance to the mission destination and it is implemented by coupling the flight simulation software, X-Plane, and the computing software, MATLAB. Simulations are performed and shown in real time three-dimensional animations. Finally, the integrated system is demonstrated to work successfully in controlling the unmanned helicopter to operate in various terrains of a digital elevation model (DEM).

  10. The graph-theoretic minimum energy path problem for ionic conduction

    Directory of Open Access Journals (Sweden)

    Ippei Kishida

    2015-10-01

    Full Text Available A new computational method was developed to analyze the ionic conduction mechanism in crystals through graph theory. The graph was organized into nodes, which represent the crystal structures modeled by ionic site occupation, and edges, which represent structure transitions via ionic jumps. We proposed a minimum energy path problem, which is similar to the shortest path problem. An effective algorithm to solve the problem was established. Since our method does not use randomized algorithm and time parameters, the computational cost to analyze conduction paths and a migration energy is very low. The power of the method was verified by applying it to α-AgI and the ionic conduction mechanism in α-AgI was revealed. The analysis using single point calculations found the minimum energy path for long-distance ionic conduction, which consists of 12 steps of ionic jumps in a unit cell. From the results, the detailed theoretical migration energy was calculated as 0.11 eV by geometry optimization and nudged elastic band method. Our method can refine candidates for possible jumps in crystals and it can be adapted to other computational methods, such as the nudged elastic band method. We expect that our method will be a powerful tool for analyzing ionic conduction mechanisms, even for large complex crystals.

  11. Integrated Flight Path Planning System and Flight Control System for Unmanned Helicopters

    Science.gov (United States)

    Jan, Shau Shiun; Lin, Yu Hsiang

    2011-01-01

    This paper focuses on the design of an integrated navigation and guidance system for unmanned helicopters. The integrated navigation system comprises two systems: the Flight Path Planning System (FPPS) and the Flight Control System (FCS). The FPPS finds the shortest flight path by the A-Star (A*) algorithm in an adaptive manner for different flight conditions, and the FPPS can add a forbidden zone to stop the unmanned helicopter from crossing over into dangerous areas. In this paper, the FPPS computation time is reduced by the multi-resolution scheme, and the flight path quality is improved by the path smoothing methods. Meanwhile, the FCS includes the fuzzy inference systems (FISs) based on the fuzzy logic. By using expert knowledge and experience to train the FIS, the controller can operate the unmanned helicopter without dynamic models. The integrated system of the FPPS and the FCS is aimed at providing navigation and guidance to the mission destination and it is implemented by coupling the flight simulation software, X-Plane, and the computing software, MATLAB. Simulations are performed and shown in real time three-dimensional animations. Finally, the integrated system is demonstrated to work successfully in controlling the unmanned helicopter to operate in various terrains of a digital elevation model (DEM). PMID:22164029

  12. Inexpensive chirality on the lattice

    International Nuclear Information System (INIS)

    Kamleh, W.; Williams, A.G.; Adams, D.

    2000-01-01

    Full text: Implementing lattice fermions that resemble as closely as possible continuum fermions is one of the main goals of the theoretical physics community. Aside from a lack of infinitely powerful computers, one of the main impediments to this is the Nielsen-Ninomiya No-Go theorem for chirality on the lattice. One of the consequences of this theorem is that exact chiral symmetry and a lack of fermion doublers cannot be simultaneously satisfied for fermions on the lattice. In the commonly used Wilson fermion formulation, chiral symmetry is explicitly sacrificed on the lattice to avoid fermion doubling. Recently, an alternative has come forward, namely, the Ginsparg-Wilson relation and one of its solutions, the Overlap fermion. The Ginsparg-Wilson relation is a statement of lattice-deformed chirality. The Overlap-Dirac operator is a member of the family of solutions of the Ginsparg-Wilson relation. In recent times, Overlap fermions have been of great interest to the community due to their excellent chiral properties. However, they are significantly more expensive to implement than Wilson fermions. This expense is primarily due to the fact that the Overlap implementation requires an evaluation of the sign function for the Wilson-Dirac operator. The sign function is approximated by a high order rational polynomial function, but this approximation is poor close to the origin. The less near-zero modes that the Wilson- Dirac operator possesses, the cheaper the Overlap operator will be to implement. A means of improving the eigenvalue properties of the Wilson-Dirac operator by the addition of a so-called 'Clover' term is put forward. Numerical results are given that demonstrate this improvement. The Nielsen-Ninomiya no-go theorem and chirality on the lattice are reviewed. The general form of solutions of the Ginsparg-Wilson relation are given, and the Overlap solution is discussed. Properties of the Overlap-Dirac operator are given, including locality and analytic

  13. An Introduction to Path Analysis

    Science.gov (United States)

    Wolfe, Lee M.

    1977-01-01

    The analytical procedure of path analysis is described in terms of its use in nonexperimental settings in the social sciences. The description assumes a moderate statistical background on the part of the reader. (JKS)

  14. Probabilistic simulation of fermion paths

    International Nuclear Information System (INIS)

    Zhirov, O.V.

    1989-01-01

    Permutation symmetry of fermion path integral allows (while spin degrees of freedom are ignored) to use in its simulation any probabilistic algorithm, like Metropolis one, heat bath, etc. 6 refs., 2 tabs

  15. Investigation of the spinfoam path integral with quantum cuboid intertwiners

    Science.gov (United States)

    Bahr, Benjamin; Steinhaus, Sebastian

    2016-05-01

    In this work, we investigate the 4d path integral for Euclidean quantum gravity on a hypercubic lattice, as given by the spinfoam model by Engle, Pereira, Rovelli, Livine, Freidel and Krasnov. To tackle the problem, we restrict to a set of quantum geometries that reflects the large amount of lattice symmetries. In particular, the sum over intertwiners is restricted to quantum cuboids, i.e. coherent intertwiners which describe a cuboidal geometry in the large-j limit. Using asymptotic expressions for the vertex amplitude, we find several interesting properties of the state sum. First of all, the value of coupling constants in the amplitude functions determines whether geometric or nongeometric configurations dominate the path integral. Secondly, there is a critical value of the coupling constant α , which separates two phases. In both phases, the diffeomorphism symmetry appears to be broken. In one, the dominant contribution comes from highly irregular, in the other from highly regular configurations, both describing flat Euclidean space with small quantum fluctuations around them, viewed in different coordinate systems. On the critical point diffeomorphism symmetry is nearly restored, however. Thirdly, we use the state sum to compute the physical norm of kinematical states, i.e. their norm in the physical Hilbert space. We find that states which describe boundary geometry with high torsion have an exponentially suppressed physical norm. We argue that this allows one to exclude them from the state sum in calculations.

  16. Evaluation of quantum mechanics path integrals by the approximations exact on a class of polynomial functionals

    International Nuclear Information System (INIS)

    Lobanov, Yu.Yu.; Shidkov, E.P.

    1987-01-01

    The method for numerical evaluation of path integrals in Eucledean quantum mechanics without lattice discretization is elaborated. The method is based on the representation of these integrals in the form of functional integrals with respect to the conditional Wiener measure and on the use of the derived approximate exact on a class of polynomial functionals of a given degree. By the computations of non-perturbative characteristics, concerned the topological structure of vacuum, the advantages of this method versus lattice Monte-Carlo calculations are demonstrated

  17. Perfect discretization of path integrals

    OpenAIRE

    Steinhaus, Sebastian

    2011-01-01

    In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discu...

  18. Chiral fermions on the lattice

    International Nuclear Information System (INIS)

    Randjbar Daemi, S.; Strathdee, J.

    1995-01-01

    The overlap approach to chiral gauge theories on arbitrary D-dimensional lattices is studied. The doubling problem and its relation to chiral anomalies for D = 2 and 4 is examined. In each case it is shown that the doublers can be eliminated and the well known perturbative results for chiral anomalies can be recovered. We also consider the multi-flavour case and give the general criteria for the construction of anomaly free chiral gauge theories on arbitrary lattices. We calculate the second order terms in a continuum approximation to the overlap formula in D dimensions and show that they coincide with the bilinear part of the effective action of D-dimensional Weyl fermions coupled to a background gauge field. Finally, using the same formalism we reproduce the correct Lorentz, diffeomorphism and gauge anomalies in the coupling of a Weyl fermion to 2-dimensional gravitation and Maxwell fields. (author). 15 refs

  19. Entropy favours open colloidal lattices

    Science.gov (United States)

    Mao, Xiaoming; Chen, Qian; Granick, Steve

    2013-03-01

    Burgeoning experimental and simulation activity seeks to understand the existence of self-assembled colloidal structures that are not close-packed. Here we describe an analytical theory based on lattice dynamics and supported by experiments that reveals the fundamental role entropy can play in stabilizing open lattices. The entropy we consider is associated with the rotational and vibrational modes unique to colloids interacting through extended attractive patches. The theory makes predictions of the implied temperature, pressure and patch-size dependence of the phase diagram of open and close-packed structures. More generally, it provides guidance for the conditions at which targeted patchy colloidal assemblies in two and three dimensions are stable, thus overcoming the difficulty in exploring by experiment or simulation the full range of conceivable parameters.

  20. Electroweak interactions on the lattice

    International Nuclear Information System (INIS)

    Kieu, T.D.

    1994-07-01

    It is shown that the lattice fermion doubling phenomenon is connected to the chiral anomaly which is unique to the electroweak interactions. The chiral anomaly is the breaking of chiral gauge symmetry at the quantum level due to the quantum fluctuations. Such breaking, however, is undesirable and to be avoided. The preservation of gauge symmetry imposes stringent constraints on acceptable chiral gauge theory. It is argued that the constraints are unnecessary because the conventional quantization of chiral gauge theory has missed out some crucial contributions of the chiral interactions. The corrected quantization yields consistent theory in which there is no gauge anomaly and in which various mass terms can be introduced with neither the loss of gauge invariance nor the need for the Higgs mechanism. The new quantization also provide a solution to the difficulty of how to model the electroweak interactions on the lattice. 9 refs. 1 fig

  1. Entanglement scaling in lattice systems

    Energy Technology Data Exchange (ETDEWEB)

    Audenaert, K M R [Institute for Mathematical Sciences, Imperial College London, 53 Prince' s Gate, Exhibition Road, London SW7 2PG (United Kingdom); Cramer, M [QOLS, Blackett Laboratory, Imperial College London, Prince Consort Road, London SW7 2BW (United Kingdom); Eisert, J [Institute for Mathematical Sciences, Imperial College London, 53 Prince' s Gate, Exhibition Road, London SW7 2PG (United Kingdom); Plenio, M B [Institute for Mathematical Sciences, Imperial College London, 53 Prince' s Gate, Exhibition Road, London SW7 2PG (United Kingdom)

    2007-05-15

    We review some recent rigorous results on scaling laws of entanglement properties in quantum many body systems. More specifically, we study the entanglement of a region with its surrounding and determine its scaling behaviour with its size for systems in the ground and thermal states of bosonic and fermionic lattice systems. A theorem connecting entanglement between a region and the rest of the lattice with the surface area of the boundary between the two regions is presented for non-critical systems in arbitrary spatial dimensions. The entanglement scaling in the field limit exhibits a peculiar difference between fermionic and bosonic systems. In one-spatial dimension a logarithmic divergence is recovered for both bosonic and fermionic systems. In two spatial dimensions in the setting of half-spaces however we observe strict area scaling for bosonic systems and a multiplicative logarithmic correction to such an area scaling in fermionic systems. Similar questions may be posed and answered in classical systems.

  2. Transitionless lattices for LAMPF II

    International Nuclear Information System (INIS)

    Franczak, B.J.

    1984-10-01

    Some techniques are described for the design of synchrotron lattices that have zero dispersion in the straight sections and/or imaginary transition energy (negative momentum-compaction factor) but no excessive amplitudes of the dispersion function. Included as an application is a single-stage synchrotron, with variable optics, that has different ion-optical properties at injection and extraction but requires a complex way of programming the quadrupoles. In addition, a two-stage facility consisting of a 45-GeV synchrotron of 1100-m circumference and a 9-GeV booster of half that size is presented. As alternates to these separated-function lattices, some combined-function modules are given that can be used to construct a synchrotron with similar properties

  3. Graphene antidot lattice transport measurements

    DEFF Research Database (Denmark)

    Mackenzie, David; Cagliani, Alberto; Gammelgaard, Lene

    2017-01-01

    We investigate graphene devices patterned with a narrow band of holes perpendicular to the current flow, a few-row graphene antidot lattice (FR-GAL). Theoretical reports suggest that a FR-GAL can have a bandgap with a relatively small reduction of the transmission compared to what is typical...... for antidot arrays devices. Graphene devices were fabricated using 100 keV electron beam lithography (EBL) for nanopatterning as well as for defining electrical contacts. Patterns with hole diameter and neck widths of order 30 nm were produced, which is the highest reported pattern density of antidot lattices...... in graphene reported defined by EBL. Electrical measurements showed that devices with one and five rows exhibited field effect mobility of ∼100 cm2/Vs, while a larger number of rows, around 40, led to a significant reduction of field effect mobility (

  4. Cellular automata in cytoskeletal lattices

    Energy Technology Data Exchange (ETDEWEB)

    Smith, S A; Watt, R C; Hameroff, S R

    1984-01-01

    Cellular automata (CA) activities could mediate biological regulation and information processing via nonlinear electrodynamic effects in cytoskeletal lattice arrays. Frohlich coherent oscillations and other nonlinear mechanisms may effect discrete 10/sup -10/ to 10/sup -11/ s interval events which result in dynamic patterns in biolattices such as cylindrical protein polymers: microtubules (MT). Structural geometry and electrostatic forces of MT subunit dipole oscillations suggest neighbor rules among the hexagonally packed protein subunits. Computer simulations using these suggested rules and MT structural geometry demonstrate CA activities including dynamical and stable self-organizing patterns, oscillators, and traveling gliders. CA activities in MT and other cytoskeletal lattices may have important biological regulatory functions. 23 references, 6 figures, 1 table.

  5. Innovations in lattice QCD algorithms

    International Nuclear Information System (INIS)

    Orginos, Konstantinos

    2006-01-01

    Lattice QCD calculations demand a substantial amount of computing power in order to achieve the high precision results needed to better understand the nature of strong interactions, assist experiment to discover new physics, and predict the behavior of a diverse set of physical systems ranging from the proton itself to astrophysical objects such as neutron stars. However, computer power alone is clearly not enough to tackle the calculations we need to be doing today. A steady stream of recent algorithmic developments has made an important impact on the kinds of calculations we can currently perform. In this talk I am reviewing these algorithms and their impact on the nature of lattice QCD calculations performed today

  6. Baryon structure from lattice QCD

    International Nuclear Information System (INIS)

    Alexandrou, C.

    2009-01-01

    We present recent lattice results on the baryon spectrum, nucleon electromagnetic and axial form factors, nucleon to Δ transition form factors as well as the Δ electromagnetic form factors. The masses of the low lying baryons and the nucleon form factors are calculated using two degenerate flavors of twisted mass fermions down to pion mass of about 270 MeV. We compare to the results of other collaborations. The nucleon to Δ transition and Δ form factors are calculated in a hybrid scheme, which uses staggered sea quarks and domain wall valence quarks. The dominant magnetic dipole nucleon to Δ transition form factor is also evaluated using dynamical domain wall fermions. The transverse density distributions of the Δ in the infinite momentum frame are extracted using the form factors determined from lattice QCD. (author)

  7. Multigrid for Staggered Lattice Fermions

    Energy Technology Data Exchange (ETDEWEB)

    Brower, Richard C. [Boston U.; Clark, M. A. [Unlisted, US; Strelchenko, Alexei [Fermilab; Weinberg, Evan [Boston U.

    2018-01-23

    Critical slowing down in Krylov methods for the Dirac operator presents a major obstacle to further advances in lattice field theory as it approaches the continuum solution. Here we formulate a multi-grid algorithm for the Kogut-Susskind (or staggered) fermion discretization which has proven difficult relative to Wilson multigrid due to its first-order anti-Hermitian structure. The solution is to introduce a novel spectral transformation by the K\\"ahler-Dirac spin structure prior to the Galerkin projection. We present numerical results for the two-dimensional, two-flavor Schwinger model, however, the general formalism is agnostic to dimension and is directly applicable to four-dimensional lattice QCD.

  8. Computing nucleon EDM on a lattice

    Science.gov (United States)

    Abramczyk, Michael; Aoki, Sinya; Blum, Tom; Izubuchi, Taku; Ohki, Hiroshi; Syritsyn, Sergey

    2018-03-01

    I will discuss briefly recent changes in the methodology of computing the baryon EDM on a lattice. The associated correction substantially reduces presently existing lattice values for the proton and neutron theta-induced EDMs, so that even the most precise previous lattice results become consistent with zero. On one hand, this change removes previous disagreements between these lattice results and the phenomenological estimates of the nucleon EDM. On the other hand, the nucleon EDM becomes much harder to compute on a lattice. In addition, I will review the progress in computing quark chromo-EDM-induced nucleon EDM using chiral quark action.

  9. Heavy water critical experiments on plutonium lattice

    International Nuclear Information System (INIS)

    Miyawaki, Yoshio; Shiba, Kiminori

    1975-06-01

    This report is the summary of physics study on plutonium lattice made in Heavy Water Critical Experiment Section of PNC. By using Deuterium Critical Assembly, physics study on plutonium lattice has been carried out since 1972. Experiments on following items were performed in a core having 22.5 cm square lattice pitch. (1) Material buckling (2) Lattice parameters (3) Local power distribution factor (4) Gross flux distribution in two region core (5) Control rod worth. Experimental results were compared with theoretical ones calculated by METHUSELAH II code. It is concluded from this study that calculation by METHUSELAH II code has acceptable accuracy in the prediction on plutonium lattice. (author)

  10. Computing nucleon EDM on a lattice

    Energy Technology Data Exchange (ETDEWEB)

    Abramczyk, Michael; Izubuchi, Taku

    2017-06-18

    I will discuss briefly recent changes in the methodology of computing the baryon EDM on a lattice. The associated correction substantially reduces presently existing lattice values for the proton and neutron theta-induced EDMs, so that even the most precise previous lattice results become consistent with zero. On one hand, this change removes previous disagreements between these lattice results and the phenomenological estimates of the nucleon EDM. On the other hand, the nucleon EDM becomes much harder to compute on a lattice. In addition, I will review the progress in computing quark chromo-EDM-induced nucleon EDM using chiral quark action.

  11. Aliasing modes in the lattice Schwinger model

    International Nuclear Information System (INIS)

    Campos, Rafael G.; Tututi, Eduardo S.

    2007-01-01

    We study the Schwinger model on a lattice consisting of zeros of the Hermite polynomials that incorporates a lattice derivative and a discrete Fourier transform with many properties. Such a lattice produces a Klein-Gordon equation for the boson field and the exact value of the mass in the asymptotic limit if the boundaries are not taken into account. On the contrary, if the lattice is considered with boundaries new modes appear due to aliasing effects. In the continuum limit, however, this lattice yields also a Klein-Gordon equation with a reduced mass

  12. Path integration in conical space

    International Nuclear Information System (INIS)

    Inomata, Akira; Junker, Georg

    2012-01-01

    Quantum mechanics in conical space is studied by the path integral method. It is shown that the curvature effect gives rise to an effective potential in the radial path integral. It is further shown that the radial path integral in conical space can be reduced to a form identical with that in flat space when the discrete angular momentum of each partial wave is replaced by a specific non-integral angular momentum. The effective potential is found proportional to the squared mean curvature of the conical surface embedded in Euclidean space. The path integral calculation is compatible with the Schrödinger equation modified with the Gaussian and the mean curvature. -- Highlights: ► We study quantum mechanics on a cone by the path integral approach. ► The path integral depends only on the metric and the curvature effect is built in. ► The approach is consistent with the Schrödinger equation modified by an effective potential. ► The effective potential is found to be of the “Jensen–Koppe” and “da Costa” type.

  13. Path integrals on curved manifolds

    International Nuclear Information System (INIS)

    Grosche, C.; Steiner, F.

    1987-01-01

    A general framework for treating path integrals on curved manifolds is presented. We also show how to perform general coordinate and space-time transformations in path integrals. The main result is that one has to subtract a quantum correction ΔV ∝ ℎ 2 from the classical Lagrangian L, i.e. the correct effective Lagrangian to be used in the path integral is L eff = L-ΔV. A general prescription for calculating the quantum correction ΔV is given. It is based on a canonical approach using Weyl-ordering and the Hamiltonian path integral defined by the midpoint prescription. The general framework is illustrated by several examples: The d-dimensional rotator, i.e. the motion on the sphere S d-1 , the path integral in d-dimensional polar coordinates, the exact treatment of the hydrogen atom in R 2 and R 3 by performing a Kustaanheimo-Stiefel transformation, the Langer transformation and the path integral for the Morse potential. (orig.)

  14. Path-based Queries on Trajectory Data

    DEFF Research Database (Denmark)

    Krogh, Benjamin Bjerre; Pelekis, Nikos; Theodoridis, Yannis

    2014-01-01

    In traffic research, management, and planning a number of path-based analyses are heavily used, e.g., for computing turn-times, evaluating green waves, or studying traffic flow. These analyses require retrieving the trajectories that follow the full path being analyzed. Existing path queries cannot...... sufficiently support such path-based analyses because they retrieve all trajectories that touch any edge in the path. In this paper, we define and formalize the strict path query. This is a novel query type tailored to support path-based analysis, where trajectories must follow all edges in the path...... a specific path by only retrieving data from the first and last edge in the path. To correctly answer strict path queries existing network-constrained trajectory indexes must retrieve data from all edges in the path. An extensive performance study of NETTRA using a very large real-world trajectory data set...

  15. Scale setting in lattice QCD

    International Nuclear Information System (INIS)

    Sommer, Rainer

    2014-02-01

    The principles of scale setting in lattice QCD as well as the advantages and disadvantages of various commonly used scales are discussed. After listing criteria for good scales, I concentrate on the main presently used ones with an emphasis on scales derived from the Yang-Mills gradient flow. For these I discuss discretisation errors, statistical precision and mass effects. A short review on numerical results also brings me to an unpleasant disagreement which remains to be explained.

  16. Apiary B Factory lattice design

    International Nuclear Information System (INIS)

    Donald, M.H.R.; Garren, A.A.

    1991-04-01

    The Apiary B Factory is a proposed high-intensity electron-positron collider. This paper will present the lattice design for this facility, which envisions two rings with unequal energies in the PEP tunnel. The design has many interesting optical and geometrical features due to the needs to conform to the existing tunnel, and to achieve the necessary emittances, damping times and vacuum. Existing hardware is used to a maximum extent. 8 figs. 1 tab

  17. BROOKHAVEN: Lattice gauge theory symposium

    Energy Technology Data Exchange (ETDEWEB)

    Anon.

    1986-12-15

    Originally introduced by Kenneth Wilson in the early 70s, the lattice formulation of a quantum gauge theory became a hot topic of investigation after Mike Creutz, Laurence Jacobs and Claudio Rebbi demonstrated in 1979 the feasibility of meaningful computer simulations. The initial enthusiasm led gradually to a mature research effort, with continual attempts to improve upon previous results, to develop better computational techniques and to find new domains of application.

  18. Harmonic Lattice Dynamics of Germanium

    Energy Technology Data Exchange (ETDEWEB)

    Nelin, G

    1974-07-01

    The phonon dispersion relations of the DELTA-, LAMBDA-, and SIGMA-directions of germanium at 80 K are analysed in terms of current harmonic lattice dynamical models. On the basis of this experience, a new model is proposed which gives a unified account of the strong points of the previous models. The principal elements of the presented theory are quasiparticle bond charges combined with a valence force field.

  19. Screening in graphene antidot lattices

    DEFF Research Database (Denmark)

    Schultz, Marco Haller; Jauho, A. P.; Pedersen, T. G.

    2011-01-01

    We compute the dynamical polarization function for a graphene antidot lattice in the random-phase approximation. The computed polarization functions display a much more complicated structure than what is found for pristine graphene (even when evaluated beyond the Dirac-cone approximation...... the plasmon dispersion law and find an approximate square-root dependence with a suppressed plasmon frequency as compared to doped graphene. The plasmon dispersion is nearly isotropic and the developed approximation schemes agree well with the full calculation....

  20. Symplectic maps for accelerator lattices

    International Nuclear Information System (INIS)

    Warnock, R.L.; Ruth, R.; Gabella, W.

    1988-05-01

    We describe a method for numerical construction of a symplectic map for particle propagation in a general accelerator lattice. The generating function of the map is obtained by integrating the Hamilton-Jacobi equation as an initial-value problem on a finite time interval. Given the generating function, the map is put in explicit form by means of a Fourier inversion technique. We give an example which suggests that the method has promise. 9 refs., 9 figs

  1. Harmonic Lattice Dynamics of Germanium

    International Nuclear Information System (INIS)

    Nelin, G.

    1974-01-01

    The phonon dispersion relations of the Δ-, Λ-, and Σ-directions of germanium at 80 K are analysed in terms of current harmonic lattice dynamical models. On the basis of this experience, a new model is proposed which gives a unified account of the strong points of the previous models. The principal elements of the presented theory are quasiparticle bond charges combined with a valence force field

  2. Scale setting in lattice QCD

    Energy Technology Data Exchange (ETDEWEB)

    Sommer, Rainer [DESY, Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC

    2014-02-15

    The principles of scale setting in lattice QCD as well as the advantages and disadvantages of various commonly used scales are discussed. After listing criteria for good scales, I concentrate on the main presently used ones with an emphasis on scales derived from the Yang-Mills gradient flow. For these I discuss discretisation errors, statistical precision and mass effects. A short review on numerical results also brings me to an unpleasant disagreement which remains to be explained.

  3. Wave transmission in nonlinear lattices

    International Nuclear Information System (INIS)

    Hennig, D.; Tsironis, G.P.

    1999-01-01

    The interplay of nonlinearity with lattice discreteness leads to phenomena and propagation properties quite distinct from those appearing in continuous nonlinear systems. For a large variety of condensed matter and optics applications the continuous wave approximation is not appropriate. In the present review we discuss wave transmission properties in one dimensional nonlinear lattices. Our paradigmatic equations are discrete nonlinear Schroedinger equations and their study is done through a dynamical systems approach. We focus on stationary wave properties and utilize well known results from the theory of dynamical systems to investigate various aspects of wave transmission and wave localization. We analyze in detail the more general dynamical system corresponding to the equation that interpolates between the non-integrable discrete nonlinear Schroedinger equation and the integrable Albowitz-Ladik equation. We utilize this analysis in a nonlinear Kronig-Penney model and investigate transmission and band modification properties. We discuss the modifications that are effected through an electric field and the nonlinear Wannier-Stark localization effects that are induced. Several applications are described, such as polarons in one dimensional lattices, semiconductor superlattices and one dimensional nonlinear photonic band gap systems. (Copyright (c) 1999 Elsevier Science B.V., Amsterdam. All rights reserved.)

  4. Spin lattices of walking droplets

    Science.gov (United States)

    Saenz, Pedro; Pucci, Giuseppe; Goujon, Alexis; Dunkel, Jorn; Bush, John

    2017-11-01

    We present the results of an experimental investigation of the spontaneous emergence of collective behavior in spin lattice of droplets walking on a vibrating fluid bath. The bottom topography consists of relatively deep circular wells that encourage the walking droplets to follow circular trajectories centered at the lattice sites, in one direction or the other. Wave-mediated interactions between neighboring drops are enabled through a thin fluid layer between the wells. The sense of rotation of the walking droplets may thus become globally coupled. When the coupling is sufficiently strong, interactions with neighboring droplets may result in switches in spin that lead to preferred global arrangements, including correlated (all drops rotating in the same direction) or anti-correlated (neighboring drops rotating in opposite directions) states. Analogies with ferromagnetism and anti-ferromagnetism are drawn. Different spatial arrangements are presented in 1D and 2D lattices to illustrate the effects of topological frustration. This work was supported by the US National Science Foundation through Grants CMMI-1333242 and DMS-1614043.

  5. Calculational methods for lattice cells

    International Nuclear Information System (INIS)

    Askew, J.R.

    1980-01-01

    At the current stage of development, direct simulation of all the processes involved in the reactor to the degree of accuracy required is not an economic proposition, and this is achieved by progressive synthesis of models for parts of the full space/angle/energy neutron behaviour. The split between reactor and lattice calculations is one such simplification. Most reactors are constructed of repetitions of similar geometric units, the fuel elements, having broadly similar properties. Thus the provision of detailed predictions of their behaviour is an important step towards overall modelling. We shall be dealing with these lattice methods in this series of lectures, but will refer back from time to time to their relationship with overall reactor calculation The lattice cell is itself composed of somewhat similar sub-units, the fuel pins, and will itself often rely upon a further break down of modelling. Construction of a good model depends upon the identification, on physical and mathematical grounds, of the most helpful division of the calculation at this level

  6. The effects of one-dimensional migration of self-interstitial clusters on the formation of void lattices

    DEFF Research Database (Denmark)

    Heinisch, H.L.; Singh, B.N.

    2002-01-01

    under pure 3-D SIA migration, but they are extremely stable, relative to random arrays of voids, under 1-D SIA migration. Void lattices remain stable even under the condition of fairly frequent changes in the Burgers vectors of the 1-D migrating SIA clusters. Clusters with average 1-D path segments...

  7. Maximal Fermi walk configurations on the directed square lattice and standard Young tableaux

    International Nuclear Information System (INIS)

    Arrowsmith, D K; Bhatti, F M; Essam, J W

    2010-01-01

    We consider configurations of n walkers each of which starts at the origin of a directed square lattice and makes the same number t of steps from node to node along the edges of the lattice. Bose walkers are not allowed to cross, but can share edges. Fermi walk configurations must satisfy the additional constraint that no two walkers traverse the same path. Since, for given t, there are only a finite number of t-step paths, there is a limit n max on the number of walkers allowed by the Fermi condition. The value of n max is determined for six types of boundary conditions. The number of Fermi configurations of n max walkers is also determined using a bijection to standard Young tableaux. In four cases there is no constraint on the endpoints of the walks and the relevant tableaux are shifted.

  8. Measurements of isocenter path characteristics of the gantry rotation axis with a smartphone application

    International Nuclear Information System (INIS)

    Schiefer, H.; Peters, S.; Plasswilm, L.; Ingulfsen, N.; Kluckert, J.

    2015-01-01

    Purpose: For stereotactic radiosurgery, the AAPM Report No. 54 [AAPM Task Group 42 (AAPM, 1995)] requires the overall stability of the isocenter (couch, gantry, and collimator) to be within a 1 mm radius. In reality, a rotating system has no rigid axis and thus no isocenter point which is fixed in space. As a consequence, the isocenter concept is reviewed here. It is the aim to develop a measurement method following the revised definitions. Methods: The mechanical isocenter is defined here by the point which rotates on the shortest path in the room coordinate system. The path is labeled as “isocenter path.” Its center of gravity is assumed to be the mechanical isocenter. Following this definition, an image-based and radiation-free measurement method was developed. Multiple marker pairs in a plane perpendicular to the assumed gantry rotation axis of a linear accelerator are imaged with a smartphone application from several rotation angles. Each marker pair represents an independent measuring system. The room coordinates of the isocenter path and the mechanical isocenter are calculated based on the marker coordinates. The presented measurement method is by this means strictly focused on the mechanical isocenter. Results: The measurement result is available virtually immediately following completion of measurement. When 12 independent measurement systems are evaluated, the standard deviations of the isocenter path points and mechanical isocenter coordinates are 0.02 and 0.002 mm, respectively. Conclusions: The measurement is highly accurate, time efficient, and simple to adapt. It is therefore suitable for regular checks of the mechanical isocenter characteristics of the gantry and collimator rotation axis. When the isocenter path is reproducible and its extent is in the range of the needed geometrical accuracy, it should be taken into account in the planning process. This is especially true for stereotactic treatments and radiosurgery

  9. Measurements of isocenter path characteristics of the gantry rotation axis with a smartphone application

    Energy Technology Data Exchange (ETDEWEB)

    Schiefer, H., E-mail: johann.schiefer@kssg.ch; Peters, S.; Plasswilm, L. [Klinik für Radio-Onkologie, Kantonsspital St.Gallen, Rorschacherstrasse 107, St.Gallen CH-9007 (Switzerland); Ingulfsen, N.; Kluckert, J. [Kantonsschule am Burggraben St.Gallen, Burggraben 21, St.Gallen CH-9000 (Switzerland)

    2015-03-15

    Purpose: For stereotactic radiosurgery, the AAPM Report No. 54 [AAPM Task Group 42 (AAPM, 1995)] requires the overall stability of the isocenter (couch, gantry, and collimator) to be within a 1 mm radius. In reality, a rotating system has no rigid axis and thus no isocenter point which is fixed in space. As a consequence, the isocenter concept is reviewed here. It is the aim to develop a measurement method following the revised definitions. Methods: The mechanical isocenter is defined here by the point which rotates on the shortest path in the room coordinate system. The path is labeled as “isocenter path.” Its center of gravity is assumed to be the mechanical isocenter. Following this definition, an image-based and radiation-free measurement method was developed. Multiple marker pairs in a plane perpendicular to the assumed gantry rotation axis of a linear accelerator are imaged with a smartphone application from several rotation angles. Each marker pair represents an independent measuring system. The room coordinates of the isocenter path and the mechanical isocenter are calculated based on the marker coordinates. The presented measurement method is by this means strictly focused on the mechanical isocenter. Results: The measurement result is available virtually immediately following completion of measurement. When 12 independent measurement systems are evaluated, the standard deviations of the isocenter path points and mechanical isocenter coordinates are 0.02 and 0.002 mm, respectively. Conclusions: The measurement is highly accurate, time efficient, and simple to adapt. It is therefore suitable for regular checks of the mechanical isocenter characteristics of the gantry and collimator rotation axis. When the isocenter path is reproducible and its extent is in the range of the needed geometrical accuracy, it should be taken into account in the planning process. This is especially true for stereotactic treatments and radiosurgery.

  10. Hamiltonian and potentials in derivative pricing models: exact results and lattice simulations

    Science.gov (United States)

    Baaquie, Belal E.; Corianò, Claudio; Srikant, Marakani

    2004-03-01

    The pricing of options, warrants and other derivative securities is one of the great success of financial economics. These financial products can be modeled and simulated using quantum mechanical instruments based on a Hamiltonian formulation. We show here some applications of these methods for various potentials, which we have simulated via lattice Langevin and Monte Carlo algorithms, to the pricing of options. We focus on barrier or path dependent options, showing in some detail the computational strategies involved.

  11. Dependence of calculated void reactivity on film boiling representation in a CANDU lattice

    Energy Technology Data Exchange (ETDEWEB)

    Whitlock, J [McMaster Univ., Hamilton, ON (Canada). Dept. of Engineering Physics

    1994-12-31

    The distribution dependence of void reactivity in a CANDU (CANada Deuterium Uranium) lattice is studied, specifically in the regime of film boiling. A heterogeneous model of this phenomenon predicts a 4% increase in void reactivity over a homogeneous model for fresh fuel, and 11% at discharge. An explanation for this difference is offered, with regard to differing changes in neutron mean free path upon voiding. (author). 9 refs., 4 tabs., 6 figs.

  12. Distribution of the minimum path on percolation clusters: A renormalization group calculation

    International Nuclear Information System (INIS)

    Hipsh, Lior.

    1993-06-01

    This thesis uses the renormalization group for the research of the chemical distance or the minimal path on percolation clusters on a 2 dimensional square lattice. Our aims are to calculate analytically (iterative calculation) the fractal dimension of the minimal path. d min. , and the distributions of the minimum paths, l min for different lattice sizes and for different starting densities (including the threshold value p c ). For the distributions. We seek for an analytic form which describes them. The probability to get a minimum path for each linear size L is calculated by iterating the distribution of l min for the basic cell of size 2*2 to the next scale sizes, using the H cell renormalization group. For the threshold value of p and for values near to p c . We confirm a scaling in the form: P(l,L) =f1/l(l/(L d min ). L - the linear size, l - the minimum path. The distribution can be also represented in the Fourier space, so we will try to solve the renormalization group equations in this space. A numerical fitting is produced and compared to existing numerical results. In order to improve the agreement between the renormalization group and the numerical simulations, we also present attempts to generalize the renormalization group by adding more parameters, e.g. correlations between bonds in different directions or finite densities for occupation of bonds and sites. (author) 17 refs

  13. Path integration on hyperbolic spaces

    Energy Technology Data Exchange (ETDEWEB)

    Grosche, C [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik

    1991-11-01

    Quantum mechanics on the hyperbolic spaces of rank one is discussed by path integration technique. Hyperbolic spaces are multi-dimensional generalisation of the hyperbolic plane, i.e. the Poincare upper half-plane endowed with a hyperbolic geometry. We evalute the path integral on S{sub 1} {approx equal} SO (n,1)/SO(n) and S{sub 2} {approx equal} SU(n,1)/S(U(1) x U(n)) in a particular coordinate system, yielding explicitly the wave-functions and the energy spectrum. Futhermore we can exploit a general property of all these spaces, namely that they can be parametrized by a pseudopolar coordinate system. This allows a separation in path integration over spheres and an additional path integration over the remaining hyperbolic coordinate, yielding effectively a path integral for a modified Poeschl-Teller potential. Only continuous spectra can exist in all the cases. For all the hyperbolic spaces of rank one we find a general formula for the largest lower bound (zero-point energy) of the spectrum which is given by E{sub O} = h{sup 2} /8m(m{sub {alpha}} +2m{sub 2} {alpha}){sup 2} (m {alpha} and m{sub 2}{alpha} denote the dimension of the root subspace corresponding to the roots {alpha} and 2{alpha}, respectively). I also discuss the case, where a constant magnetic field on H{sup n} is incorporated. (orig.).

  14. Path integration on hyperbolic spaces

    International Nuclear Information System (INIS)

    Grosche, C.

    1991-11-01

    Quantum mechanics on the hyperbolic spaces of rank one is discussed by path integration technique. Hyperbolic spaces are multi-dimensional generalisation of the hyperbolic plane, i.e. the Poincare upper half-plane endowed with a hyperbolic geometry. We evalute the path integral on S 1 ≅ SO (n,1)/SO(n) and S 2 ≅ SU(n,1)/S[U(1) x U(n)] in a particular coordinate system, yielding explicitly the wave-functions and the energy spectrum. Futhermore we can exploit a general property of all these spaces, namely that they can be parametrized by a pseudopolar coordinate system. This allows a separation in path integration over spheres and an additional path integration over the remaining hyperbolic coordinate, yielding effectively a path integral for a modified Poeschl-Teller potential. Only continuous spectra can exist in all the cases. For all the hyperbolic spaces of rank one we find a general formula for the largest lower bound (zero-point energy) of the spectrum which is given by E O = h 2 /8m(m α +2m 2 α) 2 (m α and m 2 α denote the dimension of the root subspace corresponding to the roots α and 2α, respectively). I also discuss the case, where a constant magnetic field on H n is incorporated. (orig.)

  15. Definition of path integrals and rules for non-linear transformations

    International Nuclear Information System (INIS)

    Kerler, W.

    1978-01-01

    Functional integrals are defined as the limit of multidimensional integrals based on fundamental generating distributions. The 'lattice choice' is put into a suitable functional form. The independence of the particular choice and the necessity of this fact are shown. Various forms of the path integrals are derived and discussed. The relation to the traditional ordering problem is pointed out. The mechanism of non-linear transformations of variables is investigated and rules are given. In the case of fields it turns out that the path integrals can also be considered for space translations. (Auth.)

  16. Topological magnon bands in ferromagnetic star lattice

    International Nuclear Information System (INIS)

    Owerre, S A

    2017-01-01

    The experimental observation of topological magnon bands and thermal Hall effect in a kagomé lattice ferromagnet Cu(1–3, bdc) has inspired the search for topological magnon effects in various insulating ferromagnets that lack an inversion center allowing a Dzyaloshinskii–Moriya (DM) spin–orbit interaction. The star lattice (also known as the decorated honeycomb lattice) ferromagnet is an ideal candidate for this purpose because it is a variant of the kagomé lattice with additional links that connect the up-pointing and down-pointing triangles. This gives rise to twice the unit cell of the kagomé lattice, and hence more interesting topological magnon effects. In particular, the triangular bridges on the star lattice can be coupled either ferromagnetically or antiferromagnetically which is not possible on the kagomé lattice ferromagnets. Here, we study DM-induced topological magnon bands, chiral edge modes, and thermal magnon Hall effect on the star lattice ferromagnet in different parameter regimes. The star lattice can also be visualized as the parent material from which topological magnon bands can be realized for the kagomé and honeycomb lattices in some limiting cases. (paper)

  17. Topological magnon bands in ferromagnetic star lattice.

    Science.gov (United States)

    Owerre, S A

    2017-05-10

    The experimental observation of topological magnon bands and thermal Hall effect in a kagomé lattice ferromagnet Cu(1-3, bdc) has inspired the search for topological magnon effects in various insulating ferromagnets that lack an inversion center allowing a Dzyaloshinskii-Moriya (DM) spin-orbit interaction. The star lattice (also known as the decorated honeycomb lattice) ferromagnet is an ideal candidate for this purpose because it is a variant of the kagomé lattice with additional links that connect the up-pointing and down-pointing triangles. This gives rise to twice the unit cell of the kagomé lattice, and hence more interesting topological magnon effects. In particular, the triangular bridges on the star lattice can be coupled either ferromagnetically or antiferromagnetically which is not possible on the kagomé lattice ferromagnets. Here, we study DM-induced topological magnon bands, chiral edge modes, and thermal magnon Hall effect on the star lattice ferromagnet in different parameter regimes. The star lattice can also be visualized as the parent material from which topological magnon bands can be realized for the kagomé and honeycomb lattices in some limiting cases.

  18. Lattice dynamics and lattice thermal conductivity of thorium dicarbide

    Energy Technology Data Exchange (ETDEWEB)

    Liao, Zongmeng [Institute of Theoretical Physics and Department of Physics, East China Normal University, Shanghai 200241 (China); Huai, Ping, E-mail: huaiping@sinap.ac.cn [Shanghai Institute of Applied Physics, Chinese Academy of Sciences, Shanghai 201800 (China); Qiu, Wujie [Institute of Theoretical Physics and Department of Physics, East China Normal University, Shanghai 200241 (China); State Key Laboratory of High Performance Ceramics and Superfine Microstructure, Shanghai Institute of Ceramics, Chinese Academy of Sciences, Shanghai 200050 (China); Ke, Xuezhi, E-mail: xzke@phy.ecnu.edu.cn [Institute of Theoretical Physics and Department of Physics, East China Normal University, Shanghai 200241 (China); Zhang, Wenqing [State Key Laboratory of High Performance Ceramics and Superfine Microstructure, Shanghai Institute of Ceramics, Chinese Academy of Sciences, Shanghai 200050 (China); Zhu, Zhiyuan [Shanghai Institute of Applied Physics, Chinese Academy of Sciences, Shanghai 201800 (China)

    2014-11-15

    The elastic and thermodynamic properties of ThC{sub 2} with a monoclinic symmetry have been studied by means of density functional theory and direct force-constant method. The calculated properties including the thermal expansion, the heat capacity and the elastic constants are in a good agreement with experiment. Our results show that the vibrational property of the C{sub 2} dimer in ThC{sub 2} is similar to that of a free standing C{sub 2} dimer. This indicates that the C{sub 2} dimer in ThC{sub 2} is not strongly bonded to Th atoms. The lattice thermal conductivity for ThC{sub 2} was calculated by means of the Debye–Callaway model. As a comparison, the conductivity of ThC was also calculated. Our results show that the ThC and ThC{sub 2} contributions of the lattice thermal conductivity to the total conductivity are 29% and 17%, respectively.

  19. Nucleon deformation from lattice QCD

    International Nuclear Information System (INIS)

    Tsapalis, A.

    2008-01-01

    The issue of nucleon and Delta(1232) deformation is discussed through the evaluation of the N to Delta electromagnetic transition and Delta electromagnetic form factors in Lattice QCD. The momentum dependence of the form factors is studied using 2+1 staggered dynamical flavors at pion masses as low as 350 MeV and compared to results obtained in the Wilson quenched and two-flavor dynamical theory at similar pion masses. The measurement of small non-zero quadrupole amplitudes, in agreement to recent experiments, establishes the existence of deformation in the N and Delta states. (author)

  20. Nucleon Structure from Lattice QCD

    International Nuclear Information System (INIS)

    Zanotti, J. M.

    2011-01-01

    Lattice simulations of hadronic structure are now reaching a level where they are able to not only complement, but also provide guidance to current and forthcoming experimental programmes.By considering new simulations at low quark masses and on large volumes, we review the recent progress that has been made in this area by the QCDSF/UKQCD collaboration. In particular, results obtained close to the physical point for several quantities, including electromagnetic form factors and moments of parton distribution functions, show some indication of approaching their phenomenological values.

  1. GLAD: a generic lattice debugger

    International Nuclear Information System (INIS)

    Lee, M.J.

    1992-01-01

    Today, numerous simulation and analysis codes exist for the design, commission, and operation of accelerator beam lines. There is a need to develop a common user interface and database link to run these codes interactively. This paper will describe a proposed system, GLAD (Generic LAttice Debugger), to fulfill this need. Specifically, GLAD can be used to find errors in beam lines during commissioning, control beam parameters during operation, and design beam line optics and error correction systems for the next generation of linear accelerators and storage rings. (author)

  2. Lattice dynamics of ionic crystals

    International Nuclear Information System (INIS)

    Mahan, G.D.

    1990-01-01

    The theory of lattice dynamics for ionic and rare-gas crystals is derived in the harmonic approximation. We start from a Hamiltonian and average over electron coordinates in order to obtain an effective interaction between ion displacements. We assume that electronic excitations are localized on a single ion, which limits the theory to ionic crystals. The deformation-dipole model and the indirect-ionic-interaction model are derived. These two contributions are closely linked, and together provide an accurate description of short-range forces

  3. Degeneración Lattice

    OpenAIRE

    Rojas Bocanegra, Alberto

    2004-01-01

    Objetivo: Determinar la prevalencia de degeneración periférica de retina Lattice y su relación con estados refractivos y rupturas retinales. Metodología: Estudio de corte transversal con exploración de asociación, mediante análisis de casos y controles. Se examinaron 680 ojos en el Instituto de Investigaciones Optométricas e Instituto de Córnea. El estado refractivo se determinó mediante técnica estática y el estado retinal mediante oftalmoscopia indirecta con indentación escleral. Resultados...

  4. Lattice degeneration of the retina.

    Science.gov (United States)

    Byer, N E

    1979-01-01

    Lattice degeneration of the retina is the most important of all clinically distinct entities that effect the peripheral fundus and are related to retinal detachment. The purpose of this review is to survey the extensive literature, to evaluate the many diverse opinions on this subject, and to correlate and summarize all the known facts regarding this disease entity. The disease is fully defined and described, both clinically and histologically. Some aspects of the disease are still poorly understood, and some remain controversial, especially in the area of management. For this reason, the indications for treatment are discussed under eight subsections, with a view toward providing practical guidelines for recommendations in management.

  5. The lattice dynamics of imidazole

    International Nuclear Information System (INIS)

    Link, K.H.

    1983-05-01

    The lattice dynamics of imidazole have been investigated. To this end dispersion curves have been determined at 10 K by inelastic coherent neutron scattering. RAMAN measurements have been done to investigate identical gamma - point modes. The combination of extinction rules for RAMAN - and neutron scattering leads to the symmetry assignment of identical gamma - point modes. The experiment yields a force constant of the streching vibration of the hydrogen bond of 0.33 mdyn/A. A force model has been developed to describe the intermolecular atom - atom Interactions in imidazole. (orig./BHO)

  6. Path Integrals in Quantum Mechanics

    International Nuclear Information System (INIS)

    Louko, J

    2005-01-01

    Jean Zinn-Justin's textbook Path Integrals in Quantum Mechanics aims to familiarize the reader with the path integral as a calculational tool in quantum mechanics and field theory. The emphasis is on quantum statistical mechanics, starting with the partition function Tr exp(-β H) and proceeding through the diffusion equation to barrier penetration problems and their semiclassical limit. The 'real time' path integral is defined via analytic continuation and used for the path-integral representation of the nonrelativistic S-matrix and its perturbative expansion. Holomorphic and Grassmannian path integrals are introduced and applied to nonrelativistic quantum field theory. There is also a brief discussion of path integrals in phase space. The introduction includes a brief historical review of path integrals, supported by a bibliography with some 40 entries. As emphasized in the introduction, mathematical rigour is not a central issue in the book. This allows the text to present the calculational techniques in a very readable manner: much of the text consists of worked-out examples, such as the quartic anharmonic oscillator in the barrier penetration chapter. At the end of each chapter there are exercises, some of which are of elementary coursework type, but the majority are more in the style of extended examples. Most of the exercises indeed include the solution or a sketch thereof. The book assumes minimal previous knowledge of quantum mechanics, and some basic quantum mechanical notation is collected in an appendix. The material has a large overlap with selected chapters in the author's thousand-page textbook Quantum Field Theory and Critical Phenomena (2002 Oxford: Clarendon). The stand-alone scope of the present work has, however, allowed a more focussed organization of this material, especially in the chapters on, respectively, holomorphic and Grassmannian path integrals. In my view the book accomplishes its aim admirably and is eminently usable as a textbook

  7. From path integrals to anyons

    International Nuclear Information System (INIS)

    Canright, G.S.

    1992-01-01

    I offer a pedagogical review of the homotopy arguments for fractional statistics in two dimensions. These arguments arise naturally in path-integral language since they necessarily consider the properties of paths rather than simply permutations. The braid group replaces the permutation group as the basic structure for quantum statistics; hence properties of the braid group on several surfaces are briefly discussed. Finally, the question of multiple (real-space) occupancy is addressed; I suggest that the ''traditional'' treatment of this question (ie, an assumption that many-anyon wavefunctions necessarily vanish for multiple occupancy) needs reexamination

  8. Isomorphisms and traversability of directed path graphs

    NARCIS (Netherlands)

    Broersma, Haitze J.; Li, Xueliang; Li, X.

    1998-01-01

    The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\\forw P_k(D)$ of a digraph $D$ is obtained by representing the directed paths on $k$ vertices of $D$ by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in $D$

  9. Working Group Report: Lattice Field Theory

    Energy Technology Data Exchange (ETDEWEB)

    Blum, T.; et al.,

    2013-10-22

    This is the report of the Computing Frontier working group on Lattice Field Theory prepared for the proceedings of the 2013 Community Summer Study ("Snowmass"). We present the future computing needs and plans of the U.S. lattice gauge theory community and argue that continued support of the U.S. (and worldwide) lattice-QCD effort is essential to fully capitalize on the enormous investment in the high-energy physics experimental program. We first summarize the dramatic progress of numerical lattice-QCD simulations in the past decade, with some emphasis on calculations carried out under the auspices of the U.S. Lattice-QCD Collaboration, and describe a broad program of lattice-QCD calculations that will be relevant for future experiments at the intensity and energy frontiers. We then present details of the computational hardware and software resources needed to undertake these calculations.

  10. Quantum Mechanics, Path Integrals and Option Pricing: Reducing the Complexity of Finance

    OpenAIRE

    Baaquie, Belal E.; Coriano, Claudio; Srikant, Marakani

    2002-01-01

    Quantum Finance represents the synthesis of the techniques of quantum theory (quantum mechanics and quantum field theory) to theoretical and applied finance. After a brief overview of the connection between these fields, we illustrate some of the methods of lattice simulations of path integrals for the pricing of options. The ideas are sketched out for simple models, such as the Black-Scholes model, where analytical and numerical results are compared. Application of the method to nonlinear sy...

  11. Lattice vibrations in α-boron

    International Nuclear Information System (INIS)

    Richter, W.

    1976-01-01

    α-rhombohedral boron is the simplest boron modification, with only 12 atoms per unit cell. The boron atoms are arranged in B 12 icosahedra, which are centered at the lattice points of a primitive rhombohedral lattice. The icosahedra are slightly deformed, as the five-fold symmetry of the ideal icosahedron is incompatible with any crystal structure. The lattice dynamics of α-boron are discussed in terms of the model developed by Weber and Thorpe. (Auth.)

  12. Experimental generation of optical coherence lattices

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Yahong; Cai, Yangjian, E-mail: serpo@dal.ca, E-mail: yangjiancai@suda.edu.cn [College of Physics, Optoelectronics and Energy and Collaborative Innovation Center of Suzhou Nano Science and Technology, Soochow University, Suzhou 215006 (China); Key Lab of Advanced Optical Manufacturing Technologies of Jiangsu Province and Key Lab of Modern Optical Technologies of Education Ministry of China, Soochow University, Suzhou 215006 (China); Ponomarenko, Sergey A., E-mail: serpo@dal.ca, E-mail: yangjiancai@suda.edu.cn [Department of Electrical and Computer Engineering, Dalhousie University, Halifax, Nova Scotia B3J 2X4 (Canada)

    2016-08-08

    We report experimental generation and measurement of recently introduced optical coherence lattices. The presented optical coherence lattice realization technique hinges on a superposition of mutually uncorrelated partially coherent Schell-model beams with tailored coherence properties. We show theoretically that information can be encoded into and, in principle, recovered from the lattice degree of coherence. Our results can find applications to image transmission and optical encryption.

  13. Regularizing Feynman path integrals using the generalized Kontsevich-Vishik trace

    Science.gov (United States)

    Hartung, Tobias

    2017-12-01

    A fully regulated definition of Feynman's path integral is presented here. The proposed re-formulation of the path integral coincides with the familiar formulation whenever the path integral is well defined. In particular, it is consistent with respect to lattice formulations and Wick rotations, i.e., it can be used in Euclidean and Minkowski space-time. The path integral regularization is introduced through the generalized Kontsevich-Vishik trace, that is, the extension of the classical trace to Fourier integral operators. Physically, we are replacing the time-evolution semi-group by a holomorphic family of operators such that the corresponding path integrals are well defined in some half space of C . The regularized path integral is, thus, defined through analytic continuation. This regularization can be performed by means of stationary phase approximation or computed analytically depending only on the Hamiltonian and the observable (i.e., known a priori). In either case, the computational effort to evaluate path integrals or expectations of observables reduces to the evaluation of integrals over spheres. Furthermore, computations can be performed directly in the continuum and applications (analytic computations and their implementations) to a number of models including the non-trivial cases of the massive Schwinger model and a φ4 theory.

  14. Introduction to Vortex Lattice Theory

    Directory of Open Access Journals (Sweden)

    Santiago Pinzón

    2015-10-01

    Full Text Available Panel methods have been widely used in industry and are well established since the 1970s for aerodynamic analysis and computation. The Vortex Lattice Panel Method presented in this study comes across a sophisticated method that provides a quick solution time, allows rapid changes in geometry and suits well for aerodynamic analysis. The aerospace industry is highly competitive in design efficiency, and perhaps one of the most important factors on airplane design and engineering today is multidisciplinary optimization.  Any cost reduction method in the design cycle of a product becomes vital in the success of its outcome. The subsequent sections of this article will further explain in depth the theory behind the vortex lattice method, and the reason behind its selection as the method for aerodynamic analysis during preliminary design work and computation within the aerospace industry. This article is analytic in nature, and its main objective is to present a mathematical summary of this widely used computational method in aerodynamics.

  15. Coherent lattice vibrations in superconductors

    International Nuclear Information System (INIS)

    Kadin, Alan M.

    2008-01-01

    A recent analysis has shown that the pair wavefunction within the BCS theory may be represented in real-space as a spherical electronic orbital (on the scale of the coherence length ξ 0 ) coupled to a standing-wave lattice vibration with wavevector 2k F and a near-resonant phonon frequency. The present paper extends this picture to a coherent pattern of phonon standing-waves on the macroscopic scale, with electrons forming Bloch waves and an energy gap much like those in the classic band theory of crystals. These parallel planes form a diffractive waveguide permitting electron waves to traveling parallel to the planes, corresponding to lossless supercurrent. A similar picture may be extended to unconventional superconductors such as the cuprates, with an array of standing spin waves rather than phonons. Such coherent lattice vibrations should be universal indicators of the superconducting state, and should be observable below T c using X-ray and neutron diffraction techniques. Further implications of this picture are discussed

  16. Lattice dynamics in solid oxygen

    International Nuclear Information System (INIS)

    Kobashi, K.; Klein, M.L.; Chandrasekharan, V.

    1979-01-01

    Lattice dynamical calculations for the bulk α, β, and γ phases of solid O 2 and for the monolayer α and β phases have been made in the harmonic approximation. In the α and β phases, atom-atom 6-12 potentials are employed. In the γ phase, effective potentials are used between molecular centers and only the translational lattice vibrations are calculated. It is found that Laufer and Leroi's potential parameters give two k=O frequencies at 42.7 and 43.6 cm -1 in the bulk α-O 2 , and at 40.7 cm -1 for the degenerate k=0 modes in the β phase. The observed Raman lines for α-O 2 at 43 and 79 cm -1 , which are both known to exhibit isotope shifts, are thus tentatively assigned to an accidentally degenerate line and a two-phonon band, respectively, In view of the possible contribution from anharmonic effects, the agreement of the calculation with experiment (48-51 cm -1 ) in β-O 2 may be better than it seems. For the bulk γ-O 2 , a discrepancy is observed between the calculated elastic constants and those derived from Brillouin scattering experiments. This discrepancy may be due to the neglect of translation-rotation coupling. In the monolayer O 2 , Raman active modes at 28.3 and 40.6 cm -1 for the α phase, and 31.9 cm -1 for the β phase are predicted

  17. Polarization response of RHIC electron lens lattices

    International Nuclear Information System (INIS)

    Ranjbar, V. H.; Méot, F.; Bai, M.; Abell, D. T.; Meiser, D.

    2016-01-01

    Depolarization response for a system of two orthogonal snakes at irrational tunes is studied in depth using lattice independent spin integration. Particularly, we consider the effect of overlapping spin resonances in this system, to understand the impact of phase, tune, relative location and threshold strengths of the spin resonances. Furthermore, these results are benchmarked and compared to two dimensional direct tracking results for the RHIC e-lens lattice and the standard lattice. We then consider the effect of longitudinal motion via chromatic scans using direct six dimensional lattice tracking.

  18. Advancements in simulations of lattice quantum chromodynamics

    International Nuclear Information System (INIS)

    Lippert, T.

    2008-01-01

    An introduction to lattice QCD with emphasis on advanced fermion formulations and their simulation is given. In particular, overlap fermions will be presented, a quite novel fermionic discretization scheme that is able to exactly preserve chiral symmetry on the lattice. I will discuss efficiencies of state-of-the-art algorithms on highly scalable supercomputers and I will show that, due to many algorithmic improvements, overlap simulations will soon become feasible for realistic physical lattice sizes. Finally I am going to sketch the status of some current large scale lattice QCD simulations. (author)

  19. On diffeomorphism invariance for lattice theories

    International Nuclear Information System (INIS)

    Corichi, A.; Zapata, J.

    1997-01-01

    We consider the role of the diffeomorphism constraint in the quantization of lattice formulations of diffeomorphism invariant theories of connections. It has been argued that in working with abstract lattices one automatically takes care of the diffeomorphism constraint in the quantum theory. We use two systems in order to show that imposing the diffeomorphism constraint is imperative to obtain a physically acceptable quantum theory. First, we consider 2+1 gravity where an exact lattice formulation is available. Next, general theories of connections for compact gauge groups are treated, where the quantum theories are known - for both the continuum and the lattice - and can be compared. (orig.)

  20. Elastic lattice in an incommensurate background

    International Nuclear Information System (INIS)

    Dickman, R.; Chudnovsky, E.M.

    1995-01-01

    We study a harmonic triangular lattice, which relaxes in the presence of an incommensurate short-wavelength potential. Monte Carlo simulations reveal that the elastic lattice exhibits only short-ranged translational correlations, despite the absence of defects in either lattice. Extended orientational order, however, persists in the presence of the background. Translational correlation lengths exhibit approximate power-law dependence upon cooling rate and background strength. Our results may be relevant to Wigner crystals, atomic monolayers on crystals surfaces, and flux-line and magnetic bubble lattices

  1. Anomalous diffusion in a dynamical optical lattice

    Science.gov (United States)

    Zheng, Wei; Cooper, Nigel R.

    2018-02-01

    Motivated by experimental progress in strongly coupled atom-photon systems in optical cavities, we study theoretically the quantum dynamics of atoms coupled to a one-dimensional dynamical optical lattice. The dynamical lattice is chosen to have a period that is incommensurate with that of an underlying static lattice, leading to a dynamical version of the Aubry-André model which can cause localization of single-particle wave functions. We show that atomic wave packets in this dynamical lattice generically spread via anomalous diffusion, which can be tuned between superdiffusive and subdiffusive regimes. This anomalous diffusion arises from an interplay between Anderson localization and quantum fluctuations of the cavity field.

  2. Polarization response of RHIC electron lens lattices

    Directory of Open Access Journals (Sweden)

    V. H. Ranjbar

    2016-10-01

    Full Text Available Depolarization response for a system of two orthogonal snakes at irrational tunes is studied in depth using lattice independent spin integration. In particular we consider the effect of overlapping spin resonances in this system, to understand the impact of phase, tune, relative location and threshold strengths of the spin resonances. These results are benchmarked and compared to two dimensional direct tracking results for the RHIC e-lens lattice and the standard lattice. Finally we consider the effect of longitudinal motion via chromatic scans using direct six dimensional lattice tracking.

  3. Internal space decimation for lattice gauge theories

    International Nuclear Information System (INIS)

    Flyvbjerg, H.

    1984-01-01

    By a systematic decimation of internal space lattice gauge theories with continuous symmetry groups are mapped into effective lattice gauge theories with finite symmetry groups. The decimation of internal space makes a larger lattice tractable with the same computational resources. In this sense the method is an alternative to Wilson's and Symanzik's programs of improved actions. As an illustrative test of the method U(1) is decimated to Z(N) and the results compared with Monte Carlo data for Z(4)- and Z(5)-invariant lattice gauge theories. The result of decimating SU(3) to its 1080-element crystal-group-like subgroup is given and discussed. (orig.)

  4. Transmission Electron Microscope Measures Lattice Parameters

    Science.gov (United States)

    Pike, William T.

    1996-01-01

    Convergent-beam microdiffraction (CBM) in thermionic-emission transmission electron microscope (TEM) is technique for measuring lattice parameters of nanometer-sized specimens of crystalline materials. Lattice parameters determined by use of CBM accurate to within few parts in thousand. Technique developed especially for use in quantifying lattice parameters, and thus strains, in epitaxial mismatched-crystal-lattice multilayer structures in multiple-quantum-well and other advanced semiconductor electronic devices. Ability to determine strains in indivdual layers contributes to understanding of novel electronic behaviors of devices.

  5. Testing the holographic principle using lattice simulations

    Directory of Open Access Journals (Sweden)

    Jha Raghav G.

    2018-01-01

    Full Text Available The lattice studies of maximally supersymmetric Yang-Mills (MSYM theory at strong coupling and large N is important for verifying gauge/gravity duality. Due to the progress made in the last decade, based on ideas from topological twisting and orbifolding, it is now possible to study these theories on the lattice while preserving an exact supersymmetry on the lattice. We present some results from the lattice studies of two-dimensional MSYM which is related to Type II supergravity. Our results agree with the thermodynamics of different black hole phases on the gravity side and the phase transition (Gregory–Laflamme between them.

  6. Coupling effect of topological states and Chern insulators in two-dimensional triangular lattices

    Science.gov (United States)

    Zhang, Jiayong; Zhao, Bao; Xue, Yang; Zhou, Tong; Yang, Zhongqin

    2018-03-01

    We investigate topological states of two-dimensional (2D) triangular lattices with multiorbitals. Tight-binding model calculations of a 2D triangular lattice based on px and py orbitals exhibit very interesting doubly degenerate energy points at different positions (Γ and K /K' ) in momentum space, with quadratic non-Dirac and linear Dirac band dispersions, respectively. Counterintuitively, the system shows a global topologically trivial rather than nontrivial state with consideration of spin-orbit coupling due to the "destructive interference effect" between the topological states at the Γ and K /K' points. The topologically nontrivial state can emerge by introducing another set of triangular lattices to the system (bitriangular lattices) due to the breakdown of the interference effect. With first-principles calculations, we predict an intrinsic Chern insulating behavior (quantum anomalous Hall effect) in a family of the 2D triangular lattice metal-organic framework of Co(C21N3H15) (TPyB-Co) from this scheme. Our results provide a different path and theoretical guidance for the search for and design of new 2D topological quantum materials.

  7. Hadron physics from lattice QCD

    Energy Technology Data Exchange (ETDEWEB)

    Schaefer, Andreas [Regensburg Univ. (Germany). Inst. for Theoretical Physics

    2016-11-01

    Particle physics experiments at modern high luminosity particle accelerators achieve orders of magnitude higher count rates than what was possible ten or twenty years ago. This extremely large statistics allows to draw far reaching conclusions even from minute signals, provided that these signals are well understood by theory. This is, however, ever more difficult to achieve. Presently, technical and scientific progress in general and experimental progress in particle physics in particular, shows typically an exponential growth rate. For example, data acquisition and analysis are, among many other factor, driven by the development of ever more efficient computers and thus by Moore's law. Theory has to keep up with this development by also achieving an exponential increase in precision, which is only possible using powerful computers. This is true for both types of calculations, analytic ones as, e.g., in quantum field perturbation theory, and purely numerical ones as in Lattice QCD. As stated above such calculations are absolutely indispensable to make best use of the extremely costly large particle physics experiments. Thus, it is economically reasonable to invest a certain percentage of the cost of accelerators and experiments in related theory efforts. The basic ideas behind Lattice QCD simulations are the following: Because quarks and gluons can never be observed individually but are always ''confined'' into colorless hadrons, like the proton, all quark-gluon states can be expressed in two different systems of basis states, namely in a quark-gluon basis and the basis of hadron states. The proton, e.g., is an eigenstate of the latter, a specific quark-gluon configuration is part of the former. In the quark-gluon basis a physical hadron, like a proton, is given by an extremely complicated multi-particle wave function containing all effects of quantum fluctuations. This state is so complicated that it is basically impossible to model it

  8. Lattices for laymen: a non-specialist's introduction to lattice gauge theory

    International Nuclear Information System (INIS)

    Callaway, D.J.E.

    1985-01-01

    The review on lattice gauge theory is based upon a series of lectures given to the Materials Science and Technology Division at Argonne National Laboratory. Firstly the structure of gauge theories in the continuum is discussed. Then the lattice formulation of these theories is presented, including quantum electrodynamics and non-abelian lattice gauge theories. (U.K.)

  9. Continuum limit of QED2 on a lattice

    International Nuclear Information System (INIS)

    Weingarten, D.H.; Challifour, J.L.

    1979-01-01

    A path integral is defined for the vacuum expectation values of Euclidean QED 2 on a periodic lattice. Wilson's expression is used for the coupling between fermion and gauge fields. The action for the gauge field by itself is assumed to be a quadratic in place of Wilson's periodic action. The integral over the fermion field is carried out explicitly to obtain a Matthews--Salam formula for vacuum expectation values. For a combination of gauge and fermion fields G on a lattice with spacing proportional to N -+ , Nelement ofZ + , the Matthews--Salam formula for the vacuum expectation /sub N/ has the form /sub n/=∫ dμW/sub N/(G, f), where dμ is an N-independent measure on a random electromagnetic field f and W/sub N/(G,f) is an N-dependent function of f determined by G. For a class of G we prove that as N→infinity, W/sub N/(G,f) has a limit W (G,f) except possibly for a set of f of measure zero. In subsequent articles it will be shown that ∫ dμW (G,f) exists and lim/sub N/→infinity /sub N/ =∫ dμW

  10. Quantum Monte Carlo studies in Hamiltonian lattice gauge theory

    International Nuclear Information System (INIS)

    Hamer, C.J.; Samaras, M.; Bursill, R.J.

    2000-01-01

    Full text: The application of Monte Carlo methods to the 'Hamiltonian' formulation of lattice gauge theory has been somewhat neglected, and lags at least ten years behind the classical Monte Carlo simulations of Euclidean lattice gauge theory. We have applied a Green's Function Monte Carlo algorithm to lattice Yang-Mills theories in the Hamiltonian formulation, combined with a 'forward-walking' technique to estimate expectation values and correlation functions. In this approach, one represents the wave function in configuration space by a discrete ensemble of random walkers, and application of the time development operator is simulated by a diffusion and branching process. The approach has been used to estimate the ground-state energy and Wilson loop values in the U(1) theory in (2+1)D, and the SU(3) Yang-Mills theory in (3+1)D. The finite-size scaling behaviour has been explored, and agrees with the predictions of effective Lagrangian theory, and weak-coupling expansions. Crude estimates of the string tension are derived, which agree with previous results at intermediate couplings; but more accurate results for larger loops will be required to establish scaling behaviour at weak couplings. A drawback to this method is that it is necessary to introduce a 'trial' or 'guiding wave function' to guide the walkers towards the most probable regions of configuration space, in order to achieve convergence and accuracy. The 'forward-walking' estimates should be independent of this guidance, but in fact for the SU(3) case they turn out to be sensitive to the choice of trial wave function. It would be preferable to use some sort of Metropolis algorithm instead to produce a correct distribution of walkers: this may point in the direction of a Path Integral Monte Carlo approach

  11. Pion structure from lattice QCD

    Energy Technology Data Exchange (ETDEWEB)

    Javadi Motaghi, Narjes

    2015-05-12

    In this thesis we use lattice QCD to compute the second Mellin moments of pion generalized parton distributions and pion electromagnetic form factors. For our calculations we are able to analyze a large set of gauge configurations with 2 dynamical flavours using non-perturbatively the improved Wilson-Sheikholeslami-Wohlert fermionic action pion masses ranging down to 151 MeV. By employing improved smearing we were able to suppress excited state contamination. However, our data in the physical quark mass limit show that some excited state contamination remains. We show the non-zero sink momentum is optimal for the computation of the electromagnetic form factors and generalized form factors at finite momenta.

  12. Computer programs for lattice calculations

    International Nuclear Information System (INIS)

    Keil, E.; Reich, K.H.

    1984-01-01

    The aim of the workshop was to find out whether some standardisation could be achieved for future work in this field. A certain amount of useful information was unearthed, and desirable features of a ''standard'' program emerged. Progress is not expected to be breathtaking, although participants (practically from all interested US, Canadian and European accelerator laboratories) agreed that the mathematics of the existing programs is more or less the same. Apart from the NIH (not invented here) effect, there is a - to quite some extent understandable - tendency to stay with a program one knows and to add to it if unavoidable rather than to start using a new one. Users of the well supported program TRANSPORT (designed for beam line calculations) would prefer to have it fully extended for lattice calculations (to some extent already possible now), while SYNCH users wish to see that program provided with a user-friendly input, rather than spending time and effort for mastering a new program

  13. Monte Carlo lattice program KIM

    International Nuclear Information System (INIS)

    Cupini, E.; De Matteis, A.; Simonini, R.

    1980-01-01

    The Monte Carlo program KIM solves the steady-state linear neutron transport equation for a fixed-source problem or, by successive fixed-source runs, for the eigenvalue problem, in a two-dimensional thermal reactor lattice. Fluxes and reaction rates are the main quantities computed by the program, from which power distribution and few-group averaged cross sections are derived. The simulation ranges from 10 MeV to zero and includes anisotropic and inelastic scattering in the fast energy region, the epithermal Doppler broadening of the resonances of some nuclides, and the thermalization phenomenon by taking into account the thermal velocity distribution of some molecules. Besides the well known combinatorial geometry, the program allows complex configurations to be represented by a discrete set of points, an approach greatly improving calculation speed

  14. Particle states of lattice QCD

    Energy Technology Data Exchange (ETDEWEB)

    Kapoyannis, A.S.; Panagiotou, A.D. [University of Athens, Nuclear and Particle Physics Section, Faculty of Physics, Athens (Greece)

    2017-11-15

    We determine the degeneracy factor and the average particle mass of particles that produce the lattice QCD pressure and specific entropy at zero baryon chemical potential. The number of states of the gluons and the quarks are found to converge above T = 230 MeV to almost constant values, close to the number of states of an ideal quark-gluon phase, while their assigned masses retain high values. The number of states and the average mass of a system containing quarks in interaction with gluons are found to decrease steeply with increase of temperature between T ∝ 150 and 160 MeV, a region contained within the region of the chiral transition. The minimum value of the number of states within this temperature interval indicates that the states are of hadronic nature. (orig.)

  15. Fermion determinants in lattice QCD

    International Nuclear Information System (INIS)

    Johnson, Christopher Andrew

    2001-01-01

    The main topic of this thesis concerns efficient algorithms for the calculation of determinants of the kind of matrix typically encountered in lattice QCD. In particular an efficient method for calculating the fermion determinant is described. Such a calculation is useful to illustrate the effects of light dynamical (virtual) quarks. The methods employed in this thesis are stochastic methods, based on the Lanczos algorithm, which is used for the solution of large, sparse matrix problems via a partial tridiagonalisation of the matrix. Here an implementation is explored which requires less exhaustive treatment of the matrix than previous Lanczos methods. This technique exploits the analogy between the Lanczos tridiagonalisation algorithm and Gaussian quadrature in order to calculate the fermion determinant. A technique for determining a number of the eigenvalues of the matrix is also presented. A demonstration is then given of how one can improve upon this estimate considerably using variance reduction techniques, reducing the variance by a factor of order 100 with a further, equal amount of work. The variance reduction method is a two-stage process, involving a Chebyshev approximation to the quantity in question and then the subtraction of traceless operators. The method is applied to the fermion determinant for non-perturbatively improved Wilson fermions on a 16 3 x 32 lattice. It is also applicable to a wider class of matrix operators. Finally we discuss how dynamical quark effects may be simulated in a Monte Carlo process with an effective partitioning of low and high eigenmodes. This may be done via selective updating of a trial configuration which highlights the physically relevant effects of light quark modes. (author)

  16. An Application of Linear Algebra over Lattices

    Directory of Open Access Journals (Sweden)

    M. Hosseinyazdi

    2008-03-01

    Full Text Available In this paper, first we consider L n as a semimodule over a complete bounded distributive lattice L. Then we define the basic concepts of module theory for L n. After that, we proved many similar theorems in linear algebra for the space L n. An application of linear algebra over lattices for solving linear systems, was given

  17. An Application of Linear Algebra over Lattices

    OpenAIRE

    M. Hosseinyazdi

    2008-01-01

    In this paper, first we consider L n as a semimodule over a complete bounded distributive lattice L. Then we define the basic concepts of module theory for L n. After that, we proved many similar theorems in linear algebra for the space L n. An application of linear algebra over lattices for solving linear systems, was given

  18. Compact lattice QED with Wilson fermions

    International Nuclear Information System (INIS)

    Hoferichter, A.

    1994-08-01

    We study the phase structure and the chiral limit of 4d compact lattice QED with Wilson fermions (both dynamical and quenched). We use the standard Wilson gauge action and also a modified one suppressing lattice artifacts. Different techniques and observables to locate the chiral limit are discussed. (orig.)

  19. Chimera states in Gaussian coupled map lattices

    Science.gov (United States)

    Li, Xiao-Wen; Bi, Ran; Sun, Yue-Xiang; Zhang, Shuo; Song, Qian-Qian

    2018-04-01

    We study chimera states in one-dimensional and two-dimensional Gaussian coupled map lattices through simulations and experiments. Similar to the case of global coupling oscillators, individual lattices can be regarded as being controlled by a common mean field. A space-dependent order parameter is derived from a self-consistency condition in order to represent the collective state.

  20. Dark Solitons in FPU Lattice Chain

    Science.gov (United States)

    Wang, Deng-Long; Yang, Ru-Shu; Yang, You-Tian

    2007-11-01

    Based on multiple scales method, we study the nonlinear properties of a new Fermi-Pasta-Ulam lattice model analytically. It is found that the lattice chain exhibits a novel nonlinear elementary excitation, i.e. a dark soliton. Moreover, the modulation depth of dark soliton is increasing as the anharmonic parameter increases.

  1. Dark Solitons in FPU Lattice Chain

    International Nuclear Information System (INIS)

    Wang Denglong; Yang Youtian; Yang Rushu

    2007-01-01

    Based on multiple scales method, we study the nonlinear properties of a new Fermi-Pasta-Ulam lattice model analytically. It is found that the lattice chain exhibits a novel nonlinear elementary excitation, i.e. a dark soliton. Moreover, the modulation depth of dark soliton is increasing as the anharmonic parameter increases.

  2. Lattice-Valued Possibilistic Entropy Measure

    Czech Academy of Sciences Publication Activity Database

    Kramosil, Ivan

    2008-01-01

    Roč. 16, č. 6 (2008), s. 829-846 ISSN 0218-4885 R&D Projects: GA AV ČR IAA100300503 Institutional research plan: CEZ:AV0Z10300504 Keywords : complete lattice * lattice-valued possibilistic distribution * entropy measure * product of possibilistic distribution Subject RIV: BA - General Mathematics Impact factor: 1.000, year: 2008

  3. Unorthodox lattice fermion derivatives and their shortcomings

    International Nuclear Information System (INIS)

    Bodwin, G.T.; Kovacs, E.V.

    1987-01-01

    We discuss the DWY (Lagrangian), Quinn-Weinstein, and Rebbi proposals for incorporating fermions into lattice gauge theory and analyze them in the context of weak coupling perturbation theory. We find that none of these proposals leads to a completely satisfactory lattice transcription of fully-interacting gauge theory

  4. Gauge field theories on a || lattice

    International Nuclear Information System (INIS)

    Burkardt, Matthias

    1999-01-01

    In these notes, the transverse || lattice approach is presented as a means to control the k + →0 divergences in light-front QCD. Technical difficulties of both the canonical compact formulation as well as the non-compact formulation of the || lattice motivate the color-dielectric formulation, where the link fields are linearized

  5. Selective nanoscale growth of lattice mismatched materials

    Science.gov (United States)

    Lee, Seung-Chang; Brueck, Steven R. J.

    2017-06-20

    Exemplary embodiments provide materials and methods of forming high-quality semiconductor devices using lattice-mismatched materials. In one embodiment, a composite film including one or more substantially-single-particle-thick nanoparticle layers can be deposited over a substrate as a nanoscale selective growth mask for epitaxially growing lattice-mismatched materials over the substrate.

  6. Spectral Gaps in Graphene Antidot Lattices

    DEFF Research Database (Denmark)

    Barbaroux, Jean-Marie; Cornean, Decebal Horia; Stockmeyer, Edgardo

    2017-01-01

    We consider the gap creation problem in an antidot graphene lattice, i.e. a sheet of graphene with periodically distributed obstacles. We prove several spectral results concerning the size of the gap and its dependence on different natural parameters related to the antidot lattice....

  7. Cold collisions in dissipative optical lattices

    International Nuclear Information System (INIS)

    Piilo, J; Suominen, K-A

    2005-01-01

    The invention of laser cooling methods for neutral atoms allows optical and magnetic trapping of cold atomic clouds in the temperature regime below 1 mK. In the past, light-assisted cold collisions between laser cooled atoms have been widely studied in magneto-optical atom traps (MOTs). We describe here theoretical studies of dynamical interactions, specifically cold collisions, between atoms trapped in near-resonant, dissipative optical lattices. The extension of collision studies to the regime of optical lattices introduces several complicating factors. For the lattice studies, one has to account for the internal substates of atoms, position-dependent matter-light coupling, and position-dependent couplings between the atoms, in addition to the spontaneous decay of electronically excited atomic states. The developed one-dimensional quantum-mechanical model combines atomic cooling and collision dynamics in a single framework. The model is based on Monte Carlo wavefunction simulations and is applied when the lattice-creating lasers have frequencies both below (red-detuned lattice) and above (blue-detuned lattice) the atomic resonance frequency. It turns out that the radiative heating mechanism affects the dynamics of atomic cloud in a red-detuned lattice in a way that is not directly expected from the MOT studies. The optical lattice and position-dependent light-matter coupling introduces selectivity of collision partners. The atoms which are most mobile and energetic are strongly favoured to participate in collisions, and are more often ejected from the lattice, than the slow ones in the laser parameter region selected for study. Consequently, the atoms remaining in the lattice have a smaller average kinetic energy per atom than in the case of non-interacting atoms. For blue-detuned lattices, we study how optical shielding emerges as a natural part of the lattice and look for ways to optimize the effect. We find that the cooling and shielding dynamics do not mix

  8. Quantum transport in d -dimensional lattices

    International Nuclear Information System (INIS)

    Manzano, Daniel; Chuang, Chern; Cao, Jianshu

    2016-01-01

    We show that both fermionic and bosonic uniform d -dimensional lattices can be reduced to a set of independent one-dimensional chains. This reduction leads to the expression for ballistic energy fluxes in uniform fermionic and bosonic lattices. By the use of the Jordan–Wigner transformation we can extend our analysis to spin lattices, proving the coexistence of both ballistic and non-ballistic subspaces in any dimension and for any system size. We then relate the nature of transport to the number of excitations in the homogeneous spin lattice, indicating that a single excitation always propagates ballistically and that the non-ballistic behaviour of uniform spin lattices is a consequence of the interaction between different excitations. (paper)

  9. A lattice approach to spinorial quantum gravity

    Science.gov (United States)

    Renteln, Paul; Smolin, Lee

    1989-01-01

    A new lattice regularization of quantum general relativity based on Ashtekar's reformulation of Hamiltonian general relativity is presented. In this form, quantum states of the gravitational field are represented within the physical Hilbert space of a Kogut-Susskind lattice gauge theory. The gauge field of the theory is a complexified SU(2) connection which is the gravitational connection for left-handed spinor fields. The physical states of the gravitational field are those which are annihilated by additional constraints which correspond to the four constraints of general relativity. Lattice versions of these constraints are constructed. Those corresponding to the three-dimensional diffeomorphism generators move states associated with Wilson loops around on the lattice. The lattice Hamiltonian constraint has a simple form, and a correspondingly simple interpretation: it is an operator which cuts and joins Wilson loops at points of intersection.

  10. Design of the SPEAR 3 magnet lattice

    International Nuclear Information System (INIS)

    Corbett, J.; Limborg, C.; Nosochkov, Y.; Safranek, J.

    1998-01-01

    The SPEAR 3 Upgrade Project seeks to replace the present 160 nm-rad FODO lattice with an 18 nm-rad double bend achromat (DBA) lattice. The new lattice must conform to the layout of the SPEAR racetrack tunnel and service the existing photon beamlines. Working within these constraints, the authors designed a lattice with 18 achromatic cells and 3 GeV beam energy. This paper reports on design of the main DBA cells, design of the matching cells leading into the 6.5 m racetrack straights, and simulation of the dynamic aperture. The new lattice has gradient dipoles, conventional quadrupoles, and provides horizontal dynamic aperture to ± 20 mm with conservative magnetic multipole errors

  11. Light Hadron Spectroscopy on course lattices with

    CERN Document Server

    Lee, F

    1999-01-01

    The masses and dispersions of light hadrons are calculated in lattice QCD using an O(a sup 2) tadpole-improved gluon action and an O(a sup 2) tadpole-improved next-nearest-neighbor fermion action originally proposed by Hamber and Wu. Two lattices of constant volume with lattice spacings of approximately 0.40 fm and 0.24 fm are considered. The results reveal some scaling violations at the coarser lattice spacing on the order of 5%. At the finer lattice spacing, the nucleon to rho mass ratio reproduces state-of-the-art results using unimproved actions. Good dispersion and rotational invariance up to momenta of pa approx = 1 are also found. The relative merit of alternative choices for improvement operators is assessed through close comparisons with other plaquette-based tadpole-improved actions.

  12. Supersymmetry on a space-time lattice

    Energy Technology Data Exchange (ETDEWEB)

    Kaestner, Tobias

    2008-10-28

    In this thesis the WZ model in one and two dimensions has been thoroughly investigated. With the help of the Nicolai map it was possible to construct supersymmetrically improved lattice actions that preserve one of several supersymmetries. For the WZ model in one dimension SLAC fermions were utilized for the first time leading to a near-perfect elimination of lattice artifacts. In addition the lattice superpotential does not get modified which in two dimensions becomes important when further (discrete) symmetries of the continuum action are considered. For Wilson fermions two new improvements have been suggested and were shown to yield far better results than standard Wilson fermions concerning lattice artifacts. In the one-dimensional theory Ward Identities were studied.However, supersymmetry violations due to broken supersymmetry could only be detected at coarse lattices and very strong couplings. For the two-dimensional models a detailed analysis of supersymmetric improvement terms was given, both for Wilson and SLAC fermions. (orig.)

  13. Lattices for the TRIUMF KAON factory

    International Nuclear Information System (INIS)

    Servranckx, R.V.; Craddock, M.K.

    1989-09-01

    Separated-function racetrack lattices have been developed for the KAON Factory accelerators that have more flexibility than the old circular lattices. The arcs of the large rings have a regular FODO structure with a superimposed six-fold symmetric modulation of the betafunction in order to raise γ t to infinity. Straight sections with zero dispersion are provided for rf cavities and fast injection and extraction, and with controlled dispersion for H - injection and slow extraction. For the small rings, sixfold symmetric circular lattices with high γ t are retained. In the Accumulator lattice, a straight section with double waist and controlled η function allows for H - injection and phase-space painting. The ion-optical properties of the lattices and the results from tracking studies are discussed

  14. Ising antiferromagnet on the Archimedean lattices

    Science.gov (United States)

    Yu, Unjong

    2015-06-01

    Geometric frustration effects were studied systematically with the Ising antiferromagnet on the 11 Archimedean lattices using the Monte Carlo methods. The Wang-Landau algorithm for static properties (specific heat and residual entropy) and the Metropolis algorithm for a freezing order parameter were adopted. The exact residual entropy was also found. Based on the degree of frustration and dynamic properties, ground states of them were determined. The Shastry-Sutherland lattice and the trellis lattice are weakly frustrated and have two- and one-dimensional long-range-ordered ground states, respectively. The bounce, maple-leaf, and star lattices have the spin ice phase. The spin liquid phase appears in the triangular and kagome lattices.

  15. Synthesizing lattice structures in phase space

    International Nuclear Information System (INIS)

    Guo, Lingzhen; Marthaler, Michael

    2016-01-01

    In one dimensional systems, it is possible to create periodic structures in phase space through driving, which is called phase space crystals (Guo et al 2013 Phys. Rev. Lett. 111 205303). This is possible even if for particles trapped in a potential without periodicity. In this paper we discuss ultracold atoms in a driven optical lattice, which is a realization of such a phase space crystals. The corresponding lattice structure in phase space is complex and contains rich physics. A phase space lattice differs fundamentally from a lattice in real space, because its coordinate system, i.e., phase space, has a noncommutative geometry, which naturally provides an artificial gauge (magnetic) field. We study the behavior of the quasienergy band structure and investigate the dissipative dynamics. Synthesizing lattice structures in phase space provides a new platform to simulate the condensed matter phenomena and study the intriguing phenomena of driven systems far away from equilibrium. (paper)

  16. Supersymmetry on a space-time lattice

    International Nuclear Information System (INIS)

    Kaestner, Tobias

    2008-01-01

    In this thesis the WZ model in one and two dimensions has been thoroughly investigated. With the help of the Nicolai map it was possible to construct supersymmetrically improved lattice actions that preserve one of several supersymmetries. For the WZ model in one dimension SLAC fermions were utilized for the first time leading to a near-perfect elimination of lattice artifacts. In addition the lattice superpotential does not get modified which in two dimensions becomes important when further (discrete) symmetries of the continuum action are considered. For Wilson fermions two new improvements have been suggested and were shown to yield far better results than standard Wilson fermions concerning lattice artifacts. In the one-dimensional theory Ward Identities were studied.However, supersymmetry violations due to broken supersymmetry could only be detected at coarse lattices and very strong couplings. For the two-dimensional models a detailed analysis of supersymmetric improvement terms was given, both for Wilson and SLAC fermions. (orig.)

  17. Lattice gravity near the continuum limit

    International Nuclear Information System (INIS)

    Feinberg, G.; Friedberg, R.; Lee, T.D.; Ren, H.C.

    1984-01-01

    We prove that the lattice gravity always approaches the usual continuum limit when the link length l -> 0, provided that certain general boundary conditions are satisfied. This result holds for any lattice, regular or irregular. Furthermore, for a given lattice, the deviation from its continuum limit can be expressed as a power series in l 2 . General formulas for such a perturbative calculation are given, together with a number of illustrative examples, including the graviton propagator. The lattice gravity satisfies all the invariance properties of Einstein's theory of general relativity. In addition, it is symmetric under a new class of transformations that are absent in the usual continuum theory. The possibility that the lattice theory (with a nonzero l) may be more fundamental is discussed. (orig.)

  18. Synthetic magnetic fluxes on the honeycomb lattice

    Energy Technology Data Exchange (ETDEWEB)

    Gorecka, Agnieszka [Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore); Gremaud, Benoit [Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore); Department of Physics, National University of Singapore, 2 Science Drive 3, Singapore 117542 (Singapore); Laboratoire Kastler Brossel, Ecole Normale Superieure, CNRS, UPMC, 4 Place Jussieu, FR-75005 Paris (France); Miniatura, Christian [Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore); Department of Physics, National University of Singapore, 2 Science Drive 3, Singapore 117542 (Singapore); Institut Non Lineaire de Nice, UMR 6618, UNS, CNRS, 1361 Route des Lucioles, FR-06560 Valbonne (France); Institute of Advanced Studies, Nanyang Technological university, 60 Nanyang View, Singapore 639673 (Singapore)

    2011-08-15

    We devise experimental schemes that are able to mimic uniform and staggered magnetic fluxes acting on ultracold two-electron atoms, such as ytterbium atoms, propagating in a honeycomb lattice. The atoms are first trapped into two independent state-selective triangular lattices and then further exposed to a suitable configuration of resonant Raman laser beams. These beams induce hops between the two triangular lattices and make atoms move in a honeycomb lattice. Atoms traveling around each unit cell of this honeycomb lattice pick up a nonzero phase. In the uniform case, the artificial magnetic flux sustained by each cell can reach about two flux quanta, thereby realizing a cold-atom analog of the Harper model with its notorious Hofstadter's butterfly structure. Different condensed-matter phenomena such as the relativistic integer and fractional quantum Hall effects, as observed in graphene samples, could be targeted with this scheme.

  19. Stochastic control with rough paths

    International Nuclear Information System (INIS)

    Diehl, Joscha; Friz, Peter K.; Gassiat, Paul

    2017-01-01

    We study a class of controlled differential equations driven by rough paths (or rough path realizations of Brownian motion) in the sense of Lyons. It is shown that the value function satisfies a HJB type equation; we also establish a form of the Pontryagin maximum principle. Deterministic problems of this type arise in the duality theory for controlled diffusion processes and typically involve anticipating stochastic analysis. We make the link to old work of Davis and Burstein (Stoch Stoch Rep 40:203–256, 1992) and then prove a continuous-time generalization of Roger’s duality formula [SIAM J Control Optim 46:1116–1132, 2007]. The generic case of controlled volatility is seen to give trivial duality bounds, and explains the focus in Burstein–Davis’ (and this) work on controlled drift. Our study of controlled rough differential equations also relates to work of Mazliak and Nourdin (Stoch Dyn 08:23, 2008).

  20. Stochastic control with rough paths

    Energy Technology Data Exchange (ETDEWEB)

    Diehl, Joscha [University of California San Diego (United States); Friz, Peter K., E-mail: friz@math.tu-berlin.de [TU & WIAS Berlin (Germany); Gassiat, Paul [CEREMADE, Université Paris-Dauphine, PSL Research University (France)

    2017-04-15

    We study a class of controlled differential equations driven by rough paths (or rough path realizations of Brownian motion) in the sense of Lyons. It is shown that the value function satisfies a HJB type equation; we also establish a form of the Pontryagin maximum principle. Deterministic problems of this type arise in the duality theory for controlled diffusion processes and typically involve anticipating stochastic analysis. We make the link to old work of Davis and Burstein (Stoch Stoch Rep 40:203–256, 1992) and then prove a continuous-time generalization of Roger’s duality formula [SIAM J Control Optim 46:1116–1132, 2007]. The generic case of controlled volatility is seen to give trivial duality bounds, and explains the focus in Burstein–Davis’ (and this) work on controlled drift. Our study of controlled rough differential equations also relates to work of Mazliak and Nourdin (Stoch Dyn 08:23, 2008).