An efficient, optimal test sequence for detecting multiple stuck-at faults in random access memories (RAM's) for any decoder implementation is presented. Another algorithm which does not assume any particular wire...
详细信息
An efficient, optimal test sequence for detecting multiple stuck-at faults in random access memories (RAM's) for any decoder implementation is presented. Another algorithm which does not assume any particular wired logic behavior of simultaneously accessed storage locations, is also presented.
We present a randomized algorithm to find a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an exclusive read exclusive write (ERE...
详细信息
We present a randomized algorithm to find a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an exclusive read exclusive write (EREW) PRAM. This result is optimal w.r.t. both work and parallel time, and is the first provably optimal parallel algorithm for this problem under both measures. We also give a simple, general processor allocation scheme for tree-like computations.
An O(1) time algorithm to multiply two N-bit binary numbers using an N x N bit-model of reconfigurable mesh is shown. It uses optimal mesh size and it improves previously known results for multiplication on the reconf...
详细信息
An O(1) time algorithm to multiply two N-bit binary numbers using an N x N bit-model of reconfigurable mesh is shown. It uses optimal mesh size and it improves previously known results for multiplication on the reconfigurable mesh. The result is obtained by using novel techniques for data representation and data movement and using multidimensional Rader Transform. The algorithm is extended to result in AT(2) optimality over 1 less than or equal to T less than or equal to root N in a variant of the bit-model of VLSI.
In space battle application,orbital design is the most important part:such as design for intercepting orbit,meanwhile,considering the optimization of intercepting orbit,it has very important meanings to design an inte...
详细信息
In space battle application,orbital design is the most important part:such as design for intercepting orbit,meanwhile,considering the optimization of intercepting orbit,it has very important meanings to design an intercepting orbit with minimal flight *** the way of analytic method and using optimal algorithm,on the premise of Keplerian orbit under two-body hypothesis and one-off impulse orbit maneuver,this paper discusses design for optimal intercepting orbit with minimal flight time under constraint of the magnitude of initial velocity impulse,and gets the optimal launch point(or orbit-changing point) on initial orbit by iterative search *** gives the mathematic model and process of calculation in the paper,and by means of model simulation in three different cases,we prove that it is a simple,quick and effective arithmetic for orbital *** believe that it would provide more reference for orbit optimal design in space application.
Internet of things is a wireless data communications technology, while radio frequency identification (RFID) is an emerging technology in the automatic identification of the Internet of things. In fact, it means the u...
详细信息
Internet of things is a wireless data communications technology, while radio frequency identification (RFID) is an emerging technology in the automatic identification of the Internet of things. In fact, it means the use of RFID system identification technology through the Internet to achieve the application of information interconnection and sharing. In this paper, the author analyzes an improved RFID middleware architecture and optimal algorithm based on internet of things. Through the analysis of RFID middleware technology, we put forward an optimized load balancing algorithm. The results show that the optimization algorithm is superior to the existing algorithms in the average time of load balancing and label processing.
This paper proposes a parallel algorithm, called KDOP (K-Dimensionaloptimal Parallel algorithm), to solve a general class of recurrence equations efficiently. The KDOP algorithm partitions the computation into a serie...
详细信息
This paper proposes a parallel algorithm, called KDOP (K-Dimensionaloptimal Parallel algorithm), to solve a general class of recurrence equations efficiently. The KDOP algorithm partitions the computation into a series of sub-computations, each of which is executed in the fashion that all the processors work simultaneously with each one executing an optimal sequential algorithm to solve a subcomputation task. The algorithm solves the equations in O(N/p)steps in EREW PRAM model (Exclusive Read Exclusive Write Parallel Ran-dom Access Machine model) using poptimal algorithm (itsspeedup is O(p)) in the case of poptimal speedup for this problem was previously achieved only in the case of palgorithm can be implemented on machines with multiple processing elements or pipelined vector machines with parallel memory systems.
According to the principle of parametric curve paths CNC interpolating, a real-time interpolation algorithm based on algebraic index of the micro-segment spline is presented. It's used to solve the problems of Her...
详细信息
ISBN:
(纸本)9783037852163
According to the principle of parametric curve paths CNC interpolating, a real-time interpolation algorithm based on algebraic index of the micro-segment spline is presented. It's used to solve the problems of Hermite polynomial interpolation algorithm, which are commonly slow recursive algorithm, poor accuracy of approximation and the limitations of constant parameters increment interpolation. And the constant interpolation is achieved by fitting a first-order Taylor Formula. Simulation results show that the algorithm shortens the interpolation time and also improve the interpolation accuracy;meanwhile, it maintains the stability of the feed rate.
The knapsack problem is very important in cryptosystem and in number theory. This paper proposes a new parallel algorithm for the knapsack problem where the method of divide and conquer is adopted. Basing on an EREW-S...
详细信息
ISBN:
(纸本)0780378407
The knapsack problem is very important in cryptosystem and in number theory. This paper proposes a new parallel algorithm for the knapsack problem where the method of divide and conquer is adopted. Basing on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2(n/4))(1-epsilon) processors, 0less than or equal to epsilon less than or equal to 1, and O(2(n)) memory to find a solution for the n-element knapsack problem in time O(2(n/4) (2(n/4))epsilon). Thus the cost of the proposed parallel algorithm is O(2(n)), which is optimal, and an improved result over the past researches. Keywords: Knapsack problem, parallel algorithm, optimal algorithm, memory conflicts.
A kind of slab designing problem was brought forward, in which the weight of slabs is fixed and the customer order demand specifications of weight and width are interval values. A multi-objective model to minimize the...
详细信息
A kind of slab designing problem was brought forward, in which the weight of slabs is fixed and the customer order demand specifications of weight and width are interval values. A multi-objective model to minimize the number of slabs and the total surplus weight was built. Based on the idea of the order-slab matrix and the compatible set of slabs, a two-stage optimal algorithm was proposed to solve the problem. In the algorithm, the first stage is to minimize the number of slabs, and the second stage is to minimize the total surplus weight. For this algorithm, the optimal nature was proved theoretically and an application case was given based on practical data.
A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows th...
详细信息
A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows that the algorithm has much better steady convergence performance of optimal process and can hunt out the global optimal solution by biggish probability for objective function of multi peak value.
暂无评论