4,937 research outputs found
Freeform User Interfaces for Graphical Computing
報告番号: 甲15222 ; 学位授与年月日: 2000-03-29 ; 学位の種別: 課程博士 ; 学位の種類: 博士(工学) ; 学位記番号: 博工第4717号 ; 研究科・専攻: 工学系研究科情報工学専
Range Queries on Uncertain Data
Given a set of uncertain points on the real line, each represented by
its one-dimensional probability density function, we consider the problem of
building data structures on to answer range queries of the following three
types for any query interval : (1) top- query: find the point in that
lies in with the highest probability, (2) top- query: given any integer
as part of the query, return the points in that lie in
with the highest probabilities, and (3) threshold query: given any threshold
as part of the query, return all points of that lie in with
probabilities at least . We present data structures for these range
queries with linear or nearly linear space and efficient query time.Comment: 26 pages. A preliminary version of this paper appeared in ISAAC 2014.
In this full version, we also present solutions to the most general case of
the problem (i.e., the histogram bounded case), which were left as open
problems in the preliminary versio
JETSPIN: a specific-purpose open-source software for simulations of nanofiber electrospinning
We present the open-source computer program JETSPIN, specifically designed to
simulate the electrospinning process of nanofibers. Its capabilities are shown
with proper reference to the underlying model, as well as a description of the
relevant input variables and associated test-case simulations. The various
interactions included in the electrospinning model implemented in JETSPIN are
discussed in detail. The code is designed to exploit different computational
architectures, from single to parallel processor workstations. This paper
provides an overview of JETSPIN, focusing primarily on its structure, parallel
implementations, functionality, performance, and availability.Comment: 22 pages, 11 figures. arXiv admin note: substantial text overlap with
arXiv:1507.0701
Covering Points by Disjoint Boxes with Outliers
For a set of n points in the plane, we consider the axis--aligned (p,k)-Box
Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together
contain n-k points. In this paper, we consider the boxes to be either squares
or rectangles, and we want to minimize the area of the largest box. For general
p we show that the problem is NP-hard for both squares and rectangles. For a
small, fixed number p, we give algorithms that find the solution in the
following running times:
For squares we have O(n+k log k) time for p=1, and O(n log n+k^p log^p k time
for p = 2,3. For rectangles we get O(n + k^3) for p = 1 and O(n log n+k^{2+p}
log^{p-1} k) time for p = 2,3.
In all cases, our algorithms use O(n) space.Comment: updated version: - changed problem from 'cover exactly n-k points' to
'cover at least n-k points' to avoid having non-feasible solutions. Results
are unchanged. - added Proof to Lemma 11, clarified some sections - corrected
typos and small errors - updated affiliations of two author
- …