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

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

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.

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.

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.

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.

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.

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

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

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.

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.

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

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.

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.

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.

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

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

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

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.

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.

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.

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

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.

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.

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.

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

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.

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.

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

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.

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.

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

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.

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.

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.

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.

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.

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

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.

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

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

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.

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.

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.

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.

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.

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.

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.

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 .

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

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

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…

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

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.

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.

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

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.

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.

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.

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.

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.

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.

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.

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

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.

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.

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.

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

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)

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.

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.

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

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

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.

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

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.

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

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.

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

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

Empirical study of long-range connections in a road network offers new ingredient for navigation optimization models

Science.gov (United States)

Wang, Pu; Liu, Like; Li, Xiamiao; Li, Guanliang; González, Marta C.

2014-01-01

Navigation problem in lattices with long-range connections has been widely studied to understand the design principles for optimal transport networks; however, the travel cost of long-range connections was not considered in previous models. We define long-range connection in a road network as the shortest path between a pair of nodes through highways and empirically analyze the travel cost properties of long-range connections. Based on the maximum speed allowed in each road segment, we observe that the time needed to travel through a long-range connection has a characteristic time Th ˜ 29 min, while the time required when using the alternative arterial road path has two different characteristic times Ta ˜ 13 and 41 min and follows a power law for times larger than 50 min. Using daily commuting origin-destination matrix data, we additionally find that the use of long-range connections helps people to save about half of the travel time in their daily commute. Based on the empirical results, we assign a more realistic travel cost to long-range connections in two-dimensional square lattices, observing dramatically different minimum average shortest path but similar optimal navigation conditions.

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

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.

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.

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.

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.

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

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

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

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

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

Empirical study of long-range connections in a road network offers new ingredient for navigation optimization models

International Nuclear Information System (INIS)

Wang, Pu; Liu, Like; Li, Xiamiao; Li, Guanliang; González, Marta C

2014-01-01

Navigation problem in lattices with long-range connections has been widely studied to understand the design principles for optimal transport networks; however, the travel cost of long-range connections was not considered in previous models. We define long-range connection in a road network as the shortest path between a pair of nodes through highways and empirically analyze the travel cost properties of long-range connections. Based on the maximum speed allowed in each road segment, we observe that the time needed to travel through a long-range connection has a characteristic time T h  ∼ 29 min, while the time required when using the alternative arterial road path has two different characteristic times T a  ∼ 13 and 41 min and follows a power law for times larger than 50 min. Using daily commuting origin–destination matrix data, we additionally find that the use of long-range connections helps people to save about half of the travel time in their daily commute. Based on the empirical results, we assign a more realistic travel cost to long-range connections in two-dimensional square lattices, observing dramatically different minimum average shortest path 〈l〉 but similar optimal navigation conditions. (paper)

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

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

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)

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

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

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

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.

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

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)

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)

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.

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

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

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)

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.

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.

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.

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.

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.

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.

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

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.

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.

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.

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

OpenAIRE

Lubis, Elita Sari

2016-01-01

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

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.

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.

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

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.

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.

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.

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.

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.

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

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

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

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

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

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

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.

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

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.

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

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

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.

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.

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

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

Travel time and ray path computation in 2D-heterogeneous structures; Fukinshitsu kozo ni okeru jishinha soji oyobi hasen no atarashii keisan hoho

Energy Technology Data Exchange (ETDEWEB)

