Computing optimum routes for Label Switched Paths (LSPs) across multiple domains in MPLS Traffic Engineering (MPLS-TE) and GMPLS networks presents a problem because no single point of path computation is aware of all of the links and resources in each domain. A solution may be achieved using the Path Computation Element (PCE) architecture. Where the sequence of domains is known a priori, variou...

In this paper, a novel approach based on the Thévenin tracing is presented to modified conventional impedance-based out-of-step (OOS) protection. In conventional approach, the OOS detection is done by measuring positive sequence impedance. However, the measured impedance may be change due to different factors such as capacitor bank switching and reactive power compensators that it can cause the...

We study the elastic properties of a single A/B copolymer chain with a specific sequence. We predict a rich structure in the force extension relations which can be addressed to the sequence. The variational method is introduced to probe local minima on the path of stretching and releasing. At given force, we find multiple configurations which are separated by energy barriers. A collapsed globul...

In the path-imitation task, one agent traces out a path through a second agent's sensory eld. The second agent then has to reproduce that path exactly, i.e. move through the sequence of locations visited by the rst agent. This is a non-trivial behaviour whose acquisition might be expected to involve special-purpose (i.e., strongly biased) learning machinery. However, the present paper shows thi...

In this paper we study the problem of maintaining a single source shortest path tree or a breadth-rst search tree for a directed graph, in either an incremental or decremental setting. We maintain a single source shortest path tree of a directed graph G with unit edge weights during a sequence of edge deletions in total time O(mn), thus obtaining a O(n) amortized time for each deletion if the s...

We construct a path distribution representing the kinetic part of the Feynman path integral at discrete times similar to that defined by Thomas [1], but on a Hilbert space of paths rather than a nuclear sequence space. We also consider different boundary conditions and show that the discrete-time Feynman path integral is well-defined for suitably smooth potentials.

This paper presents an algorithm for path following applications represented by grid decomposition in order to provide smooth tracking. In the first stage, the method calculates the corners that define the path based on a vision algorithm proposed by [2], so a new reference trajectory is composed of a sequence of straight lines. Then, the reference path is divided into a set of equispaced point...

A hybrid control system for dynamic path following for an autonomous helicopter is described. The hierarchically structured system combines continuous control law execution with event-driven state machines. Trajectories are defined by a sequence of 3D path segments and velocity profiles, where each path segment is described as a parametric curve. The method can be used in combination with a pat...