Secure computation allows multiple parties to compute joint functions over private data without leaking any sensitive data, typically using powerful cryptographic techniques. Writing secure applications these techniques directly can be challenging, resulting in the development of several programming languages and compilers that aim make accessible. Unfortunately, many either lack or have limite...

We present a study on the convergence of computation coupled advection-diffusion-reaction equations. In computation, equations with different coefficients and even dissimilar types are assigned in two subdomains, Schwarz iteration is made between when marching from time step to next one. The analysis starts algebraic systems resulting full discretization linear by explicit schemes. Conditions f...

‎Bucket recursive trees are an interesting and natural‎ ‎generalization of ordinary recursive trees and have a connection‎ to mathematical chemistry‎. ‎In this paper‎, ‎we give the lower and upper bounds for the moment generating‎ ‎function and moments of the multiplicative Zagreb indices in a‎ ‎randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$‎. Also, ‎we consi...

Bidirectional Path Tracing (BDPT) is a robust unbiased rendering algorithm that samples paths by connecting eye and light paths. By optimally combining different sampling strategies using Multiple Importance Sampling (MIS), BDPT efficiently renders scenes with complex light effects. However, BDPT does not map well on a streaming architecture such as the GPU; Stochastic path lengths lead to an u...

The paper d e s c r i b e s a sys tem c a l l e d RENTTU, a c o l l e c t i o n o f f u n c t i o n s f o r c o m p u t a t i o n o f t r a n s f o r m a t i o n s from n a t u r a l l a n g u a g e s i n t o s e v e r a l types o f n a t u r a l s e c r e t l anguages such as P i g L a t i n e t c . By a n a t u r a l s e c r e t l a n g u a g e , somet imes c a l l e d can t i n E n g l i s h...

A general approach is presented for implementing discrete transforms as a set of rst-order or second-order recursive digital lters. Clenshaw's recurrence formulae are used to formulate the second-order lters. The resulting structure is suitable for e cient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the discrete Legendre transform as an ill...

In this paper, a new decomposition algorithm for realizing fast inverse modified discrete cosine transform (IMDCT) computation is presented. The decomposition algorithm can convert a pair of long transforms into 2 pairs of short transforms with half size of the long transforms. In addition, the decomposition algorithm can be utilized recursively to attain shorter transforms and reduce computati...

We propose a simple recursive algorithm that allows the computation of first- and second-order derivatives with respect to inputs an arbitrary deep feed forward neural network (DFNN). The naturally incorporates parameters. To test algorithm, we apply it study quantum mechanical variational problem for few cases potentials, modeling ground-state wave function in terms DFNN.

The purpose of this paper is to present a recursive algorithm and its implementation in Maple Mathematica for the computation joint moments cumulants Hawkes processes with exponential kernels. Numerical results times are also discussed. Obtaining closed form expressions can be computationally intensive, as fifth cumulant moment formulas respectively expanded into up 3,288 27,116 summands.

The present paper gives a thorough characterization of classes of !-languages deened by several classes of recursive automata and elementary acceptance conditions in terms of the arithmetical hierarchy. Here it is interesting to note that nitely branching nondeterministic looping or CoB uchi-accepting automata are only as powerful as their de-terministic counterparts whereas nondeterministic B ...