We have developed a methodology based on symbolic manipulation of inductive Boolean functions (IBFs) for formal verification of inductively-defined hardware. This methodology combines the techniques of reasoning by induction and symbolic tautologychecking in an automated and potentially efficient way. In this paper, we describe a component of this methodology that regards various mechanisms use...

The real root classification of a given parametric spline function is a collection of possible cases of its real root distribution on every interval, together with the conditions of its coefficients must be satisfied for each case. This paper presents an algorithm to deal with the real root classification of a given parametric spline function. Two examples are provided to illustrate the propose...

in this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. first we introduce a parametric equivalent of the problem. then a bisection and a generalized newton-based method algorithms are presented to solve it. in order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

the index is excellent by the malmquist index as extended to productivity measurement. the index developed here is defined in terms of input cost rather than input quantity distance functions in supply chain. therefore, we propose productivity change is decomposed into overall efficiency and cost technical change. these decompositions provide a clearer situation of the root sources of supply ch...

We consider the conic linear program given by a closed convex cone in an Euclidean space and matrix, where vector on right-hand side of inequality constraint defining objective function are subject to change. Using strict feasibility condition, we prove locally Lipschitz continuity obtain some differentiability properties optimal value problem under right-hand-side perturbations. For perturbati...