نتایج جستجو برای: sequence path
تعداد نتایج: 539946 فیلتر نتایج به سال:
With the increasing applications of grid-connected voltage source converters, it is important to analyze impedance characteristic system implement stability analysis grid connection operation. Compared with three-phase three-wire system, an additional zero-sequence path exists in four-wire system. Therefore, necessary consider influence zero sequence when analyzing In this paper, model includin...
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
We refer to the emission probabilities, the emission probabilities and the initial distribution, collectively as the parameters, designated λ = (aij , ei(a), π). Following the notation used in Durbin, we will refer to the sequence of observed symbols as O = O1, O2, O3, ... and the sequence of states visited as Q = q1, q2, q3, ... (the “state path”.) When considering more than one sequence or st...
Computing inter-domain MultiProtocol Label Switching Traffic Engineering Label Switched Path (MPLS-TE LSP) through a pre-determined sequence of domains is quite straight as each Path Computation Element (PCE), using the Backward Recursive PCEbased Computation (BRPC), knows who is the next to be contacted in order to continue the computation. The optimality of the interdomain MPLS-TE LSP path de...
A short review of the method for the tensor reduction of Feynman integrals based on recurrence relations w.r.t. space-time dimension d is given. A solution of the difference equation w.r.t. d for the n-point one-loop integrals with arbitrary momenta and masses is presented. The result is written as multiple hypergeometric series depending on ratios of Gram determinants. For the 3-point function...
Significant cycle time saving can be achieved in 2.5-D milling by intelligently selecting tool sequences. The problem of finding the optimal tool sequence was formulated as finding the shortest path in a single-source single-sink directed acyclic graph. The nodes in the graph represented the state of the stock after the tool named in the node was done machining and the edges represented the cos...
We construct the Feynman integrands for a class of exponentially growing time-dependent potentials as white noise functionals. We show that they solve the Schrödinger equation. The Morse potential is considered as a special case.
The problem A graph G consists of a set V G of vertices and a set E G of edges each of which is an ordered pair of vertices These objects despite their simple struc ture can be used to model important properties of a wide variety of math ematical and physical systems One of their most important applications is to the study of routing in networks Here the vertices represent sites cities computer...
Like the sequence of words in written language, comic book page layouts direct images into a deliberate reading sequence. Conventional wisdom would expect that comic panels follow the order of text: left-to-right and down - a "Z-path" - though several layouts can violate this order, such as Gestalt groupings of panels that deny a Z-path of reading. To examine how layouts pressure readers to cho...
This paper is concerned with the problem of tracking clouds structures like vortices in meteorological images. For this purpose we characterize the deformation between two successive occurrences, by matching their two boundary curves. Our approach is based on the computation of the set of paths connecting the two curves to be matched. It minimizes a cost function which measures the local simila...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید