A new generation algorithm for the base-K logarithm is presented. Intermediate results for computation of the logarithm are presented in the redundant signed digit (RSD) representation, and additions and subtractions were performed without carry propagation. Based on the properties of RSD arithmetic, higher performance is obtained as compared with the conventional logarithm in the classical bin...

We present a simple algorithm for estimating the cardinality of a set I, based on a RandomSample(I) primitive that returns an element of I uniformly at random. Our algorithm with probability (1−perr) returns an estimate of |I| accurate within a factor (1 ± δerr) invoking RandomSample(I) at most O (

Abadi has introduced a logic to explicate the meaning of local names in SDSI, the Simple Distributed Security Infrastructure proposed by Rivest and Lampson. Abadi’s logic does not correspond precisely to SDSI, however; it draws conclusions about local names that do not follow from SDSI’s name resolution algorithm. Moreover, its semantics is somewhat unintuitive. This paper presents the Logic of...

We consider a simple set of edit operations for unordered, edge-labeled trees, called information trees by Dal Zilio et al [DLM04]. We define tree languages using the sheaves automata from [FPS07] which in turn are based on [DLM04] and provide an algorithm for deciding whether a complex edit preserves membership in a tree language. This allows us to view sheaves automata and subsets of tree edi...

in this paper an algorithm for computing the balaban and randic indices of any simple connected graph was introduced. also these indices were computed for ipr c80 fullerene isomers, zigzag nanotubes and graphene by gap program.

In this paper, a fractional complex transform (FCT) is used to convert the given fractional partial differential equations (FPDEs) into corresponding partial differential equations (PDEs) and subsequently Reduced Differential Transform Method (RDTM) is applied on the transformed system of linear and nonlinear time-fractional PDEs. The results so obtained are re-stated by making use of inverse t...

In online labor markets, millions of paid tasks are performed by workers every day. We solve the stable pricing problem, that is, given the information about tasks and workers, to find a revenue-maximizing mechanism – pricing and allocation – that is stable (where no worker or task is treated unfairly), and truthful (tasks reveal their true needs). We propose two truthful, stable mechanisms nam...

0 200 400 600 80