We discuss a non-reversible, lifted Markov-chain Monte Carlo (MCMC) algorithm for particle systems in which the direction of proposed displacements is changed deterministically. This sweeps through directions analogously to popular MCMC sweep methods or spin indices. Direction-sweep can be applied wide range original reversible non-reversible Markov chains, such as Metropolis event-chain algori...

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...

This paper describes a method to optimize the plane sweep algorithm. The goal of this paper is to develop a method that reduces the comparison through removing the tandem replicated word comparison and also using partial search technique in a document for escaping from the keywords that are ineffective. The approach introduces Plane Sweep algorithm that is the base algorithm used to search for ...

A method is presented to compute the planar arrangement induced by segments of algebraic curves of degree three (or less), using an improved Bentley-Ottmann sweep-line algorithm. Our method is exact (it provides the mathematically correct result), complete (it handles all possible geometric degeneracies), and efficient (the implementation can handle hundreds of segments). The range of possible ...

The Bentley Ottmann sweep line algorithm is a standard tool to compute the arrangement of algebraic curves in the plane. If degenerate positions are not excluded from the input, variants of this algorithm must, among other things, handle k ≥ 2 curves intersecting simultaneously in a single intersection point. In that situation, the algorithm knows the order of the curves immediately left of the...

sunn pest (eurygaster integriceps put.) cause serious economic damage to wheat and barley in borujerd, north of lorestan province, iran. sweep net sampling, is the most convenient sampling procedure for many arthropods, but it is difficult to interpret in terms of accuracy and precision. much of the variation of sweep net catches, stems from human factors and its calibration. in this research, ...

Markov chain Monte Carlo (MCMC) routines have revolutionized the application of Monte Carlo methods in statistical application and statistical computing methodology. The Hastings sampler, encompassing both the Gibbs and Metropolis samplers as special cases, is the most commonly applied MCMC algorithm. The performance of the Hastings sampler relies heavily on the choice of sweep strategy, that i...

We present the first release of the C++ libraries of the Exacus project of the Max-PlanckInstitut für Informatik. We explain the structure of the libraries and the software design for the numerics library and the sweep-line algorithm library in more detail.

When we search from a huge amount of documents, we often specify several keywords to narrow the result of the search. Though the searched documents contain all keywords, positions of the keywords are usually not considered. As the result, the search result contains some meaningless documents. In this paper, we propose two algorithms for nding documents in which all given keywords appear in neig...

We introduce a novel algorithm for solving the nearest neighbour problem when the query points are known in advance, which is based on Fortune’s plane sweep algorithm. The crucial idea is to use the wavefront for solving the nearest neighbour queries as the Voronoi diagram is being computed, instead of storing it in an auxiliary data structure, as the algorithm presented by Lee and Yang does, a...