Fujie, G; Kasahara, J; Sato, T; Mochizuki, K [The University of Tokyo, Tokyo (Japan). Earthquake Research Institute

1996-05-01

Methods were studied for determining the initial travel time and ray paths with stability when an non-linear travel time inversion is performed in an inhomogeneous structure. The travel time calculation was based on Faria and Stoffa`s method. First, the 2-dimension space was sectioned by grids, and `slowness` was assigned to all the lattice points. Starting from the vibration source, travel time at each lattice point is sequentially calculated. This method calculates travel time for any structure without breakup. In this study, an algorithm more sophisticated than the method of Faria, et al., was developed, and the improvement of travel time calculation accuracy led to the accurate determination of the direction of incidence into the lattice points during the initial motion. The calculation of ray paths was effected by tracing back from the receiving points the incidence into the lattice points or by following back the ray paths to the vibration source. This method performs stable calculation for a heavily inhomogeneous structure and, with the algorithm being simple, do the parallel programming as well. 1 ref., 6 figs., 1 tab.

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.

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

Discrete geometry in honor of W. Kuperberg's 60th birthday

CERN Document Server

Bezdek, Andras

2003-01-01

Transversal lines to lines and intervals, Jorge L. Arocha, Javier Bracho, and Luis Montejano; on a shortest path problem of G. Fejes, Toth Donald R. Baggett and Andras Bezdek; a short survey of (r,q)-structures, Vojtech Balint; lattice points on the boundary of the integer hull, Imre Barany and Karoly Boroczky, Jr; the Erdos-Szekeres problem for planar points in arbitrary position, Tibor Bisztriczky and Gabor Fejes Toth, separation in totally-sewn 4-polytopes, Tibor Bisztriczky and Deborah Oliveros, on a class of equifacetted polytopes, Gerd Blind and Roswitha Blind; chessboard Ramsey numbers,

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.

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.

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)

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

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.

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

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.

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

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.

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.

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

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

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.

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

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

Beyond centrality-classifying topological significance using backup efficiency and alternative paths

International Nuclear Information System (INIS)

Shavitt, Yuval; Singer, Yaron

2007-01-01

In complex networks characterized by broad degree distribution, node significance is often associated with its degree or with centrality metrics which relate to its reachability and shortest paths passing through it. Such measures do not consider availability of efficient backup of the node and thus often fail to capture its contribution to the functionality and resilience of the network operation. In this paper, we suggest the quality of backup (QoB) and alternative path centrality (APC) measures as complementary methods which enable analysis of node significance in a manner which considers backup. We examine the theoretical significance of these measures and use them to classify nodes in social interaction networks and in the Internet AS (autonomous system) graph while applying the valley-free routing restrictions which reflect the economic relationships between the AS nodes in the Internet. We show that both node degree and node centrality are not necessarily evidence of its significance. In particular, we show that social structures do not necessarily depend on highly central nodes and that medium degree nodes with medium centrality measure prove to be crucial for efficient routing in the Internet AS graph

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

Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail.

Science.gov (United States)

Teichroeb, Julie Annette; Smeltzer, Eve Ann

2018-01-01

Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP demands a return to the start, while the SPP does not. Vervet monkeys are very efficient in solving TSPs but this species is a multiple central place forager that does not always return to the same sleeping site and thus theoretically should be selected to find solutions to SPPs rather than TSPs. We examined path choice by wild vervets in an SPP experimental array where the shortest paths usually differed from those consistent with common heuristic strategies, the nearest-neighbor rule (NNR-go to the closest resource that has not been visited), and the convex hull (put a mental loop around sites, adding inner targets in order of distance from the edge)-an efficient strategy for TSPs but not SPPs. In addition, humans solving SPPs use an initial segment strategy (ISS-choose the straightest path at the beginning, only turning when necessary) and we looked at vervet paths consistent with this strategy. In 615 trials by single foragers, paths usually conformed to the NNR and rarely the slightly more efficient convex hull, supporting that vervets may be selected to solve SPPs. Further, like humans solving SPPs, vervets showed a tendency to use the ISS. Paths consistent with heuristics dropped off sharply, and use of the shortest path increased, when heuristics led to longer paths showing trade-offs in efficiency versus cognitive load. Two individuals out of 17, found the shortest path most often, showing inter-individual variation in path planning. Given support for the NNR and the ISS, we propose a new rule-of-thumb termed the "region heuristic" that vervets may apply in multi-destination routes.

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

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

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)

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.

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.

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

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.

Alpha current flow betweenness centrality

NARCIS (Netherlands)

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

2013-01-01

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

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

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.

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

Science.gov (United States)

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

2017-01-01

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

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.

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.

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.

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

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

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.

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

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

Path Planning for Non-Circular, Non-Holonomic Robots in Highly Cluttered Environments.

Science.gov (United States)

Samaniego, Ricardo; Lopez, Joaquin; Vazquez, Fernando

2017-08-15

This paper presents an algorithm for finding a solution to the problem of planning a feasible path for a slender autonomous mobile robot in a large and cluttered environment. The presented approach is based on performing a graph search on a kinodynamic-feasible lattice state space of high resolution; however, the technique is applicable to many search algorithms. With the purpose of allowing the algorithm to consider paths that take the robot through narrow passes and close to obstacles, high resolutions are used for the lattice space and the control set. This introduces new challenges because one of the most computationally expensive parts of path search based planning algorithms is calculating the cost of each one of the actions or steps that could potentially be part of the trajectory. The reason for this is that the evaluation of each one of these actions involves convolving the robot's footprint with a portion of a local map to evaluate the possibility of a collision, an operation that grows exponentially as the resolution is increased. The novel approach presented here reduces the need for these convolutions by using a set of offline precomputed maps that are updated, by means of a partial convolution, as new information arrives from sensors or other sources. Not only does this improve run-time performance, but it also provides support for dynamic search in changing environments. A set of alternative fast convolution methods are also proposed, depending on whether the environment is cluttered with obstacles or not. Finally, we provide both theoretical and experimental results from different experiments and applications.

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

Nonperturbative renormalization of nonlocal quark bilinears for quasi-PDFs on the lattice using an auxiliary field

Energy Technology Data Exchange (ETDEWEB)

Green, Jeremy; Jansen, Karl; Steffens, Fernanda [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC

2017-07-15

Quasi-PDFs provide a path toward an ab initio calculation of parton distribution functions (PDFs) using lattice QCD. One of the problems faced in calculations of quasi-PDFs is the renormalization of a nonlocal operator. By introducing an auxiliary field, we can replace the nonlocal operator with a pair of local operators in an extended theory. On the lattice, this is closely related to the static quark theory. In this approach, we show how to understand the pattern of mixing that is allowed by chiral symmetry breaking, and obtain a master formula for renormalizing the nonlocal operator that depends on three parameters. We present an approach for nonperturbatively determining these parameters and use perturbation theory to convert to the MS scheme. Renormalization parameters are obtained for two lattice spacings using Wilson twisted mass fermions and for different discretizations of the Wilson line in the nonlocal operator. Using these parameters we show the effect of renormalization on nucleon matrix elements with pion mass approximately 370 MeV, and compare renormalized results for the two lattice spacings. The renormalized matrix elements are consistent among the different Wilson line discretizations and lattice spacings.

Drift Compression and Final Focus for Intense Heavy Ion Beams with Non-periodic, Time-dependent Lattice

International Nuclear Information System (INIS)

Hong Qin; Davidson, Ronald C.; Barnard, John J.; Lee, Edward P.

2005-01-01

In the currently envisioned configurations for heavy ion fusion, it is necessary to longitudinally compress the beam bunches by a large factor after the acceleration phase. Because the space-charge force increases as the beam is compressed, the beam size in the transverse direction will increase in a periodic quadrupole lattice. If an active control of the beam size is desired, a larger focusing force is needed to confine the beam in the transverse direction, and a non-periodic quadrupole lattice along the beam path is necessary. In this paper, we describe the design of such a focusing lattice using the transverse envelope equations. A drift compression and final focus lattice should focus the entire beam pulse onto the same focal spot on the target. This is difficult with a fixed lattice, because different slices of the beam may have different perveance and emittance. Four time-dependent magnets are introduced in the upstream of drift compression to focus the entire pulse onto the sam e focal spot. Drift compression and final focusing schemes are developed for a typical heavy ion fusion driver and for the Integrated Beam Experiment (IBX) being designed by the Heavy Ion Fusion Virtual National Laboratory

Nonperturbative renormalization of nonlocal quark bilinears for quasi-PDFs on the lattice using an auxiliary field

International Nuclear Information System (INIS)

Green, Jeremy; Jansen, Karl; Steffens, Fernanda

2017-07-01

Quasi-PDFs provide a path toward an ab initio calculation of parton distribution functions (PDFs) using lattice QCD. One of the problems faced in calculations of quasi-PDFs is the renormalization of a nonlocal operator. By introducing an auxiliary field, we can replace the nonlocal operator with a pair of local operators in an extended theory. On the lattice, this is closely related to the static quark theory. In this approach, we show how to understand the pattern of mixing that is allowed by chiral symmetry breaking, and obtain a master formula for renormalizing the nonlocal operator that depends on three parameters. We present an approach for nonperturbatively determining these parameters and use perturbation theory to convert to the MS scheme. Renormalization parameters are obtained for two lattice spacings using Wilson twisted mass fermions and for different discretizations of the Wilson line in the nonlocal operator. Using these parameters we show the effect of renormalization on nucleon matrix elements with pion mass approximately 370 MeV, and compare renormalized results for the two lattice spacings. The renormalized matrix elements are consistent among the different Wilson line discretizations and lattice spacings.

Nearby Search Indekos Based Android Using A Star (A*) Algorithm

Science.gov (United States)

Siregar, B.; Nababan, EB; Rumahorbo, JA; Andayani, U.; Fahmi, F.

2018-03-01

Indekos or rented room is a temporary residence for months or years. Society of academicians who come from out of town need a temporary residence, such as Indekos or rented room during their education, teaching, or duties. They are often found difficulty in finding a Indekos because lack of information about the Indekos. Besides, new society of academicians don’t recognize the areas around the campus and desire the shortest path from Indekos to get to the campus. The problem can be solved by implementing A Star (A*) algorithm. This algorithm is one of the shortest path algorithm to a finding shortest path from campus to the Indekos application, where the faculties in the campus as the starting point of the finding. Determination of the starting point used in this study aims to allow students to determine the starting point in finding the Indekos. The mobile based application facilitates the finding anytime and anywhere. Based on the experimental results, A* algorithm can find the shortest path with 86,67% accuracy.

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

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.

Bookshelf (Quantum Fields on a Lattice, by Istvan Montvay and Gernot Muenster)

Energy Technology Data Exchange (ETDEWEB)

Wolff, U.

1994-09-15

In four space-time dimensions, lattice regularization often represents the only non-perturbative definition of a quantum field theory. On this basis, and in connection with numerical simulation techniques and the spreading of powerful parallel computers, more and more realistic calculations are carried out. There has been a great need for a textbook for advanced students to enter this field. While the recent book by H. J. Rothe (Lattice Gauge Theories, Word Scientific) covers the more formal and analytic aspects, this new book provides excellent coverage of a large section of the field, including details of Monte Carlo simulations and algorithms. It is well suitable to prepare a student for reading reviews as they appear in annual proceedings of lattice conferences. The book starts with an introduction to euclidean fields and path-integrals including nontrivial details like reflection positivity. Here the authors succeed very well in avoiding the use of both over-formal machinery as well as an unduly schematic and superficial presentation. Then several sections introduce lattice scalar, fermion, and gauge fields in the traditional division of field theory texts. Lattice specialties, like the semi-analytic Luescher-Weisz solution and the problem of fermion doubling, are enlarged on. Bridges toward current research are included in chapters on QCD and Higgs and Yukawa models. The book ends with practical considerations about algorithms, including hybrid Monte Carlo, and error analysis. This textbook is an excellent introduction to present day lattice methods for particle physics. In its scope it is almost unrivalled and is a must for every student taking up the subject. The researcher in the field will value it as a standard reference and entry point to the literature.

Bookshelf (Quantum Fields on a Lattice, by Istvan Montvay and Gernot Muenster)

International Nuclear Information System (INIS)

Wolff, U.

1994-01-01

In four space-time dimensions, lattice regularization often represents the only non-perturbative definition of a quantum field theory. On this basis, and in connection with numerical simulation techniques and the spreading of powerful parallel computers, more and more realistic calculations are carried out. There has been a great need for a textbook for advanced students to enter this field. While the recent book by H. J. Rothe (Lattice Gauge Theories, Word Scientific) covers the more formal and analytic aspects, this new book provides excellent coverage of a large section of the field, including details of Monte Carlo simulations and algorithms. It is well suitable to prepare a student for reading reviews as they appear in annual proceedings of lattice conferences. The book starts with an introduction to euclidean fields and path-integrals including nontrivial details like reflection positivity. Here the authors succeed very well in avoiding the use of both over-formal machinery as well as an unduly schematic and superficial presentation. Then several sections introduce lattice scalar, fermion, and gauge fields in the traditional division of field theory texts. Lattice specialties, like the semi-analytic Luescher-Weisz solution and the problem of fermion doubling, are enlarged on. Bridges toward current research are included in chapters on QCD and Higgs and Yukawa models. The book ends with practical considerations about algorithms, including hybrid Monte Carlo, and error analysis. This textbook is an excellent introduction to present day lattice methods for particle physics. In its scope it is almost unrivalled and is a must for every student taking up the subject. The researcher in the field will value it as a standard reference and entry point to the literature.

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.

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.

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

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.

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.

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.

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.

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

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)

Personal computer based decision support system for routing nuclear spent fuel

International Nuclear Information System (INIS)

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

1989-01-01

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

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…

Intragranular twinning, detwinning, and twinning-like lattice reorientation in magnesium alloys

International Nuclear Information System (INIS)

Wu, Wei; Gao, Yanfei; Li, Nan; Parish, Chad M.; Liu, Wenjun; Liaw, Peter K.; An, Ke

2016-01-01

Deformation twinning plays a critical role on improving metals or alloys ductility, especially for hexagonal close-packed materials with low symmetry crystal structure. A rolled Mg alloy was selected as a model system to investigate the extension twinning behaviors and characteristics of parent-twin interactions by nondestructive in situ 3D synchrotron X-ray microbeam diffraction. Besides twinning-detwinning process, the “twinning-like” lattice reorientation process was captured within an individual grain inside a bulk material during the strain reversal. The distributions of parent, twin, and reorientated grains and sub-micron level strain variation across the twin boundary are revealed. A theoretical calculation of the lattice strain confirms that the internal strain distribution in parent and twinned grains correlates with the experimental setup, grain orientation of parent, twin, and surrounding grains, as well as the strain path changes. The study suggests a novel deformation mechanism within the hexagonal close-packed structure that cannot be determined from surface-based characterization methods.

Transformation Paths from Cubic to Low-Symmetry Structures in Heusler Ni2MnGa Compound.

Science.gov (United States)

Zelený, Martin; Straka, Ladislav; Sozinov, Alexei; Heczko, Oleg

2018-05-08

In order to explain the formation of low-temperature phases in stoichiometric Ni 2 MnGa magnetic shape memory alloy, we investigate the phase transformation paths from cubic austenite with Heusler structure to low-symmetry martensitic structures. We used ab initio calculations combined with the generalized solid state nudged elastic band method to determine the minimum energy path and corresponding changes in crystal lattice. The four-, five-, and seven-layered modulated phases of martensite (4O, 10M, and 14M) are built as the relaxed nanotwinned non-modulated (NM) phase. Despite having a total energy larger than the other martensitic phases, the 10M phase will spontaneously form at 0 K, because there is no energy barrier on the path and the energy decreases with a large negative slope. Moreover, a similar negative slope in the beginning of path is found also for the transformation to the 6M premartensite, which appears as a local minimum on the path leading further to 10M martensite. Transformation paths to other structures exhibit more or less significant barriers in the beginning hindering such a transformation from austenite. These findings correspond to experiment and demonstrates that the kinetics of the transformation is decisive for the selection of the particular low-symmetry structure.

Complexity in human transportation networks: a comparative analysis of worldwide air transportation and global cargo-ship movements

Science.gov (United States)

Woolley-Meza, O.; Thiemann, C.; Grady, D.; Lee, J. J.; Seebens, H.; Blasius, B.; Brockmann, D.

2011-12-01

We present a comparative network-theoretic analysis of the two largest global transportation networks: the worldwide air-transportation network (WAN) and the global cargo-ship network (GCSN). We show that both networks exhibit surprising statistical similarities despite significant differences in topology and connectivity. Both networks exhibit a discontinuity in node and link betweenness distributions which implies that these networks naturally segregate into two different classes of nodes and links. We introduce a technique based on effective distances, shortest paths and shortest path trees for strongly weighted symmetric networks and show that in a shortest path tree representation the most significant features of both networks can be readily seen. We show that effective shortest path distance, unlike conventional geographic distance measures, strongly correlates with node centrality measures. Using the new technique we show that network resilience can be investigated more precisely than with contemporary techniques that are based on percolation theory. We extract a functional relationship between node characteristics and resilience to network disruption. Finally we discuss the results, their implications and conclude that dynamic processes that evolve on both networks are expected to share universal dynamic characteristics.

A low-temperature derivation of spin-spin exchange in Kondo lattice model

International Nuclear Information System (INIS)

Feng Szeshiang; Mochena, Mogus

2005-01-01

Using Hubbard-Stratonovich transformation and drone-fermion representations for spin-12 and for spin-32, which is presented for the first time, we make a path-integral formulation of the Kondo lattice model. In the case of weak coupling and low temperature, the functional integral over conduction fermions can be approximated to the quadratic order and this gives the well-known RKKY interaction. In the case of strong coupling, the same quadratic approximation leads to an effective local spin-spin interaction linear in hopping energy t

A low-temperature derivation of spin-spin exchange in Kondo lattice model

Energy Technology Data Exchange (ETDEWEB)

Feng Szeshiang [Physics Department, Florida A and M University, Tallahassee, FL 32307 (United States)]. E-mail: shixiang.feng@famu.edu; Mochena, Mogus [Physics Department, Florida A and M University, Tallahassee, FL 32307 (United States)

2005-11-01

Using Hubbard-Stratonovich transformation and drone-fermion representations for spin-12 and for spin-32, which is presented for the first time, we make a path-integral formulation of the Kondo lattice model. In the case of weak coupling and low temperature, the functional integral over conduction fermions can be approximated to the quadratic order and this gives the well-known RKKY interaction. In the case of strong coupling, the same quadratic approximation leads to an effective local spin-spin interaction linear in hopping energy t.

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)

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

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.

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

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

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.

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

The Lattice-Valued Turing Machines and the Lattice-Valued Type 0 Grammars

Directory of Open Access Journals (Sweden)

Juan Tang

2014-01-01

Full Text Available Purpose. The purpose of this paper is to study a class of the natural languages called the lattice-valued phrase structure languages, which can be generated by the lattice-valued type 0 grammars and recognized by the lattice-valued Turing machines. Design/Methodology/Approach. From the characteristic of natural language, this paper puts forward a new concept of the l-valued Turing machine. It can be used to characterize recognition, natural language processing, and dynamic characteristics. Findings. The mechanisms of both the generation of grammars for the lattice-valued type 0 grammar and the dynamic transformation of the lattice-valued Turing machines were given. Originality/Value. This paper gives a new approach to study a class of natural languages by using lattice-valued logic theory.

Coherent Addressing of Individual Neutral Atoms in a 3D Optical Lattice.

Science.gov (United States)

Wang, Yang; Zhang, Xianli; Corcovilos, Theodore A; Kumar, Aishwarya; Weiss, David S

2015-07-24

We demonstrate arbitrary coherent addressing of individual neutral atoms in a 5×5×5 array formed by an optical lattice. Addressing is accomplished using rapidly reconfigurable crossed laser beams to selectively ac Stark shift target atoms, so that only target atoms are resonant with state-changing microwaves. The effect of these targeted single qubit gates on the quantum information stored in nontargeted atoms is smaller than 3×10^{-3} in state fidelity. This is an important step along the path of converting the scalability promise of neutral atoms into reality.

[Not Available].

Science.gov (United States)

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

2009-01-01

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

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.

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.

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.

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

Solution of semi-flexible self-avoiding trails on a Husimi lattice built with squares

Science.gov (United States)

Oliveira, Tiago J.; Dantas, Wellington G.; Prellberg, Thomas; Stilck, Jürgen F.

2018-02-01

We study a model of semi-flexible self-avoiding trails, where the lattice paths are constrained to visit each lattice edge at most once, with configurations weighted by the number of collisions, crossings and bends, on a Husimi lattice built with squares. We find a rich phase diagram with five phases: a non-polymerised phase (NP), low density (P1) and high density (P2) polymerised phases, and, for sufficiently large stiffness, two additional anisotropic (nematic) (AN1 and AN2) polymerised phases within the P1 phase. Moreover, the AN1 phase which shows a broken symmetry with a preferential direction, is separated from the P1 phase by the other nematic AN2 phase. Although this scenario is similar to what was found in our previous calculation on the Bethe lattice, where the AN-P1 transition was discontinuous and critical, the presence of the additional nematic phase between them introduces a qualitative difference. Other details of the phase diagram are that a line of tri-critical points may separate the P1-P2 transition surface into a continuous and a discontinuous portion, and that the same may happen at the NP-P1 transition surface, details of which depend on whether crossings are allowed or forbidden. A critical end-point line is also found in the phase diagram.

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

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

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

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.

UMDR: Multi-Path Routing Protocol for Underwater Ad Hoc Networks with Directional Antenna

Science.gov (United States)

Yang, Jianmin; Liu, Songzuo; Liu, Qipei; Qiao, Gang

2018-01-01

This paper presents a new routing scheme for underwater ad hoc networks based on directional antennas. Ad hoc networks with directional antennas have become a hot research topic because of space reuse may increase networks capacity. At present, researchers have applied traditional self-organizing routing protocols (such as DSR, AODV) [1] [2] on this type of networks, and the routing scheme is based on the shortest path metric. However, such routing schemes often suffer from long transmission delays and frequent link fragmentation along the intermediate nodes of the selected route. This is caused by a unique feature of directional transmission, often called as “deafness”. In this paper, we take a different approach to explore the advantages of space reuse through multipath routing. This paper introduces the validity of the conventional routing scheme in underwater ad hoc networks with directional antennas, and presents a special design of multipath routing algorithm for directional transmission. The experimental results show a significant performance improvement in throughput and latency.

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.

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)

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.

Lattice quantum chromodynamics and properties of the nucleon

International Nuclear Information System (INIS)

Baron, R.

2009-09-01

The goal of this thesis is to compute from first principles nucleon properties, starting from the microscopic theory of strong interaction, quantum chromodynamics (QCD). This theory, whose degrees of freedom are quarks and gluons, has been well tested in high energy experiments thanks to asymptotic freedom, the fact that interaction cancels at short distances, which allows the use of the perturbative theory. To predict properties which involve long distances, like masses or current distributions, one needs an exact treatment of the theory. It uses a four-dimensional lattice on which the theory is discretized and quantum observables are computed through path integral techniques, as explained in chapters 2 and 3. In chapter 4 we discuss problems faced when fermions are taken into account and we present the choice for our computations: a discretization in a 'Wilson' manner plus an additional twisted mass. Its advantage is to remove discretization effects of the order of the lattice spacing provided one parameter is tuned. The numerical evaluation of path integrals is done by Monte Carlo methods with importance sampling. The 'Hybrid Monte Carlo' algorithm, based on molecular dynamics, is presented in chapter 5 together with a method to solve large sparse linear systems necessary to compute observables. This chapter also describes computer science details of the problem which are the use of massive parallel processing and some characteristics of computers used. In chapter 6 we explain how the production of representative samples of gauge configuration is performed. This step and its control is an important part of the work done during this thesis. The last two chapters are devoted to the computation of observables and to the presentation of results. The main technical difficulty which is to solve for quark propagators has been performed by using available processor farms at their best. A good part of this work has been focused on this. To conclude we comment on the

A deterministic method for estimating free energy genetic network landscapes with applications to cell commitment and reprogramming paths.

Science.gov (United States)

Olariu, Victor; Manesso, Erica; Peterson, Carsten

2017-06-01

Depicting developmental processes as movements in free energy genetic landscapes is an illustrative tool. However, exploring such landscapes to obtain quantitative or even qualitative predictions is hampered by the lack of free energy functions corresponding to the biochemical Michaelis-Menten or Hill rate equations for the dynamics. Being armed with energy landscapes defined by a network and its interactions would open up the possibility of swiftly identifying cell states and computing optimal paths, including those of cell reprogramming, thereby avoiding exhaustive trial-and-error simulations with rate equations for different parameter sets. It turns out that sigmoidal rate equations do have approximate free energy associations. With this replacement of rate equations, we develop a deterministic method for estimating the free energy surfaces of systems of interacting genes at different noise levels or temperatures. Once such free energy landscape estimates have been established, we adapt a shortest path algorithm to determine optimal routes in the landscapes. We explore the method on three circuits for haematopoiesis and embryonic stem cell development for commitment and reprogramming scenarios and illustrate how the method can be used to determine sequential steps for onsets of external factors, essential for efficient reprogramming.

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

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

Observation of Bloch oscillations in complex PT-symmetric photonic lattices

Science.gov (United States)

Wimmer, Martin; Miri, Mohammed-Ali; Christodoulides, Demetrios; Peschel, Ulf

2015-01-01

Light propagation in periodic environments is often associated with a number of interesting and potentially useful processes. If a crystalline optical potential is also linearly ramped, light can undergo periodic Bloch oscillations, a direct outcome of localized Wannier-Stark states and their equidistant eigenvalue spectrum. Even though these effects have been extensively explored in conservative settings, this is by no means the case in non-Hermitian photonic lattices encompassing both amplification and attenuation. Quite recently, Bloch oscillations have been predicted in parity-time-symmetric structures involving gain and loss in a balanced fashion. While in a complex bulk medium, one intuitively expects that light will typically follow the path of highest amplification, in a periodic system this behavior can be substantially altered by the underlying band structure. Here, we report the first experimental observation of Bloch oscillations in parity-time-symmetric mesh lattices. We show that these revivals exhibit unusual properties like secondary emissions and resonant restoration of PT symmetry. In addition, we present a versatile method for reconstructing the real and imaginary components of the band structure by directly monitoring the light evolution during a cycle of these oscillations. PMID:26639941

Network features and pathway analyses of a signal transduction cascade

Directory of Open Access Journals (Sweden)

Ryoji Yanashima

2009-05-01

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

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.

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

Potential paths for male-mediated gene flow to and from an isolated grizzly bear population

Science.gov (United States)

Peck, Christopher P.; van Manen, Frank T.; Costello, Cecily M.; Haroldson, Mark A.; Landenburger, Lisa; Roberts, Lori L.; Bjornlie, Daniel D.; Mace, Richard D.

2017-01-01

For several decades, grizzly bear populations in the Greater Yellowstone Ecosystem (GYE) and the Northern Continental Divide Ecosystem (NCDE) have increased in numbers and range extent. The GYE population remains isolated and although effective population size has increased since the early 1980s, genetic connectivity between these populations remains a long-term management goal. With only ~110 km distance separating current estimates of occupied range for these populations, the potential for gene flow is likely greater now than it has been for many decades. We sought to delineate potential paths that would provide the opportunity for male-mediated gene flow between the two populations. We first developed step-selection functions to generate conductance layers using ecological, physical, and anthropogenic landscape features associated with non-stationary GPS locations of 124 male grizzly bears (199 bear-years). We then used a randomized shortest path (RSP) algorithm to estimate the average number of net passages for all grid cells in the study region, when moving from an origin to a destination node. Given habitat characteristics that were the basis for the conductance layer, movements follow certain grid cell sequences more than others and the resulting RSP values thus provide a measure of movement potential. Repeating this process for 100 pairs of random origin and destination nodes, we identified paths for three levels of random deviation (θ) from the least-cost path. We observed broad-scale concordance between model predictions for paths originating in the NCDE and those originating in the GYE for all three levels of movement exploration. Model predictions indicated that male grizzly bear movement between the ecosystems could involve a variety of routes, and verified observations of grizzly bears outside occupied range supported this finding. Where landscape features concentrated paths into corridors (e.g., because of anthropogenic influence), they typically

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 a₀(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.

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

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

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.

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

Improving Estimation of Betweenness Centrality for Scale-Free Graphs

Energy Technology Data Exchange (ETDEWEB)

Bromberger, Seth A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Klymko, Christine F. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Henderson, Keith A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Pearce, Roger [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoff [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2017-11-07

Betweenness centrality is a graph statistic used to nd vertices that are participants in a large number of shortest paths in a graph. This centrality measure is commonly used in path and network interdiction problems and its complete form requires the calculation of all-pairs shortest paths for each vertex. This leads to a time complexity of O(jV jjEj), which is impractical for large graphs. Estimation of betweenness centrality has focused on performing shortest-path calculations on a subset of randomly- selected vertices. This reduces the complexity of the centrality estimation to O(jSjjEj); jSj < jV j, which can be scaled appropriately based on the computing resources available. An estimation strategy that uses random selection of vertices for seed selection is fast and simple to implement, but may not provide optimal estimation of betweenness centrality when the number of samples is constrained. Our experimentation has identi ed a number of alternate seed-selection strategies that provide lower error than random selection in common scale-free graphs. These strategies are discussed and experimental results are presented.

Comparison of heuristic optimization techniques for the enrichment and gadolinia distribution in BWR fuel lattices and decision analysis

International Nuclear Information System (INIS)

Castillo, Alejandro; Martín-del-Campo, Cecilia; Montes-Tadeo, José-Luis; François, Juan-Luis; Ortiz-Servin, Juan-José; Perusquía-del-Cueto, Raúl

2014-01-01

Highlights: • Different metaheuristic optimization techniques were compared. • The optimal enrichment and gadolinia distribution in a BWR fuel lattice was studied. • A decision making tool based on the Position Vector of Minimum Regret was applied. • Similar results were found for the different optimization techniques. - Abstract: In the present study a comparison of the performance of five heuristic techniques for optimization of combinatorial problems is shown. The techniques are: Ant Colony System, Artificial Neural Networks, Genetic Algorithms, Greedy Search and a hybrid of Path Relinking and Scatter Search. They were applied to obtain an “optimal” enrichment and gadolinia distribution in a fuel lattice of a boiling water reactor. All techniques used the same objective function for qualifying the different distributions created during the optimization process as well as the same initial conditions and restrictions. The parameters included in the objective function are the k-infinite multiplication factor, the maximum local power peaking factor, the average enrichment and the average gadolinia concentration of the lattice. The CASMO-4 code was used to obtain the neutronic parameters. The criteria for qualifying the optimization techniques include also the evaluation of the best lattice with burnup and the number of evaluations of the objective function needed to obtain the best solution. In conclusion all techniques obtain similar results, but there are methods that found better solutions faster than others. A decision analysis tool based on the Position Vector of Minimum Regret was applied to aggregate the criteria in order to rank the solutions according to three functions: neutronic grade at 0 burnup, neutronic grade with burnup and global cost which aggregates the computing time in the decision. According to the results Greedy Search found the best lattice in terms of the neutronic grade at 0 burnup and also with burnup. However, Greedy Search is

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.

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

Load Balancing Routing with Bounded Stretch

Directory of Open Access Journals (Sweden)

Chen Siyuan

2010-01-01

Full Text Available Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routing method, called Circular Sailing Routing (CSR, which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by a newly defined "circular distance" on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network, the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path. We also extend CSR to a localized version, Localized CSR, by modifying greedy routing without any additional communication overhead. In addition, we investigate how to design CSR routing for 3D networks. For all proposed methods, we conduct extensive simulations to study their performances and compare them with global shortest path routing or greedy routing in 2D and 3D wireless networks.

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

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)

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.

MARRT: Medial Axis biased rapidly-exploring random trees

KAUST Repository

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

2014-01-01

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

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.

Lattice defect investigation of nanostructured ECAP-Cu by means of x-ray line profile analysis, calorimetry and electrical resistometry

International Nuclear Information System (INIS)

Schafler, E.; Steiner, G.; KEXrber, M.; Zehetbauer, M.J.; Korznikova, E.

2005-01-01

Full text: Cu rods have been deformed by Equal Channel Angular Pressing (ECAP) up to shear strains γ ∼ 5 while applying various deformation paths A, B c and C. ECAP processed materials show a microstructure with grain sizes in the nanometer range and a high density of lattice defects. X-ray Bragg Profile Analyses (XPA), Differential Scanning Calorimetry (DSC) as well as Residual Electrical Resistivity (RER) measurements have been performed, in order to detect the densities of various deformation induced lattice defects and/or their arrangements. The results have been analyzed in terms of annealing of deformation induced dislocations and vacancies (vacancy agglomerates). Compared to conventional cold work procedures, deformation by ECAP achieves a strongly enhanced concentration of vacancy type defects. (author)

Ranking the Stars: Network Analysis of Bilateral Tax Treaties

OpenAIRE

Maarten van 't Riet; Arjan Lejour

2014-01-01

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

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)

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.

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.

Software complex for finding the path routings in synchronous digital hierarchy networks

Directory of Open Access Journals (Sweden)

V. A. Bulanov

2014-01-01

Full Text Available Communication network constructions based on the synchronous digital hierarchy (SDH are widely used in design and operation of telephone networks and data transfer ones on the basis of dedicated links. The providing the link for data transmission from one node to another one is a nontrivial objective. The network equipment vendors, as a rule, may provide also a network system control. However, these systems can be used only with the manufacturer's equipment, but are not intended for finding the optimal paths for the current network operation. They serve for examination to choose a network structure at the stage of its development or modernization for the known in advance matrix of connections. From the practice it is seen that the real networks structures use diverse equipment. Therefore to develop a complex to find the paths in SDH-based network is a challenge.Dijkstra algorithm is implemented to find the shortest network path routings in the complex. The use of the classical algorithm is impossible because of the restrictions in providing main and reserve links. There are multiplex sections with no routes to be expected. Such restriction is due to real arrangement of some multiplex sections in the same cables, but in different fibres. When providing the main link, the appropriate structuring sections should be preferable. For example, the link E3 (34 Mbit/s can pass only across the section of relevant configuration. The reserve link cannot pass across those multiplex sections where the main link has passed. This rule is not 'extra' considering the first restriction since the main and reserve link sections cannot crisscross the node. At the dead ends reserving has no sense, and the reserve link has to coincide with the main one to save a multiplex section resource of terminal switching. In implementation all these restrictions have been taken into consideration.In addition to the path routings, complex enables saving information on the network

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

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

Dynamic route guidance algorithm based algorithm based on artificial immune system

Institute of Scientific and Technical Information of China (English)

无

2007-01-01

To improve the performance of the K-shortest paths search in intelligent traffic guidance systems,this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the memphor mechanism of vertebrate immune systems.This algorithm,applied to the urban traffic network model established by the node-expanding method,can expediently realize K-shortest paths search in the urban traffic guidance systems.Because of the immune memory and global parallel search ability from artificial immune systems,K shortest paths can be found without any repeat,which indicates evidently the superiority of the algorithm to the conventional ones.Not only does it perform a better parallelism,the algorithm also prevents premature phenomenon that often occurs in genetic algorithms.Thus,it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications.A case study verifies the efficiency and the practicability of the algorithm aforementioned.

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

Ultrahigh lattice thermal conductivity in topological semimetal TaN caused by a large acoustic-optical gap.

Science.gov (United States)

Guo, San-Dong; Liu, Bang-Gui

2018-03-14

Topological semimetals may have potential applications such as in topological qubits, spintronics and quantum computations. Efficient heat dissipation is a key factor for the reliability and stability of topological semimetal-based nano-electronics devices, which is closely related to high thermal conductivity. In this work, the elastic properties and lattice thermal conductivity of TaN are investigated using first-principles calculations and the linearized phonon Boltzmann equation within the single-mode relaxation time approximation. According to the calculated bulk modulus, shear modulus and C 44 , TaN can be regarded as a potential incompressible and hard material. The room-temperature lattice thermal conductivity is predicted to be 838.62 [Formula: see text] along the a axis and 1080.40 [Formula: see text] along the c axis, showing very strong anisotropy. It is found that the lattice thermal conductivity of TaN is several tens of times higher than other topological semimetals, such as TaAs, MoP and ZrTe, which is due to the very longer phonon lifetimes for TaN than other topological semimetals. The very different atomic masses of Ta and N atoms lead to a very large acoustic-optical band gap, and then prohibit the scattering between acoustic and optical phonon modes, which gives rise to very long phonon lifetimes. Calculated results show that isotope scattering has little effect on lattice thermal conductivity, and that phonons with mean free paths larger than 20 (80) [Formula: see text] along the c direction at 300 K have little contribution to the total lattice thermal conductivity. This work implies that TaN-based nano-electronics devices may be more stable and reliable due to efficient heat dissipation, and motivates further experimental works to study lattice thermal conductivity of TaN.

Ultrahigh lattice thermal conductivity in topological semimetal TaN caused by a large acoustic-optical gap

Science.gov (United States)

Guo, San-Dong; Liu, Bang-Gui

2018-03-01

Topological semimetals may have potential applications such as in topological qubits, spintronics and quantum computations. Efficient heat dissipation is a key factor for the reliability and stability of topological semimetal-based nano-electronics devices, which is closely related to high thermal conductivity. In this work, the elastic properties and lattice thermal conductivity of TaN are investigated using first-principles calculations and the linearized phonon Boltzmann equation within the single-mode relaxation time approximation. According to the calculated bulk modulus, shear modulus and C 44, TaN can be regarded as a potential incompressible and hard material. The room-temperature lattice thermal conductivity is predicted to be 838.62 W~m-1~K^{-1} along the a axis and 1080.40 W~m-1~K^{-1} along the c axis, showing very strong anisotropy. It is found that the lattice thermal conductivity of TaN is several tens of times higher than other topological semimetals, such as TaAs, MoP and ZrTe, which is due to the very longer phonon lifetimes for TaN than other topological semimetals. The very different atomic masses of Ta and N atoms lead to a very large acoustic-optical band gap, and then prohibit the scattering between acoustic and optical phonon modes, which gives rise to very long phonon lifetimes. Calculated results show that isotope scattering has little effect on lattice thermal conductivity, and that phonons with mean free paths larger than 20 (80) μm along the c direction at 300 K have little contribution to the total lattice thermal conductivity. This work implies that TaN-based nano-electronics devices may be more stable and reliable due to efficient heat dissipation, and motivates further experimental works to study lattice thermal conductivity of TaN.

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

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

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

From lattice BF gauge theory to area-angle Regge calculus

International Nuclear Information System (INIS)

Bonzom, Valentin

2009-01-01

We consider Riemannian 4D BF lattice gauge theory, on a triangulation of spacetime. Introducing the simplicity constraints which turn BF theory into simplicial gravity, some geometric quantities of Regge calculus, areas, and 3D and 4D dihedral angles, are identified. The parallel transport conditions are taken care of to ensure a consistent gluing of simplices. We show that these gluing relations, together with the simplicity constraints, contain the constraints of area-angle Regge calculus in a simple way, via the group structure of the underlying BF gauge theory. This provides a precise road from constrained BF theory to area-angle Regge calculus. Doing so, a framework combining variables of lattice BF theory and Regge calculus is built. The action takes a form a la Regge and includes the contribution of the Immirzi parameter. In the absence of simplicity constraints, the standard spin foam model for BF theory is recovered. Insertions of local observables are investigated, leading to Casimir insertions for areas and reproducing for 3D angles known results obtained through angle operators on spin networks. The present formulation is argued to be suitable for deriving spin foam models from discrete path integrals and to unravel their geometric content.

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

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

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.

Combinatorial algorithms

CERN Document Server

Hu, T C

2002-01-01

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

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)

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

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

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

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

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

Polygonal-path approximations on the path spaces of quantum-mechanical systems: properties of the polygonal paths

International Nuclear Information System (INIS)

Exner, P.; Kolerov, G.I.

1981-01-01

Properties of the subset of polygonal paths in the Hilbert space H of paths referring to a d-dimensional quantum-mechanical system are examined. Using the reproduction kernel technique we prove that each element of H is approximated by polygonal paths uniformly with respect to the ''norm'' of time-interval partitions. This result will be applied in the second part of the present paper to prove consistency of the uniform polygonal-path extension of the Feynman maps [ru

Lattice-Based Revocable Certificateless Signature

Directory of Open Access Journals (Sweden)

Ying-Hao Hung

2017-10-01

Full Text Available Certificateless signatures (CLS are noticeable because they may resolve the key escrow problem in ID-based signatures and break away the management problem regarding certificate in conventional signatures. However, the security of the mostly previous CLS schemes relies on the difficulty of solving discrete logarithm or large integer factorization problems. These two problems would be solved by quantum computers in the future so that the signature schemes based on them will also become insecure. For post-quantum cryptography, lattice-based cryptography is significant due to its efficiency and security. However, no study on addressing the revocation problem in the existing lattice-based CLS schemes is presented. In this paper, we focus on the revocation issue and present the first revocable CLS (RCLS scheme over lattices. Based on the short integer solution (SIS assumption over lattices, the proposed lattice-based RCLS scheme is shown to be existential unforgeability against adaptive chosen message attacks. By performance analysis and comparisons, the proposed lattice-based RCLS scheme is better than the previously proposed lattice-based CLS scheme, in terms of private key size, signature length and the revocation mechanism.

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

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.

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

Structural factoring approach for analyzing stochastic networks

Science.gov (United States)

Hayhurst, Kelly J.; Shier, Douglas R.

1991-01-01

The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

Confinement in dually transformed U(1) lattice gauge theory

International Nuclear Information System (INIS)

Zach, M.

1997-10-01

The aim of this work is a detailed investigation of the confinement mechanism in U(1) lattice gauge theory. In the first chapters we give a review on the definition of compact Abelian gauge theory on space-time lattices, the numerical calculation of physical observables for exploring confinement, and the interpretation of the results in terms of the dual superconductor picture, which is introduced at two levels of description. We work out that the electric field strength and the magnetic currents around a charge pair can be described very well by a classical effective model of Maxwell and London equations, if fluctuations of the occurring fluxoid string are considered. In order to obtain a deeper understanding of confinement in U(1), we extend the duality transformation of the path integral to the correlation functions which are used to calculate expectation values of fields and currents. This not only helps to interpret U(1) lattice gauge theory as a limit of the dual Higgs model, but also opens the possibility for efficient calculations of expectation values in the presence of static charges by simulating the dual model. Using this technique we are able to consider large flux tube lengths, low temperatures, and multiply charged systems without loss of numerical precision. The dual simulation is applied to flux tubes between static charges, to periodically closed flux tubes (torelons), and to doubly charged systems. We find that the behavior of flux tubes for large charge distances cannot be explained by the picture of a classical dual type-II superconductor; the observed roughening of the flux tube agrees very well with the prediction from the effective string description. We also analyze the different contributions to the total energy of the electromagnetic field. For torelons we calculate both the free energy and the total field energy, split the free energy into a string tension and a string fluctuation part, and apply lattice sum rules modified for finite

Hyper-lattice algebraic model for data warehousing

CERN Document Server

Sen, Soumya; Chaki, Nabendu

2016-01-01

This book presents Hyper-lattice, a new algebraic model for partially ordered sets, and an alternative to lattice. The authors analyze some of the shortcomings of conventional lattice structure and propose a novel algebraic structure in the form of Hyper-lattice to overcome problems with lattice. They establish how Hyper-lattice supports dynamic insertion of elements in a partial order set with a partial hierarchy between the set members. The authors present the characteristics and the different properties, showing how propositions and lemmas formalize Hyper-lattice as a new algebraic structure.

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

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

DEFF Research Database (Denmark)

Nooruzzaman, Md; Morioka, Toshio

2017-01-01

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

Optimal improvement of graphs related to nuclear safeguards problems

International Nuclear Information System (INIS)

Jacobsen, S.E.

1977-08-01

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

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

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

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

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.

Zr4+ doping in Li4Ti5O12 anode for lithium-ion batteries: open Li+ diffusion paths through structural imperfection.

Science.gov (United States)

Kim, Jae-Geun; Park, Min-Sik; Hwang, Soo Min; Heo, Yoon-Uk; Liao, Ting; Sun, Ziqi; Park, Jong Hwan; Kim, Ki Jae; Jeong, Goojin; Kim, Young-Jun; Kim, Jung Ho; Dou, Shi Xue

2014-05-01

One-dimensional nanomaterials have short Li(+) diffusion paths and promising structural stability, which results in a long cycle life during Li(+) insertion and extraction processes in lithium rechargeable batteries. In this study, we fabricated one-dimensional spinel Li4Ti5O12 (LTO) nanofibers using an electrospinning technique and studied the Zr(4+) doping effect on the lattice, electronic structure, and resultant electrochemical properties of Li-ion batteries (LIBs). Accommodating a small fraction of Zr(4+) ions in the Ti(4+) sites of the LTO structure gave rise to enhanced LIB performance, which was due to structural distortion through an increase in the average lattice constant and thereby enlarged Li(+) diffusion paths rather than changes to the electronic structure. Insulating ZrO2 nanoparticles present between the LTO grains due to the low Zr(4+) solubility had a negative effect on the Li(+) extraction capacity, however. These results could provide key design elements for LTO anodes based on atomic level insights that can pave the way to an optimal protocol to achieve particular functionalities. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

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

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

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.

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.

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.

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.

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.

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

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)

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.

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

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

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

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.

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.

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

On the performance of 1-level LDPC lattices

OpenAIRE

Sadeghi, Mohammad-Reza; Sakzad, Amin

2013-01-01

The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices constructed based on Construction A and low-density lattice-code (LDLC) lattices. In spite of having slightly lower coding gain, 1-level regular LDPC lattices have remarkable performances. The lower complexity nature of the decoding algorithm for these type ...

Lattice Boltzmann methods for complex micro-flows: applicability and limitations for practical applications

Energy Technology Data Exchange (ETDEWEB)

Suga, K, E-mail: suga@me.osakafu-u.ac.jp [Department of Mechanical Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Naka-ku, Sakai, Osaka 599-8531 (Japan)

2013-06-15

The extensive evaluation studies of the lattice Boltzmann method for micro-scale flows ({mu}-flow LBM) by the author's group are summarized. For the two-dimensional test cases, force-driven Poiseuille flows, Couette flows, a combined nanochannel flow, and flows in a nanochannel with a square- or triangular cylinder are discussed. The three-dimensional (3D) test cases are nano-mesh flows and a flow between 3D bumpy walls. The reference data for the complex test flow geometries are from the molecular dynamics simulations of the Lennard-Jones fluid by the author's group. The focused flows are mainly in the slip and a part of the transitional flow regimes at Kn < 1. The evaluated schemes of the {mu}-flow LBMs are the lattice Bhatnagar-Gross-Krook and the multiple-relaxation time LBMs with several boundary conditions and discrete velocity models. The effects of the discrete velocity models, the wall boundary conditions, the near-wall correction models of the molecular mean free path and the regularization process are discussed to confirm the applicability and the limitations of the {mu}-flow LBMs for complex flow geometries. (invited review)

Lattice Boltzmann methods for complex micro-flows: applicability and limitations for practical applications

International Nuclear Information System (INIS)

Suga, K

2013-01-01

The extensive evaluation studies of the lattice Boltzmann method for micro-scale flows (μ-flow LBM) by the author's group are summarized. For the two-dimensional test cases, force-driven Poiseuille flows, Couette flows, a combined nanochannel flow, and flows in a nanochannel with a square- or triangular cylinder are discussed. The three-dimensional (3D) test cases are nano-mesh flows and a flow between 3D bumpy walls. The reference data for the complex test flow geometries are from the molecular dynamics simulations of the Lennard-Jones fluid by the author's group. The focused flows are mainly in the slip and a part of the transitional flow regimes at Kn < 1. The evaluated schemes of the μ-flow LBMs are the lattice Bhatnagar–Gross–Krook and the multiple-relaxation time LBMs with several boundary conditions and discrete velocity models. The effects of the discrete velocity models, the wall boundary conditions, the near-wall correction models of the molecular mean free path and the regularization process are discussed to confirm the applicability and the limitations of the μ-flow LBMs for complex flow geometries. (invited review)

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…

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

Two-dimensional simulation of intermediate-sized bubbles in low viscous liquids using counter diffusion lattice Boltzmann method

Energy Technology Data Exchange (ETDEWEB)

Ryu, Seungyeob, E-mail: syryu@kaeri.re.kr [Korea Atomic Energy Research Institute (KAERI), 1045 Daeduk-daero, Yuseong-gu, Daejeon 305-353 (Korea, Republic of); Kim, Youngin; Kang, Hanok; Kim, Keung Koo [Korea Atomic Energy Research Institute (KAERI), 1045 Daeduk-daero, Yuseong-gu, Daejeon 305-353 (Korea, Republic of); Ko, Sungho, E-mail: sunghoko@cnu.ac.kr [Department of Mechanical Design Engineering, Chungnam National University, 220 Gung-dong, Yuseong-gu, Daejeon 305-764 (Korea, Republic of)

2016-08-15

Highlights: • We directly simulate intermediate-sized bubbles in low viscous liquids. • The path instability and shape oscillation can be successfully simulated. • The motion of a pair bubble and bubble swarm is presented. • Bubbles with high-Reynolds-number can be simulated with under-resolved grids. • The counter diffusion multiphase method is feasible for the direct simulation of bubbly flows. - Abstract: The counter diffusion lattice Boltzmann method (LBM) is used to simulate intermediate-sized bubbles in low viscous liquids. Bubbles at high Reynolds numbers ranging from hundreds to thousands are simulated successfully, which cannot be done for the existing LBM versions. The characteristics of the path instability of two rising bubbles are studied for a wide range of Eotvos and Morton numbers. Finally, the study presented how bubble swarms move within the flow and how the flow surrounding the bubbles is affected by the bubble motions.

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)

On the evolution and modelling of lattice strains during the cyclic loading of TWIP steel

International Nuclear Information System (INIS)

Saleh, Ahmed A.; Pereloma, Elena V.; Clausen, Bjørn; Brown, Donald W.; Tomé, Carlos N.; Gazder, Azdiar A.

2013-01-01

The evolution of lattice strains in fully annealed Fe–24Mn–3Al–2Si–1Ni–0.06C twinning-induced plasticity (TWIP) steel is investigated via in situ neutron diffraction during cyclic (tension–compression) loading between strain limits of ±1%. The pronounced Bauschinger effect observed upon load reversal is accounted for by a combination of the intergranular residual stresses and the intragranular sources of back stress, such as dislocation pile-ups at the intersection of stacking faults. The recently modified elasto-plastic self-consistent (EPSC) model which empirically accounts for both intergranular and intragranular back stresses has been successfully used to simulate the macroscopic stress–strain response and the evolution of the lattice strains. The EPSC model captures the experimentally observed tension–compression asymmetry as it accounts for the directionality of twinning as well as Schmid factor considerations. For the strain limits used in this study, the EPSC model also predicts that the lower flow stress on reverse shear loading reported in earlier Bauschinger-type experiments on TWIP steel is a geometrical or loading path effect

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

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.

Slip-flow in complex porous media as determined by a multi-relaxation-time lattice Boltzmann model

Science.gov (United States)

Landry, C. J.; Prodanovic, M.; Eichhubl, P.

2014-12-01

The pores and throats of shales and mudrocks are predominantly found within a range of 1-100 nm, within this size range the flow of gas at reservoir conditions will fall within the slip-flow and low transition-flow regime (0.001 clays). Molecular dynamics (MD) simulations can be used to predict slip-flow in complex geometries, but due to prohibitive computational demand are generally limited to small volumes (one to several pores). Here we present a multi-relaxation-time lattice Boltzmann model (LBM) parameterized for slip-flow (Guo et al. 2008) and adapted here to complex geometries. LBMs are inherently parallelizable, such that flow in complex geometries of significant (near REV-scale) volumes can be readily simulated at a fraction of the computational cost of MD simulations. At the macroscopic-scale the LBM is parameterized with local effective viscosities at each node to capture the variance of the mean-free-path of gas molecules in a bounded system. The corrected mean-free-path for each lattice node is determined using the mean distance of the node to the pore-wall and Stop's correction for mean-free-paths in an infinite parallel-plate geometry. At the microscopic-scale, a combined bounce-back specular-reflection boundary condition is applied to the pore-wall nodes to capture Maxwellian-slip. The LBM simulation results are first validated in simple tube and channel geometries, where good agreement is found for Knudsen numbers below 0.1, and fair agreement is found for Knudsen numbers between 0.1 and 0.5. More complex geometries are then examined including triangular-ducts and ellipsoid-ducts, both with constant and tapering/expanding cross-sections, as well as a clay pore-network imaged from a hydrocarbon producing shale by sequential focused ion-beam scanning electron microscopy. These results are analyzed to determine grid-independent resolutions, and used to explore the relationship between effective permeability and Knudsen number in complex geometries.

Graph reconstruction with a betweenness oracle

DEFF Research Database (Denmark)

Abrahamsen, Mikkel; Bodwin, Greg; Rotenberg, Eva

2016-01-01

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

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

Galilean invariant lattice Boltzmann scheme for natural convection on square and rectangular lattices

NARCIS (Netherlands)

Sman, van der R.G.M.

2006-01-01

In this paper we present lattice Boltzmann (LB) schemes for convection diffusion coupled to fluid flow on two-dimensional rectangular lattices. Via inverse Chapman-Enskog analysis of LB schemes including source terms, we show that for consistency with physics it is required that the moments of the

On the relationship between two popular lattice models for polymer melts

Science.gov (United States)

Subramanian, Gopinath; Shanbhag, Sachin

2008-10-01

A mapping between two well known lattice bond-fluctuation models for polymers [I. Carmesin and K. Kremer, Macromolecules 21, 2819 (1988); J. S. Shaffer, J. Chem. Phys. 101, 4205 (1994)] is investigated by performing primitive path analysis to identify the average number of monomers per entanglement. Simulations conducted using both models, and previously published data are compared in an attempt to establish relationships between molecular weight, lengthscale, and timescale. Using these relationships, an examination of the self-diffusion coefficient yields excellent agreement not only between the two models, but also with experimental data on polystyrene, polybutadiene, and polydimethylsiloxane. However, it is shown that even with the limited set of criteria examined in this paper, a true mapping between these two models is elusive. Nevertheless, a practical guide to convert between models is provided.

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

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

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

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

Path Creation, Path Dependence and Breaking Away from the Path: Re-Examining the Case of Nokia

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

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

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

On the hierarchical lattices approximation of Bravais lattices: Specific heat and correlation length

International Nuclear Information System (INIS)

Tsallis, C.

1984-01-01

Certain types of real-space renormalization groups (which essentially approximate Bravais lattices through hierarchical ones) do not preserve standard thermodynamic convexity properties. It is pointed out that this serious defect is not intrinsic to any real-space renormalization. It can be avoided if form-invariance (under uniform translation of the energy scale) of the equation connecting the Bravais lattice (which is intended to study) to the hierarchical one (which approximates it) is demanded. In addition to that expressions for the critical exponentes ν and α corresponding to hierarchical lattices are analysed; these are consistent with Melrose recent analysis of the fractal intrinsic dimensionality. (Author) [pt

Non-equibiaxial deformation of W/Cu nanocomposite thin films on stretchable substrate: Effect of loading path

Energy Technology Data Exchange (ETDEWEB)

Renault, Pierre-Olivier, E-mail: pierre.olivier.renault@univ-poitiers.fr [Institut Pprime, CNRS-Université de Poitiers, Bd Marie et Pierre Curie, 86962 Futuroscope (France); Le Bourhis, Eric; Goudeau, Philippe [Institut Pprime, CNRS-Université de Poitiers, Bd Marie et Pierre Curie, 86962 Futuroscope (France); Thiaudière, Dominique [Synchrotron SOLEIL, L' Orme des Merisiers, 91192 Gif sur Yvette (France); Faurie, Damien [LSPM, CNRS-Université Paris13, 93430 Villetaneuse (France)

2013-12-31

In situ biaxial tensile tests were carried out on W/Cu nanocomposite thin films deposited on a polyimide cruciform substrate. A biaxial testing machine developed on the DiffAbs beamline at the French SOLEIL synchrotron allows for scrutinizing the mechanical behaviour of crystalline thin films at the micro-scale and the macro-scale using simultaneously synchrotron X-ray diffraction and digital image correlation techniques. Both strain analyses have been performed for two controlled non-equibiaxial loading paths: loading ratios of 0.8 and 0.33. The mechanical response is analysed and compared for the two loading ratios. - Highlights: • Non-equibiaxial tensile tests are performed on metallic film-substrate composite. • Two different loading paths have been performed. • Applied strains are measured in situ by X-ray diffraction and image correlation. • Lattice strain and elastic stress–true strain curves are plotted. • The different mechanical behaviours in the two directions of applied load are revealed.

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

Path integral methods for primordial density perturbations - sampling of constrained Gaussian random fields

International Nuclear Information System (INIS)

Bertschinger, E.

1987-01-01

Path integrals may be used to describe the statistical properties of a random field such as the primordial density perturbation field. In this framework the probability distribution is given for a Gaussian random field subjected to constraints such as the presence of a protovoid or supercluster at a specific location in the initial conditions. An algorithm has been constructed for generating samples of a constrained Gaussian random field on a lattice using Monte Carlo techniques. The method makes possible a systematic study of the density field around peaks or other constrained regions in the biased galaxy formation scenario, and it is effective for generating initial conditions for N-body simulations with rare objects in the computational volume. 21 references

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

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.

Symmetry of semi-reduced lattices.

Science.gov (United States)

Stróż, Kazimierz

2015-05-01

The main result of this work is extension of the famous characterization of Bravais lattices according to their metrical, algebraic and geometric properties onto a wide class of primitive lattices (including Buerger-reduced, nearly Buerger-reduced and a substantial part of Delaunay-reduced) related to low-restricted semi-reduced descriptions (s.r.d.'s). While the `geometric' operations in Bravais lattices map the basis vectors into themselves, the `arithmetic' operators in s.r.d. transform the basis vectors into cell vectors (basis vectors, face or space diagonals) and are represented by matrices from the set {\\bb V} of all 960 matrices with the determinant ±1 and elements {0, ±1} of the matrix powers. A lattice is in s.r.d. if the moduli of off-diagonal elements in both the metric tensors M and M(-1) are smaller than corresponding diagonal elements sharing the same column or row. Such lattices are split into 379 s.r.d. types relative to the arithmetic holohedries. Metrical criteria for each type do not need to be explicitly given but may be modelled as linear derivatives {\\bb M}(p,q,r), where {\\bb M} denotes the set of 39 highest-symmetry metric tensors, and p,q,r describe changes of appropriate interplanar distances. A sole filtering of {\\bb V} according to an experimental s.r.d. metric and subsequent geometric interpretation of the filtered matrices lead to mathematically stable and rich information on the Bravais-lattice symmetry and deviations from the exact symmetry. The emphasis on the crystallographic features of lattices was obtained by shifting the focus (i) from analysis of a lattice metric to analysis of symmetry matrices [Himes & Mighell (1987). Acta Cryst. A43, 375-384], (ii) from the isometric approach and invariant subspaces to the orthogonality concept {some ideas in Le Page [J. Appl. Cryst. (1982), 15, 255-259]} and splitting indices [Stróż (2011). Acta Cryst. A67, 421-429] and (iii) from fixed cell transformations to transformations

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

Program LATTICE for Calculation of Parameters of Targets with Heterogeneous (Lattice) Structure

CERN Document Server

Bznuni, S A; Soloviev, A G; Sosnin, A N

2002-01-01

Program LATTICE, with which help it is possible to describe lattice structure for the program complex CASCAD, is created in the C++ language. It is shown that for model-based electronuclear system on a basis of molten salt reactor with graphite moderator at transition from homogeneous structure to heterogeneous at preservation of a chemical compound there is a growth of k_{eff} by approximately 6 %.

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

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)

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

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

