scholarly journals Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls

2021 ◽  
Vol 17 (2) ◽  
pp. 1-19
Author(s):  
Omar Darwish ◽  
Amr Elmasry ◽  
Jyrki Katajainen
Keyword(s):  
Data Structure ◽  
Lower Bound ◽  
Convex Hull ◽  
Euclidean Plane ◽  
State Of The Art ◽  
Random Access ◽  
Priority Queue ◽  
Convex Hulls ◽  
Limited Capacity ◽  
Range Of Values

We consider space-bounded computations on a random-access machine, where the input is given on a read-only random-access medium, the output is to be produced to a write-only sequential-access medium, and the available workspace allows random reads and writes but is of limited capacity. The length of the input is N elements, the length of the output is limited by the computation, and the capacity of the workspace is O ( S ) bits for some predetermined parameter S ≥ lg N . We present a state-of-the-art priority queue—called an adjustable navigation pile —for this restricted model. This priority queue supports M inimum in O (1) time, C onstruct in O ( N ) time, and E xtract - min in O ( N / S + lg S ) time for any S ≥ lg N . The priority queue can be further augmented in O ( N ) time to deal with a batch of at most S elements in a specified range of values at a time, and allow to I nsert (activate) or E xtract (deactivate) an element among these elements, such that I nsert and E xtract take O ( N / S + lg S ) time for any S ≥ lg N . We show how to use our data structure to sort N elements and to compute the convex hull of N points in the Euclidean plane in O ( N 2 / S + N lg S ) time for any S ≥ lg N . Following a known lower bound for the space-time product of any branching program for finding unique elements, both our sorting and convex-hull algorithms are optimal. The adjustable navigation pile has turned out to be useful when designing other space-efficient algorithms, and we expect that it will find its way to yet other applications.

scholarly journals THREE PROBLEMS ABOUT DYNAMIC CONVEX HULLS

2012 ◽  
Vol 22 (04) ◽  
pp. 341-364 ◽  
Author(s):  
TIMOTHY M. CHAN
Keyword(s):  
Data Structure ◽  
Convex Hull ◽  
Query Time ◽  
Convex Hulls ◽  
Lower Envelope ◽  
Dynamic Data ◽  
Line Segments ◽  
3 Dimensional ◽  
Small Constant ◽  
Dynamic Data Structure

We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the convex hull intersecting a query line, with expected query and amortized update time O( log 1+εn) for an arbitrarily small constant ε > 0. This improves the previous bound of O( log 3/2n). • A fully dynamic data structure for maintaining a set of n points in the plane to support halfplane range reporting queries in O( log n+k) time with O( polylog n) expected amortized update time. A similar result holds for 3-dimensional orthogonal range reporting. For 3-dimensional halfspace range reporting, the query time increases to O( log 2n/ log log n + k). • A semi-online dynamic data structure for maintaining a set of n line segments in the plane, so that we can decide whether a query line segment lies completely above the lower envelope, with query time O( log n) and amortized update time O(nε). As a corollary, we can solve the following problem in O(n1+ε) time: given a triangulated terrain in 3-d of size n, identify all faces that are partially visible from a fixed viewpoint.

scholarly journals Improved Exact Solver for the Weighted MAX-SAT Problem

10.29007/38lm ◽  
2018 ◽  
Author(s):  
Adrian Kuegel
Keyword(s):  
Data Structure ◽  
Lower Bound ◽  
Branch And Bound ◽  
State Of The Art ◽  
Branch And Bound Algorithm ◽  
Sat Problem ◽  
Sat Solvers ◽  
Propagation Algorithm ◽  
Max Sat ◽  
Unit Propagation

Many exact Max-SAT solvers use a branch and bound algorithm, where the lower bound is calculated with a combination of Max-SAT resolution and detection of disjoint inconsistent subformulas. We propose a propagation algorithm which improves the detection of disjoint inconsistent subformulas compared to algorithms previously used in Max-SAT solvers. We implemented this algorithm in our new solver akmaxsat and compared our solver with three solvers using unit propagation and restricted failed literal detection; these solvers are currently state-of-the-art on random Max-SAT instances. We also developed a lazy deletion data structure for our solver which speeds up lower bound calculation on instances with a high clauses-to-variables ratio. Our experiments show that our solver runs faster than the previously best solvers on randomly generated instances with a high clauses-to-variables ratio.

