This paper describes a new computational approach to multivariate scattered data interpolation. It is assumed that the data is generated by a Lipschitz continuous function f. The proposed approach uses the central interpolation scheme, which produces an optimal interpolant in the worst case scenario. It provides best uniform error bounds on f, and thus translates into reliable learning of f. Th...

Despite its recent popularity, program verification has to face practical limitations hindering its everyday use. One of these issues is scalability, both in terms of time and memory consumption. In this paper, we present Partial Variable Assignment InterpolatoR (PVAIR) – an interpolation tool exploiting partial variable assignments to significantly improve performance when computing several sp...

Over the past decade, the radial basis function method has been shown to produce high quality solutions to the multivariate scattered data interpolation problem. However, this method has been associated with very high computational cost, as compared to alternative methods such as finite element or multivariate spline interpolation. For example, the direct evaluation at M locations of a radial b...

A method is presented for generating a broad-band rational interpolant approximation of the reflection coefficient of multiple-screen frequency-selective surfaces (FSSs). The technique is structured around a linearization of the system provided by a spectral domain moment method-based analysis of the FSS, followed by a model-order reduction of the linearized system using the dual rational Arnol...

Chernyaev’s Marching Cubes 33 is one of the first algorithms intended to preserve the topology of the trilinear interpolant. In this work, we address three issues with the Marching Cubes 33 algorithm, two of which are related to its original description and one that is related to its variant. In particular, we solve a problem with the core disambiguation procedure of Marching Cubes 33 that prev...

We present a method to compute uniform interpolants with fixpoints for ontologies specified in the description logic ALC. The aim of uniform interpolation is to reformulate an ontology such that it only uses a specified set of symbols, while preserving consequences that involve these symbols. It is known that in ALC uniform interpolants cannot always be finitely represented. Our method computes...

Generalized composite fluxbrane solutions for a wide class of intersection rules are obtained. The solutions are defined on a manifold which contains a product of n Ricci-flat spaces M1 × . . . × Mn with 1-dimensional M1 . They are defined up to a set of functions Hs obeying non-linear differential equations equivalent to Toda-type equations with certain boundary conditions imposed. A conjectur...

Os flavonóides presentes nos extratos de cana-de-açúcar (Saccharum officinarum) foram analisados por cromatografia líquida acoplada à espectrometria de massas (LC-MS), e o estudo da rota de fragmentação dos flavonóides selecionados foi realizado utilizando a espectrometria de massas com aceleração ortogonal por tempo de vôo e ionização eletrospray (ESI-oa-ToF MS). Sete flavonas Ce O-glicosilada...