Let G be a graph cellularly embedded on a surface. We consider the problem of determining whether G contains a cycle (i.e. a closed walk without repeated vertices) of a certain topological type. We show that the problem can be answered in linear time when the topological type is one of the following: contractible, non-contractible, or non-separating. In either case we obtain the same time compl...

Abstract Many astrophysical environments involve convective or explosive flows driven by thermonuclear reactions (Type Ia supernovae, classical novae, X-ray bursts, stellar evolution). Simulation codes need to accurately capture the interactions between and hydrodynamics produce realistic models of these events. For reacting flows, operator splitting is commonly used couple reactions. Each proc...

This paper describes a general purpose program analysis that computes global control-ow and data-ow information for higher-order, call-by-value programs. This information can be used to drive global program optimizations such as inlining and run-time check elimination, as well as optimizations like constant folding and loop invariant code motion that are typically based on special-purpose local...

This paper describes a general purpose program analysis that computes global control-ow and data-ow information for higher-order, call-by-value programs. This information can be used to drive global program optimizations such as inlining and run-time check elimination, as well as optimizations like constant folding and loop invariant code motion that are typically based on special-purpose local...

Subject to some conditions, the input data for the Drinfeld-Sokolov construction of KdV type hierarchies is a quadruplet (A,Λ, d1, d0), where the di are Z-gradations of a loop algebra A and Λ ∈ A is a semisimple element of nonzero d1-grade. A new sufficient condition on the quadruplet under which the construction works is proposed and examples are presented. The proposal relies on splitting the...

We consider a class of splitting schemes for fourth order nonlinear diffusion equations. Standard backward-time differencing requires the solution of a higher order elliptic problem, which can be both computationally expensive and work-intensive to code, in higher space dimensions. Recent papers in the literature provide computational evidence that a biharmonic-modified, forward time-stepping m...

Abstract. We present in this paper two different classes of general K-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we prove that the number of iterations needed by the first class of algorithms to obtain an ε-optimal solution is O(1/ε). The algorithms in the second cl...

background: lateral ridge split technique is a way to solve the problem of the width in narrow ridges with adequate height. simultaneous insertion of dental implants will considerably reduce the edentulism time. materials and methods: twenty-five patients who were managed with ridge splitting technique were enrolled. thirty-eight locations in both jaws with near equal distribution in quadrants ...

We present the universal two-loop splitting functions that describe the limits of two-loop n-point amplitudes of massless particles when two of the momenta are collinear. To derive the splitting amplitudes, we take the collinear limits of explicit two-loop four-point helicity amplitudes computed in the ’t Hooft-Veltman scheme. The g → gg splitting amplitude has recently been computed using the ...