相关论文: S-storage operators

In this paper, we present three methods to give the value of a classical integer in $\lambda\mu$-calculus. The first method is an external method and gives the value and the false part of a normal classical integer. The second method uses a…

Frames on Hilbert C*-modules have been defined for unital C*-algebras by Frank and Larson and operator valued frames on a Hilbert space have been studied in arXiv.0707.3272v1.[math.FA]. Goal of the present paper is to introduce operator…

In [S\'eries Gevrey de type arithm\'etique I Th\'eor\'emes de puret\'e et de dualit\'e, Annals of Math. 151 (2000), 705--740], Andr\'e has introduced E-operators, a class of differential operators intimately related to E-functions, and…

Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in…

We consider linear spectral-meromorphic (s-meromorphic) OD operators at the real axis such that all local solutions to the eigenvalue problems are meromorphic for all $\lambda$. By definition, rank one algebro-geometrical operator $L$ admit…

Dynamic distributed storage algorithms such as DynaStore, Reconfigurable Paxos, RAMBO, and RDS, do not ensure liveness (wait-freedom) in asynchronous runs with infinitely many reconfigurations. We prove that this is inherent for…

Notions of guardedness serve to delineate the admissibility of cycles, e.g. in recursion, corecursion, iteration, or tracing. We introduce an abstract notion of guardedness structure on a symmetric monoidal category, along with a…

We define a new class of pushdown systems where the pushdown is a tree instead of a word. We allow a limited form of lookahead on the pushdown conforming to a certain ordering restriction, and we show that the resulting class enjoys a…

Motivated by the study of spectral properties of self-adjoint operators in the integral group ring of a sofic group, we define and study integer operators. We establish a relation with classical potential theory and in particular the circle…

In this note we study the structure of shift-preserving operators acting on a finitely generated shift-invariant space. We define a new notion of diagonalization for these operators, which we call s-diagonalization. We give necessary and…

Scalable ordered maps must ensure that range queries, which operate over many consecutive keys, provide intuitive semantics (e.g., linearizability) without degrading the performance of concurrent insertions and removals. These goals are…

An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…

BSS RAMs over first-order structures help to characterize algorithms for processing objects by means of useful operations and relations. They are the result of a generalization of several types of abstract machines. We want to discuss…

We show how to extract existential witnesses from classical proofs using Krivine's classical realizability---where classical proofs are interpreted as lambda-terms with the call/cc control operator. We first recall the basic framework of…

In contrast to other constructivist schools, for Brouwer, the notion of "constructive object" is not restricted to be presented as `words' in some finite alphabet of symbols, and choice sequences which are non-predetermined and unfinished…

The current research is devoted to find an affirmative answer to an open question related to $(s,r)-$contractive operators which have been introduced by Ovidiu Popescu.

Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and its client, with interactions limited to passing values of a given…

A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and…

While a lot of work in theoretical computer science has gone into optimizing the runtime and space usage of data structures, such work very often neglects a very important component of modern computers: the cache. In doing so, very often,…

We live in a data-centric world where we are heading to generate close to 200 Zettabytes of data by the year 2025. Our data processing requirements have also increased as we push to build data processing frameworks that can process large…