WorldWideScience

Sample records for candu shortest path

  1. Euclidean shortest paths

    CERN Document Server

    Li, Fajie

    2011-01-01

    This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing each concept and algorithm in depth, the book includes mathematical proofs for many of the given statements. Topics and features: provides theoretical and programming exercises at the end of each chapter; presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms; discusses algorithms for calculating exact or approximate ESPs i

  2. Shortest Paths in Microseconds

    CERN Document Server

    Agarwal, Rachit; Godfrey, P Brighten; Zhao, Ben Y

    2013-01-01

    Computing shortest paths is a fundamental primitive for several social network applications including socially-sensitive ranking, location-aware search, social auctions and social network privacy. Since these applications compute paths in response to a user query, the goal is to minimize latency while maintaining feasible memory requirements. We present ASAP, a system that achieves this goal by exploiting the structure of social networks. ASAP preprocesses a given network to compute and store a partial shortest path tree (PSPT) for each node. The PSPTs have the property that for any two nodes, each edge along the shortest path is with high probability contained in the PSPT of at least one of the nodes. We show that the structure of social networks enable the PSPT of each node to be an extremely small fraction of the entire network; hence, PSPTs can be stored efficiently and each shortest path can be computed extremely quickly. For a real network with 5 million nodes and 69 million edges, ASAP computes a short...

  3. Shortest Paths and Vehicle Routing

    DEFF Research Database (Denmark)

    Petersen, Bjørn

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

  4. Physarum Can Compute Shortest Paths

    CERN Document Server

    Bonifaci, Vincenzo; Varma, Girish

    2011-01-01

    A mathematical model has been proposed by biologists to describe the feedback mechanism used by the Physarum Polycephalum slime mold to adapt its tubular channels while foraging two food sources $s_0$ and $s_1$. We give a proof of the fact that, under this model, the mass of the mold will eventually converge to the shortest $s_0$-$s_1$ path of the network that the mold lies on, independently of the structure of the network or of the initial mass distribution. This matches the experimental observations by the biologists and can be seen as an example of a "natural algorithm", that is, an algorithm developed by evolution over millions of years.

  5. Shortest Paths With Side Sensors

    CERN Document Server

    Salaris, Paolo; Bicchi, Antonio

    2011-01-01

    We present a complete characterization of shortest paths to a goal position for a vehicle with unicycle kinematics and a limited range sensor, constantly keeping a given landmark in sight. Previous work on this subject studied the optimal paths in case of a frontal, symmetrically limited Field--Of--View (FOV). In this paper we provide a generalization to the case of arbitrary FOVs, including the case that the direction of motion is not an axis of symmetry for the FOV, and even that it is not contained in the FOV. The provided solution is of particular relevance to applications using side-scanning, such as e.g. in underwater sonar-based surveying and navigation.

  6. Cost allocation in shortest path games

    NARCIS (Netherlands)

    Voorneveld, M.; Grahn, S.

    2001-01-01

    A class of cooperative games arising from shortest path problems is dened These shortest path games are shown to be totally balanced and allow a population monotonic allocation scheme Possible methods for obtaining core elements are indicated rst by relating to the allocation rules in taxation and b

  7. Shortest Path Computation with No Information Leakage

    CERN Document Server

    Mouratidis, Kyriakos

    2012-01-01

    Shortest path computation is one of the most common queries in location-based services (LBSs). Although particularly useful, such queries raise serious privacy concerns. Exposing to a (potentially untrusted) LBS the client's position and her destination may reveal personal information, such as social habits, health condition, shopping preferences, lifestyle choices, etc. The only existing method for privacy-preserving shortest path computation follows the obfuscation paradigm; it prevents the LBS from inferring the source and destination of the query with a probability higher than a threshold. This implies, however, that the LBS still deduces some information (albeit not exact) about the client's location and her destination. In this paper we aim at strong privacy, where the adversary learns nothing about the shortest path query. We achieve this via established private information retrieval techniques, which we treat as black-box building blocks. Experiments on real, large-scale road networks assess the pract...

  8. Dynamic Shortest Path Monitoring in Spatial Networks

    Institute of Scientific and Technical Information of China (English)

    Shuo Shang; Lisi Chen; Zhe-Wei Wei; Dan-Huai Guo; Ji-Rong Wen

    2016-01-01

    With the increasing availability of real-time traffic information, dynamic spatial networks are pervasive nowa-days and path planning in dynamic spatial networks becomes an important issue. In this light, we propose and investigate a novel problem of dynamically monitoring shortest paths in spatial networks (DSPM query). When a traveler aims to a des-tination, his/her shortest path to the destination may change due to two reasons: 1) the travel costs of some edges have been updated and 2) the traveler deviates from the pre-planned path. Our target is to accelerate the shortest path computing in dynamic spatial networks, and we believe that this study may be useful in many mobile applications, such as route planning and recommendation, car navigation and tracking, and location-based services in general. This problem is challenging due to two reasons: 1) how to maintain and reuse the existing computation results to accelerate the following computations, and 2) how to prune the search space effectively. To overcome these challenges, filter-and-refinement paradigm is adopted. We maintain an expansion tree and define a pair of upper and lower bounds to prune the search space. A series of optimization techniques are developed to accelerate the shortest path computing. The performance of the developed methods is studied in extensive experiments based on real spatial data.

  9. Dynamic Shortest Path Algorithms for Hypergraphs

    Science.gov (United States)

    2012-01-01

    Performance comparison of algorithms for the dynamic shortest path problem,” IEICE Transactions on Fundamentals of Electronics , Communications and...computation,” IEEE/ACM Transactions on Networking, vol. 8, no. 6, pp. 734–746, 2000. [8] G. Ramalingam and T. Reps, “An incremental algorithm for a...multihop performance,” IEEE Transactions on Mobile Computing, pp. 337–348, 2003. [17] S. Chachulski, M. Jennings, S. Katti, and D. Katabli, “Trading

  10. K shortest paths in stochastic time-dependent networks

    DEFF Research Database (Denmark)

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

    2004-01-01

    , finding the a priori shortest path is NP-hard, while the best time-adaptive strategy can be found in polynomial time. In this paper, we propose a solution method for the a priori shortest path problem, and we show that it can be easily adapted to the ranking of the first K shortest paths. Moreover, we...

  11. Ranking shortest paths in Stochastic time-denpendent networks

    DEFF Research Database (Denmark)

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

    , finding the a priori shortest path is NP-hard, while the best time-adaptive strategy can be found in polynomial time. In this paper, we propose a solution method for the a priori shortest path problem, and we show that it can be easily adapted to the ranking of the first K shortest paths. Moreover, we...

  12. SHORTEST PATH ARC LENGTH NETWORK USING TRIANGULAR INTUITIONISTIC FUZZY NUMBER

    Directory of Open Access Journals (Sweden)

    A.D.CHANDRASEKARAN

    2016-04-01

    Full Text Available In this paper, an intuitionistic fuzzy shortest path is presented to find the optimal path in a network which a fuzzy number, instead of a positive integer is assigned to each arc length. The algorithm is based on the idea that firstly from all the shortest paths from source to destination, an arc with shortest length is computed and then the Euclidean distance is computed for all the paths with the arc of minimum distance. Finally an illustrative numerical example is given to express the proposed work.

  13. Dynamic Shortest Path Algorithms for Hypergraphs

    Science.gov (United States)

    2014-01-01

    hypergraphs, energy efficient routing in multichannel multiradio networks, and the Enron email data set. The experiment with the Enron email data set...efficient routing inmultichannel multiradio networks, and the Enron email data set. The experiment with the Enron email data set illustrates the application...FOR HYPERGRAPHS 3 of each actor. In Section VII, we apply the proposed shortest hy- perpath algorithms to the Enron e-mail data set. We propose a

  14. The Shortest Path with Intelligent Algorithm

    Directory of Open Access Journals (Sweden)

    Surachai Panich

    2010-01-01

    Full Text Available Problem statement: Path planning algorithms need to be developed and implemented in a suitable manner to give better understanding about the intelligent system and also stimulates technological supply to enormous demands in an intelligent vehicle industry. Approach: This study concerned with intelligent path planning using A* search algorithm. Results: This study introduced intelligent path planning with A* search algorithm, which use to generate the most efficient path to goal. The algorithm was tested on simulator. Conclusion: This study is an implementation of a path planning for an intelligent path planning. The implementations are tested and verified with the simulation software. The path planning algorithms were selected for the implementation and to verify them.

  15. A Primal-dual Neural Network for Shortest Path Problem

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    The shortest path (SP) problem is a classical combinatorial optimization problem which plays an important role in a packet-switched computer and communication network. A new primal-dual neural network to solve the shortest path problem (PDSPN) is presented in this paper. The proposed neural network combines many features such as no network coefficients set,easy implementation in a VLSI circuit, and is proved to be completely stable to the exact solutions. The simulation example shows its efficiency in finding the "optimum" path(s) for data transmission in computer and communication network.

  16. Multiple-Source Shortest Paths in Embedded Graphs

    CERN Document Server

    Cabello, Sergio; Erickson, Jeff

    2012-01-01

    Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let F be an arbitrary face of G. We describe an algorithm to preprocess the graph in O(gn log n) time, so that the shortest-path distance from any vertex on the boundary of F to any other vertex in G can be retrieved in O(log n) time. Our result directly generalizes the O(n log n)-time algorithm of Klein [SODA 2005] for multiple-source shortest paths in planar graphs. Intuitively, our preprocessing algorithm maintains a shortest-path tree as its source point moves continuously around the boundary of F. As an application of our algorithm, we describe algorithms to compute a shortest non-contractible or non-separating cycle in embedded, undirected graphs in O(g^2 n log n) time.

  17. Competition for shortest paths on sparse graphs.

    Science.gov (United States)

    Yeung, Chi Ho; Saad, David

    2012-05-18

    Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of a nonlinear overlap cost that penalizes congestion. Routing becomes more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. The ground state of such systems reveals nonmonotonic complex behaviors in average path length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers. A distributed linearly scalable routing algorithm is also devised.

  18. Solving the constrained shortest path problem using random search strategy

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    In this paper, we propose an improved walk search strategy to solve the constrained shortest path problem. The proposed search strategy is a local search algorithm which explores a network by walker navigating through the network. In order to analyze and evaluate the proposed search strategy, we present the results of three computational studies in which the proposed search algorithm is tested. Moreover, we compare the proposed algorithm with the ant colony algorithm and k shortest paths algorithm. The analysis and comparison results demonstrate that the proposed algorithm is an effective tool for solving the constrained shortest path problem. It can not only be used to solve the optimization problem on a larger network, but also is superior to the ant colony algorithm in terms of the solution time and optimal paths.

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

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

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

    CERN Document Server

    Ortega-Arranz, Hector; Gonzalez-Escribano, Arturo

    2014-01-01

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

  2. On the Emergence of Shortest Paths by Reinforced Random Walks

    CERN Document Server

    Figueiredo, Daniel R

    2016-01-01

    The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate the interplay between the efficiency of network navigation (i.e., path lengths) and network structure (i.e., edge weights). We propose a simple and tractable model based on iterative biased random walks where edge weights increase over time as function of the traversed path length. Under mild assumptions, we prove that biased random walks will eventually only traverse shortest paths in their journey towards the destination. We further characterize the transient regime proving that the probability to traverse non-shortest paths decays according to a power-law. We also highlight various properties in this dynamic, such as the trade-off between exploration and convergence, and preservation of initial network plasticity. We believe the proposed model and results can be of inter...

  3. Outdoor-indoor Space: Unified Modeling and Shortest Path Search

    DEFF Research Database (Denmark)

    Jensen, Søren Kejser; Nielsen, Jens Thomas Vejlby; Lu, Hua;

    2016-01-01

    Graph models are widely used for representing the topology of outdoor space (O-Space) and indoor space (I-Space). However, existing models neglect the intersection between O-Space and I-Space, only allowing for computations such as shortest path and nearest neighbor queries in either O-Space or I...

  4. An optimal antenna motion generation using shortest path planning

    Science.gov (United States)

    Jeon, Moon-Jin; Kwon, Dong-Soo

    2017-03-01

    This paper considers an angular velocity minimization method for a satellite antenna. For high speed transmission of science data, a directional antenna with a two-axis gimbal is generally used. When a satellite passes over a ground station while pointing directly at it, the angular velocity of the satellite antenna can increase rapidly due to the gimbal kinematics. The high angular velocity could exceed the dynamic constraint of the antenna. Furthermore, micro vibration induced by high speed antenna rotation during an imaging operation might cause jitter, which can degrade the satellite image quality. To solve this problem, a minimum-velocity antenna motion generation method is proposed. Boundaries of the azimuth and elevation angles of the antenna within an effective beam width are derived using antenna geometry. A minimum-velocity azimuth profile and elevation profile within the boundaries are generated sequentially using a shortest path planning method. For fast and correct generation of the shortest path, a new algorithm called a string nailing algorithm is proposed. A numerical simulation shows that the antenna profile generated by the shortest path planning has a much lower angular velocity than the profiles generated by previous methods. The proposed string nailing algorithm also spends much less computation time than a search-based shortest path planning algorithm to generate almost the same antenna profiles.

  5. Simple and accurate analytical calculation of shortest path lengths

    CERN Document Server

    Melnik, Sergey

    2016-01-01

    We present an analytical approach to calculating the distribution of shortest paths lengths (also called intervertex distances, or geodesic paths) between nodes in unweighted undirected networks. We obtain very accurate results for synthetic random networks with specified degree distribution (the so-called configuration model networks). Our method allows us to accurately predict the distribution of shortest path lengths on real-world networks using their degree distribution, or joint degree-degree distribution. Compared to some other methods, our approach is simpler and yields more accurate results. In order to obtain the analytical results, we use the analogy between an infection reaching a node in $n$ discrete time steps (i.e., as in the susceptible-infected epidemic model) and that node being at a distance $n$ from the source of the infection.

  6. Approximation algorithms for curvature-constrained shortest paths

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Hongyan; Agarwal, P.K. [Duke Univ., Durham, NC (United States)

    1996-12-31

    Let B be a point robot in the plane, whose path is constrained to have curvature of at most 1, and let {Omega} be a set of polygonal obstacles with n vertices. We study the collision-free, optimal path-planning problem for B. Given a parameter {epsilon}, we present an O((n{sup 2}/{epsilon}{sup 2}) log n)-time algorithm for computing a collision-free, curvature-constrained path between two given positions, whose length is at most (1 + {epsilon}) times the length of an optimal robust path (a path is robust if it remains collision-free even if certain positions on the path are perturbed). Our algorithm thus runs significantly faster than the previously best known algorithm by Jacobs and Canny whose running time is O((n+L/{epsilon}){sup 2} + n{sup 2} (n+1/{epsilon}) log n), where L is the total edge length of the obstacles. More importantly, the running time of our algorithm does not depend on the size of obstacles. The path returned by this algorithm is not necessarily robust. We present an O((n/{epsilon}){sup 2.5} log n)-time algorithm that returns a robust path whose length is at most (1 + {epsilon}) times the length of an optimal robust path. We also give a stronger characterization of curvature-constrained shortest paths, which, apart from being crucial for our algorithm, is interesting in its own right. Roughly speaking, we prove that, except in some special cases, a shortest path touches obstacles only at points that have a visible vertex nearby.

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

    Directory of Open Access Journals (Sweden)

    Zhenghao Xi

    2014-01-01

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

  8. Multiple object tracking using the shortest path faster association algorithm.

    Science.gov (United States)

    Xi, Zhenghao; Liu, Heping; Liu, Huaping; Yang, Bin

    2014-01-01

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

  9. Improved approximations for robust mincut and shortest path

    CERN Document Server

    Polishchuk, Valentin

    2010-01-01

    In two-stage robust optimization the solution to a problem is built in two stages: In the first stage a partial, not necessarily feasible, solution is exhibited. Then the adversary chooses the "worst" scenario from a predefined set of scenarios. In the second stage, the first-stage solution is extended to become feasible for the chosen scenario. The costs at the second stage are larger than at the first one, and the objective is to minimize the total cost paid in the two stages. We give a 2-approximation algorithm for the robust mincut problem and a ({\\gamma}+2)-approximation for the robust shortest path problem, where {\\gamma} is the approximation ratio for the Steiner tree. This improves the factors (1+\\sqrt2) and 2({\\gamma}+2) from [Golovin, Goyal and Ravi. Pay today for a rainy day: Improved approximation algorithms for demand-robust min-cut and shortest path problems. STACS 2006]. In addition, our solution for robust shortest path is simpler and more efficient than the earlier ones; this is achieved by a...

  10. Calculating Graph Algorithms for Dominance and Shortest Path

    DEFF Research Database (Denmark)

    Sergey, Ilya; Midtgaard, Jan; Clarke, Dave

    2012-01-01

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

  11. Optimal parallel algorithm for shortest-paths problem on interval graphs

    Institute of Scientific and Technical Information of China (English)

    MISHRA P.K.

    2004-01-01

    This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given.

  12. ON THE ACCELERATION OF SHORTEST PATH CALCULATIONS IN TRANSPORTATION NETWORKS

    Energy Technology Data Exchange (ETDEWEB)

    BAKER, ZACHARY K. [Los Alamos National Laboratory; GOKHALE, MAYA B. [Los Alamos National Laboratory

    2007-01-08

    Shortest path algorithms are a key element of many graph problems. They are used in such applications as online direction finding and navigation, as well as modeling of traffic for large scale simulations of major metropolitan areas. As the shortest path algorithms are an execution bottleneck, it is beneficial to move their execution to parallel hardware such as Field-Programmable Gate Arrays (FPGAs). Hardware implementation is accomplished through the use of a small A core replicated on the order of 20 times on an FPGA device. The objective is to maximize the use of on-board random-access memory bandwidth through the use of multi-threaded latency tolerance. Each shortest path core is responsible for one shortest path calculation, and when it is finished it outputs its result and requests the next source from a queue. One of the innovations of this approach is the use of a small bubble sort core to produce the extract-min function. While bubble sort is not usually considered an appropriate algorithm for any non-trivial usage, it is appropriate in this case as it can produce a single minimum out of the list in O(n) cycles, whwere n is the number of elements in the vertext list. The cost of this min operation does not impact the running time of the architecture, because the queue depth for fetching the next set of edges from memory is roughly equivalent to the number of cores in the system. Additionally, this work provides a collection of simulation results that model the behavior of the node queue in hardware. The results show that a hardware queue, implementing a small bubble-type minimum function, need only be on the order of 16 elements to provide both correct and optimal paths. Because the graph database size is measured in the hundreds of megabytes, the Cray SRAM memory is insufficient. In addition to the A* cores, they have developed a memory management system allowing round-robin servicing of the nodes as well as virtual memory managed over the Hypertransport

  13. Partial order approach to compute shortest paths in multimodal networks

    CERN Document Server

    Ensor, Andrew

    2011-01-01

    Many networked systems involve multiple modes of transport. Such systems are called multimodal, and examples include logistic networks, biomedical phenomena, manufacturing process and telecommunication networks. Existing techniques for determining optimal paths in multimodal networks have either required heuristics or else application-specific constraints to obtain tractable problems, removing the multimodal traits of the network during analysis. In this paper weighted coloured--edge graphs are introduced to model multimodal networks, where colours represent the modes of transportation. Optimal paths are selected using a partial order that compares the weights in each colour, resulting in a Pareto optimal set of shortest paths. This approach is shown to be tractable through experimental analyses for random and real multimodal networks without the need to apply heuristics or constraints.

  14. A Graph Search Heuristic for Shortest Distance Paths

    Energy Technology Data Exchange (ETDEWEB)

    Chow, E

    2005-03-24

    This paper presents a heuristic for guiding A* search for finding the shortest distance path between two vertices in a connected, undirected, and explicitly stored graph. The heuristic requires a small amount of data to be stored at each vertex. The heuristic has application to quickly detecting relationships between two vertices in a large information or knowledge network. We compare the performance of this heuristic with breadth-first search on graphs with various topological properties. The results show that one or more orders of magnitude improvement in the number of vertices expanded is possible for large graphs, including Poisson random graphs.

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

    DEFF Research Database (Denmark)

    Kasenburg, Niklas; Darkner, Sune; Hahn, Ute;

    2016-01-01

    that parcellation of the thalamus results in p-value maps that are spatially coherent across subjects. Comparing to the state-of-the-art parcellation of Behrens et al. [1], we observe some agreement, but the soft segmentation exhibits better stability for voxels connected to multiple target regions....... to each cortical target region. Calculation of these statistical measures is derived from a rank-based test on the histogram of tract-based scores from all the shortest paths found between the source voxel and each voxel within the target region. Using data from the Human Connectome Project, we show...

  16. Fully dynamic output bounded single source shortest path problem

    Energy Technology Data Exchange (ETDEWEB)

    Frigioni, D. [Universita di L`Aquila, Coppito (Italy); Marchetti-Spaccamela, A.; Nanni, U. [Universita di Roma (Italy)

    1996-12-31

    We consider the problem of maintaining the distances and the shortest paths from a single source in either a directed or an undirected graph with positive real edge weights, handling insertions, deletions and cost updates of edges. We propose fully dynamic algorithms with optimal space requirements and query time. The cost of update operations depends on the class of the considered graph and on the number of vertices that, due to an edge modification, either change their distance from the source or change their parent in the shortest path tree. In the case of graphs with bounded genus (including planar graphs), bounded degree graphs, bounded treewidth graphs and O-near-planar graphs with bounded {beta}, the update procedures require O(log n) amortized time per vertex update, while for general graphs with n vertices and m edges they require O({radical}m log n) amortized time per vertex update. The solution is based on a dynamization of Dijkstra`s algorithm and requires simple data structures that are suitable for a practical and straightforward implementation.

  17. The shortest time and/or the shortest path strategies in a CA FF pedestrian dynamics model

    CERN Document Server

    Kirik, Ekaterina; Krouglov, Dmitriy

    2009-01-01

    This paper deals with a mathematical model of a pedestrian movement. A stochastic cellular automata (CA) approach is used here. The Floor Field (FF) model is a basis model. FF models imply that virtual people follow the shortest path strategy. But people are followed by a strategy of the shortest time as well. This paper is focused on how to mathematically formalize and implement to a model these features of the pedestrian movement. Some results of a simulation are presented.

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

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

    DEFF Research Database (Denmark)

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

    2016-01-01

    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...... demonstrate that our framework also retains support for conventional interactive constraints such as waypoint regions. We apply our approach to the open access, high quality Human Connectome Project data, as well as a dataset acquired on a typical clinical scanner. Our results show that the use of a learned...... prior substantially increases the overlap of tractography outputwith a reference atlas on both populations, and this is confirmed by visual inspection. Furthermore, we demonstrate how a prior learned on the high quality dataset significantly increases the overlap with the reference for the more typical...

  20. Fast estimation of diameter and shortest paths (without matrix multiplication)

    Energy Technology Data Exchange (ETDEWEB)

    Aingworth, D.; Chekuri, C.; Motwani, R. [Stanford Univ., CA (United States)

    1996-12-31

    Consider the problem of computing all-pairs shortest paths (APSP) in an unweighted, undirected graph G with n vertices and m edges. The recent work of Alon, Galil, and Margalit, Alon, Galil, Margalit, and Naor, and Seidel has led to dramatic progress in devising fast algorithms for this problem. These algorithm are based on formulating the problem in terms of matrices with small integer entries and using fast matrix multiplications. They achieve a time bound of O(n{sup {omega}}){sup 1} where {omega} denotes the exponent in the running time of the matrix multiplication algorithm used. The current best matrix multiplication algorithm is due to Coppersmith and Winograd [CW90] and has {omega} = 2.376. In contrast, the naive algorithm for APSP performs breadth-first searches from each vertex, and requires time {Theta}(nm).

  1. Membrane Boundary Extraction Using a Circular Shortest Path Technique

    Science.gov (United States)

    Sun, Changming; Vallotton, Pascal; Wang, Dadong; Lopez, Jamie; Ng, Yvonne; James, David

    2007-11-01

    Membrane proteins represent over 50% of known drug targets. Accordingly, several widely used assays in the High Content Analysis area rely on quantitative measures of the translocation of proteins between intracellular organelles and the cell surface. In order to increase the sensitivity of these assays, one needs to measure the signal specifically along the membrane, requiring a precise segmentation of this compartment. Doing this manually is a very time-consuming practice, limited to an academic setting. Manual tracing of the membrane compartment also confronts us with issues of objectivity and reproducibility. In this paper, we present an approach based on a circular shortest path technique that enables us to segment the membrane compartment accurately and rapidly. This feature is illustrated using cells expressing epitope-tagged membrane proteins.

  2. Randomized shortest-path problems: two related models.

    Science.gov (United States)

    Saerens, Marco; Achbany, Youssef; Fouss, François; Yen, Luh

    2009-08-01

    This letter addresses the problem of designing the transition probabilities of a finite Markov chain (the policy) in order to minimize the expected cost for reaching a destination node from a source node while maintaining a fixed level of entropy spread throughout the network (the exploration). It is motivated by the following scenario. Suppose you have to route agents through a network in some optimal way, for instance, by minimizing the total travel cost-nothing particular up to now-you could use a standard shortest-path algorithm. Suppose, however, that you want to avoid pure deterministic routing policies in order, for instance, to allow some continual exploration of the network, avoid congestion, or avoid complete predictability of your routing strategy. In other words, you want to introduce some randomness or unpredictability in the routing policy (i.e., the routing policy is randomized). This problem, which will be called the randomized shortest-path problem (RSP), is investigated in this work. The global level of randomness of the routing policy is quantified by the expected Shannon entropy spread throughout the network and is provided a priori by the designer. Then, necessary conditions to compute the optimal randomized policy-minimizing the expected routing cost-are derived. Iterating these necessary conditions, reminiscent of Bellman's value iteration equations, allows computing an optimal policy, that is, a set of transition probabilities in each node. Interestingly and surprisingly enough, this first model, while formulated in a totally different framework, is equivalent to Akamatsu's model ( 1996 ), appearing in transportation science, for a special choice of the entropy constraint. We therefore revisit Akamatsu's model by recasting it into a sum-over-paths statistical physics formalism allowing easy derivation of all the quantities of interest in an elegant, unified way. For instance, it is shown that the unique optimal policy can be obtained by

  3. Self-organization and solution of shortest-path optimization problems with memristive networks

    Science.gov (United States)

    Pershin, Yuriy V.; Di Ventra, Massimiliano

    2013-07-01

    We show that memristive networks, namely networks of resistors with memory, can efficiently solve shortest-path optimization problems. Indeed, the presence of memory (time nonlocality) promotes self organization of the network into the shortest possible path(s). We introduce a network entropy function to characterize the self-organized evolution, show the solution of the shortest-path problem and demonstrate the healing property of the solution path. Finally, we provide an algorithm to solve the traveling salesman problem. Similar considerations apply to networks of memcapacitors and meminductors, and networks with memory in various dimensions.

  4. Output-threshold coupled neural network for solving the shortest path problems

    Institute of Scientific and Technical Information of China (English)

    ZHANG Junying; WANG Defeng; SHI Meihong; WANG Joseph Yue

    2004-01-01

    This paper presents a coupled neural network, called output-threshold coupled neural network (OTCNN), which can mimic the autowaves in the present pulsed coupled neural networks (PCNNs), by the construction of mutual coupling between neuron outputs and the threshold of a neuron. Based on its autowaves, this paper presents a method for finding the shortest path in shortest time with OTCNNs. The method presented here features much fewer neurons needed, simplicity of the structure of the neurons and the networks, and large scale of parallel computation. It is shown that OTCNN is very effective in finding the shortest paths from a single start node to multiple destination nodes for asymmetric weighted graph, with a number of iterations proportional only to the length of the shortest paths, but independent of the complexity of the graph and the total number of existing paths in the graph. Finally, examples for finding the shortest path are presented.

  5. The Time-Synchronous Dynamic Programming Approach to the Shortest Path Search in Spoken Dialog System

    Institute of Scientific and Technical Information of China (English)

    HEWei; YANGSuqiong; YUANBaozong; LINBiqin

    2004-01-01

    Shortest path search has important practical applications and is related to optimization problem.This paper discusses a new algorithm time-synchronous heuristic dynamic programming search, which combined the pruning and global optimization of DP (Dynamic programming) and the partial search of heuristic strategy and found the shortest path in time O(n/kd) (k, d ≥ 1). Furthermore, the algorithm can be applied to find the K shortest paths between a pair of given nodes or all paths less than a given length within the same steps. Finally this algorithm was applied to the shortest path search on the real map and user could use spoken dialog to query shortcut in realtime, 90% of the system responses are correct.

  6. 3D-shortest paths for a hypersonic glider in a heterogeneous environment

    OpenAIRE

    Pharpatara, Pawit; Hérissé, Bruno; Bestaoui, Yasmina

    2015-01-01

    International audience; Shortest paths in 3-dimensional space of a hypersonic glider in a heterogeneous environment are considered in this paper. The environment is heterogeneous in the sense that the maximum curvature of the vehicle path varies and depends on the position of the vehicle. Path generation is based on the Dubins-like model. It assumes that initial and final states are sufficiently far from each other so that the CSC (Curve-Straight line-Curve) path is the shortest path between ...

  7. All-Pairs Shortest Paths in $O(n^2)$ time with high probability

    CERN Document Server

    Peres, Yuval; Sudakov, Benny; Zwick, Uri

    2011-01-01

    We present an all-pairs shortest path algorithm whose running time on a complete directed graph on $n$ vertices whose edge weights are chosen independently and uniformly at random from $[0,1]$ is $O(n^2)$, in expectation and with high probability. This resolves a long standing open problem. The algorithm is a variant of the dynamic all-pairs shortest paths algorithm of Demetrescu and Italiano. The analysis relies on a proof that the number of \\emph{locally shortest paths} in such randomly weighted graphs is $O(n^2)$, in expectation and with high probability. We also present a dynamic version of the algorithm that recomputes all shortest paths after a random edge update in $O(\\log^{2}n)$ expected time.

  8. The role of convexity for solving some shortest path problems in plane without triangulation

    Science.gov (United States)

    An, Phan Thanh; Hai, Nguyen Ngoc; Hoai, Tran Van

    2013-09-01

    Solving shortest path problems inside simple polygons is a very classical problem in motion planning. To date, it has usually relied on triangulation of the polygons. The question: "Can one devise a simple O(n) time algorithm for computing the shortest path between two points in a simple polygon (with n vertices), without resorting to a (complicated) linear-time triangulation algorithm?" raised by J. S. B. Mitchell in Handbook of Computational Geometry (J. Sack and J. Urrutia, eds., Elsevier Science B.V., 2000), is still open. The aim of this paper is to show that convexity contributes to the design of efficient algorithms for solving some versions of shortest path problems (namely, computing the convex hull of a finite set of points and convex rope on rays in 2D, computing approximate shortest path between two points inside a simple polygon) without triangulation on the entire polygons. New algorithms are implemented in C and numerical examples are presented.

  9. Threshold-Based Shortest Path Query over Large Correlated Uncertain Graphs

    Institute of Scientific and Technical Information of China (English)

    成雨蓉; 袁野; 陈雷; 王国仁

    2015-01-01

    With the popularity of uncertain data, queries over uncertain graphs have become a hot topic in the database community. As one of the important queries, the shortest path query over an uncertain graph has attracted much attention of researchers due to its wide applications. Although there are some efficient solutions addressing this problem, all existing models ignore an important property existing in uncertain graphs: the correlation among the edges sharing the same vertex. In this paper, we apply Markov network to model the hidden correlation in uncertain graphs and compute the shortest path. Unfortunately, calculating the shortest path and corresponding probability over uncertain graphs modeled by Markov networks is a #P-hard problem. Thus, we propose a filtering-and-verification framework to accelerate the queries. In the filtering phase, we design a probabilistic shortest path index based on vertex cuts and blocks of a graph. We find a series of upper bounds and prune the vertices and edges whose upper bounds of the shortest path probability are lower than the threshold. By carefully picking up the blocks and vertex cuts, the index is optimized to have the maximum pruning capability, so that we can filter a large number of vertices which make no contribution to the final shortest path query results. In the verification phase, we develop an efficient sampling algorithm to determine the final query answers. Finally, we verify the efficiency and effectiveness of our solutions with extensive experiments.

  10. Using Moore Dijkstra Algorithm with Multi-Agent System to Find Shortest Path over Network

    Directory of Open Access Journals (Sweden)

    Basem Alrifai

    2015-06-01

    Full Text Available finding the shortest path over network is very difficult and it is the target for much research, after many researches get the result in many of algorithm and many a mount based on the performance for these algorithm .Shortest paths problems are familiar problems in computer science and mathematics. In these problems, edge weights may represent distances, costs, or any other real-valued quantity that can be added along a path, and that one may wish to minimize. Thus, edge weights are real numbers and the specific operations used are addition to compute the weight of a path and minimum to select the best path weight. In this paper we use the Dijkstra's algorithm with new technique to find the shortest path over network to reduce the time we need to find the best path, in this paper we use node for network with the same value which can be use it to find the shortest path but this depend on the number of transition for every node when the node have high number then the node have the high priority to choose it by using this method we descries the time to find the short path .to make this algorithm more distinguish apply multi-agent system ( Automata with multiplicities to find the short path.

  11. A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs

    CERN Document Server

    Qureshi, Muhammad Aasim; Safdar, Sohail; Akbar, Rehan

    2009-01-01

    In most of the shortest path problems like vehicle routing problems and network routing problems, we only need an efficient path between two points source and destination, and it is not necessary to calculate the shortest path from source to all other nodes. This paper concentrates on this very idea and presents an algorithm for calculating shortest path for (i) nonnegative weighted undirected graphs (ii) unweighted undirected graphs. The algorithm completes its execution in O(E) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node. The main advantage of the algorithms is its simplicity and it does not need complex data structures for implementations.

  12. Multi-Objective and Multi-Constrained Non-Additive Shortest Path Problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Pisinger, David

    of this paper is to give a general framework for dominance tests for problems involving a number of non-additive criteria. These dominance tests can help eliminate paths in a dynamic programming framework when using multiple objectives. Results on real-life multi-objective problems containing non......Shortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems, additivity of the objective is a de-facto assumption, but in many real-life situations objectives and criteria, can be non-additive. The purpose...

  13. Multi-Objective and Multi-Constrained Non-Additive Shortest Path Problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Pisinger, David

    2011-01-01

    of this paper is to give a general framework for dominance tests for problems involving a number of non-additive criteria. These dominance tests can help to eliminate paths in a dynamic programming framework when using multiple objectives. Results on real-life multi-objective problems containing non......Shortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems, additivity of the objective is a de-facto assumption, but in many real-life situations objectives and criteria, can be non-additive. The purpose...

  14. An Evaluation of Potentials of Genetic Algorithm in Shortest Path Problem

    Science.gov (United States)

    Hassany Pazooky, S.; Rahmatollahi Namin, Sh; Soleymani, A.; Samadzadegan, F.

    2009-04-01

    One of the most typical issues considered in combinatorial systems in transportation networks, is the shortest path problem. In such networks, routing has a significant impact on the network's performance. Due to natural complexity in transportation networks and strong impact of routing in different fields of decision making, such as traffic management and vehicle routing problem (VRP), appropriate solutions to solve this problem are crucial to be determined. During last years, in order to solve the shortest path problem, different solutions are proposed. These techniques are divided into two categories of classic and evolutionary approaches. Two well-known classic algorithms are Dijkstra and A*. Dijkstra is known as a robust, but time consuming algorithm in finding the shortest path problem. A* is also another algorithm very similar to Dijkstra, less robust but with a higher performance. On the other hand, Genetic algorithms are introduced as most applicable evolutionary algorithms. Genetic Algorithm uses a parallel search method in several parts of the domain and is not trapped in local optimums. In this paper, the potentiality of Genetic algorithm for finding the shortest path is evaluated by making a comparison between this algorithm and classic algorithms (Dijkstra and A*). Evaluation of the potential of these techniques on a transportation network in an urban area shows that due to the problem of classic methods in their small search space, GA had a better performance in finding the shortest path.

  15. A shortest path algorithm for moving objects in spatial network databases

    Institute of Scientific and Technical Information of China (English)

    Xiaolan Yin; Zhiming Ding; Jing Li

    2008-01-01

    One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. A location of a car on a road network, and a set of objects of interests, e.g. Hotels,gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm's complexity is O(klog2i), and traditional Dijkstra's complexity is O((I + k)2).

  16. Analysis of Brownian Particles for finding the shortest path in networks

    Directory of Open Access Journals (Sweden)

    huan yan qian

    2013-07-01

    Full Text Available In this paper, we propose a method to analyze the shortest path finding between two nodes in complex networks. In this method, we first find that single Brownian particle follows the shortest path between source node and destination node in the probability of where denotes the shortest path steps between two nodes. To be compared with single particle utilization, then we specially analyze the multiple particles. We compute the probability of particles’ taking the shortest path between and when particles starts simultaneously from the source and head to the destination as . It’s very clear that there must be particles taking the shortest path to arrive at the destination in the multiple particles environment. And with the number of increasing, the arriving probability first arise and then drop down rapidly until to zero. In the end, we make the experiments and confirm our theoretical analysis. Our results would provide valuable usage for some applications such as finding the optimal routing in wireless sensor networks.

  17. Minimizing Communication in All-Pairs Shortest Paths

    Science.gov (United States)

    2013-02-13

    processor performs n unblocked rank-1 updates on its local submatrix in sequence . Obtaining high-performance in practice requires increasing temporal locality...problem (DOMN). Their algorithm runs in O(n3) time using a Fibonacci heap, and the dual problem can be used to obtain the actual paths. Unfortunately...sets, while a blocked-step reduces the number of active processors. These two steps are demonstrated in sequence in Figure 5 with 16 processors. We

  18. Scaling limits for shortest path lengths along the edges of stationary tessellations - Supplementary material

    CERN Document Server

    Voss, Florian; Schmidt, Volker

    2009-01-01

    We consider spatial stochastic models, which can be applied e.g. to telecommunication networks with two hierarchy levels. In particular, we consider two Cox processes concentrated on the edge set of a random tessellation, where the points can describe the locations of low-level and high-level network components, respectively, and the edge set the underlying infrastructure of the network, like road systems, railways, etc. Furthermore, each low-level component is marked with the shortest path along the edge set to the nearest high-level component. We investigate the typical shortest path length of the resulting marked point process, which is an important characteristic e.g. in performance analysis and planning of telecommunication networks. In particular, we show that its distribution converges to simple parametric limit distributions if a certain scaling factor converges to zero and infinity, respectively. This can be used to approximate the density of the typical shortest path length by analytical formulae.

  19. A self-organizing shortest path finding strategy on complex networks

    Institute of Scientific and Technical Information of China (English)

    Shen Yi; Pei Wen-Jiang; Wang Kai; Wang Shao-Ping

    2009-01-01

    The shortcomings of traditional methods to find the shortest path are revealed,and a strategy of finding the selforganizing shortest path based on thermal flux diffusion on complex networks is presented. In our method,the shortest paths between the source node and the other nodes are found to be self-organized by comparing node temperatures. The computation complexity of the method scales linearly with the number of edges on underlying networks. The effects of the method on several networks,including a regular network proposed by Ravasz and Barabási which is called the RB network,a real network,a random network proposed by Ravasz and Barabási which is called the ER network and a scale-free network,are also demonstrated. Analytic and simulation results show that the method has a higher accuracy and lower computational complexity than the conventional methods.

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

  1. Shortest Path Planning for a Tethered Robot or an Anchored Cable

    Energy Technology Data Exchange (ETDEWEB)

    Xavier, P.G.

    1999-02-22

    We consider the problem of planning shortest paths for a tethered robot with a finite length tether in a 2D environment with polygonal obstacles. We present an algorithm that runs in time O((k{sub 1} + 1){sup 2}n{sup 4}) and finds the shortest path or correctly determines that none exists that obeys the constraints; here n is the number obstacle vertices, and k{sub 1} is the number loops in the initial configuration of the tether. The robot may cross its tether but nothing can cross obstacles, which cause the tether to bend. The algorithm applies as well for planning a shortest path for the free end of an anchored cable.

  2. Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths

    DEFF Research Database (Denmark)

    Brodal, G.S.; Fagerberg, R.; Meyer, U.;

    2004-01-01

    We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge weights. Our results removes the performance gap between the currently best cache-aware algorithms for these problems...... and their cache-oblivious counterparts. Our shortest-path algorithm relies on a new data structure, called bucket heap, which is the first cache-oblivious priority queue to efficiently support a weak DecreaseKey operation....

  3. GENERALIZATION OF DIJKSTRA’S ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN DIRECTED MULTIGRAPHS

    Directory of Open Access Journals (Sweden)

    Siddhartha Sankar Biswas

    2013-01-01

    Full Text Available The classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to multigraphs. In this study the authors generalize the classical Dijkstra’s algorithm to make it applicable to directed multigraphs. The modified algorithm is called by Generalized Dijkstra’s algorithm or GD Algorithm (GDA in short. The GDA outputs the shortest paths and the corresponding min cost. It is claimed that GDA may play a major role in many application areas of computer science, communication, transportation systems, in particular in those networks which cannot be modeled into graphs but into multigraphs."

  4. Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values

    Institute of Scientific and Technical Information of China (English)

    LIU Longcheng; HE Yong

    2006-01-01

    In this paper, we consider two network improvement problems with given discrete values: the inverse minimum spanning tree problem and the reverse shortest-path problem, where the decrements of the weight of the edges are given discrete values. First,for the three models of the inverse minimum spanning tree problem (the sum-type, the bottleneck-type and the constrained bottlenecktype), we present their respective strongly polynomial algorithms. Then, we show that the reverse shortest-path problem is strongly NP-complete.

  5. Coarse-Grained Parallel Genetic Algorithm to solve the Shortest Path Routing problem using Genetic operators

    Directory of Open Access Journals (Sweden)

    V.PURUSHOTHAM REDDY

    2011-02-01

    Full Text Available In computer networks the routing is based on shortest path routing algorithms. Based on its advantages, an alternative method is used known as Genetic Algorithm based routing algorithm, which is highly scalable and insensitive to variations in network topology. Here we propose a coarse-grained parallel genetic algorithm to solve the shortest path routing problem with the primary goal of computation time reduction along with the use of migration scheme. This algorithm is developed and implemented on an MPI cluster. The effects of migration and its performance is studied in this paper.

  6. Finding of Shortest Path from Source to Destination by Traversing every Node in wired Network.

    OpenAIRE

    Avdhesh kumar sharma; Sourabh kumar

    2013-01-01

    At present communication and transportation has an important place in every person life in their all business and non-business task. In daily life everybody is facing a problem of choosing a shortest pathfrom one location to another location. Shortest path means the path which has minimum mileage or distance covered. It saves time and money both which are essential parts of our life. In this paper, wewant to propose a technique to resolving this problem by traversing the whole network and fin...

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

    Science.gov (United States)

    Li, Longxiang; Gong, Jianhua; Zhou, Jieping

    2014-01-01

    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.

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

    DEFF Research Database (Denmark)

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

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

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

  10. A Practical Parallel Algorithm for All-Pair Shortest Path Based on Pipelining

    Institute of Scientific and Technical Information of China (English)

    Hua Wang; Ling Tian; Chun-Hua Jiang

    2008-01-01

    On the basis of Floyd algorithm with theextended path matrix, a parallel algorithm whichresolves all-pair shortest path (APSP) problem oncluster environment is analyzed and designed.Meanwhile, the parallel APSP pipelining algorithmmakes full use of overlapping technique betweencomputation and communication. Compared withbroadcast operation, the parallel algorithm reducescommunication cost. This algorithm has beenimplemented on MPI on PC-cluster. The theoreticalanalysis and experimental results show that the parallelalgorithm is an efficient and scalable algorithm.

  11. Using Link Analysis Technique with a Modified Shortest-Path Algorithm to Fight Money Laundering

    Institute of Scientific and Technical Information of China (English)

    CHEN Yunkai; MAI Quanwen; LU Zhengding

    2006-01-01

    Effective link analysis techniques are needed to help law enforcement and intelligence agencies fight money laundering.This paper presents a link analysis technique that uses a modified shortest-path algorithms to identify the strongest association paths between entities in a money laundering network.Based on two-tree Dijkstra and Priority-First-Search (PFS) algorithm, a modified algorithm is presented.To apply the algorithm, a network representation transformation is made first.

  12. Traffic-engineering-aware shortest-path routing and its application in IP-over-WDM networks [Invited

    Science.gov (United States)

    Lee, Youngseok; Mukherjee, Biswanath

    2004-03-01

    Single shortest-path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal-cost multiple shortest paths in open shortest path first and intermediate system-intermediate system protocols does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, a TE-aware shortest path among all the equal-cost multiple shortest paths between each ingress-egress pair can be selected such that the maximum link load is significantly reduced. IP routers can use the globally optimal TE-aware shortest path without any change to existing routing protocols and without any serious configuration overhead. While calculating TE-aware shortest paths, the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next hop toward the destination by looking up the destination prefix. We present a mathematical problem formulation for finding a set of TE-aware shortest paths for the given network as an integer linear program, and we propose a simple heuristic for solving large instances of the problem. Then we explore the usage of our proposed algorithm for the integrated TE method in IP-over-WDM networks. The proposed algorithm is evaluated through simulations in IP networks as well as in IP-over-WDM networks.

  13. AN AUTOMATED REFERENCE POINT-LIKE APPROACH FOR MULTICRITERIA SHORTEST PATH PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Jo(a)o C. N. CL(I)ACO; José M. F. CRAVEIRINHA; Marta M. B. PASCOAL

    2006-01-01

    In this paper we introduce a method of analysis for the automated ordering and selection of solutions of a multicriteria shortest path model. The method is based on a reference point approach, where the paths in a specific priority region are ranked by non-decreasing order of a Chebyshev metric.In order to list paths according with this objective function a labelling algorithm is proposed. The developed method is applied in a video-traffic routing context. Computational results are presented and analysed, for randomly generated networks of significant dimension.

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

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

    DEFF Research Database (Denmark)

    Arge, Lars; Meyer, Ulrich; Toma, Laura

    2004-01-01

    We present several new external-memory algorithms for finding all-pairs shortest paths in a V -node, Eedge undirected graph. For all-pairs shortest paths and diameter in unweighted undirected graphs we present cache-oblivious algorithms with O(V · E B logM B E B) I/Os, where B is the block......-size and M is the size of internal memory. For weighted undirected graphs we present a cache-aware APSP algorithm that performs O(V · ( V E B +E B log E B )) I/Os. We also present efficient cacheaware algorithms that find paths between all pairs of vertices in an unweighted graph with lengths within a small...... additive constant of the shortest path length. All of our results improve earlier results known for these problems. For approximate APSP we provide the first nontrivial results. Our diameter result uses O(V + E) extra space, and all of our other algorithms use O(V 2) space....

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

    Science.gov (United States)

    Jiang, Xin; Wang, Hailong; Tang, Shaoting; Ma, Lili; Zhang, Zhanli; Zheng, Zhiming

    2011-01-01

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

  17. The d-edge shortest-path problem for a Monge graph

    Energy Technology Data Exchange (ETDEWEB)

    Bein, W.W. [New Mexico Univ., Albuquerque, NM (United States). Dept. of Computer Science; Larmore, L.L. [California Univ., Riverside, CA (United States). Dept. of Computer Science; Park, J.K. [Sandia National Labs.,Albuquerque, NM (United States)

    1992-07-14

    A complete edge-weighted directed graph on vertices 1,2,...,n that assigns cost c(i,j) to the edge (i,j) is called Monge if its edge costs form a Monge array, i.e., for all i < k and j < l, c[i, j]+c[k,l]{le} < c[i,l]+c[k,j]. One reason Monge graphs are interesting is that shortest paths can be computed quite quickly in such graphs. In particular, Wilber showed that the shortest path from vertex 1 to vertex n of a Monge graph can be computed in O(n) time, and Aggarwal, Klawe, Moran, Shor, and Wilber showed that the shortest d-edge 1-to-n path (i.e., the shortest path among all 1-to-n paths with exactly d edges) can be computed in O(dn) time. This paper`s contribution is a new algorithm for the latter problem. Assuming 0 {le} c[i,j] {le} U and c[i,j + 1] + c[i + 1,j] {minus} c[i,j] {minus} c[i + 1, j + 1] {ge} L > 0 for all i and j, our algorithm runs in O(n(1 + 1g(U/L))) time. Thus, when d {much_gt} 1 + 1g(U/L), our algorithm represents a significant improvement over Aggarwal et al.`s O(dn)-time algorithm. We also present several applications of our algorithm; they include length-limited Huffman coding, finding the maximum-perimeter d-gon inscribed in a given convex n-gon, and a digital-signal-compression problem.

  18. Finding Community Structure in Networks Using a Shortest-Path-Based k-Means Algorithm

    Institute of Scientific and Technical Information of China (English)

    Jinglu GAO

    2013-01-01

    We consider the problem of detecting the community structure in a complex network,groups of nodes with a higher-than-average density of edges connecting them.In this paper we use the simulated annealing strategy to maximize the modularity,which has been indicated as a robust benefit function,associating with a shortest-path-based k-means iterative procedure for network partition.The proposed algorithm can not only find the communities,but also identify the nodes which occupy central positions under the metric of the shortest path within the communities to which they belong.The optimal number of communities can be automatically determined without any prior knowledge about the network structure.The applications to both artificial and real-world networks demonstrate the effectiveness of our algorithm.

  19. Modeling the average shortest-path length in growth of word-adjacency networks

    Science.gov (United States)

    Kulig, Andrzej; DroŻdŻ, Stanisław; Kwapień, Jarosław; OświÈ©cimka, Paweł

    2015-03-01

    We investigate properties of evolving linguistic networks defined by the word-adjacency relation. Such networks belong to the category of networks with accelerated growth but their shortest-path length appears to reveal the network size dependence of different functional form than the ones known so far. We thus compare the networks created from literary texts with their artificial substitutes based on different variants of the Dorogovtsev-Mendes model and observe that none of them is able to properly simulate the novel asymptotics of the shortest-path length. Then, we identify the local chainlike linear growth induced by grammar and style as a missing element in this model and extend it by incorporating such effects. It is in this way that a satisfactory agreement with the empirical result is obtained.

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

    Directory of Open Access Journals (Sweden)

    S. J. de A. LIMA

    2015-07-01

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

  1. Minimum-time trajectory planning based on the shortest path for the wheeled mobile robot

    Institute of Scientific and Technical Information of China (English)

    LIN Feng-yun; LV Tian-sheng

    2006-01-01

    The time-optimal trajectory planning is proposed under kinematic and dynamic constraints for a 2-DOF wheeled robot. In order to make full use of the motor' s capacity, we calculate the maximum torque and the minimum torque by considering the maximum heat-converted power generated by the DC motor. The shortest path is planned by using the geometric method under kinematic constraints. Under the bound torques, the velocity limits and the maximum acceleration (deceleration) are obtained by combining with the dynamics. We utilize the phase-plane analysis technique to generate the time optimal trajectory based on the shortest path. At last, the computer simulations for our laboratory mobile robot were performed. The simulation results prove the proposed method is simple and effective for practical use.

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

    DEFF Research Database (Denmark)

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

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

  3. A Shortest Dependency Path Based Convolutional Neural Network for Protein-Protein Relation Extraction

    OpenAIRE

    2016-01-01

    The state-of-the-art methods for protein-protein interaction (PPI) extraction are primarily based on kernel methods, and their performances strongly depend on the handcraft features. In this paper, we tackle PPI extraction by using convolutional neural networks (CNN) and propose a shortest dependency path based CNN (sdpCNN) model. The proposed method (1) only takes the sdp and word embedding as input and (2) could avoid bias from feature selection by using CNN. We performed experiments on sta...

  4. COAR: Combining Arc flag with Reach based method for shortest path computation

    OpenAIRE

    Thangalatha legaz.C

    2012-01-01

    In general shortest path computation from onenode to another in a directed graph is a verycommon task. This problem is fundamentally solvedby the Dijkstra algorithm. There are manytechniques available to speed up the originalDijkstra’s algorithm heuristically. Even then theoptimality of the solution can still be guaranteed.In this project, the various combinations of speeduptechniques are studied and analyzed. By analyzingthe advantages of the arc flag method and reachbased method, the combin...

  5. All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model

    Directory of Open Access Journals (Sweden)

    Qingshuang Wu

    2013-12-01

    Full Text Available In view of the problem that computing shortest paths in a graph is a complex and time-consuming process, and the traditional algorithm that rely on the CPU as computing unit solely can't meet the demand of real-time processing, in this paper, we present an all-pairs shortest paths algorithm using MPI+CUDA hybrid programming model, which can take use of the overwhelming computing power of the GPU cluster to speed up the processing. This proposed algorithm can combine the advantages of MPI and CUDA programming model, and can realize two-level parallel computing. In the cluster-level, we take use of the MPI programming model to achieve a coarse-grained parallel computing between the computational nodes of the GPU cluster. In the node-level, we take use of the CUDA programming model to achieve a GPU-accelerated fine grit parallel computing in each computational node internal. The experimental results show that the MPI+CUDA-based parallel algorithm can take full advantage of the powerful computing capability of the GPU cluster, and can achieve about hundreds of time speedup; The whole algorithm has good computing performance, reliability and scalability, and it is able to meet the demand of real-time processing of massive spatial shortest path analysis

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

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

  8. A Practical Parallel Algorithm for All-Pair Shortest Path Based on Pipelining

    Institute of Scientific and Technical Information of China (English)

    Hua Wang; Ling Tian; Chun-Hua Jiang

    2008-01-01

    On the basis of Floyd algorithm with the extended path matrix, a parallel algorithm which resolves all-pair shortest path (APSP) problem on cluster environment is analyzed and designed. Meanwhile, the parallel APSP pipelining algorithm makes full use of overlapping technique between computation and communication. Compared with broadcast operation, the parallel algorithm reduces communication cost. This algorithm has been implemented on MPI on PC-cluster. The theoretical analysis and experimental results show that the parallel algorithm is an efficient and scalable algorithm.

  9. a Modified Genetic Algorithm for Finding Fuzzy Shortest Paths in Uncertain Networks

    Science.gov (United States)

    Heidari, A. A.; Delavar, M. R.

    2016-06-01

    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.

  10. Research on the Optimization and Simulation of the Shortest Path Based on Algorithm of Dijkstra

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    <正>Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved Dijkstra algorithm is got.Then apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.

  11. An improved real-time endovascular guidewire position simulation using shortest path algorithm.

    Science.gov (United States)

    Qiu, Jianpeng; Qu, Zhiyi; Qiu, Haiquan; Zhang, Xiaomin

    2016-09-01

    In this study, we propose a new graph-theoretical method to simulate guidewire paths inside the carotid artery. The minimum energy guidewire path can be obtained by applying the shortest path algorithm, such as Dijkstra's algorithm for graphs, based on the principle of the minimal total energy. Compared to previous results, experiments of three phantoms were validated, revealing that the first and second phantoms overlap completely between simulated and real guidewires. In addition, 95 % of the third phantom overlaps completely, and the remaining 5 % closely coincides. The results demonstrate that our method achieves 87 and 80 % improvements for the first and third phantoms under the same conditions, respectively. Furthermore, 91 % improvements were obtained for the second phantom under the condition with reduced graph construction complexity.

  12. An Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing Problem

    Directory of Open Access Journals (Sweden)

    Salman Yussof

    2011-01-01

    Full Text Available Problem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to variations in network topologies. However, it is also known that GA-based routing algorithm is not fast enough for real-time computation. Approach: To improve the computation time of GA-based routing algorithm, this study proposes a coarse-grained parallel GA routing algorithm for solving the shortest path routing problem. The proposed algorithm is evaluated using simulation where the proposed algorithm is executed on networks with various topologies and sizes. The parallel computation is performed using an MPI cluster. Three different experiments were conducted to identify the best value for the migration rate, the accuracy and execution time with respect to the number of computing nodes and speedup achieved as compared to the serial version of the same algorithm. Results: The result of the simulation shows that the best result is achieved for a migration rate around 0.1 and 0.2. The experiments also show that with larger number of computing nodes, accuracy decreases linearly, but computation time decreases exponentially, which justifies the use parallel implementation of GA to improve the speed of GA-based routing algorithm. Finally, the experiments also show that the proposed algorithm is able to achieve a speedup of up to 818.11% on the MPI cluster used to run the simulation. Conclusion/Recommendations: We have successfully shown that the performance of GA-based shortest path routing algorithm can be improved by using a coarse-grained parallel GA implementation. Even though in this study the proposed algorithm is executed

  13. A Bio-Inspired Method for the Constrained Shortest Path Problem

    Directory of Open Access Journals (Sweden)

    Hongping Wang

    2014-01-01

    optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem. In this paper, we propose an innovative method which is based on the internal mechanism of the adaptive amoeba algorithm. The proposed method is divided into two parts. In the first part, we employ the original amoeba algorithm to solve the shortest path problem in directed networks. In the second part, we combine the Physarum algorithm with a bio-inspired rule to deal with the CSP. Finally, by comparing the results with other method using an examples in DCLC problem, we demonstrate the accuracy of the proposed method.

  14. The Structure of the Optimal Solution Set on the Shortest Paths for Networks%网络最短的最优解集结构

    Institute of Scientific and Technical Information of China (English)

    张振坤; 王斌

    2007-01-01

    The shortest path problem in a network G is to find shortest paths between some specified source vertices and terminal vertices when the lengths of edges are given.The structure of the optimal Solutions set on the shortest paths is studied in this Paper.First,the conditions of having unique shortest path between two distinguished vertices s and t in a network G are discussed;Second,the struetural properties of 2-transformation graph G on the shortest-paths for G are presented heavily.

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

  16. Efficient shortest-path-tree computation in network routing based on pulse-coupled neural networks.

    Science.gov (United States)

    Qu, Hong; Yi, Zhang; Yang, Simon X

    2013-06-01

    Shortest path tree (SPT) computation is a critical issue for routers using link-state routing protocols, such as the most commonly used open shortest path first and intermediate system to intermediate system. Each router needs to recompute a new SPT rooted from itself whenever a change happens in the link state. Most commercial routers do this computation by deleting the current SPT and building a new one using static algorithms such as the Dijkstra algorithm at the beginning. Such recomputation of an entire SPT is inefficient, which may consume a considerable amount of CPU time and result in a time delay in the network. Some dynamic updating methods using the information in the updated SPT have been proposed in recent years. However, there are still many limitations in those dynamic algorithms. In this paper, a new modified model of pulse-coupled neural networks (M-PCNNs) is proposed for the SPT computation. It is rigorously proved that the proposed model is capable of solving some optimization problems, such as the SPT. A static algorithm is proposed based on the M-PCNNs to compute the SPT efficiently for large-scale problems. In addition, a dynamic algorithm that makes use of the structure of the previously computed SPT is proposed, which significantly improves the efficiency of the algorithm. Simulation results demonstrate the effective and efficient performance of the proposed approach.

  17. A genetic algorithm for the pareto optimal solution set of multi-objective shortest path problem

    Institute of Scientific and Technical Information of China (English)

    HU Shi-cheng; XU Xiao-fei; ZHAN De-chen

    2005-01-01

    Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the multi-objective shortest path problem (MSPP) has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algorithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this paper. The encoding of the solution and the operators such as crossover, mutation and selection are developed.The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.

  18. Analysis of Average Shortest-Path Length of Scale-Free Network

    Directory of Open Access Journals (Sweden)

    Guoyong Mao

    2013-01-01

    Full Text Available Computing the average shortest-path length of a large scale-free network needs much memory space and computation time. Hence, parallel computing must be applied. In order to solve the load-balancing problem for coarse-grained parallelization, the relationship between the computing time of a single-source shortest-path length of node and the features of node is studied. We present a dynamic programming model using the average outdegree of neighboring nodes of different levels as the variable and the minimum time difference as the target. The coefficients are determined on time measurable networks. A native array and multimap representation of network are presented to reduce the memory consumption of the network such that large networks can still be loaded into the memory of each computing core. The simplified load-balancing model is applied on a network of tens of millions of nodes. Our experiment shows that this model can solve the load-imbalance problem of large scale-free network very well. Also, the characteristic of this model can meet the requirements of networks with ever-increasing complexity and scale.

  19. Two-point L1 shortest path queries in the plane

    Directory of Open Access Journals (Sweden)

    Danny Z. Chen

    2016-12-01

    Full Text Available Let $P$ be a set of $h$ pairwise-disjoint polygonal obstacles with a total of $n$ vertices in the plane. We consider the problem of building a data structure that can quickly compute an $L_1$ shortest obstacle-avoiding path between any two  query points $s$ and $t$. Previously, a data structure of size $O(n^2\\log n$ was constructed in $O(n^2\\log^2 n$ time that answers each two-point query in $O(\\log^2 n+k$ time, i.e., the shortest path length is reported in $O(\\log^2 n$ time and an actual path is reported in additional $O(k$ time, where $k$ is the number of edges of the output path. In this paper, we build a new data structure of size $O(n+h^2 \\log h 4^{\\sqrt{\\log h}}$ in $O(n+h^2 \\log^{2}h 4^{\\sqrt{\\log h}}$ time that answers each query in $O(\\log n+k$ time. (In contrast, for the Euclidean version of this two-point query problem, the best known algorithm uses $O(n^{11}$ space to achieve an $O(\\log n+k$ query time. Further, we extend our techniques to the weighted rectilinear version in which the ``obstacles" of $P$ are rectilinear regions with ``weights" and allow $L_1$ paths to travel through them with weighted costs. Previously, a data structure of size $O(n^2\\log^2 n$ was built in $O(n^2\\log^2 n$ time that answers each query in $O(\\log^2 n+k$ time. Our new algorithm answers each query in $O(\\log n+k$ time with a data structure of size $O(n^2 \\log n 4^{\\sqrt{\\log n}}$ that is built in $O(n^2 \\log^2 n 4^{\\sqrt{\\log n}}$ time.

  20. Enhanced Genetic Algorithm approach for Solving Dynamic Shortest Path Routing Problems using Immigrants and Memory Schemes

    CERN Document Server

    Nair, T R Gopalakrishnan; Yashoda, M B

    2011-01-01

    In Internet Routing, the static shortest path (SP) problem has been addressed using well known intelligent optimization techniques like artificial neural networks, genetic algorithms (GAs) and particle swarm optimization. Advancement in wireless communication lead more and more mobile wireless networks, such as mobile networks [mobile ad hoc networks (MANETs)] and wireless sensor networks. Dynamic nature of the network is the main characteristic of MANET. Therefore, the SP routing problem in MANET turns into dynamic optimization problem (DOP). Here the nodes ae made aware of the environmental condition, thereby making it intelligent, which goes as the input for GA. The implementation then uses GAs with immigrants and memory schemes to solve the dynamic SP routing problem (DSPRP) in MANETS. In our paper, once the network topology changes, the optimal solutions in the new environment can be searched using the new immigrants or the useful information stored in the memory. Results shows GA with new immigrants sho...

  1. A Shortest Dependency Path Based Convolutional Neural Network for Protein-Protein Relation Extraction

    Directory of Open Access Journals (Sweden)

    Lei Hua

    2016-01-01

    Full Text Available The state-of-the-art methods for protein-protein interaction (PPI extraction are primarily based on kernel methods, and their performances strongly depend on the handcraft features. In this paper, we tackle PPI extraction by using convolutional neural networks (CNN and propose a shortest dependency path based CNN (sdpCNN model. The proposed method (1 only takes the sdp and word embedding as input and (2 could avoid bias from feature selection by using CNN. We performed experiments on standard Aimed and BioInfer datasets, and the experimental results demonstrated that our approach outperformed state-of-the-art kernel based methods. In particular, by tracking the sdpCNN model, we find that sdpCNN could extract key features automatically and it is verified that pretrained word embedding is crucial in PPI task.

  2. A Shortest Dependency Path Based Convolutional Neural Network for Protein-Protein Relation Extraction.

    Science.gov (United States)

    Hua, Lei; Quan, Chanqin

    2016-01-01

    The state-of-the-art methods for protein-protein interaction (PPI) extraction are primarily based on kernel methods, and their performances strongly depend on the handcraft features. In this paper, we tackle PPI extraction by using convolutional neural networks (CNN) and propose a shortest dependency path based CNN (sdpCNN) model. The proposed method (1) only takes the sdp and word embedding as input and (2) could avoid bias from feature selection by using CNN. We performed experiments on standard Aimed and BioInfer datasets, and the experimental results demonstrated that our approach outperformed state-of-the-art kernel based methods. In particular, by tracking the sdpCNN model, we find that sdpCNN could extract key features automatically and it is verified that pretrained word embedding is crucial in PPI task.

  3. Moving Domestic Robotics Control Method Based on Creating and Sharing Maps with Shortest Path Findings and Obstacle Avoidance

    Directory of Open Access Journals (Sweden)

    Kohei Arai

    2013-02-01

    Full Text Available Control method for moving robotics in closed areas based on creation and sharing maps through shortest path findings and obstacle avoidance is proposed. Through simulation study, a validity of the proposed method is confirmed. Furthermore, the effect of map sharing among robotics is also confirmed together with obstacle avoidance with cameras and ultrasonic sensors.

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

  5. Energy-Efficient Shortest Path Algorithms for Convergecast in Sensor Networks

    CERN Document Server

    Augustine, John; Loden, Philip; Lodha, Sachin; Roy, Sasanka

    2009-01-01

    We introduce a variant of the capacitated vehicle routing problem that is encountered in sensor networks for scientific data collection. Consider an undirected graph $G=(V \\cup \\{\\mathbf{sink}\\},E)$. Each vertex $v \\in V$ holds a constant-sized reading normalized to 1 byte that needs to be communicated to the $\\mathbf{sink}$. The communication protocol is defined such that readings travel in packets. The packets have a capacity of $k$ bytes. We define a {\\em packet hop} to be the communication of a packet from a vertex to its neighbor. Each packet hop drains one unit of energy and therefore, we need to communicate the readings to the $\\mathbf{sink}$ with the fewest number of hops. We show this problem to be NP-hard and counter it with a simple distributed $(2-\\frac{3}{2k})$-approximation algorithm called {\\tt SPT} that uses the shortest path tree rooted at the $\\mathbf{sink}$. We also show that {\\tt SPT} is absolutely optimal when $G$ is a tree and asymptotically optimal when $G$ is a grid. Furthermore, {\\tt ...

  6. Protein-fold recognition using an improved single-source K diverse shortest paths algorithm.

    Science.gov (United States)

    Lhota, John; Xie, Lei

    2016-04-01

    Protein structure prediction, when construed as a fold recognition problem, is one of the most important applications of similarity search in bioinformatics. A new protein-fold recognition method is reported which combines a single-source K diverse shortest path (SSKDSP) algorithm with Enrichment of Network Topological Similarity (ENTS) algorithm to search a graphic feature space generated using sequence similarity and structural similarity metrics. A modified, more efficient SSKDSP algorithm is developed to improve the performance of graph searching. The new implementation of the SSKDSP algorithm empirically requires 82% less memory and 61% less time than the current implementation, allowing for the analysis of larger, denser graphs. Furthermore, the statistical significance of fold ranking generated from SSKDSP is assessed using ENTS. The reported ENTS-SSKDSP algorithm outperforms original ENTS that uses random walk with restart for the graph search as well as other state-of-the-art protein structure prediction algorithms HHSearch and Sparks-X, as evaluated by a benchmark of 600 query proteins. The reported methods may easily be extended to other similarity search problems in bioinformatics and chemoinformatics. The SSKDSP software is available at http://compsci.hunter.cuny.edu/~leixie/sskdsp.html.

  7. Strength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer Networks

    Directory of Open Access Journals (Sweden)

    Subbaraj Potti

    2011-01-01

    Full Text Available Problem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm (SPEA, is presented in this paper to solve the shortest path routing problem. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize both cost and delay objectives simultaneously. Approach: SPEA handles the shortest path routing problem as a true multi-objective optimization problem with competing and noncommensurable objectives. Results: SPEA combines several features of previous multi-objective evolutionary algorithms in a unique manner. SPEA stores nondominated solutions externally in another continuously-updated population and uses a hierarchical clustering algorithm to provide the decision maker with a manageable pareto-optimal set. SPEA is applied to a 20 node network as well as to large size networks ranging from 50-200 nodes. Conclusion: The results demonstrate the capabilities of the proposed approach to generate true and well distributed pareto-optimal nondominated solutions.

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

  9. Computation of the shortest path between two curves on a parametric surface by geodesic-like method

    CERN Document Server

    Chen, Wen-Haw

    2010-01-01

    In this paper, we present the geodesic-like algorithm for the computation of the shortest path between two objects on NURBS surfaces and periodic surfaces. This method can improve the distance problem not only on surfaces but in $\\mathbb{R}^3$. Moreover, the geodesic-like algorithm also provides an efficient approach to simulate the minimal geodesic between two holes on a NURBS surfaces.

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

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

    Directory of Open Access Journals (Sweden)

    David S. Hardin

    2013-04-01

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

  12. A REFINEMENT OF DIJKSTRA’S ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN GENERALIZED REAL TIME-MULTIGRAPHS

    Directory of Open Access Journals (Sweden)

    Siddhartha Sankar Biswas

    2014-01-01

    Full Text Available The networks of the present day communication systems, be it a public road transportation system or a MANET or an Adhoc Network, frequently face a lot of uncertainties in particular regarding traffic jam, flood or water logging or PWD maintenance work (in case of public road network, attack or damage from internal or external agents, sudden failure of one or few nodes. Consequently, at a real instant of time, the existing links/arcs of a given network (graph are not always in their original/excellent condition physically or logically, rather in a weaker condition, or even sometimes disabled or blocked temporarily and waiting for maintenance/repair; and hence ultimately causing delay in communication or transportation. We do not take any special consideration if few of the links be in a better condition at the real time of communication, we consider only such cases where few links are in inferior condition (partially or fully damaged. The classical Dijkstra’s algorithm to find the shortest path in graphs is applicable only if we assume that all the links of the concerned graph are available at their original (ideal condition at that real time of communication, but at real time scenario it is not the case. Consequently, the mathematically calculated shortest path extracted by using Dijkstra’s algorithm may become costlier (even in-feasible in some cases in terms of time and/or in terms of other overhead costs; whereas some other path may be the most efficient or most optimal. Many real life situations of communication network or transportation network cannot be modeled into graphs, but can be well modeled into multigraphs because of the scope of dealing with multiple links (or arcs connecting a pair of nodes. The classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to multigraphs. In this study the authors make a refinement of the classical Dijkstra’s algorithm to make it applicable to directed multigraphs

  13. Spatially-global integration of closed, fragmented contours by finding the shortest-path in a log-polar representation.

    Science.gov (United States)

    Kwon, TaeKyu; Agrawal, Kunal; Li, Yunfeng; Pizlo, Zygmunt

    2016-09-01

    Finding the occluding contours of objects in real 2D retinal images of natural 3D scenes is done by determining, which contour fragments are relevant, and the order in which they should be connected. We developed a model that finds the closed contour represented in the image by solving a shortest path problem that uses a log-polar representation of the image; the kind of representation known to exist in area V1 of the primate cortex. The shortest path in a log-polar representation favors the smooth, convex and closed contours in the retinal image that have the smallest number of gaps. This approach is practical because finding a globally-optimal solution to a shortest path problem is computationally easy. Our model was tested in four psychophysical experiments. In the first two experiments, the subject was presented with a fragmented convex or concave polygon target among a large number of unrelated pieces of contour (distracters). The density of these pieces of contour was uniform all over the screen to minimize spatially-local cues. The orientation of each target contour fragment was randomly perturbed by varying the levels of jitter. Subjects drew a closed contour that represented the target's contour on a screen. The subjects' performance was nearly perfect when the jitter-level was low. Their performance deteriorated as jitter-levels were increased. The performance of our model was very similar to our subjects'. In two subsequent experiments, the subject was asked to discriminate a briefly-presented egg-shaped object while maintaining fixation at several different positions relative to the closed contour of the shape. The subject's discrimination performance was affected by the fixation position in much the same way as the model's.

  14. Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length

    Science.gov (United States)

    Shen, Yi; Ren, Gang; Liu, Yang

    2016-06-01

    In this paper, we propose a biased-shortest path method with minimal congestion. In the method, we use linear-prediction to estimate the queue length of nodes, and propose a dynamic accepting probability function for nodes to decide whether accept or reject the incoming packets. The dynamic accepting probability function is based on the idea of homogeneous network flow and is developed to enable nodes to coordinate their queue length to avoid congestion. A path strategy incorporated with the linear-prediction of the queue length and the dynamic accepting probability function of nodes is designed to allow packets to be automatically delivered on un-congested paths with short traveling time. Our method has the advantage of low computation cost because the optimal paths are dynamically self-organized by nodes in the delivering process of packets with local traffic information. We compare our method with the existing methods such as the efficient path method (EPS) and the optimal path method (OPS) on the BA scale-free networks and a real example. The numerical computations show that our method performs best for low network load and has minimum run time due to its low computational cost and local routing scheme.

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

    Science.gov (United States)

    2015-03-26

    the precursor to the PathFinder model, was built in 2014 and incorporates the rules and historical information inherent to the war game “Drive on...Metz.” While the Metz model reflects the same details and specifications of the original game , the PathFinder model expands the application of the model...applicable to the war- game , “Drive on Metz,” but is not relevant outside this domain. The PathFinder model has potential for adaptation to other hex

  16. THE USE OF GIS TECHNOLOGY TO IDENTIFY THE SHORTEST TRAVEL PATHS. CASE STUDY: THE CITY OF CRAIOVA

    Directory of Open Access Journals (Sweden)

    DANIEL SIMULESCU

    2012-04-01

    Full Text Available In a city with a population of 298.928 inhabitants (January 2009, about 278.7 km of road (without the northern ring road and a road density of 3.1 km/km2, identifying the optimal routes for moving vehicles is a necessary operation under the temporary removal of use (28 months, from March 2011 of some street sectors in the downtown area, which is currently the subject of an infrastructure modernization work, in order to streamline the cars traffic.The optimal routes were identified using Network Analyst extension of ArcGIS Desktop 9.2 software, which calculated the shortest paths between a point of departure and an arrival one, using distance as impedance. In this case the points between which it was intended to identify the shortest routes were selected taking into account the fact that much of the Craiova’s population located in the north – western neighborhoods, faces traffic problems while they are moving toward the center of city. Therefore, this material is intended to be a support, resulted in some maps, in order to identity and choose the best travel route.

  17. Identifying New Candidate Genes and Chemicals Related to Prostate Cancer Using a Hybrid Network and Shortest Path Approach

    Science.gov (United States)

    Yuan, Fei; Zhou, You; Wang, Meng; Yang, Jing; Wu, Kai; Lu, Changhong; Kong, Xiangyin; Cai, Yu-Dong

    2015-01-01

    Prostate cancer is a type of cancer that occurs in the male prostate, a gland in the male reproductive system. Because prostate cancer cells may spread to other parts of the body and can influence human reproduction, understanding the mechanisms underlying this disease is critical for designing effective treatments. The identification of as many genes and chemicals related to prostate cancer as possible will enhance our understanding of this disease. In this study, we proposed a computational method to identify new candidate genes and chemicals based on currently known genes and chemicals related to prostate cancer by applying a shortest path approach in a hybrid network. The hybrid network was constructed according to information concerning chemical-chemical interactions, chemical-protein interactions, and protein-protein interactions. Many of the obtained genes and chemicals are associated with prostate cancer. PMID:26504486

  18. Distributed Localization Algorithm for Wireless Sensor Network Based on Multidimensional Scaling and the Shortest Path Distance Correction

    Institute of Scientific and Technical Information of China (English)

    DING Yingqiang; DU Liufeng; YANG Ting; SUN Yugeng

    2009-01-01

    Sensor localization is crucial for the configuration and applications of wireless sensor network (WSN). A novel distributed localization algorithm, MDS-DC was proposed for wireless sensor network based on multidi-mensional scaling (MDS) and the shortest path distance correction. In MDS-DC, several local positioning regions with reasonable distribution were firstly constructed by an adaptive search algorithm, which ensures the mergence between the local relative maps of the adjacent local position regions and can reduce the number of common nodes in the network. Then, based on the relationships between the estimated distances and actual distances of anchors, the distance estimation vectors of sensors around anchors were corrected in each local positioning region. During the computations of the local relative coordinates, an iterative process, which is the combination of classical MDS algorithm and SMACOF algorithm, was applied. Finally, the global relative positions or absolute positions of sen-sors were obtained through merging the relative maps of all local positioning regions. Simulation results show that MDS-DC has better performances in positioning precision, energy efficiency and robustness to range error, which can meet the requirements of applications for sensor localization in WSN.

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

  20. Linear Time Algorithms Based on Multilevel Prefix Tree for Finding Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks

    CERN Document Server

    Planeta, David S

    2007-01-01

    In this paper I present general outlook on questions relevant to the basic graph algorithms; Finding the Shortest Path with Positive Weights and Minimum Spanning Tree. I will show so far known solution set of basic graph problems and present my own. My solutions to graph problems are characterized by their linear worst-case time complexity. It should be noticed that the algorithms which compute the Shortest Path and Minimum Spanning Tree problems not only analyze the weight of arcs (which is the main and often the only criterion of solution hitherto known algorithms) but also in case of identical path weights they select this path which walks through as few vertices as possible. I have presented algorithms which use priority queue based on multilevel prefix tree -- PTrie. PTrie is a clever combination of the idea of prefix tree -- Trie, the structure of logarithmic time complexity for insert and remove operations, doubly linked list and queues. In C++ I will implement linear worst-case time algorithm computin...

  1. Logistics Distribution Shortest Path Based on Dijkstra Algorithm%基于Dijkstra算法的物流配送最短路径算法研究

    Institute of Scientific and Technical Information of China (English)

    王华

    2011-01-01

    根据城市交通网络的特点,运用结点一弧段一有向线结构描述交通网络,利用动态分段技术建立了基于ARC-GIS的配货网络数据库,充分考虑了配货路线短、用时少、费用低的特点,运用Dijkstra算法实现物流配送最短路径算法,提高了城市物流配送的便利性和高效性.%Establish a logistics distribution database based on ArcGIS according to the characteristics of urban traffic network, using node-arc description of transport, achieve logistics distribution shortest path based on dijkstra considering of less rount/time/cost, improve the convenience of ueban logistics distribution efficiency.

  2. Localization of CANDU technology

    Energy Technology Data Exchange (ETDEWEB)

    Alizadeh, Ala

    2010-09-15

    The CANDU pressurized heavy water reactor's principal design features suit it particularly well for technology transfer and localization. When the first commercial CANDU reactors of 540 MWe entered service in 1971, Canada's population of less than 24 million supported a 'medium' level of industrial development, lacking the heavy industrial capabilities of larger countries like the USA, Japan and Europe. A key motivation for Canada in developing the CANDU design was to ensure that Canada would have the autonomous capacity to build and operate nuclear power reactors without depending on foreign sources for key components or enriched fuel.

  3. SHP-Ⅵ: A Shortest Hamiltonian Path-Based POMDP Value Iteration Algorithm%SHP-Ⅵ:一种基于最短哈密顿通路的POMDP值迭代算法

    Institute of Scientific and Technical Information of China (English)

    冯奇; 周雪忠; 黄厚宽; 张小平

    2011-01-01

    Trial-based value iteration is a class of efficient algorithms to solve partially observable Markov decision process (POMDP), among which FSVI is one of the fastest algorithms. But the overhead of computing MDP value function by FSVI is not negligible for large-scale POMDP problems. In this paper, we propose a new value iteration method based on the shortest Hamiltonian path (shortest Hamiltonian path-based value iteration, SHP-VI). This method explores an optimal belief trajectory using the shortest Hamiltonian path resulting from ant colony optimization, and updates value function over the encountered belief states in reversed order. Compared with FSVI, the experimental results show that SHP-VI accelerates the computation of belief trajectory greatly in trial-based algorithms.%基于试探(trial-based)的值迭代算法是求解部分可观察Markov决策过程(partially observable Markov decision process,POMDP)模型的一类有效算法,其中FSVI算法是目前最快的算法之一.然而对于较大规模的POMDP问题,FSVI计算MDP值函数的时间是不容忽视的.提出一种基于最短哈密顿通路(shortest Hamiltonian path)的值迭代算法(shortest Hamiltonian path-based value iteration,SHP-VI).该方法用求解最短哈密顿通路问题的蚁群算法计算一条最优信念状态轨迹,然后在这些信念状态上反向更新值函数.通过与FSVI算法的实验比较,结果表明SHP-VI算法很大程度地提高了基于试探的算法计算信念状态轨迹的效率.

  4. Identification of Influenza A/H7N9 Virus Infection-Related Human Genes Based on Shortest Paths in a Virus-Human Protein Interaction Network

    Directory of Open Access Journals (Sweden)

    Ning Zhang

    2014-01-01

    Full Text Available The recently emerging Influenza A/H7N9 virus is reported to be able to infect humans and cause mortality. However, viral and host factors associated with the infection are poorly understood. It is suggested by the “guilt by association” rule that interacting proteins share the same or similar functions and hence may be involved in the same pathway. In this study, we developed a computational method to identify Influenza A/H7N9 virus infection-related human genes based on this rule from the shortest paths in a virus-human protein interaction network. Finally, we screened out the most significant 20 human genes, which could be the potential infection related genes, providing guidelines for further experimental validation. Analysis of the 20 genes showed that they were enriched in protein binding, saccharide or polysaccharide metabolism related pathways and oxidative phosphorylation pathways. We also compared the results with those from human rhinovirus (HRV and respiratory syncytial virus (RSV by the same method. It was indicated that saccharide or polysaccharide metabolism related pathways might be especially associated with the H7N9 infection. These results could shed some light on the understanding of the virus infection mechanism, providing basis for future experimental biology studies and for the development of effective strategies for H7N9 clinical therapies.

  5. 多核平台并行单源最短路径算法%Parallel Single-source Shortest Path Algorithm on Multi-core Platform

    Institute of Scientific and Technical Information of China (English)

    黄跃峰; 钟耳顺

    2012-01-01

    A multi-thread parallel Single-source Shortest Path(SSSP) algorithm is proposed in multi-cores platform. It employs buckets to sort and uses the similar parallel strategy of A-Stepping algorithm. It does edge relaxations of the same bucket in parallel by slave threads, and searches all buckets in sequence by master thread. Experimental results show that this algorithm performs 4 seconds in the USA road network, achieving a higher speedup compared with serial parallel algorithm using same code.%提出一种多核平台并行单源最短路径算法.采用与Δ-Stepping算法相似的并行策略,通过多个子线程对同一个桶中的弧段进行并行松弛,利用主线程控制串行搜索中桶的序列.实验结果表明,该算法求解全美单源最短路径的时间约为4 s,与使用相同代码实现的串行算法相比,加速比更高.

  6. 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...... applied in the context of stochastic time-dependent networks, for finding the K best strategies and for solving bicriterion problems...

  7. Finding the K shortest hyperpaths using reoptimization

    DEFF Research Database (Denmark)

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

    2004-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...... applied in the context of stochastic time-dependent networks, for finding the K best strategies and for solving bicriterion problems....

  8. Analysis of shortest path for vector data model based on ArcGIS%基于ArcGIS对矢量数据模型的最短路径分析

    Institute of Scientific and Technical Information of China (English)

    高晟

    2011-01-01

    In this paper, using the module of network analysis in ArcGis, problems of how to find different the shortest path in different circumstances discussed are given respectively.%利用ArcGIS中网络分析模块对最短路径问题分情况进行了探讨,分别给出了在不同情况下如何找到不同最短路径。

  9. 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, D.; 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...

  10. CANDU, building the future

    Energy Technology Data Exchange (ETDEWEB)

    Stern, F. [Stern Laboratories (Canada)

    1997-07-01

    The CEO of Stern Laboratories delivered a speech on the problems and challenges facing the nuclear industry. The CANDU system is looked at as the practical choice for the future of our energy source. The people of the industry must be utilized and respected to deliver to the best of their ability.

  11. Shortest-path routing algorithm based on selected RSL in WlrelessHART%基于RSL筛选的WirelessHART最短路径路由算法

    Institute of Scientific and Technical Information of China (English)

    党魁; 沈继忠; 董利达

    2012-01-01

    无线HART网络协议中提出的Graph路由是同类无线网络中健壮性最好的路由方式之一.针对目前实现该路由方式的算法非常少且性能不佳的现状,提出一种基于BFS的Graph路由算法.该算法得到的路由具有跳间冗余的特点,能够最大限度地增加路由健壮性,并且路径最短;引入RSL作为链路质量衡量标准,剔除质量较差的链路,同时对每跳的邻居数设置上限,保证了路由的健壮性,同时避免了低质量的链路带来的通信资源浪费.此外,论证了协议所没有提及的广播路由存在的必要,并给出了实现算法.%The Graph routing proposed by WirelessHART is one of the routing protocols which with best robustness among all the wireless networks. Since there is little algorithm on Graph routing at present and the routing performance is poor, a shortest-path Graph routing algorithm based on BFS( Breadth-First Search) is presented. The routing algorithm has a character of neighbor redundancies, which can maximize to increase the routing robustness. With the introduction of RSL(Receive Signal Level) as a link quality measurement, removing the links with poor quality, setting an upper limit to the number of neighbors in each hop, both methods are aimed to increase the routing robustness and minimize the waste communication resources. In addition, the necessary of broadcast routing which WirelessHART has not mentioned is demonstrated and the reality algorithm is also proposed.

  12. 基于云计算求解城市物流配送最短路径研究%Reseach on Solving the Shortest Path of Urban Logistics Distribution Based on Cloud Computing

    Institute of Scientific and Technical Information of China (English)

    钮亮; 张宝友

    2015-01-01

    物流配送是物流的核心环节之一,配送线路的优化选择决定着配送效率和运输成本。为了求解大规模城市路网中的物流配送最短路径问题,提出了基于MapReduce的并行算法和GIS仿真结合的求解方法。在该求解方式中,构建MapReduce并行化模型和算法流程;数字化城市路网,借助于mapin⁃fo分层管理道路和配送点,并对道路和配送点进行拓扑化处理,生成MID文件供MapReduce使用;通过Hadoop平台实现最短路径计算并在MapX直观显示出计算结果。%Logistics distribution is the core link of logistics, optimization of distribution lines determines the efficiency of delivery and transportation costs. In order to solve the shortest path problem of logistics distribution in large-scale urban network , the solving method based on MapReduce and GIS simulation is proposed.this method proposes a shortest path algorithm based on MapReduce, constructs a parallel process model and algorithm of MapReduce; digitalizes urban road network, manages road and distribution points according to layer with the help of MapInfo, topologizes road and distribution point, generates the MID file which is used by MapReduce; finishes the calculation of the shortest path through the Hadoop platform and displays intuitively the results in MapX .

  13. To Solve Pipeline Layout Problem with the Improved Shortest Path Model%利用改进的最短路径模型解决输油管的布置问题

    Institute of Scientific and Technical Information of China (English)

    余淼

    2011-01-01

    2010年去过数学建模大赛c题“输油管的布置”数学建模的目的是设计最优化的路线,建立一条费用最省的输油管线路,但是不同于普遍的最短路径问题,该题需要考虑多种情况,例如,城区和郊区费用的不同,采用共用管线和非公用管线价格的不同等等。我们基于最短路径模型,对于题目实际情况进行研究和分析,基于光的传播原理,设计了一种改进的最短路径模型,对问题设计了合适的数学模型并做出了相应的解答和处理。%Mathematical Modeling Contest in 2010 been to C title"pipeline layout,"The purpose of mathematical modeling is to design the most optimal route to establish a pipeline of least cost route,but unlike the general shortest path problem,the problem needs consider a variety of situations,for example,the cost of different urban and suburban areas,the use of shared pipeline and the price of different non-public lines and so on.On the basis of the shortest path model for the actual subject of research and analysis,based on the principle of light transmission,an improved design of the shortest path model,the appropriate design of the problem and make the corresponding mathematical model answers and treatment.

  14. Distributed Power Control Routing Algorithm Based on Shortest Path Tree%基于最短路径树的分布式功率控制路由算法

    Institute of Scientific and Technical Information of China (English)

    陈友荣; 任条娟; 刘半藤; 葛灵晓

    2012-01-01

    When the nodes can not get the distance to neighbor nodes, to solve the problem that node consumes excessive energy,fails prematurely and leads to reduce the network lifetime,distributed power control routing algorithm based on shortest path tree( DPCRA_SPT) is proposed. Considering energy for transmitting data and neighbor nodes' residual energy, the new weight function and linear power attenuation model are introduced. Finally distributed asynchronous Bellman-Ford algorithm is used to construct the shortest path tree. All nodes transmit data along the shortest path tree to Sink node. Simulation results show that in the densely distributed wireless sensor networks, by adjusting the parameters, DPCRA_SPT can prolong network lifetime and remain energy consumption at a lower level. Under certain conditions,DPCRA_SPT outperforms Ratio_w_FTP,BFFTP,BFSAM and BFPAM algorithms.%当节点不能获知与邻居节点的距离时,为解决节点能量消耗过快而过早失效,从而减少网络生存时间的问题,提出基于最短路径树的分布式功率控制路由算法( DPCRA_SPT).该算法综合考虑网络中节点间传输数据的能耗和邻居节点的剩余能量,引入新的权值函数和功率线性衰减模型.运用分布式非同步Bellman-Ford算法构建最短路径树,所有节点沿着最短路径树将数据汇集到Sink节点.仿真结果表明:在密集分布的无线传感网中,通过调整参数,DPCRA_STT算法可以延长网络生存时间,将能耗保持在较低的水平.在一定的条件下,DPCRA_SPT算法比Ratio_w_FTP、BFFTP、BFSAM、BFPAM算法更优.

  15. The small (or large) modular CANDU

    Energy Technology Data Exchange (ETDEWEB)

    Meneley, D.; Harvel, G. [Univ. of Ontario Inst. of Tech., Oshawa, Ontario (Canada)

    2013-07-01

    This presentation outlines the design for small (or large) modular CANDU. The origins of this work go back many years to a comment by John Foster, then President of AECL CANDU. Foster noted that the CANDU reactor, with its many small fuel channels, was like a wood campfire. To make a bigger fire, just throw on some more logs (channels). If you want a smaller fire, just use fewer logs. The design process is greatly simplified.

  16. Multivalued and Multiple Reflected Raytracing with Extreme Value Based on the Multistage Modified Shortest-path Method%分区多步最短路径极值法多值多次反射波追踪

    Institute of Scientific and Technical Information of China (English)

    唐小平; 白超英; 刘宽厚

    2011-01-01

    The grid-based raytracing algorithms,such as the finite-difference eikonal equation solver and the shortest-path method,are all based on the Fermat (minimum travel time) principle, which is able to track the first reflected arrivals only. In heterogeneous media involving a relatively larger velocity contrast or complex reflected interface. The seismic wavefronts are self-intersected, as a result, the rays are multi-paths. In order to simulate such multivalued and multiple reflected arrivals, we put forward an algorithm to trace the multivalued and multiple reflected arrivals, it referred as the extreme value algorithm based on the multistage modified shortest-path method, which is capable of tracking the multivalued and multiple reflected arrivals in velocity model included complex reflected interfaces. The principles of the extreme value are that;we firstly conduct down-wind raytracing from both sources and receivers to the sampled reflected interfaces and record the traveltimes and raypaths at each sampled reflected point,and sum up traveltime value at each reflected point, and form a stacked' traveltime-distance' curve (or surface for 3D case);secondly we solve extremum values for this stacked'traveltime-distance'curveCor surface).in which the location of the extreme points are the reflected points; finally we link the raypaths and add traveltimes from the source to the reflected point,and then to the receiver. Thus the multivalued and multiple reflected arrivals are successfully traced. This algorithm has a simple principle, high accuracy, fast CPU time and easy adaptation for complex media-Compared with the fast marching method and error analysis.it is evident that the extreme value of the multistage shortest-path method is a feasible and efficient algorithm for tracking the multivalued and multiple reflected arrivals.%基于网格单元扩展的射线追踪算法,如:较为流行的有限差分解程函方程法和最短路径法均是建立在费马(最小

  17. A review of CANDU feeder wall thinning

    Energy Technology Data Exchange (ETDEWEB)

    Chung, Han Sub [Korea Electric Power Research Institute, Daejeon (Korea, Republic of)

    2010-10-15

    Flow Accelerated Corrosion is an active degradation mechanism of CANDU feeder. The tight bend downstream to Grayloc weld connection, close to reactor face, suffers significant wall thinning by FAC. Extensive in-service inspection of feeder wall thinning is very difficult because of the intense radiation field, complex geometry, and space restrictions. Development of a knowledge-based inspection program is important in order to guarantee that adequate wall thickness is maintained throughout the whole life of feeder. Research results and plant experiences are reviewed, and the plant inspection databases from Wolsong Units One to Four are analyzed in order to support developing such a knowledge-based inspection program. The initial thickness before wall thinning is highly non-uniform because of bending during manufacturing stage, and the thinning rate is non-uniform because of the mass transfer coefficient distributed non-uniformly depending on local hydraulics. It is obvious that the knowledge-based feeder inspection program should focus on both fastest thinning locations and thinnest locations. The feeder wall thinning rate is found to be correlated proportionately with QV of each channel. A statistical model is proposed to assess the remaining life of each feeder using the QV correlation and the measured thicknesses. W-1 feeder suffered significant thinning so that the shortest remaining life barely exceeded one year at the end of operation before replacement. W-2 feeder showed far slower thinning than W-1 feeder despite the faster coolant flow. It is believed that slower thinning in W-2 is because of higher chromium content in the carbon steel feeder material. The average Cr content of W-2 feeder is 0.051%, while that value is 0.02% for W-1 feeder. It is to be noted that FAC is reduced substantially even though the Cr content of W-2 feeder is still very low

  18. Verification tests for CANDU advanced fuel

    Energy Technology Data Exchange (ETDEWEB)

    Chung, Chang Hwan; Chang, S.K.; Hong, S.D. [and others

    1997-07-01

    For the development of a CANDU advanced fuel, the CANFLEX-NU fuel bundles were tested under reactor operating conditions at the CANDU-Hot test loop. This report describes test results and test methods in the performance verification tests for the CANFLEX-NU bundle design. The main items described in the report are as follows. - Fuel bundle cross-flow test - Endurance fretting/vibration test - Freon CHF test - Production of technical document. (author). 25 refs., 45 tabs., 46 figs.

  19. On the existence of shortest directed networks

    CERN Document Server

    Swanepoel, Konrad J

    2008-01-01

    A directed network connecting a set A to a set B is a digraph containing an a-b path for each a in A and b in B. Vertices in the directed network not in A or B are called Steiner points. We show that in a finitely compact metric space in which geodesics exist, any two finite sets A and B are connected by a shortest directed network. We also bound the number of Steiner points by a function of the sizes of A and B. Previously, such an existence result was known only for the Euclidean plane [M. Alfaro, Pacific J. Math. 167 (1995) 201-214]. The main difficulty is that, unlike the undirected case (Steiner minimal trees), the underlying graphs need not be acyclic. Existence in the undirected case was first shown by E. J. Cockayne [Canad. Math. Bull. 10 (1967) 431-450].

  20. Dimensional Measurements of Fresh CANDU Fuel Bundle

    Energy Technology Data Exchange (ETDEWEB)

    Jun, Ji Su; Jo, Chang Keun; Jung, Jong Yeob; Koo, Dae Seo; Cho, Moon Sung [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    2005-07-01

    This paper intends to provide the dimensional measurements of fresh CANDU fuel (37-element) bundle for the estimation of deformation of post-irradiated (PI) bundle. It is expensive and difficult to measure the fretting wear of bearing pad, the element bowing and the waviness of endplate at the two-phase high flow condition (above 24 kg/s) of out-of-reactor test. So, it is recommended to compare the geometry of fresh bundle with that of PI bundle to estimate the integrity of fuel bundle in the CANDU-6 fuel channel with two-phase flow condition. The measurement system has been developed to provide the visual inspection and the dimensional measurements within the accuracy of 10 {mu}m. It is applicable in-air and underwater to the CANDU bundle as well as the CANFLEX bundle. The in-air measurements of the 36 fresh CANDU bundles (S/N: B400892 {approx} B400927) are done by this system from February 2004 to March 2004 in the PHWR fresh fuel storage building of KNFC. These bundles are produced by KNFC manufacturing procedure and are waiting for the delivery to the Wolsong-3 plant, and are planned to load into the proposed test channels. The detail measurements contain the outer rod profile (including the bearing pad), the diameter of bundle, the bowing of bundle, the rod length and the surface profile of end plate (waviness)

  1. Fuel condition in Canadian CANDU 6 reactors

    Energy Technology Data Exchange (ETDEWEB)

    Hu, R.H.; Macici, N [Hydro-Quebec, Montreal, Quebec (Canada); Gibb, R. [New Brunswick Power, Lepreau, NB (Canada); Purdy, P.L.; Manzer, A.M. [Atomic Energy of Canada Limited, Mississauga, Ontario (Canada); Kohn, E. [Ontario Hydro, Toronto, Ontario (Canada)

    1997-07-01

    The cornerstone of the CANDU concept is its natural uranium fuel, and the success of its reactor operation hinges on the fuel condition in the reactor. Neutron economy, on power refuelling, and simple fuel design are among the unique characteristics of CANDU fuel. In Canadian CANDU 6 reactors (Gentilly 2 and Point Lepreau), the 37-element fuel has provided an enviable record of safe, economic and reliable plant operation for 29 reactor years to date. The fuelling cost is among the lowest in the world - a corollary of high neutron economy, simple fuel design, and judicial fuelling scheme. The reliability of fuel is high: only 21 of the 60000 bundles discharged from Gentilly 2 were confirmed defective and the five-year period from March 1992 to February 1997 saw no defect at all at Gentilly-2. Also, thanks to the inherent on-power refuelling capability and an effective defect detection and removal system, the primary coolant loops are kept extremely clean (very low activity level) - benefiting both maintenance and safety. Moreover, the inventories of fission products in the core and in the channel are maintained within the safety analysis envelope, due to on-power fuelling and sophisticated fuel management. In this paper, CANDU 6 fuel performance is reviewed against the feedback from post-irradiation examinations, and the findings from our ongoing R and D program. The results suggest that the fuel behavior m reactor are basically as originally anticipated, despite an evolutionary 3% increase in bundle uranium mass in the 1980's. For operating conditions within the CANDU 6 37-element experience, the average strains are typically 0.09%; and fission gas release, 2.7%. The UO{sub 2} fuel remains stoichiometric after irradiation. In-core measurements of pressure tube fitting are generally low. All these observations are consistent with the excellent fuel performance statistics coming out of the two Canadian CANDU 6 reactors. Additionally, this paper will briefly

  2. Validation of WIMS-CANDU using Pin-Cell Lattices

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Won Young; Min, Byung Joo; Park, Joo Hwan [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    2006-07-01

    The WIMS-CANDU is a lattice code which has a depletion capability for the analysis of reactor physics problems related to a design and safety. The WIMS-CANDU code has been developed from the WIMSD5B, a version of the WIMS code released from the OECD/NEA data bank in 1998. The lattice code POWDERPUFS-V (PPV) has been used for the physics design and analysis of a natural uranium fuel for the CANDU reactor. However since the application of PPV is limited to a fresh fuel due to its empirical correlations, the WIMS-AECL code has been developed by AECL to substitute the PPV. Also, the WIMS-CANDU code is being developed to perform the physics analysis of the present operating CANDU reactors as a replacement of PPV. As one of the developing work of WIMS-CANDU, the U{sup 238} absorption cross-section in the nuclear data library of WIMS-CANDU was updated and WIMS-CANDU was validated using the benchmark problems for pin-cell lattices such as TRX-1, TRX-2, Bapl-1, Bapl-2 and Bapl-3. The results by the WIMS-CANDU and the WIMS-AECL were compared with the experimental data.

  3. Experience on management of CANDU spent fuel in Korea

    Energy Technology Data Exchange (ETDEWEB)

    Lee, H.-Y.; Choi, B.-I.; Yoon, J.-H.; Seo, U.-S. [Korea Hydro and Nuclear Power Co. Ltd., Nuclear Environment Technology Inst. (KHNP/NETEC), Yusung-Gu, Daejeon (Korea, Republic of)

    2002-07-01

    In Korea, national policy on the management of spent fuel from both PWR and CANDU reactors demands that all the spent fuel be kept within reactor site in until 2016 the time spent fuel interim storage facility might open. Based on the end of 2001, KHNP has 4 CANDU reactors in operation generating approximately 5,000 bundles of spent fuels per each unit annually. The generation, accumulation, and management of CANDU spent fuel by KHNP in Korea are reviewed. CANDU spent fuel storage technology including pool storage in fuel building, concrete silo storage, and on going project for consolidating storage adapting modular vault type MACSTOR concept are outlined. Especially current joint development of storage of CANDU spent fuel for improving land usage is addressed. The explanation of the new consolidated dry storage system includes description of the storage facility, its safety evaluations, and final implementation. Finally future movement on management of spent fuel in Korea is also briefly introduced. (author)

  4. 动态网络最短路径射线追踪算法中向后追踪方法的改进∗%An Improved Method on Backward Tracing of the Shortest Path Raytracing Algorithm with Dynamic Networks

    Institute of Scientific and Technical Information of China (English)

    卢江波; 方志

    2016-01-01

    动态网络最短路径射线追踪算法中的向后追踪方法能够解决线性走时插值算法(LTI)向后追踪过程不稳定的问题,但是其计算效率较低。综合利用节点次级源的位置信息以及波的传播规律,提出了改进方法,排除了动态网络最短路径射线追踪算法向后追踪过程中存在的大量冗余计算。数值算例表明,改进的向后追踪方法具有较高的计算效率,是动态网络最短路径射线追踪算法中向后追踪方法的几倍至几十倍;若将改进后的向后追踪方法应用于动态网络最短路径射线追踪改进算法,则该算法的计算效率将提高一倍左右。%The backward tracing method of the shortest path ray tracing algorithm with dynamic net-works can solve the unstability problem in the backward tracing procedure of the LTI (Linear Travel-time Interpolation)algorithm,but the computational efficiency of the method is low.This study presented an improved method on backward tracing.According to the location information of the secondary sources for the nodes and the law of wave propagation,a large number of redundancy calculation are excluded in the backward tracing of the dynamic networks tracing algorithm.The numerical examples show that the im-proved method exhibits the higher computational efficiency.The calculation efficiency of the improved method is several times that of the backward tracing method of the dynamic networks tracing algorithm. When the improved method is applied to the improved algorithm of the shortest path ray tracing with dy-namic networks,the computational efficiency of the algorithm can be increased by about 100 %.

  5. A generalized perturbation program for CANDU reactor

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Do Heon; Kim, Jong Kyung [Hanyang University, Seoul (Korea, Republic of); Choi, Hang Bok; Roh, Gyu Hong [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of); Yang, Won Sik [Chosun University, Kwangju (Korea, Republic of)

    1998-12-31

    A generalized perturbation program has been developed for the purpose of estimating zonal power variation of a CANDU reactor upon refueling operation. The forward and adjoint calculation modules of RFSP code were used to construct the generalized perturbation program. The numerical algorithm for the generalized adjoint flux calculation was verified by comparing the zone power estimates upon refueling with those of forward calculation. It was, however, noticed that the truncation error from the iteration process of the generalized adjoint flux is not negligible. 2 refs., 1 figs., 1 tab. (Author)

  6. Development of the advanced CANDU technology

    Energy Technology Data Exchange (ETDEWEB)

    Suk, Soo Dong; Min, Byung Joo [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of); Na, Y. H.; Lee, S. Y.; Choi, J. H.; Lee, B. C.; Kim, S. N.; Jo, C. H.; Paik, J. S.; On, M. R.; Park, H. S.; Kim, S. R. [Korea Electric Power Co., Taejon (Korea, Republic of)

    1997-07-01

    The purpose of this study is to develop the advanced design technology to improve safety, operability and economy and to develop and advanced safety evaluation system. More realistic and reasonable methodology and modeling was employed to improve safety margin in containment analysis. Various efforts have been made to verify the CATHENA code which is the major safety analysis code for CANDU PHWR system. Fully computerized prototype ECCS was developed. The feasibility study and conceptual design of the distributed digital control system have been performed as well. The core characteristics of advanced fuel cycle, fuel management and power upgrade have been studied to determine the advanced core. (author). 77 refs., 51 tabs., 108 figs.

  7. The travesty of discarding used CANDU fuel

    Energy Technology Data Exchange (ETDEWEB)

    Ottensmeyer, P. [Univ. of Toronto, Toronto, Ontario (Canada)

    2016-09-15

    The current plan worldwide for virtually all used nuclear fuels is costly deep burial to attempt to isolate their long-term radiotoxicity permanently. Alternatively Canada's 50,000 tons spent CANDU fuel, of which only 0.74% of the heavy atoms have been fissioned to extract their energy, could supply 130 times more non-carbon energy using proven economical recycling and fast-neutron technologies. The result in this country alone would currently be the creation of $74 trillion of reliable electricity on demand without greenhouse gas emissions. It would avoid adding 475 billion tons CO{sub 2} to the atmosphere compared to the use of coal, to mitigate climate change. Worldwide recycling of stored spent nuclear fuel and replenishing with depleted uranium in fast-neutron reactors could avoid emitting over 20 trillion tons CO{sub 2}, or over six times the current total atmospheric CO{sub 2} content. As added bonus the long-term radiotoxicity of the used CANDU fuel is effectively eliminated, making a long-term deep geological repository unnecessary. Even the shorter-lived radioisotope fission products become valuable stable atoms and minerals that would fetch $3 million per ton. Such an alternative is certainly worth pursuing. (author)

  8. Tawanda’s non- iterative optimal tree algorithm for shortest route problems

    Directory of Open Access Journals (Sweden)

    Trust Tawanda

    2013-03-01

    Full Text Available So many algorithms have been proposed to solve the shortest path in road networks, in this paper, an algorithm is developed to solve shortest route problems. The algorithm is being demonstrated through solving of various network problems. The principle of the algorithm consist in  transforming  the graph into a tree by means of arc and node replication, thereby expanding outwards from the source node  considering all possible paths up to the destination node. The objective is to develop a method that can be applied in directed and non-directed graphs.

  9. Advanced CANDU reactor pre-licensing progress

    Energy Technology Data Exchange (ETDEWEB)

    Popov, N.K.; West, J.; Snell, V.G.; Ion, R.; Archinoff, G.; Xu, C. [Atomic Energy of Canada Limited., Mississauga, Ontario (Canada)]. E-mail: popovn@aecl.ca

    2005-07-01

    The Advanced CANDU Reactor (ACR) is an evolutionary advancement of the current CANDU 6 reactor, aimed at producing electrical power for a capital cost and at a unit-energy cost significantly less than that of the current reactor designs. The Canadian Nuclear Safety Commission (CNSC) staff are currently reviewing the ACR design to determine whether, in their opinion, there are any fundamental barriers that would prevent the licensing of the design in Canada. This CNSC licensability review will not constitute a licence, but is expected to reduce regulatory risk. The CNSC pre-licensing review started in September 2003, and was focused on identifying topics and issues for ACR-700 that will require a more detailed review. CNSC staff reviewed about 120 reports, and issued to AECL 65 packages of questions and comments. Currently CNSC staff is reviewing AECL responses to all packages of comments. AECL has recently refocused the design efforts to the ACR-1000, which is a larger version of the ACR design. During the remainder of the pre-licensing review, the CNSC review will be focused on the ACR-1000. AECL Technologies Inc. (AECLT), a wholly-owned US subsidiary of AECL, is engaged in a pre-application process for the ACR-700 with the US Nuclear Regulatory Commission (USNRC) to identify and resolve major issues prior to entering a formal process to obtain standard design certification. To date, the USNRC has produced a Pre-Application Safety Assessment Report (PASAR), which contains their reviews of key focus topics. During the remainder of the pre-application phase, AECLT will address the issues identified in the PASAR. Pursuant to the bilateral agreement between AECL and the Chinese nuclear regulator, the National Nuclear Safety Administration (NNSA) and its Nuclear Safety Center (NSC), NNSA/NSC are reviewing the ACR in seven focus areas. The review started in September 2004, and will take three years. The main objective of the review is to determine how the ACR complies

  10. Thermal-hydraulic interfacing code modules for CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Liu, W.S.; Gold, M.; Sills, H. [Ontario Hydro Nuclear, Toronto (Canada)] [and others

    1997-07-01

    The approach for CANDU reactor safety analysis in Ontario Hydro Nuclear (OHN) and Atomic Energy of Canada Limited (AECL) is presented. Reflecting the unique characteristics of CANDU reactors, the procedure of coupling the thermal-hydraulics, reactor physics and fuel channel/element codes in the safety analysis is described. The experience generated in the Canadian nuclear industry may be useful to other types of reactors in the areas of reactor safety analysis.

  11. Leak detection capability in CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Azer, N.; Barber, D.H.; Boucher, P.J. [and others

    1997-04-01

    This paper addresses the moisture leak detection capability of Ontario Hydro CANDU reactors which has been demonstrated by performing tests on the reactor. The tests confirmed the response of the annulus gas system (AGS) to the presence of moisture injected to simulate a pressure tube leak and also confirmed the dew point response assumed in leak before break assessments. The tests were performed on Bruce A Unit 4 by injecting known and controlled rates of heavy water vapor. To avoid condensation during test conditions, the amount of moisture which could be injected was small (2-3.5 g/hr). The test response demonstrated that the AGS is capable of detecting and annunciating small leaks. Thus confidence is provided that it would alarm for a growing pressure tube leak where the leak rate is expected to increase to kg/hr rapidly. The measured dew point response was close to that predicted by analysis.

  12. Basic research and industrialization of CANDU advanced fuel

    Energy Technology Data Exchange (ETDEWEB)

    Chun, Suk Ho; Park, Joo Hwan; Jun, Ji Su [and others

    2000-04-01

    Wolsong Unit 1 as the first heavy water reactor in Korea has been in service for 17 years since 1983. It would be about the time to prepare a plan for the solution of problems due to aging of the reactor. The aging of CANDU reactor could lead especially to the steam generator cruding and pressure tube sagging and creep and then decreases the operation margin to make some problems on reactor operations and safety. The counterplan could be made in two ways. One is to repair or modify reactor itself. The other is to develop new advanced fuel to increase of CANDU operation margin effectively, so as to compensate the reduced operation margin. Therefore, the first objectives in the present R and D is to develop the CANFLEX-NU (CANDU Flexible fuelling-Natural Uranium) fuel as a CANDU advanced fuel. The second objectives is to develop CANDU advanced fuel bundle to utilize advanced fuel cycles such as recovered uranium, slightly enriched uranium, etc. and so to raise adaptability for change in situation of uranium market. Also, it is to develop CANDU advanced fuel technology which improve uranium utilization to cope with a world-wide imbalance between uranium supply and demand, without significant modification of nuclear reactor design and refuelling strategies. As the implementations to achieve the above R and D goal, the work contents and scope of technology development of CANDU advanced fuel using natural uranium (CANFLEX-NU) are the fuel element/bundle designs, the nuclear design and fuel management analysis, the thermalhydraulic analysis, the safety analysis, fuel fabrication technologies, the out-pile thermalhydraulic test and in-pile irradiation tests performed. At the next, the work scopes and contents of feasibility study of CANDU advanced fuel using recycled uranium (CANFLEX-RU) are the fuel element/bundle designs, the reactor physics analysis, the thermalhydraulic analysis, the basic safety analysis of a CANDU-6 reactor with CANFLEX-RU fuel, the fabrication and

  13. Reactor Physics Analysis Models for a CANDU Reactor

    Energy Technology Data Exchange (ETDEWEB)

    Choi, Hang Bok

    2007-10-15

    Canada deuterium uranium (CANDU) reactor physics analysis is typically performed in three steps. At first, macroscopic cross-sections of the reference lattice is produced by modeling the reference fuel channel. Secondly macroscopic cross-sections of reactivity devices in the reactor are generated. The macroscopic cross-sections of a reactivity device are calculated as incremental cross-sections by subtracting macroscopic cross-sections of a three-dimensional lattice without reactivity device from those of a three-dimensional lattice with a reactivity device. Using the macroscopic cross-sections of the reference lattice and incremental cross-sections of the reactivity devices, reactor physics calculations are performed. This report summarizes input data of typical CANDU reactor physics codes, which can be utilized for the future CANDU reactor physics analysis.

  14. 基于GIS的地面网络最短路实现在机场飞行区应急救援系统的应用研究%An Implementation of a GIS-based Shortest Path Searching algorithm for Airport Emergency Rescue Management

    Institute of Scientific and Technical Information of China (English)

    高强; 陈欣; 汪振华

    2011-01-01

    航空安全是空中交通运输系统正常运行的基础,快度、高效的处理航空安全事故对恢复空中交通系统的正常运行具有重要意义.文章从机场航空安全角度出发,通过分析机场飞行区地面网络结构图,创建了节点、弧段关系数据库以描述机场飞行区的网络拓扑结构,运用Dijkstra算法实现了快速最短路径搜索.在此基础上利用地理信息系统(GIS)二次开发工具MapX组件,以国内某机场为例,在Visusal Basic环境下实现了机场飞行区应急救援信息管理系统,为机场应急救援管理决策的可视化、便捷化提供了支持.同时拓展了MapX开发应用型地理信息系统的空间分析能力.%Aviation safety is the base for the operation of an efficient air transportation system. Quick deployment of emergency rescue has an important meaning to reinstall air transportation in a timely manner. In this paper, through the analysis of airport surface topology, a node-arc relational database is developed and the network topology of airport airside is abstracted. The Dijkstra algorithm is employed to search the shortest path between any nodes. The above components are integrated into the MapXf which is a GIS re-developing tool, within the Visual Basic environment, in order to establish an Emergency Rescue Information Management System for a large domestic airport. The developed system can provide visual and various decision-making support for airport emergency rescue events. This study also expands the spatial analysis capability of MapX in the applied GIS systems.

  15. CANDU steam generator life management: laboratory data and plant experience

    Energy Technology Data Exchange (ETDEWEB)

    Tapping, R.L. [Atomic Energy of Canada Limited, Chalk River, Ontario (Canada); Nickerson, J.H.; Subash, N. [Atomic Energy of Canada Limited, Mississauga, Ontario (Canada); Wright, M.D

    2001-10-01

    As CANDU reactors enter middle age, and the potential value of the plants in a deregulated market is realized, life management and life extension issues become increasingly important. An accurate assessment of critical components, such as the CANDU 6 steam generators (SGs), is crucial for successful life extension, and in this context, material issues are a key factor. For example, service experience with Alloy 900 tubing indicates very low levels of degradation within CANDU SGs; the same is also noted worldwide. With little field data for extrapolation, life management and life extension decisions for the tube bundles rely heavily on laboratory data. Similarly, other components of the SGs, in particular the secondary side internals, have only limited inspection data upon which to base a condition assessment. However, in this case there are also relatively little laboratory data. Decisions on life management and life extension are further complicated--not only is inspection access often restricted, but repair or replacement options for internal components are, by definition, also limited. The application of CANDU SG life management and life extension requires a judicious blend of in-service data, laboratory research and development (R and D) and materials and engineering judgment. For instance, the available laboratory corrosion and fretting wear data for Alloy 800 SG tubing have been compared with plant experience (with all types of tubing), and with crevice chemistry simulations, in order to provide an appropriate inspection guide for a 50-year SG life. A similar approach has been taken with other SG components, where the emphasis has been on known degradation mechanisms worldwide. This paper provides an outline of the CANDU SG life management program, including the results to date, a summary of the supporting R and D program showing the integration with condition assessment and life management activities, and the approach taken to life extension for a typical

  16. A study for good regulatin of the CANDU's in Korea. Development of safety regulatory requirement for CANDU nuclear power plants

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Se Ki; Shin, Y. K.; Kim, J. S.; Yu, Y. J.; Lee, Y. J. [Ajou Univ., Suwon (Korea, Republic of)

    2001-03-15

    The objective of project is to derive the policy recommendations to improve the efficiency of CANDU plants regulation. These policy recommendations will eventually contribute to the upgrading of Korean nuclear regulatory system and safety enhancement. During the first phase of this 2 years study, following research activities were done. On-site survey and analysis on CANDU plants regulation. Review on CANDU plants regulating experiences and current constraints. Review and analysis on the new Canadian regulatory approach.

  17. Fuel management simulation for CANFLEX-RU in CANDU 6

    Energy Technology Data Exchange (ETDEWEB)

    Jeong, Chang Joon; Suk, Ho Chun [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1997-12-31

    Fuel management simulations have been performed for CANFLEX-09% RU fuel in the CANDU 6 reactor. In this study, the bi-directional 4-bundle shift fuelling scheme was assumed. The lattice cell and time-average calculation were carried out. The refuelling simulation calculations were performed for 600 full power days. Time-averaged results show good axial power profile with the CANFLEX-RU fuel. During the simulation period, the maximum channel and bundle power were maintained below the licensing limit of CANDU 6 reactor. 7 refs., 4 figs. (Author)

  18. Pre-licensing of the Advanced CANDU Reactor

    Energy Technology Data Exchange (ETDEWEB)

    Ion, R.; Popov, N.; Snell, V.; Xu, C. [Atomic Energy of Canada Limited, Mississauga, Ontario (Canada); West, J. [Candesco Co., Toronto, Ontario (Canada)

    2006-09-15

    Atomic Energy of Canada Limited (AECL) developed the Advanced CANDU Reactor-700 (ACR-700) as an evolutionary advancement of the current CANDU 6 reactor. As further advancement of the ACR design, AECL is currently developing the ACR-1000 for the Canadian and international market. The ACR-1000 is aimed at producing electrical power for a capital cost and a unit-energy cost significantly less than that of the current generation of operating nuclear plants, while achieving shorter construction schedule, high plant capacity factor, improved operations and maintenance, increased operating life, and enhanced safety features. The reference ACR-1000 plant design is based on an integrated two-unit plant, using enriched fuel and light-water coolant, with each unit having a nominal gross electrical output of 1165 MWe. The ACR-1000 design has evolved from AECL's in-depth knowledge of CANDU systems, components, and materials, as well as the experience and feedback received from owners and operators of CANDU plants. The ACR design retains the proven strengths and features of CANDU reactors, while incorporating innovations and state-of-the-art technology. It also features major improvements in economics, inherent safety characteristics, and performance, while retaining the proven benefits of the CANDU family of nuclear power plants. The CANDU system is ideally suited to this evolutionary approach since the modular fuel channel reactor design can be modified, through a series of incremental changes in the reactor core design, to increase the power output and improve the overall safety, economics, and performance. The safety enhancements made in ACR-1000 encompass improved safety margins, performance and reliability of safety related systems. In particular, the use of the CANFLEX-ACR fuel bundle, with lower linear rating and higher critical heat flux, provides increased operating and safety margins. Safety features draw from those of the existing CANDU plants (e.g., the two

  19. A Study on Selecting the Shortest Routes by Voronoi Diagram in Route Networks of GIS

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    The problems of fast determining shortest paths through a polygonal subdivisionplanar with n vertices are considered in GIS. Distances are measured according to an Euclideanmetric. A geographical information system (GIS)has a collection of nearest neighborhoodoperations and this collection serves as a useful toolbox for spatial analysis. These operationsare undertaken through the Voronoi diagrams. This paper presents a novel algorithm thatconstructs a “shortest route set” with respect to a given source point and a target point byVoronoi diagrams. It will help to improve the efficiency of traditional algorithms, e. g. , Djkstraalgorithm, on selecting the shortest routes. Moreover, the novel algorithm can check theconnectivity in a complex network between the source point and target one.

  20. Development of CANDU ECCS performance evaluation methodology and guides

    Energy Technology Data Exchange (ETDEWEB)

    Bang, Kwang Hyun; Park, Kyung Soo; Chu, Won Ho [Korea Maritime Univ., Jinhae (Korea, Republic of)

    2003-03-15

    The objectives of the present work are to carry out technical evaluation and review of CANDU safety analysis methods in order to assist development of performance evaluation methods and review guides for CANDU ECCS. The applicability of PWR ECCS analysis models are examined and it suggests that unique data or models for CANDU are required for the following phenomena: break characteristics and flow, frictional pressure drop, post-CHF heat transfer correlations, core flow distribution during blowdown, containment pressure, and reflux rate. For safety analysis of CANDU, conservative analysis or best estimate analysis can be used. The main advantage of BE analysis is a more realistic prediction of margins to acceptance criteria. The expectation is that margins demonstrated with BE methods would be larger that when a conservative approach is applied. Some outstanding safety analysis issues can be resolved by demonstration that accident consequences are more benign than previously predicted. Success criteria for analysis and review of Large LOCA can be developed by top-down approach. The highest-level success criteria can be extracted from C-6 and from them, the lower level criteria can be developed step-by-step, in a logical fashion. The overall objectives for analysis and review are to verify radiological consequences and frequency are met.

  1. Overview of activities on CANDU fuel in Argentina

    Energy Technology Data Exchange (ETDEWEB)

    Alvarez, L.; Valesi, J., E-mail: lalvarez@cnea.gov.ar [National Commission on Atomic Energy, Fuel Engineering Department (Argentina)

    2013-07-01

    This paper gives an outline of activities on CANDU fuel in Argentina. It discusses the nuclear activities and electricity production in Argentina, evolution of the activities in fuel engineering, fuel fabrication, fuel performance at Embalse nuclear power plant and spent fuel storage options.

  2. Proceedings of the fourth international conference on CANDU maintenance

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1997-07-01

    These proceedings record the information presented at the 4th International Conference on CANDU Maintenance held November 16-18,1997 in Toronto, Canada. The papers for these proceedings were prepared on component maintenance, human performance, steam generator leak detection, fuel channel inspections, rotating equipment maintenance, surveillance programs, inspection techniques, valve maintenance, steam generator repairs and performance, reactor aging management and preventative maintenance.

  3. Effect of DUPIC cycle on CANDU reactor safety parameters

    Energy Technology Data Exchange (ETDEWEB)

    Mohamed, Nader M. A. [Atomic Energy Authority, ETRR-2, Cairo (Egypt); Badawi, Alya [Dept. of Nuclear and Radiation Engineering, Alexandria University, Alexandria (Egypt)

    2016-10-15

    Although, the direct use of spent pressurized water reactor (PWR) fuel in CANda Deuterium Uranium (CANDU) reactors (DUPIC) cycle is still under investigation, DUPIC cycle is a promising method for uranium utilization improvement, for reduction of high level nuclear waste, and for high degree of proliferation resistance. This paper focuses on the effect of DUPIC cycle on CANDU reactor safety parameters. MCNP6 was used for lattice cell simulation of a typical 3,411 MWth PWR fueled by UO{sub 2} enriched to 4.5w/o U-235 to calculate the spent fuel inventories after a burnup of 51.7 MWd/kgU. The code was also used to simulate the lattice cell of CANDU-6 reactor fueled with spent fuel after its fabrication into the standard 37-element fuel bundle. It is assumed a 5-year cooling time between the spent fuel discharges from the PWR to the loading into the CANDU-6. The simulation was carried out to calculate the burnup and the effect of DUPIC fuel on: (1) the power distribution amongst the fuel elements of the bundle; (2) the coolant void reactivity; and (3) the reactor point-kinetics parameters.

  4. A neutronic study of the cycle PWR-CANDU

    Energy Technology Data Exchange (ETDEWEB)

    Silva, Alberto da; Pereira, Claubia; Veloso, Maria Auxiliadora Fortini; Fortini, Angela; Pinheiro, Ricardo Brant [Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, MG (Brazil). Dept. de Engenharia Nuclear]. E-mail: albertomoc@terra.com.br; claubia@nuclear.ufmg.br; dora@nuclear.ufmg.br; fortini@nuclear.ufmg.br; rbp@nuclear.ufmg.br

    2007-07-01

    The cycle PWR-CANDU was simulated using the WIMSD-5B and ORIGEN2.1 codes. It was simulated a fuel burnup of 33,000 MWd/t for UO{sub 2} with enrichment of 3.2% and a fuel extended burnup of 45,000 MWd/t for UO{sub 2} with enrichments of 3.5%, 4.0% and 5.0% in a PWR reactor. The PWR discharged fuel was submitted to the simulation of deposition for five years. After that, it was submitted to AYROX reprocessing and used to produce a fuel to CANDU reactor. Then, it was simulated the burnup in the CANDU. Parameters such as infinite medium multiplication factor, k{sub inf}, fuel temperature coefficient of reactivity, {alpha}{sub TF}, moderator temperature coefficient of reactivity, {alpha}{sub TM}, the ratio rapid flux/total flux and the isotopic composition in the begin and the end of life were evaluated. The results showed that the fuels analyzed could be used on PWR and CANDU reactors without the need of change on the design of these reactors. (author)

  5. Estimation of CANDU spent fuel disposal canister lifetime

    Energy Technology Data Exchange (ETDEWEB)

    Kook, Dong Hak; Lee, Min Soo; Hwang, Yong Soo; Choi, Heui Joo [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)

    2009-05-15

    Active nuclear energy utilization causes significant spent fuel accumulation problem. The cumulative amount of spent fuel is about 10,083 ton as of Dec. 2008, and is expected to increase up to 19,000 ton by 2020. Of those, CANDU spent fuels account for more than 60% of the total amounts. CANDU spent fuels had been stored in dry concrete silos since 1991 and during the past 15 years, 300 silos were constructed and {approx}3,200 ton of spent fuels are stored now. Another dry storage facility MACSTOR /KN-400 will store new-coming CANDU spent fuels from 2009. But, after intermediate storage ends, all CANDU spent fuels have to be disposed within multi-layer metallic canister which is composed of cast iron inside and copper outside. Canister lifetime estimation, therefore, is very important for the final disposal safety analysis. The most significant factor of lifetime is copper corrosion, and Y. S. Hwang developed a corrosion model in order to predict the general corrosion effect on copper canister lifetime during the final disposal period. This research applied his model to KURT1 where many disposal researches are being performed actively and the results shows safe margin of the copper canister for the very long-term disposal.

  6. Plutonium Consumption Program, CANDU Reactor Project final report

    Energy Technology Data Exchange (ETDEWEB)

    1994-07-31

    DOE is investigating methods for long term dispositioning of weapons grade plutonium. One such method would be to utilize the plutonium in Mixed OXide (MOX) fuel assemblies in existing CANDU reactors. CANDU (Canadian Deuterium Uranium) reactors are designed, licensed, built, and supported by Atomic Energy of Canada Limited (AECL), and currently use natural uranium oxide as fuel. The MOX spent fuel assemblies removed from the reactor would be similar to the spent fuel currently produced using natural uranium fuel, thus rendering the plutonium as unattractive as that in the stockpiles of commercial spent fuel. This report presents the results of a study sponsored by the DOE for dispositioning the plutonium using CANDU technology. Ontario Hydro`s Bruce A was used as reference. The fuel design study defined the optimum parameters to disposition 50 tons of Pu in 25 years (or 100 tons). Two alternate fuel designs were studied. Safeguards, security, environment, safety, health, economics, etc. were considered. Options for complete destruction of the Pu were also studied briefly; CANDU has a superior ability for this. Alternative deployment options were explored and the potential impact on Pu dispositioning in the former Soviet Union was studied. An integrated system can be ready to begin Pu consumption in 4 years, with no changes required to the reactors other than for safe, secure storage of new fuel.

  7. Impact of aging and material structure on CANDU plant performance

    Energy Technology Data Exchange (ETDEWEB)

    Nadeau, E.; Ballyk, J.; Ghalavand, N. [Candu Energy Inc., Mississauga, Ontario (Canada)

    2011-07-01

    In-service behaviour of pressure tubes is a key factor in the assessment of safety margins during plant operation. Pressure tube deformation (diametral expansion) affects fuel bundle dry out characteristics resulting in reduced margin to trip for some events. Pressure tube aging mechanisms also erode design margins on fuel channels or interfacing reactor components. The degradation mechanisms of interest are primarily deformation, loss of fracture resistance and hydrogen ingress. CANDU (CANada Deuterium Uranium, a registered trademark of the Atomic Energy of Canada Limited used under exclusive licence by Candu Energy Inc.) owners and operators need to maximize plant capacity factor and meet or exceed the reactor design life targets while maintaining safety margins. The degradation of pressure tube material and geometry are characterized through a program of inspection, material surveillance and assessment and need to be managed to optimize plant performance. Candu is improving pressure tubes installed in new build and life extension projects. Improvements include changes designed to reduce or mitigate the impact of pressure tube elongation and diametral expansion rates, improvement of pressure tube fracture properties, and reduction of the implications of hydrogen ingress. In addition, Candu provides an extensive array of engineering services designed to assess the condition of pressure tubes and address the impact of pressure tube degradation on safety margins and plant performance. These services include periodic and in-service inspection and material surveillance of pressure tubes and deterministic and probabilistic assessment of pressure tube fitness for service to applicable standards. Activities designed to mitigate the impact of pressure tube deformation on safety margins include steam generator cleaning, which improves trip margins, and trip design assessment to optimize reactor trip set points restoring safety and operating margins. This paper provides an

  8. Spreading paths in partially observed social networks

    CERN Document Server

    Onnela, Jukka-Pekka

    2011-01-01

    Understanding 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 path lengths 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 a static, structurally realistic social network as a platform 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)? Alt...

  9. Path Problems in Networks

    CERN Document Server

    Baras, John

    2010-01-01

    The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. The repeated appearance of a problem is evidence of its relevance. This book aims to help current and future researchers add this powerful tool to their arsenal, so that they can easily identify and use it in their own work. Path problems in networks can be conceptually divided into two parts: A distillation of the extensive theory behind the algebraic path pr

  10. A study to develop the domestic functional requirements of the specific safety systems of CANDU

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Man Woong [Korea Institute of Nuclear Safety, Taejon (Korea, Republic of); Lee, Jae Young; Park, Kun Chul [Handong Global Univ., Pohang (Korea, Republic of)] (and others)

    2003-03-15

    The present research has been made to develop and review critically the functional requirements of the specific safety systems of CANDU such as SDS-1, SDS2, ECCS, and containment. Based on R documents for this, a systematic study was made to develop the domestic regulation statements. Also, the conventional laws are carefully reviewed to see the compatibility to CANDU. Also, the safety assessment method for CANDU was studied by reviewing C documents and recommendation of IAEA. Through the present works, the vague policy in the CANDU safety regulation is cleaning up in a systematic form and a new frame to measure the objective risk of nuclear power plants was developed.

  11. A study to develop the domestic functional requirements of the specific safety systems of CANDU

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Man Woong; Lee, Jae Young; Bang, Kwang Hyun [Handong Global Univ., Pohang (Korea, Republic of)] (and others)

    2001-03-15

    The present research has been made to develop and review critically the functional requirements of the specific safety systems of CANDU such as SOS-1, SOS-2, ECCS and containment. Based on R documents for this, a systematic study was made to develop the domestic regulation statements. Also, the conventional laws are carefully reviewed to see the compatibility to CANDU. Also, the safety assessment method for CANDU was studied by reviewing C documents and recommendation of IAEA. Through the present works, the vague policy in the CANDU safety regulation is cleaning up in a systematic form and a new frame to measure the objective risk of nuclear power plants was developed.

  12. Performance of pressure tubes in CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Rodgers, D.; Griffiths, M.; Bickel, G.; Buyers, A.; Coleman, C.; Nordin, H.; St Lawrence, S. [Canadian Nuclear Laboratories, Chalk River, Ontario (Canada)

    2016-06-15

    The pressure tubes in CANDU reactors typically operate for times up to about 30 years prior to refurbishment. The in-reactor performance of Zr-2.5Nb pressure tubes has been evaluated by sampling and periodic inspection. This paper describes the behavior and discusses the factors controlling the behaviour of these components. The Zr–2.5Nb pressure tubes are nominally extruded at 815{sup o}C, cold worked nominally 27%, and stress relieved at 400 {sup o}C for 24 hours, resulting in a structure consisting of elongated grains of hexagonal close-packed alpha-Zr, partially surrounded by a thin network of filaments of body-centred-cubic beta-Zr. These beta-Zr filaments are meta-stable and contain about 20% Nb after extrusion. The stress-relief treatment results in partial decomposition of the beta-Zr filaments with the formation of hexagonal close-packed alpha-phase particles that are low in Nb, surrounded by a Nb-enriched beta-Zr matrix. The material properties of pressure tubes are determined by variations in alpha-phase texture, alpha-phase grain structure, network dislocation density, beta-phase decomposition, and impurity concentration that are a function of manufacturing variables. The pressure tubes operate at temperatures between 250 {sup o}C and 310 {sup o}C with coolant pressures up to about 11 MPa in fast neutron fluxes up to 4 x 10{sup 17} n·m{sup -2}·s{sup -1} (E > 1 MeV) and the properties are modified by these conditions. The properties of the pressure tubes in an operating reactor are therefore a function of both manufacturing and operating condition variables. The ultimate tensile strength, fracture toughness, and delayed hydride-cracking properties (velocity (V) and threshold stress intensity factor (K{sub IH})) change with irradiation, but all reach a nearly limiting value at a fluence of less than 10{sup 25} n·m{sup -2} (E > 1 MeV). At this point the ultimate tensile strength is raised about 200 MPa, toughness is reduced by about 50%, V increases

  13. A step towards closing the CANDU fuel cycle: an innovative scheme for reprocessing used CANDU fuel

    Energy Technology Data Exchange (ETDEWEB)

    Collins, F.; Lister, D. [Univ. of New Brunswick, UNB Nuclear, Dept. of Chemical Engineering, Fredericton, New Brunswick (Canada)

    2011-07-01

    Disposal versus reprocessing costs for used CANDU fuel was recently discussed by Rozon and Lister in a report produced for the Nuclear Waste Management Organization (NWMO). Their study discussed the economic incentives for reprocessing, not for the recovery of fissile uranium but for the recovery of plutonium ash. A $370/kg break-even price of uranium was calculated, and their model was found to be very sensitive to the reprocessing costs of the chosen technology. Findings were consistent with earlier studies done by Harvard University. Various reprocessing technologies (most based on solvent extraction) have been in use for many decades, but there appears to be no conceptual engineering study available in the open literature for a spent fuel reprocessing facility - one that includes process flows, operating costs and economic analysis. A deeper engineering study of the design and economics of re-processing technologies has since been undertaken by the nuclear group at the University of New Brunswick. An improved fluorination process was developed and modeled using ASPEN process simulation software. This study examines the impact of chosen technology on the spent fuel re-processing costs. (author)

  14. Scenarios for the transmutation of actinides in CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Hyland, Bronwyn, E-mail: hylandb@aecl.ca [Atomic Energy of Canada Limited, Chalk River Laboratories, Chalk River, Ontario, K0J 1J0 (Canada); Gihm, Brian, E-mail: gihmb@aecl.ca [Atomic Energy of Canada Limited, 2251 Speakman Drive, Mississauga, Ontario, L5K 1B2 (Canada)

    2011-12-15

    With world stockpiles of used nuclear fuel increasing, the need to address the long-term utilization of this resource is being studied. Many of the transuranic (TRU) actinides in nuclear spent fuel produce decay heat for long durations, resulting in significant nuclear waste management challenges. These actinides can be transmuted to shorter-lived isotopes to reduce the decay heat period or consumed as fuel in a CANDU(R) reactor. Many of the design features of the CANDU reactor make it uniquely adaptable to actinide transmutation. The small, simple fuel bundle simplifies the fabrication and handling of active fuels. Online refuelling allows precise management of core reactivity and separate insertion of the actinides and fuel bundles into the core. The high neutron economy of the CANDU reactor results in high TRU destruction to fissile-loading ratio. This paper provides a summary of actinide transmutation schemes that have been studied in CANDU reactors at AECL, including the works performed in the past. The schemes studied include homogeneous scenarios in which actinides are uniformly distributed in all fuel bundles in the reactor, as well as heterogeneous scenarios in which dedicated channels in the reactor are loaded with actinide targets and the rest of the reactor is loaded with fuel. The transmutation schemes that are presented reflect several different partitioning schemes. Separation of americium, often with curium, from the other actinides enables targeted destruction of americium, which is a main contributor to the decay heat 100-1000 years after discharge from the reactor. Another scheme is group-extracted transuranic elements, in which all of the transuranic elements, plutonium (Pu), neptunium (Np), americium (Am), and curium (Cm) are extracted together and then transmuted. This paper also addresses ways of utilizing the recycled uranium, another stream from the separation of spent nuclear fuel, in order to drive the transmutation of other actinides.

  15. Qualification of inspection systems in the CANDU nuclear industry

    Energy Technology Data Exchange (ETDEWEB)

    Baron, J.A. [CANDU Owners Group, CANDU Inspection Qualification Bureau, Toronto, Ontario (Canada)

    2014-01-15

    Most jurisdictions that generate electricity through nuclear-electric plants have imposed requirements on inspection systems beyond the typical Level 1, 2 and 3 found in personnel qualification/certification schemes. The paper discusses the rationale for this obligation and describes how the requirement for inspection qualification has been implemented for CANDU plants. The paper discusses the qualification structure and process, including a brief overview of experience to-date in qualifying Inspection Procedures. (author)

  16. Assessment of DUPIC fuel compatibility with CANDU-6

    Energy Technology Data Exchange (ETDEWEB)

    Choi, H. B.; Roh, G. H.; Jeong, C. J.; Rhee, B. W.; Choi, J. W. [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1997-07-01

    The compatibility of DUPIC fuel with the existing CANDU reactor was assessed. The technical issues of DUPIC fuel compatibility were chosen based on the CANDU physics design requirements and inherent characteristics of DUPIC fuel. The compatibility was assessed for the reference DUPIC fuel composition which was determined to reduce the composition heterogeneity and improve the spent PWR fuel utilization. Preliminary studies on a CANDU core loaded with DUPIC fuel have shown that the nominal power distribution is flatter than that of a natural uranium core when a 2-bundle shift refueling scheme is used, which reduces the reactivity worths of devices in the core and, therefore, the performance of reactivity devices was assessed. The safety of the core was assessed by a LOCA simulation and it was found that the power pulse upon LOCA can be maintained below that in the natural uranium core when a poison material is used in the DUPIC fuel. For the feasibility of handling DUPIC fuel in the plant, it will be necessary to introduce new equipment to load the DUPIC fuel in the refueling magazine. The radiation effect of DUPIC fuel on both the reactor hardware and the environment will require a quantitative analysis later. (author).

  17. An emergency water injection system (EWIS) for future CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Marques, Andre L.F. [Centro Tecnologico da Marinha em Sao Paulo (CTMSP), SP (Brazil). E-mail: momarques@uol.com.br; Todreas, Neil E.; Driscoll, Michael J. [Massachusetts Inst.of Tech., Cambridge, MA (United States). Nuclear Engineering Dept.

    2000-07-01

    This paper deals with the investigation of the feasibility and effectiveness of water injection into the annulus between the calandria tubes and the pressure tubes of CANDU reactors. The purpose is to provide an efficient decay heat removal process that avoids permanent deformation of pressure tubes severe accident conditions, such as loss of coolant accident (LOCA). The water injection may present the benefit of cost reduction and better actuation of other related safety systems. The experimental work was conducted at the Massachusetts Institute of Technology (MIT), in a setup that simulated, as close as possible, a CANDU bundle annular configuration, with heat fluxes on the order of 90 kW/m{sup 2}: the inner cylinder simulates the pressure tube and the outer tube represents the calandria tube. The experimental matrix had three dimensions: power level, annulus water level and boundary conditions. The results achieved overall heat transfer coefficients (U), which are comparable to those required (for nominal accident progression) to avoid pressure tube permanent deformation, considering current CANDU reactor data. Nonetheless, future work should be carried out to investigate the fluid dynamics such as blowdown behavior, in the peak bundle, and the system lay-out inside the containment to provide fast water injection. (author)

  18. Advancement of safeguards inspection technology for CANDU nuclear power plants

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Jae Sung; Park, W. S.; Cha, H. R.; Ham, Y. S.; Lee, Y. G.; Kim, K. P.; Hong, Y. D

    1999-04-01

    The objectives of this project are to develop both inspection technology and safeguards instruments, related to CANDU safeguards inspection, through international cooperation, so that those outcomes are to be applied in field inspections of national safeguards. Furthermore, those could contribute to the improvement of verification correctness of IAEA inspections. Considering the level of national inspection technology, it looked not possible to perform national inspections without the joint use of containment and surveillance equipment conjunction with the IAEA. In this connection, basic studies for the successful implementation of national inspections was performed, optimal structure of safeguards inspection was attained, and advancement of safeguards inspection technology was forwarded. The successful implementation of this project contributed to both the improvement of inspection technology on CANDU reactors and the implementation of national inspection to be performed according to the legal framework. In addition, it would be an opportunity to improve the ability of negotiating in equal shares in relation to the IAEA on the occasion of discussing or negotiating the safeguards issues concerned. Now that the national safeguards technology for CANDU reactors was developed, the safeguards criteria, procedure and instruments as to the other item facilities and fabrication facilities should be developed for the perfection of national inspections. It would be desirable that the recommendations proposed and concreted in this study, so as to both cope with the strengthened international safeguards and detect the undeclared nuclear activities, could be applied to national safeguards scheme. (author)

  19. Faster Replacement Paths

    CERN Document Server

    Williams, Virginia Vassilevska

    2010-01-01

    The replacement paths problem for directed graphs is to find for given nodes s and t and every edge e on the shortest path between them, the shortest path between s and t which avoids e. For unweighted directed graphs on n vertices, the best known algorithm runtime was \\tilde{O}(n^{2.5}) by Roditty and Zwick. For graphs with integer weights in {-M,...,M}, Weimann and Yuster recently showed that one can use fast matrix multiplication and solve the problem in O(Mn^{2.584}) time, a runtime which would be O(Mn^{2.33}) if the exponent \\omega of matrix multiplication is 2. We improve both of these algorithms. Our new algorithm also relies on fast matrix multiplication and runs in O(M n^{\\omega} polylog(n)) time if \\omega>2 and O(n^{2+\\eps}) for any \\eps>0 if \\omega=2. Our result shows that, at least for small integer weights, the replacement paths problem in directed graphs may be easier than the related all pairs shortest paths problem in directed graphs, as the current best runtime for the latter is \\Omega(n^{2.5...

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

  1. Utilization of spent PWR fuel-advanced nuclear fuel cycle of PWR/CANDU synergism

    Institute of Scientific and Technical Information of China (English)

    HUO Xiao-Dong; XIE Zhong-Sheng

    2004-01-01

    High neutron economy, on line refueling and channel design result in the unsurpassed fuel cycle flexibility and variety for CANDU reactors. According to the Chinese national conditions that China has both PWR and CANDU reactors and the closed cycle policy of reprocessing the spent PWR fuel is adopted, one of the advanced nuclear fuel cycles of PWR/CANDU synergism using the reprocessed uranium of spent PWR fuel in CANDU reactor is proposed, which will save the uranium resource (~22.5%), increase the energy output (~41%), decrease the quantity of spent fuels to be disposed (~2/3) and lower the cost of nuclear power. Because of the inherent flexibility of nuclear fuel cycle in CANDU reactor, and the low radiation level of recycled uranium(RU), which is acceptable for CANDU reactor fuel fabrication, the transition from the natural uranium to the RU can be completed without major modification of the reactor core structure and operation mode. It can be implemented in Qinshan Phase Ⅲ CANDU reactors with little or no requirement of big investment in new design. It can be expected that the reuse of recycled uranium of spent PWR fuel in CANDU reactor is a feasible and desirable strategy in China.

  2. Development of best estimate auditing code for CANDU thermal hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chung, B. D.; Lee, W. J.; Lim, H. S. [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    2000-03-15

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model if existing PWR auditing tool, i.e. RELAP5/MOD3. This scope of project is a third step of the whole project, and expand the RELAP5/MOD3/CANDU version for implementation of LOCA analysis. There are three main area of model development, i.e. moody critical flow model, flow regime model of horizontal CANDU bundle, and fuel element heatup model when the stratification occurs. Newly developed version, namely RELAP5/MOD3/CANDU+ is applicable to CANDU plant analysis with keeping the function of light water reactor analysis. The limited validations of model installation were performed. Assessment of CHF model using AECL separated effect test and calculation for Wolsong 2 plant were performed also for the applicability test of the developed version.

  3. Development of a best estimate auditing code for CANDU thermal hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chung, B.D.; Lee, W.J.; Lim, H.S. [Korea Atomic Energy Research Institute, Taejeon (Korea)

    2000-03-01

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model of existing PWR auditing tool , i.e. RELAP5/MOD3. This scope of project is a third step of the whole project, and expand the RELAP5/MOD3/CANDU version for implementation of LOCA Analysis. There are three main area of model development, i.e. Moody critical flow model, flow regime model of horizontal CANDU bundle, and fuel element heatup model when the stratification occurs. Newly developed version, namely RELAP5/MOD3/CANDU+ is applicable to CANDU plant analysis with keeping the function of light water reactor analysis. The limited validations of model installation were performed. Assessment of CHF model using AECL separated effect test and calculation for Wolsong 2 plant were performed also for the applicability test of the developed version. 15 refs., 37 figs., 8 tabs. (Author)

  4. Spatial interpolation of river channel topography using the shortest temporal distance

    Science.gov (United States)

    Zhang, Yanjun; Xian, Cuiling; Chen, Huajin; Grieneisen, Michael L.; Liu, Jiaming; Zhang, Minghua

    2016-11-01

    It is difficult to interpolate river channel topography due to complex anisotropy. As the anisotropy is often caused by river flow, especially the hydrodynamic and transport mechanisms, it is reasonable to incorporate flow velocity into topography interpolator for decreasing the effect of anisotropy. In this study, two new distance metrics defined as the time taken by water flow to travel between two locations are developed, and replace the spatial distance metric or Euclidean distance that is currently used to interpolate topography. One is a shortest temporal distance (STD) metric. The temporal distance (TD) of a path between two nodes is calculated by spatial distance divided by the tangent component of flow velocity along the path, and the STD is searched using the Dijkstra algorithm in all possible paths between two nodes. The other is a modified shortest temporal distance (MSTD) metric in which both the tangent and normal components of flow velocity were combined. They are used to construct the methods for the interpolation of river channel topography. The proposed methods are used to generate the topography of Wuhan Section of Changjiang River and compared with Universal Kriging (UK) and Inverse Distance Weighting (IDW). The results clearly showed that the STD and MSTD based on flow velocity were reliable spatial interpolators. The MSTD, followed by the STD, presents improvement in prediction accuracy relative to both UK and IDW.

  5. Development of CANDU pressure tube integrity evaluation system

    Energy Technology Data Exchange (ETDEWEB)

    Kwac, S. L.; Kim, Y. J. [Sungkyunkwan Univ., Seoul (Korea, Republic of); Lee, J. S. [Kyonggi Univ., Suwon (Korea, Republic of); Park, Y. W. [KINS, Taejon (Korea, Republic of)

    1999-05-01

    The pressure tube is a major component of the CANDU reactor, which supports nuclear fuel bundle and it's containment vessel. If a flaw or contact with their calandria tubes is found during the periodic inspection, the integrity evaluation must be carried out, and the safety requirements must be satisfied for continued service. In order to perform the integrity evaluation, complicated and iterative calculation procedures are required. Besides, a lot of data and knowledge for the evaluation are required for the integrity evaluation process. For this reason, an integrity evaluation system was developed. The developed system was built on the basis of ASME Sec. XI and FFSG(Fitness For Service Guidelines for zirconium alloy pressure tubes in operating CANDU reactors) issued by the AECL. The evaluation procedure includes the crack growth calculation both by DHC and by fatigue. It also provides the prediction of fracture initiation, plastic collapse and leak-before-break(LBB), blister formation and blister growth. This system provides various databases including the 3-D finite element analysis results on pressure tubes, inspection data and design specifications. In order to verify the developed system, several case studies have been performed and the results were compared with those from AECL. A good agreement was observed between those two results.

  6. Desktop Severe Accident Graphic Simulator Module for CANDU6 : PSAIS

    Energy Technology Data Exchange (ETDEWEB)

    Park, S. Y.; Song, Y. M. [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)

    2015-10-15

    The ISAAC ((Integrated Severe Accident Analysis Code for CANDU Plant) code is a system level computer code capable of performing integral analyses of potential severe accident progressions in nuclear power plants, whose main purpose is to support a Level 2 probabilistic safety assessment or severe accident management strategy developments. The code has the capability to predict a severe accident progression by modeling the CANDU6- specific systems and the expected physical phenomena based on the current understanding of the unique accident progressions. The code models the sequence of accident progressions from a core heatup, pressure tube/calandria tube rupture after an uncovery from inside and outside, a relocation of the damaged fuel to the bottom of the calandria, debris behavior in the calandria, corium quenching after a debris relocation from the calandria to the calandria vault and an erosion of the calandria vault concrete floor, a hydrogen burn, and a reactor building failure. Along with the thermal hydraulics, the fission product behavior is also considered in the primary system as well as in the reactor building.

  7. Future CANDU nuclear power plant design requirements document executive summary

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Duk Su; Chang, Woo Hyun; Lee, Nam Young [Korea Atomic Energy Research Institute, Daeduk (Korea, Republic of); Usmani, S.A. [Atomic Energy of Canada Ltd., Toronto (Canada)

    1996-03-01

    The future CANDU Requirements Document (FCRED) describes a clear and complete statement of utility requirements for the next generation of CANDU nuclear power plants including those in Korea. The requirements are based on proven technology of PHWR experience and are intended to be consistent with those specified in the current international requirement documents. Furthermore, these integrated set of design requirements, incorporate utility input to the extent currently available and assure a simple, robust and more forgiving design that enhances the performance and safety. The FCRED addresses the entire plant, including the nuclear steam supply system and the balance of the plant, up to the interface with the utility grid at the distribution side of the circuit breakers which connect the switchyard to the transmission lines. Requirements for processing of low level radioactive waste at the plant site and spent fuel storage requirements are included in the FCRED. Off-site waste disposal is beyond the scope of the FCRED. 2 tabs., 1 fig. (Author) .new.

  8. In-reactor performance of pressure tubes in CANDU reactors

    Science.gov (United States)

    Rodgers, D. K.; Coleman, C. E.; Griffiths, M.; Bickel, G. A.; Theaker, J. R.; Muir, I.; Bahurmuz, A. A.; Lawrence, S. St.; Resta Levi, M.

    2008-12-01

    The pressure tubes in CANDU reactors have been operating for times up to about 25 years. The in-reactor performance of Zr-2.5Nb pressure tubes has been evaluated by sampling and periodic inspection. This paper describes the behaviour and discusses the factors controlling the behaviour of these components in currently operating CANDU reactors. The mechanical properties (such as ultimate tensile strength, UTS, and fracture toughness), and delayed-hydride-cracking properties (crack growth rate Vc, and threshold stress intensity factor, KIH) change with irradiation; the former reach a limiting value at a fluence of Pressure tubes exhibit elongation and diametral expansion. The deformation behaviour is a function of operating conditions and material properties that vary from tube-to-tube and as a function of axial location. Semi-empirical predictive models have been developed to describe the deformation response of average tubes as a function of operating conditions. For corrosion and, more importantly deuterium pickup, semi-empirical predictive models have also been developed to represent the behaviour of an average tube. The effect of material variability on corrosion behaviour is less well defined compared with other properties. Improvements in manufacturing have increased fracture resistance by minimising trace elements, especially H and Cl, and reduced variability by tightening controls on forming parameters, especially hot-working temperatures.

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

  10. Evaluation of safety margins during dry storage of CANDU fuel in MACSTOR/KN-400 module

    Energy Technology Data Exchange (ETDEWEB)

    Beaudoin, R.; Shill, R. [Atomic Energy Of Canada Limited, Montreal, Quebec (Canada); Lee, K.-H.; Chung, S.-H.; Yoon, J.-H.; Choi, B.-I.; Lee, H.-Y.; Song, M.-J. [KHNP, Nuclear Environment Technology Inst., Taejon (Korea, Republic of)

    2005-03-15

    This paper covers an evaluation of the available safety margin against fuel bundle degradation during dry storage of CANDU spent fuel bundles in a MACSTOR/KN-400 module, considering normal, off-normal and postulated accidental conditions. (author)

  11. Development of a best estimate auditing code for CANDU thermal hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chung, B.D.; Lee, W.J.; Lim, H.S. [Korea Atomic Energy Research Institute, Taejon (Korea)

    1999-04-01

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model of existing PWR auditing tool, i.e. RELAP5/MOD3. This scope of project is a second step of the whole project, and focus to the implementation of CANDU models based on the previous study. FORTRAN 90 language have been used for the development of RELAP5.MOD3/CANDU PC version. For the convenience of the previous Workstation users, the FOTRAN 77 version has been coded also and implanted into the original RELAP5 source file. The verification of model implementation has been performed through the simple verification calculations using the CANDU version. 6 refs., 15 figs., 7 tabs. (Author)

  12. CURRENT STATUS OF INTEGRITY ASSESSMENT BY SIPPING SYSTEM OF SPENT FUEL BUNDLES IRRADIATED IN CANDU REACTOR

    Directory of Open Access Journals (Sweden)

    JONG-YOUL PARK

    2014-12-01

    Full Text Available In terms of safety and the efficient management of spent fuel storage, detecting failed fuel is one of the most important tasks in a CANada Deuterium Uranium (CANDU reactor operation. It has been successfully demonstrated that in a CANDU reactor, on-power failed fuel detection and location systems, along with alarm area gamma monitors, can detect and locate defective and suspect fuel bundles before discharging them from the reactor to the spent fuel storage bay. In the reception bay, however, only visual inspection has been used to identify suspect bundles. Gaseous fission product and delayed neutron monitoring systems cannot precisely distinguish failed fuel elements from each fuel bundle. This study reports the use of a sipping system in a CANDU reactor for the integrity assessment of spent fuel bundles. The integrity assessment of spent fuel bundles using this sipping system has shown promise as a nondestructive test for detecting a defective fuel bundle in a CANDU reactor.

  13. Pre-licensing of the Advanced CANDU Reactor

    Energy Technology Data Exchange (ETDEWEB)

    Ion, R.; Popov, N.K.; Snell, V. [Atomic Energy of Canada Limited, Mississauga, Ontario (Canada)]. E-mail: popovn@aecl.ca; West, J. [Candesco, Toronto, Ontario (Canada); Xu, C. [Atomic Energy of Canada Limited, Mississauga, Ontario (Canada)

    2006-07-01

    Atomic Energy of Canada Limited (AECL) developed the Advanced CANDU Reactor-700 (ACR-700) as an evolutionary advancement of the current CANDU 6 reactor. As further advancement of the ACR design, AECL is currently developing the ACR-1000 for the Canadian and international market. The ACR-1000 is aimed at producing electrical power for a capital cost and a unit-energy cost significantly less than that of the current generation of operating nuclear plants, while achieving shorter construction schedule, high plant capacity factor, improved operations and maintenance, increased operating life, and enhanced safety features. The reference ACR-1000 plant design is based on an integrated two-unit plant, using enriched fuel and light-water coolant, with each unit having a nominal gross output of about 1200 MWe. AECL initiated pre-licensing reviews of the ACR reactor design in Canada, US and China, with an objective to take into account regulatory feedback early in the design process. The Canadian Nuclear Safety Commission (CNSC) is performing a pre-project pre-licensing assessment of the ACR design. The objective of the assessment is to issue a formal statement as to whether there are any fundamental barriers that would prevent the licensing of the new CANDU reactor design in Canada under the Nuclear Safety and Control Act. The CNSC review is being conducted in four phases. In Phase 1 (September 2003 to September 2004) CNSC performed a pre-licensing review of the ACR-700, and focused on the design process, methodology, design concepts and R and D. CNSC staff reviewed about 100 reports, and submitted to AECL questions and comments. In Phase 2 (September 2004 to August 2005) AECL provided responses and additional information to CNSC on their comments and questions in Phase 1. Phase 3 is the Transition Phase (September 2005 to May 2006), bridging the transition from the ACR-700 to the ACR-1000 design. Phase 3 focused on review of generic aspects of the ACR design, on the Safety

  14. Operating Experience of MACSTOR Modules at CANDU 6 Stations

    Energy Technology Data Exchange (ETDEWEB)

    Beaudoin, Robert R. [Atomic Energy Canada Ltd., Chalk River (Canada)

    2005-11-15

    Over the last three decades, Atomic Energy of Canada Limited (AECL) has contributed to the technology development and implementation of dry spent fuel management facilities in Canada, Korea and Romania During that period, AECL has developed a number of concrete canister models and the MACSTOR200 module, a medium size air-cooled vault with a 228 MgU (Mega grams of Uranium) capacity. AECL's dry storage technologies were used for the construction of eight large-scale above ground dry storage facilities for CANDU spent fuel. As of 2005, those facilities have an installed capacity in excess of 5,000 MgU. Since 1995, the two newest dry storage installations built for CANDU 6 reactors at Gentilly 2 (Canada) and Cernavoda (Romania) used the MACSTOR 200 module. Seven such modules have been built at Gentilly 2 during the 1995 to 2004 period and one at Cernavoda in 2003. The construction and operating experience of those modules is reviewed in this paper. The MACSTOR 200 modules were initially designed for a 50-year service life, with recent units at Gentilly 2 licensed for a 100-year service life in a rural (non-maritime) climate. During the 1995-2005 period, six of the eight modules were loaded with fuel. Their operation has brought a significant amount of experience on loading operations, performance of fuel handling equipment, radiation shielding, heat transfer, monitoring of the two confinement boundaries and radiation dose to personnel. Heat dissipation performance of the MACSTOR 200 was initially licensed using values derived from full scale tests made at AECL's Whiteshell Research Laboratories, that were backed-up by temperature measurements made on the first two modules. Results and computer models developed for the MACSTOR 200 module are described. Korea Hydro and Nuclear Power (KHNP) and its subsidiary Nuclear Environment Technology Institute (NETEC), in collaboration with Hyundai Engineering Company Ltd. (HEC) and AECL, are developing a new dry storage

  15. Proceedings of the fifth international conference on CANDU fuel. V.1,2

    Energy Technology Data Exchange (ETDEWEB)

    Lau, J.H. [ed.

    1997-07-01

    The First International Conference on CANDU Fuel was held in Chalk River in 1986. The CANDU Fuel community has gathered every three years since. The papers presented include topics on international experience, CANFLEX fuel bundles, Fuel design, Fuel modelling, Manufacturing and Quality assurance, Fuel performance and Safety, Fuel cycles and Spent Fuel management. Volume One was published in advance of the conference and Volume Two was printed after the conference.

  16. Computing the Length of the Shortest Telomere in the Nucleus

    Science.gov (United States)

    Dao Duc, K.; Holcman, D.

    2013-11-01

    The telomere length can either be shortened or elongated by an enzyme called telomerase after each cell division. Interestingly, the shortest telomere is involved in controlling the ability of a cell to divide. Yet, its dynamics remains elusive. We present here a stochastic approach where we model this dynamics using a Markov jump process. We solve the forward Fokker-Planck equation to obtain the steady state distribution and the statistical moments of telomere lengths. We focus specifically on the shortest one and we estimate its length difference with the second shortest telomere. After extracting key parameters such as elongation and shortening dynamics from experimental data, we compute the length of telomeres in yeast and obtain as a possible prediction the minimum concentration of telomerase required to ensure a proper cell division.

  17. AN OPTIMUM VEHICULAR PATH ALGORITHM FOR TRAFFIC NETWORK BASED ON HIERARCHICAL SPATIAL REASONING

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Human beings' intellection is the characteristic of a distinct hierarchy and can be taken to construct a heuristic in the shortest path algorithms.It is detailed in this paper how to utilize the hierarchical reasoning on the basis of greedy and directional strategy to establish a spatial heuristic,so as to improve running efficiency and suitability of shortest path algorithm for traffic network.The authors divide urban traffic network into three hierarchies and set forward a new node hierarchy division rule to avoid the unreliable solution of shortest path.It is argued that the shortest path,no matter distance shortest or time shortest,is usually not the favorite of drivers in practice.Some factors difficult to expect or quantify influence the drivers' choice greatly.It makes the drivers prefer choosing a less shortest,but more reliable or flexible path to travel on.The presented optimum path algorithm,in addition to the improvement of the running efficiency of shortest path algorithms up to several times,reduces the emergence of those factors,conforms to the intellection characteristic of human beings,and is more easily accepted by drivers.Moreover,it does not require the completeness of networks in the lowest hierarchy and the applicability and fault tolerance of the algorithm have improved.The experiment result shows the advantages of the presented algorithm.The authors argued that the algorithm has great potential application for navigation systems of large-scale traffic networks.

  18. Integrated evolution of the medium power CANDU{sup MD} reactors; Evolution integree des reacteurs CANDU{sup MD} de moyenne puissance

    Energy Technology Data Exchange (ETDEWEB)

    Nuzzo, F. [AECL Accelerators, Kanata, ON (Canada)

    2002-07-01

    The aim of this document is the main improvements of the CANDU reactors in the economic, safety and performance domains. The presentation proposes also other applications as the hydrogen production, the freshening of water sea and the bituminous sands exploitation. (A.L.B.)

  19. Shortest exposure time possible with LED curing lights

    NARCIS (Netherlands)

    Busemann, I.; Lipke, C.; Schattenberg, A.V.M.B.; Willershausen, B.; Ernst, C.P.

    2011-01-01

    PURPOSE: To investigate the shortest exposure time of different light emitting diode (LED)-curing devices for different resin composites in a clinically relevant laboratory model. METHODS: Nine LED curing devices (Bluephase, Bluephase 16i, Bluephase G2, Bluephase 20i/Ivoclar Vivadent, DEMI/sds Kerr,

  20. Solving the replacement paths problem for planar directed graphs in O(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 algo...

  1. Genome comparison without alignment using shortest unique substrings

    Directory of Open Access Journals (Sweden)

    Möller Friedrich

    2005-05-01

    Full Text Available Abstract Background Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection of unique genomic regions, can be accomplished efficiently without an alignment step. Our procedure for nucleotide sequence comparison is based on shortest unique substrings. These are substrings which occur only once within the sequence or set of sequences analysed and which cannot be further reduced in length without losing the property of uniqueness. Such substrings can be detected using generalized suffix trees. Results We find that the shortest unique substrings in Caenorhabditis elegans, human and mouse are no longer than 11 bp in the autosomes of these organisms. In mouse and human these unique substrings are significantly clustered in upstream regions of known genes. Moreover, the probability of finding such short unique substrings in the genomes of human or mouse by chance is extremely small. We derive an analytical expression for the null distribution of shortest unique substrings, given the GC-content of the query sequences. Furthermore, we apply our method to rapidly detect unique genomic regions in the genome of Staphylococcus aureus strain MSSA476 compared to four other staphylococcal genomes. Conclusion We combine a method to rapidly search for shortest unique substrings in DNA sequences and a derivation of their null distribution. We show that unique regions in an arbitrary sample of genomes can be efficiently detected with this method. The corresponding programs shustring (SHortest Unique subSTRING and shulen are written in C and available at http://adenine.biz.fh-weihenstephan.de/shustring/.

  2. Radiological Characteristics of decommissioning waste from a CANDU reactor

    Energy Technology Data Exchange (ETDEWEB)

    Cho, Dong Keun; Choi, Heui Joo [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of); Ahmed, Rizwan; Heo, Gyun Young [Dept. of Nuclear Engineering, Kyung Hee University, Yongin (Korea, Republic of)

    2011-11-15

    The radiological characteristics for waste classification were assessed for neutron-activated decommissioning wastes from a CANDU reactor. The MCNP/ORIGEN2 code system was used for the source term analysis. The neutron flux and activation cross-section library for each structural component generated by MCNP simulation were used in the radionuclide buildup calculation in ORIGEN2. The specific activities of the relevant radionuclides in the activated metal waste were compared with the specified limits of the specific activities listed in the Korean standard and 10 CFR 61. The time-average full-core model of Wolsong Unit 1 was used as the neutron source for activation of in-core and ex-core structural components. The approximated levels of the neutron flux and cross-section, irradiated fuel composition, and a geometry simplification revealing good reliability in a previous study were used in the source term calculation as well. The results revealed the radioactivity, decay heat, hazard index, mass, and solid volume for the activated decommissioning waste to be 1.04 x 10{sup 16} Bq, 2.09 x 10{sup 3} W, 5.31 x 10{sup 14} m{sup 3}-water, 4.69 x 10{sup 5} kg, and 7.38 x 10{sup 1} m{sup 3}, respectively. According to both Korean and US standards, the activated waste of the pressure tubes, calandria tubes, reactivity devices, and reactivity device supporters was greater than Class C, which should be disposed of in a deep geological disposal repository, whereas the side structural components were classified as low- and intermediate-level waste, which can be disposed of in a land disposal repository. Finally, this study confirmed that, regardless of the cooling time of the waste, 15% of the decommissioning waste cannot be disposed of in a land disposal repository. It is expected that the source terms and waste classification evaluated through this study can be widely used to establish a decommissioning/disposal strategy and fuel cycle analysis for CANDU reactors.

  3. CANDU in-reactor quantitative visual-based inspection techniques

    Science.gov (United States)

    Rochefort, P. A.

    2009-02-01

    This paper describes two separate visual-based inspection procedures used at CANDU nuclear power generating stations. The techniques are quantitative in nature and are delivered and operated in highly radioactive environments with access that is restrictive, and in one case is submerged. Visual-based inspections at stations are typically qualitative in nature. For example a video system will be used to search for a missing component, inspect for a broken fixture, or locate areas of excessive corrosion in a pipe. In contrast, the methods described here are used to measure characteristic component dimensions that in one case ensure ongoing safe operation of the reactor and in the other support reactor refurbishment. CANDU reactors are Pressurized Heavy Water Reactors (PHWR). The reactor vessel is a horizontal cylindrical low-pressure calandria tank approximately 6 m in diameter and length, containing heavy water as a neutron moderator. Inside the calandria, 380 horizontal fuel channels (FC) are supported at each end by integral end-shields. Each FC holds 12 fuel bundles. The heavy water primary heat transport water flows through the FC pressure tube, removing the heat from the fuel bundles and delivering it to the steam generator. The general design of the reactor governs both the type of measurements that are required and the methods to perform the measurements. The first inspection procedure is a method to remotely measure the gap between FC and other in-core horizontal components. The technique involves delivering vertically a module with a high-radiation-resistant camera and lighting into the core of a shutdown but fuelled reactor. The measurement is done using a line-of-sight technique between the components. Compensation for image perspective and viewing elevation to the measurement is required. The second inspection procedure measures flaws within the reactor's end shield FC calandria tube rolled joint area. The FC calandria tube (the outer shell of the FC) is

  4. Development of an Integrity Assessment Procedure for CANDU Pressure Tubes

    Energy Technology Data Exchange (ETDEWEB)

    Chung, Han Sub [Korea Electric Power Research Institute, Daejeon (Korea, Republic of)

    2010-10-15

    The pressure tubes used in a CANDU reactor are made from Zr-2.5Nb. During service the pressure tubes operate at temperatures between about 150 and 310 .deg. C, and with variable coolant pressures up to 11MPa corresponding to hoop stress of up to 130MPa. The maximum flux of fast neutrons (E>1MeV) from the fuel is about 4X10{sup 17}nm{sup -2}{sub s}{sup -1}. The pressure tubes are exposed to very severe degradation environment. The aging degradation of the pressure tubes are summarized as below. - Geometric deformation; axial elongation, diametric creep, and wall thinning. - Deuterium uptake; some fraction of the deuterium generated by the corrosion of pressure tubes is absorbed into the pressure tubes. Total equivalent hydrogen content in the pressure tube is the sum of the initial hydrogen content before operation and the deuterium uptake during operation. High concentration of hydrogen inside the pressure tubes makes the metal susceptible to Delayed Hydride Cracking. The DHC is a degradation mechanism of prime importance for CANDU pressure tubes. Mechanical properties, in particular fracture toughness, are deteriorated by high concentration of dissolved hydrogen. - Flaws; volumetric flaws are generated during operation. Wear scars by debris fretting, and bearing pad fretting are common. These volumetric flaws can be a site of crack initiation by fatigue or DHC. Cracks can propagate by DHC or fatigue crack propagation if conditions are met. - Material properties degradation; mechanical properties are affected by neutron irradiation. Yield strength and tensile strength are increased, and fracture toughness is deteriorated. The susceptibility to DHC is also affected. The integrity assessment of the pressure tube is a procedure to determine if the risk of pressure tube failure is controlled to maintain acceptably low. CSA N285.4 and 285.8 are two important guidelines regarding the integrity of pressure tubes. N285.4 is to guide in-service inspection, and N285

  5. Development of a best estimate auditing code for CANDU thermal hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Hwang, M. K.; Lee, W. J. [Korea Atomic Energy Research Institute, Taejeon (Korea)

    2001-03-01

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model of existing PWR auditing tool , i.e. RELAP5/MOD3. This scope of project is a fourth step of the whole project, applying the RELAP5/MOD3/CANDU+ version for the real CANDU plant LOCA Analysis and D2O leakage incident. There are three main models under investigation, i.e. Moody critical flow model, flow regime model of horizontal CANDU bundle, and fuel element heatup model when the stratification occurs, especially when CANDU LOCA is tested. Also, for Wolsung unit 1 D2O leakage incident analysis, the plant behavior is predicted with the newly developed version for the first 1000 seconds after onset of the incident, with the main interest aiming for system pressure, level control system, and thermal hydraulic transient behavior of the secondary system. The model applied for this particular application includes heat transfer model of nuclear fuel assembly, decay heat model, and MOV (Motor Operated Valve) model. Finally, the code maintenance work, mainly correcting the known errors, is presented. 12 refs., 26 figs., 3 tabs. (Author)

  6. Estimation of Aging Effects on LOHS for CANDU-6

    Energy Technology Data Exchange (ETDEWEB)

    Yoon, Yong Ki; Moon, Bok Ja; Kim, Seoung Rae [Nuclear Engineering Service and Solution Co. Ltd., Daejeon (Korea, Republic of)

    2014-05-15

    To evaluate the Wolsong Unit 1's capacity to respond to large-scale natural disaster exceeding design, the loss of heat sink(LOHS) accident accompanied by loss of all electric power is simulated as a beyond design basis accident. This analysis is considered the aging effects of plant as the consequences of LOHS accident. Various components of primary heat transport system(PHTS) get aged and some of the important aging effects of CANDU reactor are pressure tube(PT) diametral creep, steam generator(SG) U-tube fouling, increased feeder roughness, and feeder orifice degradation. These effects result in higher inlet header temperatures, reduced flows in some fuel channels, and higher void fraction in fuel channel outlets. Fresh and aged models are established for the analysis where fresh model is the circuit model simulating the conditions at retubing and aged model corresponds to the model reflecting the aged condition at 11 EFPY after retubing. CATHENA computer code[1] is used for the analysis of the system behavior under LOHS condition. The LOHS accident is analyzed for fresh and aged models using CATHENA thermal hydraulic computer code. The decay heat removal is one of the most important factors for mitigation of this accident. The major aging effect on decay heat removal is the reduction of heat transfer efficiency by steam generator. Thus, the channel failure time cannot be conservatively estimated if aged model is applied for the analysis of this accident.

  7. Computer code applicability assessment for the advanced Candu reactor

    Energy Technology Data Exchange (ETDEWEB)

    Wren, D.J.; Langman, V.J.; Popov, N.; Snell, V.G. [Atomic Energy of Canada Ltd (Canada)

    2004-07-01

    AECL Technologies, the 100%-owned US subsidiary of Atomic Energy of Canada Ltd. (AECL), is currently the proponents of a pre-licensing review of the Advanced Candu Reactor (ACR) with the United States Nuclear Regulatory Commission (NRC). A key focus topic for this pre-application review is the NRC acceptance of the computer codes used in the safety analysis of the ACR. These codes have been developed and their predictions compared against experimental results over extended periods of time in Canada. These codes have also undergone formal validation in the 1990's. In support of this formal validation effort AECL has developed, implemented and currently maintains a Software Quality Assurance program (SQA) to ensure that its analytical, scientific and design computer codes meet the required standards for software used in safety analyses. This paper discusses the SQA program used to develop, qualify and maintain the computer codes used in ACR safety analysis, including the current program underway to confirm the applicability of these computer codes for use in ACR safety analyses. (authors)

  8. Link prediction based on path entropy

    CERN Document Server

    Xu, Zhongqi; Yang, Jian

    2015-01-01

    Information theory has been taken as a prospective tool for quantifying the complexity of complex networks. In this paper, we first study the information entropy or uncertainty of a path using the information theory. Then we apply the path entropy to the link prediction problem in real-world networks. Specifically, we propose a new similarity index, namely Path Entropy (PE) index, which considers the information entropies of shortest paths between node pairs with penalization to long paths. Empirical experiments demonstrate that PE index outperforms the mainstream link predictors.

  9. Core analysis during transition from 37-element fuel to CANFLEX-NU fuel in CANDU 6

    Energy Technology Data Exchange (ETDEWEB)

    Jeong, Chang Joon; Suk, Ho Chun [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1998-12-31

    An 1200-day time-dependent fuel-management for the transition from 37-element fuel to CANFLEX-NU fuel in a CANDU 6 reactor has been simulated to show the compatibility of the CANFLEX-NU fuel with the reactor operation. The simulation calculations were carried out with the RFSP code, provided by cell averaged fuel properties obtained from the POWDERPUFS-V code. The refueling scheme for both fuels was an eight bundle shift at a time. The simulation results show that the maximum channel and bundle powers were maintained below the license limit of the CANDU 6. This indicates that the CANFLEX-NU fuel bundle is compatible with the CANDU 6 reactor operation during the transition period. 3 refs., 2 figs., 1 tab. (Author)

  10. Validation of physics and thermalhydraulic computer codes for advanced Candu reactor applications

    Energy Technology Data Exchange (ETDEWEB)

    Wren, D.J.; Popov, N.; Snell, V.G. [Atomic Energy of Canada Ltd, (Canada)

    2004-07-01

    Atomic Energy of Canada Ltd. (AECL) is developing an Advanced Candu Reactor (ACR) that is an evolutionary advancement of the currently operating Candu 6 reactors. The ACR is being designed to produce electrical power for a capital cost and at a unit-energy cost significantly less than that of the current reactor designs. The ACR retains the modular Candu concept of horizontal fuel channels surrounded by a heavy water moderator. However, ACR uses slightly enriched uranium fuel compared to the natural uranium used in Candu 6. This achieves the twin goals of improved economics (via large reductions in the heavy water moderator volume and replacement of the heavy water coolant with light water coolant) and improved safety. AECL has developed and implemented a software quality assurance program to ensure that its analytical, scientific and design computer codes meet the required standards for software used in safety analyses. Since the basic design of the ACR is equivalent to that of the Candu 6, most of the key phenomena associated with the safety analyses of ACR are common, and the Candu industry standard tool-set of safety analysis codes can be applied to the analysis of the ACR. A systematic assessment of computer code applicability addressing the unique features of the ACR design was performed covering the important aspects of the computer code structure, models, constitutive correlations, and validation database. Arising from this assessment, limited additional requirements for code modifications and extensions to the validation databases have been identified. This paper provides an outline of the AECL software quality assurance program process for the validation of computer codes used to perform physics and thermal-hydraulics safety analyses of the ACR. It describes the additional validation work that has been identified for these codes and the planned, and ongoing, experimental programs to extend the code validation as required to address specific ACR design

  11. CANDU advanced fuel R and D programs for 1997 - 2006 in Korea

    Energy Technology Data Exchange (ETDEWEB)

    Suk, H.C.; Yang, M.S.; Sim, K-S.; Yoo, K.J. [Korea Atomic Energy Research Inst., Yusong, Taejon (Korea, Republic of)

    1997-07-01

    KAERI has a comprehensive product development program of CANFLEX and DUPIC fuels to introduce them into CANDU reactors in Korea and a clear vision of how the product will evolve over the next 10 years. CANDU reactors are not the majority of nuclear power plants in Korea, but they produce significant electricity to contribute Korea's economic growth as well as to satisfy the need for energy. The key targets of the development program are safety enhancement, reduction of spent fuel volume, and economic improvements, using the inherent characteristics and advantages of CANDU technology The CANFLEX and DUPIC R and D programs are conducted currently under the second stage of Korea's Nuclear Energy R and D Project as a national mid- and long-term program over the next 10 years from 1997 to 2006. The specific activities of the programs have taken account of the domestic and international environment concerning on non-proliferation in the Peninsula of Korea. As the first of the development products in the short-term, the CANFLEX-NU fuel will be completely developed jointly by KAERI/AECL and will be useful for the older CANDU-6 Wolsong unit 1. As the second product, the CANFLEX-0.9 % equivalent SEU fuel is expected to be completely developed within the next decade. It will be used in CANDU-6 reactors in Korea immediately after the development, if the existing RU in the world is price competitive with natural uranium. The DUPIC R and D program, as a long term program, is expected to demonstrate the possibility of use of used PWR fuel in CANDU reactors in Korea during the next 10 years. The pilot scale fabrication facility would be completed around 2010. (author)

  12. 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 point will not depend on its starting position. We discuss three similar problems of increasing complexity that restrict the motion to inclined planes. Without using calculus we derive the respective optimal geometry and compare the theoretical values to measured travelling times. The observed discrepancies are quantitatively modelled by including angular motion and friction. We also investigate the correspondence between the original problem and our setups. The topic provides a conceptually simple yet non-trivial problem setting inviting for problem based learning and complex learning activities such as planing suitable experiments or modelling the relevant kinematics.

  13. Improved Analysis of Kannan's Shortest Lattice Vector Algorithm

    CERN Document Server

    Hanrot, Guillaume

    2007-01-01

    The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a closest lattice vector to a given target vector in high dimensions. The best algorithms for these tasks are due to Kannan, and, though remarkably simple, their complexity estimates have not been improved since more than twenty years. Kannan's algorithm for solving the shortest vector problem is in particular crucial in Schnorr's celebrated block reduction algorithm, on which are based the best known attacks against the lattice-based encryption schemes mentioned above. Understanding precisely Kannan's algorithm is of prime importance for providing meaningful key-sizes. In this paper we improve the complexity analyses of Kannan's algorithms and discuss the possibility of improving the underlying enumeration strategy.

  14. Collaborative Product Design for Tasks Sorting Based on Shortest Delivery

    Directory of Open Access Journals (Sweden)

    Xuedong Liang

    2016-01-01

    Full Text Available The “people’s innovation” can promote development in enterprises in urgent need of innovative product design. Collaborative product design can be a powerful tool for enterprises wishing to improve their market competitiveness and customer satisfaction. To reduce decision costs, improve efficiency, and solve other issues, promoting “people’s innovation” can play a vital role. With this focus, this paper examines products produced through “people’s innovation.” A collaborative design task scheduling problem is presented. The design tasks are sorted based on a minimum delivery cost principle, which is determined using weighted shortest processing time (WSPT rules and the shortest delivery time. The results show that distributed collaborative innovation can result in a reasonable arrangement for collaborative design tasks.

  15. Computer simulation of the behaviour and performance of a CANDU fuel rod

    Energy Technology Data Exchange (ETDEWEB)

    Marino, A.C. [Comison Nacional de Energia Atomica (Argentina)

    1997-07-01

    At the Argentine Atomic Energy Commission (Comision Nacional de Energia Atomica, CNEA) the BACO code (for 'BArra COmbustible', fuel rod) was developed. It allows the simulation of the thermo-mechanical performance of a cylindrical fuel rod in a Pressurized Heavy Water Reactor (PHWR). The standard present version of the code (2.30), is a powerful tool for a relatively easy and complete evaluation of fuel behaviour predictions. Input parameters and, therefore, output ones may include statistical dispersion. As a demonstration of BACO capabilities we include a review of CANDU fuel applications, and the calculation and a parametric analysis of a characteristic CANDU fuel. (author)

  16. Development of modern CANDU PHWR cross-section libraries for SCALE

    Energy Technology Data Exchange (ETDEWEB)

    Shoman, Nathan T., E-mail: nshoman@vols.utk.edu; Skutnik, Steven E., E-mail: sskutnik@utk.edu

    2016-06-15

    Highlights: • New ORIGEN libraries for CANDU 28 and 37-element fuel assemblies have been created. • These new reactor data libraries are based on modern ENDF/B-VII.0 cross-section data. • The updated CANDU data libraries show good agreement with radiochemical assay data. • Eu-154 overestimated when using ENDF-VII.0 due to a lower thermal capture cross-section. - Abstract: A new set of SCALE fuel lattice models have been developed for the 28-element and 37-element CANDU fuel assembly designs using modern cross-section data from ENDF-B/VII.0 in order to produce new reactor data libraries for SCALE/ORIGEN depletion analyses. These new libraries are intended to provide users with a convenient means of evaluating depletion of CANDU fuel assemblies using ORIGEN through pre-generated cross sections based on SCALE lattice physics calculations. The performance of the new CANDU ORIGEN libraries in depletion analysis benchmarks to radiochemical assay data were compared to the previous version of the CANDU libraries provided with SCALE (based on WIMS-AECL models). Benchmark comparisons with available radiochemical assay data indicate that the new cross-section libraries perform well at matching major actinide species (U/Pu), which are generally within 1–4% of experimental values. The library also showed similar or better results over the WIMS-AECL library regarding fission product species and minor actinoids (Np, Am, and Cm). However, a notable exception was in calculated inventories of {sup 154}Eu and {sup 155}Eu, where the new library employing modern nuclear data (ENDF/B-VII.0) performed substantially poorer than the previous WIMS-AECL library (which used ENDF-B/VI.8 cross-sections for these species). The cause for this discrepancy appears to be due to differences in the {sup 154}Eu thermal capture cross-section between ENDF/B-VI.8 and ENDF/B-VII.0, an effect which is exacerbated by the highly thermalized flux of a CANDU heavy water reactor compared to that of a

  17. Application of principal component analysis for the diagnosis of neutron overpower system oscillations in CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Nasimi, Elnara; Gabbar, Hossam A., E-mail: Hossam.gabbar@uoit.ca

    2014-04-01

    Highlights: • Diagnosis of neutron overpower protection (NOP) in CANDU reactors. • Accurate reactor detector modeling. • NOP detectors response analysis. • Statistical methods for quantitative analysis of NOP detector behavior. - Abstract: An accurate fault modeling and troubleshooting methodology is required to aid in making risk-informed decisions related to design and operational activities of current and future generation of CANDU{sup ®} designs. This paper attempts to develop an explanation for the unanticipated detector response and overall behavior phenomena using statistical methods to compliment traditional engineering analysis techniques. Principal component analysis (PCA) methodology is used for pattern recognition using a case study of Bruce B zone-control level oscillations.

  18. A probabilistic method for leak-before-break analysis of CANDU reactor pressure tubes

    Energy Technology Data Exchange (ETDEWEB)

    Puls, M.P.; Wilkins, B.J.S.; Rigby, G.L. [Whiteshell Labs., Pinawa (Canada)] [and others

    1997-04-01

    A probabilistic code for the prediction of the cumulative probability of pressure tube ruptures in CANDU type reactors is described. Ruptures are assumed to result from the axial growth by delayed hydride cracking. The BLOOM code models the major phenomena that affect crack length and critical crack length during the reactor sequence of events following the first indications of leakage. BLOOM can be used to develop unit-specific estimates of the actual probability of pressure rupture in operating CANDU reactors and supplement the existing leak before break analysis.

  19. Physics and Control Assessment of AN 850 Mw(e) - Leu-Candu Reactor.

    Science.gov (United States)

    Barbone, Michelangelo

    The physics and control assessment of an 850 MW(e) Low Enriched Uranium CANDU Pressurized Heavy Water (LEU -CANDU-PHW) reactor constitute the major objective of this thesis. The use of Low Enriched Uranium fuel in the present CANDU nuclear power generating stations is recognized as economically beneficial due to reduced fuelling costs. The LEU fuel cycle is also recognized as a stepping stone to transit from the present CANDU-PHW once-through natural Uranium cycle to advanced cycles such as those based on Plutonium recycle, once-through Th + U-235 cycle, Thorium with Uranium recycle and net U-235 feed, Thorium with Uranium recycle and Plutonium feed. However, although the use of Low Enriched Uranium in the present CANDU-PHW reactor has economic advantages, and it would act as a technical bridge between the present cycle and advanced cycles, technical problems in different areas of reactor physics and fuel management were anticipated. The present thesis research work adresses the areas of reactor physics, fuel management, and control (in particular, the spatial control of large CANDU-PHW reactors). The main conclusions that have been drawn following these studies are as follows: (1) The Low Enriched Uranium Cycle is feasible in a CANDU-PHW reactor of present design and provided that: (a) The enrichment is kept relatively low (that is, about 1% instead of 0.711%); (b) the number of bundles to be replaced at every refuelling operation is about one-half that of the natural Uranium fuel case; (c) The channels are refuelled in the same direction as the coolant. (2) The response of an LEU-CANDU-PHW reactor to reactivity perturbation such as single- and two-channel refuelling operation, shim transient, shutdown-start-up transient with enrichment levels of 0.9% and 1.2% is essentially very similar {provided that certain conditions in (1) are respected} to that of the natural uranium reactor core case without any reactor reoptimization. The general behaviour of the reactor

  20. A study for good regulation of the CANDU's in Korea

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Se Ki; Shin, Y. K.; Joe, S. K.; Kim, J. S.; Yu, Y. J.; Lee, Y. J. [Ajou Univ., Suwon (Korea, Republic of)

    2002-03-15

    The objective of project is to derive the policy recommendations to improve the efficiency of CANDU plants regulation. These policy recommendations will eventually contribute to the upgrading of Korean nuclear regulatory system and safety enhancement. During the second phase of this 2 years study, following research activities were done. Review the technical basis and framework of the new Canadian Regulation System and IAEA. Analysis on the interview of Wolsung operation staffs to identify important safety issues and regulation problems experienced at operation. Providing a plan of CANDU regulation system enhancement program.

  1. ENHANCING ADVANCED CANDU PROLIFERATION RESISTANCE FUEL WITH MINOR ACTINIDES

    Energy Technology Data Exchange (ETDEWEB)

    Gray S. Chang

    2010-05-01

    The advanced nuclear system will significantly advance the science and technology of nuclear energy systems and to enhance the spent fuel proliferation resistance. Minor actinides (MA) are viewed more as a resource to be recycled, and transmuted to less hazardous and possibly more useful forms, rather than simply disposed of as a waste stream in an expensive repository facility. MAs can play a much larger part in the design of advanced systems and fuel cycles, not only as additional sources of useful energy, but also as direct contributors to the reactivity control of the systems into which they are incorporated. In this work, an Advanced CANDU Reactor (ACR) fuel unit lattice cell model with 43 UO2 fuel rods will be used to investigate the effectiveness of a Minor Actinide Reduction Approach (MARA) for enhancing proliferation resistance and improving the fuel cycle performance. The main MARA objective is to increase the 238Pu / Pu isotope ratio by using the transuranic nuclides (237Np and 241Am) in the high burnup fuel and thereby increase the proliferation resistance even for a very low fuel burnup. As a result, MARA is a very effective approach to enhance the proliferation resistance for the on power refueling ACR system nuclear fuel. The MA transmutation characteristics at different MA loadings were compared and their impact on neutronics criticality assessed. The concept of MARA, significantly increases the 238Pu/Pu ratio for proliferation resistance, as well as serves as a burnable absorber to hold-down the initial excess reactivity. It is believed that MARA can play an important role in atoms for peace and the intermediate term of nuclear energy reconnaissance.

  2. Safety design of next generation SUI of CANDU stations

    Energy Technology Data Exchange (ETDEWEB)

    Nasimi, Elnara [Faculty of Energy Systems and Nuclear Science, University of Ontario Institute of Technology, 2000 Simcoe St. N., Oshawa, L1H 7K4 ON (Canada); Gabbar, Hossam A., E-mail: hossam.gabbar@uoit.ca [Faculty of Energy Systems and Nuclear Science, University of Ontario Institute of Technology, 2000 Simcoe St. N., Oshawa, L1H 7K4 ON (Canada)

    2013-01-15

    Highlights: Black-Right-Pointing-Pointer Review of current SUI technologies and challenges. Black-Right-Pointing-Pointer Propose a new type of SUI detectors. Black-Right-Pointing-Pointer Propose a new SUI system architecture and layout. Black-Right-Pointing-Pointer Propose implementation procedure for SUI with reduced risks. - Abstract: Due to the age and operating experience of Nuclear Power Plants, equipment ageing and obsolescence has become one of the main challenges that need to be resolved for all systems, structures and components in order to ensure a safe and reliable production of energy. This paper summarizes the research into a methodology for modernization of Start-Up Instrumentation (SUI), both in-core and Control Room equipment, using a new generation of detectors and cables in order to manage obsolescence. The main objective of this research is to develop a new systematic approach to SUI installation/replacement procedure development and optimization. Although some additional features, such as real-time data monitoring and storage/archiving solutions for SUI systems are also examined to take full advantage of today's digital technology, the objectives of this study do not include detailed parametrical studies of detector or system performance. Instead, a number of technological, operational and maintenance issues associated with Start-Up Instrumentation systems at Nuclear Power Plants (NPPs) will be identified and a structured approach for developing a replacement/installation procedure that can be standardized and used across all of the domestic CANDU (Canadian Deuterium Uranium) stations is proposed.

  3. Neutronics-thermalhydraulics coupling in a CANDU SCWR

    Science.gov (United States)

    Adouki, Pierre

    In order to implement new nuclear technologies as a solution to the growing demand for energy, 10 countries agreed on a framework for international cooperation in 2002, to form the Generation IV International Forum (GIF). The goal of the GIF is to design the next generation of nuclear reactors that would be cost effective and would enhance safety. This forum has proposed several types of Generation IV reactors including the Supercritical Water-Cooled Reactor (SCWR). The SCWR comes in two main configurations: pressure vessel SCWR and pressure tube SCWR (PT-SCWR). In this study, the CANDU SCWR (a PT-SCWR) is considered. This reactor is oriented vertically and contains 336 channels with a length of 5 m. The target coolant inlet and outlet temperatures are 350 Celsius and 625 Celsius, respectively. The coolant flows downwards, and the reactor power is 2540 MWth. Various fuel designs have been considered in order not to exceed the linear element rating. However, the dependency between the core power and thermalhydraulics parameters results in the necessity to use a neutronics/thermalhydaulics coupling scheme to determine the core power and the thermalhydraulics parameters. The core power obtained has a power peaking factor of 1.4. The bundle power distribution for all channels has a peak at the third bundle from the inlet, but the value of this peak increases with the channel power. The heat-transfer coefficient and the specific-heat capacity have a peak at the same location in a channel, and this location shifts toward the inlet as the channel power increases. The exit coolant temperature increases with the channel power, while the exit coolant density and pressure decrease with the channel power. Also, higher channel powers lead to higher fuel and cladding temperatures. Moreover, as the coupling method is applied, the effective multiplication factor and the values of thermalhydaulics parameters oscillate as they converge.

  4. Signal processing system design for improved shutdown system of CANDU{sup ®} nuclear reactors in large break LOCA events

    Energy Technology Data Exchange (ETDEWEB)

    Gabbar, Hossam A., E-mail: hossam.gabbar@uoit.ca [Faculty of Energy Systems and Nuclear Science, University of Ontario Institute of Technology, 2000 Simcoe Street North, Oshawa, ON, Canada L1H 7K4 (Canada); Faculty of Engineering and Applied Science, University of Ontario Institute of Technology, 2000 Simcoe Street North, Oshawa, ON, Canada L1H 7K4 (Canada); Xia, Lingzhi; Isham, Manir U. [Faculty of Energy Systems and Nuclear Science, University of Ontario Institute of Technology, 2000 Simcoe Street North, Oshawa, ON, Canada L1H 7K4 (Canada); Ponomarev, Vladimir [Megawatt Solutions, 1235 Radom St., unit 68, Pickering, ON, Canada L1W 1J3 (Canada)

    2016-03-15

    Highlights: • Neutronic signal processing system design to improve CANDU SDS1 performance. • Reactor modeling for CANDU LLOCA transient. • MATLAB/Simulink system implementation for the SDS1 trip logic. • Increasing the SDS1 trip response. - Abstract: For CANDU reactors, several options to improve CANDU nuclear power plant operation safety margin have been investigated in this paper. A particular attention is paid to the response time of CANDU shutdown system number 1 (SDS1) in case of large break loss of coolant accident (LLOCA). Based on point kinetic method, a systematic fundamental analysis is performed to CANDU LLOCA event, and the power transient signal is generated. In order to improve the SDS1 response time during LLOCA events, an innovative power measurement and signal processing system is particularly designed. The new signal processing system is implemented with the input of the LLOCA power transient, and the simulation results of the reactor trip time and signal are compared to those of the existing system in CANDU power plants. It is demonstrated that the new signal processing system can not only achieve a shorter reactor trip time than the existing system, but also accommodate the spurious trip immunity. This will significantly enhance the safety margin for the power plant operation, or bring extra economical benefits to the power plant units.

  5. Evaluation of CANDU6 PCR (power coefficient of reactivity) with a 3-D whole-core Monte Carlo Analysis

    Energy Technology Data Exchange (ETDEWEB)

    Motalab, Mohammad Abdul; Kim, Woosong; Kim, Yonghee, E-mail: yongheekim@kaist.ac.kr

    2015-12-15

    Highlights: • The PCR of the CANDU6 reactor is slightly negative at low power, e.g. <80% P. • Doppler broadening of scattering resonances improves noticeably the FTC and make the PCR more negative or less positive in CANDU6. • The elevated inlet coolant condition can worsen significantly the PCR of CANDU6. • Improved design tools are needed for the safety evaluation of CANDU6 reactor. - Abstract: The power coefficient of reactivity (PCR) is a very important parameter for inherent safety and stability of nuclear reactors. The combined effect of a relatively less negative fuel temperature coefficient and a positive coolant temperature coefficient make the CANDU6 (CANada Deuterium Uranium) PCR very close to zero. In the original CANDU6 design, the PCR was calculated to be clearly negative. However, the latest physics design tools predict that the PCR is slightly positive for a wide operational range of reactor power. It is upon this contradictory observation that the CANDU6 PCR is re-evaluated in this work. In our previous study, the CANDU6 PCR was evaluated through a standard lattice analysis at mid-burnup and was found to be negative at low power. In this paper, the study was extended to a detailed 3-D CANDU6 whole-core model using the Monte Carlo code Serpent2. The Doppler broadening rejection correction (DBRC) method was implemented in the Serpent2 code in order to take into account thermal motion of the heavy uranium nucleus in the neutron-U scattering reactions. Time-average equilibrium core was considered for the evaluation of the representative PCR of CANDU6. Two thermal hydraulic models were considered in this work: one at design condition and the other at operating condition. Bundle-wise distributions of the coolant properties are modeled and the bundle-wise fuel temperature is also considered in this study. The evaluated nuclear data library ENDF/B-VII.0 was used throughout this Serpent2 evaluation. In these Monte Carlo calculations, a large number

  6. ENHANCED COMPOSITE APPROACH WITH MOBILE BEACON SHORTEST PATH TO SOLVE LOCALIZATION PROBLEM IN WIRELESS SENSOR NETWORK

    Directory of Open Access Journals (Sweden)

    Sunil Kumar,

    2010-12-01

    Full Text Available Wireless sensor network is tremendously being used in different environments to perform various monitoring task such as search, rescue, disaster relief, target tracking and a number of tasks in smart environment. In this paper a unique localization algorithm is proposed that gives the high accuracy in wireless sensor network. We propose amobile beacon algorithm and then merge it with DV- hop algorithm to introduce a unique approach which solves the localization problem in wireless sensor network.

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

  8. Comment on "Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality"

    CERN Document Server

    Zhou, T; Wang, B H; Liu, Jian-Guo; Wang, Bing-Hong; Zhou, Tao

    2006-01-01

    In this comment, we investigate a common used algorithm proposed by Newman [M. E. J. Newman, Phys. Rev. E {\\bf 64}, 016132(2001)] to calculate the betweenness centrality for all vertices. The error of Newman's algorithm is pointed out and a corrected algorithm, also with O($MN$) time complexity, is given. In addition, the comparison of calculating results for these two algorithm aiming the protein interaction network of Yeast is shown.

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

    DEFF Research Database (Denmark)

    Wulff-Nilsen, Christian

    2008-01-01

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

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

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

    Science.gov (United States)

    2012-09-13

    Matrix produced by Wimer’s Algorithm # of Arcs j 1 2 3 . . . q 2 P1(2) P2(2) P3 (2) . . . Pq(2) 3 P1(3) P2(3) P3 (3) Pq(3) Node # u 4 P1(4) P2(4) P3 (4...Pq(4) ... ... . . . ... N P1(N) P2(N) P3 (N) . . . Pq(N) Assign another matrix Z, call each of its elements Zj(u), where each element is 25 Table 5...chooses ”contract” car- riers for long-term partnerships ; thus the need to model schedules is negated. Look at [10] for one detailed model of

  12. Parallel approaches to shortest-path problems for multilevel heterogeneous computing

    OpenAIRE

    Ortega Arranz, Héctor

    2015-01-01

    Existen diferentes algoritmos que solucionan problemas de computación del camino-más-corto. Estos problemas son clave dentro de la optimización combinatoria por sus múltiples aplicaciones en la vida real. Últimamente, el interés de la comunidad científica por ellos crece significativamente, no sólo por la amplia aplicabilidad de sus soluciones, sino también por el uso eficiente de la computación paralela. La aparición de nuevos modelos de programación junto con las modernas GPUs, ha enriqueci...

  13. Development of the advanced PHWR technology -Design and analysis of CANDU advanced fuel-

    Energy Technology Data Exchange (ETDEWEB)

    Suk, Hoh Chun; Shim, Kee Sub; Byun, Taek Sang; Park, Kwang Suk; Kang, Heui Yung; Kim, Bong Kee; Jung, Chang Joon; Lee, Yung Wook; Bae, Chang Joon; Kwon, Oh Sun; Oh, Duk Joo; Im, Hong Sik; Ohn, Myung Ryong; Lee, Kang Moon; Park, Joo Hwan; Lee, Eui Joon [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1995-07-01

    This is the `94 annual report of the CANDU advanced fuel design and analysis project, and describes CANFLEX fuel design and mechanical integrity analysis, reactor physics analysis and safety analysis of the CANDU-6 with the CANFLEX-NU. The following is the R and D scope of this fiscal year : (1) Detail design of CANFLEX-NU and detail analysis on the fuel integrity, reactor physics and safety. (a) Detail design and mechanical integrity analysis of the bundle (b) CANDU-6 refueling simulation, and analysis on the Xe transients and adjuster system capability (c) Licensing strategy establishment and safety analysis for the CANFLEX-NU demonstration demonstration irradiation in a commercial CANDU-6. (2) Production and revision of CANFLEX-NU fuel design documents (a) Production and approval of CANFLEX-NU reference drawing, and revisions of fuel design manual and technical specifications (b) Production of draft physics design manual. (3) Basic research on CANFLEX-SEU fuel. 55 figs, 21 tabs, 45 refs. (Author).

  14. EVALUATION OF THE APPLICABLE REACTIVITY RANGE OF A REACTIVITY COMPUTER FOR A CANDU-6 REACTOR

    Directory of Open Access Journals (Sweden)

    EUN KI LEE

    2014-04-01

    Full Text Available Recently, a CANDU digital reactivity computer system (CDRCS to measure the worth of the liquid zone controller in a CANDU-6 was developed and successfully applied to a physics test of refurbished Wolsong Unit 1. In advance of using the CDRCS, its measureable reactivity range should be investigated and confirmed. There are two reasons for this investigation. First, the CANDU-6 has a larger reactor and smaller excore detectors than a general PWR and consequently the measured reactivity is likely to reflect the peripheral power variation only, not the whole core. The second reason is photo neutrons generated from the interaction of the moderator and gamma-rays, which are never considered in a PWR. To evaluate the limitations of the CDRCS, several tens of three-dimensional steady and transient simulations were performed. The simulated detector signals were used to obtain the dynamic reactivity. The difference between the dynamic reactivity and the static worth increases in line with the water level changes. The maximum allowable reactivity was determined to be 1.4 mk in the case of CANDU-6 by confining the difference to less than 1%.

  15. FMDP Reactor Alternative Summary Report: Volume 2 - CANDU heavy water reactor alternative

    Energy Technology Data Exchange (ETDEWEB)

    Greene, S.R.; Spellman, D.J.; Bevard, B.B. [and others

    1996-09-01

    The Department of Energy Office of Fissile Materials Disposition (DOE/MD) initiated a detailed analysis activity to evaluate each of ten plutonium disposition alternatives that survived an initial screening process. This document, Volume 2 of a four volume report, summarizes the results of these analyses for the CANDU reactor based plutonium disposition alternative.

  16. ASSERT-PV 3.2: Advanced subchannel thermalhydraulics code for CANDU fuel bundles

    Energy Technology Data Exchange (ETDEWEB)

    Rao, Y.F., E-mail: raoy@aecl.ca; Cheng, Z., E-mail: chengz@aecl.ca; Waddington, G.M., E-mail: waddingg@aecl.ca; Nava-Dominguez, A., E-mail: navadoma@aecl.ca

    2014-08-15

    Highlights: • Introduction to a new version of the Canadian subchannel code, ASSERT-PV 3.2. • Enhanced models for flow-distribution, CHF and post-dryout heat transfer prediction. • Model changes focused on unique features of horizontal CANDU bundles. • Detailed description of model changes for all major thermalhydraulics models. • Discussion on rationale and limitation of the model changes. - Abstract: Atomic Energy of Canada Limited (AECL) has developed the subchannel thermalhydraulics code ASSERT-PV for the Canadian nuclear industry. The most recent release version, ASSERT-PV 3.2 has enhanced phenomenon models for improved predictions of flow distribution, dryout power and CHF location, and post-dryout (PDO) sheath temperature in horizontal CANDU fuel bundles. The focus of the improvements is mainly on modeling considerations for the unique features of CANDU bundles such as horizontal flows, small pitch to diameter ratios, high mass fluxes, and mixed and irregular subchannel geometries, compared to PWR/BWR fuel assemblies. This paper provides a general introduction to ASSERT-PV 3.2, and describes the model changes or additions in the new version to improve predictions of flow distribution, dryout power and CHF location, and PDO sheath temperatures in CANDU fuel bundles.

  17. Automated refueling simulations of a CANDU for the exploitation of thorium fuels

    Science.gov (United States)

    Holmes, Bradford

    CANDU nuclear reactors are in a unique circumstance where they are able to utilize and exploit a number of different fuel options to provide power as a utility. Thorium, a fertile isotope found naturally, is one option that should be explored. Thorium is more abundant than uranium, which is the typical fuel in the reactor and the availability of thorium makes nuclear energy desirable to more countries. This document contains the culmination of a project that explores, tests, and analyzes the feasibility of using thorium in a CANDU reactor. The project first develops a set of twodimensional lattice and three dimensional control rod simulations using the DRAGON Version 4 nuclear physics codes. This step is repeated for many concentrations of thorium. The data generated in these steps is then used to determine a functional enrichment of thorium. This is done via a procedural elimination and optimization of certain key parameters including but not limited to average exit burnup and reactivity evolution. For the purposes of this project, an enrichment of 1 % thorium was found viable. Full core calculations were done using the DONJON 4 code. CANFUEL, a program which simulates the refueling operations of a CANDU reactor for this fuel type was developed and ran for a simulation period of one hundred days. The program and the fuel selection met all selected requirements for the entirety of the simulation period. CANFUEL requires optimization for fuel selection before it can be used extensively. The fuel selection was further scrutinized when a reactivity insertion event was simulated. The adjuster rod 11 withdrawal from the core was analyzed and compared to classical CANDU results in order to ensure no significant deviations or unwanted evolutions were encountered. For this case, the simulation results were deemed acceptable with no significant deviations from the classical CANDU case.

  18. Assessment of ASSERT-PV for prediction of critical heat flux in CANDU bundles

    Energy Technology Data Exchange (ETDEWEB)

    Rao, Y.F., E-mail: raoy@aecl.ca; Cheng, Z., E-mail: chengz@aecl.ca; Waddington, G.M., E-mail: waddingg@aecl.ca

    2014-09-15

    Highlights: • Assessment of the new Canadian subchannel code ASSERT-PV 3.2 for CHF prediction. • CANDU 28-, 37- and 43-element bundle CHF experiments. • Prediction improvement of ASSERT-PV 3.2 over previous code versions. • Sensitivity study of the effect of CHF model options. - Abstract: Atomic Energy of Canada Limited (AECL) has developed the subchannel thermalhydraulics code ASSERT-PV for the Canadian nuclear industry. The recently released ASSERT-PV 3.2 provides enhanced models for improved predictions of flow distribution, critical heat flux (CHF), and post-dryout (PDO) heat transfer in horizontal CANDU fuel channels. This paper presents results of an assessment of the new code version against five full-scale CANDU bundle experiments conducted in 1990s and in 2009 by Stern Laboratories (SL), using 28-, 37- and 43-element (CANFLEX) bundles. A total of 15 CHF test series with varying pressure-tube creep and/or bearing-pad height were analyzed. The SL experiments encompassed the bundle geometries and range of flow conditions for the intended ASSERT-PV applications for CANDU reactors. Code predictions of channel dryout power and axial and radial CHF locations were compared against measurements from the SL CHF tests to quantify the code prediction accuracy. The prediction statistics using the recommended model set of ASSERT-PV 3.2 were compared to those from previous code versions. Furthermore, the sensitivity studies evaluated the contribution of each CHF model change or enhancement to the improvement in CHF prediction. Overall, the assessment demonstrated significant improvement in prediction of channel dryout power and axial and radial CHF locations in horizontal fuel channels containing CANDU bundles.

  19. Assessment of ASSERT-PV for prediction of post-dryout heat transfer in CANDU bundles

    Energy Technology Data Exchange (ETDEWEB)

    Cheng, Z., E-mail: chengz@aecl.ca; Rao, Y.F., E-mail: raoy@aecl.ca; Waddington, G.M., E-mail: waddingg@aecl.ca

    2014-10-15

    Highlights: • Assessment of the new Canadian subchannel code ASSERT-PV 3.2 for PDO sheath temperature prediction. • CANDU 28-, 37- and 43-element bundle PDO experiments. • Prediction improvement of ASSERT-PV 3.2 over previous code versions. • Sensitivity study of the effect of PDO model options. - Abstract: Atomic Energy of Canada Limited (AECL) has developed the subchannel thermalhydraulics code ASSERT-PV for the Canadian nuclear industry. The recently released ASSERT-PV 3.2 provides enhanced models for improved predictions of subchannel flow distribution, critical heat flux (CHF), and post-dryout (PDO) heat transfer in horizontal CANDU fuel channels. This paper presents results of an assessment of the new code version against PDO tests performed during five full-size CANDU bundle experiments conducted between 1992 and 2009 by Stern Laboratories (SL), using 28-, 37- and 43-element bundles. A total of 10 PDO test series with varying pressure-tube creep and/or bearing-pad height were analyzed. The SL experiments encompassed the bundle geometries and range of flow conditions for the intended ASSERT-PV applications for existing CANDU reactors. Code predictions of maximum PDO fuel-sheath temperature were compared against measurements from the SL PDO tests to quantify the code's prediction accuracy. The prediction statistics using the recommended model set of ASSERT-PV 3.2 were compared to those from previous code versions. Furthermore, separate-effects sensitivity studies quantified the contribution of each PDO model change or enhancement to the improvement in PDO heat transfer prediction. Overall, the assessment demonstrated significant improvement in prediction of PDO sheath temperature in horizontal fuel channels containing CANDU bundles.

  20. A Formula of Average Path Length for Unweighted Networks

    Institute of Scientific and Technical Information of China (English)

    LIU Chun-Ping; LIU Yu-Rong; HE Da-Ren; ZHU Lu-Jin

    2008-01-01

    In this paper, based on the adjacency matrix of the network and its powers, the formulas are derived for the shortest path and the average path length, and an effective algorithm is presented. Furthermore, an example is provided to demonstrate the proposed method.

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

  2. SAFIRE - a robotic inspection system for CANDU feeders

    Energy Technology Data Exchange (ETDEWEB)

    Buckingham, R. [OC Robotics, Bristol (United Kingdom)

    2011-07-01

    The condition of primary circuit feeder pipes in CANDU reactors is relevant to the commercial viability and plant life. One known wear mechanism is external fretting between feeder pipes and adjacent services or support structures, particularly within the Upper Feeder Cabinet (UFC). Fretting leads to wall thinning which must not exceed certain agreed limits. Chafe shields have been added to protect the feeder pipes. Regular inspections are required of the chafe shields, feeder pipes and other structures that may cause feeder damage. Historically, the dose received by inspectors conducting this work has been significant. For this reason Ontario Power Generation has invested in a remotely operated robot system to conduct visual inspections within the UFC. This system, called SAFIRE for 'Snake-Arm Feeder Inspection Robot Equipment' has been deployed at Pickering during 2010 and 2011 and has been used to inspect areas that are extremely difficult to inspect with existing manual techniques. The 2011 scope of work included inspection of a total of 660 feeder pipes in three UFC quadrants, in two reactors. The full scope was completed over a one-month period in Autumn 2011 in which SAFIRE was used during 23, twelve hour shifts. This included two periods each of 72 hours of continuous operation using multiple teams of operators. SAFIRE is remote controlled delivery system for multiple cameras to record still images and video. The main system elements include a snake-arm robot mounted on a mobile vehicle. It can be controlled from up to 500m away using a fibre/copper connection. The snake-arm is 2.2m long, 25mm wide and has 18 degrees of freedom. It is designed to snake between the rows of feeder pipes to inspect feeder/hanger interfaces, both above and below the feeder cabinet catwalks. Future upgrades offer the potential to add additional tools to increase functionality. This paper describes the SAFIRE development process from inception to operational experience

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

  4. Study on the use of slightly enriched uranium fuel cycle in an existing CANDU 6 reactor

    Energy Technology Data Exchange (ETDEWEB)

    Yeom, Choong Sub; Kim, Hyun Dae [Institute for Advanced Engineering, Seoul (Korea, Republic of)

    1997-12-31

    To test the viability of CANFLEX-SEU bundles in an existing CANDU 6 reactor, core follow-up simulation has been carried out using the reactor fueling simulation program of the CANDU 6, RFSP computer code, and a lattice physics code, WIMS-AECL. During the core follow-up, bundle and channel powers and zone levels have been checked against their operating limits at each simulation. It is observed from the simulation results that an equilibrium core loaded with 0.9 w/o CANFLEX-SEU bundles could be refueled and maintained for 550 FPD without any significant violations in the channel and bundle power limits and the permissible operating range of the liquid zone controllers. 8 refs., 2 figs., 1 tab. (Author)

  5. CFX Analysis of the CANDU Moderator Thermal-Hydraulics in the Stern Lab. Test Facility

    Science.gov (United States)

    Kim, Hyoung Tae

    2014-06-01

    A numerical calculation with the commercial CFD code CFX is conducted for a test facility simulating the CANDU moderator thermal-hydraulics. Two kinds of moderator thermal-hydraulic tests at Stern Laboratories Inc. were performed in the full geometric configuration of the CANDU moderator circulating vessel, which is called a Calandria, housing a matrix of horizontal rod bundles simulating the Calandria tubes. The first of these tests is the pressure drop measurement of a cross flow in the horizontal rod bundles. The other is the local temperature measurement on the cross section of the horizontal cylinder vessel simulating the Calandria. In the present study the full geometric details of the Calandria are incorporated in the grid generation of the computational domain to which the boundary conditions for each experiment are applied. The numerical solutions are reviewed and compared with the available test data.

  6. Development of best estimate auditing code for CANDU thermal hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chung, B. D.; Lee, W. J.; Lim, H. S. [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1998-04-15

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model of existing PWR auditing tool, i.e. RELAP5/MOD3. This scope of project is first step of the whole project, thus focus to the establishment of improvement area. The study was performed by reconsideration of the previous code assessment works and investigation of AECL design analysis tools. In order to identify the thermal hydraulic phenomena for events, the whole system of CANDU plant was divided into main functional systems and subcomponents. Each phenomena was addressed to the each subcomponent. FinaIly improvement areas of model development for auditing tool were established based on the identified phenomena.

  7. Development of best estimate auditing code for CANDU thermal hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chung, B. D.; Lee, W. J.; Lim, H. S. [Korea Atomic Energy Research Institute, Taejeon (Korea)

    1998-04-01

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model of existing PWR auditing tool, i.e. RELAP5/MOD3. This scope of project is first step of the whole project, thus focus to the establishment of improvement area. The study was performed by reconsideration of the previous code assessment works and investigation of AECL design analysis tools. In order to identify the thermal hydraulic phenomena for events, the whole system of CANDU plant was divided into main functional systems and subcomponents. Each phenomena was addressed to the each subcomponent. Finally improvement areas of model development for auditing tool were established based on the identified phenomena. 8 refs., 21 figs., 19 tabs. (Author)

  8. CANDU fuel attribution through the analysis of delayed neutron temporal behaviour

    Energy Technology Data Exchange (ETDEWEB)

    Sellers, M.T.; Corcoran, E.C.; Kelly, D.G., E-mail: David.Kelly@rmc.ca [Royal Military College of Canada, Kingston, Ontario (Canada)

    2012-07-01

    Delayed Neutron Counting (DNC) is an established technique in the Canadian nuclear industry as it is used for the detection of defective fuel in several CANDU reactors and the assay of uranium in geological samples. This paper describes the possible expansion of DNC to the discipline of nuclear forensics analysis. The temporal behaviour of experimentally measured delayed neutron spectra were used to determine the relative contributions of {sup 233}U and {sup 235}U to the overall fissile content present in mixtures with average absolute errors of ±4 %. The characterization of fissile content in current and proposed CANDU fuels (natural UO{sub 2}, thoria and mixed oxide (MOX) based) by DNC analysis is evaluated through Monte Carlo simulations. (author)

  9. A study on the interlink of CANDU safety analysis codes with development of GUI system

    Energy Technology Data Exchange (ETDEWEB)

    Lee, J. J.; Jeo, Y. J.; Park, Q. C. [Seoul National Univ., Seoul (Korea, Republic of); Kim, H. T.; Min, B. J. [KAERI, Taejon (Korea, Republic of)

    2003-10-01

    In order to improve the CANDU safety analysis code system, the interlink of containment analysis code, PRESCON2 to the system thermal hydraulics analysis code, CATHENA, has been implemented with development of the GUI system. Before the GUI development, we partly corrected two codes to optimize on the PC environment. The interlink of two codes could be executed by introducing three interlinking variables, mass flux, mixture enthalpy, and mixture specific volume. To guarantee the robustness of the codes, two codes are extremely linked by using the GUI system. The GUI system provides much of user-friendly functions and will be improved step by step. This study is expected to improve the safety assessment system and technology for CANDU NPPs.

  10. Evaluation of hydride blisters in zirconium pressure tube in CANDU reactor

    Energy Technology Data Exchange (ETDEWEB)

    Cheong, Y. M.; Kim, Y. S.; Gong, U. S.; Kwon, S. C.; Kim, S. S.; Choo, K.N

    2000-09-01

    When the garter springs for maintaining the gap between the pressure tube and the calandria tube are displaced in the CANDU reactor, the sagging of pressure tube results in a contact to the calandria tube. This causes a temperature difference between the inner and outer surface of the pressure tube. The hydride can be formed at the cold spot of outer surface and the volume expansion by hydride dormation causes the blistering in the zirconium alloys. An incident of pressure tube rupture due to the hydride blisters had happened in the Canadian CANDU reactor. This report describes the theoretical development and models on the formation and growth of hydride blister and some experimental results. The evaluation methodology and non-destructive testing for hydride blister in operating reactors are also described.

  11. Path-tracking Algorithm for Aircraft Fuel Tank Inspection Robots

    OpenAIRE

    Niu Guochen; Wang Li; Gao Qingji; Hu Dandan

    2014-01-01

    A 3D path-tracking algorithm based on end- point approximation is proposed to implement the path traversal of robots designed to inspect aircraft fuel tanks. Kinematic models of single-joint segments and multiple- joint segments were created. First, each joint segment of the path was divided into many equal sections and the rotation angle was computed. The rotation angle was found for the plane determined by one divided point and the secondary terminal joint segment. Second, the shortest dist...

  12. A controllability study of TRUMOX fuel for load following operations in a CANDU-900 reactor

    Energy Technology Data Exchange (ETDEWEB)

    Trudell, D.A., E-mail: trudelda@mcmaster.ca [McMaster Univ., Hamilton, Ontario (Canada)

    2012-07-01

    Using a core model of a generic CANDU-900 reactor in RFSP-IST, load following simulations have been performed to assess the controllability of the reactor due to Xenon transients. Week long load following simulations have been performed with daily power cycles 12 hours in duration. Simulations have shown that Natural Uranium fuel can be safely cycled between 100 and 90% Full Power without adjuster rod movement while TRUMOX fuel can be safely cycled between 100 and 85% Full Power. (author)

  13. Extending the world's uranium resources through advanced CANDU fuel cycles

    Energy Technology Data Exchange (ETDEWEB)

    De Vuono, Tony; Yee, Frank; Aleyaseen, Val; Kuran, Sermet; Cottrell, Catherine

    2010-09-15

    The growing demand for nuclear power will encourage many countries to undertake initiatives to ensure a self-reliant fuel source supply. Uranium is currently the only fuel utilized in nuclear reactors. There are increasing concerns that primary uranium sources will not be enough to meet future needs. AECL has developed a fuel cycle vision that incorporates other sources of advanced fuels to be adaptable to its CANDU technology.

  14. Implementation of an on-line monitoring system for transmitters in a CANDU nuclear power plant

    Science.gov (United States)

    Labbe, A.; Abdul-Nour, G.; Vaillancourt, R.; Komljenovic, D.

    2012-05-01

    Many transmitters (pressure, level and flow) are used in a nuclear power plant. It is necessary to calibrate them periodically to ensure that their measurements are accurate. These calibration tasks are time consuming and often contribute to worker radiation exposure. Human errors can also sometimes degrade their performance since the calibration involves intrusive techniques. More importantly, experience has shown that the majority of current calibration efforts are not necessary. These facts motivated the nuclear industry to develop new technologies for identifying drifting instruments. These technologies, well known as on-line monitoring (OLM) techniques, are non-intrusive and allow focusing the maintenance efforts on the instruments that really need a calibration. Although few OLM systems have been implemented in some PWR and BWR plants, these technologies are not commonly used and have not been permanently implemented in a CANDU plant. This paper presents the results of a research project that has been performed in a CANDU plant in order to validate the implementation of an OLM system. An application project, based on the ICMP algorithm developed by EPRI, has been carried out in order to evaluate the performance of an OLM system. The results demonstrated that the OLM system was able to detect the drift of an instrument in the majority of the studied cases. A feasibility study has also been completed and has demonstrated that the implementation of an OLM system at a CANDU nuclear power plant could be advantageous under certain conditions.

  15. Backup and Ultimate Heat Sinks in CANDU Reactors For Prolonged SBO Accidents

    Energy Technology Data Exchange (ETDEWEB)

    Nitheanandan, T.; Brown, M. J. [Atomic Energy of Canada Limited, Ontario (Canada)

    2013-10-15

    In a pressurized heavy water reactor, following loss of the primary coolant, severe core damage would begin with the depletion of the liquid moderator, exposing the top row of internally-voided fuel channels to steam cooling conditions on the inside and outside. The uncovered fuel channels would heat up, deform and disassemble into core debris. Large inventories of water passively reduce the rate of progression of the accident, prolonging the time for complete loss of engineered heat sinks. The efficacy of available backup and ultimate heat sinks, available in a CANDU 6 reactor, in mitigating the consequences of a prolonged station blackout scenario was analysed using the MAAP4-CANDU code. The analysis indicated that the steam generator secondary side water inventory is the most effective heat sink during the accident. Additional heat sinks such as the primary coolant, moderator, calandria vault water and end shield water are also able to remove decay heat; however, a gradually increasing mismatch between heat generation and heat removal occurs over the course of the postulated event. This mismatch is equivalent to an additional water inventory estimated to be 350,000 kg at the time of calandria vessel failure. In the Enhanced CANDU 6 reactor ∼2,040,000 kg of water in the reserve water tank is available for prolonged emergencies requiring heat sinks.

  16. Failure probability estimation of flaw in CANDU pressure tube considering the dimensional change

    Energy Technology Data Exchange (ETDEWEB)

    Kwak, Sang Log; Kim, Young Jin [Sungkyunkwan Univ., Suwon (Korea, Republic of); Lee, Joon Seong [Kyonggi Univ., Suwon (Korea, Republic of); Park, Youn Won [KINS, Taejon (Korea, Republic of)

    2002-11-01

    The pressure tube is a major component of the CANDU reactor, which supports nuclear fuel bundle and heavy water coolant. Pressure tubes are installed horizontally inside the reactor and only selected samples are periodically examined during in-service inspection. In this respect, a probabilistic safety assessment method is more appropriate for the assessment of overall pressure tube safety. The failure behavior of CANDU pressure tubes, however, is governed by delayed hydride cracking which is the major difference from pipings and reactor pressure vessels. Since the delayed hydride cracking has more widely distributed governing parameters, it is impossible to apply a general PFM methodology directly. In this paper, a PFM methodology for the safety assessment of CANDU pressure tubes is introduced by applying Monte Carlo simulation in determining failure probability. Initial hydrogen concentration, flaw shape and depth, axial and radial crack growth rate and fracture toughness were considered as probabilistic variables. Parametric study has been done under the base of pressure tube dimension and hydride precipitation temperature in calculating failure probability. Unstable fracture and plastic collapse are used for the failure assessment. The estimated failure probability showed about three-order difference with changing dimensions of pressure tube.

  17. Optimization and implementation study of plutonium disposition using existing CANDU Reactors. Final report

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1996-09-01

    Since early 1994, the Department of Energy has been sponsoring studies aimed at evaluating the merits of disposing of surplus US weapons plutonium as Mixed Oxide (MOX) fuel in existing commercial Canadian Pressurized Heavy Water reactors, known as CANDU`s. The first report, submitted to DOE in July, 1994 (the 1994 Executive Summary is attached), identified practical and safe options for the consumption of 50 to 100 tons of plutonium in 25 years in some of the existing CANDU reactors operating the Bruce A generating station, on Lake Huron, about 300 km north east of Detroit. By designing the fuel and nuclear performance to operate within existing experience and operating/performance envelope, and by utilizing existing fuel fabrication and transportation facilities and methods, a low cost, low risk method for long term plutonium disposition was developed. In December, 1995, in response to evolving Mission Requirements, the DOE requested a further study of the CANDU option with emphasis on more rapid disposition of the plutonium, and retaining the early start and low risk features of the earlier work. This report is the result of that additional work.

  18. Validation of WIMS-AECL reactivity device calculations for CANDU reactor

    Energy Technology Data Exchange (ETDEWEB)

    Min, Byung Joo [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of); Donnelly, J. V. [Atomic Energy of Canada Ltd., Chalk River, ON (Canada)

    1997-06-01

    An important component of the overall program to validate WIMS-AECL for use with RFSP in the analysis of CANDU-6 reactors for design and safety analysis calculations is the validation of calculations of incremental cross sections used to represent reactivity devices. A method has been developed for the calculation of the three-dimensional neutron flux distribution in and around CANDU reactor fuel channels and reactivity control devices. The methods is based on one- and two dimensional transport calculations with the WIMS-AECL lattice cell code, SPH homogenization, and three-dimensional flux calculations with finite-difference diffusion theory using the MULTICELL code. Simulations of Wolsung 1 Phase-B commissioning measurements and Point Lepreau restart tests have been performed, as a part of the program to validate WIMS-AECL lattice cell calculations for application to CANDU reactor simulations in RFSP. The incremental cross section properties of the Wolsung 1 and Point Lepreau adjusters, Mechanical Control Absorbers(MCA) and liquid Zone Control Unit (ZCU) is based on the WIMS-AECL/MULTICELL modelling methods and the results are compared with those of WIMS-AECL/DRAGON-2 modelling methods. (author). 13 tabs., 4 figs., 11 refs.

  19. Development of best estimate auditing code for CANDU thermal-hydraulic safety analysis

    Energy Technology Data Exchange (ETDEWEB)

    Chung, Bub Dong; Lee, Won Jae; Hwang, Moon Kyu; Lim, Hong Sik [Korea Atomic Energy Research Institute, Taejeon (Korea)

    2002-04-01

    The main purpose of this study is to develop a thermal hydraulic auditing code for the CANDU reactor, modifying the model of existing PWR auditing tool, i.e. RELAP5/MOD3.The study was performed by reconsideration of the previous code assessment works and phenomena identification for essential accident scenario. Improvement areas of model development for auditing tool were identified based on the code comparison and PIRT results. Nine models have been improved significantly for the analysis of LOCA and Mon LOCA event. Conceptual problem or separate effect assessment have been performed to verify the model improvement. The linking calculation with CONTAIN 2.0 has been also enabled to establish the unified auditing code system. Analysis for the CANDU plant real transient and hypothetical LOCA bas been performed using the improved version. It has been concluded that the developed version can be utilized for the auditing analysis of LOCA and non-LOCA event for the CANDU reactor. 25 refs., 84 figs., 36 tabs. (Author)

  20. Mechanical engineering utilizing advanced engineering tools for the CANDU 9 project

    Energy Technology Data Exchange (ETDEWEB)

    Nuzzo, F.; Yu, S.K.W.; Hedges, K.R. [Atomic Energy of Canada Limited (AECL), Ontario (Canada)

    1998-05-01

    To meet the increasing challenging project requirements such as cost and schedule reduction, AECL has incorporated a comprehensive suite of integrated, advanced engineering tools for CANDU project engineering and delivery. This paper provides a description of the advanced engineering tools developed and used by AECL in the pre-project engineering of the CANDU 9 product and the construction projects such as the construction of two CANDU 6 units in Qinshan, China. The advanced mechanical engineering tools described include: the Process and Instrument Diagram ; the mechanical/piping 3D models; the CADDS/piping analysis interface (PAI) tool; the pipe support design system (SDS) tool; and the powerful equipment database tool - TeddyBase. A description of the enhanced work process will also be provided. The work process improvement is a direct result of the implementation of advanced information technology and the integration of AECL tools with commercial engineering and project tools available in the market. The use of these advanced tools results in better design quality; enhanced presentation of the engineering deliverables to construction and commissioning staff; and potential support to future plant operations (Ref.1). (author). 2 refs., 3 figs.

  1. R and D activities on CANDU-type fuel in Indonesia

    Energy Technology Data Exchange (ETDEWEB)

    Suripto, A.; Badruzzaman, M.; Latief, A. [Nuclear Fuel Element Centre, National Atomic Energy Agency of Indonesia (BATAN), Puspiptek, Serpong (Indonesia)

    1997-07-01

    The status of R and D activities in Indonesia with respect of CANDU-type fuel development is presented. The activities have been started since the first feasibility study to introduce nuclear power plants was carried out in 1970s. The early research comprised the in-situ pilot production of yellow-cake in Kalimantan (Borneo) experimental mining site, uranium purification and pellet preparation. This program continued to gain a full support from the Government which culminated in the realisation of the construction by BATAN of a large fuel development laboratory in Serpong, starting from 1984 in co-operation with NIRA Ansaldo of Italy. The laboratory, which is called the Power Reactor Experimental Fuel Element Installation (EFEI) was originally designed as an experimental facility to integrate the acquired domestic R and D results gained so far on the CANDU-type fuel technology and the additional know-how received from NIRA Ansaldo which at that time was engaged, in developing a CANDU-type fuel, called the CIRENE fuel design. In the present days the facility houses the power reactor fuel development activities carried out to build up the national capability on power reactor fuel fabrication technology in anticipation to embark upon the nuclear energy era in the near future. (author)

  2. Power distribution control of CANDU reactors based on modal representation of reactor kinetics

    Energy Technology Data Exchange (ETDEWEB)

    Xia, Lingzhi, E-mail: lxia4@uwo.ca [Department of Electrical and Computer Engineering, The University of Western Ontario, London, Ontario N6A 5B9 (Canada); Jiang, Jin, E-mail: jjiang@eng.uwo.ca [Department of Electrical and Computer Engineering, The University of Western Ontario, London, Ontario N6A 5B9 (Canada); Luxat, John C., E-mail: luxatj@mcmaster.ca [Department of Engineering Physics, McMaster University, Hamilton, Ontario L8S 4L7 (Canada)

    2014-10-15

    Highlights: • Linearization of the modal synthesis model of neutronic kinetic equations for CANDU reactors. • Validation of the linearized dynamic model through closed-loop simulations by using the reactor regulating system. • Design of a LQR state feedback controller for CANDU core power distribution control. • Comparison of the results of this new controller against those of the conventional reactor regulation system. - Abstract: Modal synthesis representation of a neutronic kinetic model for a CANDU reactor core has been utilized in the analysis and synthesis for reactor control systems. Among all the mode shapes, the fundamental mode of the power distribution, which also coincides with the desired reactor power distribution during operation, is used in the control system design. The nonlinear modal models are linearized around desired operating points. Based on the linearized model, linear quadratic regulator (LQR) control approach is used to synthesize a state feedback controller. The performance of this controller has been evaluated by using the original nonlinear models under load-following conditions. It has been demonstrated that the proposed reactor control system can produce more uniform power distribution than the traditional reactor regulation systems (RRS); in particular, it is more effective in compensating the Xenon induced transients.

  3. Diagnostic technology for degradation of feeder pipes and fuel channels in CANDU reactor; development of aging assessment technology for CANDU pressure tubes

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Young Jin; Kim, Yun Jae; Huh, Nam Su; Kwak, Sang Log; Lee, Kyu Ho [Sungkyunkwan University, Seoul (Korea)

    2002-04-01

    This research project attempts to resolve two issues related to integrity assessment of CANDU pressure tubes; (1) FE analysis of blister formation and growth, and (2) engineering estimation scheme to predict creep deflection of pressure tubes. Results for blister formation and growth can be summarised as follows. Comparing the results from the FE analysis, developed within this project, with experimental data shows some differences ranging from 10-57%. Such difference results from two possible sources. One source is neglecting two phase diffusion. The present FE analysis considers only single phase diffusion, and thus blister growth can not be accurately modeled. The other source would be inherent errors associated with experimental measurement. Thus it has been concluded that further efforts should be made on two phase diffusion modeling. For developing mechanistic model of creep deflection, the proposed reference stress based model is simple to use. Extensive validation against creep FE results shows that the proposed model is also quite accurate. More important aspect of the proposed method is that it can be easily generalized to more complex problems. Thus it is believed that the present results provide a sound basis for sagging assessment of CANDU pressure tubes. 16 refs., 12 figs., 6 tabs. (Author)

  4. Shortest Tree Routing With Security In Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    P.T Arshad

    2014-12-01

    Full Text Available We propose STR to resolve the main reasons of overall network performance degradation of ZTR, which are the detour path problem and the traffic concentration problem. Second, we prove that the 1-hop neighbor nodes used by STR improve the routing path efficiency and alleviate the traffic load concentrated on tree links in ZTR. Third, we analyze the performance of ZTR, STR, and AODV by differentiating the network conditions such as network density, ZigBee network constraints, traffic types, and the network traffic. For modification security purpose we are also encrypting the data packets during transmission. So that the intermediate nodes are not able to view the data during transmission. For Encryption process, we are using RC4 Algorithm. Short cut tree routing is used for minimizing the routing path from source to destination.

  5. EC6{sup TM} - Enhanced Candu 6{sup TM} reactor safety characteristics

    Energy Technology Data Exchange (ETDEWEB)

    Popov, N.; Snell, V.; Cormier, M.; Hopwood, J. [Atomic Energy of Canada Ltd., 2251 Speakman Drive, Mississauga, Ontario, L5K 1B2 (Canada)

    2010-07-01

    The EC6 is a 740 MWe-class natural-uranium-fuelled, heavy-water-cooled and -moderated pressure-tube reactor, which has evolved from the eleven (11) CANDU{sup R} 6 plants operating in five countries (on four continents). CANDU 6 has over 150 reactor-years of safe operation. The most recent CANDU 6 - at Qinshan, in China - is the Reference Design for EC6. The EC6 shares many inherent, passive and engineered safety characteristics with the Reference Design. However EC6 has been designed to meet modern regulatory requirements and safety expectations. The resulting design changes have improved these safety characteristics, and this paper provides a convenient summary. The paper addresses the safety functions of reactivity control, heat removal, and containment of radioactive material. For each safety function, the EC6 characteristics are categorized as inherent, passive, or engineered. The paper focuses mostly on the first two. The Enhanced CANDU 6 uses an appropriate mix of passive, inherent, and engineered safety functions. Reactivity transients are generally slow, mild and inherently limited due to the natural uranium core and use of on-power refuelling. Only the coolant void coefficient can cause a large reactivity insertion, particularly in a large LOCA. This is mitigated by the long prompt neutron lifetime and the large delayed neutron fraction, and terminated by either of the two shutdown systems. For EC6, the large LOCA power transient has been reduced significantly by speeding up the slower of the two shutdown systems. Redundant shutdown and the LOCA power pulse improvements mitigate the limiting large positive reactivity insertion. Decay heat removal shows a very high component of passive safety, from thermo-siphoning in the Reactor Coolant System to passive heat removal in severe accidents via the moderator or reactor vault. The latter two can maintain the fuel in a more predictable and favourable geometry than 'core on the floor'. The containment

  6. Speciation of iodine (I-127) in the natural environment around Canadian CANDU sites

    Energy Technology Data Exchange (ETDEWEB)

    Kramer, S.J.; Kotzer, T.G.; Chant, L.A

    2001-06-01

    In Canada, very little data is available regarding the concentrations and chemical speciation of iodine in the environment proximal and distal to CANDU Nuclear Power Generating Stations (NPGS). In the immediate vicinity of CANDU reactors, the short-lived iodine isotope {sup 131}I (t{sub 1/2} = 8.04 d), which is produced from fission reactions, is generally below detection and yields little information about the environmental cycling of iodine. Conversely, the fission product {sup 129}I has a long half-life (t{sub 1/2} = 1.57x10{sup 7} y) and has had other anthropogenic inputs (weapons testing, nuclear fuel reprocessing) other than CANDU over the past 50 years. As a result, the concentrations of stable iodine ({sup 127}I) have been used as a proxy. In this study, a sampling system was developed and tested at AECL's Chalk River Laboratories (CRL) to collect and measure the particulate and gaseous inorganic and organic fractions of stable iodine ({sup 127}I) in air and associated organic and inorganic reservoirs. Air, vegetation and soil samples were collected at CRL, and at Canadian CANDU Nuclear Power Generating Stations (NPGS) at OPG's (Ontario Power Generation) Pickering (PNGS) and Darlington NPGS (DNGS) in Ontario, as well as at NB Power's Pt. Lepreau NPGS in New Brunswick. The concentrations of particulate and inorganic iodine in air at CRL were extremely low, and were often found to be below detection. The concentrations are believed to be at this level because the sediments in the CRL area are glacial fluvial and devoid of marine ionic species, and the local atmospheric conditions at the sampling site are very humid. Concentrations of a gaseous organic species were comparable to worldwide levels. The concentrations of particulate and inorganic iodine in air were also found to be low at PNGS and DNGS, which may be attributed to reservoir effects of the large freshwater lakes in southern Ontario, which might serve to dilute the atmospheric iodine

  7. Chemical reaction optimization for solving shortest common supersequence problem.

    Science.gov (United States)

    Khaled Saifullah, C M; Rafiqul Islam, Md

    2016-10-01

    Shortest common supersequence (SCS) is a classical NP-hard problem, where a string to be constructed that is the supersequence of a given string set. The SCS problem has an enormous application of data compression, query optimization in the database and different bioinformatics activities. Due to NP-hardness, the exact algorithms fail to compute SCS for larger instances. Many heuristics and meta-heuristics approaches were proposed to solve this problem. In this paper, we propose a meta-heuristics approach based on chemical reaction optimization, CRO_SCS that is designed inspired by the nature of the chemical reactions. For different optimization problems like 0-1 knapsack, quadratic assignment, global numeric optimization problems CRO algorithm shows very good performance. We have redesigned the reaction operators and a new reform function to solve the SCS problem. The outcomes of the proposed CRO_SCS algorithm are compared with those of the enhanced beam search (IBS_SCS), deposition and reduction (DR), ant colony optimization (ACO) and artificial bee colony (ABC) algorithms. The length of supersequence, execution time and standard deviation of all related algorithms show that CRO_SCS gives better results on the average than all other algorithms.

  8. Identification of biochemical network modules based on shortest retroactive distances.

    Directory of Open Access Journals (Sweden)

    Gautham Vivek Sridharan

    2011-11-01

    Full Text Available Modularity analysis offers a route to better understand the organization of cellular biochemical networks as well as to derive practically useful, simplified models of these complex systems. While there is general agreement regarding the qualitative properties of a biochemical module, there is no clear consensus on the quantitative criteria that may be used to systematically derive these modules. In this work, we investigate cyclical interactions as the defining characteristic of a biochemical module. We utilize a round trip distance metric, termed Shortest Retroactive Distance (ShReD, to characterize the retroactive connectivity between any two reactions in a biochemical network and to group together network components that mutually influence each other. We evaluate the metric on two types of networks that feature feedback interactions: (i epidermal growth factor receptor (EGFR signaling and (ii liver metabolism supporting drug transformation. For both networks, the ShReD partitions found hierarchically arranged modules that confirm biological intuition. In addition, the partitions also revealed modules that are less intuitive. In particular, ShReD-based partition of the metabolic network identified a 'redox' module that couples reactions of glucose, pyruvate, lipid and drug metabolism through shared production and consumption of NADPH. Our results suggest that retroactive interactions arising from feedback loops and metabolic cycles significantly contribute to the modularity of biochemical networks. For metabolic networks, cofactors play an important role as allosteric effectors that mediate the retroactive interactions.

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

  10. Measurement of gap and grain-boundary inventories of {sup 129}I in used CANDU fuels

    Energy Technology Data Exchange (ETDEWEB)

    Stroes-Gascoyne, S.; Moir, D.L.; Kolar, M.; Porth, R.J.; McConnell, J.L.; Kerr, A.H. [AECL Research, Pinawa, Manitoba (Canada). Whiteshell Labs.

    1995-12-31

    Combined gap and grain-boundary inventories of {sup 129}I in 14 used CANDU fuel elements were measured by crushing and simultaneously leaching fuel segments for 4 h in a solution containing KI carrier. From analogy with previous work a near one-to-one correlation was anticipated between the amount of stable Xe and the amount of {sup 128}I in the combined gap and grain-boundary regions of the fuel. However, the results showed that such a correlation was only apparent for low linear power rating (LLPR) fuels with an average linear power rating of < 42 kW/m. For high linear power rating (HLPR) fuels (> 44 kW/m), the {sup 129}I values were considerably smaller than expected. The combined gap and grain-boundary inventories of {sup 129}I in the 14 fuels tested varied from 1.8 to 11.0%, with an average value of 3.6 {+-} 2.4% which suggests that the average value of 8.1 {+-} 1% used in safety assessment calculations overestimates the instant release fraction for {sup 129}I. Segments of used CANDU fuels were leached for 92 d (samples taken at 5, 28 and 92 d) to determine the kinetics of {sup 129}I release. Results could be fitted tentatively to half-order reaction kinetics, implying that {sup 129}I release is a diffusion-controlled process for LLPR fuels, and also for HLPR fuels, once the gap inventory has been leached. However, more data are needed over longer leaching periods to gain more understanding of the processes that control grain-boundary release of {sup 129}I from used CANDU fuel.

  11. Assessment of CANDU reactor physics effects using a simplified whole-core MCNP model

    Energy Technology Data Exchange (ETDEWEB)

    Kozier, K.S

    2002-07-01

    A whole-core Monte Carlo n-particle (MCNP) model of a simplified CANDU reactor was developed and used to study core configurations and reactor physics phenomena of interest in CANDU safety analysis. The resulting reactivity data were compared with values derived from corresponding WIMS-AECL/RFSP, two-neutron-energy-group diffusion theory core simulations, thereby extending the range of CANDU-related code-to-code benchmark comparisons to include whole-core representations. These comparisons show a systematic discrepancy of about 6 mk between the respective absolute k{sub eff} values, but very good agreement to within about -0.15 {+-} 0.06 mk for the reactivity perturbation induced by G-core checkerboard coolant voiding. These findings are generally consistent with the results of much simpler uniform-lattice comparisons involving only WIMS-AECL and MCNP. In addition, MCNP fission-energy tallies were used to evaluate other core-wide properties, such as fuel bundle and total-channel power distributions, as well as intra-bundle details, such as outer-fuel-ring relative power densities and outer-ring fuel element azimuthal power variations, which cannot be determined directly from WIMS-AECL/RFSP core calculations. The average MCNP values for the ratio of outer fuel element to average fuel element power density agreed well with corresponding values derived from WIMS-AECL lattice-cell cases, showing a small systematic discrepancy of about 0.5 %, independent of fuel bum-up. For fuel bundles containing the highest-power fuel elements, the maximum peak-to-average outer-element azimuthal power variation was about 2.5% for cases where a statistically significant trend was observed, while much larger peak-to-average outer-element azimuthal power variations of up to around 42% were observed in low-power fuel bundles at the core/radial-neutron-reflector interface. (author)

  12. THE IMPACT OF POWER COEFFICIENT OF REACTIVITY ON CANDU 6 REACTORS

    Directory of Open Access Journals (Sweden)

    D. KASTANYA

    2013-10-01

    Full Text Available The combined effects of reactivity coefficients, along with other core nuclear characteristics, determine reactor core behavior in normal operation and accident conditions. The Power Coefficient of Reactivity (PCR is an aggregate indicator representing the change in reactor core reactivity per unit change in reactor power. It is an integral quantity which captures the contributions of the fuel temperature, coolant void, and coolant temperature reactivity feedbacks. All nuclear reactor designs provide a balance between their inherent nuclear characteristics and the engineered reactivity control features, to ensure that changes in reactivity under all operating conditions are maintained within a safe range. The CANDU® reactor design takes advantage of its inherent nuclear characteristics, namely a small magnitude of reactivity coefficients, minimal excess reactivity, and very long prompt neutron lifetime, to mitigate the demand on the engineered systems for controlling reactivity and responding to accidents. In particular, CANDU reactors have always taken advantage of the small value of the PCR associated with their design characteristics, such that the overall design and safety characteristics of the reactor are not sensitive to the value of the PCR. For other reactor design concepts a PCR which is both large and negative is an important aspect in the design of their engineered systems for controlling reactivity. It will be demonstrated that during Loss of Regulation Control (LORC and Large Break Loss of Coolant Accident (LBLOCA events, the impact of variations in power coefficient, including a hypothesized larger than estimated PCR, has no safety-significance for CANDU reactor design. Since the CANDU 6 PCR is small, variations in the range of values for PCR on the performance or safety of the reactor are not significant.

  13. Development of thermal-hydraulic models for the safety evaluation of CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Jae Young; Hwang, Gi Suk; Jung, Yun Sik [Handong Univ., Pohang (Korea, Republic of); No, Hee Cheon; Moon, Young Min [Korea Advanced Institute of Science and Technology, Taejon (Korea, Republic of)

    2003-03-15

    The objective of the present research is to evaluate the safety analysis for CANDU and to improve the Horizontal Stratification Entrainment Model (HSEM) of RELAP5/MOD3.3. This report includes two items : the one is the development of experimental facility for the safety evaluation of CANDU, the other is the results of comparison with the existing correlations and data. The literature reviews are performed and the database for previous off-take experiments are built. By a survey of state-of-the-articles, the deficiencies of previous works and limitations of existing models are examined. The hydraulic behavior branching through the feeder pipes from the header pipe is analyzed and the test facility of off-take experiment is designed and manufactured as the prototype CANDU6, by a proper scaling methodologies. The test facility contains various branch pipes not only for three directions (top, side and bottom), but for arbitrary directions. The experiments about the onset of entrainment and branch quality only for three directions (top, side and bottom) are carried out by using air-water as working fluids. On the whole, the existing correlations predict the present experimental results well branch quality, entrainment, which validates the availability of experimental facility and methodology. Especially, for the branch quality with top and bottom branches, the different results are shown because of the unstable flow regimes in the horizontal pipe and the different branch diameters. The deficiencies of previous works and limitations of existing models are considered. The off-take experiment for arbitrary branch angles continues as the next year research.

  14. Pressure tube creep impact on the physics parameters for CANDU-6 reactors

    Energy Technology Data Exchange (ETDEWEB)

    Kim, W. Y.; Min, B. J. [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of); Kam, S. C.; Kim, M. E. [Korea Institute of Nuclear Safety, Taejon (Korea, Republic of)

    2004-07-01

    The lattice cell calculations are performed to assess the sensitivity of the reactor physics parameters to pressure tube creep resulting from radiation aging. The physics parameters of the lattice cell are calculated by using WIMSD-5B code, WIMS- AECL code, and MCNP code. The reference model(normal state) and two perturbed models accounting for the pressure tube creep are developed on the basis of CANDU-6 lattice cell. The 2.5% and 5% values of pressure tube diameter creep are considered. Also, The effects of the analyzed lattice parameters which are the coolant void reactivity, the fuel fission density and the atom density of Pu isotopes on the lattice.

  15. Incorporating single detector failure into the ROP detector layout optimization for CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Kastanya, Doddy, E-mail: Doddy.Kastanya@snclavalin.com

    2015-12-15

    Highlights: • ROP TSP value needs to be adjusted when any detector in the system fails. • Single detector failure criterion has been incorporated into the detector layout optimization as a constraint. • Results show that the optimized detector layout is more robust with respect to its vulnerability to a single detector failure. • An early rejection scheme has been introduced to speed-up the optimization process. - Abstract: In CANDU{sup ®} reactors, the regional overpower protection (ROP) systems are designed to protect the reactor against overpower in the fuel which could reduce the safety margin-to-dryout. In the CANDU{sup ®} 600 MW (CANDU 6) design, there are two ROP systems in the core, each of which is connected to a fast-acting shutdown system. Each ROP system consists of a number of fast-responding, self-powered flux detectors suitably distributed throughout the core within vertical and horizontal flux detector assemblies. The placement of these ROP detectors is a challenging discrete optimization problem. In the past few years, two algorithms, DETPLASA and ADORE, have been developed to optimize the detector layout for the ROP systems in CANDU reactors. These algorithms utilize the simulated annealing (SA) technique to optimize the placement of the detectors in the core. The objective of the optimization process is typically either to maximize the TSP value for a given number of detectors in the system or to minimize the number of detectors in the system to obtain a target TSP value. One measure to determine the robustness of the optimized detector layout is to evaluate the maximum decrease (penalty) in TSP value when any single detector in the system fails. The smaller the penalty, the more robust the design is. Therefore, in order to ensure that the optimized detector layout is robust, the single detector failure (SDF) criterion has been incorporated as an additional constraint into the ADORE algorithm. Results from this study indicate that there

  16. Once-through CANDU reactor models for the ORIGEN2 computer code

    Energy Technology Data Exchange (ETDEWEB)

    Croff, A.G.; Bjerke, M.A.

    1980-11-01

    Reactor physics calculations have led to the development of two CANDU reactor models for the ORIGEN2 computer code. The model CANDUs are based on (1) the existing once-through fuel cycle with feed comprised of natural uranium and (2) a projected slightly enriched (1.2 wt % /sup 235/U) fuel cycle. The reactor models are based on cross sections taken directly from the reactor physics codes. Descriptions of the reactor models, as well as values for the ORIGEN2 flux parameters THERM, RES, and FAST, are given.

  17. Licensing assessment of the Candu Pressurized Heavy Water Reactor. Preliminary safety information document. Volume II. [USA

    Energy Technology Data Exchange (ETDEWEB)

    1977-06-01

    ERDA has requested United Engineers and Constructors (UE and C) to evaluate the design of the Canadian natural uranium fueled, heavy water moderated (CANDU) nuclear reactor power plant to assess its conformance with the licensing criteria and guidelines of the U.S. Nuclear Regulatory Commission (USNRC) for light water reactors. This assessment was used to identify cost significant items of nonconformance and to provide a basis for developing a detailed cost estimate for a 1140 MWe, 3-loop Pressurized Heavy Water Reactor (PHWR) located at the Middletown, USA Site.

  18. Ranking paths in stochastic time-dependent networks

    DEFF Research Database (Denmark)

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

    2014-01-01

    be easily extended to the ranking of the first K shortest paths. Our method exploits the solution of the time-adaptive routing problem as a relaxation of the a priori problem. Computational results are presented showing that, under realistic distributions of travel times and costs, our solution methods...

  19. Chemistry aspects of the source term formation for a severe accident in a CANDU type reactor

    Energy Technology Data Exchange (ETDEWEB)

    Constantin, A.; Constantin, M. [Institute for Nuclear Research, Pitesti (Romania)

    2013-07-15

    The progression of a severe accident in a CANDU type reactor is slow because the core is surrounded by a large quantity of heavy and light water which acts as a heat sink to remove the decay heat. Therefore, the source term formation is a complex and long process involving fission products transport and releasing in the fuel matrix, thermal hydraulics of the transport fluid in the primary heat system and containment, deposition and transport of fission products, chemistry including the interaction with the dousing system, structural materials and paints, etc. The source term is strongly dependent on initial conditions and accident type. The paper presents chemistry aspects for a severe accident in a CANDU type reactor, in terms of the retention in the primary heat system. After releasing from the fuel elements, the fission products suffer a multitude of phenomena before they are partly transferred into the containment region. The most important species involved in the deposition were identified. At the same time, the influence of the break position in the transfer fractions from the primary heat system to the containment was investigated. (orig.)

  20. Optimization of the self-sufficient thorium fuel cycle for CANDU power reactors

    Directory of Open Access Journals (Sweden)

    Bergelson Boris R.

    2008-01-01

    Full Text Available The results of optimization calculations for CANDU reactors operating in the thorium cycle are presented in this paper. Calculations were performed to validate the feasibility of operating a heavy-water thermal neutron power reactor in a self-sufficient thorium cycle. Two modes of operation were considered in the paper: the mode of preliminary accumulation of 233U in the reactor itself and the mode of operation in a self-sufficient cycle. For the mode of accumulation of 233U, it was assumed that enriched uranium or plutonium was used as additional fissile material to provide neutrons for 233U production. In the self-sufficient mode of operation, the mass and isotopic composition of heavy nuclei unloaded from the reactor should provide (after the removal of fission products the value of the multiplication factor of the cell in the following cycle K>1. Additionally, the task was to determine the geometry and composition of the cell for an acceptable burn up of 233U. The results obtained demonstrate that the realization of a self-sufficient thorium mode for a CANDU reactor is possible without using new technologies. The main features of the reactor ensuring a self-sufficient mode of operation are a good neutron balance and moving of fuel through the active core.

  1. Development of scaling laws on thermal-hydraulic effect test facility for CANDU-6 moderator

    Energy Technology Data Exchange (ETDEWEB)

    Lee, J. Y.; Jung, Y. S.; Kim, N. S. [Handong University, Pohang (Korea, Republic of); Kim, M. W.; Kim, H. J. [Korea Institute of Nuclear Safety, Taejon (Korea, Republic of)

    2004-07-01

    The scaling laws on thermal-hydraulic effect test facility for CANDU-6 moderator (HGU-KINS) have been investigated and manufactured. The basic laws are the satisfaction of energy conservation and dimensionless number, Ar and Re, for the similarities of thermal-hydraulic properties. And then the thermal-hydraulic scaling analyses of test facilities, SPEL(1/10 scale) and STERN(1/4 scale), have been identified by the present method. As a result, in the case of SPEL, the energy conservation is confirmed, but the similarities of Ar and the heat density are not considered. In the case of STERN, the energy conservation and the characteristics of Ar were well defined. But the similarity of the heat density is unsatisfied, either. Therefore the present method was applied with 1/8 length scale. For the performance test, CFD analysis has been accomplished by CFX5. The results of flow pattern certifications and variation of axial properties with CANDU show that the present scaling method is acceptable.

  2. The application of Plant Reliability Data Information System (PRINS) to CANDU reactor

    Energy Technology Data Exchange (ETDEWEB)

    Hwang, S. W.; Lim, Y. H.; Park, H. C. [Korea Hydro and Nuclear Power Co., Ltd., Naah-ri 260, Yangnam-myun, Gyeongju-si, Gyeong Buk (Korea, Republic of)

    2012-07-01

    As risk-informed applications (RIAs) are actively implanted in the nuclear industry, an issue associated with technical adequacy of Probabilistic Safety Assessment (PSA) arises in its modeling and data sourcing. In Korea, PSA for all Korean NPPs has been completed and KHNP(Korea Hydro and Nuclear Power Plant Company) developed the database called the Plant Reliability Data Information System (PRinS). It has several characteristics that distinguish it from other database system such as NPRDs (INPO,1994), PRIS (IAEA), and SRDF (EdF). This database has the function of systematic data management such as automatic data-gathering, periodic data deposition and updating, statistical analysis including Bayesian method, and trend analysis of failure rate or unavailability. In recent PSA for CANDU reactor, the component failure data of EPRI ALWR URD and Component Reliability Database were preferentially used as generic data set. The error factor for most component failure data was estimated by using the information NUREG/CR-4550 and NUREG/CR-4639. Also, annual trend analysis was performed for the functional losses of components using the statistical analysis and chart module of PRinS. Furthermore, the database has been updated regularly and maintained as a living program to reflect the current status. This paper presents the failure data analysis using PRinS which provides Bayesian analysis on main components in the CANDU reactor. (authors)

  3. Ludwig: A Training Simulator of the Safety Operation of a CANDU Reactor

    Directory of Open Access Journals (Sweden)

    Gustavo Boroni

    2011-01-01

    Full Text Available This paper presents the application Ludwig designed to train operators of a CANDU Nuclear Power Plant (NPP by means of a computer control panel that simulates the response of the evolution of the physical variables of the plant under normal transients. The model includes a close set of equations representing the principal components of a CANDU NPP plant, a nodalized primary circuit, core, pressurizer, and steam generators. The design of the application was performed using the object-oriented programming paradigm, incorporating an event-driven process to reflect the action of the human operators and the automatic control system. A comprehensive set of online graphical displays are provided giving an in-depth understanding of transient neutronic and thermal hydraulic response of the power plant. The model was validated against data from a real transient occurring in the Argentine NPP Embalse Río Tercero, showing good agreement. However, it should be stressed that the aim of the simulator is in the training of operators and engineering students.

  4. Advanced CFD simulations of turbulent flows around appendages in CANDU fuel bundles

    Energy Technology Data Exchange (ETDEWEB)

    Abbasian, F.; Hadaller, G.I.; Fortman, R.A., E-mail: fabbasian@sternlab.com [Stern Laboratories Inc., Hamilton, Ontario (Canada)

    2013-07-01

    Computational Fluid Dynamics (CFD) was used to simulate the coolant flow in a modified 37-element CANDU fuel bundle, in order to investigate the effects of the appendages on the flow field. First, a subchannel model was created to qualitatively analyze the capabilities of different turbulence models such as k.ε, Reynolds Normalization Group (RNG), Shear Stress Transport (SST) and Large Eddy Simulation (LES). Then, the turbulence model with the acceptable quality was used to investigate the effects of positioning appendages, normally used in CANDU 37-element Critical Heat Flux (CHF) experiments, on the flow field. It was concluded that the RNG and SST models both show improvements over the k.ε method by predicting cross flow rates closer to those predicted by the LES model. Also the turbulence effects in the k.ε model dissipate quickly downstream of the appendages, while in the RNG and SST models appear at longer distances similar to the LES model. The RNG method simulation time was relatively feasible and as a result was chosen for the bundle model simulations. In the bundle model simulations it was shown that the tunnel spacers and leaf springs, used to position the bundles inside the pressure tubes in the experiments, have no measureable dominant effects on the flow field. The flow disturbances are localized and disappear at relatively short streamwise distances. (author)

  5. Design and Development of a Robotic Crawler for CANDU Fuel Channel Inspection

    Science.gov (United States)

    Shukla, Shivam

    For the design of a new robotic crawler drive unit for CANDU fuel channel inspection, a complete design and screening process was done in order to fulfil the objective of this research. A brief explanation of CANDU reactors is provided along with a discussion of the inspection systems that are currently in use. A study of some existing inspection systems is presented which was used for the development of the new robotic crawler design. A number of concepts were generated which underwent a screening process with the help of two design tools. With the help of these tools, a concept was chosen as the final design and details of it are presented. To demonstrate a proof-of-concept, the physical prototype of the robotic crawler was manufactured and assembled. A speed controller was implemented in the final design of the robotic crawler. A set of test procedures were performed on the final design and the results are discussed. Some improvements that can be done on the final design of the robotic crawler are also discussed in the final section of this thesis.

  6. The longest shortest fence and sharp Poincar\\'e-Sobolev inequalities

    CERN Document Server

    Esposito, L; Kawohl, B; Nitsch, C; Trombetti, C

    2010-01-01

    We prove a long standing conjecture concerning the fencing problem in the plane: among planar convex sets of given area, prove that the disc, and only the disc maximizes the length of the shortest area-bisecting curve. Although it may look intuitive, the result is by no means trivial since we also prove that among planar convex sets of given area the set which maximizes the length of the shortest bisecting chords is the so-called Auerbach triangle.

  7. Development of a System Dynamics Model for Evaluating the Economics of an Advanced CANDU Fuel

    Energy Technology Data Exchange (ETDEWEB)

    Jung, Jong Yeob; Park, Joo Hwan [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)

    2009-10-15

    Since the early 1990's, the Korea Atomic Energy Research Institute (KAERI) and the Atomic Energy of Canada Limited (AECL) have cooperated to develop, verify, and demonstrate the advanced CANDU fuel, so called CANFLEX-NU (Natural Uranium). The CANFLEX-NU fuel bundle consists of 43 fuel elements and has the buttons on the outer surface of the fuel elements for improving the CHF (Critical-Heat-Flux) characteristics. Because of this features of CANFLEXNU fuel, it offers higher operating and safety margins than current 37-element fuel. Recently, the interest for a CANFLEX-NU has been increased because of the power de-rating due to aging of CANDU reactors. Wolsong Unit 1 CANDU reactor has been operated over 25 years and the operating power at the present time is less than 90% of a full power because of a reduction of the margin of ROP trip set point. The most appropriate way to overcome such a power de-rating due to a crept pressure tube is the introduction of a CANFLEX-NU fuel into a CANDU reactor. Now, a CANFLEX-NU fuel is ready to be commercialized in a CANDU-6 reactor because the design and demonstration irradiation have been completed in both Korea and Canada. Economic evaluation for commercializing a CANFLEX-NU fuel in Wolsong Units was carried out by calculating the unit prime cost of electricity production. Throughout the economic evaluation, it was found that the introduction of CANFLEX-NU fuel into Wolsong Units would have much economic benefits due to a better operating performance. However, the amount of economic profit due to introducing CANFLEX-NU fuel depends on several parameters such as the required time to get license from regulatory institute before commercializing, licensing cost, failure probability of commercializing etc. Therefore, it is necessary to determine the optimum condition to get the highest economic profit. In this paper, an economic evaluation was carried out based on the starting year of the licensing study with considering the

  8. Beyond designed functional margins in CANDU type NPP. Radioactive nuclei assessment in an LOCA type accident

    Directory of Open Access Journals (Sweden)

    Budu Andrei Razvan

    2015-01-01

    Full Text Available European Union's energy roadmap up to year 2050 states that in order to have an efficient and sustainable economy, with minimum or decreasing greenhouse gas emissions, along with use of renewable resources, each constituent state has the option for nuclear energy production as one desirable option. Every scenario considered for tackling climate change issues, along with security of supply positions the nuclear energy as a recommended option, an option that is highly competitive with respect to others. Nuclear energy, along with other renewable power sources are considered to be the main pillars in the energy sector for greenhouse gas emission mitigation at European level. European Union considers that nuclear energy must be treated as a highly recommended option since it can contribute to security of energy supply. Romania showed excellent track-records in operating in a safe and economically sound manner of Cernavoda NPP Units 1&2. Both Units are in top 10 worldwide in terms of capacity factor. Due to Romania's need to ensure the security of electricity supply, to meet the environmental targets and to move to low carbon generation technologies, Cernavoda Units 3&4 Project appears as a must. This Project was started in 2010 and it is expected to have the Units running by 2025. Cost effective and safety operation of a Nuclear Power Plant is made taking into consideration functional limits of its equipment. As common practice, every nuclear reactor type (technology used is tested according to the worse credible accident or equipment failure that can occur. For CANDU type reactor, this is a Loss of Cooling Accident (LOCA. In a LOCA type accident in a CANDU NPP, using RELAP/SCDAP code for fuel bundle damage assessment the radioactive nuclei are to be quantified. Recently, CANDU type NPP accidents are studied using the RELAP/SCDAP code only. The code formerly developed for PWR type reactors was adapted for the CANDU geometry and can assess the

  9. Pedestrian traffic: on the quickest path

    Science.gov (United States)

    Kretz, Tobias

    2009-03-01

    When a large group of pedestrians moves around a corner, most pedestrians do not follow the shortest path, which is to stay as close as possible to the inner wall, but try to minimize the travel time. For this they accept to move on a longer path with some distance to the corner, to avoid large densities and by this succeed in maintaining a comparatively high speed. In many models of pedestrian dynamics the basic rule of motion is often either 'move as far as possible toward the destination' or—reformulated—'of all coordinates accessible in this time step move to the one with the smallest distance to the destination'. On top of this rule modifications are placed to make the motion more realistic. These modifications usually focus on local behavior and neglect long-ranged effects. Compared to real pedestrians this leads to agents in a simulation valuing the shortest path a lot better than the quickest. So, in a situation such as the movement of a large crowd around a corner, one needs an additional element in a model of pedestrian dynamics that makes the agents deviate from the rule of the shortest path. In this work it is shown how this can be achieved by using a flood fill dynamic potential field method, where during the filling process the value of a field cell is not increased by 1, but by a larger value, if it is occupied by an agent. This idea may be an obvious one: however, the tricky part—and therefore in a strict sense the contribution of this work—is (a) to minimize unrealistic artifacts, as naive flood fill metrics deviate considerably from the Euclidean metric and in this respect yield large errors, (b) do this with limited computational effort and (c) keep agents' movement at very low densities unaltered.

  10. Probabilistic integrity assessment of CANDU pressure tube for the consideration of flaw generation time

    Energy Technology Data Exchange (ETDEWEB)

    Kwak, Sang Log; Kim, Young Jin [Sungkyunkwan Univ., Seoul (Korea, Republic of); Lee, Joon Seong [Kyonggi Univ., Seoul (Korea, Republic of); Park, Youn Won [KINS, Taejon (Korea, Republic of)

    2001-07-01

    This paper describes a Probabilistic Fracture Mechanics (PFM) analysis based on Monte Carlo (MC) simulation. In the analysis of CANDU pressure tube, it is necessary to perform the PFM analyses based on statistical consideration of flaw generation time. A depth and an aspect ratio of initial semi-elliptical surface crack, a fracture toughness value, Delayed Hydride Cracking (DHC) velocity, and flaw generation time are assumed to be probabilistic variables. In all the analyses, degradation of fracture toughness due to neutron irradiation is considered. Also, the failure criteria considered are plastic collapse, unstable fracture and crack penetration. For the crack growth by DHC, the failure probability was evaluated in due consideration of flaw generation time.

  11. Sensitivity of Candu-Scwr Reactor Physics Calculations to Nuclear Data Files

    Science.gov (United States)

    Kozier, K. S.; Dyck, G. R.

    2006-04-01

    A simplified MCNP model of a CANDU-SCWR lattice was used to test the sensitivity of the calculated reactivity to various nuclear data files involving issues of current interest. These tests were performed for cooled and voided conditions, with and without axial neutron leakage, for a uniform lattice of mid-life fuel and a mixed lattice with high-burnup and low-burnup fuel in alternate channels. Results were compared using different room-temperature data files for deuterium, various thermal-scattering-law data files for hydrogen bound in light water and deuterium bound in heavy water, and for pre-ENDF/B-VII and ENDF/B-VI.8 data for uranium. The reactivity differences observed were small (typically <1 mk) and increased with axial neutron leakage.

  12. Analytical assessment for stress corrosion fatigue of CANDU fuel elements under load following conditions

    Energy Technology Data Exchange (ETDEWEB)

    Horhoianu, Grigore; Ionescu, Drags; Pauna, Eduard [Institute for Nuclear Research, Pitesti (Romania). Nuclear Fuel Engineering Lab.

    2012-03-15

    When nuclear power reactors are operated in a load following (LF) mode, the nuclear fuel may be subjected to step changes in power on weekly, daily, or even hourly basis, depending on the grid's needs. Two load following tests performed in TRIGA Research Reactor of Institute for Nuclear Research (INR) Pitesti were simulated with finite elements computer codes in order to evaluate Stress Corrosion Fatigue (SCF) of the sheath arising from expansion and contraction of the pellets in the corrosive environment. The 3D finite element analyses show that the cyclic strains give highly multiaxial stresses in the sheath at ridge region. This paper summarizes the results of the analytical assessment for SCF and their relation to CANDU fuel performance in LF tests conditions. (orig.)

  13. Waste management issues and their potential impact on technical specifications of CANDU fuel materials

    Energy Technology Data Exchange (ETDEWEB)

    Tait, J.C.; Johnson, L.H. [Atomic Energy of Canada Limited, Pinawa, Manitoba (Canada)

    1997-07-01

    The technical specifications for the composition of nuclear fuels and materials used in Canada's CANDU reactors have been developed by AECL and materials manufacturers, taking into account considerations specific to their manufacture and the effect of minor impurities on fuel behaviour in reactor. Nitrogen and chlorine are examples of UO{sub 2} impurities, however, where there is no technical specification limit. These impurities are present in the source materials or introduced in the fabrication process and are neutron activated to {sup 14}C and {sup 36}C1, which after {sup 129}I , are the two most significant contributors to dose in safety assessments for the disposal of used fuel. For certain impurities, environmental factors, particularly the safety of the disposal of used fuels, should be taken into consideration when deriving 'allowable' impurity limits for nuclear fuel materials. (author)

  14. Design requirements of a consolidating dry storage module for CANDU spent fuels

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Kyung Ho; Yoon, Jeong Hyoun; Yang, Ke Hyung; Choi, Byung Il; Lee, Heung Young [KHNP/NETEC, Taejon (Korea, Republic of); Cho, Gyu Seong [Korea Advanced Institute of Science and Technology, Taejon (Korea, Republic of)

    2003-10-01

    This paper presents a technical description of design requirement document covers the requirements of the MACSTOR/KN-400 module, which is under development to densely accommodate CANDU spent fuels with more efficient way. The design requirement is for the module that will be constructed within a dry storage site after successfully licensed by the regulatory body. This temporary outdoor spent fuel dry storage facility provides for safe storage of spent nuclear fuel after it has been removed from the plant's storage pool after being allowed to decay for a period of at least 6 years. The MACSTOR/KN-400 module is being designed to the envelope of site environmental conditions encountered at the Wolsong station. The design requirements of MACSTOR/KN-400 module meets the requirements of the appropriate Codes and Standards for dry storage of spent fuel from nuclear power reactors such as lOCFR72, and Korea Atomic Energy Act and relevant technical standard.

  15. Structural design concept and static analysis of CANDU spent fuel compact dry storage system

    Energy Technology Data Exchange (ETDEWEB)

    Choi, K. S.; Yang, K. H.; Paek, C. R.; Jung, J. S.; Lee, H. Y. [Korea Hydro and Nuclear Power Company, Taejon (Korea, Republic of)

    2003-07-01

    In this study, an structural design concept on CANDU spent fuel compact dry storage system MACSTOR/KN-400 module has been established with a view to optimally design the structural members of the system. Design loads, loading combination and structural safety criteria of the module were reviewed assuming W olsung Site. The static analysis of the module showed that compressive stress concentration due to dead load and live load occurred around the center of roof slab. Maximum stress resulted from dead load is about twice as much as the stress from live load, and structural behavior of module caused by wind load was not significant. The static analysis results will have influence on the reinforcement bar design of structural members with other structural analyses.

  16. CANDU RU fuel manufacturing basic technology development and advanced fuel verification tests

    Energy Technology Data Exchange (ETDEWEB)

    Chung, Chang Hwan; Chang, S.K.; Hong, S.D. [and others

    1999-04-01

    A PHWR advanced fuel named the CANFLEX fuel has been developed through a KAERI/AECL joint Program. The KAERI made fuel bundle was tested at the KAERI Hot Test Loop for the performance verification of the bundle design. The major test activities were the fuel bundle cross-flow test, the endurance fretting/vibration test, the freon CHF test, and the fuel bundle heat-up test. KAERI also has developing a more advanced PHWR fuel, the CANFLEX-RU fuel, using recovered uranium to extend fuel burn-up in the CANDU reactors. For the purpose of proving safety of the RU handling techniques and appraising feasibility of the CANFLEX-RU fuel fabrication in near future, a physical, chemical and radiological characterization of the RU powder and pellets was performed. (author). 54 refs., 46 tabs., 62 figs.

  17. The Application of Advancements in Computer Technology to the Control and Safety System of CANDU Reactors

    Energy Technology Data Exchange (ETDEWEB)

    Chan, P. S. W. [AECL CANDU/Sheridan Park Research Community, Ontario (Canada)

    1992-04-15

    The present spatial control algorithm in CANDU reactors is based on flux synthesis from a set of parti-coloured harmonic flux modes. The design of the Rop system is also based on parti-coloured flux shapes, including both normal and abnormal reactor operating conditions. The dependency of the control and safety systems on parti-coloured data was necessitated by the slow CPU and by the scarcity of Ram which were available to the computer systems in the early seventies. Recent advancements in high speed microprocessors and high capacity Ram chips enable the development of the Pmfp computer code, which calculates reactor power distribution on-line, using diffusion theory and in-core self-powered flux detector readings as internal boundary conditions. The Pmfp based control and safety systems do not depend on parti-coloured flux shapes or preconceived reactor operating conditions.

  18. Radionuclide Release after End Fitting Failure Accident in CANDU-6 Plant

    Energy Technology Data Exchange (ETDEWEB)

    Choi, Hoon; Kim, Yun Ho; Lee, Kwang Ho [Korea Electric Power Corporation Research Institute, Daejeon (Korea, Republic of)

    2010-10-15

    The total amount of mass and energy discharged into containment building from primary heat transport system in the event of end fitting failure accident in CANDU-6 plant is similar to that of small loss of coolant accident. But the ejection of fuel bundles into fuelling machine room is unique phenomenon and causes radio nuclides release from the physically broken fuel rod to outside containment building. The only objective of containment behavior analysis for end fitting failure event is to assess the amount of radio nuclides release to the ambient atmosphere. Radionuclide release rates in case of end fitting failure with all safety system available, that is containment building is intact, as well as with containment system impairment are analyzed with GOTHIC and SMART code

  19. Optimisation de la gestion du combustible dans les reacteurs CANDU refroidis a l'eau legere

    Science.gov (United States)

    Chambon, Richard

    This research has two main goals. First, we wanted to introduce optimization tools in the diffusion code DONJON, mostly for fuel management. The second objective is more practical. The optimization capabilities are applied to the fuel management problem for different CANDU reactors at refueling equilibrium state. Two kinds of approaches are considered and implemented in this study to solve optimization problems in the code DONJON. The first methods are based on gradients and on the quasi-linear mathematical programming. The method initially developed in the code OPTEX is implemented as a reference approach for the gradient based methods. However, this approach has a major drawback. Indeed, the starting point has to be a feasible point. Then, several approaches have been developed to be more general and not limited by the initial point choice. Among the different methods we developed, two were found to be very efficient: the multi-step method and the mixte method. The second kind of approach are the meta-heuristic methods. We implemented the tabu search method. Initially, it was designed to optimize combinatory variable problems. However, we successfully used it for continuous variables. The major advantage of the tabu method over the gradient methods is the capability to exit from local minima. Optimisation of the average exit burnup has been performed for CANDU-6 and ACR-700 reactors. The fresh fuel enrichment has also been optimized for ACR-700. Results match very well what the reactor physics can predict. Moreover, a comparison of the two totally different types of optimization methods validated the results we obtained.

  20. Seismic Soil-Structure Interaction Analysis of a Consolidated Dry Storage Module for CANDU Spent Fuels

    Energy Technology Data Exchange (ETDEWEB)

    Kang, Young Gon; Yoon, Jeong Hyoun; Cho, Chun Hyung; Lee, Heung Young [Korea Hydro and Nuclear Power Co., Ltd., Taejon (Korea, Republic of); Choi, Kyu Sup; Jeong, In Su; Kim, Jong Soo [KONES Co., Seoul (Korea, Republic of)

    2005-07-01

    The MACSTOR/KN-400 module has been developed as an effective alternative to the existing stand alone concrete canister for dry storage of CANDU spent fuel. The structure is a concrete monolith of 21.67 m long and 12.66 m wide and has a height equal to 7.518 m including the bottom slab. Inside of the concrete module are built 40 storage cylinders accommodating ten 60- bundle dry storage baskets, which are suspended from the top slab and eventually constrained at 10 cm above the bottom slab with horizontal seismic restraints. The main cooling process of the MACSTOR/KN-400 module is by air convection through air inlets and outlets. The civil design parameters, with respect to meteorological and seismic loads applied to the module are identical to those specified for the Wolsung CANDU 3 and 4 plants except for local geologic characteristics. As per USNRC SRP Section 3.7.2 and current US practices, Soil-Structure Interaction (SSI) effect shall be considered for all structures not supported by a rock or rock-like soil foundation materials. An SSI is a very complicated phenomenon of the structure coupled with the soil medium that is usually semi-infinite in extent and highly nonlinear in its behavior. And the effect of the SSI is noticeable especially for stiff and massive structures resting on relatively soft ground. Thus the SSI effect has to be considered in the seismic design of MACSTOR/KN-400 module resting on soil medium. The scope of the this paper is to carry out a seismic SSI analysis of the MACSTOR/KN-400 module, in order to show how much the SSI gives an effect on the structural responses by comparing with the fixed-base analysis.

  1. Update on use of AECL's MACSTOR module at CANDU 6 stations

    Energy Technology Data Exchange (ETDEWEB)

    Beaudoin, R.; Moussalam, G.; Kachef, I. [Atomic Energy of Canada Limited, Montreal, Quebec (Canada)

    2006-07-01

    AECL has contributed to the technology development and implementation of dry spent fuel management facilities in Canada and internationally over the last three decades. During that period, AECL has designed a number of concrete canister models and the MACSTOR module; a medium size air-cooled vault. AECL's dry storage technology was used in Canada, Korea and Romania for the construction of eight large-scale above ground dry storage facilities for CANDU spent fuel. These projects add up to a constructed capacity in excess of 5,000 MgU, that represents a significant share of the total worldwide dry storage capacity. This paper describes basic research and technology developments made at AECL's facilities to develop those dry storage technologies for its own reactors and for the operating CANDU 6 reactors. The current operating status of the facilities using concrete canisters is provided. A description of the MACSTOR 200 modules each having a capacity of 228 MgU that is in use at the Gentilly 2 and Cernavoda stations is provided. The Cernavoda spent fuel management facility was commissioned in 2003. The organisational, licensing, equipment supply and construction aspects that were necessary to deliver this turnkey project by AECL and its Romanian partners in 25 months are described. The paper also provides an outline of the joint program between AECL and KHNP-NETEC to develop the new MACSTOR/KN-400 and provides a description of this module having a capacity of 456 MgU (thus twice the MACSTOR 200 capacity) to be deployed by 2007 at the Wolsong site in Korea. (author)

  2. Analysis of Moderator System Failure Accidents by Using New Method for Wolsong-1 CANDU 6 Reactor

    Energy Technology Data Exchange (ETDEWEB)

    Jin, Dongsik; Kim, Jonghyun; Cho, Cheonhwey [Atomic Creative Technology Co., Ltd., Daejeon (Korea, Republic of); Kim, Sungmin [Korea Hydro and Nuclear Power Co., Ltd., Daejeon (Korea, Republic of)

    2013-05-15

    To reconfirm the safety of moderator system failure accidents, the safety analysis by using the reactor physics code, RFSP-IST, coupled with the thermal hydraulics code, CATHENA is performed additionally. In the present paper, the newly developed analysis method is briefly described and the results obtained from the moderator system failure accident simulations for Wolsong-1 CANDU 6 reactor by using the new method are summarized. The safety analysis of the moderator system failure accidents for Wolsong-1 CANDU 6 reactor was carried out by using the new code system, i. e., CATHENA and RFSP-IST, instead of the non-IST old codes, namely, SMOKIN G-2 and MODSTBOIL. The analysis results by using the new method revealed as same with the results by using the old method that the fuel integrity is warranted because the localized power peak remained well below the limits and, most importantly, the reactor operation enters into the self-shutdown mode due to the substantial loss of moderator D{sub 2}O inventory from the moderator system. In the analysis results obtained by using the old method, it was predicted that the ROP trip conditions occurred for the transient cases which are also studied in the present paper. But, in the new method, it was found that the ROP trip conditions did not occur. Consequently, in the safety analysis performed additionally by using the new method, the safety of moderator system failure accidents was reassured. In the future, the new analysis method by using the IST codes instead of the non-IST old codes for the moderator system failure accidents is strongly recommended.

  3. Fitness for service assessment of degraded CANDU feeder piping-Canadian regulatory expectations

    Energy Technology Data Exchange (ETDEWEB)

    Jin, John C., E-mail: john.jin@cnsc-ccsn.gc.c [Operational Engineering Assessment Div., Canadian Nuclear Safety Commission (Canada); Awad, Raoul [Operational Engineering Assessment Div., Canadian Nuclear Safety Commission (Canada)

    2011-03-15

    Allowance for the continued operation of feeder piping at some Canadian CANDU stations, which is experiencing active degradation mechanisms, has been based primarily on augmented inspection practices and conservative fitness for service assessments. The major degradation mechanisms identified to date are: pipe wall thinning due to Flow Accelerated Corrosion (FAC) and service induced cracking due to Intergranular Cracking due to Stress Corrosion Cracking (SCC) and potentially Low Temperature Creep Cracking (LTCC) mechanisms. Given that currently available industry codes and standards do not provide sufficient guidelines/criteria for assessing the degradation of feeder pipes, the Canadian Nuclear Safety Commission (CNSC) has asked the utilities to establish feeder pipe specific procedures to provide reasonable assurance that the risk associated with the feeder degradation is maintained at an acceptably low level. In response to this requirement, the Canadian CANDU industry has developed and continued to update feeder fitness for service guidelines to provide evaluation procedures and industry standard acceptance criteria for assessing the structural integrity of the feeder pipes. The scope and frequency of inspections are determined based on the results of the fitness for service assessments taking into account the relative susceptibility of feeder pipes to each specific degradation mechanism. While industry practices for the management of degraded feeder pipes have, in general, been complied with the regulatory expectations, outstanding issues still remain. Major regulatory concerns include uncertainties associated with limitations in both the inspection techniques and the mechanistic understanding of the degradation processes, which can impede inspection planning and fitness for service assessments. This paper presents the regulator's view of the current situation with respect to degradation of feeder piping, its implications for nuclear safety and the

  4. Path Sensitization

    Institute of Scientific and Technical Information of China (English)

    赵著行; 闵应骅; 等

    1997-01-01

    For different delay models,the concept of sensitization can be very different.Traditonal concepts of sensitization cannot precisely describe circuit behavior when the input vectors change very fast.Using Boolean process aporoach,this paper presents a new definition of sensitization for arbitrary input waveforms.By this new concept it is found that if the inputs of a combinational circuit can change at any time,and each gate's delay varies within an interval (bounded gate delay model),then every path,which is not necessarily a single topological path,is sensitizable.From the experimental results it can be seen that,all nonsensitizable paths for traditional concepts actually can propagate transitions along them for some input waveforms.However,specified time between input transitions(STBIT) and minimum permissible pulse width(ε)are two major factors to make some paths non-sensitizable.

  5. Fast paths in large-scale dynamic road networks

    CERN Document Server

    Nannicini, Giacomo; Barbier, Gilles; Krob, Daniel; Liberti, Leo

    2007-01-01

    Efficiently computing fast paths in large scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by several traffic information service providers who wish to offer a realistic fast path computation to GPS terminal enabled vehicles. The heuristic solution method we propose is based on a highway hierarchy-based shortest path algorithm for static large-scale networks; we maintain a static highway hierarchy and perform each query on the dynamically evaluated network.

  6. A New Algorithm for Distributed Control Problem with Shortest-Distance Constraints

    Directory of Open Access Journals (Sweden)

    Yu Zhou

    2016-01-01

    Full Text Available This paper investigates the distributed shortest-distance problem of multiagent systems where agents satisfy the same continuous-time dynamics. The objective of multiagent systems is to find a common point for all agents to minimize the sum of the distances from each agent to its corresponding convex region. A distributed consensus algorithm is proposed based on local information. A sufficient condition also is given to guarantee the consensus. The simulation example shows that the distributed shortest-distance consensus algorithm is effective for our theoretical results.

  7. Global path planning approach based on ant colony optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    WEN Zhi-qiang; CAI Zi-xing

    2006-01-01

    Ant colony optimization (ACO) algorithm was modified to optimize the global path. In order to simulate the real ant colonies, according to the foraging behavior of ant colonies and the characteristic of food, conceptions of neighboring area and smell area were presented. The former can ensure the diversity of paths and the latter ensures that each ant can reach the goal. Then the whole path was divided into three parts and ACO was used to search the second part path. When the three parts pathes were adjusted,the final path was found. The valid path and invalid path were defined to ensure the path valid. Finally, the strategies of the pheromone search were applied to search the optimum path. However, when only the pheromone was used to search the optimum path, ACO converges easily. In order to avoid this premature convergence, combining pheromone search and random search, a hybrid ant colony algorithm(HACO) was used to find the optimum path. The comparison between ACO and HACO shows that HACO can be used to find the shortest path.

  8. Quickest Paths in Simulations of Pedestrians

    CERN Document Server

    Kretz, Tobias; Hengst, Stefan; Kautzsch, Lukas; Pohlmann, Andrej; Vortisch, Peter

    2011-01-01

    This contribution proposes a method to make agents in a microscopic simulation of pedestrian traffic walk approximately along a path of estimated minimal remaining travel time to their destination. Usually models of pedestrian dynamics are (implicitly) built on the assumption that pedestrians walk along the shortest path. Model elements formulated to make pedestrians locally avoid collisions and intrusion into personal space do not produce motion on quickest paths. Therefore a special model element is needed, if one wants to model and simulate pedestrians for whom travel time matters most (e.g. travelers in a station hall who are late for a train). Here such a model element is proposed, discussed and used within the Social Force Model.

  9. Measurement of Velocity and Temperature Profiles in the 1/40 Scaled-Down CANDU-6 Moderator Tank

    Directory of Open Access Journals (Sweden)

    Hyoung Tae Kim

    2015-01-01

    Full Text Available In order to simulate the CANDU-6 moderator circulation phenomena during steady state operating and accident conditions, a scaled-down moderator test facility has been constructed at Korea Atomic Energy Institute (KAERI. In the present work an experiment using a 1/40 scaled-down moderator tank has been performed to identify the potential problems of the flow visualization and measurement in the scaled-down moderator test facility. With a transparent moderator tank model, a flow field is visualized with a particle image velocimetry (PIV technique under an isothermal state, and the temperature field is measured using a laser induced fluorescence (LIF technique. A preliminary CFD analysis is also performed to find out the flow, thermal, and heating boundary conditions with which the various flow patterns expected in the prototype CANDU-6 moderator tank can be reproduced in the experiment.

  10. A comprehensive model for in-plane and out-of-plane vibration of CANDU fuel endplate rings

    Energy Technology Data Exchange (ETDEWEB)

    Yu, S.D., E-mail: syu@ryerson.ca; Fadaee, M.

    2016-08-01

    Highlights: • Proposed an effective method for modelling bending and torsional vibration of CANDU fuel endplate rings. • Applied successfully the thick plate theory to curved structural members by accounting for the transverse shear effect. • The proposed method is computationally more efficient compared to the 3D finite element. - Abstract: In this paper, a comprehensive vibration model is developed for analysing in-plane and out-of-plane vibration of CANDU fuel endplate rings by taking into consideration the effects of in-plane extension in the circumferential and radial directions, shear, and rotatory inertia. The model is based on Reddy’s thick plate theory and the nine-node isoparametric Lagrangian plate finite elements. Natural frequencies of various modes of vibration of circular rings obtained using the proposed method are compared with 3D finite element results, experimental data and results available in the literature. Excellent agreement was achieved.

  11. Optimizing in-bay fuel inspection capability to meet the needs of today's CANDU fleet

    Energy Technology Data Exchange (ETDEWEB)

    St-Pierre, J., E-mail: joe.st-pierre@amec.com [AMEC NSS, Toronto, Ontario (Canada); Simons, B. [Stern Laboratories Incorporated, Hamilton, Ontario (Canada)

    2013-07-01

    With the recent return to service of many CANDU units, aging of all others, increasingly competitive energy market and aging hot cell infrastructure - there exists now a greater need for timely, cost-effective and reliable collection of irradiated fuel performance information from fuel bay inspections. The recent development of simple in-bay tools, used in combination with standardized technical specifications, inspection databases and assessment techniques, allows utilities to characterize the condition of irradiated fuel and any debris lodged in the bundle in a more timely fashion and more economically than ever. Use of these tools and 'advanced' techniques permits timely engineering review and disposition of emerging issues to support reliable operation of the CANDU fleet. (author)

  12. Performance Analysis of Enhanced Interior Gateway Routing Protocol (EIGRP Over Open Shortest Path First (OSPF Protocol with Opnet

    Directory of Open Access Journals (Sweden)

    Anibrika Bright Selorm Kodzo

    2016-05-01

    Full Text Available Due to the increase in the easy accessibility of computers and mobile phones alike, routing has become indispensable in deciding how computes communicate especially modern computer communication networks. This paper presents performance analysis between EIGRP and OSPFP for real time applications using Optimized Network Engineering Tool (OPNET. In order to evaluate OSPF and EIGRP’s performance, three network models were designed where 1st, 2nd and 3rd network models are configured respectively with OSPF, EIGRP and a combination of EIGRP and OSPF. Evaluation of the proposed routing protocols was performed based on quantitative metrics such as Convergence Time, Jitter, End-to-End delay, Throughput and Packet Loss through the simulated network models. The evaluation results showed that EIGRP protocol provides a better performance than OSPF routing protocol for real time applications. By examining the results (convergence times in particular, the results of simulating the various scenarios identified the routing protocol with the best performance for a large, realistic and scalable network.

  13. Shortest Dijkstra Path Routing Algorithm in WOBAN%WOBAN中最短路径Dijkstra路由算法

    Institute of Scientific and Technical Information of China (English)

    马应平; 柯赓; 曹文婷

    2012-01-01

    光纤无线宽带混合接入网(WOBAN)是一种新型的具有前景的混合接入网,通过改进其无线端网络的路由算法能够有效克服WOBAN的瓶颈限制。最小跳路由算法(MHRA)和最小时延路由算法(MDRA)是将Diikstra算法应用在WOBAN前端无线Mesh网(WMN)中的新型路由算法,低负载情况下两算法性能相近,高负载情况下MDRA具有更好的网络性能。通过仿真比较,高负载情况下MDRA的时延和TDR性能明显优于MHRA。%The hybrid Wireless-Optical Broadband Access Network (WOBAN) is a promis- ing architecture for future access networks. The characteristics of the Minimum Delay Routing Algorithm (MDRA) and Dijkstra Minimum Hop Routing Algorithm (MHRA) in the wireless front-end of a WOBAN were investigated. Our performance studies show that MDRA has the similar performance with the MHRA in the situation of low load, while it acts shorter delay and higher TDR than MHRA in the situation of high load.

  14. Autonomous Control of Eye Based Electric Wheel Chair with Obstacle Avoidance and Shortest Path Findings Based on Dijkstra Algorithm

    Directory of Open Access Journals (Sweden)

    Kohei Arai

    2011-12-01

    Full Text Available Autonomous Eye Based Electric Wheel Chair: EBEWC control system which allows handicap person (user to control their EWC with their eyes only is proposed. Using EBEWC, user can move to anywhere they want on a same floor in a hospital autonomously with obstacle avoidance with visible camera and ultrasonic sensor. User also can control EBEWC by their eyes. The most appropriate route has to be determined with avoiding obstacles and then autonomous real time control has to be done. Such these processing time and autonomous obstacle avoidance together with the most appropriate route determination are important for the proposed EBEWC. All the required performances are evaluated and validated. Obstacles can be avoided using acquired images with forward looking camera. The proposed EBEWC system allows creation of floor layout map that contains obstacles locations in a real time basis. The created and updated maps can be share by the electric wheel chairs on a same floor of a hospital. Experimental data show that the system allows computer input (more than 80 keys almost perfectly and electric wheel chair can be controlled with human eyes-only safely.

  15. Large-break loss-of-coolant accident phenomena identification and ranking table (PIRT) for the advanced Candu reactor

    Energy Technology Data Exchange (ETDEWEB)

    Popov, N.; Snell, V.G.; Sills, H.E.; Langman, V.J.; Boyack, B. [Atomic Energy of Canada Ltd (Canada)

    2004-07-01

    The Advanced Candu Reactor (ACR) is an evolutionary advancement of the current Candu-6 reactor, aimed at producing electrical power for a capital cost and unit-energy cost significantly less than that of current reactor designs. The ACR retains the modular concept of horizontal fuel channels surrounded by heavy water moderator, as with all Candu reactors. However, ACR uses slightly enriched uranium (SEU) fuel, compared to the natural uranium used in Candu 6. This achieves the twin goals of improved economics (e.g., via reductions in the heavy water requirements and the use of a light water coolant), as well as improved safety. This paper is focused on the double-ended guillotine critical inlet header break (CRIHB) loss-of-coolant accident (LOCA) in an ACR reactor, which is considered as a large break LOCA. Large Break LOCA in water-cooled reactors has been used historically as a design basis event by regulators, and it has attracted a very large share of safety analysis and regulatory review. The LBLOCA event covers a wide range of system behaviours and fundamental phenomena. The Phenomena Identification and Ranking Table (PIRT) for LBLOCA therefore provides a good understanding of many of the safety characteristics of the ACR design. The paper outlines the design characteristics of the ACR reactor that impact the PIRT process and computer code applicability. It also describes the LOCA phenomena, lists all components and systems that have an important role during the event, discusses the PIRT process and results, and presents the final PIRT summary table. (authors)

  16. Path planning under spatial uncertainty.

    Science.gov (United States)

    Wiener, Jan M; Lafon, Matthieu; Berthoz, Alain

    2008-04-01

    In this article, we present experiments studying path planning under spatial uncertainties. In the main experiment, the participants' task was to navigate the shortest possible path to find an object hidden in one of four places and to bring it to the final destination. The probability of finding the object (probability matrix) was different for each of the four places and varied between conditions. Givensuch uncertainties about the object's location, planning a single path is not sufficient. Participants had to generate multiple consecutive plans (metaplans)--for example: If the object is found in A, proceed to the destination; if the object is not found, proceed to B; and so on. The optimal solution depends on the specific probability matrix. In each condition, participants learned a different probability matrix and were then asked to report the optimal metaplan. Results demonstrate effective integration of the probabilistic information about the object's location during planning. We present a hierarchical planning scheme that could account for participants' behavior, as well as for systematic errors and differences between conditions.

  17. A study on the direct use of spent PWR fuel in CANDU reactors -Fuel management and safety analysis-

    Energy Technology Data Exchange (ETDEWEB)

    Park, Hyun Soo; Lee, Boh Wook; Choi, Hang Bok; Lee, Yung Wook; Cho, Jae Sun; Huh, Chang Wook [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1995-07-01

    The reference DUPIC fuel composition was determined based on the reactor safety, thermal-hydraulics, economics, and refabrication aspects. The center pin of the reference DUPIC fuel bundle is poisoned with natural dysprosium. The worst LOCA analysis has shown that the transient power and heat deposition of the reference DUPIC core are the same as those of natural uranium CANDU core. The intra-code comparison has shown that the accuracy of DUPIC physics code system is comparable to the current CANDU core design code system. The sensitivity studies were performed for the refuelling schemes of DUPIC core and the 2-bundle shift refuelling scheme was selected as the standard refuelling scheme of the DUPIC core. The application of 4-bundle shift refuelling scheme will be studied in parallel as the auto-refuelling method is improved and the reference core parameters of the heterogeneous DUPIC core are defined. The heterogeneity effect was analyzed in a preliminary fashion using 33 fuel types and the random loading strategy. The refuelling simulation has shown that the DUPIC core satisfies the current CANDU 6 operating limits of channel and bundle power regardless of the fuel composition heterogeneity. The 33 fuel types used in the heterogeneity analysis was determined based on the initial enrichment and discharge burnup of the PWR fuel. 90 figs, 62 tabs, 63 refs. (Author).

  18. SARAPAN—A Simulated-Annealing-Based Tool to Generate Random Patterned-Channel-Age in CANDU Fuel Management Analyses

    Directory of Open Access Journals (Sweden)

    Doddy Kastanya

    2017-02-01

    Full Text Available In any reactor physics analysis, the instantaneous power distribution in the core can be calculated when the actual bundle-wise burnup distribution is known. Considering the fact that CANDU (Canada Deuterium Uranium utilizes on-power refueling to compensate for the reduction of reactivity due to fuel burnup, in the CANDU fuel management analysis, snapshots of power and burnup distributions can be obtained by simulating and tracking the reactor operation over an extended period using various tools such as the *SIMULATE module of the Reactor Fueling Simulation Program (RFSP code. However, for some studies, such as an evaluation of a conceptual design of a next-generation CANDU reactor, the preferred approach to obtain a snapshot of the power distribution in the core is based on the patterned-channel-age model implemented in the *INSTANTAN module of the RFSP code. The objective of this approach is to obtain a representative snapshot of core conditions quickly. At present, such patterns could be generated by using a program called RANDIS, which is implemented within the *INSTANTAN module. In this work, we present an alternative approach to derive the patterned-channel-age model where a simulated-annealing-based algorithm is used to find such patterns, which produce reasonable power distributions.

  19. Path Dependence

    DEFF Research Database (Denmark)

    Madsen, Mogens Ove

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

  20. Neural network and genetic algorithm based global path planning in a static environment

    Institute of Scientific and Technical Information of China (English)

    DU Xin; CHEN Hua-hua; GU Wei-kang

    2005-01-01

    Mobile robot global path planning in a static environment is an important problem. The paper proposes a method of global path planning based on neural network and genetic algorithm. We constructed the neural network model of environmental information in the workspace for a robot and used this model to establish the relationship between a collision avoidance path and the output of the model. Then the two-dimensional coding for the path via-points was converted to one-dimensional one and the fitness of both the collision avoidance path and the shortest distance are integrated into a fitness function. The simulation results showed that the proposed method is correct and effective.

  1. Challenging of path planning algorithms for autonomous robot in known environment

    Science.gov (United States)

    Farah, R. N.; Irwan, N.; Zuraida, Raja Lailatul; Shaharum, Umairah; Hanafi@Omar, Hafiz Mohd

    2014-06-01

    Most of the mobile robot path planning is estimated to reach its predetermined aim through the shortest path and avoiding the obstacles. This paper is a survey on path planning algorithms of various current research and existing system of Unmanned Ground Vehicles (UGV) where their challenging issues to be intelligent autonomous robot. The focuses are some short reviews on individual papers for UGV in the known environment. Methods and algorithms in path planning for the autonomous robot had been discussed. From the reviews, we obtained that the algorithms proposed are appropriate for some cases such as single or multiple obstacles, static or movement obstacle and optimal shortest path. This paper also describes some pros and cons for every reviewed paper toward algorithms improvement for further work.

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

    NARCIS (Netherlands)

    Dessing, D.; Vries, S.I. (Sanne); Hegeman, G.; 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 r

  3. COMPUTER REALIZATION OF SEARCH TASK OF THE SHORTEST ROUTE WITH THE HELP OF EXCEL AND VBA

    OpenAIRE

    2008-01-01

    The necessity of the development of simple and accessible to the final users of the applied software for the decision of local optimization tasks of transport technologies has been grounded with the help of the Excel and VBA facilities. The computer task decision and search of the shortest route has been described.

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

  5. Probabilistic fracture mechanics applied for DHC assessment in the cool-down transients for CANDU pressure tubes

    Energy Technology Data Exchange (ETDEWEB)

    Radu, Vasile, E-mail: vasile.radu@nuclear.ro [Institute for Nuclear Research Pitesti, 1st Campului Street, 115400 Mioveni, Arges, P.O. Box 78, Mioveni (Romania); Roth, Maria [Institute for Nuclear Research Pitesti, 1st Campului Street, 115400 Mioveni, Arges, P.O. Box 78, Mioveni (Romania)

    2012-12-15

    For CANDU pressure tubes made from Zr-2.5%Nb alloy, the mechanism called delayed hydride cracking (DHC) is widely recognized as main mechanism responsible for crack initiation and propagation in the pipe wall. Generation of some blunt flaws at the inner pressure tube surface during refueling by fuel bundle bearing pad or by debris fretting, combined with hydrogen/deuterium up-take (20-40 ppm) from normal corrosion process with coolant, may lead to crack initiation and growth. The process is governed by hydrogen hysteresis of terminal solid solubility limits in Zirconium and the diffusion of hydrogen atoms in the stress gradient near to a stress spot (flaw). Creep and irradiation growth under normal operating conditions promote the specific mechanisms for Zirconium alloys, which result in circumferential expansion, accompanied by wall thinning and length increasing. These complicate damage mechanisms in the case of CANDU pressure tubes that are also are affected by irradiation environment in the reactor core. The structural integrity assessment of CANDU fuel channels is based on the technical requirements and methodology stated in the Canadian Standard N285.8. Usually it works with fracture mechanics principles in a deterministic manner. However, there are inherent uncertainties from the in-service inspection, which are associated with those from material properties determination; therefore a necessary conservatism in deterministic evaluation should be used. Probabilistic approach, based on fracture mechanics principle and appropriate limit state functions defined as fracture criteria, appears as a promising complementary way to evaluate structural integrity of CANDU pressure tubes. To perform this, one has to account for the uncertainties that are associated with the main parameters for pressure tube assessment, such as: flaws distribution and sizing, initial hydrogen concentration, fracture toughness, DHC rate and dimensional changes induced by long term

  6. Isothermal flow measurement using planar PIV in the 1/4 scaled model of CANDU reactor

    Energy Technology Data Exchange (ETDEWEB)

    Im, Sunghyuk; Sung, Hyung Jin [KAIST, Daejeon (Korea, Republic of); Seo, Han; Bang, In Cheol [UNIST, Ulsan (Korea, Republic of); Kim, Hyoung Tae [KAERI, Daejeon (Korea, Republic of)

    2015-05-15

    The local temperature of the moderator is a key parameter in determining the available subcooling. To predict the flow field and local temperature distribution in the calandria, Korea Atomic Energy Research Institute (KAERI) started the experimental research on moderator circulation as one of a national R and D research programs from 2012. This research program includes the construction of the Moderator Circulation Test (MCT) facility, production of the validation data for self-reliant CFD tools, and development of optical measurement system using the Particle Image Velocimetry (PIV) and Laser Induced Fluorescence (LIF) techniques. Small-scale 1/40 and 1/8 small-scale model tests were performed prior to installation of the main MCT facility to identify the potential problems of the flow visualization and measurement expected in the 1/4 scale MCT facility. In the 1/40 scale test, a flow field was measured with a PIV measurement technique under an iso-thermal state, and the temperature field was visualized using a LIF technique. In this experiment, the key point was to illuminate the region of interest as uniformly as possible since the velocity and temperature fields in the shadow regions were distorted and unphysical. In the 1/8 scale test, the flow patterns from the inlet nozzles to the top region of the tank were investigated using PIV measurement at two different positions of the inlet nozzle. For each position of laser beam exposure the measurement sections were divided to 7 groups to overcome the limitation of the laser power to cover the relatively large test section. The MCT facility is the large-scale facility designed to reproduce the important characteristics of moderator circulation in a CANDU6 calandria under a range of operating conditions. It is reduced in a 1/4 scale and a moderator test vessel is built to the specifications of the CANDU6 reactor design, where a working fluid is sub-cooled water with atmospheric pressure. Previous studies were

  7. Evaluation of safety margins during dry storage of CANDU fuel in MACSTOR/KN-400 module

    Energy Technology Data Exchange (ETDEWEB)

    Beaudoin, R.; Shill, R. [Atomic Energy of Canada Limited, Montreal, Quebec (Canada); Lee, K.-H.; Chung, S.-H.; Yoon, J.-H.; Choi, B.-I.; Lee, H.-Y.; Song, M.-J. [KHNP, Nuclear Environment Technology Inst., Taejon (Korea, Republic of)

    2004-07-01

    This paper covers an evaluation of the available safety margin against fuel bundle degradation during dry storage of CANDU spent fuel bundles in a MACSTOR/KN-400 module, considering normal, off-normal and postulated accidental conditions. Korea Hydro and Nuclear Power (KHNP), in collaboration with Atomic Energy of Canada Limited (AECL), are developing a new module for the dry storage of spent fuel from the four CANDU 6 nuclear reactors at the Wolsong site in South Korea. The module provides the benefit of occupying significantly less area than the concrete canisters presently used. The modules are designed for a minimum service life of 50 years. During that period, the spent fuel bundles shall be safely stored. This imposes that failure of a fuel bundle element or unacceptable degradation of an existing defect (from reactor operation) does not occur during the dry storage period. The fuel bundles are stored in an air-filled fuel basket that releases 365 Watts on average and a maximum of 390 Watts when rare fuel loading conditions are postulated. In addition, specific accidental air flow cooling conditions are postulated that consist of 100% blockage of all air inlets on one side of the module. These conditions can generate a peak daily fuel temperature of up to 155{sup o}C during a reference hot summer day during the first year of operation. The fuel temperature decreases over the years and also fluctuates due to daily and seasonal temperature variations. At this temperature, fuel elements with intact Zircaloy sheathing will not experience damage. However, for the few fuel bundle elements that are non-leaktight (less than 1 per 37,000), some re-oxidation of UO{sub 2} into higher oxides such as U{sub 3}O{sub 7} / U{sub 4}O{sub 9} and U{sub 3}O{sub 8} will occur. This latter form of Uranium oxide is undesirable due to its lower density that results in a volumetric increase of the pellet that can overstress the fuel element sheathing. The level of fuel pellet

  8. Path Creation

    DEFF Research Database (Denmark)

    Karnøe, Peter; Garud, Raghu

    2012-01-01

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

  9. Overview of methods to increase dryout power in CANDU fuel bundles

    Energy Technology Data Exchange (ETDEWEB)

    Groeneveld, D.C., E-mail: degroeneveld@gmail.com [Chalk River Laboratories, AECL, Chalk River (Canada); University of Ottawa, Department of Mechanical Engineering, Ottawa (Canada); Leung, L.K.H. [Chalk River Laboratories, AECL, Chalk River (Canada); Park, J.H. [Korean Atomic Energy Research Institute, Daejeon (Korea, Republic of)

    2015-06-15

    Highlights: • Small changes in bundle geometry can have noticeable effects on the bundle CHF. • Rod spacing devices can results in increases of over 200% in CHF. • CHF enhancement decays exponentially downstream from spacers. • CHF-enhancing bundle appendages also increase the post-CHF heat transfer. - Abstract: In CANDU reactors some degradation in the CCP (critical channel power, or power corresponding to the first occurrence of CHF in any fuel channel) will occur with time because of ageing effects such as pressure-tube diametral creep, increase in reactor inlet-header temperature, increased hydraulic resistance of feeders. To compensate for the ageing effects, various options for recovering the loss in CCP are described in this paper. They include: (i) increasing the bundle heated perimeter, (ii) optimizing the bundle configuration, (iii) optimizing core flow and flux distribution, (iv) reducing the bundle hydraulic resistance, (v) use of CHF-enhancing bundle appendages, (vi) more precise experimentation, and (vii) redefining CHF. The increase in CHF power has been quantified based on experiments on full-scale bundles and subchannel code predictions. The application of several of these CHF enhancement principles has been used in the development of the 43-rod CANFLEX bundle.

  10. The mode of operation of CANDU power reactor in thorium self-sufficient fuel cycle

    Directory of Open Access Journals (Sweden)

    Bergelson Boris R.

    2008-01-01

    Full Text Available This paper presents the results of calculations for CANDU reactor operation in the thorium fuel cycle. The calculations were performed to estimate feasibility of operation of a heavy-water thermal neutron power reactor in the self-sufficient thorium cycle. The parameters of the active core and the scheme of fuel reloading were considered to be the same as for the standard operation in the uranium cycle. Two modes of operation are discussed in the paper: the mode of preliminary accumulation of 233U and the mode of operation in the self-sufficient cycle. For calculations for the mode of accumulation of 233U, it was assumed that plutonium was used as the additional fissile material to provide neutrons for 233U production. Plutonium was placed in fuel channels, while 232Th was located in target channels. The maximum content of 233U in the target channels was about 13 kg/t of ThO2. This was achieved by six year irradiation. The start of reactor operation in the self-sufficient mode requires content of 233U not less than 12 kg/t. For the mode of operation in the self-sufficient cycle, it was assumed that all the channels were loaded with the identical fuel assemblies containing ThO2 and a certain amount of 233U. It was shown that the non-uniform distribution of 233U in a fuel assembly is preferable.

  11. Simulation of In-Core Dose Rates for an Offline CANDU Reactor

    Science.gov (United States)

    Gilbert, Jordan

    This thesis describes the development of a Monte Carlo simulation to predict the dose rates that will be encountered by a novel robotic inspection system for the pressure tubes of an offline CANDU reactor. Simulations were performed using the Monte Carlo N-Particle (MCNP) radiation transport code, version 6.1. The radiation fields within the reactor, even when shut down, are very high, and can cause significant damage to certain structural components and the electronics of the inspection system. Given that the robotic system will rely heavily on electronics, it is important to know the dose rates that will be encountered, in order to estimate the component lifetimes. The MCNP simulation was developed and benchmarked against information obtained from Ontario Power Generation and the Canadian Nuclear Laboratories. The benchmarking showed a good match between the simulated values and the expected values. This simulation, coupled with the accompanying user interface, represent a tool in dose field prediction that is currently unavailable. Predicted dose rates for a postulated inspection at 7 days after shutdown, with 2:5 cm of tungsten shielding around the key components, would survive for approximately 7 hours in core. This is anticipated to be enough time to perform an inspection and shows that the use of this tool can aid in designing the new inspection system.

  12. Some applications related to the structural integrity analyses of CANDU 6 pressure tubes

    Energy Technology Data Exchange (ETDEWEB)

    Radu, V.S. [Inst. for Nuclear Research Pitesti, Pitesti (Romania)]. E-mail: vradu@nuclear.ro

    2006-07-01

    The flaws found during in-service inspection of Zr-2.5%Nb CANDU pressure tubes include fuel bundle bearing pad fretting flaws and debrise fretting flaws. In-service flaws are evaluated using fitness-for-service procedures to justify continued operation of pressure tube containing the flaw. The flaw evaluation procedures address crack initiation due to Delayed Hydride Cracking (DHC) under constant loading and also address fracture initiation and plastic collapse. The paper presents some applications related to the influence of the residual hoop stresses at roll-expanded joint region into stainless steel fittings at both ends on the structural integrity evaluation in the presence of blunt flaws. Two cases of blunt flaws were considered for evaluation: fuel bundle bearing pad fretting flaws and debrise fretting flaws. The blunt flaw geometry modeling and stress-strain analyses were performed by means finite element method (FEM) with FEA-Flaw computer code. The allowable peak flaw-tip stress and the Failure Assessment Diagram (FAD) for DHC initiation criterion were used for integrity assessment for the mentioned blunt flaws. Applications are performed as part of the research program address to evaluation of the in-service inspection results of the fuel channels from Cernavoda NPP. (author)

  13. Field measurements of beta ray energy spectra in CANDU nuclear generating stations

    Energy Technology Data Exchange (ETDEWEB)

    Horowitz, Y.S. (Ben-Gurion Univ. of the Negev, Beersheba (Israel). Dept. of Physics); Hirning, C.R. (Ontario Hydro, Whitby, ON (Canada)); Yuen, P.S.; Aikens, M.S. (AECL Research, Chalk River, ON (Canada). Chalk River Labs.)

    1994-01-01

    Field measurements of beta ray energy spectra have been carried out at various locations in CANDU nuclear generating stations operated by Ontario Hydro. The beta ray energy spectrometer consists of a 5 cm diameter x 2 cm thick BC-404 plastic scintillator situated behind a 100 [mu]m thick, totally depleted, silicon detector. Photon events are rejected by requiring a coincidence between the two detectors. The spectrometer is capable of measuring electron energies from 125 keV to 3.5 MeV. Beta ray energy spectra have been measured for uncontaminated and contaminated fueling machine components, fueling machine swipes and a reactor containment vault. The degree of protection afforded by various articles of protective clothing has also been investigated for the various fueling machine components. Monte Carlo calculations have been used to estimate beta factors for 100 mg.cm[sup -2] and 240 mg.cm[sup -2] LiF-TLD chips, which are used as 'skin-and 'extremity' dosemeters in the Ontario Hydro Radiation Dosimetry Programme. (Author).

  14. Seismic fragility analysis of a CANDU containment structure for near-fault ground motions

    Energy Technology Data Exchange (ETDEWEB)

    Choi, In Kil; Choun, Young Sun; Seo, Jeong Moon; Ahn, Seong Moon [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    2005-07-01

    The R. G. 1.60 spectrum used for the seismic design of Korean nuclear power plants provides a generally conservative design basis due to its broadband nature. A survey on some of the Quaternary fault segments near Korean nuclear power plants is ongoing. It is likely that these faults will be identified as active ones. If the faults are confirmed as active ones, it will be necessary to reevaluate the seismic safety of the nuclear power plants located near these faults. The probability based scenario earthquakes were identified as near-field earthquakes. In general, the near-fault ground motion records exhibit a distinctive long period pulse like time history with very high peak velocities. These features are induced by the slip of the earthquake fault. Near-fault ground motions, which have caused much of the damage in recent major earthquakes, can be characterized by a pulse-like motion that exposes the structure to a high input energy at the beginning of the motion. It is necessary to estimate the near-fault ground motion effects on the nuclear power plant structures and components located near the faults. In this study, the seismic fragility analysis of a CANDU containment structure was performed based on the results of nonlinear dynamic time-history analyses.

  15. Nonlinear seismic behavior of a CANDU containment building subjected to near-field ground motions

    Energy Technology Data Exchange (ETDEWEB)

    Choi, In Kil; Ahn, Seong Moon; Choun, Young Sun; Seo, Jeong Moon [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    2004-07-01

    The standard response spectrum proposed by US NRC has been used as a design earthquake for the design of Korean nuclear power plant structures. A survey on some of the Quaternary fault segments near Korean nuclear power plants is ongoing. It is likely that these faults will be identified as active ones. If the faults are confirmed as active ones, it will be necessary to reevaluate the seismic safety of the nuclear power plants located near the fault. Near-fault ground motions are the ground motions that occur near an earthquake fault. In general, the near-fault ground motion records exhibit a distinctive long period pulse like time history with very high peak velocities. These features are induced by the slip of the earthquake fault. Near-fault ground motions, which have caused much of the damage in recent major earthquakes, can be characterized by a pulse-like motion that exposes the structure to a high input energy at the beginning of the motion. In this study, nonlinear dynamic time-history analyses were performed to investigate the seismic behavior of a CANDU containment structure subjected to various earthquake ground motions including the near-field ground motions.

  16. Current Status and Characterization of CANDU Spent Fuel for Geological Disposal System Design

    Energy Technology Data Exchange (ETDEWEB)

    Cho, Dong Keun; Lee, Seung Woo; Cha, Jeong Hun; Choi, Jong Won; Choi, Heui Joo [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of); Lee, Yang [SK Engineering and Construction, Seoul (Korea, Republic of)

    2008-06-15

    Inventories to be disposed of, reference turn up, and source terms for CANDU spent fuel were evaluated for geological disposal system design. The historical and projected inventory by 2040 is expected to be 14,600 MtU under the condition of 30-year lifetime for unit 1 and 40-year lifetime for other units in Wolsong site. As a result of statistical analysis for discharge burnup of the spent fuels generated by 2007, average and stand deviation revealed 6,987 MWD/MtU and 1,167, respectively. From this result, the reference burnup was determined as 8,100 MWD/MtU which covers 84% of spent fuels in total. Source terms such as nuclide concentration for a long-term safety analysis, decay heat, thermo-mechanical analysis, and radiation intensity and spectrum was characterized by using ORIGEN-ARP containing conservativeness in the aspect of decay heat up to several thousand years. The results from this study will be useful for the design of storage and disposal facilities.

  17. Simulation of transient heat transfer in MACSTOR/KN-400 module storing irradiated CANDU fuel

    Energy Technology Data Exchange (ETDEWEB)

    Sabourin, G. [Atomic Energy of Canada Limited, Montreal, Quebec (Canada); Lee, K.-H.; Yoon, J.-H.; Choi, B.-I.; Lee, H.-Y.; Song, M.-J. [KHNP, Nuclear Environment Technology Inst., Taejon (Korea, Republic of)

    2004-07-01

    Korea Hydro and Nuclear Power (KHNP), in collaboration with Atomic Energy of Canada Limited (AECL), are developing a new module for the dry storage of spent fuel from the four CANDU 6 nuclear reactors at the Wolsong site in South Korea, the MACSTOR/KN-400. The simulation of transient conditions for AECL's spent fuel dry storage systems, presented in this paper, has not been performed before and is considered a major achievement of the present work. In a fist step, CATHENA was compared to MACSTOR-200 temperature measurements and the accuracy of the results were very good. In a second step, CATHENA was applied to the MACSTOR/KN-400. Four cases were performed for the MACSTOR/KN-400: Off-normal cases in summer and winter and reduced air flow cases in summer and winter. The maximum local concrete temperatures were predicted to be 63{sup o}C for the off-normal case and 65{sup o}C in the reduced air flow case. The maximum temperature gradients in the concrete are predicted to be 28{sup o}C for the off-normal case and 30{sup o}C in the reduced air flow case, incorporating a 3{sup o}C uncertainty. This paper shows that the maximum temperature for the module is expected to meet the temperature limitations of appropriate standards. (author)

  18. Drop Test of the Candu Spent Fuel Storage Basket in MACSTOR/KN-400

    Energy Technology Data Exchange (ETDEWEB)

    Choi, W.S.; Jeon, J.Y.; Seo, K.S. [KAERI, 1045 Daedeokdaero, Yuseong, Daejeon, 305-353 (Korea, Republic of); Park, J.E.; Yoo, G.S.; Park, W.G. [Korea Hydro Nuclear Power - KHNP (Korea, Republic of)

    2009-06-15

    The MACSTOR/KN-400 of Wolsung power plant in Korea is a dry interim storage facilities. There are 400 long slender cylinders in MACSTOR/KN-400. In one cylinder, ten baskets where Candu spent fuels are loaded are stacked and stored. For this MACSTOR/KN-400 facilities, analyses and tests for the hypothetical accident conditions that might happen during moving and storing baskets into a cylinder were performed. The hypothetical accident conditions to be considered are two cases. One is the case of basket dropping onto the bottom plate of a cylinder. The other is the case of basket dropping onto the other basket top plate stored in the cylinder. For the drop analyses, the case of hanging cylinder and the case of cylinder on the unyielding target surface were considered. Based on the dropping analysis, testing condition was determined as the latter case that is for the cylinder on the target surface. In a basket, 60 dummy fuel bundles are loaded which have the same weight of real spent fuel bundles. On the external surface of the basket, 8 strain gauges and 4 accelerometers were attached for the data acquisition. In order to measure the velocity when a basket impacts, three different devices were utilized. And the impact velocity results were compared and cross-checked. After the dropping tests, helium leak tests were conducted to evaluate the leakage rate. (authors)

  19. Heat transfer analysis of the MACSTOR/KN-400 storage module for CANDU spent fuel

    Energy Technology Data Exchange (ETDEWEB)

    Lee, K. H.; Youn, J. H.; Choi, B. I.; Lee, H. Y. [Nuclear Environment Technology Institute, Taejon (Korea, Republic of)

    2003-10-01

    It was verified through heat transfer analysis that a consolidated dry storage system for CANDU spent fuel, MACSTOR/KN-400 was safe in thermal aspect. In order to validate the computer code of CATHENA which was employed to perform the analysis, the comparison between actual measurement data of MACSTOR-200 at Getilly-2 NPP in Canada and computed values from the code has been carried out. The comparison represented that the computed values acceptably agreed to the measurement data and thus the computer code was verified for its application to MACSTOR/KN-400. The identical K-values(parameter to describe head loss inside the module) and convective heat transfer coefficient of the module obtained by the validation was applied to the heat transfer analysis modelling of MACSTOR/KN-400. The result from the analysis showed that under 40 .deg. C of ambient temperature, maximum average and local temperatures of the concrete module were represented by 53 .deg. C and 69 .deg. C, respectively, which fulfilled well the allowable temperature limit of the concrete structure given by ACI349(American Concrete Institute)

  20. Operation of CANDU power reactor in thorium self-sufficient fuel cycle

    Indian Academy of Sciences (India)

    B R Bergelson; A S Gerasimov; G V Tikhomirov

    2007-02-01

    This paper presents the results of calculations for CANDU reactor operation in thorium fuel cycle. Calculations are performed to estimate the feasibility of operation of heavy-water thermal neutron power reactor in self-sufficient thorium cycle. Parameters of active core and scheme of fuel reloading were considered to be the same as for standard operation in uranium cycle. Two modes of operations are discussed in the paper: mode of preliminary accumulation of 233U and mode of operation in self-sufficient cycle. For the mode of accumulation of 233U it was assumed for calculations that plutonium can be used as additional fissile material to provide neutrons for 233U production. Plutonium was placed in fuel channels, while 232Th was located in target channels. Maximum content of 233U in target channels was estimated to be ∼ 13 kg/t of ThO2. This was achieved by irradiation for six years. The start of the reactor operation in the self-sufficient mode requires 233U content to be not less than 12 kg/t. For the mode of operation in self-sufficient cycle, it was assumed that all channels were loaded with identical fuel assemblies containing ThO2 and certain amount of 233U. It is shown that nonuniform distribution of 233U in fuel assembly is preferable.

  1. Applications to determine the shortest tower BTS distance using Dijkstra algorithm

    Science.gov (United States)

    Mardana, Herwin; Maharani, Septya; Hatta, Heliza Rahmania

    2017-02-01

    Telecommunications Tower or so-called BTS (Base Transceiver System) Toweris one of the main components in the network infrastructure that has experienced an increase in the number of construction. Telecommunications tower function as a place to put the antenna signal transmitter (access network) to provide communication services to customers around the tower. In addition, other use of telecommunications tower also to place the transmission signal antenna (transport network using microwave technology) for connecting customers with a central area. Therefore, in needed of a decision support system that can provide recommendations planting route of fiber optic cable with the shortest distance in purpose the use of fiber optic cable becoming more efficient. The results of the research were the shortest rule information, showing the distance to be travelled and the map view to enabling users to look at these.

  2. Hot Big Planets Kepler Survey: Measuring the Repopulation Rate of the Shortest-Period Planets

    OpenAIRE

    Taylor, Stuart F.

    2013-01-01

    By surveying new fields for the shortest-period "big" planets, the Kepler spacecraft could provide the statistics to more clearly measure the occurrence distributions of giant and medium planets. This would allow separate determinations for giant and medium planets of the relationship between the inward rate of tidal migration of planets and the strength of the stellar tidal dissipation (as expressed by the tidal quality factor Q). We propose a "Hot Big Planets Survey" to find new big planets...

  3. Path planning using a tangent graph for mobile robots among polygonal and curved obstacles

    Energy Technology Data Exchange (ETDEWEB)

    Liu, Yun-Hui; Arimoto, Suguru (Univ. of Tokyo (Japan))

    1992-08-01

    This article proposes a tangent graph for path planning of mobile robots among obstacles with a general boundary. The tangent graph is defined on the basis of the locally shortest path. It has the same data structure as the visibility graph, but its nodes represent common tangent points on obstacle boundaries, and its edges correspond to collision-free common tangents between the boundaries and convex boundary segments between the tangent points. The tangent graph requires O(K[sup 2]) memory, where K denotes the total number of convex segments of the obstacle boundaries. The tangent graph includes all locally shortest paths and is capable of coping with path planning not only among polygonal obstacles but also among curved obstacles.

  4. Going against the flow: finding the optimal path

    Science.gov (United States)

    Talbot, Julian

    2010-01-01

    We consider the problem of finding the optimum path of a boat traversing a straight in a current. The path of the shortest time is found using the calculus of variations with the constraint that the boat must land directly opposite to its starting point. We compare the optimal trajectory with that where the boat's local orientation is always directed to the arrival point. When analytical solutions cannot be found we use numerical methods. The level of the exposition is suitable for advanced undergraduate students, graduate students and general physicists.

  5. Double global optimum genetic algorithm-particle swarm optimization-based welding robot path planning

    Science.gov (United States)

    Wang, Xuewu; Shi, Yingpan; Ding, Dongyan; Gu, Xingsheng

    2016-02-01

    Spot-welding robots have a wide range of applications in manufacturing industries. There are usually many weld joints in a welding task, and a reasonable welding path to traverse these weld joints has a significant impact on welding efficiency. Traditional manual path planning techniques can handle a few weld joints effectively, but when the number of weld joints is large, it is difficult to obtain the optimal path. The traditional manual path planning method is also time consuming and inefficient, and cannot guarantee optimality. Double global optimum genetic algorithm-particle swarm optimization (GA-PSO) based on the GA and PSO algorithms is proposed to solve the welding robot path planning problem, where the shortest collision-free paths are used as the criteria to optimize the welding path. Besides algorithm effectiveness analysis and verification, the simulation results indicate that the algorithm has strong searching ability and practicality, and is suitable for welding robot path planning.

  6. Comparison Study on Thermal-Hydraulic Analysis Depending on Liquid Relief Valve Response for an Station Blackout in CANDU-6

    Energy Technology Data Exchange (ETDEWEB)

    Kim, S. M.; Kho, D. W. [KHNP-CRI, Daejeon (Korea, Republic of); Choi, S. H.; Moon, B. J.; Kim, S. R. [Nuclear Engineering Service and Solution Co., Daejeon (Korea, Republic of)

    2014-10-15

    The purpose of this analysis is to compare the results of thermal-hydraulic analysis depending on liquid relief valve response during a station black out (SBO) events in CANDU-6. The primary heat transport system (PHTS) behavior following the postulated SBO is analyzed using CATHENA code. In the paper, analysis was performed to evaluate the effect on coolant system where LRVs are assumed to be opened or opened according to normal open characteristics in the condition of SBO. The result showed that the primary pressure boundary is extended from LRV to DCT and the effects on primary system behavior were neglectable.

  7. Hitachi's proposed DCS solution for new build CANDU EC6 using the G-HIACS unified platform

    Energy Technology Data Exchange (ETDEWEB)

    Tan, D.; Ishii, K.; Otsuka, Y.; Uemura, K., E-mail: daisuke.tan.ye@hitachi.com [Hitachi Ltd., Infrastructure Systems Co., Ibaraki (Japan); Marko, P.E. [Hitachi Power Systems Canada Ltd., Power and Industry Div., Ontario (Canada)

    2013-07-01

    Hitachi Ltd. has developed the safe and secure functional safety DCS controller for potential new build NPP projects in the global market. Hitachi has improved the availability, maintainability, and reliability for its latest DCS systems named G-HIACS. In this latest paper on its DCS product development program, Hitachi would like to report a proposed DCS solution for new build CANDU NSP and BOP based on the G-HIACS Unified Architecture (R800FS/HSC800FS vSAFE Functional Safety Controller and R900/HSC900 General Purpose Controller) hybrid control system. (author)

  8. Assessment of System Behavior and Actions Under Loss of Electric Power For CANDU

    Energy Technology Data Exchange (ETDEWEB)

    Kang, San Ha; Moon, Bok Ja; Kim, Seoung Rae [Nuclear Engineering Service and Solution Co., Ltd., Daejeon (Korea, Republic of)

    2014-05-15

    For the analysis, the CANDU-6 plant in Korea is considered and only the passive components are operable. The other systems are assumed to be at failed condition due to the loss of electric power. At this accident, only the inventories remained in the primary heat transport system (PHTS) and steam generator can be used for the decay heat removal. Due to the transfer of decay heat, the inventory of steam generator secondary side is discharged to the air through passive operation of main steam safety valves (MSSVs). After the steam generators are dried, the PHTS is over-pressurized and the coolant is discharged to fuelling machine vault through passive operation of degasser condenser tank relief valves (DCRVs). Under this situation, the maintenance of the integrity of PHTS is important for the protection of radionuclides release to the environment. Thus, deterministic analysis using CATHENA code is carried out for the simulation of the accident and the appropriate operator action is considered. The loss of electric power results in the depletion of steam generator inventory which is necessary for the decay heat removal. If only the passive system is credited, the PT can be failed after the steam generator is depleted. For the prevention of the PT failure, the feedwater should be supplied to the steam generator before 4,800s after the accident. The feedwater can be supplied using water in dousing tank if the steam generators are depressurized. The decay heat from the core is removed through natural circulation if the feedwater can be supplied continuously.

  9. Leaching of used CANDU fuel: Results from a 19-year leach test under oxidizing conditions

    Energy Technology Data Exchange (ETDEWEB)

    Stroes-Gascoyne, S.; Johnson, L.H.; Tait, J.C.; McConnell, J.L.; Porth, R.J. [AECL, Pinawa, Manitoba (Canada). Whiteshell Labs.

    1997-12-31

    A fuel leaching experiment has been in progress since 1977 to study the dissolution behavior of used CANDU fuel in aerated aqueous solution. The experiment involves exposure of 50-mm clad segments of an outer element of a Pickering fuel bundle (burnup 610 GJ/kg U; linear and peak power ratings 53 and 58 kW/m, respectively), to deionized distilled water (DDH{sub 2}O, {approximately}2 mg/L carbonate) and tapwater ({approximately}50 mg/L carbonate). In 1992, it was observed that the fuel in at least one of the leaching solutions showed some signs of deterioration and, therefore, in 1993, parts of the fuel samples were sacrificed for a detailed analysis of the physical state of the fuel, using SEM and optical microscopy. Leaching results to date show that even after >6900 days only 5 to 7.7% of the total calculated inventory of {sup 137}Cs has leached out preferentially and that leach rates suggest a development towards congruent dissolution. Total amounts of {sup 137}Cs and {sup 90}Sr leached are slightly larger in tapwater than in DDH{sub 2}O. SEM examinations of leached fuel surface fragments indicate that the fuel surface exposed to DDH{sub 2}O is covered in a needle-like precipitate. The fuel surface exposed to tapwater shows evidence of leaching but no precipitate, likely because uranium is kept in solution by carbonate. Detailed optical and SEM microscopy examinations on fuel cross sections suggest that grain-boundary dissolution in DDH{sub 2}O is not prevalent, and in tapwater appears to be limited to the outer {approximately}0.5 mm (pellet/cladding) region of the fuel. Grain boundary attack seems to be limited to microcracks at or near the surface of the fuel. It thus appears that grain-boundary attack occurs only near the fuel pellet surface and is prevalent only in the presence of carbonate in solution.

  10. Characteristics of U-tube assembly design for CANDU 6 type steam generators

    Energy Technology Data Exchange (ETDEWEB)

    Park, Jun Su; Jeong, Seung Ha [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1996-06-01

    Since the first operation of nuclear steam generator early 1960s, its performance requirements have been met but the steam generator problems have been met but the steam generator problems have been major cause of reducing the operational reliability, plant safety and availability. U-tube assembly of steam generator forms the primary system pressure boundary of the plant and have experienced several types of tube degradation problems. Tube failure and leakage resulting from the degradation will cause radioactive contamination of secondary system by the primary coolant, and this may lead to unplanned plant outages and costly repair operations such as tube plugging or steam generator replacement. For the case of steam generators for heavy water reactors, e.g. Wolsong 2, 3, and 4 NPP, a high cost of heavy water will be imposed additionally. During the plant operation, steam generator tubes can potentially be subject to adverse environmental conditions which will cause damages to U-tube assembly. Types of the damage depend upon the combined effects of design factors, materials and chemical environment of steam generator, and they are the pure water stress corrosion cracking, intergranular attack, pitting, wastage, denting, fretting and fatigue, etc. In this report, a comprehensive review of major design factors of recirculating steam generators has been performed against the potential tube damages. Then the design characteristics of CANDU-type Wolsong steam generator were investigated in detail, including tube material, thermalhydraulic aspects, tube-to-tubesheet joint, tube supports, water chemistry and sludge management. 9 tabs., 18 figs., 38 refs. (Author) .new.

  11. Trajectory Generation and Path Planning for Autonomous Aerobots

    Science.gov (United States)

    Sharma, Shivanjli; Kulczycki, Eric A.; Elfes, Alberto

    2007-01-01

    This paper presents global path planning algorithms for the Titan aerobot based on user defined waypoints in 2D and 3D space. The algorithms were implemented using information obtained through a planner user interface. The trajectory planning algorithms were designed to accurately represent the aerobot's characteristics, such as minimum turning radius. Additionally, trajectory planning techniques were implemented to allow for surveying of a planar area based solely on camera fields of view, airship altitude, and the location of the planar area's perimeter. The developed paths allow for planar navigation and three-dimensional path planning. These calculated trajectories are optimized to produce the shortest possible path while still remaining within realistic bounds of airship dynamics.

  12. ROBIL: Robot Path Planning Based on PBIL Algorithm

    Directory of Open Access Journals (Sweden)

    Bo-Yeong Kang

    2014-09-01

    Full Text Available Genetic algorithm (GAs have attracted considerable interest for their usefulness in solving complex robot path planning problems. Specifically, researchers have combined conventional GAs with problem-specific operators and initialization techniques to find the shortest paths in a variety of robotic environments. Unfortunately, these approaches have exhibited inherently unstable performance, and they have tended to make other aspects of the problem-solving process (e.g., adjusting parameter sensitivities and creating high-quality initial populations unmanageable. As an alternative to conventional GAs, we propose a new population-based incremental learning (PBIL algorithm for robot path planning, a probabilistic model of nodes, and an edge bank for generating promising paths. Experimental results demonstrate the computational superiority of the proposed method over conventional GA approaches.

  13. Release of [sup 14]C from the gap and grain-boundary regions of used CANDU fuels to aqueous solutions

    Energy Technology Data Exchange (ETDEWEB)

    Stroes-Gascoyne, S.; Tait, J.C.; Porth, R.J.; McConnell, J.L.; Lincoln, W.J. (Whiteshell Lab., Pinawa, Manitoba (Canada). AECL Research)

    1994-01-01

    This study was undertaken as part of the Canadian Nuclear Fuel Waste Management Program (CNFWMP), to measure [sup 14]C inventories of used CANDU fuel. Other objectives were to measure the fraction of the total [sup 14]C inventory that would be instantly released to solution from used CANDU fuels upon sheath failure and to determine if the assumptions made in safety assessment calculations of used fuel waste disposal regarding instant release of [sup 14]C were correct. Results showed that the measured [sup 14]C inventories were a factor of 11.5 [+-] 3.9 lower than the estimated [sup 14]C inventory values used in safety assessment calculations. Measured instant release values for [sup 14]C ranged from 0.06 to 5.04% (of total [sup 14]C inventories) with an average of 2.7 [+-] 1.6%, indicating that instant release fractions for [sup 14]C used in safety assessment calculations (1.2--25%) were overestimated.

  14. Path Planning in a Dynamic Environment

    Directory of Open Access Journals (Sweden)

    Mohamed EL KHAILI

    2014-08-01

    Full Text Available Path planning is an important area in the control of autonomous mobile robots. Recent work has focused on aspects reductions in processing time than the memory requirements. A dynamic environment uses a lot of memory and hence the processing time increases too. Our approach is to reduce the processing time by the use of a pictorial approach to reduce the number of data used. In this paper, we present a path planning approach that operates in three steps. First, a construction of the visibility tree is performed. The following treatments are not performed on the original image but on the result tree whose elements are specific points of the environment linked by the relationship of visibility. We construct thereafter a visibility graph which one seeks the shortest path. This approach has a great interest because of its fast execution speed. The path search is extended also for the case where obstacles can move. The moving obstacles may be other mobile robots whose trajectories and speeds are known initially. At the end, some applications are provided on solving similar problem such civil aviation in order to guide plane avoiding collisions.

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

  16. Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings

    CERN Document Server

    Cygan, Marek; Sankowski, Piotr

    2012-01-01

    Consider a directed or an undirected graph with integral edge weights from the set [-W, W], that does not contain negative weight cycles. In this paper, we introduce a general framework for solving problems on such graphs using matrix multiplication. The framework is based on the usage of Baur-Strassen's theorem and of Strojohann's determinant algorithm. It allows us to give new and simple solutions to the following problems: - Finding Shortest Cycles - We give a simple O(Wn^\\omega) time algorithm for finding shortest cycles in undirected and directed graphs. For directed graphs this matches the time bounds obtained in 2011 by Roditty and Vassilevska-Williams. On the other hand, no algorithm working in $\\tilde{O}(Wn^{\\omega})$ time was previously known for undirected graphs with negative weights. - Computing Diameter - We give a simple O(Wn^\\omega) time algorithm for computing a diameter of an undirected or directed graphs. This considerably improves the bounds of Yuster from 2010, who was able to obtain this...

  17. V456 Ophiuchi and V490 Cygni: Systems with the shortest apsidal-motion periods

    CERN Document Server

    Zasche, P; 10.1051/0004-6361/201015720

    2011-01-01

    Our main aim is the first detailed analysis of the two eclipsing binaries V456 Oph and V490 Cyg. The system V456 Oph has been studied both photometrically via an analysis of its light curve observed by the INTEGRAL/OMC and by the period analysis of all available times of minima. V490 Cyg has been studied by means of a period analysis only. Many new times of minima for both systems have recently been observed and derived. This allows us for the first time to study in detail the processes that affect both binaries. The main result is the discovery that both systems have eccentric orbits. For V456 Oph we deal with the eccentric eclipsing binary system with the shortest orbital period known (about 1.016 day), while the apsidal motion period is about 23 years. V490 Cyg represents the eclipsing system with the shortest apsidal motion period (about 18.8 years only). The two components of V456 Oph are probably of spectral type F. We compare and discuss the V456 Oph results from the light curve and the period analysis...

  18. Thermal Analysis of CANDU6-Moderator System for Loss of Cooling%CANDU6慢化剂系统丧失冷却情况下的温度分析

    Institute of Scientific and Technical Information of China (English)

    徐珍

    2012-01-01

    The coolant system and moderator system of CANDU6 are independent. The prompt neutrons are moderated as thermal neutrons by the moderator and the continuous nuclear fission in the reactor is maintained. At the same time the moderator system supplies the heat sink for the heat produced by the neutrons moderation. During the in-service maintenance of plant, the standby RCW which will only cool down reactor coolant system operates instead of RCW and can not supply heat sink for moderator system heat exchanger. As the result, the moderator system will lose heat sink during the operation of standby RCW. To estimate the moderator temperature, was compared with the experiment data and evaluated in this paper. the thermal analysis of moderator system for loss of cooling the system failure caused by the temperature raising wasevaluated in this paper.%压力管卧式重水反应堆(CANDU6)具有相互独立的冷却剂系统和慢化剂系统。慢化剂系统将堆芯高能裂变中子慢化到能维持持续裂变所需的热中子水平,并将慢化中子过程中产生的热量带出。在反应堆大修期间,需要对再循环冷却水系统(RCW)进行检修,则需要并投入其备用系统,但是RCW备用系统仅对反应堆冷却剂系统进行冷却,不提供慢化剂系统热交换器冷却水。所以在RCW备用系统投入的情况下,慢化剂系统丧失冷却。为判断在此情况下慢化剂的温度变化情况,本文对CANDU6大修期间慢化剂系统丧失冷却情况下的温度变化进行分析并与试验结果进行比较,评估是否会由于温度过高而导致系统失效。

  19. FAST: A Fuel And Sheath Modeling Tool for CANDU Reactor Fuel

    Science.gov (United States)

    Prudil, Andrew Albert

    before for any Canadian fuel performance code). This thesis documents the theory employed by the model, its implementation, and the results of a proof of concept validation. The validation compared model predictions against both experimental data and results obtained from the ELESTRES and ELOCA fuel performance codes. Overall, the results show excellent model performance except in cases of a strong axial dependence. An analysis of the sensitivity of the model to the uncertainty in input parameters and the material properties is also presented. Finally, this thesis includes a discussion of the limitations, applications, and potential for future development of code. Key words: nuclear fuel, CANDU fuel, fuel modeling, multiphysics modeling, Comsol

  20. Enhanced Job Scheduling Algorithm for Cloud Computing Using Shortest Remaining Job First (SRJF

    Directory of Open Access Journals (Sweden)

    Mohammed Aboalama

    2015-06-01

    Full Text Available Cloud computing environments facilitate applications by providing virtualized resources that can be provisioned dynamically. Computing resources are delivered by Virtual Machines (VMs. In such a scenario, resource scheduling algorithms play an important role where the aim is to schedule applications effectively so as to reduce the turn-around time and improve resource utilization. The problem of this paper is how to dynamically allocate the submitted jobs to the available resources in order to complete the tasks within a minimum turn-around time as well as utilizing cloud resources effectively. The objective of this paper is to propose new scheduling algorithm on cloud computing environment using Shortest Remaining Job First (SRJF algorithm. The methodology of this paper depends on simulation using cloudsim. The results of this paper revealed that the proposed algorithm (SRJF performed better than the default scheduling algorithm.

  1. Entropy of Shortest Distance (ESD as Pore Detector and Pore-Shape Classifier

    Directory of Open Access Journals (Sweden)

    Klaudia Oleschko

    2013-06-01

    Full Text Available The entropy of shortest distance (ESD between geographic elements (“elliptical intrusions”, “lineaments”, “points” on a map, or between "vugs", "fractures" and "pores" in the macro- or microscopic images of triple porosity naturally fractured vuggy carbonates provides a powerful new tool for the digital processing, analysis, classification and space/time distribution prognostic of mineral resources as well as the void space in carbonates, and in other rocks. The procedure is applicable at all scales, from outcrop photos, FMI, UBI, USI (geophysical imaging techniques to micrographs, as we shall illustrate through some examples. Out of the possible applications of the ESD concept, we discuss in details the sliding window entropy filtering for nonlinear pore boundary enhancement, and propose this procedure as unbiased thresholding technique.

  2. Twins: The Two Shortest Period Non-Interacting Double Degenerate White Dwarf Stars

    CERN Document Server

    Mullally, F; Thompson, Susan E; Lupton, Robert

    2009-01-01

    We report on the detection of the two shortest period non-interacting white dwarf binary systems. These systems, SDSS J143633.29+501026.8 and SDSS J105353.89+520031.0, were identified by searching for radial velocity variations in the individual exposures that make up the published spectra from the Sloan Digital Sky Survey. We followed up these systems with time series spectroscopy to measure the period and mass ratios of these systems. Although we only place a lower bound on the companion masses, we argue that they must also be white dwarf stars. With periods of approximately 1 hour, we estimate that the systems will merge in less than 100 Myr, but the merger product will likely not be massive enough to result in a Type 1a supernova.

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

    DEFF Research Database (Denmark)

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

    2013-01-01

    referred to as transition dips). The absorption dips recur with a period of 2.414  ±  0.005 h, which we interpret as the orbital period of the system. This implies that MAXI J1659−152 is the shortest period black-hole candidate binary known to date. The inclination of the accretion disk with respect...... in about 5–6 billion years. The system is rather compact (orbital separation of ≳1.33 R⊙), and is located at a distance of 8.6  ±  3.7 kpc, with a height above the Galactic plane of 2.4  ±  1.0 kpc. The characteristics of short orbital period and high Galactic scale height are shared with two other...

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

    DEFF Research Database (Denmark)

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

    -hole candidate. We confirm the dipping nature in the X-ray light curves. We find that the dips recur on a period of 2.4139+/-0.0005 hrs, and interpret this as the orbital period of the system. It is thus the shortest period black-hole X-ray binary known to date. Using the various observables, we derive...... the properties of the source. The inclination of the accretion disk with respect to the line of sight is estimated to be 60-75 degrees. The companion star to the black hole is possibly a M5 dwarf star, with a mass and radius of about 0.15 M_sun and 0.23 R_sun, respectively. The system is rather compact (orbital...

  5. Fission product release assessment for end fitting failure in Candu reactor loaded with CANFLEX-NU fuel bundles

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Dirk Joo; Jeong, Chang Joon; Lee, Kang Moon; Suk, Ho Chun [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)

    1997-12-31

    Fission product release (FPR) assessment for End Fitting Failure (EFF) in CANDU reactor loaded with CANFLEX-natural uranium (NU) fuel bundles has been performed. The predicted results are compared with those for the reactor loaded with standard 37-element bundles. The total channel I-131 release at the end of transient for EFF accident is calculated to be 380.8 TBq and 602.9 TBq for the CANFLEX bundle and standard bundle channel cases, respectively. They are 4.9% and 7.9% of total inventory, respectively. The lower total releases of the CANFLEX bundle O6 channel are attributed to the lower initial fuel temperatures caused by the lower linear element power of the CANFLEX bundle compared with the standard bundle. 4 refs., 1 fig., 4 tabs. (Author)

  6. Feasibility study in aspect of thermal integrity on the dry storage expansion options for CANDU spent fuel

    Energy Technology Data Exchange (ETDEWEB)

    Lee, K. H.; Yoon, J. H.; Choi, B. I.; Lee, H. Y.; Song, M. J. [Nuclear Environment Technology Institute, Taejon (Korea, Republic of); Cho, K. S. [Korea Advanced Institute of Science and Technology, Taejon (Korea, Republic of)

    2002-10-01

    In order to expand the capability of the CANDU spent fuel dry storage facilities of the at Wolsong, the alternative concepts based on MACSTOR are suggested to replace with existing concrete silo of Wolsong. For this, the feasibility of its design changes from original MACSTOR is examined in term of heat transfer and thermal hydraulic. In this study, the configuration of the module was conceptually changed from its original 2 rows to 3 and 4 rows for review. Under normal operation, the results of heat transfer and thermal hydraulic shows that storage module can feasibly accomodate four rows of storage cylinders within allowable range in terms of maximum allowable temperature of the fuel basket.

  7. Modelling material effects on flow-accelerated corrosion in primary CANDU coolant and secondary reactor feed-water

    Energy Technology Data Exchange (ETDEWEB)

    Phromwong, P.; Lister, D., E-mail: c7r13@unb.ca [Univ. of New Brunswick, Dept. of Chemical Engineering, Fredericton, New Brunswick (Canada); Uchida, S. [Japan Atomic Energy Agency, Tokai-mura, Ibaraki (Japan)

    2012-07-01

    The effects of chromium content on flow-accelerated corrosion (FAC) of carbon steel have been predicted very well by including a passivating layer, which is a chromium-dependent diffusion barrier at the metal-oxide interface. By adjusting the properties of the chromium-dependent layer, described with a Passivation Parameter (PP), we can predict the FAC of carbon steel of different chromium contents in typical reactor feed-water environments (140{sup o}C and neutral or ammoniated chemistry). The model and an appropriate PP are also applied to the environment typical of carbon-steel feeders in the primary coolant of a CANDU reactor (310{sup o}C and lithiated chemistry). The model predicts FAC rate very well (with a deviation of 10% or less) in both situations. (author)

  8. A New Approach to Determine the Critical Path in Stochastic Activity Network

    Directory of Open Access Journals (Sweden)

    Weng-Ming Chu

    2014-01-01

    Full Text Available The determination of the critical path (CP in stochastic networks is difficult. It is partly due to the randomness of path durations and partly due to the probability issue of the selection of the critical path in the network. What we are confronted with is not only the complexity among random variables but also the problem of path dependence of the network. Besides, we found that CP is not necessarily the longest (or shortest path in the network, which was a conventional assumption in use. The Program Evaluation and Review Technique (PERT and Critical Path Index (CPI approaches are not able to deal with this problem efficiently. In this study, we give a new definition on the CP in stochastic network and propose a modified label-correcting tracing algorithm (M-LCTA to solve it. Based on the numerical results, compared with Monte Carlo simulation (MCS, the proposed approach can accurately determine the CP in stochastic networks.

  9. Probabilistic seismic safety assessment of a CANDU 6 nuclear power plant including ambient vibration tests: Case study

    Energy Technology Data Exchange (ETDEWEB)

    Nour, Ali [Hydro Québec, Montréal, Québec H2L4P5 (Canada); École Polytechnique de Montréal, Montréal, Québec H3C3A7 (Canada); Cherfaoui, Abdelhalim; Gocevski, Vladimir [Hydro Québec, Montréal, Québec H2L4P5 (Canada); Léger, Pierre [École Polytechnique de Montréal, Montréal, Québec H3C3A7 (Canada)

    2016-08-01

    Highlights: • In this case study, the seismic PSA methodology adopted for a CANDU 6 is presented. • Ambient vibrations testing to calibrate a 3D FEM and to reduce uncertainties is performed. • Procedure for the development of FRS for the RB considering wave incoherency effect is proposed. • Seismic fragility analysis for the RB is presented. - Abstract: Following the 2011 Fukushima Daiichi nuclear accident in Japan there is a worldwide interest in reducing uncertainties in seismic safety assessment of existing nuclear power plant (NPP). Within the scope of a Canadian refurbishment project of a CANDU 6 (NPP) put in service in 1983, structures and equipment must sustain a new seismic demand characterised by the uniform hazard spectrum (UHS) obtained from a site specific study defined for a return period of 1/10,000 years. This UHS exhibits larger spectral ordinates in the high-frequency range than those used in design. To reduce modeling uncertainties as part of a seismic probabilistic safety assessment (PSA), Hydro-Québec developed a procedure using ambient vibrations testing to calibrate a detailed 3D finite element model (FEM) of the containment and reactor building (RB). This calibrated FE model is then used for generating floor response spectra (FRS) based on ground motion time histories compatible with the UHS. Seismic fragility analyses of the reactor building (RB) and structural components are also performed in the context of a case study. Because the RB is founded on a large circular raft, it is possible to consider the effect of the seismic wave incoherency to filter out the high-frequency content, mainly above 10 Hz, using the incoherency transfer function (ITF) method. This allows reducing significantly the non-necessary conservatism in resulting FRS, an important issue for an existing NPP. The proposed case study, and related methodology using ambient vibration testing, is particularly useful to engineers involved in seismic re-evaluation of

  10. Hybrid Monte Carlo deterministic and probabilistic core assessment for flaws and leak-before break for CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Shi, P.; Mok, D.H.B. [AMEC NSS, Toronto, Ontario (Canada)

    2011-07-01

    Even though pressure tubes are major components of a CANDU reactor, only small proportions of pressure tubes are sampled for in-service inspections due to execution cost, outage duration, and site cumulative radiation exposure limits. In general, a realistic core assessment was not carried out based on all known information related to in-service degradation mechanisms. Recently, a hybrid deterministic and probabilistic core assessment (HDPCA) has been introduced to address the uncertainties associated with uninspected pressure tubes and diverse degradation mechanisms. In the present paper, the HDPCA was carried out for a CANDU unit based on cumulative operating experience and history in order to satisfy the requirements of Clause 7 of CSA Standard N285.8 by considering the uncertainties associated with the estimated distribution parameters, the limited inspected data, and pressure tube properties. The HDPCA is composed of two parts: a simulation part and a deterministic evaluation part. The outcome of the core assessment is the expected pressure tube failure frequency due to pressure tube flaws. In the simulations, pressure tube material properties were sampled from distributions derived from material surveillance and testing programs. The flaw dimensions and intensities were sampled from distributions fitted to in-service inspection data. The pressure tubes were then populated with flaws. Each simulated flaw was evaluated for DHC initiation under constant loading conditions. When Delayed Hydride Cracking initiation from a flaw was predicted, the pressure tube was evaluated for rupture in the Leak-Before-Break evaluation. Based on all the predicted pressure tube ruptures from simulations, the failure frequency was calculated on an annual basis. The largest expected mean and the 95% upper bound of the mean failure frequencies for any evaluation subinterval to the end of pressure tube design life of 210,000 EFPH are significantly below the allowable failure frequency

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

  12. Severe accident analysis of a station blackout accident using MAAP-CANDU for the Point Lepreau station refurbishment project level 2 PSA

    Energy Technology Data Exchange (ETDEWEB)

    Brown, M.J.; Petoukhov, S.M. [Atomic Energy of Canada Limited, Chalk River, Ontario (Canada)

    2012-07-01

    A Level 2 Probabilistic Safety Assessment was performed for the Point Lepreau Generating Station, using the MAAP-CANDU code to simulate the progression of severe core damage accidents and fission product releases. Five representative severe accidents were selected: Station Blackout, Small Loss-of-Coolant, Stagnation Feeder Break, Steam Generator Tube Rupture, and Shutdown State. Analysis results for the reference station blackout accident are discussed in this paper. (author)

  13. Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time

    CERN Document Server

    \\L\\kacki, Jakub

    2011-01-01

    We present a deterministic O(n log log n) time algorithm for finding shortest cycles and minimum cuts in planar graphs. The algorithm improves the previously known fastest algorithm by Italiano et al. in STOC'11 by a factor of log n. This speedup is obtained through the use of dense distance graphs combined with a divide-and-conquer approach.

  14. Using seafaring simulations and shortest-hop trajectories to model the prehistoric colonization of Remote Oceania.

    Science.gov (United States)

    Montenegro, Álvaro; Callaghan, Richard T; Fitzpatrick, Scott M

    2016-10-24

    The prehistoric colonization of islands in Remote Oceania that began ∼3400 B.P. represents what was arguably the most expansive and ambitious maritime dispersal of humans across any of the world's seas or oceans. Though archaeological evidence has provided a relatively clear picture of when many of the major island groups were colonized, there is still considerable debate as to where these settlers originated from and their strategies/trajectories used to reach habitable land that other datasets (genetic, linguistic) are also still trying to resolve. To address these issues, we have harnessed the power of high-resolution climatic and oceanographic datasets in multiple seafaring simulation platforms to examine major pulses of colonization in the region. Our analysis, which takes into consideration currents, land distribution, wind periodicity, the influence of El Niño Southern Oscillation (ENSO) events, and "shortest-hop" trajectories, demonstrate that (i) seasonal and semiannual climatic changes were highly influential in structuring ancient Pacific voyaging; (ii) western Micronesia was likely settled from somewhere around the Maluku (Molucca) Islands; (iii) Samoa was the most probable staging area for the colonization of East Polynesia; and (iv) although there are major differences in success rates depending on time of year and the occurrence of ENSO events, settlement of Hawai'i and New Zealand is possible from the Marquesas or Society Islands, the same being the case for settlement of Easter Island from Mangareva or the Marquesas.

  15. Why were Sardinians the shortest Europeans? A journey through genes, infections, nutrition, and sex.

    Science.gov (United States)

    Pes, Giovanni Mario; Tognotti, Eugenia; Poulain, Michel; Chambre, Dany; Dore, Maria Pina

    2017-01-31

    Since ancient times the Mediterranean island of Sardinia has been known for harboring a population with an average body height shorter than almost every other ethnic group in Europe. After over a century of investigations, the cause(s) at the origin of this uniqueness are not yet clear. The shorter stature of Sardinians appears to have been documented since prehistoric times, as revealed by the analysis of skeletal remains discovered in archaeological sites on the island. Recently, a number of genetic, hormonal, environmental, infective and nutritional factors have been put forward to explain this unique anthropometric feature, which persisted for a long time, even when environmental and living conditions improved around 1960. Although some of the putative factors are supported by sound empirical evidence, weaker support is available for others. The recent advent of whole genome analysis techniques shed new light on specific variants at the origin of this short stature. However, the marked geographical variability of stature across time and space within the island, and the well-known presence of pockets of short height in the population of the southern districts, are still puzzling findings that have attracted the interest of anthropologists and geneticists. The purpose of this review is to focus on the state-of-the-art research on stature, as well as the factors that made Sardinians the shortest among Europeans.

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

    CERN Document Server

    Kuulkers, E; van der Horst, A J; Belloni, T; Chenevez, J; Ibarra, A; Munoz-Darias, T; Bazzano, A; Bel, M Cadolle; De Cesare, G; Trigo, M Diaz; Jourdain, E; Lubinski, P; Natalucci, L; Ness, J -U; Parmar, A; Pollock, A M T; Rodriguez, J; Roques, J -P; Sanchez-Fernandez, C; Ubertini, P; Winkler, C

    2011-01-01

    Following the detection of a bright new X-ray source, MAXI J1659-152, a series of observations was triggered with almost all currently flying high-energy missions. We report here on XMM-Newton, INTEGRAL and RXTE observations during the early phase of the X-ray outburst of this transient black-hole candidate. We confirm the dipping nature in the X-ray light curves. We find that the dips recur on a period of 2.4139+/-0.0005 hrs, and interpret this as the orbital period of the system. It is thus the shortest period black-hole X-ray binary known to date. Using the various observables, we derive the properties of the source. The inclination of the accretion disk with respect to the line of sight is estimated to be 60-75 degrees. The companion star to the black hole is possibly a M5 dwarf star, with a mass and radius of about 0.15 M_sun and 0.23 R_sun, respectively. The system is rather compact (orbital separation is about 1.35 R_sun) and is located at a distance of roughly 7 kpc. In quiescence, MAXI J1659-152 is e...

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

    Directory of Open Access Journals (Sweden)

    Matheswaran Saravanan

    2014-01-01

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

  18. An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective.

    Science.gov (United States)

    Faigl, Jan

    2016-01-01

    In this paper, Self-Organizing Map (SOM) for the Multiple Traveling Salesman Problem (MTSP) with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city) to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to "see" the whole robots' workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning.

  19. An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective

    Directory of Open Access Journals (Sweden)

    Jan Faigl

    2016-01-01

    Full Text Available In this paper, Self-Organizing Map (SOM for the Multiple Traveling Salesman Problem (MTSP with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervised learning. Moreover, a collision-free path is also needed in the adaptation phase, where neurons are adapted towards the presented input signal (city to the network. Simple approximations of the shortest path are utilized to address this issue and solve the robotic MTSP by SOM. Suitability of the proposed approximations is verified in the context of cooperative inspection, where cities represent sensing locations that guarantee to “see” the whole robots’ workspace. The inspection task formulated as the MTSP-Minmax is solved by the proposed SOM approach and compared with the combinatorial heuristic GENIUS. The results indicate that the proposed approach provides competitive results to GENIUS and support applicability of SOM for robotic multigoal path planning with a group of cooperating mobile robots. The proposed combination of approximate shortest paths with unsupervised learning opens further applications of SOM in the field of robotic planning.

  20. Seismic Structure-Soil-Structure Interaction Analysis of a Consolidated Dry Storage Module for CANDU Spent Fuels

    Energy Technology Data Exchange (ETDEWEB)

    Kang, Young Gon; Yoon, Jeong Hyoun; Kim, Sung Hwan; Yang, Ke Hyung; Lee, Heung Young; Cho, Chun Hyung [Korea Hydro and Nuclear Power Co., Ltd., Daejeon (Korea, Republic of); Choi, Kyu Sup; Jeong, In Su [KONES Corporation, Seoul (Korea, Republic of)

    2005-07-01

    The MACSTOR/KN-400 module has been developed as an effective alternative to the existing stand alone concrete canister for dry storage of CANDU spent fuel. The structure is a concrete monolith of 21.67 m long and 12.66 m wide and has a height equal to 7.518 m including the bottom slab. Inside the concrete module consists of 40 storage cylinders accommodating ten 60-bundle dry storage baskets, which are suspended from the top slab and eventually restrained at 10 cm above the bottom slab with horizontal seismic restraints. The main cooling process of the MACSTOR/KN-400 module shall be by air convection through air inlets and outlets. The civil design parameters, with respect to meteorological and seismic loads applied to the module are identical to those specified for the Wolsung CANDU 3 and 4 plants, except for local site characteristics required for soilstructure interaction (SSI) analysis. It is required for the structural integrity to fulfill the licensing requirements. As per USNRC SRP Section 3.7.2, it shall be reviewed how to consider the phenomenon of coupling of the dynamic response of adjacent structures through the soil, which is referred to as structure-soil-structure interaction (SSSI). The presence of closely spaced multiple structural foundations creates coupling between the foundations of individual structures . Some observations of the actual seismic response of structures have indicated that SSSI effects do exist, but they are generally secondary for the overall structural response motions. SSSI effects, however, may be important for a relatively small structure which is to be close to a relatively large structure, while they may be generally neglected for overall structural response of a large massive structure, such as nuclear power plant. As such the scope of the present paper is to carry out a seismic SSSI analysis in case of the MACSTOR/KN- 400 module, in order to investigate whether or not SSSI effect shall be included in the overall seismic

  1. Development of Bundle Position-Wise Linear Model for Predicting the Pressure Tube Diametral Creep in CANDU Reactors

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Jae Yong [Korea Electric Power Corporation Research Institute, Daejeon (Korea, Republic of); Na, Man Gyun [Chosun University, Gwangju (Korea, Republic of)

    2011-08-15

    Diametral creep of the pressure tube (PT) is one of the principal aging mechanisms governing the heat transfer and hydraulic degradation of a heat transport system. PT diametral creep leads to diametral expansion that affects the thermal hydraulic characteristics of the coolant channels and the critical heat flux. Therefore, it is essential to predict the PT diametral creep in CANDU reactors, which is caused mainly by fast neutron irradiation, reactor coolant temperature and so forth. The currently used PT diametral creep prediction model considers the complex interactions between the effects of temperature and fast neutron flux on the deformation of PT zirconium alloys. The model assumes that long-term steady-state deformation consists of separable, additive components from thermal creep, irradiation creep and irradiation growth. This is a mechanistic model based on measured data. However, this model has high prediction uncertainty. Recently, a statistical error modeling method was developed using plant inspection data from the Bruce B CANDU reactor. The aim of this study was to develop a bundle position-wise linear model (BPLM) to predict PT diametral creep employing previously measured PT diameters and HTS operating conditions. There are twelve bundles in a fuel channel and for each bundle, a linear model was developed by using the dependent variables, such as the fast neutron fluxes and the bundle temperatures. The training data set was selected using the subtractive clustering method. The data of 39 channels that consist of 80 percent of a total of 49 measured channels from Units 2, 3 and 4 were used to develop the BPLM models. The remaining 10 channels' data were used to test the developed BPLM models. The BPLM was optimized by the maximum likelihood estimation method. The developed BPLM to predict PT diametral creep was verified using the operating data gathered from the Units 2,3 and 4 in Korea. Two error components for the BPLM, which are the

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

  3. Radionuclide Release after Channel Flow Blockage Accident in CANDU-6 Plant

    Energy Technology Data Exchange (ETDEWEB)

    Choi, Hoon; Jun, Hwang Yong [Korea Electric Power Corporation Research Institute, Daejeon (Korea, Republic of)

    2011-05-15

    The channel flow blockage accident is one of the in core loss of coolant accidents, the release path of radionuclide is very different from conventional loss of coolant accidents. The large amount of radionuclide released from broken channel is being washed during it passes through the moderator in Calandria. The objective of containment behavior analysis for channel flow blockage event is to assess the amount of radionuclide release to the ambient atmosphere. Radionuclide release rates in case of channel flow blockage with all safety system available, that is containment building is intact, as well as with containment system impairment are analyzed with GOTHIC and SMART code

  4. Heat transfer analysis of consolidated dry storage system for CANDU spent fuel considering environmental conditions of Wolsong site

    Energy Technology Data Exchange (ETDEWEB)

    Lee, K. H.; Yoon, J. H.; Choi, B. I.; Lee, H. Y. [Korea Hydraulic and Nuclear Power Company, Taejon (Korea, Republic of)

    2004-07-01

    The purpose of the present paper is to perform heat transfer analysis of the MACSTOR/KN-400 dry storage system for CANDU spent fuel in order to predict maximum concrete temperatures and temperature gradients. This module has twice the capacity of the existing MACSTOR-200, which is in operation at Gentilly-2. In the thermal design of the MACSTOR/KN-400, Thermal Insulation Panels(TIP) were introduced to reduce concrete temperatures and temperature gradients in the module caused by the high fuel heat loads. Environmental factors such as solar heat, daily temperature variations and ambient temperatures in summer and winter at Wolsong site and the assumed presence of hot baskets were taken into consideration in the simulations. Two cases were performed for the MACSTOR/KN-400: Off-normal cases in summer and winter. The maximum local concrete temperatures were predicted to be 63 .deg. C for the off-normal case. The temperature gradients in the concrete walls and roof are predicted to be 28C and 25C for off-normal operation in summer, incorporating a 3C uncertainty. In conclusion, this paper shows that the maximum temperature for the module is expected to meet the temperature limitations of ACI 349.

  5. Development of finite element models for the study of ageing effects in CANDU 6 concrete containment buildings

    Energy Technology Data Exchange (ETDEWEB)

    Ding, Y.; Jaffer, S., E-mail: Yuqing.Ding@cnl.ca [Canadian Nuclear Laboratories, Chalk River, Ontario (Canada)

    2016-06-15

    In nuclear power plants (NPPs), concrete containment buildings (CCBs) provide the final physical barrier against the release of radioactive materials into the environment and protect the nuclear structures housed within the containment building. CCBs have to be maintained to ensure leak tightness and sound structural integrity for the safe operation throughout the life of NPPs. However, the integrity of CCBs may be affected by the ageing of its concrete, post-tensioning cables and reinforcing bars (rebars). Finite element models (FEMs) of CANDU 6 CCBs have been developed using 2 independent finite element programs for the study of the effect of ageing of CCBs. These FEMs have been validated using multiple-source data and have been used for preliminary analyses of the effect of thermal load and ageing degradation on the concrete structure. The modelling assumptions and simplifications, approach, and validation are discussed in this paper. The preliminary analyses for temperature effects and potential applications to the study of ageing degradation in CCBs using the FEMs are briefly introduced. (author)

  6. Shortest route finding by ant system algorithm in web geographical information system-based advanced traveller information system

    Directory of Open Access Journals (Sweden)

    Praveen Kumar

    2014-10-01

    Full Text Available This paper discusses the methodology used in the development of advanced traveller information system (ATIS. This system is designed as a part of web geographical information system (GIS based advanced public transport systems. Web GIS-based ATIS system includes spatial data for the designed functionalities and provides GIS capabilities to the users through the internet. In addition to these functionalities, a route planning algorithm to plan the shortest route between the selected bus transit points is also designed using ant system algorithm and is integrated with web GIS. This study presents the ant system algorithm adopted for the shortest route finding with the methodology developed for the web GIS-based ATIS system for the study area of the city Chandigarh in India using open source software MapServer as web map server. This study also discusses the three-tier logical architecture used in the methodology for providing GIS capabilities to the user over the internet.

  7. Analyse du transfert de chaleur et de la perte de pression pour des ecoulements supercritiques dans le reacteur CANDU-SCWR

    Science.gov (United States)

    Zoghlami, Sarra

    The supercritical water reactor is one of the six concepts of generation IV nuclear reactors that has been selected by the International Generation IV Forum (GIF). Canada has chosen to conduct advanced research on this type of reactor. For the design and safety analysis of the reactor concept, the development of numerical simulation codes is needed. The ARTHUR code is a thermal-hydraulic computer code developed by Fassi-Fehri (2008), at the Ecole Polytechnique de Montreal, to analyse the CANDU-6 reactor. The purpose of this project is to modify this numerical code so that it can be used to treat the CANDU-SCWR. To calculate the coolant thermal-hydraulics properties in the fuel channel of a CANDU-SCWR, it was assumed that the water flows under supercritical conditions is a one-phase flow. Thus within this code, we developed the conservation equations for one-phase flow. Hydraulic resistance and heat transfer at supercritical pressure are two important aspects to be considered in the modeling of a fuel channel in a nuclear reactor. To choose the accurate correlation to predict the pressure friction factor, we compared numerical calculations, using different correlations found in literature, to experimental data. We concluded that the Garimella (2008) correlation is the most consistent, to be incorporated in the ARTHUR &barbelow;SCWR code. We proved that the choice of the friction factor correlation affects slightly the distribution of thermal-hydraulic properties in the fuel channel. Under supercritical conditions, water thermal-physical properties are characterized by significant variations in the pseudo-critical region. This behavior influences the forced convection heat transfer phenomena. To choose the adequate correlation to calculate the forced convection heat transfer coefficient, we compared numerical results to experimental data, and we found that the standard deviation given by Mokry et al. (2010) correlation is the lowest. In order to model the fuel

  8. Path Integrals and Hamiltonians

    Science.gov (United States)

    Baaquie, Belal E.

    2014-03-01

    1. Synopsis; Part I. Fundamental Principles: 2. The mathematical structure of quantum mechanics; 3. Operators; 4. The Feynman path integral; 5. Hamiltonian mechanics; 6. Path integral quantization; Part II. Stochastic Processes: 7. Stochastic systems; Part III. Discrete Degrees of Freedom: 8. Ising model; 9. Ising model: magnetic field; 10. Fermions; Part IV. Quadratic Path Integrals: 11. Simple harmonic oscillators; 12. Gaussian path integrals; Part V. Action with Acceleration: 13. Acceleration Lagrangian; 14. Pseudo-Hermitian Euclidean Hamiltonian; 15. Non-Hermitian Hamiltonian: Jordan blocks; 16. The quartic potential: instantons; 17. Compact degrees of freedom; Index.

  9. Fault Tolerant Multi-Criteria Multi-Path Routing in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Koffka Khan

    2015-05-01

    Full Text Available The Ad Hoc On-Demand Multi-Path Distance Vector (AOMDV routing protocol allows the transport of data along one or more paths in wireless sensor networks (WSNs. The path chosen is based on a single shortest path hop count metric. The data on some WSNs is mission critical, for example, military and health care applications. Hence, fault tolerance in WSNs is becoming increasingly important. To improve the fault tolerance of WSNs in lossy environments, this work adds to the AOMDV routing protocol as it incorporates an additional packet loss metric. This Multi-criteria AOMDV or M-AOMDV is evaluated using the ns2 simulator. Simulations show that M-AOMDV maintains relatively low packet loss rates when the WSN is experiencing loss.

  10. Generalized minimum information path routing strategy on scale-free networks

    Institute of Scientific and Technical Information of China (English)

    Zhou Si-Yuan; Wang Kai; Zhang Yi-Feng; Pei Wen-Jiang; Pu Cun-Lai; Li Wei

    2011-01-01

    This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously.It is found that network transmission capacity can be considerably enhanced by adjusting the parameter with various allocations of node capability for packet delivery.Moreover,the proposed routing strategy provides a traffic load distribution which can better match the allocation of node capability than that of traditional efficient routing strategies,leading to a network with improved transmission performance.This routing strategy,without deviating from the shortest-path routing strategy in the length of paths too much,produces improved performance indexes such as critical generating rate,average length of paths and average search information.

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

  12. 利用LinGo求解几种有向图最短路问题%Using LinGo Solve Several Shortest Path Problems for Directed Graph

    Institute of Scientific and Technical Information of China (English)

    刘淋

    2010-01-01

    本文对几种有向赋权图的最短路长和路径采用Lingo软件对其求解,并分析了用Lingo解法的简便之处和如何处理赋权有向图中的负权问题.对解决此类问题提供了一种新的途径.

  13. 最短路径层析成像技术在井间地震中的应用%Shortest path tomography in crosswell seismic

    Institute of Scientific and Technical Information of China (English)

    陈国金; 曹辉; 吴永栓; 唐金良

    2004-01-01

    利用基于最短路径树弯曲射线追踪的联合迭代重建层析成像(SIRT)技术进行井间地震层析成像.从方法原理、算法的有效性、数值模型和野外实际资料的层析反演等方面,对SIRT井间地震层析成像技术进行了系统研究.数值模型和野外资料的反演结果表明,该方法可靠稳定,收敛性好,层析成像结果的精度较高.

  14. 动态网络最短路径射线追踪%A METHOD OF SHORTEST PATH RAYTRACING WITH DYNAMIC NETWORKS

    Institute of Scientific and Technical Information of China (English)

    张建中; 陈世军; 徐初伟

    2004-01-01

    最短路径射线追踪算法,用预先设置的网络节点的连线表示地震波传播路径,当网络节点稀疏时,获得的射线路径呈之字形,计算的走时比实际走时系统偏大.本文在波前扩展和反向确定射线路径的过程中,在每个矩形单元内,通过对某边界上的已知走时节点的走时进行线性插值,并利用Fermat原理即时求出从该边界到达其他边界节点的最小走时及其子震源位置和射线路径,发展了相应的动态网络算法.从而克服了最短路径射线追踪算法的缺陷,大大提高了最小走时和射线路径的计算精度.

  15. Shortest Paths for Groups: Introducing a Predictive Memory for Cognitive Agents. GI_Forum|GI_Forum 2015 – Geospatial Minds for Society|

    OpenAIRE

    Scholz, Johannes

    2015-01-01

    This paper elaborates on the effect of predictive memory on cognitive agents that are acting in selfish routing games. Selfish routing describes a situation, where agents are moving in a network with defined latency functions, and act in a strictly selfish manner. Under certain situations – i.e. specific definition of the network, associated latency functions, and agents acting strictly selfish – the Braess Paradox occurs. The Braess Paradox contradicts human intuition by the fact that adding...

  16. Shortest path algorithm of RCP(n) networks%互联网络RCP(n)的最短路算法

    Institute of Scientific and Technical Information of China (English)

    王敏; 高太平; 刘宏英; 闫宇琦

    2009-01-01

    RCP(n)是最近提出的一种新型互联网络拓扑结构,是由环、Petersen图和交叉立方体所组成的,具有短直径、良好的可扩展性和正则性以及较小的构造开销的性质,是一种具有良好拓扑性质的互联网络.针对RCP(n)上节点编码的特点,采用逐步分解编码,依次寻找路径的方法给出了寻找RCP(n)上任意两点间最短路的一个多项式算法,为RCP(n)上作进一步的路由算法、最优分组等通讯性能的研究提供了理论支持,因此具有一定的理论意义和应用价值.

  17. 带权区间图的最短路算法%A New Algorithm for Shortest Paths on Weighted Interval Graphs

    Institute of Scientific and Technical Information of China (English)

    王晓东; 吴英杰

    2003-01-01

    提出一个解带权区间图的最短路问题的O(nα(n))时间新算法,其中n是带权区间图中带权区间的个数,α(n)是单变量Ackerman函数的逆函数,它是一个增长速度比log n慢得多的函数,对于通常所见到的n,α(n)≤4.本文提出的新算法不仅在时间复杂性上比直接用Dijkstra算法解带权区间图的最短路问题有较大改进,而且算法设计思想简单,易于理解和实现.

  18. Severe accident analysis of a small LOCA accident using MAAP-CANDU support level 2 PSA for the Point Lepreau station refurbishment project

    Energy Technology Data Exchange (ETDEWEB)

    Petoukhov, S.M.; Brown, M.J.; Mathew, P.M. [Atomic Energy of Canada Limited, Chalk River, Ontario (Canada)

    2012-07-01

    A Level 2 Probabilistic Safety Assessment was performed for the Point Lepreau Generating Station. The MAAP4-CANDU code was used to calculate the progression of postulated severe core damage accidents and fission product releases. Five representative severe core damage accidents were selected: Station Blackout, Small Loss-of-Coolant Accident, Stagnation Feeder Break, Steam Generator Tube Rupture, and Shutdown State Accident. Analysis results for only the reference Small LOCA Accident scenario (which is a very low probability event) are discussed in this paper. (author)

  19. Experimental and numerical investigations of three-dimensional turbulent flow of water surrounding a CANDU simulation fuel bundle structure inside a channel

    Energy Technology Data Exchange (ETDEWEB)

    Abbasian, F.; Yu, S.D. [Department of Mechanical and Industrial Engineering, Ryerson University, 350 Victoria Street, Toronto, Ontario, M5B 2K3 (Canada); Cao, J. [Department of Mechanical and Industrial Engineering, Ryerson University, 350 Victoria Street, Toronto, Ontario, M5B 2K3 (Canada)], E-mail: jcao@ryerson.ca

    2009-11-15

    Computational fluid dynamics (CFD) is used to simulate highly turbulent coolant flows surrounding a simulation CANDU fuel bundle structure inside a flow channel. Three CFD methods are used: large eddy simulation (LES), detached eddy simulation (DES), and Reynolds stress model (RSM). The outcome of the simulations is compared with the experimental pressure data measured using an in-water microphone and a miniature pressure transducer placed at various locations in the vicinity of the bundle structure. Among all the three methods employed in developing computational models, LES provides the most accurate results for turbulent pressures.

  20. Multi-Dimensional Path Queries

    DEFF Research Database (Denmark)

    Bækgaard, Lars

    1998-01-01

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

  1. Development of CANDU advanced fuel fabrication technology - A development of amorphous alloys for the solder of nuclear reactor materials

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Jai Young; Lee, Ki Young; Kim, Yoon Kee; Jung, Jae Han; Yu, Ji Sang; Kim, Hae Yeol; Han, Young Su [Korea Advanced Institute of Science and Technology, Taejon (Korea, Republic of)

    1996-07-01

    In the case of advanced CANDU fuel being useful in future, the fabrication processes for soundness insurance of a improved nuclear fuel bundle must be developed at the same time because it have three times combustibility as existing fuel. In particular, as the improved nuclear fuel bundle in which a coated layer thickness is thinner than existing that, firmity of a joint part is very important. Therefore, we need to develop a joint technique using new solder which can settle a potential problem in current joining method. As the Zr-Be alloy system and the Ti-Be system are composed with the elements having high neutron permeability, they are suitable for joint of nuclear fuel pack. The various compositions Zr-Be and Ti-Be binary metallic glass alloys were applicable to the joining the nuclear fuel bundles. The thickness of joint layer using the Zr{sub 1-x} Be{sub x} amorphous ribbon as a solder is thinner than that using physical vapor deposited Be. Among the Zr{sub 1-x} Be{sub x} amorphous binary alloys, Zr{sub 0.7} Be{sub 0.3} binary alloy is the most appropriated for joint of nuclear fuel bundle because its joint layer is smooth and thin due to low degree of Be diffusion. The microstructures of brazed layer using Ti{sub 1-y} Be{sub y} alloy, however, a solid-solution layer composed with Zr and Ti is formed toward the Zr cladding sheath and many of Zr is detected in the joint lever. 20 refs., 8 tabs., 23 figs. (author)

  2. A study on framework for assessing limiting condition for operation(LCOs) quantitatively in a CANDU reactor

    Energy Technology Data Exchange (ETDEWEB)

    Kang, Kyung Min

    2003-02-15

    Limiting conditions for operations define the allowed outage times and the actions to be taken if the repair cannot be completed within the AOT. Typically the actions required are plant shutdown. In situations where the risk associated with the action, i.e., the risk of plant shutdown given a failure in the safety system, may be substantial, a strategy is needed to control the risk implications. In this study the strategy is evaluated quantitatively using a tool of system dynamics. The strategic actions associated with LCO needs to be assessed dynamically. System dynamics technique is easy enough to be applied for quantitative assessment of LCO, where the system dynamics is an important factor in evaluating operational modes of nuclear power plants. The review on the improvements of overly conservative technical specification has been performed in this study. The VENSIM tool has been applied to evaluate quantitatively the LCO of the auxiliary feed water systems in the Wol-Sung nuclear power plant. A value of core damage frequency in PSA is used as risk measure. The analysis of both full power operation and shutdown operation has been compared for the value of the CDF. This study shows a plot of LCO full power operating and shutdown risks in term of core damage probability for failure of AFWS (auxiliary feedwater system). Obtaining a lower risk level in a stable mode, compared to the LCO operation alternative, is the principal motivation of going to full power operational mode or shutdown operational mode. A time dependent framework developed in this study has been applied to assess the LCO of the example problem and it is shown that it is very flexible in that it can be applied to assess LCO quantitatively under any operational context of the technical specifications. This study contributes risk informed regulation to enhance and optimize the LCO of previous technical specifications for CANDU through developing framework in application proposed in this methodology.

  3. Path dependence and creation

    DEFF Research Database (Denmark)

    Garud, Raghu; Karnøe, Peter

    the place of agency in these theories that take history so seriously. In the end, they are as interested in path creation and destruction as they are in path dependence. This book is compiled of both theoretical and empirical writing. It shows relatively well-known industries such as the automobile...

  4. Unique Path Partitions

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  5. Free path groupoid grading on Leavitt path algebras

    OpenAIRE

    Goncalves, Daniel; Yoneda, Gabriela

    2015-01-01

    In this work we realize Leavitt path algebras as partial skew groupoid rings. This yields a free path groupoid grading on Leavitt path algebras. Using this grading we characterize free path groupoid graded isomorphisms of Leavitt path algebras that preserves generators.

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

    DEFF Research Database (Denmark)

    Wang, Jens Erik; 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...... the importance of intermediate outcomes, which in the case of Nokia was the importance of software ecosystems and adaptable mobile devices. Furthermore, we show how the layers of path dependence mutually reinforce each other and become stronger....

  7. 一种图像压缩的改进方法%Context coding based on the shortest code length

    Institute of Scientific and Technical Information of China (English)

    罗迪; 张金鹏

    2014-01-01

    提出了一种自适应最短码长熵编码方法,用加权后的条件概率分布进行Context建模,最后用算术编码对图像进行编码,从而达到压缩效果。%This paper introduces an shortest adaptively yards long entropy coding method. After using the adaptively weighted conditional probability distribution of the Context modeling with arithmetic coding of image coding then achieve the compres-sion effect.

  8. A priori least expected time paths in fuzzy, time-variant transportation networks

    Science.gov (United States)

    Wang, Li; Gao, Ziyou; Yang, Lixing

    2016-02-01

    Dynamics and fuzziness are two significant characteristics of real-world transportation networks. To capture these two features theoretically, this article proposes the concept of a fuzzy, time-variant network characterized by a series of time-dependent fuzzy link travel times. To find an effective route guidance for travelers, the expected travel time is specifically adopted as an evaluation criterion to assess the route generation process. Then the shortest path problem is formulated as a multi-objective 0-1 optimization model for finding the least expected time path over the considered time horizon. Different from the shortest path problem in dynamic and random networks, an efficient method is proposed in this article to calculate the fuzzy expected travel time for each given path. A tabu search algorithm is designed for the problem to generate the best solution under the framework of linear weighted methods. Finally, two numerical experiments are performed to verify the effectiveness and efficiency of the model and algorithm.

  9. Measurement of the composition of noble-metal particles in high-burnup CANDU fuel by wavelength dispersive X-ray microanalysis

    Energy Technology Data Exchange (ETDEWEB)

    Hocking, W.H.; Szostak, F.J

    1999-09-01

    An investigation of the composition of the metallic inclusions in CANDU fuel, which contain Mo, Tc, Ru, Rh and Pd, has been conducted as a function of burnup by wavelength dispersive X-ray (WDX) microanalysis. Quantitative measurements were performed on micrometer sized particles embedded in thin sections of fuel using elemental standards and the ZAF method. Because the fission yields of the noble metals change with burnup, as a consequence of a shift from almost entirely {sup 235}U fission to mainly {sup 239}Pu fission, their inventories were calculated from the fuel power histories using the WIMS-Origin code for comparison with experiment. Contrary to expectations that the oxygen potential would be buffered by progressive Mo oxidation, little evidence was obtained for reduced incorporation of Mo in the noble-metal particles at high burnup. These surprising results are discussed with respect to the oxygen balance in irradiated CANDU fuels and the likely intrinsic and extrinsic sinks for excess oxygen. (author)

  10. Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games

    Directory of Open Access Journals (Sweden)

    Dmitrii D. Lozovanu

    2005-10-01

    Full Text Available We study the max-min paths problem, which represents a game version of the shortest and the longest paths problem in a weighted directed graph. In this problem the vertex set V of the weighted directed graph G=(V,E is divided into two disjoint subsets VA and VB which are regarded as positional sets of two players. The players are seeking for a directed path from the given starting position ν 0 to the final position ν f , where the first player intends to maximize the integral cost of the path while the second one has aim to minimize it. Polynomial-time algorithm for determining max-min path in networks is proposed and its application for solving zero value cyclic games is developed. Mathematics Subject Classification 2000: 90B10, 90C35, 90C27.

  11. Identification of Optimal Path in Power System Network Using Bellman Ford Algorithm

    Directory of Open Access Journals (Sweden)

    S. Hemalatha

    2012-01-01

    Full Text Available Power system network can undergo outages during which there may be a partial or total blackout in the system. In that condition, transmission of power through the optimal path is an important problem in the process of reconfiguration of power system components. For a given set of generation, load pair, there could be many possible paths to transmit the power. The optimal path needs to consider the shortest path (minimum losses, capacity of the transmission line, voltage stability, priority of loads, and power balance between the generation and demand. In this paper, the Bellman Ford Algorithm (BFA is applied to find out the optimal path and also the several alternative paths by considering all the constraints. In order to demonstrate the capability of BFA, it has been applied to a practical 230 kV network. This restorative path search guidance tool is quite efficient in finding the optimal and also the alternate paths for transmitting the power from a generating station to demand.

  12. A Mathematical Modeling Method of the ShortestEmergency Evacuation Route%一种应急疏散最短路径的数学建模方法

    Institute of Scientific and Technical Information of China (English)

    禤家裕

    2015-01-01

    For the choice of the city emergency evacuation route,we discussed the modeling problem of the shortest path by using mathematical method.We analyzed the weight quantization of emergencyevacuation path planning optimization and constrainted-node graph transformation by using fuzzy concept and graph analysis method respectively, gave the corresponding solutions and showed the steps of solving problems in combination with some simple examples.Finally we illustrated actual use value and deficiency of the method.%针对城市应急疏散的路径选择,运用数学方法讨论了最短路径的建模问题。使用模糊概念和图论分析方法分别对应急疏散路径规划优化中的路径权值量化和结点约束图转化进行分析,给出相应的解决方法,并结合简单例子说明了解决问题的步骤与方法。

  13. Career Path Descriptions

    CERN Document Server

    Charkiewicz, A

    2000-01-01

    Before the Career Path system, jobs were classified according to grades with general statutory definitions, guided by the "Job Catalogue" which defined 6 evaluation criteria with example illustrations in the form of "typical" job descriptions. Career Paths were given concise statutory definitions necessitating a method of description and evaluation adapted to their new wider-band salary concept. Evaluations were derived from the same 6 criteria but the typical descriptions became unusable. In 1999, a sub-group of the Standing Concertation Committee proposed a new guide for describing Career Paths, adapted to their wider career concept by expanding the 6 evaluation criteria into 9. For each criterion several levels were established tracing the expected evolution of job level profiles and personal competencies over their longer salary ranges. While providing more transparency to supervisors and staff, the Guide's official use would be by services responsible for vacancy notices, Career Path evaluations and rela...

  14. Tortuous path chemical preconcentrator

    Science.gov (United States)

    Manginell, Ronald P.; Lewis, Patrick R.; Adkins, Douglas R.; Wheeler, David R.; Simonson, Robert J.

    2010-09-21

    A non-planar, tortuous path chemical preconcentrator has a high internal surface area having a heatable sorptive coating that can be used to selectively collect and concentrate one or more chemical species of interest from a fluid stream that can be rapidly released as a concentrated plug into an analytical or microanalytical chain for separation and detection. The non-planar chemical preconcentrator comprises a sorptive support structure having a tortuous flow path. The tortuosity provides repeated twists, turns, and bends to the flow, thereby increasing the interfacial contact between sample fluid stream and the sorptive material. The tortuous path also provides more opportunities for desorption and readsorption of volatile species. Further, the thermal efficiency of the tortuous path chemical preconcentrator is comparable or superior to the prior non-planar chemical preconcentrator. Finally, the tortuosity can be varied in different directions to optimize flow rates during the adsorption and desorption phases of operation of the preconcentrator.

  15. Path Optimization Using APSO

    Directory of Open Access Journals (Sweden)

    Deepak Goyal

    2013-07-01

    Full Text Available This paper addresses the malicious node detection and path optimization problem for wireless sensor networks. Malicious node detection in neighborhood is a needed because that node may cause incorrect decisions or energy depletion. In this paper APSO (combination of Artificial bee colony and particular swarm optimization is used to choose an optimized path. Through this improved version we will overcome the disadvantage of local optimal which comes when we use PSO approach.

  16. The effect of varying path properties in path steering tasks

    NARCIS (Netherlands)

    Liu, L.; Liere, R. van

    2010-01-01

    Path steering is a primitive 3D interaction task that requires the user to navigate through a path of a given length and width. In a previous paper, we have conducted controlled experiments in which users operated a pen input device to steer a cursor through a 3D path subject to fixed path propertie

  17. Etude de l'influence du champ magnetique dans une section d'essais thermohydraulique d'un canal de reacteur nucleaire CANDU 6

    Science.gov (United States)

    Landry-Lavoie, Renaud

    This memoir deals with the effects of the magnetic fields present in a thermal hydraulic test section of the Canadian nuclear industry. This test section is used to determine the thermal hydraulic conditions that can lead to critical heat flux in a channel of a CANDU 6 nuclear reactor. To perform their series of experiments the STERN Company used strong electric currents to heat the simulation bundles with a thermal power similar to the one found in a channel of a CANDU reactor. The materials constituting the simulation channel and its supports are of ferromagnetic nature. The strong magnetic field generated by the bundles implies that they are subjected to a magnetostatic force due to the magnetization of the ferromagnetic materials. The nuclear industry wants to know if these efforts, combined with the force of gravity, are sufficient to maintain the bundles in place in the simulation channel. The question also arises whether or not the magnetic field present in the channel can affect the parameters of boiling heat transfer. To determine the magnetic field distribution in the simulation channel, we had recourse to the magnetostatic image method and the integral method of calculation of magnetization. The results of the calculations show that the magnetostatic forces exerted by the ferromagnetic elements of the test section are inferior in magnitude to the one estimated by the STERN laboratorie. We used the mechanistic model of Sullivan et al. (1964) to evaluate the possible influence of the magnetic fields on the departure diameter of the vapor bubbles. The deviation in the frequency of bubble emission was evaluated by using the correlations of Zuber et al. (1959) and Cole (1960). By introducing a magnetostatic force in the boiling model and in the correlations, we demonstrated that the magnetic field present in the STERN test section has a negligible effect on the bubble departure diameter and their emission frequency. We conclude that the conditions in the test

  18. Improving Christofides' Algorithm for the s-t Path TSP

    CERN Document Server

    An, Hyung-Chan; Shmoys, David B

    2011-01-01

    We present a deterministic (1+sqrt(5))/2-approximation algorithm for the s-t path TSP. Given a symmetric metric cost between n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the two endpoints; Hoogeveen showed that the natural variant of Christofides' algorithm is a 5/3-approximation algorithm for this problem, and this asymptotically tight bound in fact has been the best approximation ratio known until now. We modify this algorithm so that it chooses the initial spanning tree based on an optimal solution to the Held-Karp relaxation rather than a minimum spanning tree; we prove this simple but crucial modification leads to an improved approximation ratio, surpassing the 20-year-old barrier set by the natural Christofides' algorithm variant. Our algorithm also proves an upper bound of (1+sqrt(5))/2 on the integrality gap of the path-variant Held-Karp relaxation. The techniques devised in this paper can be applied to other optimization problems over s-t...

  19. Smoothing of Piecewise Linear Paths

    Directory of Open Access Journals (Sweden)

    Michel Waringo

    2008-11-01

    Full Text Available We present an anytime-capable fast deterministic greedy algorithm for smoothing piecewise linear paths consisting of connected linear segments. With this method, path points with only a small influence on path geometry (i.e. aligned or nearly aligned points are successively removed. Due to the removal of less important path points, the computational and memory requirements of the paths are reduced and traversing the path is accelerated. Our algorithm can be used in many different applications, e.g. sweeping, path finding, programming-by-demonstration in a virtual environment, or 6D CNC milling. The algorithm handles points with positional and orientational coordinates of arbitrary dimension.

  20. TRACING EFFICIENT PATH USING WEB PATH TRACING

    Directory of Open Access Journals (Sweden)

    L.K. Joshila Grace

    2014-01-01

    Full Text Available In the fast improving society, people depend on online purchase of goods than spending time physically. So there are lots of resources emerged for this online buying and selling of materials. Efficient and attractive web sites would be the best to sell the goods to people. To know whether a web site is reaching the mind of the customers or not, a high speed analysis is done periodically by the web developers. This works helps for the web site developers in knowing the weaker and stronger section of their web site. Parameters like frequency and utility are used for quantitative and qualitative analysis respectively. Addition to this down loads, book marks and the like/dislike of the particular web site is also considered. A new web path trace tree structure is implemented. A mathematical implementation is done to predict the efficient pattern used by the web site visitors.

  1. CANDU heat sinks improvements as a follow up to Fukushima Daiichi accident ''the regulator perspective''

    Energy Technology Data Exchange (ETDEWEB)

    Mesmous, Noreddine; Harwood, Chris [Canadian Nuclear Safety Commission, Ottawa, ON (Canada)

    2015-06-15

    The purpose of this paper is to provide a summary of the Canadian Nuclear Safety Commission (CNSC) recommendations related to improving the heat sink strategy as a follow up to the Fukushima Daiichi Accident (FDA). As a follow up to FDA, CNSC staff tasked the Nuclear Power Plant (NPP) licensees to review the lessons learned from the FDA and re-examine the NPP safety cases. The reviews have examined the CANDU defence-in-depth strategy and considered events more severe than those that have historically been regarded as credible, and evaluated their impact on the NPPs safety. Availability of emergency equipment was shown to be crucial during the FDA and its availability could have arrested the accident progression early enough to minimize any radioactive release to the environment. As a result, licensees presented appropriate evaluations of the means to provide coolant make-up to the primary Heat Transport System (HTS), boilers, moderator, calandria vault, and irradiated fuel pools.

  2. Methods of evaluation of accuracy with multiple essential parameters for eddy current measurement of pressure tube to calandria tube gap in CANDU reactors

    Energy Technology Data Exchange (ETDEWEB)

    Shokralla, S., E-mail: shaddy.shokralla@opg.com [Ontario Power Generation, IMS NDE Projects, Ajax, Ontario (Canada); Krause, T.W., E-mail: thomas.krause@rmc.ca [Royal Military College of Canada, Kingston, Ontario (Canada)

    2014-01-15

    The purpose of inspection qualification of a particular inspection system is to show that it meets applicable inspection specification requirements. Often a requirement of the inspection system is that it meets a particular accuracy. In the case of a system with multiple inputs accompanied by additional influential parameters, calculation of the system's output accuracy can be formidable. Measurement of pressure-tube to calandria tube gap in CANDU reactors using an eddy current based technique is presented as a particular example of a system where multiple essential parameters combine to generate a final uncertainty for the inspection system. This paper outlines two possible methods of calculating such a system's accuracy, and discusses the advantages and disadvantages of each. (author)

  3. Comparison of MCNP4B and WIMS-AECL calculations of coolant-void-reactivity effects for uniform lattices of CANDU fuel

    Energy Technology Data Exchange (ETDEWEB)

    Kozier, K.S

    1999-05-01

    This paper compares the results of coolant-void reactivity (CVR) reactor-physics calculations performed using the Monte Carlo N-particle transport code, MCNP version 4B, with those obtained using Atomic Energy of Canada Limited's (AECL's) latest version of the Winfrith improved multigroup scheme (WIMS) code, WIMS-AECL version 2-5c. Cross sections derived from the evaluated nuclear data file version B-VI (ENDF/B-VI) are used for both the WIMS-AECL and MCNP4B calculations. The comparison is made for uniform lattices at room temperature containing either fresh natural uranium or mixed oxide (MOX) 37-element CANDU fuel. The MOX fuel composition corresponds roughly to that of irradiated CANDU fuel at a burnup of about 4500 MWd/tU. The level of agreement between the CVR predictions of WIMS-AECL and MCNP4B is studied as a function of lattice buckling (a measure of the curvature of the neutron-flux distribution) over the range from 0.0 to 4.1 m{sup -2} . For the cases studied, it is found that the absolute k values calculated by WIMS-AECL are higher than those of MCNP4B by several mk (1 mk is a change of 0.001 in k), amounts that depend on the fuel type being modelled and the particular cross-section data used. However, the agreement between WIMS-AECL and MCNP4B is much better for the CVR (i.e., the {delta}k on coolant voiding), and is relatively insensitive to the fuel type. (author)

  4. Comparison of MCNP4B and WIMS-AECL calculations of coolant-void-reactivity effects for uniform lattices of CANDU fuel

    Energy Technology Data Exchange (ETDEWEB)

    Kozier, K.S. [Atomic Energy of Canada Limited, Chalk River, Ontario (Canada)

    1999-07-01

    This paper compares the results of coolant-void reactivity (CVR) reactor-physics calculations performed using the Monte Carlo N-particle transport code, MCNP version 4B, with those obtained using Atomic Energy of Canada Limited's (AECL's) latest version of the Winfrith improved multigroup scheme (WIMS) code, WIMS-AECL version 2-5c. Cross sections derived from the evaluated nuclear data file version B-VT (ENDF/B-VI) are used for both the WIMS-AECL and MCNP4B calculations. The comparison is made for uniform lattices at room temperature containing either fresh natural uranium or mixed oxide (MOX) 37-element CANDU fuel. The MOX fuel composition corresponds roughly to that of irradiated CANDU fuel at a burnup of about 4500 MWd/tU. The level of agreement between the CVR predictions of WIMS-AECL and MCNP4B is studied as a function of lattice buckling (a measure of the curvature of the neutron-flux distribution) over the range from 0.0 to 4.1 m{sup -2}. For the cases studied, it is found that the absolute keff values calculated by WIMS-AECL are higher than those of MCNP4B by several mk (1 mk is a change of 0.001 in keff), amounts that depend on the fuel type being modelled and the particular cross-section data used. However, the agreement between WIMS-AECL and MCNP4B is much better for the CVR (i.e., the {delta}keff on coolant voiding), and is relatively insensitive to the fuel type. (author)

  5. A feasibility study on the use of the MOOSE computational framework to simulate three-dimensional deformation of CANDU reactor fuel elements

    Energy Technology Data Exchange (ETDEWEB)

    Gamble, Kyle A., E-mail: Kyle.Gamble@inl.gov [Royal Military College of Canada, Chemistry and Chemical Engineering, 13 General Crerar Crescent, Kingston, Ontario, Canada K7K 7B4 (Canada); Williams, Anthony F., E-mail: Tony.Williams@cnl.ca [Canadian Nuclear Laboratories, Fuel and Fuel Channel Safety, 1 Plant Road, Chalk River, Ontario, Canada K0J 1J0 (Canada); Chan, Paul K., E-mail: Paul.Chan@rmc.ca [Royal Military College of Canada, Chemistry and Chemical Engineering, 13 General Crerar Crescent, Kingston, Ontario, Canada K7K 7B4 (Canada); Wowk, Diane, E-mail: Diane.Wowk@rmc.ca [Royal Military College of Canada, Mechanical and Aerospace Engineering, 13 General Crerar Crescent, Kingston, Ontario, Canada K7K 7B4 (Canada)

    2015-11-15

    Highlights: • This is the first demonstration of using the MOOSE framework for modeling CANDU fuel. • Glued and frictionless contact algorithms behave as expected for 2D and 3D cases. • MOOSE accepts and correctly interprets functions of arbitrary form. • 3D deformation calculations accurately compare against analytical solutions. • MOOSE is a viable simulation tool for modeling accident reactor conditions. - Abstract: Horizontally oriented fuel bundles, such as those in CANada Deuterium Uranium (CANDU) reactors present unique modeling challenges. After long irradiation times or during severe transients the fuel elements can laterally deform out of plane due to processes known as bow and sag. Bowing is a thermally driven process that causes the fuel elements to laterally deform when a temperature gradient develops across the diameter of the element. Sagging is a coupled mechanical and thermal process caused by deformation of the fuel pin due to creep mechanisms of the sheathing after long irradiation times and or high temperatures. These out-of-plane deformations can lead to reduced coolant flow and a reduction in coolability of the fuel bundle. In extreme cases element-to-element or element-to-pressure tube contact could occur leading to reduced coolant flow in the subchannels or pressure tube rupture leading to a loss of coolant accident. This paper evaluates the capability of the Multiphysics Object-Oriented Simulation Environment (MOOSE) framework developed at the Idaho National Laboratory to model these deformation mechanisms. The material model capabilities of MOOSE and its ability to simulate contact are also investigated.

  6. Reparametrizations of Continuous Paths

    DEFF Research Database (Denmark)

    Fahrenberg, Uli; Raussen, Martin

    2007-01-01

    compare it to the distributive lattice of countable subsets of the unit interval. The results obtained are used to analyse the space of traces in a topological space, i.e., the space of continuous paths up to reparametrization equivalence. This space is shown to be homeomorphic to the space of regular...

  7. MEASURING PATH DEPENDENCY

    Directory of Open Access Journals (Sweden)

    Peter Juhasz

    2017-03-01

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

  8. LBB in Candu plants

    Energy Technology Data Exchange (ETDEWEB)

    Kozluk, M.J.; Vijay, D.K. [Ontario Hydro Nuclear, Toronto, Ontario (Canada)

    1997-04-01

    Postulated catastrophic rupture of high-energy piping systems is the fundamental criterion used for the safety design basis of both light and heavy water nuclear generating stations. Historically, the criterion has been applied by assuming a nonmechanistic instantaneous double-ended guillotine rupture of the largest diameter pipes inside of containment. Nonmechanistic, meaning that the assumption of an instantaneous guillotine rupture has not been based on stresses in the pipe, failure mechanisms, toughness of the piping material, nor the dynamics of the ruptured pipe ends as they separate. This postulated instantaneous double-ended guillotine rupture of a pipe was a convenient simplifying assumption that resulted in a conservative accident scenario. This conservative accident scenario has now become entrenched as the design basis accident for: containment design, shutdown system design, emergency fuel cooling systems design, and to establish environmental qualification temperature and pressure conditions. The requirement to address dynamic effects associated with the postulated pipe rupture subsequently evolved. The dynamic effects include: potential missiles, pipe whipping, blowdown jets, and thermal-hydraulic transients. Recent advances in fracture mechanics research have demonstrated that certain pipes under specific conditions cannot crack in ways that result in an instantaneous guillotine rupture. Canadian utilities are now using mechanistic fracture mechanics and leak-before-break assessments on a case-by-case basis, in limited applications, to support licensing cases which seek exemption from the need to consider the various dynamic effects associated with postulated instantaneous catastrophic rupture of high-energy piping systems inside and outside of containment.

  9. Nonadiabatic transition path sampling

    Science.gov (United States)

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

    2016-07-01

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

  10. Cosmological Feynman Paths

    CERN Document Server

    Chew, Geoffrey F

    2008-01-01

    Arrowed-time divergence-free rules or cosmological quantum dynamics are formulated through stepped Feynman paths across macroscopic slices of Milne spacetime. Slice boundaries house totally-relativistic rays representing elementary entities--preons. Total relativity and the associated preon Fock space, despite distinction from special relativity (which lacks time arrow), are based on the Lorentz group. Each path is a set of cubic vertices connected by straight, directed and stepped arcs that carry inertial, electromagnetic and gravitational action. The action of an arc step comprises increments each bounded by Planck's constant. Action from extremely-distant sources is determined by universe mean energy density. Identifying the arc-step energy that determines inertial action with that determining gravitational action establishes both arc-step length and universe density. Special relativity is accurate for physics at laboratory spacetime scales far below that of Hubble and far above that of Planck.

  11. Optimal Path Query Based on Cost Function Over Multi-Cost Graphs%多维代价图模型上最优路径查询问题的研究

    Institute of Scientific and Technical Information of China (English)

    杨雅君; 高宏; 李建中

    2012-01-01

    近年来,图数据模型被广泛地用于刻画现实世界中各种各样的实体间的复杂关系.最短路径查询是图研究领域中一类非常重要的查询并有着广泛的应用.然而,目前大多数关于最短路径的查询都是定义在单代价(权重)图模型下的.现实世界中,基于单一代价所选择的最短路径并不明智,比如路程最短的路径需要花费极高的费用.该文中,作者介绍了多维代价图模型的概念,并给出了多维代价图模型下基于函数的最优路径的定义.现有的计算最短路径的方法都利用了最短路径的子路径最优的性质:最短路径上的任意两点间的子路径是这两点的最短路径.因此,在计算最短路径的过程中,对访问过的每个顶点,只需保留起点到该点的最短路径即可.不幸的是,多维代价图模型下,当评分函数是非线性的时候,子路径最优的性质并不成立.因此,目前的方法均不能应用于多维代价图模型下基于函数的最优路径查询问题.该文给出了一个best-first search分支界限法并给出3种优化策略.进一步,给出了一个顶点过滤算法,该算法能从图中过滤掉大部分不属于最优路径的顶点.最后,用真实数据集上的实验验证了算法的有效性.%Graphs have been widely used to model complex relationships among various entities in real applications. Shortest path query is an important problem in graphs and has been well-studied. However, most approaches for shortest path are based on single-cost (weight) graphs. However, it is non-sufficient that considering only one cost type. In this paper, we introduce the definition of multi-cost graph and propose a new query: the optimal path query based on function over multi-cost graphs. Most existing methods to compute shortest path utilize the property of optimal sub-path in shortest path; any sub-path of a shortest path is also a shortest path. Thus, they only need to maintain the

  12. PATHS groundwater hydrologic model

    Energy Technology Data Exchange (ETDEWEB)

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

    1980-04-01

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

  13. Path planning in dynamic environments

    NARCIS (Netherlands)

    Berg, J.P. van den

    2007-01-01

    Path planning plays an important role in various fields of application, such as CAD design, computer games and virtual environments, molecular biology, and robotics. In its most general form, the path planning problem is formulated as finding a collision-free path for a moving entity between a start

  14. Research on the Shortest Quadratic Spline Interpolation%最短二次样条插值研究

    Institute of Scientific and Technical Information of China (English)

    陈刚; 高尚

    2011-01-01

    The spline technology has applications widely in CAD, CAM, and computer graphics systems.The qualification of quadratic spline interpolation is discussed firstly.The solutions of quadratic spline interpolation on one kind of boundary conditions are given.Based on analysis of quadratic spline interpolation, the shortest quadratic spline interpolation is discussed.Furthermore, golden section method is put forward to solve this problem.At last, computation methods are illustrated by examples.%样条技术在计算机辅助设计,计算机辅助制造,和计算机图形系统得到了广泛应用.分析了二次样条函数插值的条件,给出了其中一种边值条件二次样条插值的求解方法.在分析了样条函数插值基础上,提出最短二次样条插值问题,并提出用黄金分割法解决该问题.最后给出了实例来说明求解方法.

  15. The shortest period sdB plus white dwarf binary CD-30 11223 (GALEX J1411-3053)

    CERN Document Server

    Vennes, S; O'Toole, S J; Nemeth, P; Burton, D

    2012-01-01

    We report on the discovery of the shortest period binary comprising a hot subdwarf star (CD-30 11223, GALEX J1411-3053) and a massive unseen companion. Photometric data from the All Sky Automated Survey show ellipsoidal variations of the hot subdwarf primary and spectroscopic series revealed an orbital period of 70.5 minutes. The large velocity amplitude suggests the presence of a massive white dwarf in the system (M_2/M_sun > 0.77) assuming a canonical mass for the hot subdwarf (0.48 M_sun), although a white dwarf mass as low as 0.75 M_sun is allowable by postulating a subdwarf mass as low as 0.44 M_sun. The amplitude of ellipsoidal variations and a high rotation velocity imposed a high-inclination to the system (i > 68 deg) and, possibly, observable secondary transits (i > 74 deg). At the lowest permissible inclination and assuming a subdwarf mass of ~0.48 M_sun, the total mass of the system reaches the Chandrasekhar mass limit at 1.35 M_sun and would exceed it for a subdwarf mass above 0.48 M_sun. The syst...

  16. RXJ0806.3+1527 a double degenerate binary with the shortest known orbital period (321s)

    CERN Document Server

    Israel, G L; Covino, S; Campana, S; Appenzeller, I; Gässler, W; Mantel, K H; Marconi, G; Mauche, C W; Munari, U; Negueruela, I; Nicklas, H; Rupprecht, G; Smart, R L; Stahl, O; Stella, L

    2002-01-01

    We carried out optical observations of the field of the X-ray pulsator RXJ0806.3+1527. A blue V=21.1 star was found to be the only object consistent with the X-ray position. VLT FORS spectra revealed a blue continuum with no intrinsic absorption lines. Broad (v~1500 km/s), low equivalent width (about -1/-6A) emission lines from the HeII Pickering series were clearly detected. B, V and R time-resolved photometry revealed the presence of about 15% pulsations at the 321s X-ray period, confirming the identification. These findings, together with the period stability and absence of any additional modulation in the 1min-5hr period range, argue in favour of the orbital interpretation of the 321s pulsations. The most likely scenario is thus that RXJ0806.3+1527 is a double degenerate system of the AM CVn class. This would make RXJ0806.3+1527 the shortest orbital period binary currently known and one of the best candidates for gravitational wave detection.

  17. Identifying codes and locating-dominating sets on paths and cycles

    CERN Document Server

    Chen, Chunxia; Miao, Zhengke

    2009-01-01

    Let $G=(V,E)$ be a graph and let $r\\ge 1$ be an integer. For a set $D \\subseteq V$, define $N_r[x] = \\{y \\in V: d(x, y) \\leq r\\}$ and $D_r(x) = N_r[x] \\cap D$, where $d(x,y)$ denotes the number of edges in any shortest path between $x$ and $y$. $D$ is known as an $r$-identifying code ($r$-locating-dominating set, respectively), if for all vertices $x\\in V$ ($x \\in V\\backslash D$, respectively), $D_r(x)$ are all nonempty and different. In this paper, we provide complete results for $r$-identifying codes in paths and odd cycles; we also give complete results for 2-locating-dominating sets in cycles.

  18. A new efficient optimal path planner for mobile robot based on Invasive Weed Optimization algorithm

    Science.gov (United States)

    Mohanty, Prases K.; Parhi, Dayal R.

    2014-12-01

    Planning of the shortest/optimal route is essential for efficient operation of autonomous mobile robot or vehicle. In this paper Invasive Weed Optimization (IWO), a new meta-heuristic algorithm, has been implemented for solving the path planning problem of mobile robot in partially or totally unknown environments. This meta-heuristic optimization is based on the colonizing property of weeds. First we have framed an objective function that satisfied the conditions of obstacle avoidance and target seeking behavior of robot in partially or completely unknown environments. Depending upon the value of objective function of each weed in colony, the robot avoids obstacles and proceeds towards destination. The optimal trajectory is generated with this navigational algorithm when robot reaches its destination. The effectiveness, feasibility, and robustness of the proposed algorithm has been demonstrated through series of simulation and experimental results. Finally, it has been found that the developed path planning algorithm can be effectively applied to any kinds of complex situation.

  19. Path Through the Wheat

    Directory of Open Access Journals (Sweden)

    David Middleton

    2005-01-01

    Full Text Available The hillside’s tidal waves of yellow-green Break downward into full-grown stalks of wheat In which a peasant, shouldering his hoe Passes along a snaking narrow path -- A teeming place through which his hard thighs press And where his head just barely stays above The swaying grain, drunken in abundance, Farm buildings almost floating on the swells Beyond which sea gulls gliding white in air Fly down on out of sight to salty fields, Taking the channel fish off Normandy, A surfeit fit for Eden i...

  20. Lexicographic Path Induction

    DEFF Research Database (Denmark)

    Schürmann, Carsten; Sarnat, Jeffrey

    2009-01-01

    Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of equality in type theory, equivalence testing of traces in security, etc. Although the principle of transfinite induction...... an induction principle that combines the comfort of structural induction with the expressive strength of transfinite induction. Using lexicographic path induction, we give a consistency proof of Martin-Löf’s intuitionistic theory of inductive definitions. The consistency of Heyting arithmetic follows directly...

  1. JAVA PathFinder

    Science.gov (United States)

    Mehhtz, Peter

    2005-01-01

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

  2. Rocket Flight Path

    Directory of Open Access Journals (Sweden)

    Jamie Waters

    2014-09-01

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

  3. Feasibility assessment of path-planning for pipeline system construction of electric utilities network enhancement

    Energy Technology Data Exchange (ETDEWEB)

    Lin, C.C.; Huang, S.J. [National Cheng Kung Univ., Tainan, Taiwan (China). Dept. of Electrical Engineering

    2007-07-01

    This paper proposed an algorithm to improve the power transmission network in Taiwan which has experienced increased competition since the addition of competitive local exchange carriers (CLEC) into the telecommunication market. Recently, the CLECs requested to rent pipelines from the original incumbent local exchange carriers (ILECs) and from the Taiwan Power Company. The Taiwan Power Company not only builds transmission lines, but also telecommunication networks using different kinds of fiber optic cables, including Optical Power Ground Wire (OPGW), All-Dielectric Self-Supporting (ADSS), and Wrapped types (WOC). This paper also discussed the integration of pipeline rent-out work with AM/FM/geographic information system software. The Java-based software determines a shortest path-planning method for the piping layout to help improve the pipeline system and the construction of an electricity network. The method is expected to increase the use of existing pipelines by improving the efficiency of network planning and maintenance. The method also reduces the potential for design faults and is easy to apply in the field due to the clear criteria. This paper described the proposed system architecture in detail and presented test results. It was shown that the use of a shortest path for the piping layout can reduce the distance between manholes in the huge network. According to test results, the proposed method is considered to be feasible. 11 refs., 2 tabs., 10 figs.

  4. Nonoptimal component placement, but short processing paths, due to long-distance projections in neural systems.

    Directory of Open Access Journals (Sweden)

    Marcus Kaiser

    2006-07-01

    Full Text Available It has been suggested that neural systems across several scales of organization show optimal component placement, in which any spatial rearrangement of the components would lead to an increase of total wiring. Using extensive connectivity datasets for diverse neural networks combined with spatial coordinates for network nodes, we applied an optimization algorithm to the network layouts, in order to search for wire-saving component rearrangements. We found that optimized component rearrangements could substantially reduce total wiring length in all tested neural networks. Specifically, total wiring among 95 primate (Macaque cortical areas could be decreased by 32%, and wiring of neuronal networks in the nematode Caenorhabditis elegans could be reduced by 48% on the global level, and by 49% for neurons within frontal ganglia. Wiring length reductions were possible due to the existence of long-distance projections in neural networks. We explored the role of these projections by comparing the original networks with minimally rewired networks of the same size, which possessed only the shortest possible connections. In the minimally rewired networks, the number of processing steps along the shortest paths between components was significantly increased compared to the original networks. Additional benchmark comparisons also indicated that neural networks are more similar to network layouts that minimize the length of processing paths, rather than wiring length. These findings suggest that neural systems are not exclusively optimized for minimal global wiring, but for a variety of factors including the minimization of processing steps.

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

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

  7. Path Integrals in Quantum Physics

    CERN Document Server

    Rosenfelder, R

    2012-01-01

    These lectures aim at giving graduate students an introduction to and a working knowledge of path integral methods in a wide variety of fields in physics. Consequently, the lecture notes are organized in three main parts dealing with non-relativistic quantum mechanics, many-body physics and field theory. In the first part the basic concepts of path integrals are developed in the usual heuristic, non-mathematical way followed by standard examples and special applications including numerical evaluation of (euclidean) path integrals by Monte-Carlo methods with a program for the anharmonic oscillator. The second part deals with the application of path integrals in statistical mechanics and many-body problems treating the polaron problem, dissipative quantum systems, path integrals over ordinary and Grassmannian coherent states and perturbation theory for both bosons and fermions. Again a simple Fortran program is included for illustrating the use of strong-coupling methods. Finally, in the third part path integra...

  8. Path integrals for awkward actions

    CERN Document Server

    Amdahl, David

    2016-01-01

    Time derivatives of scalar fields occur quadratically in textbook actions. A simple Legendre transformation turns the lagrangian into a hamiltonian that is quadratic in the momenta. The path integral over the momenta is gaussian. Mean values of operators are euclidian path integrals of their classical counterparts with positive weight functions. Monte Carlo simulations can estimate such mean values. This familiar framework falls apart when the time derivatives do not occur quadratically. The Legendre transformation becomes difficult or so intractable that one can't find the hamiltonian. Even if one finds the hamiltonian, it usually is so complicated that one can't path-integrate over the momenta and get a euclidian path integral with a positive weight function. Monte Carlo simulations don't work when the weight function assumes negative or complex values. This paper solves both problems. It shows how to make path integrals without knowing the hamiltonian. It also shows how to estimate complex path integrals b...

  9. innovation path exploration

    Directory of Open Access Journals (Sweden)

    Li Jian

    2016-01-01

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

  10. Entanglement by Path Identity

    CERN Document Server

    Krenn, Mario; Lahiri, Mayukh; Zeilinger, Anton

    2016-01-01

    Quantum entanglement is one of the most prominent features of quantum mechanics and forms the basis of quantum information technologies. Here we present a novel method for the creation of quantum entanglement in multipartite and high-dimensional photonic systems, exploiting an idea introduced by the group of Leonard Mandel 25 years ago. The two ingredients are 1) superposition of photon pairs with different origins and 2) aligning photon paths such that they emerge from the same output mode. We explain examples for the creation of various classes of multiphoton entanglement encoded in polarization as well as in high-dimensional Hilbert spaces -- starting only from separable (non-entangled) photon pairs. For two photons, we show how arbitrary high-dimensional entanglement can be created. Interestingly, a common source for two-photon polarization entanglement is found as a special case. We discovered the technique by analyzing the output of a computer algorithm designing quantum experiments, and generalized it ...

  11. Propagators and path integrals

    Energy Technology Data Exchange (ETDEWEB)

    Holten, J.W. van

    1995-08-22

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

  12. Phased array ultrasonic technology (PAUT) contribution to detection and sizing of microbially influenced corrosion (MIC) of service water systems and shutdown coolers heat exchangers in OPG CANDU stations

    Energy Technology Data Exchange (ETDEWEB)

    Ciorau, P.; Pullia, L.; Hazelton, T., E-mail: peter.ciorau@opg.com, E-mail: lou.pullia@opg.com, E-mail: trek.hazelton@opg.com [Ontario Power Generation, Toronto, Ontario (Canada); Daks, W. [CAD WIRE, Markham, Ontario (Canada)

    2008-07-01

    Three PAUT techniques [linear scan - longitudinal waves, sector scan -longitudinal waves and sector scan-transverse waves] were developed and validated to assess the MIC attack in service water systems (SWS) and shutdown coolers heat-exchangers (SDC-HX) of Darlington and Pickering CANDU stations. PAUT employs linear array probes with a frequency between 4-12 MHz, depending on surface conditions, component geometry and MIC size/category to be detected. Examples from lab validation and field trials are presented. Based on field trials results, the techniques were optimized and new cal blocks were manufactured. It was demonstrated for mid-length pipes and for SDC-HX, the PAUT is the best technique compared with D-meter conventional UT and with guided waves. The expected field accuracy is about 0.5 mm (0.020{sup )} for large MIC attack. The ligament evaluation is technically achievable for colonies / pin holes located 2 mm under the outer surface. Improvements were identified and implemented for the next outages. (author)

  13. Measurements of grain-boundary inventories of {sup 137}Cs, {sup 90}Sr and {sup 99}Tc in used CANDU fuel

    Energy Technology Data Exchange (ETDEWEB)

    Stroes-Gascoyne, S.; Tait, J.C.; Porth, R.J.; McConnell, J.L.; Barnsdale, T.R.; Watson, S. [Whiteshell Labs., Pinawa, Manitoba (Canada)

    1993-12-31

    Two methods were used to measure grain-boundary inventories of {sup 137}Cs, {sup 90}Sr and {sup 99}Tc in used CANDU fuel, to corroborate source term estimates based on a fission gas release code. Used fuels were partially oxidized at 200{degrees}C in air to overall compositions of UO{sub 2+x} (0.15{<=} {times} {<=}0.25) to expose UO{sub 2} grain boundaries, followed by leaching in aqueous solution. Only a fraction (2 to 18%) of the calculated gap + grain-boundary inventories for {sup 137}Cs was released. This suggests that the calculations overestimate Cs release or that oxidation does not expose all grain boundaries, or that Cs release from grain boundaries is slow. Release of {sup 90}Sr (0.01 to 0.7%) agreed reasonably well with the source term estimates (0.001 to 0.3%). Release of {sup 99}Tc (0.3 to 1.5%) suggests that the source term estimate for the upper involved leaching of crushed and side-fractionated used fuel in either a static or dynamic system. A direct one-to-one correlation between calculated and measured gap + grain-boundary inventories for {sup 137}Cs was found for low- and medium-power fuels.

  14. CFD simulations of the single-phase and two-phase coolant flow of water inside the original and modified CANDU 37-element bundles

    Energy Technology Data Exchange (ETDEWEB)

    Abbasian, F.; Hadaller, G.I.; Fortman, R.A. [Stern Laboratories, Hamilton, Ontario (Canada)

    2010-07-01

    Single-phase (inlet temperature of 180° C, outlet pressure of 9 MPa, total power of 2 MW and flow rate of 13.5 Kg/s), and two-phase (inlet temperature of 265° C, outlet pressure of 10 MPa, total power of 7.126 MW and flow rate of 19 Kg/s) water flows inside a CANDU thirty seven element fuel string are simulated using a Computational Fluid Dynamics (CFD) code with parallel processing and results are presented in this paper. The analyses have been performed for the original and modified (11.5 mm center element diameter) designs with skewed cosine axial heat flux distribution and 5.1% diametral creep of the pressure tube. The CFD results are in good agreement with the expected temperature and velocity cross-sectional distributions. The effect of the pressure tube creep on the flow bypass is detected, and the CHF improvement in the core region of the modified design is confirmed. The two-phase flow model reasonably predicted the void distribution and the role of interfacial drag on increasing the pressure drop. In all CFD models, the appendages were shown to enhance the production of cross flows and their corresponding flow mixing and asymmetry. (author)

  15. PARTICULARITIES REGARDING THE OPERATING PROCESS OF THE CUTTING AND EXTRACTION DEVICE IN THE CANDU HORIZONTAL FUEL CHANNELS PRESSURE TUBE DECOMMISSIONING PART II: CUTTING AND EXTRACTING PRESSURE TUBE PROCESS

    Directory of Open Access Journals (Sweden)

    Constantin POPESCU

    2016-05-01

    Full Text Available This paper presents some details of operation process for a Cutting and Extraction Device (CED in order to achieve the decommissioning of the horizontal fuel channels pressure tube in the CANDU 6 nuclear reactor. The most important characteristic of the Cutting and Extraction Device (CED is his capability of totally operator’s protection against the nuclear radiation during pressure tube decommissioning. The cutting and extracting pressure tube processes present few particularities due to special adopted technical solutions: a special module with three cutting rollers (system driven by an actuator, a guiding-extracting and connecting module (three fixing claws which are piloted by an actuator and block the device in the connecting position with extracting plugs. The Cutting and Extraction Device (CED is a train of modules equipped with special systems to be fully automated, connected with a Programmable Logic Controller (PLC and controlled by an operator panel type Human Machine Interface (HMI. All processes are monitored by video cameras. In case of error, the process is automatically stopped, the operator receiving an error message and the last sequence could be reinitialized or aborted due to safety reasons.

  16. Path indexing for term retrieval

    OpenAIRE

    1992-01-01

    Different methods for term retrieval in deduction systems have been introduced in literature. This report eviews the three indexing techniques discrimination indexing, path indexing, and abstraction tree indexing. A formal approach to path indexing is presented and algorithms as well as data structures of an existing implementation are discussed. Eventually, experiments will show that our implementation outperforms the implementation of path indexing in the OTTER theorem prover.

  17. Path integral in Snyder space

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-04-29

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

  18. An introduction to critical paths.

    Science.gov (United States)

    Coffey, Richard J; Richards, Janet S; Remmert, Carl S; LeRoy, Sarah S; Schoville, Rhonda R; Baldwin, Phyllis J

    2005-01-01

    A critical path defines the optimal sequencing and timing of interventions by physicians, nurses, and other staff for a particular diagnosis or procedure. Critical paths are developed through collaborative efforts of physicians, nurses, pharmacists, and others to improve the quality and value of patient care. They are designed to minimize delays and resource utilization and to maximize quality of care. Critical paths have been shown to reduce variation in the care provided, facilitate expected outcomes, reduce delays, reduce length of stay, and improve cost-effectiveness. The approach and goals of critical paths are consistent with those of total quality management (TQM) and can be an important part of an organization's TQM process.

  19. Two Generations of Path Dependence

    DEFF Research Database (Denmark)

    Madsen, Mogens Ove

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

  20. Chromatic roots and hamiltonian paths

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2000-01-01

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

  1. Sustainable Energy Path

    Directory of Open Access Journals (Sweden)

    Hiromi Yamamoto

    2005-12-01

    Full Text Available The uses of fossil fuels cause not only the resources exhaustion but also the environmental problems such as global warming. The purposes of this study are to evaluate paths toward sustainable energy systems and roles of each renewable. In order to realize the purposes, the authors developed the global land use and energy model that figured the global energy supply systems in the future considering the cost minimization. Using the model, the authors conducted a simulation in C30R scenario, which is a kind of strict CO2 emission limit scenarios and reduced CO2 emissions by 30% compared with Kyoto protocol forever scenario, and obtained the following results. In C30R scenario bioenergy will supply 33% of all the primary energy consumption. However, wind and photovoltaic will supply 1.8% and 1.4% of all the primary energy consumption, respectively, because of the limits of power grid stability. The results imply that the strict limits of CO2 emissions are not sufficient to achieve the complete renewable energy systems. In order to use wind and photovoltaic as major energy resources, we need not only to reduce the plant costs but also to develop unconventional renewable technologies.

  2. Geographic Information System-Allocation Model for Forest Path: A Case Study in Ayer Hitam Forest Reserve, Malaysia

    Directory of Open Access Journals (Sweden)

    I. M. Hasmadi

    2010-01-01

    Full Text Available Problem statement: Forest road planning requires a host of information, particularly the availability of spatial and non-spatial data. The requirement of a planning system or tools to gather, integrate and manipulate all data is essential. The ability of Geographic Information System (GIS to integrate such massive information and develop a spatial model of earth features will lead to time and cost reduction and allows analysis of spatial problems more effective than the traditional method. Approach: The objective of this study was to test the potential of GIS in modeling forest road allocation in Ayer Hitam Forest Reserve (AHFR, Selangor, Malaysia. This study is also to compare a road profile (new path generated from GIS approach (new path with existing forest road and allocates the best road path for compartment 2 and 14. Data from digital topographic map was used to generate slope class, elevation class, direction and distance. New road paths were determined using spatial analyst. Several module or technique that used were cost weight, reclassify, raster calculator and shortest path modeling. Results: Results showed that road path generated from GIS technique was shorter and avoid more unnecessary slope and elevation. Road profiles such as elevation, slope and length were analyzed and discussed. Conclusion: The result clearly revealed that GIS has strength and played a vital role in modeling forest road allocation effectively and reduced time consuming.

  3. 14 CFR 23.57 - Takeoff path.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 1 2010-01-01 2010-01-01 false Takeoff path. 23.57 Section 23.57... path. For each commuter category airplane, the takeoff path is as follows: (a) The takeoff path extends... completed; and (1) The takeoff path must be based on the procedures prescribed in § 23.45; (2) The...

  4. Geodesic flows on path spaces

    Institute of Scientific and Technical Information of China (English)

    XIANG; Kainan

    2001-01-01

    [1] Cruzeiro, A. B., Malliavin, P., Renormalized differential geometry on path spaces: Structural equation, curvature, J. Funct. Anal., 1996, 139: 119-181.[2] Stroock, D. W., Some thoughts about Riemannian structures on path spaces, preprint, 1996.[3] Driver, B., A Cameron-Martin type quasi-invariance theorem for Brownian motion on a compact manifold, J. Funct. Anal., 1992, 109: 272-376.[4] Enchev, O., Stroock, D. W., Towards a Riemannian geometry on the path space over a Riemannian manifold, J. Funct. Anal., 1995, 134: 392-416.[5] Hsu, E., Quasi-invariance of the Wiener measure on the path space over a compact Riemannian manifold, J. Funct. Anal., 1995, 134: 417-450.[6] Lyons, T. J., Qian, Z. M., A class of vector fields on path space, J.Funct. Anal., 1997, 145: 205-223.[7] Li, X. D., Existence and uniqueness of geodesics on path spaces, J. Funct. Anal., to be published.[8] Driver, B., Towards calculus and geometry on path spaces, in Proc. Symp. Pure and Appl. Math. 57 (ed. Cranston, M., Pinsky, M.), Cornell: AMS, 1993, 1995.

  5. 重水堆蒸汽旁路阀控制改进及优化%The Betterment of Design and Control in Candu CSDV’S

    Institute of Scientific and Technical Information of China (English)

    焦允站; 罗良盖; 高江波

    2016-01-01

    On the basis of introducing the Candu CSDVS function, The different problems are analyzed during design, commissioning, operation and Methods to solve these problems are analyzed in detail, And in view of the solution and results are introduced, Focus on logic control and the problems existing in the actuator control component were deeply analyzed, Put forward the feasible solution, Ensures that is properly during adjusting the valve in the control range in various working conditions, and still make the CSDVS control to the normal range, to avoid level fluctuations and unexpected shutdown.%在介绍重水堆蒸汽旁路系统功能的基础上,针对在设计、调试以及运行期间存在的不同问题进行了剖析,对这些问题的解决方法进行了详细的分析,并针对解决方案和成效进行了介绍。重点地对逻辑控制和执行机构控制组件存在的问题进行了较深入分析,提出切实可行的解决办法。确保了在机组各个工况下时能正常调节阀门在控制范围内,避免出现阀门控制响应异常,进而造成机组意外甩负荷和功率损失。

  6. CONSIDERATIONS FOR THE DEVELOPMENT OF A DEVICE FOR THE DECOMMISSIONING OF THE HORIZONTAL FUEL CHANNELS IN THE CANDU 6 NUCLEAR REACTOR. PART 9 - CUTTING AND EXTRACTING DEVICE FUNCTIONING

    Directory of Open Access Journals (Sweden)

    Constantin POPESCU

    2015-05-01

    Full Text Available This paper presents a constructive solution proposed by the authors in order to achieve of a cutting and extracting device for the decommissioning of the horizontal fuel channels in the CANDU 6 nuclear reactor. The Cutting and Extraction Device (CED performs the dismantling, cutting and extraction of the fuel channel components. It's a flexible and modular device, which is designed to work inside the fuel channel and has the following functions: moving with variable speed, temperature monitoring and video surveillance inside the pipe, unblock and extract the channel closure plug (from End Fitting - EF, unblock and extract the channel shield plug (from Lattice Tube - LT, block and cut the middle of the pressure tube, block and cut the end of the pressure tube, block and extract the half of pressure tube. The Cutting and Extraction Device (CED consists of following modules: guiding-fixing module, traction modules, cutting module, guiding-extracting module and flexible elements for modules connecting. The guiding-fixing module is equipped with elastic guiding rollers and fixing claws in working position, the traction modules are provided with variable pitch rollers for allowing variable travel speed through the fuel channel. The cutting module is positioned in the middle of the device and it is equipped with three knife rolls for pressure tube cutting, using a system for cutting place video surveillance and pyrometers for monitoring cutting place temperature. The Cutting and Extraction Device (CED is fully automated, connected by wires to a Programmable Logic Controller (PLC and controlled from a Human Machine Interface (HMI. The design of the Cutting and Extraction Device (CED shall be achieved according to the particular features of the fuel channel components to be dismantled and to ensure radiation protection of workers.

  7. On the Reaction Path Hamiltonian

    Institute of Scientific and Technical Information of China (English)

    孙家钟; 李泽生

    1994-01-01

    A vector-fiber bundle structure of the reaction path Hamiltonian, which has been introduced by Miller, Handy and Adams, is explored with respect to molecular vibrations orthogonal to the reaction path. The symmetry of the fiber bundle is characterized by the real orthogonal group O(3N- 7) for the dynamical system with N atoms. Under the action of group O(3N- 7). the kinetic energy of the reaction path Hamiltonian is left invariant. Furthermore , the invariant behaviour of the Hamiltonian vector fields is investigated.

  8. Path integrals and quantum processes

    CERN Document Server

    Swanson, Marc S

    1992-01-01

    In a clearly written and systematic presentation, Path Integrals and Quantum Processes covers all concepts necessary to understand the path integral approach to calculating transition elements, partition functions, and source functionals. The book, which assumes only a familiarity with quantum mechanics, is ideal for use as a supplemental textbook in quantum mechanics and quantum field theory courses. Graduate and post-graduate students who are unfamiliar with the path integral will also benefit from this contemporary text. Exercise sets are interspersed throughout the text to facilitate self-

  9. Transition Path Theory

    Science.gov (United States)

    vanden-Eijnden, E.

    The dynamical behavior of many systems arising in physics, chemistry, biology, etc. is dominated by rare but important transition events between long lived states. For over 70 years, transition state theory (TST) has provided the main theoretical framework for the description of these events [17,33,34]. Yet, while TST and evolutions thereof based on the reactive flux formalism [1, 5] (see also [30,31]) give an accurate estimate of the transition rate of a reaction, at least in principle, the theory tells very little in terms of the mechanism of this reaction. Recent advances, such as transition path sampling (TPS) of Bolhuis, Chandler, Dellago, and Geissler [3, 7] or the action method of Elber [15, 16], may seem to go beyond TST in that respect: these techniques allow indeed to sample the ensemble of reactive trajectories, i.e. the trajectories by which the reaction occurs. And yet, the reactive trajectories may again be rather uninformative about the mechanism of the reaction. This may sound paradoxical at first: what more than actual reactive trajectories could one need to understand a reaction? The problem, however, is that the reactive trajectories by themselves give only a very indirect information about the statistical properties of these trajectories. This is similar to why statistical mechanics is not simply a footnote in books about classical mechanics. What is the probability density that a trajectory be at a given location in state-space conditional on it being reactive? What is the probability current of these reactive trajectories? What is their rate of appearance? These are the questions of interest and they are not easy to answer directly from the ensemble of reactive trajectories. The right framework to tackle these questions also goes beyond standard equilibrium statistical mechanics because of the nontrivial bias that the very definition of the reactive trajectories imply - they must be involved in a reaction. The aim of this chapter is to

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

  11. The Internet's unexploited path diversity

    CERN Document Server

    Arjona-Villicaña, Pedro David; Stepanenko, Alexander S

    2009-01-01

    The connectivity of the Internet at the Autonomous System level is influenced by the network operator policies implemented. These in turn impose a direction to the announcement of address advertisements and, consequently, to the paths that can be used to reach back such destinations. We propose to use directed graphs to properly represent how destinations propagate through the Internet and the number of arc-disjoint paths to quantify this network's path diversity. Moreover, in order to understand the effects that policies have on the connectivity of the Internet, numerical analyses of the resulting directed graphs were conducted. Results demonstrate that, even after policies have been applied, there is still path diversity which the Border Gateway Protocol cannot currently exploit.

  12. An Introduction to Path Analysis

    Science.gov (United States)

    Wolfe, Lee M.

    1977-01-01

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

  13. Scattering theory with path integrals

    Energy Technology Data Exchange (ETDEWEB)

    Rosenfelder, R. [Particle Theory Group, Paul Scherrer Institute, CH-5232 Villigen PSI (Switzerland)

    2014-03-15

    Starting from well-known expressions for the T-matrix and its derivative in standard nonrelativistic potential scattering, I rederive recent path-integral formulations due to Efimov and Barbashov et al. Some new relations follow immediately.

  14. Scattering Theory with Path Integrals

    CERN Document Server

    Rosenfelder, R

    2013-01-01

    Starting from well-known expressions for the $T$-matrix and its derivative in standard nonrelativistic potential scattering I rederive recent path-integral formulations due to Efimov and Barbashov et al. Some new relations follow immediately.

  15. Equivariant Localization of Path Integrals

    OpenAIRE

    Szabo, Richard J.

    1996-01-01

    We review equivariant localization techniques for the evaluation of Feynman path integrals. We develop systematic geometric methods for studying the semi-classical properties of phase space path integrals for dynamical systems, emphasizing the relations with integrable and topological quantum field theories. Beginning with a detailed review of the relevant mathematical background -- equivariant cohomology and the Duistermaat-Heckman theorem, we demonstrate how the localization ideas are relat...

  16. Path Integrals in Quantum Physics

    OpenAIRE

    2012-01-01

    These lectures aim at giving graduate students an introduction to and a working knowledge of path integral methods in a wide variety of fields in physics. Consequently, the lecture notes are organized in three main parts dealing with non-relativistic quantum mechanics, many-body physics and field theory. In the first part the basic concepts of path integrals are developed in the usual heuristic, non-mathematical way followed by standard examples and special applications including numerical ev...

  17. Asteroidal Quadruples in non Rooted Path Graphs

    Directory of Open Access Journals (Sweden)

    Gutierrez Marisa

    2015-11-01

    Full Text Available A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs. Several characterizations are known for directed path graphs: one by forbidden induced subgraphs and one by forbidden asteroids. It is an open problem to find such characterizations for rooted path graphs. For this purpose, we are studying in this paper directed path graphs that are non rooted path graphs. We prove that such graphs always contain an asteroidal quadruple.

  18. Anomalous paths in quantum mechanical path-integrals

    Energy Technology Data Exchange (ETDEWEB)

    Grimsmo, Arne L., E-mail: arne.grimsmo@ntnu.no [Department of Physics, The Norwegian University of Science and Technology, N-7491 Trondheim (Norway); Department of Physics, The University of Auckland, Private Bag 92019, Auckland (New Zealand); Klauder, John R., E-mail: klauder@phys.ufl.edu [Departments of Physics and Mathematics, University of Florida, Gainesville, FL 32611 (United States); Skagerstam, Bo-Sture K., E-mail: bo-sture.skagerstam@ntnu.no [Department of Physics, The Norwegian University of Science and Technology, N-7491 Trondheim (Norway); Kavli Institute for Theoretical Physics, Kohn Hall, University of California at Santa Barbara, CA 93106-4030 (United States); CREOL, The College of Optics and Photonics at the University of Central Florida, 4000 Central Florida Boulevard, Orlando, FL 32816 (United States)

    2013-11-25

    We investigate modifications of the discrete-time lattice action, for a quantum mechanical particle in one spatial dimension, that vanish in the naïve continuum limit but which, nevertheless, induce non-trivial effects due to quantum fluctuations. These effects are seen to modify the geometry of the paths contributing to the path-integral describing the time evolution of the particle, which we investigate through numerical simulations. In particular, we demonstrate the existence of a modified lattice action resulting in paths with any fractal dimension, d{sub f}, between one and two. We argue that d{sub f}=2 is a critical value, and we exhibit a type of lattice modification where the fluctuations in the position of the particle becomes independent of the time step, in which case the paths are interpreted as superdiffusive Lévy flights. We also consider the jaggedness of the paths, and show that this gives an independent classification of lattice theories.

  19. Design of Synthesizable, Retimed Digital Filters Using FPGA Based Path Solvers with MCM Approach: Comparison and CAD Tool

    Directory of Open Access Journals (Sweden)

    Deepa Yagain

    2014-01-01

    Full Text Available Retiming is a transformation which can be applied to digital filter blocks that can increase the clock frequency. This transformation requires computation of critical path and shortest path at various stages. In literature, this problem is addressed at multiple points. However, very little attention is given to path solver blocks in retiming transformation algorithm which takes up most of the computation time. In this paper, we address the problem of optimizing the speed of path solvers in retiming transformation by introducing high level synthesis of path solver algorithm architectures on FPGA and a computer aided design tool. Filters have their combination blocks as adders, multipliers, and delay elements. Avoiding costly multipliers is very much needed for filter hardware implementation. This can be achieved efficiently by using multiplierless MCM technique. In the present work, retiming which is a high level synthesis optimization method is combined with multiplierless filter implementations using MCM algorithm. It is seen that retiming multiplierless designs gives better performance in terms of operating frequency. This paper also compares various retiming techniques for multiplierless digital filter design with respect to VLSI performance metrics such as area, speed, and power.

  20. An algorithm for Path planning with polygon obstacles avoidance based on the virtual circle tangents

    Directory of Open Access Journals (Sweden)

    Zahraa Y. Ibrahim

    2016-12-01

    Full Text Available In this paper, a new algorithm called the virtual circle tangents is introduced for mobile robot navigation in an environment with polygonal shape obstacles. The algorithm relies on representing the polygonal shape obstacles by virtual circles, and then all the possible trajectories from source to target is constructed by computing the visible tangents between the robot and the virtual circle obstacles. A new method for searching the shortest path from source to target is suggested. Two states of the simulation are suggested, the first one is the off-line state and the other is the on-line state. The introduced method is compared with two other algorithms to study its performance.

  1. Discrete Coherent State Path Integrals

    Science.gov (United States)

    Marchioro, Thomas L., II

    1990-01-01

    The quantum theory provides a fundamental understanding of the physical world; however, as the number of degrees of freedom rises, the information required to specify quantum wavefunctions grows geometrically. Because basis set expansions mirror this geometric growth, a strict practical limit on quantum mechanics as a numerical tool arises, specifically, three degrees of freedom or fewer. Recent progress has been made utilizing Feynman's Path Integral formalism to bypass this geometric growth and instead calculate time -dependent correlation functions directly. The solution of the Schrodinger equation is converted into a large dimensional (formally infinite) integration, which can then be attacked with Monte Carlo techniques. To date, work in this area has concentrated on developing sophisticated mathematical algorithms for evaluating the highly oscillatory integrands occurring in Feynman Path Integrals. In an alternative approach, this work demonstrates two formulations of quantum dynamics for which the number of mathematical operations does not scale geometrically. Both methods utilize the Coherent State basis of quantum mechanics. First, a localized coherent state basis set expansion and an approximate short time propagator are developed. Iterations of the short time propagator lead to the full quantum dynamics if the coherent state basis is sufficiently dense along the classical phase space path of the system. Second, the coherent state path integral is examined in detail. For a common class of Hamiltonians, H = p^2/2 + V( x) the path integral is reformulated from a phase space-like expression into one depending on (q,dot q). It is demonstrated that this new path integral expression contains localized damping terms which can serve as a statistical weight for Monte Carlo evaluation of the integral--a process which scales approximately linearly with the number of degrees of freedom. Corrections to the traditional coherent state path integral, inspired by a

  2. Planning paths to multiple targets: memory involvement and planning heuristics in spatial problem solving.

    Science.gov (United States)

    Wiener, J M; Ehbauer, N N; Mallot, H A

    2009-09-01

    For large numbers of targets, path planning is a complex and computationally expensive task. Humans, however, usually solve such tasks quickly and efficiently. We present experiments studying human path planning performance and the cognitive processes and heuristics involved. Twenty-five places were arranged on a regular grid in a large room. Participants were repeatedly asked to solve traveling salesman problems (TSP), i.e., to find the shortest closed loop connecting a start location with multiple target locations. In Experiment 1, we tested whether humans employed the nearest neighbor (NN) strategy when solving the TSP. Results showed that subjects outperform the NN-strategy, suggesting that it is not sufficient to explain human route planning behavior. As a second possible strategy we tested a hierarchical planning heuristic in Experiment 2, demonstrating that participants first plan a coarse route on the region level that is refined during navigation. To test for the relevance of spatial working memory (SWM) and spatial long-term memory (LTM) for planning performance and the planning heuristics applied, we varied the memory demands between conditions in Experiment 2. In one condition the target locations were directly marked, such that no memory was required; a second condition required participants to memorize the target locations during path planning (SWM); in a third condition, additionally, the locations of targets had to retrieved from LTM (SWM and LTM). Results showed that navigation performance decreased with increasing memory demands while the dependence on the hierarchical planning heuristic increased.

  3. New sufficient conditions for Hamiltonian paths.

    Science.gov (United States)

    Rahman, M Sohel; Kaykobad, M; Firoz, Jesun Sahariar

    2014-01-01

    A Hamiltonian path in a graph is a path involving all the vertices of the graph. In this paper, we revisit the famous Hamiltonian path problem and present new sufficient conditions for the existence of a Hamiltonian path in a graph.

  4. Population Monotonic Path Schemes for Simple Games

    NARCIS (Netherlands)

    Ciftci, B.B.; Borm, P.E.M.; Hamers, H.J.M.

    2006-01-01

    A path scheme for a simple game is composed of a path, i.e., a sequence of coalitions that is formed during the coalition formation process and a scheme, i.e., a payoff vector for each coalition in the path.A path scheme is called population monotonic if a player's payoff does not decrease as the pa

  5. CONSIDERATIONS FOR THE DEVELOPMENT OF A DEVICE FOR THE DECOMMISSIONING OF THE HORIZONTAL FUEL CHANNELS IN THE CANDU 6 NUCLEAR REACTOR. PART 6 - PRESENTATION OF THE DECOMMISSIONING DEVICE

    Directory of Open Access Journals (Sweden)

    Gabi ROSCA FARTAT

    2015-05-01

    Full Text Available The objective of this paper is to present a possible solution for the designing of a device for the decommissioning of the horizontal fuel channels in the CANDU 6 nuclear reactor. The decommissioning activities are dismantling, demolition, controlled removal of equipment, components, conventional or hazardous waste (radioactive, toxic in compliance with the international basic safety standards on radiation protection. One as the most important operation in the final phase of the nuclear reactor dismantling is the decommissioning of fuel channels. For the fuel channels decommissioning should be taken into account the detailed description of the fuel channel and its components, the installation documents history, adequate radiological criteria for decommissioning guidance, safety and environmental impact assessment, including radiological and non-radiological analysis of the risks that can occur for workers, public and environment, the description of the proposed program for decommissioning the fuel channel and its components, the description of the quality assurance program and of the monitoring program, the equipments and methods used to verify the compliance with the decommissioning criteria, the planning of performing the final radiological assessment at the end of the fuel channel decommissioning. These will include also, a description of the proposed radiation protection procedures to be used during decommissioning. The dismantling of the fuel channel is performed by one device which shall provide radiation protection during the stages of decommissioning, ensuring radiation protection of the workers. The device shall be designed according to the radiation protection procedures. The decommissioning device assembly of the fuel channel components is composed of the device itself and moving platform support for coupling of the selected channel to be dismantled. The fuel channel decommissioning device is an autonomous device designed for

  6. Rainbow paths with prescribed ends

    DEFF Research Database (Denmark)

    Alishahi, Meysam; Taherkhani, Ali; Thomassen, Carsten

    2011-01-01

    It was conjectured in [S. Akbari, F. Khaghanpoor, and S. Moazzeni. Colorful paths in vertex coloring of graphs. Preprint] that, if G is a connected graph distinct from C-7, then there is a chi(G)-coloring of G in which every vertex v is an element of V(G) is an initial vertex of a path P with chi......(G) vertices whose colors are different. In[S. Akbari, V. Liaghat, and A. Nikzad. Colorful paths in vertex coloring of graphs. Electron. J. Combin. 18(1):P17, 9pp, 2011] this was proved with left perpendicular chi(G)/2right perpendicular vertices instead of chi(G) vertices. We strengthen this to chi(G) - 1...

  7. Gas-path seal technology

    Science.gov (United States)

    Zuk, J.

    1976-01-01

    Improved gas-path seals are needed for better fuel economy, longer performance retention, and lower maintenance, particularly in advanced, high-performance gas turbine engines. Problems encountered in gas-path sealing are described, as well as new blade-tip sealing approaches for high-pressure compressors and turbines. These include a lubricant coating for conventional, porous-metal, rub-strip materials used in compressors. An improved hot-press metal alloy shows promise to increase the operating surface temperatures of high-pressure-turbine, blade-tip seals to 1450 K (2150 F). Three ceramic seal materials are also described that have the potential to allow much higher gas-path surface operating temperatures than are possible with metal systems.

  8. Innovation paths in wind power

    DEFF Research Database (Denmark)

    Lema, Rasmus; Nordensvärd, Johan; Urban, Frauke

    Denmark and Germany both make substantial investments in low carbon innovation, not least in the wind power sector. These investments in wind energy are driven by the twin objectives of reducing carbon emissions and building up international competitive advantage. Support for wind power dates back...... paths: government policies, demand conditions, geography, value chains, and the strategies undertaken by firms. It demonstrates that the innovation paths common to both countries have roots in a confluence of determining factors which are mainly due to social and political priorities, preferences...... and decisions at national level. However, the sub-trajectories, which create variation between Denmark and Germany, differ in this regard. They tend to have roots in ‘given’ geographical conditions and in company-level technology choices. In other words, many of the similarities in innovation paths between...

  9. Innovative development path of ethnomedicines: the interpretation of the path.

    Science.gov (United States)

    Zhu, Zhaoyun; Fu, Dehuan; Gui, Yali; Cui, Tao; Wang, Jingkun; Wang, Ting; Yang, Zhizhong; Niu, Yanfei; She, Zhennan; Wang, Li

    2017-03-01

    One of the primary purposes of the innovative development of ethnomedicines is to use their excellent safety and significant efficacy to serve a broader population. To achieve this purpose, modern scientific and technological means should be referenced, and relevant national laws and regulations as well as technical guides should be strictly followed to develop standards and to perform systemic research in producing ethnomedicines. Finally, ethnomedicines, which are applied to a limited extent in ethnic areas, can be transformed into safe, effective, and quality-controllable medical products to relieve the pain of more patients. The innovative development path of ethnomedicines includes the following three primary stages: resource study, standardized development research, and industrialization of the achievements and efforts for internationalization. The implementation of this path is always guaranteed by the research and development platform and the talent team. This article is based on the accumulation of long-term practice and is combined with the relevant disciplines, laws and regulations, and technical guidance from the research and development of ethnomedicines. The intention is to perform an in-depth analysis and explanation of the major research thinking, methods, contents, and technical paths involved in all stages of the innovative development path of ethnomedicines to provide useful references for the development of proper ethnomedicine use.

  10. Path Decomposition of Graphs with Given Path Length

    Institute of Scientific and Technical Information of China (English)

    Ming-qing Zhai; Chang-hong Lü

    2006-01-01

    A path decomposition of a graph G is a list of paths such that each edge appears in exactly one path in the list. G is said to admit a {Pl}-decomposition if G can be decomposed into some copies of Pl, where Pl is a path of length ι - 1. Similarly, G is said to admit a {Pl, Pκ}-decomposition if G can be decomposed into some copies of Pl or Pκ. An κ-cycle, denoted by Cκ, is a cycle with κ vertices. An odd tree is a tree of which all vertices have odd degree. In this paper, it is shown that a connected graph G admits a {P3, P4}-decomposition if and only if G is neither a 3-cycle nor an odd tree. This result includes the related result of Yan, Xu and Mutu. Moreover, two polynomial algorithms are given to find {P3}-decomposition and {P3, P4}-decomposition of graphs, respectively. Hence, {P3}-decomposition problem and {P3, P4}-decomposition problem of graphs are solved completely.

  11. Paths of algebraic hyperbolic curves

    Institute of Scientific and Technical Information of China (English)

    Ya-juan LI; Li-zheng LU; Guo-zhao WANG

    2008-01-01

    Cubic algebraic hyperbolic (AH) Bezier curves and AH spline curves are defined with a positive parameter α in the space spanned by {1, t, sinht, cosht}. Modifying the value of α yields a family of AH Bezier or spline curves with the family parameter α. For a fixed point on the original curve, it will move on a defined curve called "path of AH curve" (AH Bezier and AH spline curves) when α changes. We describe the geometric effects of the paths and give a method to specify a curve passing through a given point.

  12. Strings, paths, and standard tableaux

    CERN Document Server

    Dasmahapatra, S

    1996-01-01

    For the vacuum sectors of regime-III ABF models, we observe that two sets of combinatorial objects: the strings which parametrize the row-to-row transfer matrix eigenvectors, and the paths which parametrize the corner transfer matrix eigenvectors, can both be expressed in terms of the same set of standard tableaux. Furthermore, the momenta of the strings, the energies of the paths, and the charges of the tableaux are such that there is a weight-preserving bijection between the two sets of eigenvectors, wherein the tableaux play an interpolating role. This bijection is so natural, that we conjecture that it exists in general.

  13. 基于典型事例推理的路径规划方法研究%A Path Planning Algorithm Based on Typical Case Reasoning

    Institute of Scientific and Technical Information of China (English)

    翁敏; 魏秀琴; 瞿嵘; 蔡忠亮

    2009-01-01

    Case-based reasoning is an AI technique in which the previous solutions are stored for future use. People are used to guiding themselves according to those routes that are stored in their memories and have been used by them before. It is just based on people's preference to familiar routes, which are gained through the study of the cognitive activities. We propose to apply the intelligent method based on the case reasoning to path planning. It is impossible for a case base to store all the solutions to all the shortest paths; therefore, part of them should be stored. However, which routes should be stored and which should not be? How do we adapt the cases that have already been stored and how do we acquire the shortest route based on them? All these issues need to be explained by integrating knowledge of the network on account of case-based reasoning techniques. This paper suggests the case-based reasoning in another point. This means finding some irreplaceable links on the basis of the complete analysis of the problems space, which are called the must_be_passed link between the source and destination. Merely compute the shortest path case from those best exit/entry nodes of the grids to the irreplaceable links, and then add them into the case base storing for future use. This method is based on case-based reasoning technique and com-pletely considers the properties of the problem space. In addition to the use of knowledge of the natural grid in the route network, this method is more efficient than existing algorithms on computing efficiency.

  14. 基于路径预测的机器人足球路径规划%Robot soccer path planning based on path prediction

    Institute of Scientific and Technical Information of China (English)

    刘付民

    2012-01-01

    针对常用的机器人路径规划算法过于复杂并且在每个运动周期都计算路径的问题,提出了一种结合路径预测的路径最优算法.充分利用预测结果减少每周期的路径规划时间;用微量调整动态控制机器人左右轮速度,并充分利用折线路径的短距离优势,为避障机器人创建一条最短路径;以基于周期性预测在同个时间轴上的相交作为碰撞信号,来减少每个周期的重复性计算时间.实验结果表明,该方法能大大提高机器人路径规划的速度,降低不同周期上路径规划结果不一致导致的运动震荡.%The commonly used intelligent methods are artificial potential field method, visual vertex graph method and genetic method. However, these methods are more complex and need calculation for each movement cycle path in the robot. An optimal path algorithm that combines the path planning is presented, which takes full use of the path planning to reduce the cycle time and increase the stability of the robot movement It is able to create the shortest path for the obstacle-avoidance robot with micro-adjustment to control the speed of two wheels dynamically and make fully use of the advantage of the short distance of the broken line. Based on periodic forecast, the intersection on a timeline as a collision signal can reduce time-computing repeatability of each cycle, thus, the speed of the robot path planning is enhanced greatly and the sports concussion resulted by different path plan-ning results on different cycles is reduced.

  15. Career Paths in Environmental Sciences

    Science.gov (United States)

    Career paths, current and future, in the environmental sciences will be discussed, based on experiences and observations during the author's 40 + years in the field. An emphasis will be placed on the need for integrated, transdisciplinary systems thinking approaches toward achie...

  16. Geodesic flows on path spaces

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    On the path space over a compact Riemannian manifold, the global existence and the global uniqueness of the quasi-invariant geodesic flows with respect to a negative Markov connection are obtained in this paper. The results answer affirmatively a left problem of Li.

  17. Methodologies for tracking learning paths

    DEFF Research Database (Denmark)

    Frølunde, Lisbeth; Gilje, Øystein; Lindstrand, Fredrik

    2009-01-01

    The article concerns the design of a collaborative research project (2008-09) entitled Making a Filmmaker, which examines how young Scandinavian filmmakers create their own learn- ing paths in formal and/or informal contexts. Our interest is how learning experiences and contexts motivate the young...

  18. On the path to differentiation

    DEFF Research Database (Denmark)

    Martinsen, Dorte Sindbjerg; Uygur, Ayca

    2014-01-01

    by examining the ‘path to differentiation’ within EU working time regulation as it has unfolded over time. It identifies the ‘opt-out’ as a means of differentiation adopted to overcome policy deadlocks within collective decision-making, albeit one with unforeseen consequences. In particular, the contribution...

  19. Determinants of weighted path matrices

    CERN Document Server

    Talaska, Kelli

    2012-01-01

    We find rational expressions for all minors of the weighted path matrix of a directed graph, generalizing the classical Lindstrom/Gessel-Viennot result for acyclic directed graphs. The formulas are given in terms of certain flows in the graph.

  20. Optimal paths as correlated random walks

    Science.gov (United States)

    Perlsman, E.; Havlin, S.

    2006-01-01

    A numerical study of optimal paths in the directed polymer model shows that the paths are similar to correlated random walks. It is shown that when a directed optimal path of length t is divided into 3 segments whose length is t/3, the correlation between the transversal movements along the first and last path segments is independent of the path length t. It is also shown that the transversal correlations along optimal paths decrease as the paths approach their endpoints. The numerical results obtained for optimal paths in 1+4 dimensions are qualitatively similar to those obtained for optimal paths in lower dimensions, and the data supplies a strong numerical indication that 1+4 is not the upper critical dimension of this model, and of the associated KPZ equation.