共查询到20条相似文献,搜索用时 31 毫秒
1.
We consider the problem of generating random permutations with uniform distribution. That is, we require that for an arbitrary
permutation π of n elements, with probability 1/n! the machine halts with the i th output cell containing π(i) , for 1 ≤ i ≤ n . We study this problem on two models of parallel computations: the CREW PRAM and the EREW PRAM.
The main result of the paper is an algorithm for generating random permutations that runs in O(log log n) time and uses O(n
1+o(1)
) processors on the CREW PRAM. This is the first o(log n) -time CREW PRAM algorithm for this problem.
On the EREW PRAM we present a simple algorithm that generates a random permutation in time O(log n) using n processors and O(n) space. This algorithm outperforms each of the previously known algorithms for the exclusive write PRAMs.
The common and novel feature of both our algorithms is first to design a suitable random switching network generating a permutation
and then to simulate this network on the PRAM model in a fast way.
Received November 1996; revised March 1997. 相似文献
2.
Dissecting Euclidean d -space with the power diagram of n weighted point sites partitions a given m -point set into clusters, one cluster for each region of the diagram. In this manner, an assignment of points to sites is
induced. We show the equivalence of such assignments to constrained Euclidean least-squares assignments. As a corollary, there
always exists a power diagram whose regions partition a given d -dimensional m -point set into clusters of prescribed sizes, no matter where the sites are placed. Another consequence is that constrained
least-squares assignments can be computed by finding suitable weights for the sites. In the plane, this takes roughly O(n
2
m) time and optimal space O(m) , which improves on previous methods. We further show that a constrained least-squares assignment can be computed by solving
a specially structured linear program in n+1 dimensions. This leads to an algorithm for iteratively improving the weights, based on the gradient-descent method. Besides
having the obvious optimization property, least-squares assignments are shown to be useful in solving a certain transportation
problem, and in finding a least-squares fitting of two point sets where translation and scaling are allowed. Finally, we extend
the concept of a constrained least-squares assignment to continuous distributions of points, thereby obtaining existence results
for power diagrams with prescribed region volumes. These results are related to Minkowski's theorem for convex polytopes.
The aforementioned iterative method for approximating the desired power diagram applies to continuous distributions as well.
May 30, 1995; revised June 25, 1996. 相似文献
3.
AnO(¦E¦log2
n) algorithm is presented to construct the visibility graph for a collection ofn nonintersecting line segments, where ¦E¦ is the number of edges in the visibility graph. This algorithm is much faster than theO(n
2)-time andO(n
2)-space algorithms by Asanoet al., and by Welzl, on sparse visibility graphs. Thus we partially resolve an open problem raised by Welzl. Further, our algorithm uses onlyO(n) working storage. 相似文献
4.
Eduardo Masato Iyoda Takushi Shibata Hajime Nobuhara Witold Pedrycz Kaoru Hirota 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(1):53-61
A high-order feedforward neural architecture, called pi
t
-sigma (π
t
σ) neural network, is proposed for lossy digital image compression and reconstruction problems. The π
t
σ network architecture is composed of an input layer, a single hidden layer, and an output layer. The hidden layer is composed of classical additive neurons, whereas the output layer is composed of translated multiplicative neurons (π
t
-neurons). A two-stage learning algorithm is proposed to adjust the parameters of the π
t
σ network: first, a genetic algorithm (GA) is used to avoid premature convergence to poor local minima; in the second stage, a conjugate gradient method is used to fine-tune the solution found by GA. Experiments using the Standard Image Database and infrared satellite images show that the proposed π
t
σ network performs better than classical multilayer perceptron, improving the reconstruction precision (measured by the mean squared error) in about 56%, on average. 相似文献
5.
Kannan Balakrishnan Boštjan Brešar Manoj Changat Sandi Klavžar Matjaž Kovše Ajitha R. Subhamathi 《Algorithmica》2010,57(2):207-216
The median (antimedian) set of a profile π=(u
1,…,u
k
) of vertices of a graph G is the set of vertices x that minimize (maximize) the remoteness ∑
i
d(x,u
i
). Two algorithms for median graphs G of complexity O(n idim(G)) are designed, where n is the order and idim(G) the isometric dimension of G. The first algorithm computes median sets of profiles and will be in practice often faster than the other algorithm which
in addition computes antimedian sets and remoteness functions and works in all partial cubes. 相似文献
6.
LetP be a set ofl points in 3-space, and letF be a set ofm opaque rectangular faces in 3-space with sides parallel tox- ory-axis. We present anO(n logn) time andO(n) space algorithm for determining all points inP which are visible from a viewpoint at (0,0,), wheren=l+m. We also present anO(n logn+k) time andO(n) space algorithm for the hidden-line elimination problem for the orthogonal polyhedra together with a viewpoint at (0,0,), wheren is the number of vertices of the polyhedra andk is the number of edge intersections in the projection plane. 相似文献
7.
This paper considers the Byzantine agreement problem in a completely connected network of anonymous processors. In this network model the processors have no identifiers and can only detect the link through which a message
is delivered. We present a polynomial-time agreement algorithm that requires 3⌊(n−t)t/(n−2t)⌋+4 rounds, where n>3t is the number of processors and t is the maximal number of faulty processors that the algorithm can tolerate. We also present an early-stopping variant of
the algorithm. 相似文献
8.
We present a randomized algorithm for finding maximum matchings in planar graphs in timeO(n
ω/2), whereω is the exponent of the best known matrix multiplication algorithm. Sinceω<2.38, this algorithm breaks through theO(n
1.5) barrier for the matching problem. This is the first result of this kind for general planar graphs. We also present an algorithm
for generating perfect matchings in planar graphs uniformly at random usingO(n
ω/2) arithmetic operations. Our algorithms are based on the Gaussian elimination approach to maximum matchings introduced in
[16].
This research was supported by KBN Grant 4T11C04425. 相似文献
9.
We present a randomized parallel algorithm for constructing the three-dimensional convex hull on a generic p-processor coarse-grained multicomputer with arbitrary interconnection network and n/p local memory per processor, where n/p ≥ p
2+ε
(for some arbitrarily small ε > 0). For any given set of n points in 3-space, the algorithm computes the three-dimensional convex hull, with high probability, in local computation time and O(1) communication phases with at most O(n/p) data sent/received by each processor. That is, with high probability, the algorithm computes the three-dimensional convex
hull of an arbitrary point set in time , where Γ
n,p
denotes the time complexity of one communication phase. The assumption n/p ≥ p
2+ε
implies a coarse-grained, limited parallelism, model which is applicable to most commercially available multiprocessors.
In the terminology of the BSP model, our algorithm requires, with high probability, O(1) supersteps, synchronization period , computation cost , and communication cost O((n/p) g).
Received October 30, 1995, and in revised form April 15, 1996, and in final form September 17, 1996. 相似文献
10.
This paper describes the traveling tournament problem, a well-known benchmark problem in the field of tournament timetabling.
We propose an approximation algorithm for the traveling tournament problem with the constraints such that both the number
of consecutive away games and that of consecutive home games are at most k. When k≤5, the approximation ratio of the proposed algorithm is bounded by (2k−1)/k+O(k/n) where n denotes the number of teams; when k>5, the ratio is bounded by (5k−7)/(2k)+O(k/n). For k=3, the most investigated case of the traveling tournament problem to date, the approximation ratio of the proposed algorithm
is 5/3+O(1/n); this is better than the previous approximation algorithm proposed for k=3, whose approximation ratio is 2+O(1/n). 相似文献
11.
F. Franchini A. R. Its V. E. Korepin L. A. Takhtajan 《Quantum Information Processing》2011,10(3):325-341
We consider reduced density matrix of a large block of consecutive spins in the ground states of the XY spin chain on an infinite lattice. We derive the spectrum of the density matrix using expression of Rényi entropy in terms
of modular functions. The eigenvalues λ
n
form exact geometric sequence. For example, for strong magnetic field λ
n
= C exp(−π
τ
0
n), here τ
0 > 0 and C > 0 depend on anisotropy and magnetic field. Different eigenvalues are degenerated differently. The largest eigenvalue is
unique, but degeneracy g
n
increases sub-exponentially as eigenvalues diminish: gn ~ exp(p?{n/3}){g_{n}\sim \exp{(\pi \sqrt{n/3})}}. For weak magnetic field expressions are similar. 相似文献
12.
Parallel integer sorting and simulation amongst CRCW models 总被引:1,自引:0,他引:1
Sanjeev Saxena 《Acta Informatica》1996,33(7):607-619
In this paper a general technique for reducing processors in simulation without any increase in time is described. This results
in an O(√log n) time algorithm for simulating one step of PRIORITY on TOLERANT with processor-time product of O(n log log n); the same as that for simulating PRIORITY on ARBITRARY. This is used to obtain an O(log n/log log n+√log n (log log m− log log n)) time algorithm for sorting n integers from the set {0,…, m−1}, m≧n, with a processor-time product of O(n log log m log log n) on a TOLERANT CRCW PRAM. New upper and lower bounds for ordered chaining problem on an allocated COMMON CRCW model are also
obtained. The algorithm for ordered chaining takes O(log n/log log n) time on an allocated PRAM of size n. It is shown that this result is best possible (upto a constant multiplicative factor) by obtaining a lower bound of Ω(r log n/(log r+log log n)) for finding the first (leftmost one) live processor on an allocated-COMMON PRAM of size n of r-slow virtual processors (one processor simulates r processors of allocated PRAM). As a result, for ordered chaining problem, “processor-time product” has to be at least Ω(n log n/log log n) for any poly-logarithmic time algorithm.
Algorithm for ordered-chaining problem results in an O(log N/log log N) time algorithm for (stable) sorting of n integers from the set {0,…, m−1} with n-processors on a COMMON CRCW PRAM; here N=max(n, m). In particular if, m=n
O(1)
, then sorting takes Θ(log n/log log n) time on both TOLERANT and COMMON CRCW PRAMs. Processor-time product for TOLERANT is O(n(log log n)2). Algorithm for COMMON uses n processors.
Received August 13, 1992/June 30, 1995 相似文献
13.
A Fast Algorithm for Image Component Labeling with Local Operators on Mesh Connected Computers 总被引:1,自引:0,他引:1
A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented. This algorithm provides a positive answer to the open question of whether there exists an O(n)-time and O(log n)-space local labeling algorithm on SIMD mesh connected computers. The algorithm uses a pipeline mechanism with stack-like data structures to achieve the lower bound of O(n) in time complexity and O(log n) in space complexity. Additionally, the algorithm has very small multiplicative constants in its complexities by using local parallel-shrink and label-propagate operations. 相似文献
14.
无重叠条件序列模式挖掘是一种间隙约束序列模式挖掘方法,与同类挖掘方法相比,该方法更容易发现有价值的频繁模式,其核心问题是计算给定模式在序列中的支持度或出现数,进而判定该模式的频繁性.而计算模式支持度问题实质是无重叠条件模式匹配.当前研究采用迭代搜索无重叠出现,然后剪枝无用结点的方式计算模式的支持度,其计算时间复杂度为O (m×m×n×W),其中,m,n和W分别为模式长度、序列长度及最大间隙.为了进一步提高无重叠条件模式匹配计算速度,从而有效地降低无重叠条件序列模式挖掘时间,提出了一种高效的算法,该算法将模式匹配问题转换为一棵网树,然后从网树的最小树根结点出发,采用回溯策略迭代搜索最左孩子方式计算无重叠最小出现,在网树上剪枝该出现后,无需进一步查找并剪枝无效结点即可实现问题的求解.理论证明了该算法的完备性,并将该算法的时间复杂度降低为O (m×n×W).在此基础上,继续指明该问题还存在另外3种相似的求解策略,分别是从最左叶子出发迭代查找最左双亲方式、从最右树根出发迭代查找最右孩子方式和从最右叶子出发迭代查找最右双亲方式.实验结果验证了该算法的性能,特别是在序列模式挖掘中,应用该方法的挖掘算法可以降低挖掘时间. 相似文献
15.
We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, α, of the marked items
in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a Berry phase 2πα. By estimating the Berry phase, we can approximate α, and solve the problem. For an error bound e{\epsilon}, the algorithm can solve the problem with cost of order
(\frac1e)3/2{(\frac{1}{\epsilon})^{3/2}}, which is not as good as the optimal algorithm in the quantum circuit model, but better than the classical random algorithm.
Moreover, since the Berry phase is a purely geometric feature, the result may be robust to decoherence and resilient to certain
noise. 相似文献
16.
In this paper we consider the problem of dynamic transitive closure with lookahead. We present a randomized one-sided error
algorithm with updates and queries in O(n
ω(1,1,ε)−ε
) time given a lookahead of n
ε
operations, where ω(1,1,ε) is the exponent of multiplication of n×n matrix by n×n
ε
matrix. For ε≤0.294 we obtain an algorithm with queries and updates in O(n
2−ε
) time, whereas for ε=1 the time is O(n
ω−1). This is essentially optimal as it implies an O(n
ω
) algorithm for boolean matrix multiplication. We also consider the offline transitive closure in planar graphs. For this
problem, we show an algorithm that requires
O(n\fracw2)O(n^{\frac{\omega}{2}})
time to process
n\frac12n^{\frac{1}{2}}
operations. We also show a modification of these algorithms that gives faster amortized queries. Finally, we give faster algorithms
for restricted type of updates, so called element updates. All of the presented algorithms are randomized with one-sided error.
All our algorithms are based on dynamic algorithms with lookahead for matrix inverse, which are of independent interest. 相似文献
17.
For an unweighted undirected graph G = (V,E), and a pair of positive integers α ≥ 1, β ≥ 0, a subgraph G′ = (V,H), H ⊂eqE, is called an (α,β)-spanner of G if for every pair of vertices u,v ∊ V, distG′(u,v) ≤ α ⋅ distG(u,v) + β.
It was shown in [21] that for any ∊ > 0, κ = 1,2,…, there exists an integer β = β(∊,κ) such that for every n-vertex graph G there exists a (1+∊,β)-spanner G′ with O(n1+1/κ) edges. An efficient distributed protocol for constructing (1+∊,β)-spanners was devised in [19]. The running time and the
communication complexity of that protocol are O(n1+ρ) and O(|E|n^ρ), respectively, where ρ is an additional control parameter of the protocol that affects only the additive term β.
In this paper we devise a protocol with a drastically improved running time (O(n^ρ) as opposed to O(n1+ρ)) for constructing (1+∊,β)-spanners. Our protocol has the same communication complexity as the protocol of [19], and it constructs
spanners with essentially the same properties as the spanners that are constructed by the protocol of [19]. The protocol can
be easily extended to a parallel implementation which runs in O(log n + (|E|⋅ nρlog n)/p) time using p processors in the EREW PRAM model. In particular, when the number of processors, p, is at least |E|⋅ nρ, the running time of the algorithm is O(log n). We also show that our protocol for constructing (1+∊,β)-spanners can be adapted to the streaming model, and devise a streaming
algorithm that uses a constant number of passes and O(n1+1/κ⋅ {log} n) bits of space for computing all-pairs-almost-shortest-paths of length at most by a multiplicative factor (1+∊) and an additive
term of β greater than the shortest paths. Our algorithm processes each edge in time O(n^ρ), for an arbitrarily small ρ > 0. The only previously known algorithm for the problem [23] constructs paths of length κ
times greater than the shortest paths, has the same space requirements as our algorithm, but requires O(n1+1/κ) time for processing each edge of the input graph. However, the algorithm of [23] uses just one pass over the input, as opposed
to the constant number of passes in our algorithm.
We also show that any streaming algorithm for o(n)-approximate distance computation requires Ω(n) bits of space.
This work was Supported by the DoD University Research Initiative (URI) administered by the Office of Naval Research under
Grant N00014-01-1-0795.
Michael Elkin was supported by ONR grant N00014-01-1-0795.
Jian Zhang was supported by ONR grant N00014-01-1-0795 and NSF grants CCR-0105337 and ITR-0331548.
Preliminary version of this paper was published in PODC’04, see [22].
After the preliminary version of our paper [22] appeared on PODC’04, Feigenbaum et al. [24] came up with a new streaming algorithm
for the problem that is far more efficient than [23] in terms of time-per-edge processing. However, our algorithm is still
the only existing streaming algorithm that provides an almost additive approximation of distances. 相似文献
18.
Shin-ichi Nakano Member ACM IEEE Ryuhei Uehara Member ACM IEEE and Takeaki Uno 《计算机科学技术学报》2009,24(3):517-533
Algorithms used in data mining and bioinformatics have to deal with huge amount of data efficiently.In many applications,the data are supposed to have explicit or implicit structures.To develop efficient algorithms for such data,we have to propose possible structure models and test if the models are feasible.Hence,it is important to make a compact model for structured data,and enumerate all instances efficiently.There are few graph classes besides trees that can be used for a model.In this paper,we inves... 相似文献
19.
Smallest Enclosing Cylinders 总被引:1,自引:0,他引:1
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in time O(n
4
log
O(1)
n) in an algebraic complexity model. We also achieve a time of O(n
4
L⋅μ(L)) in a bit complexity model where L is the maximum bit size of input numbers and μ(L) is the complexity of multiplying two L bit integers.
These and several other results highlight a general linearization technique which transforms nonlinear problems into some higher-dimensional but linear problems. The technique is reminiscent of the
use of Plücker coordinates, and is used here in conjunction with Megiddo's parametric searching.
We further report on experimental work comparing the practicality of an exact with that of a numerical strategy.
Received September 10, 1997; revised August 28, 1988. 相似文献
20.
Process algebras are widely used for defining the formal semantics of concurrent communicating processes. This paper considers stochastic π-calculus which is a particularly expressive kind of process algebra providing a specification of probabilities of process behavior
such as stochastic delays, communication and branching, as well as rates of execution. In this paper, we implement stochastic
π-calculus at the molecular scale, providing a design for a DNA-based biomolecular device that executes the stochastic π-calculus. Designing this device is challenging due to the requirement that a specific pair
of processes must be able to communicate repeatedly; this appears to rule out the use of many of the usual classes of DNA
computation (e.g., tiling self-assembly or hybridization chain reactions) that allow computational rule molecules to float
freely in solution within a test tube. Our design of the molecular stochastic π-calculus system makes use of a modified form
of Whiplash-PCR (WPCR) machines. In our machine which we call π-WPCR machine, we connect (via a tethering DNA nanostructure) a number of DNA strands, each of which corresponds to a π-WPCR machines.
This collection of π-WPCR machines is used to execute distinct concurrent processes, each with its own distinct program. To
implement process communication protocols, our modifications to the original design of WPCR machines include the incorporation
of additional secondary structure in the single strand (stem-loop) as well as multiple-temperature thermal cycling. The enforced locality of the collection of π-WPCR machines insures that the same pair (or any subset of the entire collection) of processes be able to repeatedly communicate with each other. Additionally, our
design of the devices include implementation of sequential execution of multiple process and limited process branching through use of restriction enzymes. 相似文献