this paper proposes an efficient algorithm based on memetic algorithm (ma) for a redundancy allocation problem without component mixing (rapcm) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. majority of the solution methods for the general rapcm assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...

Table scans have become more interesting recently due to greater use of ad-hoc queries and greater availability of multicore, vector-enabled hardware. Table scan performance is limited by value representation, table layout, and processing techniques. In this paper we propose a new layout and processing technique for efficient one-pass predicate evaluation. Starting with a set of rows with a fix...

The problem of ordering and sizing parallel wires residing in a single metal layer within an interconnect channel is addressed in this paper. Wires are ordered such that cross-capacitances between neighboring wires are optimally shared for circuit delay minimization. Using an Elmore delay model including cross capacitances, an optimal wire ordering is uniquely determined, such that average sign...

—We present and evaluate, for the first time, a parallel algorithm for solving the LU decomposition problem on the star graph. The proposed parallel algorithm is of O(N 3 /n!) computation complexity and uses O(Nn) communication time to decompose a matrix of order N on a star graph of dimension n, where N ≥ (n-1)!. The incurred communication time is better than the best known results for the hyp...

Character projection is a key technology to enhance throughput of E-beam lithography, in which characters need to be selected and placed on the stencil. This paper solves the problem of planning for rowstructure stencil with overlapped characters and also considers multi-column cell system for further throughput improvement. We first propose an approach that is designed for characters with “reg...

In this paper we specify the conditions on the parameters of pairs of gOS’s under which the corresponding generalized order statistics are ordered according to usual stochastic ordering, hazard rate ordering, likelihood ratio ordering and dispersive ordering. We consider this problem in one-sample as well as two-sample problems. We show that some of the results obtained by Franco et al. ...

This paper considers one of the optimization problems on graphs, namely, problem constructing parallel ordering vertices. Three cases anomalous deterioration value objective function with simultaneous improvement two initial parameters are investigated. The obtained results basis for further study subclasses graphs which such anomalies will always arise.

s of the Presentations Solving inconsistencys preserving the zero-structure Paula Amaral, Joaquim Júdice and Hanif Sherali, University of Coimbra In this talk we describe an nonlinear optimization model for correcting an inconsistent linear system. By correction we mean a perturbation of both the matrix of coefficients and right-hand-side of the linear system of inequalities. Inconsistency of a...