2447183
Application of genetic algorithm for response surface modeling in optimal statistical design
In this paper, a new approach for optimal statistical design to achieve 100% yield at minimum cost is introduced. A kind of genetic algorithm together with a boundary sampling strategy is proposed for the selection of the response surface model function to achieve better accuracy of the model representation and improved computation speed due to reduced number of circuit simulations. The complete optimum statistic design also involves the solution procedure of design centering fixed and variable optimum tolerance assignment. A numerical example is presented to show the effectiveness of the new technique.
5664320
MCM interconnect design using two-pole approximation
In this paper, an optimization scheme is proposed for interconnect design with wire width and series resistance being design variables. Due to the distributed nature of interconnects, poles of such systems are transcendental and infinite in number. First, a two-pole approximation is used to capture the system behavior. Lower-order moments are employed to obtain two approximate dominant poles. Then, the two parameters, damping ratio and natural undamped frequency, are expressed as functions of the two dominant poles. Since the output response is characterized by the two parameters, the parameters are used to define the objective function and constraints, which form a constrained multivariable nonlinear optimization problem. After that, the optimization problem is solved using the gradient projection method. One advantage of our approach is the ability to explicitly control the maximum overshoot of the observation points. Two numerical examples are given.
205001001
The Towers of Hanoi Problem with Parallel Moves
Abstract This paper proposes a variant of the towers of Hanoi problem allowing parallel moves. An algorithm for this problem is presented and proved to be optimal.
33647867
Manipulating multiple stacks with ordered-heap
Abstract A new method for manipulating multiple stacks based on dynamic data structure is proposed in this paper. A simple data structure called ordered-heap is developed, in which nodes are preserved as a heap, and kept inorder traversal sequence remains unchanged. By employing ordered-heap to a multiple-stacks environment, it is easy and efficient to simultaneously handle several variable-size stacks in a sequential memory area. Our experiments show that not only the total number of item movements in the proposed method is much smaller than in the previous methods, but also the overhead for maintaining data structure in the proposed method is kept within a reasonable range.
10137544
Diagnosing Java Programs with Static Abstractions of Data Structures
Model-based software debugging helps users to find program errors and thus to reduce the overall costs for software development. In this paper, we extend our previous work to diagnose common data structure errors. The proposed logical program model derives from a collection of indexed object relations, which capture the underlying data structures at the abstraction level of objects. A case study suggests that the counterexample with the diagnoses can help the user to understand the nature of program errors and thus speed up error correction.
30935891
K-coverable polyhex graphs
32766485
Accelerating convergence in the Fermat-Weber location problem
This paper presents a simple procedure for accelerating convergence in a generalized Fermat-Weber problem with l"p distances. The main idea is to multiply the predetermined step size of the Weiszfeld algorithm by a factor which is a function of the parameter p. The form of this function is derived from the local convergence properties of the iterative sequence. Computational results are obtained which demonstrate that the total number of iterations to meet a given stopping criterion will be reduced substantially by the new step size, with the most dramatic results being observed for values of p close to 1.