Search results for "PROGRAM"

Proving convexity preserving properties of interpolatory subdivision schemes through reconstruction operators

2013

We introduce a new approach towards proving convexity preserving properties for interpolatory subdivision schemes. Our approach is based on the relation between subdivision schemes and prediction operators within Harten's framework for multiresolution, and hinges on certain convexity properties of the reconstruction operator associated to prediction. Our results allow us to recover certain known results [10,8,1,7]. In addition, we are able to determine the necessary conditions for convexity preservation of the family of subdivision schemes based on the Hermite interpolation considered in [4].

Multi-letter reversible and quantum finite automata

2007

The regular language (a+b)*a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this language. We introduce a new, quite simple modification of the QFA model (actually even a deterministic reversible FA model) which is able to recognize this language. We also completely characterise the set of languages recognizable by the new model FAs, by finding a "forbidden construction" whose presence or absence in the minimal deterministic (not necessaril…

On Extensional Fuzzy Sets Generated by Factoraggregation

2014

We develop the concept of a general factoraggregation operator introduced by the authors on the basis of an equivalence relation and applied in two recent papers for analysis of bilevel linear programming solving parameters. In the paper this concept is generalized by using a fuzzy equivalence relation instead of the crisp one. We show how the generalized factoraggregation can be used for construction of extensional fuzzy sets and consider approximations of arbitrary fuzzy sets by extensional ones.

Implementation of the Neuberger overlap operator in GPUs

2011

Improving Interpolants for Linear Arithmetic

2015

Craig interpolation for satisfiability modulo theory formulas have come more into focus for applications of formal verification. In this paper we, introduce a method to reduce the size of linear constraints used in the description of already computed interpolant in the theory of linear arithmetic with respect to the number of linear constraints. We successfully improve interpolants by combining satisfiability modulo theory and linear programming in a local search heuristic. Our experimental results suggest a lower running time and a larger reduction compared to other methods from the literature.

Did Pindar’s scheme really exist?

2017

Abstract: A Greek construction in which the verb is in the 3rd sg. form, while the subject is in the 3rd pl. and, in most cases, in post–verbal position, is called Pindar’s scheme inasmuch as it occurs most frequently in the poems of this author. Various explanations have been provided for this construction and it has also been interpreted as an error. The paper is an attempt at an overall syntactic explanation of the available data.

Elliptic convolution operators on non-quasianalytic classes

2001

For those nonquasianalytic classes in which an extension of the classical Borel's theorem holds we show that every elliptic convolution operator is the composition of a translation and an invertible ultradifferential operator. This answers a question asked by Chou in: La transformation de Fourier complexe et l'equation de convolution, LNM 325, Berlin-Heidelberg-New York (1973).

Equivalence Problem of Composite Class Diagrams

2001

Multiplicity constraints in a UML composite class diagram may be inconsistent. An algorithm is given for eliminating all such inconsistencies. Using this algorithm an algorithm is constructed which for two given composite class diagrams solves the equivalence problem. These algorithms can be embedded in CASE tools for automated detection of multiplicity inconsistencies.

Ten Words About Morphogenetic Images

2018

This chapter describes how the repertoire of images derived from morphogenetic shaping processes is widely studied in every scientific and humanistic field. These are from the pioneering experiences of cinematic, programmed and generative arts of the 1960s and 1970s, the utopian digital space spells in the ‘90s, the morphogenetic architectural projects in the early 2000s, to the latest experiences. It is possible to look at these currents with a critical look detached from the time distance that has developed. Many denominations indicate processes and experiences in different fields but result from a common intellectual matrix. This is used to generate shapes, figures, spaces or images from…

Sequential formula translation

1983

The syntax of an algorithmic language such as ALGOL is conveniently described as a sequence of states indicated by an element called cellar. Transitions are controlled by admissible state- s ymbol pairs which may be represented by a transition matrix. This description of syntax furnishes at the same time an extremely simple rule for translating into machine programs statements in the algorithmic language. Sequential treatment, however, is not feasible in the case of certain optimizing processes such as recursive address calculation.