Lattice degeneration of the retina and retinal detachment.

Science.gov (United States)

Semes, L P

1992-01-01

Lattice retinal degeneration is considered the most significant peripheral retinal disorder potentially predisposing to retinal breaks and retinal detachment. Lattice degeneration affects the vitreous and inner retinal layers with secondary changes as deep as the retinal pigment epithelium and perhaps the choriocapillaris. Variations in clinical appearance are the rule; geographically, lattice lesions favor the vertical meridians between the equator and the ora serrata. Lattice degeneration begins early in life and has been reported in sequential generations of the same family. Along with its customary bilateral occurrence, lattice shares other characteristics of a dystrophy. The association between the vitreous and retina in lattice lesions may be responsible for the majority of lattice-induced retinal detachments. The tumultuous event of posterior vitreous separation in the presence of abnormally strong vitreoretinal adherence is the trigger for a retinal tear that, in turn, may lead to retinal detachment. Although retinal holes in young patients with lattice degeneration may play a role in the evolution of retinal detachment, the clinical course of lattice degeneration seems to be one of dormancy rather than of progressive change. This discussion outlines the pathophysiology of lattice retinal degeneration and the relationship of pathophysiology to clinical presentation. The epidemiology of lattice degeneration is summarized, as are the possible precursors to retinal detachment. A clinical characterization of the natural history of lattice degeneration is offered, and interventions for complications are described. To conclude, management strategies from a primary-care standpoint are reviewed.

