We present an implementation of an answer-set programming paradigm, called aspps (short for answer-set programming with propositional schemata). The system aspps is designed to process PS +-theories. It consists of two basic modules. The first module, psgrnd, grounds an PS +-theory. The second module, referred to as aspps, is a solver. It computes models of ground PS +-theories.

The analysis of lifetime data is an important research area in statistics, particularly among econometricians and biostatisticians. The two most popular semi-parametric models are the proportional hazards model and the accelerated failure time (AFT) model. The proportional hazards model is computationally advantageous over virtually any other competing semi-parametric model because the ubiquito...

We describe a program called SketchIT that transforms a single sketch of a mechanical device into multiple families of new designs. It represents each of these families with a “BEP-Model,” a parametric model augmented with constraints that ensure the device produces the desired behavior. The program is based on qualitative configuration space (qc-space), a novel representation that captures mec...

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...

A methodology for combining multi-parametric programming and NCO tracking is presented in the case of linear dynamic systems. The resulting parametric controllers consist of (potentially nonlinear) feedback laws for tracking optimality conditions by exploiting the underlying optimal control switching structure. Compared to the classical multi-parametric MPC controller, this approach leads to a ...

Computer algebra systems, such as Axiom, and programming languages designed for computer algebra, such as Aldor, have very flexible mechanisms for generic code, with type parameterization. Modern versions of Maple can support this style of programming through the use of Maple's module system, and by using module-producing functions to give parametric type constructors. From the software design ...