State-of-the-Art of Modeling Surface Water Impoundments

1982 ◽  
Vol 14 (1-2) ◽  
pp. 241-261 ◽  
Author(s):  
P A Krenkel ◽  
R H French
Keyword(s):  
Water Quality ◽  
Surface Water ◽  
State Of The Art ◽  
Rate Coefficients ◽  
Two Dimensional ◽  
One Dimensional ◽  
Integral Energy ◽  
Range Of Values ◽  
Dimensional Integral ◽  
Water Impoundment

The state-of-the-art of surface water impoundment modeling is examined from the viewpoints of both hydrodynamics and water quality. In the area of hydrodynamics current one dimensional integral energy and two dimensional models are discussed. In the area of water quality, the formulations used for various parameters are presented with a range of values for the associated rate coefficients.

scholarly journals Continuous Maps from Spheres Converging to Boundaries of Convex Hulls

2021 ◽  
Vol 9 ◽  
Author(s):  
Joseph Malkoun ◽  
Peter J. Olver
Keyword(s):  
Convex Hull ◽  
Convex Geometry ◽  
Gauss Map ◽  
Parameter Family ◽  
Convex Hulls ◽  
Dimensional Sphere ◽  
Continuous Maps ◽  
Dimensional Boundary

Abstract Given n distinct points $\mathbf {x}_1, \ldots , \mathbf {x}_n$ in $\mathbb {R}^d$ , let K denote their convex hull, which we assume to be d-dimensional, and $B = \partial K $ its $(d-1)$ -dimensional boundary. We construct an explicit, easily computable one-parameter family of continuous maps $\mathbf {f}_{\varepsilon } \colon \mathbb {S}^{d-1} \to K$ which, for $\varepsilon> 0$ , are defined on the $(d-1)$ -dimensional sphere, and whose images $\mathbf {f}_{\varepsilon }({\mathbb {S}^{d-1}})$ are codimension $1$ submanifolds contained in the interior of K. Moreover, as the parameter $\varepsilon $ goes to $0^+$ , the images $\mathbf {f}_{\varepsilon } ({\mathbb {S}^{d-1}})$ converge, as sets, to the boundary B of the convex hull. We prove this theorem using techniques from convex geometry of (spherical) polytopes and set-valued homology. We further establish an interesting relationship with the Gauss map of the polytope B, appropriately defined. Several computer plots illustrating these results are included.

scholarly journals Density Guarantee on Finding Multiple Subgraphs and Subtensors

2021 ◽  
Vol 15 (5) ◽  
pp. 1-32
Author(s):  
Quang-huy Duong ◽  
Heri Ramampiaro ◽  
Kjetil Nørvåg ◽  
Thu-lan Dam
Keyword(s):  
Lower Bound ◽  
State Of The Art ◽  
The State ◽  
The Other ◽  
Exact Methods ◽  
Practical Solution ◽  
Novel Approach ◽  
Wide Range ◽  
Real World Datasets ◽  
Tensor Data

Dense subregion (subgraph & subtensor) detection is a well-studied area, with a wide range of applications, and numerous efficient approaches and algorithms have been proposed. Approximation approaches are commonly used for detecting dense subregions due to the complexity of the exact methods. Existing algorithms are generally efficient for dense subtensor and subgraph detection, and can perform well in many applications. However, most of the existing works utilize the state-or-the-art greedy 2-approximation algorithm to capably provide solutions with a loose theoretical density guarantee. The main drawback of most of these algorithms is that they can estimate only one subtensor, or subgraph, at a time, with a low guarantee on its density. While some methods can, on the other hand, estimate multiple subtensors, they can give a guarantee on the density with respect to the input tensor for the first estimated subsensor only. We address these drawbacks by providing both theoretical and practical solution for estimating multiple dense subtensors in tensor data and giving a higher lower bound of the density. In particular, we guarantee and prove a higher bound of the lower-bound density of the estimated subgraph and subtensors. We also propose a novel approach to show that there are multiple dense subtensors with a guarantee on its density that is greater than the lower bound used in the state-of-the-art algorithms. We evaluate our approach with extensive experiments on several real-world datasets, which demonstrates its efficiency and feasibility.

Suffix array for multi-pattern matching with variable length wildcards

