In this paper we give a denotational model for Abadi and Cardelli’s first order object calculus FOb1+×μ (without subtyping) in the category pCpo. The key novelty of our model is its extensive use of recursively defined types, supporting self-application, to model objects. At a technical level, this entails using some sophisticated techniques such as Freyd’s algebraic compactness to guarantee th...

This paper addresses the problem of identifiability nonlinear polynomial state-space systems. Such systems have already been studied via input-output equations, a description that, in general, requires differential algebra. The authors use different algebraic approach, which is based on distinguishability and observability. Employing techniques from geometry such as ideals Gröbner bases, local ...

Sign determination is a fundamental problem in algebraic as well as geometric computing. It is the critical operation when using real algebraic numbers and exact geometric predicates. We propose an exact and eecient method that determines the sign of a multivariate polynomial expression with rational coeecients. Exactness is achieved by using modular computation. Although this usually requires ...

Sign determination is a fundamental problem in algebraic as well as geometric computing It is the critical operation when using real algebraic numbers and exact geometric predi cates We propose an exact and e cient method that determines the sign of a multivariate polynomial expression with rational coe cients Exactness is achieved by using modular computation Although this usually requires som...

The design and implementation of advanced personalized database applications requires a preference-driven approach. Representing preferences as strict partial orders is a good choice in most practical cases. Therefore the efficient integration of preference querying into standard database technology is an important issue. We present a novel approach to relational preference query optimization b...

We present an approach for inferring symbolic resource bounds for purely functional programs consisting of recursive functions, algebraic data types and nonlinear arithmetic operations. In our approach, the developer specifies the desired shape of the bound as a program expression containing numerical holes which we refer to as templates. For e.g, time ≤ a ∗ height(tree) + b where a, b are unkn...

The design and implementation of advanced personalized database applications requires a preference-driven approach. Representing preferences as strict partial orders is a good choice in most practical cases. Therefore the efficient integration of preference querying into standard database technology is an important issue. We present a novel approach to relational preference query optimization b...

In this manuscripts, we consider the coupled differential-integral equations including variable-order Caputo fractional operator. To solve numerically these type of equations, apply shifted Jacobi-Gauss collocation scheme. Using numerical method a system algebraic is constructed. We with recursive in nonlinear case and it linear formulas. Finally, for high performance suggested three Examples a...