Abstract Our discovery of a compact closed-form solution to Hammerstein systems has led to the ability to quantitatively compare competing experimental designs. This index is a quantitative measure of the information content in a design and is based on the D-optimality criterion. It is called efficiency in the statistical literature. This efficiency (ratio) shows the superiority of statistical ...

Configurations of adders and registers, which are available in tnany datapaths, can be utilized to generate pattems and to compact test responses. This paper unalyzes tlie patiern sequences produced by different types of accuriiulators and shows that they can achieve similar ,fault coverage as pseudo-random patterns. Corizpared to file well-known selftest tnethods that insert test registers, th...

We consider the question of simultaneous extension of (pseudo)metrics defined on nonempty closed subsets of a compact metrizable space. The main result is a counterpart of the result due to Künzi and Shapiro for the case of extension operators of partial continuous functions and includes, as a special case, Banakh’s theorem on linear regular operators extending (pseudo)metrics.

The split-C(V) technique has served during three decades for independent extraction of the inversion and accumulation charge in MOSFETs from the direct measurement of the gate-to-channel capacitance [1]. The total charge, Q, obtained from the integration of the gateto-channel capacitance curves, can be used for the evaluation of the carrier mobility using the standard MOSFET equations (μ α ID/Q...

We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computation by computing models of completion. One particular attractive candidate for the latter task is pseudo-boolean constraint solvers. To strengthen this connection, we show examples of compact encoding of aggregates and ...

The domain theoretic notion of lifting allows one to extend a partial order in a trivial way by a minimum. In the context of Quantitative Domain Theory (e.g. [BvBR98] and [FK93]) partial orders are represented as quasi-metric spaces. For such spaces, the notion of the extension by an extremal element turns out to be non trivial. To some extent motivated by these considerations, we characterize ...