Sensor-based navigation is one of the most important researches for mobile robots domain and then there are many research works for sensor-based navigation. We propose the insects inspired landmark navigation to pinpoint the target position in this paper. There exit several research works such as snapshot model and average landmark model which request the absolute bearing information (compass) ...

The all pairs shortest path problem is a class of the algebraic path problem. Many parallel algorithms for the solution of this problem appear in the literature. One of the efficient parallel algorithms on W-RAM model is given by Kucera[17]. Though efficient, algorithms written for the W-RAM model of parallel computation are too idealistic to be implemented on the current hardware. In this repo...

BACKGROUND Isothermal amplification methods provide alternatives to PCR that may be preferable for some nucleic acid target detection tasks. Among current isothermal target detection methods, ramified rolling circle amplification (RAM) of single-stranded DNA circles that are formed by ligation of linear DNA probes (C-probes or padlock probes) offers a unique target detection system by linked pr...

We investigate the role of ram pressure stripping in the Virgo cluster using N-body simulations. Radial orbits within the Virgo cluster's gravitational potential are modeled and analyzed with respect to ram pressure stripping. The N-body model consists of 10 000 gas cloud complexes which can have inelastic collisions. Ram pressure is modeled as an additional acceleration on the clouds located a...

We analyze the fine structure of time complexity classes for RAM's, in particular the equivalence relation A:c B (A and B have the same time complexity") ++ (for ali time constructible / : Ae DTIMEn,cM(Í) ë B e DTIMEaa¡a(/))' The -c-equivalence class of A is called its complexity type. 'We prove that every set X can be partitioned into two sets ,4. and B such that X :c A :c B, and that the part...

We present a new method for secure two-party Random Access Memory (RAM) program computation that does not require taking a program and first turning it into a circuit. The method achieves logarithmic overhead compared to an insecure program execution. In the heart of our construction is a new Oblivious RAM construction where a client interacts with two non-communicating servers. Our two-server ...

State = R≥0 ×R≥0 For an abstract state (d, a), we call dist(d, a) = d+ a the energy-adjusted distance. The computational state comprises: • A simple distance d ∈ R≥0 to the base station, like the simple distance of an abstract state. • An energy level e ∈ Energy. • An energy-faithful adjustment f ∈ R≥0 capturing energy deficiencies along the route to the base station. • A table nt containing en...

Space is a new circuit oriented, spatial programming language designed to exploit the massive parallelism available in a novel formal model of computation called the Synchronic A-Ram, and physically related FPGA and reconfigurable architectures. Space expresses variable grained MIMD parallelism, is modular, strictly typed, and deterministic. Barring operations associated with memory allocation ...