Path integral representations in noncommutative quantum mechanics and noncommutative version of Berezin-Marinov action. Abstract It is known that actions of field theories on a noncommutative space-time can be written as some modified (we call them θ-modified) classical actions already on the commutative space-time (introducing a star product). Then the quantization of such modified actions rep...

Path integral representations in noncommutative quantum mechanics and noncommutative version of Berezin-Marinov action. Abstract It is known that actions of field theories on a noncommutative space-time can be written as some modified (we call them θ-modified) classical actions already on the commutative space-time (introducing a star product). Then the quantization of such modified actions rep...

Radlometnc measurements from satelhtes m the solar portmn of the electromagnetic spectrum can be converted to measurements of surface eratance Over rugged terrain, the satelhte image must be precisely registered to a terrain data set For small areas a first-order polynomial mterpolatmn scheme is generally satisfactory for the geometric rectlficatmn If there are saturated plxels, a nearest-neigh...

Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning Sy...

Nearest neighbor query is one of the most important operations in spatial databases and their application domains, such as location-based services and advanced traveler information systems . This paper addresses the problem of finding the in-route nearest neighbor (IRNN) for a query object tuple which consists of a given route with a destination and a current location on it. The IRNN is a facil...

We propose a fault-tolerant routing with its extensions based on limited global information in dual-cube networks. It is based on an early work of Wu’s safety level and safety vector in cube networks. An r-connected dual-cube network consists of 2rþ1 connected r-cubes (also called clusters). Both faulty nodes and faulty links are considered here. First, a depth-first search routing (DSBR) based...

Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy routing algorithms might fail even if there is a path from source to destination. In recent years several recovery strategies have been proposed in order to overcome such greedy routing failures. Planar graph traversal wa...