The intertwining operators Ad = Ad(g) on the round sphere (Sn, g) are the conformal analogues of the power Laplacians 1d/2 on the flat Rn . To each metric ρg, conformally equivalent to g, we can naturally associate an operator Ad(ρg), which is compact, elliptic, pseudodifferential of order d, and which has eigenvalues λ j (ρ); the special case d = 2 gives precisely the conformal Laplacian in th...

This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for termination analysis of term rewrite systems based on the dependency pair method. We address two main inter-related issues and encode them as satisfiability problems of propositional formulas that can be efficiently handled by SAT ...

(ABSTRACT) This research is concerned with the development of algorithmic approaches for solving problems that arise in the design and analysis of telecommunication networks, location-allocation distribution contexts, and intelligent transportation networks. Specifically, the corresponding problems addressed in these areas are a local access and transport area (LATA) network design problem, the...

The railway crew scheduling problem is to determine an optimal crew assignment to minimize the number of crews required to cover all of railway assignment satisfying several crew working constraints. The problem can be formulated as a huge set covering problem. Column generation method is commonly used to solve the railway crew scheduling problem. Conventional column generation method has a sho...

We introduce a new heuristic for the A* algorithm that references a data structure of size θ(|L| + |V |), where L represents a set of strategically chosen landmark vertices and V the set of vertices in the graph. This heuristic’s benefits are permitted by a new approach for computing landmark-based lower bounds, in which each landmark stores only the distances between it and vertices within its...

In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This is something which needs to be taken into account when searching for a set of paths that minimize capacity consumption. In this paper, we discuss a new necessary condition that can be used during search to prune infea...

We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i. e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides ...

Variational inequalities, nonlinear programming, complementarity problems and other problems can be reduced to nonsmooth equations, for which some generalizations of Newton's method are known. The Newton path, as a natural generalization of the Newton direction, was suggested by D. Ralph for enlarging the convergence region (globalization) of Newton-Robinson's method in the nonsmooth case. We i...

Feynman's path integrals provide a hidden variable description of quantum mechanics (and quantum field theories). The expectation values defined through path integrals obey Bell's inequalities in Euclidean time, but not in Minkowski time. This observation allows us to pinpoint the origin of violation of Bell's inequalities in quantum mechanics. It is common, and often more convenient, to study ...