This paper presents a reduced kernel-based classification model for multi-category discrimination of sets or objects. The proposed model is based on the Tikhonov regularization scheme. This approach extends Mangasaria...
详细信息
This paper presents a reduced kernel-based classification model for multi-category discrimination of sets or objects. The proposed model is based on the Tikhonov regularization scheme. This approach extends Mangasarian reduced support vector machine (RSVM) model in a least square framework for the case of multi-categorical discrimination. The dimension reduction of the kernel matrix is achieved by selecting random subsets of the training set. Advantages of this formulation include explicit expressions for the classification weights of the classifier(s), its ability to incorporate several classes in a single optimization problem, and computational tractability in providing the optimal classification weights for multi-categorical separation. Computational results are also provided for two-phase flowdata.
Procedure-based communication can convert variant communication patterns of parallel computation to a simple data sending and receiving process. The author describes a general-purpose, MIMD parallel architecture that ...
详细信息
Procedure-based communication can convert variant communication patterns of parallel computation to a simple data sending and receiving process. The author describes a general-purpose, MIMD parallel architecture that effectively supports the procedure-based communication. The system uses a two-dimensional memory array and a multiple-bus system as data transfer media. The system eliminates bus contention and reduces memory access conflicts. In spite of its partially shared memory, the architecture guarantees direct data access for all processors if a procedure-based communication is used.< >
A new vectorized systolic array for computing the weights of the block recursive least squares (RLS) with p linear constraints is proposed. Using the idea of M-invariant matrices, an upper triangular array for updatin...
详细信息
A new vectorized systolic array for computing the weights of the block recursive least squares (RLS) with p linear constraints is proposed. Using the idea of M-invariant matrices, an upper triangular array for updating R/sub n/ of the modified QR decomposition of the data matrix is first derived where the first p rows corresponding to the constraints are in a frozen mode. Next, a lower triangular array for updating R/sub n//sup -T/ is derived where the first p rows are in no operation mode. Connecting these two arrays, the overall near rhombic array is obtained for computing the weights. Also, the numerical stability of the algorithm is examined by simulations.< >
The paper presents a method pointed out to detect and to correct the alterations of(i) under-exposure, (ii) over-exposure, (iii) out of focus, (iv) Gaussian noise, affecting the images acquired into the flow cytometer...
详细信息
The paper presents a method pointed out to detect and to correct the alterations of(i) under-exposure, (ii) over-exposure, (iii) out of focus, (iv) Gaussian noise, affecting the images acquired into the flow cytometer. These alterations reduce the image quality and interfere with the correct micro nucleus detection in lymphocyte. The objective of the proposed correction is to make the image able to be correctly processed by the pattern matching algorithm (i) to detect the micronucleus into human lymphocytes, (ii) to minimize the doubtful detections, and (iii) to enhance the confidence that in the rejected images are not including the micro nucleuses. The results of numerical tests confirm the validity of the proposed correction method.
A new modular multiplication algorithm and its corresponding architecture is presented. It is optimised with respect to hardware complexity and latency. Based on the dataflow of the well known interleaved modular mult...
详细信息
A new modular multiplication algorithm and its corresponding architecture is presented. It is optimised with respect to hardware complexity and latency. Based on the dataflow of the well known interleaved modular multiplication the product of two n-bit-integers X and Y modulo M is computed by n iterations of a simple loop. The loop consists of one single carry save addition, a comparison of constant complexity, and a table lookup, where the table contains 6 precomputed values and two constants. By this construction the arithmetical complexity of the modular multiplication is reduced to n additions without carry propagation in total which leads to a speedup of at least two in comparison to all methods previously known. It consists of a first algorithm A2 implementing the new idea of combining carry save addition and constant time comparison. A2 is not optimal with respect to area and time. Its correctness is proven. By use of a small amount of precomputing the loop of A2 can be modified such that the effort within the loop is minimised. This leads to the algorithm A3 and it is verified.
SIMD or vector computers and collection-oriented languages, like C*, are designed to perform the same computation on each data item or on just a subset of the data. Subsets of processors or data items implemented via ...
详细信息
SIMD or vector computers and collection-oriented languages, like C*, are designed to perform the same computation on each data item or on just a subset of the data. Subsets of processors or data items implemented via an activiry bit and a stack of activity bits when subsets of subsets are supported. This method is also used in VLIW processors through if-conversion to implement paralalle1 control flow as in SIMD computers. Wt present a new method of dynamic scheduling of several SIMD control flow constructions which can be nested.
We present a static analysis that detects potential runtime exceptions that are raised and never handled inside Standard ML (SML) programs. Contrary to our earlier method (Yi, 1994) based on abstract interpretation, w...
详细信息
ISBN:
(纸本)0818675799
We present a static analysis that detects potential runtime exceptions that are raised and never handled inside Standard ML (SML) programs. Contrary to our earlier method (Yi, 1994) based on abstract interpretation, where the input program's control flow is simultaneously computed while our exception analysis progresses, we separate the two phases in a manner similar to conventional dataflow analysis. Before the exception analysis begins, we first estimate the input program's control flow from the type information from SML/NJ compiler. Based on this call-graph structure, exception flow is specified as a set of equations, whose solution is computed using an iterative least fixpoint method. A prototype of this analysis is applied to two realistic SML programs (ML-LEX and OR-SML core) and is 3 or 40 times faster than the earlier method and saves memory by 35 or 65 percent.
Presents an image-matching algorithm that uses multiple attributes associated with a pixel to yield a generally overdetermined system of constraints. taking into account possible structural discontinuities and occlusi...
详细信息
Presents an image-matching algorithm that uses multiple attributes associated with a pixel to yield a generally overdetermined system of constraints. taking into account possible structural discontinuities and occlusions. Both top-down and bottom-up dataflows are used in a multiresolution computational structure. The matching algorithm computes dense displacement fields and the associated occlusion maps. The motion and structure parameters are estimated through optimal estimation (e.g. maximal likelihood) using the solution of a linear algorithm as an initial guess. To investigate the intrinsic stability of the problem in the presence of noise, a theoretical lower bound on error variance of the estimates, the Cramer-Rao bound, is determined for motion parameters.< >
Introspection, a zero-overhead binding technique during self-diagnosing microarchitecture synthesis is presented. Given a scheduled control dataflow graph (CDFG) introspective binding exploits the spare computation a...
详细信息
Introspection, a zero-overhead binding technique during self-diagnosing microarchitecture synthesis is presented. Given a scheduled control dataflow graph (CDFG) introspective binding exploits the spare computation and data transfer capacity in a synergistic fashion to achieve low latency fault diagnostics with near zero area overheads without compromising the performance. The resulting on-chip fault latencies are one ten-thousandth (10/sup -4/) of previously reported system level diagnostic techniques. A novel feature of the proposed technique is the use of spare data transfer capacity in the interconnect network for diagnostics.
In this paper we propose two algorithm-level time redundancy based Concurrent Error Detection (CED) schemes that exploit diversity in a Register Transfer (RT) level implementation. RT level diversity can be achieved e...
详细信息
ISBN:
(纸本)9780780372498
In this paper we propose two algorithm-level time redundancy based Concurrent Error Detection (CED) schemes that exploit diversity in a Register Transfer (RT) level implementation. RT level diversity can be achieved either by changing the operation-to-operator allocation (allocation diversity) or by shifting the operands before re-computation (data diversity). By enabling a fault to affect the normal result and the re-computed result in two different ways, RT level diversity yields good CED capability with low area overhead. We used Synopsys Behavior Compiler (BC) to implement the technique.
暂无评论