The paper presents an efficient method for finding the exact optimal solutions of reliability allocation problems that are formulated as an integer nonlinearprogramming problem generalized to handle nonlinear constra...
详细信息
The paper presents an efficient method for finding the exact optimal solutions of reliability allocation problems that are formulated as an integer nonlinearprogramming problem generalized to handle nonlinear constraints and nonseparable problems. The method is based on branch-and-bound and developed by considering separation and relaxation techniques.
This paper is a state-of-art review of the literature related to optimal system reliability with redundancy. The literature is classified as follows. Optimal system reliability models with redundancy Series Parallel S...
详细信息
This paper is a state-of-art review of the literature related to optimal system reliability with redundancy. The literature is classified as follows. Optimal system reliability models with redundancy Series Parallel Series-parallel Parallel-series Standby Complex (nonseries, nonparallel) Optimization techniques for obtaining optimal system configuration integerprogramming Dynamic programming Maximum principle linearprogramming Geometric programming Sequential unconstrained minimization technique (SUMT) Modified sequential simplex pattern search Lagrange multipliers and Kuhn-Tucker conditions Generalized Lagrangian function Generalized reduced gradient (GRG) Heuristic approaches Parametric approaches Pseudo-Boolean programming Miscellaneous
Techniques for determining the coefficients of digital filters which have equiripple or minimax errors are reviewed and occasionally extended. These techniques include: 1) mapping to provide equiripple errors in recur...
详细信息
Techniques for determining the coefficients of digital filters which have equiripple or minimax errors are reviewed and occasionally extended. These techniques include: 1) mapping to provide equiripple errors in recursive filters; 2) windows for making Fourier spectrum measurements with minimax leakage; 3) the simplex method of linearprogramming to provide minimax errors in a nonrecursive filter's time response to a known pulse or Fourier transform of its coefficients; 4) nonlinearprogramming to provide minimax errors for nominally any response and filter; and 5) an integerprogramming technique to provide minimax error despite quantizing the coefficients of a nonrecursive filter. Some sources of computer programs embodying these techniques are indicated.
This paper describes the development of a criterion for the quantization of line-drawing data. The criterion provides a guide for selecting the quantization fineness required to assure that the significant features of...
详细信息
The Multi-Criteria Test Suite Minimization (MCTSM) problem aims to remove redundant test cases, guided by adequacy criteria such as code coverage or fault detection capability. However, current techniques either exhib...
详细信息
The Multi-Criteria Test Suite Minimization (MCTSM) problem aims to remove redundant test cases, guided by adequacy criteria such as code coverage or fault detection capability. However, current techniques either exhibit a high loss of fault detection ability or face scalability challenges due to the NP-hard nature of the problem, which limits their practical utility. We propose TripRL, a novel technique that integrates traditional criteria such as statement coverage and fault detection ability with test coverage similarity into an integerlinear Program (ILP), to produce a diverse reduced test suite with high test effectiveness. TripRL leverages bipartite graph representation and its embedding for concise ILP formulation and combines ILP with effective reinforcement learning (RL) training. This combination renders large-scale test suite minimization more scalable and enhances test effectiveness. Our empirical evaluations demonstrate that TripRL’s runtime scales linearly with the magnitude of the MCTSM problem. Notably, for large test suites from the Defects4j dataset where existing approaches fail to provide solutions within a reasonable time frame, our technique consistently delivers solutions in less than 47 minutes. The reduced test suites produced by TripRL also maintain the original statement coverage and fault detection ability while having a higher potential to detect unknown faults.
As an important intermediate between integrated circuits (ICs) and the printed circuit board (PCB), the routing in the package substrate plays a crucial role in the efficiency and accuracy of signal and power transmis...
详细信息
As an important intermediate between integrated circuits (ICs) and the printed circuit board (PCB), the routing in the package substrate plays a crucial role in the efficiency and accuracy of signal and power transmission. While numerous research efforts have focused on substrate routing to avoid inefficient, time-consuming, and error-prone manual processes, few of them have addressed the challenge of routing multi-pin nets, particularly those with a large number of pins. This paper presents a three-stage framework of multi-pin net routing for packages with fine-pitch ball grid arrays, consisting of pin grouping, minimum spanning tree topology generation, and group topology connection. Our framework classifies net connections into different categories, prioritizes their routing ordering, and applies different routing approaches and strategies to boost overall routability. The results of the experiments conducted on six real industrial designs demonstrate that our framework can simultaneously and effectively handle two-pin nets and multi-pin nets with better routing performance compared to the state-of-the-art work.
An isomorphic notation is introduced to switching circuits which gives a one-to-one correspondence between the equation and the implementation. The application of nested parentheses makes the notation suitable for pro...
详细信息
An isomorphic notation is introduced to switching circuits which gives a one-to-one correspondence between the equation and the implementation. The application of nested parentheses makes the notation suitable for programming. It maintains essentially the ordinary algebraic equation form and may facilitate the development of more minimization theorems.
This paper is primarily concerned with finding, in the most efficient possible way, the set of all solutions to a cyclic prime implicant table. (A solution is a set of rows such that every column contains at least one...
详细信息
It is well known that the covering problem can be formulated as a system of linear inequalities together with a linear expression to be minimized;a technique for simplifying this system of inequalities is analyzed. Sp...
详细信息
暂无评论