Computing a rectilinear shortest path amid splinegons in plane

We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain \calS to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define a polygonal domain \calP from \calS and transform a rectilinear shortest path computed in \calP to a path between s and t amid splinegon obstacles in \calS. When \calS comprises of h pairwise disjoint splinegons with a total of n vertices, excluding the time to compute a rectilinear shortest path amid polygons in \calP, our reduction algorithm takes O(n + h \lg{n}) time. For the special case of \calS comprising of concave-in splinegons, we have devised another algorithm in which the reduction procedure does not rely on the structures used in the algorithm to compute a rectilinear shortest path in polygonal domain. As part of these, we have characterized few of the properties of rectilinear shortest paths amid splinegons which could be of independent interest

Glial cell type-specific changes in spinal dipeptidyl peptidase 4 expression and effects of its inhibitors in inflammatory and neuropatic pain

Altered pain sensations such as hyperalgesia and allodynia are characteristic features of various pain states, and remain difficult to treat. We have shown previously that spinal application of dipeptidyl peptidase 4 (DPP4) inhibitors induces strong antihyperalgesic effect during inflammatory pain. In this study we observed low level of DPP4 mRNA in the rat spinal dorsal horn in physiological conditions, which did not change significantly either in carrageenan-induced inflammatory or partial nerve ligation-generated neuropathic states. In naive animals, microglia and astrocytes expressed DPP4 protein with one and two orders of magnitude higher than neurons, respectively. DPP4 significantly increased in astrocytes during inflammation and in microglia in neuropathy. Intrathecal application of two DPP4 inhibitors tripeptide isoleucin-prolin-isoleucin (IPI) and the antidiabetic drug vildagliptin resulted in robust opioid-dependent antihyperalgesic effect during inflammation, and milder but significant opioid-independent antihyperalgesic action in the neuropathic model. The opioid-mediated antihyperalgesic effect of IPI was exclusively related to mu-opioid receptors, while vildagliptin affected mainly delta-receptor activity, although mu- and kappa-receptors were also involved. None of the inhibitors influenced allodynia. Our results suggest pathology and glia-type specific changes of DPP4 activity in the spinal cord, which contribute to the development and maintenance of hyperalgesia and interact with endogenous opioid systems

Dynamic Perfect Hashing: Upper and Lower Bounds

The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a randomized algorithm for the dynamic dictionary problem that takes O(1) worst-case time for lookups and O(1) amortized expected time for insertions and deletions; it uses space proportional to the size of the set stored. Furthermore, lower bounds for the time complexity of a class of deterministic algorithms for the dictionary problem are proved. This class encompasses realistic hashing-based schemes that use linear space. Such algorithms have amortized worst-case time complexity OMEGA(log n) for a sequence of n insertions and lookups; if the worst-case lookup time is restricted to k then the lower bound becomes $OMEGA (k^cdot^n sup 1/k$)

A Bytecode Translator for Distributed Execution of “Legacy” Java Software

Abstract. This paper proposes a system named Addistant, which en-ables the distributed execution of “legacy ” Java bytecode. Here “legacy” means the software originally developed to be executed on a single Java virtual machine (JVM). For adapting legacy software to distributed ex-ecution on multiple JVM, developers using Addistant have only to spec-ify the host where instances of each class are allocated and how remote references are implemented. According to that specification, Addistant automatically transforms the bytecode at load time. A technical contri-bution by Addistant is that it covers a number of issues for implementing distributed execution in the real world. In fact, Addistant can adapt a legacy program written with the Swing library so that Swing objects are executed on a local JVM while the rest of objects are on a remote JVM.

A Multi-robot Strategy for Rapidly Searching a Polygonal Environment

In this paper we address the problem of finding an object in a polygonal environment as quickly as possible on average, with a team of mobile robots that can sense the environment. We show that fo