Comparing the results of lattice and off-lattice simulations for the melt of nonconcatenated rings

International Nuclear Information System (INIS)

Halverson, Jonathan D; Kremer, Kurt; Grosberg, Alexander Y

2013-01-01

To study the conformational properties of unknotted and nonconcatenated ring polymers in the melt, we present a detailed qualitative and quantitative comparison of simulation data obtained by molecular dynamics simulation using an off-lattice bead-spring model and by Monte Carlo simulation using a lattice model. We observe excellent, and sometimes even unexpectedly good, agreement between the off-lattice and lattice results for many quantities measured including the gyration radii of the ring polymers, gyration radii of their subchains, contact probabilities, surface characteristics, number of contacts between subchains, and the static structure factors of the rings and their subchains. These results are, in part, put in contrast to Moore curves, and the open, linear polymer counterparts. While our analysis is extensive, our understanding of the ring melt conformations is still rather preliminary. (paper)

Discrete Lattice effect of various forcing methods of body force on immersed Boundary-Lattice Boltzmann method

Energy Technology Data Exchange (ETDEWEB)

Son, Sung Wan; Ha, Man Yeong; Yoon, Hyun Sik [Pusan National University, Busan (Korea, Republic of); Jeong, Hae Kwon [POSCO, Pohang (Korea, Republic of); Balachandar, S. [University of Florida, Florida (United States)

2013-02-15

We investigate the discrete lattice effect of various forcing methods in the lattice Boltzmann method (LBM) to include the body force obtained from the immersed boundary method (IBM). In the immersed boundary lattice Boltzmann method (IB-LBM), the LBM needs a forcing method to involve the body force on a forcing point near the immersed boundary that is calculated by IBM. The proper forcing method in LBM is derived to include the body force, which appears to resolve problems such as multiphase flow, non-ideal gas behavior, etc. Many researchers have adopted different forcing methods in LBM to involve the body force from IBM, even when they solved similar problems. However, it is necessary to evaluate the discrete lattice effect, which originates from different forcing methods in LBM, to include the effect of the body force from IBM on the results. Consequently, in this study, a rigorous analysis of the discrete lattice effect for different forcing methods in IB-LBM is performed by solving various problems.

Discrete Lattice effect of various forcing methods of body force on immersed Boundary-Lattice Boltzmann method

International Nuclear Information System (INIS)

Son, Sung Wan; Ha, Man Yeong; Yoon, Hyun Sik; Jeong, Hae Kwon; Balachandar, S.

2013-01-01

We investigate the discrete lattice effect of various forcing methods in the lattice Boltzmann method (LBM) to include the body force obtained from the immersed boundary method (IBM). In the immersed boundary lattice Boltzmann method (IB-LBM), the LBM needs a forcing method to involve the body force on a forcing point near the immersed boundary that is calculated by IBM. The proper forcing method in LBM is derived to include the body force, which appears to resolve problems such as multiphase flow, non-ideal gas behavior, etc. Many researchers have adopted different forcing methods in LBM to involve the body force from IBM, even when they solved similar problems. However, it is necessary to evaluate the discrete lattice effect, which originates from different forcing methods in LBM, to include the effect of the body force from IBM on the results. Consequently, in this study, a rigorous analysis of the discrete lattice effect for different forcing methods in IB-LBM is performed by solving various problems.

EPRI-LATTICE: a multigroup neutron transport code for light water reactor lattice physics calculations

International Nuclear Information System (INIS)

Jones, D.B.

1986-01-01

EPRI-LATTICE is a multigroup neutron transport computer code for the analysis of light water reactor fuel assemblies. It can solve the two-dimensional neutron transport problem by two distinct methods: (a) the method of collision probabilities and (b) the method of discrete ordinates. The code was developed by S. Levy Inc. as an account of work sponsored by the Electric Power Research Institute (EPRI). The collision probabilities calculation in EPRI-LATTICE (L-CP) is based on the same methodology that exists in the lattice codes CPM-2 and EPRI-CPM. Certain extensions have been made to the data representations of the CPM programs to improve the overall accuracy of the calculation. The important extensions include unique representations of scattering matrices and fission fractions (chi) for each composition in the problem. A new capability specifically developed for the EPRI-LATTICE code is a discrete ordinates methodology. The discrete ordinates calculation in EPRI-LATTICE (L-SN) is based on the discrete S/sub n/ methodology that exists in the TWODANT program. In contrast to TWODANT, which utilizes synthetic diffusion acceleration and supports multiple geometries, only the transport equations are solved by L-SN and only the data representations for the two-dimensional geometry are treated

Commensurability effects in holographic homogeneous lattices

International Nuclear Information System (INIS)

Andrade, Tomas; Krikun, Alexander

2016-01-01

An interesting application of the gauge/gravity duality to condensed matter physics is the description of a lattice via breaking translational invariance on the gravity side. By making use of global symmetries, it is possible to do so without scarifying homogeneity of the pertinent bulk solutions, which we thus term as “homogeneous holographic lattices.' Due to their technical simplicity, these configurations have received a great deal of attention in the last few years and have been shown to correctly describe momentum relaxation and hence (finite) DC conductivities. However, it is not clear whether they are able to capture other lattice effects which are of interest in condensed matter. In this paper we investigate this question focusing our attention on the phenomenon of commensurability, which arises when the lattice scale is tuned to be equal to (an integer multiple of) another momentum scale in the system. We do so by studying the formation of spatially modulated phases in various models of homogeneous holographic lattices. Our results indicate that the onset of the instability is controlled by the near horizon geometry, which for insulating solutions does carry information about the lattice. However, we observe no sharp connection between the characteristic momentum of the broken phase and the lattice pitch, which calls into question the applicability of these models to the physics of commensurability.

MinePath: Mining for Phenotype Differential Sub-paths in Molecular Pathways

Science.gov (United States)

Koumakis, Lefteris; Kartsaki, Evgenia; Chatzimina, Maria; Zervakis, Michalis; Vassou, Despoina; Marias, Kostas; Moustakis, Vassilis; Potamias, George

2016-01-01

Pathway analysis methodologies couple traditional gene expression analysis with knowledge encoded in established molecular pathway networks, offering a promising approach towards the biological interpretation of phenotype differentiating genes. Early pathway analysis methodologies, named as gene set analysis (GSA), view pathways just as plain lists of genes without taking into account either the underlying pathway network topology or the involved gene regulatory relations. These approaches, even if they achieve computational efficiency and simplicity, consider pathways that involve the same genes as equivalent in terms of their gene enrichment characteristics. Most recent pathway analysis approaches take into account the underlying gene regulatory relations by examining their consistency with gene expression profiles and computing a score for each profile. Even with this approach, assessing and scoring single-relations limits the ability to reveal key gene regulation mechanisms hidden in longer pathway sub-paths. We introduce MinePath, a pathway analysis methodology that addresses and overcomes the aforementioned problems. MinePath facilitates the decomposition of pathways into their constituent sub-paths. Decomposition leads to the transformation of single-relations to complex regulation sub-paths. Regulation sub-paths are then matched with gene expression sample profiles in order to evaluate their functional status and to assess phenotype differential power. Assessment of differential power supports the identification of the most discriminant profiles. In addition, MinePath assess the significance of the pathways as a whole, ranking them by their p-values. Comparison results with state-of-the-art pathway analysis systems are indicative for the soundness and reliability of the MinePath approach. In contrast with many pathway analysis tools, MinePath is a web-based system (www.minepath.org) offering dynamic and rich pathway visualization functionality, with the

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

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

More on random-lattice fermions

International Nuclear Information System (INIS)

Kieu, T.D.; Institute for Advanced Study, Princeton, NJ; Markham, J.F.; Paranavitane, C.B.

1995-01-01

The lattice fermion determinants, in a given background gauge field, are evaluated for two different kinds of random lattices and compared to those of naive and wilson fermions in the continuum limit. While the fermion doubling is confirmed on one kind of lattices, there is positive evidence that it may be absent for the other, at least for vector interactions in two dimensions. Combined with previous studies, arbitrary randomness by itself is shown to be not a sufficient condition to remove the fermion doublers. 8 refs., 3 figs

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

LATTICE/hor ellipsis/a beam transport program

International Nuclear Information System (INIS)

Staples, J.

1987-06-01

LATTICE is a computer program that calculates the first order characteristics of synchrotrons and beam transport systems. The program uses matrix algebra to calculate the propagation of the betatron (Twiss) parameters along a beam line. The program draws on ideas from several older programs, notably Transport and Synch, adds many new ones and incorporates them into an interactive, user-friendly program. LATTICE will calculate the matched functions of a synchrotron lattice and display them in a number of ways, including a high resolution Tektronix graphics display. An optimizer is included to adjust selected element parameters so the beam meets a set of constraints. LATTICE is a first order program, but the effect of sextupoles on the chromaticity of a synchrotron lattice is included, and the optimizer will set the sextupole strengths for zero chromaticity. The program will also calculate the characteristics of beam transport systems. In this mode, the beam parameters, defined at the start of the transport line, are propagated through to the end. LATTICE has two distinct modes: the lattice mode which finds the matched functions of a synchrotron, and the transport mode which propagates a predefined beam through a beam line. However, each mode can be used for either type of problem: the transport mode may be used to calculate an insertion for a synchrotron lattice, and the lattice mode may be used to calculate the characteristics of a long periodic beam transport system

Manipulation and quantification of microtubule lattice integrity

Directory of Open Access Journals (Sweden)

Taylor A. Reid

2017-08-01

Full Text Available Microtubules are structural polymers that participate in a wide range of cellular functions. The addition and loss of tubulin subunits allows the microtubule to grow and shorten, as well as to develop and repair defects and gaps in its cylindrical lattice. These lattice defects act to modulate the interactions of microtubules with molecular motors and other microtubule-associated proteins. Therefore, tools to control and measure microtubule lattice structure will be invaluable for developing a quantitative understanding of how the structural state of the microtubule lattice may regulate its interactions with other proteins. In this work, we manipulated the lattice integrity of in vitro microtubules to create pools of microtubules with common nucleotide states, but with variations in structural states. We then developed a series of novel semi-automated analysis tools for both fluorescence and electron microscopy experiments to quantify the type and severity of alterations in microtubule lattice integrity. These techniques will enable new investigations that explore the role of microtubule lattice structure in interactions with microtubule-associated proteins.

3D Metallic Lattices for Accelerator Applications

CERN Document Server

Shapiro, Michael A; Sirigiri, Jagadishwar R; Temkin, Richard J

2005-01-01

We present the results of research on 3D metallic lattices operating at microwave frequencies for application in (1) accelerator structures with higher order mode suppression, (2) Smith-Purcell radiation beam diagnostics, and (3) polaritonic materials for laser acceleration. Electromagnetic waves in a 3D simple cubic lattice formed by metal wires are calculated using HFSS. The bulk modes in the lattice are determined using single cell calculations with different phase advances in all three directions. The Brillouin diagram for the bulk modes is presented and indicates the absence of band gaps in simple lattices except the band below the cutoff. Lattices with thin wires as well as with thick wires have been analyzed. The Brillouin diagram also indicates the presence of low frequency 3D plasmon mode as well as the two degenerate photon modes analogous to those in a 2D lattice. Surface modes for a semi-infinite cubic lattice are modeled as a stack of cells with different phase advances in the two directions alon...

Strong dynamics and lattice gauge theory

Science.gov (United States)

Schaich, David

In this dissertation I use lattice gauge theory to study models of electroweak symmetry breaking that involve new strong dynamics. Electroweak symmetry breaking (EWSB) is the process by which elementary particles acquire mass. First proposed in the 1960s, this process has been clearly established by experiments, and can now be considered a law of nature. However, the physics underlying EWSB is still unknown, and understanding it remains a central challenge in particle physics today. A natural possibility is that EWSB is driven by the dynamics of some new, strongly-interacting force. Strong interactions invalidate the standard analytical approach of perturbation theory, making these models difficult to study. Lattice gauge theory is the premier method for obtaining quantitatively-reliable, nonperturbative predictions from strongly-interacting theories. In this approach, we replace spacetime by a regular, finite grid of discrete sites connected by links. The fields and interactions described by the theory are likewise discretized, and defined on the lattice so that we recover the original theory in continuous spacetime on an infinitely large lattice with sites infinitesimally close together. The finite number of degrees of freedom in the discretized system lets us simulate the lattice theory using high-performance computing. Lattice gauge theory has long been applied to quantum chromodynamics, the theory of strong nuclear interactions. Using lattice gauge theory to study dynamical EWSB, as I do in this dissertation, is a new and exciting application of these methods. Of particular interest is non-perturbative lattice calculation of the electroweak S parameter. Experimentally S ≈ -0.15(10), which tightly constrains dynamical EWSB. On the lattice, I extract S from the momentum-dependence of vector and axial-vector current correlators. I created and applied computer programs to calculate these correlators and analyze them to determine S. I also calculated the masses

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)

Elucidating the electron transport in semiconductors via Monte Carlo simulations: an inquiry-driven learning path for engineering undergraduates

International Nuclear Information System (INIS)

Adorno, Dominique Persano; Pizzolato, Nicola; Fazio, Claudio

2015-01-01

Within the context of higher education for science or engineering undergraduates, we present an inquiry-driven learning path aimed at developing a more meaningful conceptual understanding of the electron dynamics in semiconductors in the presence of applied electric fields. The electron transport in a nondegenerate n-type indium phosphide bulk semiconductor is modelled using a multivalley Monte Carlo approach. The main characteristics of the electron dynamics are explored under different values of the driving electric field, lattice temperature and impurity density. Simulation results are presented by following a question-driven path of exploration, starting from the validation of the model and moving up to reasoned inquiries about the observed characteristics of electron dynamics. Our inquiry-driven learning path, based on numerical simulations, represents a viable example of how to integrate a traditional lecture-based teaching approach with effective learning strategies, providing science or engineering undergraduates with practical opportunities to enhance their comprehension of the physics governing the electron dynamics in semiconductors. Finally, we present a general discussion about the advantages and disadvantages of using an inquiry-based teaching approach within a learning environment based on semiconductor simulations. (paper)

Elucidating the electron transport in semiconductors via Monte Carlo simulations: an inquiry-driven learning path for engineering undergraduates

Science.gov (United States)

Persano Adorno, Dominique; Pizzolato, Nicola; Fazio, Claudio

2015-09-01

Within the context of higher education for science or engineering undergraduates, we present an inquiry-driven learning path aimed at developing a more meaningful conceptual understanding of the electron dynamics in semiconductors in the presence of applied electric fields. The electron transport in a nondegenerate n-type indium phosphide bulk semiconductor is modelled using a multivalley Monte Carlo approach. The main characteristics of the electron dynamics are explored under different values of the driving electric field, lattice temperature and impurity density. Simulation results are presented by following a question-driven path of exploration, starting from the validation of the model and moving up to reasoned inquiries about the observed characteristics of electron dynamics. Our inquiry-driven learning path, based on numerical simulations, represents a viable example of how to integrate a traditional lecture-based teaching approach with effective learning strategies, providing science or engineering undergraduates with practical opportunities to enhance their comprehension of the physics governing the electron dynamics in semiconductors. Finally, we present a general discussion about the advantages and disadvantages of using an inquiry-based teaching approach within a learning environment based on semiconductor simulations.

Vitreous in lattice degeneration of retina.

Science.gov (United States)

Foos, R Y; Simons, K B

1984-05-01

A localized pocket of missing vitreous invariably overlies lattice degeneration of the retina. Subjects with lattice also have a higher rate of rhegmatogenous retinal detachment, which is usually a complication of retinal tears. The latter are in turn a result of alterations in the central vitreous--that is, synchysis senilis leading to posterior vitreous detachment. In order to determine if there is either an association or a deleterious interaction between the local and central lesions of the vitreous in eyes with lattice, a comparison was made in autopsy eyes with and without lattice the degree of synchysis and rate of vitreous detachment. Results show no association between the local and central vitreous lesions, indicating that a higher rate of vitreous detachment is not the basis for the higher rate of retinal detachment in eyes with lattice. Also, there was no suggestion of deleterious interaction between the local and central vitreous lesions, either through vitreodonesis as a basis for precocious vitreous detachment, or through a greater degree of synchysis as a basis for interconnection of local and central lacunae (which could extend the localized retinal detachment in eyes with holes in lattice degeneration).

END FIELD EFFECTS IN BEND ONLY COOLING LATTICES

International Nuclear Information System (INIS)

BEERG, J.S.; KIRK, H.; GARREN, A.

2003-01-01

Cooling lattices consisting only of bends (using either rotated pole faces or gradient dipoles to achieve focusing) often require large apertures and short magnets. One expects the effect of end fields to be significant in this case. In this paper we explore the effect of adding end fields to a working lattice design that originally lacked them. The paper describes the process of correcting the lattice design for the added end fields so as to maintain desirable lattice characteristics. It then compares the properties of the lattice with end fields relative to the lattice without them

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

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.

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.

APS-U LATTICE DESIGN FOR OFF-AXIS ACCUMULATION

Energy Technology Data Exchange (ETDEWEB)

Sun, Yipeng; Borland, M.; Lindberg, R.; Sajaev, V.

2017-06-25

A 67-pm hybrid-seven-bend achromat (H7BA) lattice is being proposed for a future Advanced Photon Source (APS) multi-bend-achromat (MBA) upgrade project. This lattice design pushes for smaller emittance and requires use of a swap-out (on-axis) injection scheme due to limited dynamic acceptance. Alternate lattice design work has also been performed for the APS upgrade to achieve better beam dynamics performance than the nominal APS MBA lattice, in order to allow off-axis accumulation. Two such alternate H7BA lattice designs, which target a still-low emittance of 90 pm, are discussed in detail in this paper. Although the single-particle-dynamics performance is good, simulations of collective effects indicate that surprising difficulty would be expected accumulating high single-bunch charge in this lattice. The brightness of the 90-pm lattice is also a factor of two lower than the 67-pm H7BA lattice.

Report of the workshop on realistic SSC lattices

International Nuclear Information System (INIS)

1985-10-01

A workshop was held at the SSC Central Design Group from May 29 to June 4, 1985, on topics relating to the lattice of the SSC. The workshop marked a shift of emphasis from the investigation of simplified test lattices to the development of a realistic lattice suitable for the conceptual design report. The first day of the workshop was taken up by reviews of accelerator system requirements, of the reference design solutions for these requirements, of lattice work following the reference design, and of plans for the workshop. The work was divided among four working groups. The first, chaired by David Douglas, concerned the arcs of regular cells. The second group, which studied the utility insertions, was chaired by Beat Leemann. The third group, under David E. Johnson, concerned itself with the experimental insertions, dispersion suppressors, and phase trombones. The fourth group, responsible for global lattice considerations and the design of a new realistic lattice example, was led by Ernest Courant. The papers resulting from this workshop are roughly divided into three sets: those relating to specific lattice components, to complete lattices, and to other topics. Among the salient accomplishments of the workshop were additions to and optimization of lattice components, especially those relating to lattices using 1-in-1 magnets, either horizontally or vertically separated, and the design of complete lattice examples. Selected papers are indexed separately for inclusion in the Energy Science and Technology Database

Theoretical model of the probability of fusion between deuterons within deformed lattices with microcracks at room temperature

International Nuclear Information System (INIS)

Frisone, Fulvio

2006-01-01

In this work we wish to demonstrate that a reaction path as the following dislocations, deformations due to thermodynamic stress and, finally, microcrack occurrence, can enhance the process of fusion of the deuterons introduced into the lattice by deuterium loading (F. Frisone, Can variations in temperature influence deuteron interaction within crystalline lattices?, Nuovo Cimento D, 18, 1279 (1996)). In fact, calculating the rate of deuteron-plasmon-deuteron fusion within a microcrack, showed, together with an enhancement of the tunneling effect, an increase of at least 2 - 3 orders of magnitude compared to the probability of fusion on the no deformed lattice. In fact, strong electric fields can take place in the microcrack and the deuterons are accelerated to the energy which is enough for the D-D tunnelling (M. Rabinowitz, High temperature superconductivity and cold fusion, Mod. Phys, Lett. B, 4, 233 (1990); J. Price Hirt and J. Lothe, Theory of Dislocation (McGraw Hill); Z. Phys., 457, 156 (1960)). These phenomena open the way to the theoretical hypothesis that a kind of chain reaction, catalyzed by the microcracks produced in the structure as a result of deuterium loading, can favour tho process of deuteron-plasmon fusion (N. W. Ashcroft and N. D. Mermin (Eds.), Solid State Physics, Chapter 25 (Saunders College, Philadelphia, 1972, pp. 492-509)

Graphs and matroids weighted in a bounded incline algebra.

Science.gov (United States)

Lu, Ling-Xia; Zhang, Bei

2014-01-01

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

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

International Nuclear Information System (INIS)

Huang, Wei; Chow, Tommy W S

2010-01-01

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

Coupled matter-wave solitons in optical lattices

Science.gov (United States)

Golam Ali, Sk; Talukdar, B.

2009-06-01

We make use of a potential model to study the dynamics of two coupled matter-wave or Bose-Einstein condensate (BEC) solitons loaded in optical lattices. With separate attention to linear and nonlinear lattices we find some remarkable differences for response of the system to effects of these lattices. As opposed to the case of linear optical lattice (LOL), the nonlinear lattice (NOL) can be used to control the mutual interaction between the two solitons. For a given lattice wave number k, the effective potentials in which the two solitons move are such that the well (Veff(NOL)), resulting from the juxtaposition of soliton interaction and nonlinear lattice potential, is deeper than the corresponding well Veff(LOL). But these effective potentials have opposite k dependence in the sense that the depth of Veff(LOL) increases as k increases and that of Veff(NOL) decreases for higher k values. We verify that the effectiveness of optical lattices to regulate the motion of the coupled solitons depends sensitively on the initial locations of the motionless solitons as well as values of the lattice wave number. For both LOL and NOL the two solitons meet each other due to mutual interaction if their initial locations are taken within the potential wells with the difference that the solitons in the NOL approach each other rather rapidly and take roughly half the time to meet as compared with the time needed for such coalescence in the LOL. In the NOL, the soliton profiles can move freely and respond to the lattice periodicity when the separation between their initial locations are as twice as that needed for a similar free movement in the LOL. We observe that, in both cases, slow tuning of the optical lattices by varying k with respect to a time parameter τ drags the oscillatory solitons apart to take them to different locations. In our potential model the oscillatory solitons appear to propagate undistorted. But a fully numerical calculation indicates that during evolution

Coupled matter-wave solitons in optical lattices

International Nuclear Information System (INIS)

Golam Ali, Sk; Talukdar, B.

2009-01-01

We make use of a potential model to study the dynamics of two coupled matter-wave or Bose-Einstein condensate (BEC) solitons loaded in optical lattices. With separate attention to linear and nonlinear lattices we find some remarkable differences for response of the system to effects of these lattices. As opposed to the case of linear optical lattice (LOL), the nonlinear lattice (NOL) can be used to control the mutual interaction between the two solitons. For a given lattice wave number k, the effective potentials in which the two solitons move are such that the well (V eff (NOL)), resulting from the juxtaposition of soliton interaction and nonlinear lattice potential, is deeper than the corresponding well V eff (LOL). But these effective potentials have opposite k dependence in the sense that the depth of V eff (LOL) increases as k increases and that of V eff (NOL) decreases for higher k values. We verify that the effectiveness of optical lattices to regulate the motion of the coupled solitons depends sensitively on the initial locations of the motionless solitons as well as values of the lattice wave number. For both LOL and NOL the two solitons meet each other due to mutual interaction if their initial locations are taken within the potential wells with the difference that the solitons in the NOL approach each other rather rapidly and take roughly half the time to meet as compared with the time needed for such coalescence in the LOL. In the NOL, the soliton profiles can move freely and respond to the lattice periodicity when the separation between their initial locations are as twice as that needed for a similar free movement in the LOL. We observe that, in both cases, slow tuning of the optical lattices by varying k with respect to a time parameter τ drags the oscillatory solitons apart to take them to different locations. In our potential model the oscillatory solitons appear to propagate undistorted. But a fully numerical calculation indicates that during

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

Efficient LBM visual simulation on face-centered cubic lattices.

Science.gov (United States)

Petkov, Kaloian; Qiu, Feng; Fan, Zhe; Kaufman, Arie E; Mueller, Klaus

2009-01-01

The Lattice Boltzmann method (LBM) for visual simulation of fluid flow generally employs cubic Cartesian (CC) lattices such as the D3Q13 and D3Q19 lattices for the particle transport. However, the CC lattices lead to suboptimal representation of the simulation space. We introduce the face-centered cubic (FCC) lattice, fD3Q13, for LBM simulations. Compared to the CC lattices, the fD3Q13 lattice creates a more isotropic sampling of the simulation domain and its single lattice speed (i.e., link length) simplifies the computations and data storage. Furthermore, the fD3Q13 lattice can be decomposed into two independent interleaved lattices, one of which can be discarded, which doubles the simulation speed. The resulting LBM simulation can be efficiently mapped to the GPU, further increasing the computational performance. We show the numerical advantages of the FCC lattice on channeled flow in 2D and the flow-past-a-sphere benchmark in 3D. In both cases, the comparison is against the corresponding CC lattices using the analytical solutions for the systems as well as velocity field visualizations. We also demonstrate the performance advantages of the fD3Q13 lattice for interactive simulation and rendering of hot smoke in an urban environment using thermal LBM.

Instantons and topological charge in lattice gauge theory

International Nuclear Information System (INIS)

Iwasaki, Y.; Yoshie, T.

1983-01-01

The existence of instantons on the lattice in SU(2) lattice gauge theory is investigated for various lattice actions with loops of up to six lattice spacings. Instantons exist only for the actions where short range fluctuations are suppressed. A formula for topological properties of the solutions are examined. (orig.)

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

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

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)

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

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

DEFF Research Database (Denmark)

Gamst, Mette

2014-01-01

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

Local search for Steiner tree problems in graphs

NARCIS (Netherlands)

Verhoeven, M.G.A.; Severens, M.E.M.; Aarts, E.H.L.; Rayward-Smith, V.J.; Reeves, C.R.; Smith, G.D.

1996-01-01

We present a local search algorithm for the Steiner tree problem in graphs, which uses a neighbourhood in which paths in a steiner tree are exchanged. The exchange function of this neigbourhood is based on multiple-source shortest path algorithm. We present computational results for a known

Multispeed models in off-lattice Boltzmann simulations

NARCIS (Netherlands)

Bardow, A.; Karlin, I.V.; Gusev, A.A.

2008-01-01

The lattice Boltzmann method is a highly promising approach to the simulation of complex flows. Here, we realize recently proposed multispeed lattice Boltzmann models [S. Chikatamarla et al., Phys. Rev. Lett. 97 190601 (2006)] by exploiting the flexibility offered by off-lattice Boltzmann methods.

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

The growth of minicircle networks on regular lattices

International Nuclear Information System (INIS)

Diao, Y; Hinson, K; Arsuaga, J

2012-01-01

The mitochondrial DNA of trypanosomes is organized into a network of topologically linked minicircles. In order to investigate how key topological properties of the network change with minicircle density, the authors introduced, in an earlier study, a mathematical model in which randomly oriented minicircles were placed on the vertices of the simple square lattice. Using this model, the authors rigorously showed that when the density of minicircles increases, percolation clusters form. For higher densities, these percolation clusters are the backbones for networks of minicircles that saturate the entire lattice. An important relevant question is whether these findings are generally true. That is, whether these results are independent of the choice of the lattices on which the model is based. In this paper, we study two additional lattices (namely the honeycomb and the triangular lattices). These regular lattices are selected because they have been proposed for trypanosomes before and after replication. We compare our findings with our earlier results on the square lattice and show that the mathematical statements derived for the square lattice can be extended to these other lattices qualitatively. This finding suggests the universality of these properties. Furthermore, we performed a numerical study which provided data that are consistent with our theoretical analysis, and showed that the effect of the choice of lattices on the key network topological characteristics is rather small. (paper)

Floquet Engineering of Optical Solenoids and Quantized Charge Pumping along Tailored Paths in Two-Dimensional Chern Insulators

Science.gov (United States)

Wang, Botao; Ünal, F. Nur; Eckardt, André

2018-06-01

The insertion of a local magnetic flux, as the one created by a thin solenoid, plays an important role in gedanken experiments of quantum Hall physics. By combining Floquet engineering of artificial magnetic fields with the ability of single-site addressing in quantum gas microscopes, we propose a scheme for the realization of such local solenoid-type magnetic fields in optical lattices. We show that it can be employed to manipulate and probe elementary excitations of a topological Chern insulator. This includes quantized adiabatic charge pumping along tailored paths inside the bulk, as well as the controlled population of edge modes.

An integrable coupling family of Merola-Ragnisco-Tu lattice systems, its Hamiltonian structure and related nonisospectral integrable lattice family

Energy Technology Data Exchange (ETDEWEB)

Xu Xixiang, E-mail: xu_xixiang@hotmail.co [College of Science, Shandong University of Science and Technology, Qingdao, 266510 (China)

2010-01-04

An integrable coupling family of Merola-Ragnisco-Tu lattice systems is derived from a four-by-four matrix spectral problem. The Hamiltonian structure of the resulting integrable coupling family is established by the discrete variational identity. Each lattice system in the resulting integrable coupling family is proved to be integrable discrete Hamiltonian system in Liouville sense. Ultimately, a nonisospectral integrable lattice family associated with the resulting integrable lattice family is constructed through discrete zero curvature representation.

An integrable coupling family of Merola-Ragnisco-Tu lattice systems, its Hamiltonian structure and related nonisospectral integrable lattice family

International Nuclear Information System (INIS)

Xu Xixiang

2010-01-01

An integrable coupling family of Merola-Ragnisco-Tu lattice systems is derived from a four-by-four matrix spectral problem. The Hamiltonian structure of the resulting integrable coupling family is established by the discrete variational identity. Each lattice system in the resulting integrable coupling family is proved to be integrable discrete Hamiltonian system in Liouville sense. Ultimately, a nonisospectral integrable lattice family associated with the resulting integrable lattice family is constructed through discrete zero curvature representation.

Arbitrary spin fermions on the lattice

International Nuclear Information System (INIS)

Bullinaria, J.A.

1985-01-01

Lattice actions are constructed for free Dirac and Majorana fermions of arbitrary (half-integer) spin various extensions of the spin 1/2 Kogut-Susskind, Kaehler and Wilson formalisms. In each case, the spectrum degeneracy and preservation of gauge invariance is analysed, and the equivalence or non-equivalence to previously constructed actions is determined. The Kogut-Susskind and lattice Kaehler actions are then written explicitly in terms of spinors to demonstrate how the degenerate fermions couple on the lattice and how the original spinorial actions are recovered (or to recovered) in the continuum limit. Both degenerate and non-degenerate mass terms are dealt with and the various U(1) invariances of the lattice actions are pointed out

Integral transforms of the quantum mechanical path integral: Hit function and path-averaged potential

Science.gov (United States)

Edwards, James P.; Gerber, Urs; Schubert, Christian; Trejo, Maria Anabel; Weber, Axel

2018-04-01

We introduce two integral transforms of the quantum mechanical transition kernel that represent physical information about the path integral. These transforms can be interpreted as probability distributions on particle trajectories measuring respectively the relative contribution to the path integral from paths crossing a given spatial point (the hit function) and the likelihood of values of the line integral of the potential along a path in the ensemble (the path-averaged potential).

Epidemic metapopulation model with traffic routing in scale-free networks

International Nuclear Information System (INIS)

Huang, Wei; Chen, Shengyong

2011-01-01

In this paper, we propose a model incorporating both the traffic routing dynamics and the virus prevalence dynamics. In this model, each packet may be isolated from the network on its transporting path, which means that the packet cannot be successfully delivered to its destination. In contrast, a successful transport means that a packet can be delivered from source to destination without being isolated. The effects of model parameters on the delivery success rate and the delivery failure rate are intensively studied and analyzed. Several routing strategies are performed for our model. Results show that the shortest path routing strategy is the most effective for enhancing the delivery success rate, especially when each packet is only allowed to be delivered to the neighbor with the lowest degree along the shortest path. We also find that, by minimizing the sum of the nodes' degree along the transporting path, we can also obtain a satisfactory delivery success rate

An Active Lattice Model in a Bayesian Framework

DEFF Research Database (Denmark)

Carstensen, Jens Michael

1996-01-01

A Markov Random Field is used as a structural model of a deformable rectangular lattice. When used as a template prior in a Bayesian framework this model is powerful for making inferences about lattice structures in images. The model assigns maximum probability to the perfect regular lattice...... by penalizing deviations in alignment and lattice node distance. The Markov random field represents prior knowledge about the lattice structure, and through an observation model that incorporates the visual appearance of the nodes, we can simulate realizations from the posterior distribution. A maximum...... a posteriori (MAP) estimate, found by simulated annealing, is used as the reconstructed lattice. The model was developed as a central part of an algorithm for automatic analylsis of genetic experiments, positioned in a lattice structure by a robot. The algorithm has been successfully applied to many images...

Thermodynamics of lattice QCD with 2 sextet quarks on Nt=8 lattices

International Nuclear Information System (INIS)

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

2011-01-01

We continue our lattice simulations of QCD with 2 flavors of color-sextet quarks as a model for conformal or walking technicolor. A 2-loop perturbative calculation of the β function which describes the evolution of this theory's running coupling constant predicts that it has a second zero at a finite coupling. This nontrivial zero would be an infrared stable fixed point, in which case the theory with massless quarks would be a conformal field theory. However, if the interaction between quarks and antiquarks becomes strong enough that a chiral condensate forms before this IR fixed point is reached, the theory is QCD-like with spontaneously broken chiral symmetry and confinement. However, the presence of the nearby IR fixed point means that there is a range of couplings for which the running coupling evolves very slowly, i.e. it ''walks.'' We are simulating the lattice version of this theory with staggered quarks at finite temperature, studying the changes in couplings at the deconfinement and chiral-symmetry restoring transitions as the temporal extent (N t ) of the lattice, measured in lattice units, is increased. Our earlier results on lattices with N t =4, 6 show both transitions move to weaker couplings as N t increases consistent with walking behavior. In this paper we extend these calculations to N t =8. Although both transitions again move to weaker couplings, the change in the coupling at the chiral transition from N t =6 to N t =8 is appreciably smaller than that from N t =4 to N t =6. This indicates that at N t =4, 6 we are seeing strong-coupling effects and that we will need results from N t >8 to determine if the chiral-transition coupling approaches zero as N t →∞, as needed for the theory to walk.

Lattice calculation of nonleptonic charm decays

International Nuclear Information System (INIS)

Simone, J.N.

1991-11-01

The decays of charmed mesons into two body nonleptonic final states are investigated. Weak interaction amplitudes of interest in these decays are extracted from lattice four-point correlation functions using a effective weak Hamiltonian including effects to order G f in the weak interactions yet containing effects to all orders in the strong interactions. The lattice calculation allows a quantitative examination of non-spectator processes in charm decays helping to elucidate the role of effects such as color coherence, final state interactions and the importance of the so called weak annihilation process. For D → Kπ, we find that the non-spectator weak annihilation diagram is not small, and we interpret this as evidence for large final state interactions. Moreover, there is indications of a resonance in the isospin 1/2 channel to which the weak annihilation process contributes exclusively. Findings from the lattice calculation are compared to results from the continuum vacuum saturation approximation and amplitudes are examined within the framework of the 1/N expansion. Factorization and the vacuum saturation approximation are tested for lattice amplitudes by comparing amplitudes extracted from lattice four-point functions with the same amplitude extracted from products of two-point and three-point lattice correlation functions arising out of factorization and vacuum saturation

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

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

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

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

Toda lattice field theories, discrete W algebras, Toda lattice hierarchies and quantum groups

International Nuclear Information System (INIS)

Bonora, L.; Colatto, L.P.; Constantinidis, C.P.

1996-05-01

In analogy with the Liouville case, we study the sl 3 Toda theory on the lattice and define the relevant quadratic algebra and out of it we recover the discrete W 3 algebra. We define an integrable system with respect to the latter and establish the relation with the Toda lattice hierarchy. We compute the relevant continuum limits. Finally we find the quantum version of the quadratic algebra. (author). 16 refs

The Fundamental Structure and the Reproduction of Spiral Wave in a Two-Dimensional Excitable Lattice.

Science.gov (United States)

Qian, Yu; Zhang, Zhaoyang

2016-01-01

In this paper we have systematically investigated the fundamental structure and the reproduction of spiral wave in a two-dimensional excitable lattice. A periodically rotating spiral wave is introduced as the model to reproduce spiral wave artificially. Interestingly, by using the dominant phase-advanced driving analysis method, the fundamental structure containing the loop structure and the wave propagation paths has been revealed, which can expose the periodically rotating orbit of spiral tip and the charity of spiral wave clearly. Furthermore, the fundamental structure is utilized as the core for artificial spiral wave. Additionally, the appropriate parameter region, in which the artificial spiral wave can be reproduced, is studied. Finally, we discuss the robustness of artificial spiral wave to defects.

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.

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)

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.

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

Lattice Automata for Control of Self-Reconfigurable Robots

DEFF Research Database (Denmark)

Støy, Kasper

2015-01-01

are extreme versatility and robustness. The organisation of self-reconfigurable robots in a lattice structure and the emphasis on local communication between modules mean that lattice automata are a useful basis for control of self-reconfigurable robots. However, there are significant differences which arise...... mainly from the physical nature of self-reconfigurable robots as opposed to the virtual nature of lattice automata. The problems resulting from these differences are mutual exclusion, handling motion constraints of modules, and unrealistic assumption about global, spatial orientation. Despite...... these problems the self-reconfigurable robot community has successfully applied lattice automata to simple control problems. However, for more complex problems hybrid solutions based on lattice automata and distributed algorithms are used. Hence, lattice automata have shown to have potential for the control...

Locally Sensitive Lattice-Valued Possibilistic Entropy Functions

Czech Academy of Sciences Publication Activity Database

Kramosil, Ivan

2008-01-01

Roč. 18, č. 6 (2008), s. 469-488 ISSN 1210-0552 R&D Projects: GA AV ČR IAA100300503 Institutional research plan: CEZ:AV0Z10300504 Keywords : complete lattice * chained lattice * lattice-valued possibilistic distribution * possibilistic expected value Subject RIV: BA - General Mathematics Impact factor: 0.395, year: 2008

Interstructure Lattices and Types of Peano Arithmetic

Science.gov (United States)

Abdul-Quader, Athar

The collection of elementary substructures of a model of PA forms a lattice, and is referred to as the substructure lattice of the model. In this thesis, we study substructure and interstructure lattices of models of PA. We apply techniques used in studying these lattices to other problems in the model theory of PA. In Chapter 2, we study a problem that had its origin in Simpson ([Sim74]), who used arithmetic forcing to show that every countable model of PA has an expansion to PA* that is pointwise definable. Enayat ([Ena88]) later showed that there are 2N0 models with the property that every expansion to PA* is pointwise definable. In this Chapter, we use techniques involved in representations of lattices to show that there is a model of PA with this property which contains an infinite descending chain of elementary cuts. In Chapter 3, we study the question of when subsets can be coded in elementary end extensions with prescribed interstructure lattices. This problem originated in Gaifman [Gai76], who showed that every model of PA has a conservative, minimal elementary end extension. That is, every model of PA has a minimal elementary end extension which codes only definable sets. Kossak and Paris [KP92] showed that if a model is countable and a subset X can be coded in any elementary end extension, then it can be coded in a minimal extension. Schmerl ([Sch14] and [Sch15]) extended this work by considering which collections of sets can be the sets coded in a minimal elementary end extension. In this Chapter, we extend this work to other lattices. We study two questions: given a countable model M, which sets can be coded in an elementary end extension such that the interstructure lattice is some prescribed finite distributive lattice; and, given an arbitrary model M, which sets can be coded in an elementary end extension whose interstructure lattice is a finite Boolean algebra?

New methods for indexing multi-lattice diffraction data

International Nuclear Information System (INIS)

Gildea, Richard J.; Waterman, David G.; Parkhurst, James M.; Axford, Danny; Sutton, Geoff; Stuart, David I.; Sauter, Nicholas K.; Evans, Gwyndaf; Winter, Graeme

2014-01-01

A new indexing method is presented which is capable of indexing multiple crystal lattices from narrow wedges of data. The efficacy of this method is demonstrated with both semi-synthetic multi-lattice data and real multi-lattice data recorded from microcrystals of ∼1 µm in size. A new indexing method is presented which is capable of indexing multiple crystal lattices from narrow wedges of diffraction data. The method takes advantage of a simplification of Fourier transform-based methods that is applicable when the unit-cell dimensions are known a priori. The efficacy of this method is demonstrated with both semi-synthetic multi-lattice data and real multi-lattice data recorded from crystals of ∼1 µm in size, where it is shown that up to six lattices can be successfully indexed and subsequently integrated from a 1° wedge of data. Analysis is presented which shows that improvements in data-quality indicators can be obtained through accurate identification and rejection of overlapping reflections prior to scaling

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.

Path Planning for Unmanned Underwater Vehicle in 3D Space with Obstacles Using Spline-Imperialist Competitive Algorithm and Optimal Interval Type-2 Fuzzy Logic Controller

Directory of Open Access Journals (Sweden)

Ehsan Zakeri

Full Text Available Abstract In this research, generation of a short and smooth path in three-dimensional space with obstacles for guiding an Unmanned Underwater Vehicle (UUV without collision is investigated. This is done by utilizing spline technique, in which the spline control points positions are determined by Imperialist Competitive Algorithm (ICA in three-dimensional space such that the shortest possible path from the starting point to the target point without colliding with obstacles is achieved. Furthermore, for guiding the UUV in the generated path, an Interval Type-2 Fuzzy Logic Controller (IT2FLC, the coefficients of which are optimized by considering an objective function that includes quadratic terms of the input forces and state error of the system, is used. Selecting such objective function reduces the control error and also the force applied to the UUV, which consequently leads to reduction of energy consumption. Therefore, by using a special method, desired signals of UUV state are obtained from generated three-dimensional optimal path such that tracking these signals by the controller leads to the tracking of this path by UUV. In this paper, the dynamical model of the UUV, entitled as "mUUV-WJ-1" , is derived and its hydrodynamic coefficients are calculated by CFD in order to be used in the simulations. For simulation by the method presented in this study, three environments with different obstacles are intended in order to check the performance of the IT2FLC controller in generating optimal paths for guiding the UUV. In this article, in addition to ICA, Particle Swarm Optimization (PSO and Artificial Bee Colony (ABC are also used for generation of the paths and the results are compared with each other. The results show the appropriate performance of ICA rather than ABC and PSO. Moreover, to evaluate the performance of the IT2FLC, optimal Type-1 Fuzzy Logic Controller (T1FLC and Proportional Integrator Differentiator (PID controller are designed

A Lattice Model for Bidirectional Pedestrian Flow on Gradient Road

International Nuclear Information System (INIS)

Ge Hong-Xia; Cheng Rong-Jun; Lo Siu-Ming

2014-01-01

Ramps and sloping roads appear everywhere in the built environment. It is obvious that the movement pattern of people in the sloping path may be different as compared with the pattern on level roads. Previously, most of the studies, especially the mathematical and simulation models, on pedestrian movement consider the flow at level routes. This study proposes a new lattice model for bidirectional pedestrian flow on gradient road. The stability condition is obtained by using linear stability theory. The nonlinear analysis method is employed to derive the modified Korteweg-de Vries (mKdV) equation, and the space of pedestrian flow is divided into three regions: the stable region, the metastable region, and the unstable region respectively. Furthermore, the time-dependent Ginzburg—Landan (TDGL) equation is deduced and solved through the reductive perturbation method. Finally, we present detailed results obtained from the model, and it is found that the stability of the model is enhanced in uphill situation while reduced in downhill situation with increasing slope. (general)

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.

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

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

SSC lattice database and graphical interface

International Nuclear Information System (INIS)

Trahern, C.G.; Zhou, J.

1991-11-01

When completed the Superconducting Super Collider will be the world's largest accelerator complex. In order to build this system on schedule, the use of database technologies will be essential. In this paper we discuss one of the database efforts underway at the SSC, the lattice database. The SSC lattice database provides a centralized source for the design of each major component of the accelerator complex. This includes the two collider rings, the High Energy Booster, Medium Energy Booster, Low Energy Booster, and the LINAC as well as transfer and test beam lines. These designs have been created using a menagerie of programs such as SYNCH, DIMAD, MAD, TRANSPORT, MAGIC, TRACE3D AND TEAPOT. However, once a design has been completed, it is entered into a uniform database schema in the database system. In this paper we discuss the reasons for creating the lattice database and its implementation via the commercial database system SYBASE. Each lattice in the lattice database is composed of a set of tables whose data structure can describe any of the SSC accelerator lattices. In order to allow the user community access to the databases, a programmatic interface known as dbsf (for database to several formats) has been written. Dbsf creates ascii input files appropriate to the above mentioned accelerator design programs. In addition it has a binary dataset output using the Self Describing Standard data discipline provided with the Integrated Scientific Tool Kit software tools. Finally we discuss the graphical interfaces to the lattice database. The primary interface, known as OZ, is a simulation environment as well as a database browser

Three-wave electron vortex lattices for measuring nanofields.

Science.gov (United States)

Dwyer, C; Boothroyd, C B; Chang, S L Y; Dunin-Borkowski, R E

2015-01-01

It is demonstrated how an electron-optical arrangement consisting of two electron biprisms can be used to generate three-wave vortex lattices with effective lattice spacings between 0.1 and 1 nm. The presence of vortices in these lattices was verified by using a third biprism to perform direct phase measurements via off-axis electron holography. The use of three-wave lattices for nanoscale electromagnetic field measurements via vortex interferometry is discussed, including the accuracy of vortex position measurements and the interpretation of three-wave vortex lattices in the presence of partial spatial coherence. Copyright © 2014 Elsevier B.V. All rights reserved.

Fractional Quantum Field Theory: From Lattice to Continuum

Directory of Open Access Journals (Sweden)

Vasily E. Tarasov

2014-01-01

Full Text Available An approach to formulate fractional field theories on unbounded lattice space-time is suggested. A fractional-order analog of the lattice quantum field theories is considered. Lattice analogs of the fractional-order 4-dimensional differential operators are proposed. We prove that continuum limit of the suggested lattice field theory gives a fractional field theory for the continuum 4-dimensional space-time. The fractional field equations, which are derived from equations for lattice space-time with long-range properties of power-law type, contain the Riesz type derivatives on noninteger orders with respect to space-time coordinates.

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.

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.

Modelling information flow along the human connectome using maximum flow.

Science.gov (United States)

Lyoo, Youngwook; Kim, Jieun E; Yoon, Sujung

2018-01-01

The human connectome is a complex network that transmits information between interlinked brain regions. Using graph theory, previously well-known network measures of integration between brain regions have been constructed under the key assumption that information flows strictly along the shortest paths possible between two nodes. However, it is now apparent that information does flow through non-shortest paths in many real-world networks such as cellular networks, social networks, and the internet. In the current hypothesis, we present a novel framework using the maximum flow to quantify information flow along all possible paths within the brain, so as to implement an analogy to network traffic. We hypothesize that the connection strengths of brain networks represent a limit on the amount of information that can flow through the connections per unit of time. This allows us to compute the maximum amount of information flow between two brain regions along all possible paths. Using this novel framework of maximum flow, previous network topological measures are expanded to account for information flow through non-shortest paths. The most important advantage of the current approach using maximum flow is that it can integrate the weighted connectivity data in a way that better reflects the real information flow of the brain network. The current framework and its concept regarding maximum flow provides insight on how network structure shapes information flow in contrast to graph theory, and suggests future applications such as investigating structural and functional connectomes at a neuronal level. Copyright © 2017 Elsevier Ltd. All rights reserved.

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

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.

Numerical Study of Electrolyte Wetting Phenomena in the Electrode of Lithium Ion Battery Using Lattice Boltzmann Method

Energy Technology Data Exchange (ETDEWEB)

Lee, Sang Gun [Seoul Nat' l Univ., Seoul (Korea, Republic of); Jeon, Dong Hyup [Dongguk Univ., Seoul (Korea, Republic of)

2014-04-15

The electrolyte wetting phenomena in the electrode of lithium ion battery is studied numerically using a multiphase lattice Boltzmann method (LBM). When a porous electrode is compressed during roll-pressing process, the porosity and thickness of the compressed electrode are changed, which can affect its wettability. In this study, the change in electrolyte distribution and degree of saturation as a result of varying the compression ratio are investigated with two-dimensional LBM approach. We found that changes in the electrolyte transport path are caused by a reduction in through-plane pore size and result in a decrease in the wettability of the compressed electrode.

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.

Vortex-Peierls States in Optical Lattices

International Nuclear Information System (INIS)

Burkov, A.A.; Demler, Eugene

2006-01-01

We show that vortices, induced in cold atom superfluids in optical lattices, may order in a novel vortex-Peierls ground state. In such a state vortices do not form a simple lattice but arrange themselves in clusters, within which the vortices are partially delocalized, tunneling between classically degenerate configurations. We demonstrate that this exotic quantum many-body state is selected by an order-from-disorder mechanism for a special combination of the vortex filling and lattice geometry that has a macroscopic number of classically degenerate ground states

The η' meson from lattice QCD

International Nuclear Information System (INIS)

Jansen, K.; Michael, C.; Urbach, C.

2008-04-01

We study the flavour singlet pseudoscalar mesons from first principles using lattice QCD. With N f =2 flavours of light quark, this is the so-called η 2 meson and we discuss the phenomenological status of this. Using maximally twisted-mass lattice QCD, we extract the mass of the η 2 meson at two values of the lattice spacing for lighter quarks than previously discussed in the literature. We are able to estimate the mass value in the limit of light quarks with their physical masses. (orig.)

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.

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

Simulations of four-dimensional simplicial quantum gravity as dynamical triangulation

International Nuclear Information System (INIS)

Agishtein, M.E.; Migdal, A.A.

1992-01-01

In this paper, Four-Dimensional Simplicial Quantum Gravity is simulated using the dynamical triangulation approach. The authors studied simplicial manifolds of spherical topology and found the critical line for the cosmological constant as a function of the gravitational one, separating the phases of opened and closed Universe. When the bare cosmological constant approaches this line from above, the four-volume grows: the authors reached about 5 x 10 4 simplexes, which proved to be sufficient for the statistical limit of infinite volume. However, for the genuine continuum theory of gravity, the parameters of the lattice model should be further adjusted to reach the second order phase transition point, where the correlation length grows to infinity. The authors varied the gravitational constant, and they found the first order phase transition, similar to the one found in three-dimensional model, except in 4D the fluctuations are rather large at the transition point, so that this is close to the second order phase transition. The average curvature in cutoff units is large and positive in one phase (gravity), and small negative in another (antigravity). The authors studied the fractal geometry of both phases, using the heavy particle propagator to define the geodesic map, as well as with the old approach using the shortest lattice paths

Hamiltonian approach to the lattice massive Schwinger model

International Nuclear Information System (INIS)

Sidorov, A.V.; Zastavenko, L.G.

1996-01-01

The authors consider the limit e 2 /m 2 much-lt 1 of the lattice massive Schwinger model, i.e., the lattice massive QED in two space-time dimensions, up to lowest order in the effective coupling constant e 2 /m 2 . Here, m is the fermion mass parameter and e is the electron charge. They compare their lattice QED model with the analogous continuous space and lattice space models, (CSM and LSM), which do not take account of the zero momentum mode, z.m.m., of the vector potential. The difference is that (due to extra z.m.m. degree of freedom) to every eigenstate of the CSM and LSM there corresponds a family of eigenstates of the authors lattice QED with the parameter λ. They restrict their consideration to small values of the parameter λ. Then, the energies of the particle states of their lattice QED and LSM do coincide (in their approximation). In the infinite periodicity length limit the Hamiltonian of the authors lattice QED (as well as the Hamiltonian of the LSM) possesses two different Hilbert spaces of eigenfunctions. Thus, in this limit the authors lattice QED model (as well as LSM) describes something like two connected, but different, worlds

The coupled cluster theory of quantum lattice systems

International Nuclear Information System (INIS)

Bishop, R.; Xian, Yang

1994-01-01

The coupled cluster method is widely recognized nowadays as providing an ab initio method of great versatility, power, and accuracy for handling in a fully microscopic and systematic way the correlations between particles in quantum many-body systems. The number of successful applications made to date within both chemistry and physics is impressive. In this article, the authors review recent extensions of the method which now provide a unifying framework for also dealing with strongly interacting infinite quantum lattice systems described by a Hamiltonian. Such systems include both spin-lattice models (such as the anisotropic Heisenberg or XXZ model) exhibiting interesting magnetic properties, and electron lattice models (such as the tJ and Hubbard models), where the spins or fermions are localized on the sites of a regular lattice; as well as lattice gauge theories [such as the Abelian U(1) model of quantum electrodynamics and non-Abelian SU(n) models]. Illustrative results are given for both the XXZ spin lattice model and U(1) lattice gauge theory

Relationships between lattice energies of inorganic ionic solids

Science.gov (United States)

Kaya, Savaş

2018-06-01

Lattice energy, which is a measure of the stabilities of inorganic ionic solids, is the energy required to decompose a solid into its constituent independent gaseous ions. In the present work, the relationships between lattice energies of many diatomic and triatomic inorganic ionic solids are revealed and a simple rule that can be used for the prediction of the lattice energies of inorganic ionic solids is introduced. According to this rule, the lattice energy of an AB molecule can be predicted with the help of the lattice energies of AX, BY and XY molecules in agreement with the experimental data. This rule is valid for not only diatomic molecules but also triatomic molecules. The lattice energy equations proposed in this rule provides compatible results with previously published lattice energy equations by Jenkins, Kaya, Born-Lande, Born-Mayer, Kapustinskii and Reddy. For a large set of tested molecules, calculated percent standard deviation values considering experimental data and the results of the equations proposed in this work are in general between %1-2%.

Bulk diffusion in a kinetically constrained lattice gas

Science.gov (United States)

Arita, Chikashi; Krapivsky, P. L.; Mallick, Kirone

2018-03-01

In the hydrodynamic regime, the evolution of a stochastic lattice gas with symmetric hopping rules is described by a diffusion equation with density-dependent diffusion coefficient encapsulating all microscopic details of the dynamics. This diffusion coefficient is, in principle, determined by a Green-Kubo formula. In practice, even when the equilibrium properties of a lattice gas are analytically known, the diffusion coefficient cannot be computed except when a lattice gas additionally satisfies the gradient condition. We develop a procedure to systematically obtain analytical approximations for the diffusion coefficient for non-gradient lattice gases with known equilibrium. The method relies on a variational formula found by Varadhan and Spohn which is a version of the Green-Kubo formula particularly suitable for diffusive lattice gases. Restricting the variational formula to finite-dimensional sub-spaces allows one to perform the minimization and gives upper bounds for the diffusion coefficient. We apply this approach to a kinetically constrained non-gradient lattice gas in two dimensions, viz. to the Kob-Andersen model on the square lattice.

On 3-way combinatorial identities

Indian Academy of Sciences (India)

A K Agarwal

2018-03-19

Mar 19, 2018 ... Math. 79 (2009) 145–155), and Agarwal (J. Number Theory 28 (1988) 299–305). Keywords. Basic series; n-color partitions; lattice paths; associated lattice paths; ...... J. Math. 136(2) (1989) 209–228. [5] Agarwal A K and Goyal M, Lattice paths and Rogers identities, Open J. Discrete Math. 1. (2011) 89–95.

On techniques of ATR lattice computation

International Nuclear Information System (INIS)

1997-08-01

Lattice computation is to compute the average nuclear constants of unit fuel lattice which are required for computing core nuclear characteristics such as core power distribution and reactivity characteristics. The main nuclear constants are infinite multiplying rate, neutron movement area, cross section for diffusion computation, local power distribution and isotope composition. As for the lattice computation code, WIMS-ATR is used, which is based on the WIMS-D code developed in U.K., and for the purpose of heightening the accuracy of analysis, which was improved by adding heavy water scattering cross section considering the temperature dependence by Honeck model. For the computation of the neutron absorption by control rods, LOIEL BLUE code is used. The extrapolation distance of neutron flux on control rod surfaces is computed by using THERMOS and DTF codes, and the lattice constants of adjoining lattices are computed by using the WIMS-ATR code. As for the WIMS-ATR code, the computation flow and nuclear data library, and as for the LOIEL BLUE code, the computation flow are explained. The local power distribution in fuel assemblies determined by the WIMS-ATR code was verified with the measured data, and the results are reported. (K.I.)

Full CKM matrix with lattice QCD

Energy Technology Data Exchange (ETDEWEB)

Okamoto, Masataka; /Fermilab

2004-12-01

The authors show that it is now possible to fully determine the CKM matrix, for the first time, using lattice QCD. |V{sub cd}|, |V{sub cs}|, |V{sub ub}|, |V{sub cb}| and |V{sub us}| are, respectively, directly determined with the lattice results for form factors of semileptonic D {yields} {pi}lv, D {yields} Klv, B {yields} {pi}lv, B {yields} Dlv and K {yields} {pi}lv decays. The error from the quenched approximation is removed by using the MILC unquenced lattice gauge configurations, where the effect of u, d and s quarks is included. The error from the ''chiral'' extrapolation (m{sub l} {yields} m{sub ud}) is greatly reduced by using improved staggered quarks. The accuracy is comparable to that of the Particle Data Group averages. In addition, |V{sub ud}|, |V{sub ts}|, |V{sub ts}| and |V{sub td}| are determined by using unitarity of the CKM matrix and the experimental result for sin (2{beta}). In this way, they obtain all 9 CKM matrix elements, where the only theoretical input is lattice QCD. They also obtain all the Wolfenstein parameters, for the first time, using lattice QCD.

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

Sequential Path Analysis for Determination of Relationship Between Yield and Yield Components in Bread Wheat (Triticum aestivum.L.

Directory of Open Access Journals (Sweden)

Mohtasham MOHAMMADI

2014-03-01

Full Text Available An experiment was conducted to evaluate 295 wheat genotypes in Alpha-Lattice design with two replications. The arithmetic mean and standard deviation of grain yield was 2706 and 950 (kg/ha,respectively. The results of correlation coefficients indicated that grain yield had significant and positive association with plant height, spike length, early growth vigor and agronomic score. Whereas there were negative correlation coefficients between grain yield and days to physiological maturity and canopy temperature before and during anthesis. Path analysis indicated agronomic score and plant height had high positive direct effects on grain yield, while canopy temperature before and during anthesis, and days to maturity, wes another trait having negative direct effect on grain yield. The results of sequential path analysis showed the traits that accounted as a criteria variable for high grain yield were agronomic score, plant height, canopy temperature, spike length, chlorophyll content and early growth vigor, which were determined as first, second and third order variables and had strong effects on grain yield via one or more paths. More important, as canopy temperature, agronomic score and early growth vigor can be evaluated quickly and easily, these traits may be used for evaluation of large populations.

Topology optimization and lattice Boltzmann methods

DEFF Research Database (Denmark)

Nørgaard, Sebastian Arlund

This thesis demonstrates the application of the lattice Boltzmann method for topology optimization problems. Specifically, the focus is on problems in which time-dependent flow dynamics have significant impact on the performance of the devices to be optimized. The thesis introduces new topology...... a discrete adjoint approach. To handle the complexity of the discrete adjoint approach more easily, a method for computing it based on automatic differentiation is introduced, which can be adapted to any lattice Boltzmann type method. For example, while it is derived in the context of an isothermal lattice...... Boltzmann model, it is shown that the method can be easily extended to a thermal model as well. Finally, the predicted behavior of an optimized design is compared to the equiva-lent prediction from a commercial finite element solver. It is found that the weakly compressible nature of the lattice Boltzmann...

Bidirectional Fano Algorithm for Lattice Coded MIMO Channels

KAUST Repository

Al-Quwaiee, Hessa

2013-01-01

channel model. Channel codes based on lattices are preferred due to three facts: lattice codes have simple structure, the code can achieve the limits of the channel, and they can be decoded efficiently using lattice decoders which can be considered

Lattice solitons in Bose-Einstein condensates

International Nuclear Information System (INIS)

Efremidis, Nikolaos K.; Christodoulides, Demetrios N.

2003-01-01

We systematically study the properties of lattice solitons in Bose-Einstein condensates with either attractive or repulsive atom interactions. This is done, by exactly solving the mean-field Gross-Pitaevskii equation in the presence of a periodic potential. We find new families of lattice soliton solutions that are characterized by the position of the energy eigenvalue within the associated band structure. These include lattice solitons in condensates with either attractive or repulsive atom interactions that exist in finite or semi-infinite gaps, as well as nonlinear modes that exhibit atomic population cutoffs

Optical lattice on an atom chip

DEFF Research Database (Denmark)

Gallego, D.; Hofferberth, S.; Schumm, Thorsten

2009-01-01

Optical dipole traps and atom chips are two very powerful tools for the quantum manipulation of neutral atoms. We demonstrate that both methods can be combined by creating an optical lattice potential on an atom chip. A red-detuned laser beam is retroreflected using the atom chip surface as a high......-quality mirror, generating a vertical array of purely optical oblate traps. We transfer thermal atoms from the chip into the lattice and observe cooling into the two-dimensional regime. Using a chip-generated Bose-Einstein condensate, we demonstrate coherent Bloch oscillations in the lattice....

How to Share a Lattice Trapdoor

DEFF Research Database (Denmark)

Bendlin, Rikke; Peikert, Chris; Krehbiel, Sara

2013-01-01

We develop secure threshold protocols for two important operations in lattice cryptography, namely, generating a hard lattice Λ together with a "strong" trapdoor, and sampling from a discrete Gaussian distribution over a desired coset of Λ using the trapdoor. These are the central operations...... delegation, which is used in lattice-based hierarchical IBE schemes. Our work therefore directly transfers all these systems to the threshold setting. Our protocols provide information-theoretic (i.e., statistical) security against adaptive corruptions in the UC framework, and they are robust against up to ℓ...

Electronic properties of graphene antidot lattices

DEFF Research Database (Denmark)

Fürst, Joachim Alexander; Pedersen, Jesper Goor; Flindt, C.

2009-01-01

Graphene antidot lattices constitute a novel class of nano-engineered graphene devices with controllable electronic and optical properties. An antidot lattice consists of a periodic array of holes that causes a band gap to open up around the Fermi level, turning graphene from a semimetal...... into a semiconductor. We calculate the electronic band structure of graphene antidot lattices using three numerical approaches with different levels of computational complexity, efficiency and accuracy. Fast finite-element solutions of the Dirac equation capture qualitative features of the band structure, while full...

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.

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

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.

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.

Recursive evaluation of space-time lattice Green's functions

International Nuclear Information System (INIS)

De Hon, Bastiaan P; Arnold, John M

2012-01-01

Up to a multiplicative constant, the lattice Green's function (LGF) as defined in condensed matter physics and lattice statistical mechanics is equivalent to the Z-domain counterpart of the finite-difference time-domain Green's function (GF) on a lattice. Expansion of a well-known integral representation for the LGF on a ν-dimensional hyper-cubic lattice in powers of Z −1 and application of the Chu–Vandermonde identity results in ν − 1 nested finite-sum representations for discrete space-time GFs. Due to severe numerical cancellations, these nested finite sums are of little practical use. For ν = 2, the finite sum may be evaluated in closed form in terms of a generalized hypergeometric function. For special lattice points, that representation simplifies considerably, while on the other hand the finite-difference stencil may be used to derive single-lattice-point second-order recurrence schemes for generating 2D discrete space-time GF time sequences on the fly. For arbitrary symbolic lattice points, Zeilberger's algorithm produces a third-order recurrence operator with polynomial coefficients of the sixth degree. The corresponding recurrence scheme constitutes the most efficient numerical method for the majority of lattice points, in spite of the fact that for explicit numeric lattice points the associated third-order recurrence operator is not the minimum recurrence operator. As regards the asymptotic bounds for the possible solutions to the recurrence scheme, Perron's theorem precludes factorial or exponential growth. Along horizontal lattices directions, rapid initial growth does occur, but poses no problems in augmented dynamic-range fixed precision arithmetic. By analysing long-distance wave propagation along a horizontal lattice direction, we have concluded that the chirp-up oscillations of the discrete space-time GF are the root cause of grid dispersion anisotropy. With each factor of ten increase in the lattice distance, one would have to roughly

Lattice formulation of a two-dimensional topological field theory

International Nuclear Information System (INIS)

Ohta, Kazutoshi; Takimi, Tomohisa

2007-01-01

We investigate an integrable property and the observables of 2-dimensional N=(4,4) topological field theory defined on a discrete lattice by using the 'orbifolding' and 'deconstruction' methods. We show that our lattice model is integrable and, for this reason, the partition function reduces to matrix integrals of scalar fields on the lattice sites. We elucidate meaningful differences between a discrete lattice and a differentiable manifold. This is important for studying topological quantities on a lattice. We also propose a new construction of N=(2,2) supersymmetric lattice theory, which is realized through a suitable truncation of scalar fields from the N=(4,4) theory. (author)

Temperature-dependent errors in nuclear lattice simulations