2021 ◽  
Vol 25 (2) ◽  
pp. 283-303
Author(s):  
Na Liu ◽  
Fei Xie ◽  
Xindong Wu
Keyword(s):  
Dynamic Programming ◽  
Data Structure ◽  
Pattern Matching ◽  
Edit Distance ◽  
State Of The Art ◽  
Suffix Array ◽  
Variable Length ◽  
Distance Method ◽  
Efficient Data ◽  
Comparison Algorithms

Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array-based algorithms have been proposed to solve this problem. Suffix array is an efficient data structure for exact string matching in existing studies, as well as for approximate pattern matching and multi-pattern matching. An algorithm called MMSA-S is for the short exact characters in a pattern by dynamic programming, while another algorithm called MMSA-L deals with the long exact characters by the edit distance method. Experimental results of Pizza & Chili corpus demonstrate that these two newly proposed algorithms, in most cases, are more time-efficient than the state-of-the-art comparison algorithms.

scholarly journals Cache-efficient sweeping-based interval joins for extended Allen relation predicates

2021 ◽  
Author(s):  
Danila Piatov ◽  
Sven Helmer ◽  
Anton Dignös ◽  
Fabio Persia
Keyword(s):  
Data Structure ◽  
Experimental Evaluation ◽  
State Of The Art ◽  
Temporal Databases ◽  
Access Method ◽  
Wide Range ◽  
Interval Relation ◽  
Cache Efficient ◽  
Join Algorithms ◽  
Better Than

AbstractWe develop a family of efficient plane-sweeping interval join algorithms for evaluating a wide range of interval predicates such as Allen’s relationships and parameterized relationships. Our technique is based on a framework, components of which can be flexibly combined in different manners to support the required interval relation. In temporal databases, our algorithms can exploit a well-known and flexible access method, the Timeline Index, thus expanding the set of operations it supports even further. Additionally, employing a compact data structure, the gapless hash map, we utilize the CPU cache efficiently. In an experimental evaluation, we show that our approach is several times faster and scales better than state-of-the-art techniques, while being much better suited for real-time event processing.

The State of the Art of Rubber-Seal Technology

1987 ◽  
Vol 60 (3) ◽  
pp. 381-416 ◽  
Author(s):  
B. S. Nau
Keyword(s):  
State Of The Art ◽  
Test Procedure ◽  
Working Party ◽  
The State ◽  
Supporting Evidence ◽  
Wide Range ◽  
Lip Seals ◽  
Alternative Hypotheses ◽  
Series Of Experiments ◽  
Range Of Values

Abstract The understanding of the engineering fundamentals of rubber seals of all the various types has been developing gradually over the past two or three decades, but there is still much to understand, Tables V–VII summarize the state of the art. In the case of rubber-based gaskets, the field of high-temperature applications has scarcely been touched, although there are plans to initiate work in this area both in the U.S.A. at PVRC, and in the U.K., at BHRA. In the case of reciprocating rubber seals, a broad basis of theory and experiment has been developed, yet it still is not possible to design such a seal from first principles. Indeed, in a comparative series of experiments run recently on seals from a single batch, tested in different laboratories round the world to the same test procedure, under the aegis of an ISO working party, a very wide range of values was reported for leakage and friction. The explanation for this has still to be ascertained. In the case of rotary lip seals, theories and supporting evidence have been brought forward to support alternative hypotheses for lubrication and sealing mechanisms. None can be said to have become generally accepted, and it remains to crystallize a unified theory.

scholarly journals COMPUTING CONVEX HULLS BY AUTOMATA ITERATION

2009 ◽  
Vol 20 (04) ◽  
pp. 647-667
Author(s):  
FRANÇOIS CANTIN ◽  
AXEL LEGAY ◽  
PIERRE WOLPER
Keyword(s):  
Convex Hull ◽  
Finite Automaton ◽  
Convex Hulls ◽  
The Real ◽  
Starting Point ◽  
Finite Set

This paper considers the problem of computing the real convex hull of a finite set of n-dimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors. The proposed method consists in computing a sequence of automata representing approximations of the convex hull and using extrapolation techniques to compute the limit of this sequence. The convex hull can then be directly computed from this limit in the form of an automaton-based representation of the corresponding set of real vectors. The technique is quite general and has been implemented.

Sign in / Sign up

Export Citation Format

Share Document