This paper proposes a new memory system called shuffle memory. The shuffle memory is a generalization of transposition memory that has been widely used in 2-D Discrete Cosine Transform and Discrete Fourier Transform. The shuffle memory is the first memory system that receives M N inputs in row major while providing M N outputs in column major order using only M N memory space. Shuffle memory ca...

We propose a variant of the Paillier cryptosystem that improves efficiency in encryption, re-encryption and decryption while preserving the homomorphic property. We then use this variant to construct a new verifiable shuffle system and prove its security. We show that the new shuffle scheme has the least number of rounds and exponentiations compared to all known shuffle schemes. Finally, we sho...

The study of RNA editing and other molecular processes in the trypanosome mitochondrion would benefit greatly from the ability to insert and express exogenous DNA in the organelle. However, even with a method to introduce DNA, the current lack of knowledge about mitochondrial transcription would hinder efforts to obtain expression. To circumvent this problem, Leishmania tarentolae promastigotes...

MapReduce is a programming model from Google for cluster-based computing in domains such as search engines, machine learning, and data mining. MapReduce provides automatic data management and fault tolerance to improve programmability of clusters. MapReduce’s execution model includes an all-map-to-all-reduce communication, called the shuffle, across the network bisection. Some MapReductions mov...

Shuffle-exchange networks have been proposed as an attractive choice for interconnection networks. They have constant node degree and sublogarithmic diameter. Several researchers have studied various combinatorial and interconnection properties of them. In this paper, we generalize shuffle-exchange networks and define a new class of networks, called generalized shuffle-exchange network and deno...

We study the higher order shuffle regularization for multiple zeta values and define higher order regularized shuffle relations. We find that higher order regularized shuffle relations can be deduced from the group-like property of the Drinfel’d associator.

The class of shuffle ideals is a fundamental sub-family of regular languages. The shuffle ideal generated by a string set U is the collection of all strings containing some string u ∈ U as a (not necessarily contiguous) subsequence. In spite of its apparent simplicity, the problem of learning a shuffle ideal from given data is known to be computationally intractable. In this paper, we study the...

MapReduce clusters are usually multi-tenant (i.e., shared among multiple users and jobs) for improving cost and utilization. The performance of jobs in a multitenant MapReduce cluster is greatly impacted by the allMap-to-all-Reduce communication, or Shuffle, which saturates the cluster’s hard-to-scale network bisection bandwidth. Previous schedulers optimize Map input locality but do not consid...

A shuffle is a permutation and re-encryption of a set of ciphertexts. Shuffles are for instance used in mix-nets for anonymous broadcast and voting. One way to make a shuffle verifiable is to give a zero-knowledge proof of correctness. All currently known practical zero-knowledge proofs for correctness of a shuffle rely on interaction. We give the first efficient non-interactive zeroknowledge p...

Large-N multi-matrix loop equations are formulated as quadratic difference equations in concatenation of gluon correlations. Though non-linear, they involve highest rank correlations linearly. They are underdetermined in many cases. Additional linear equations for gluon correlations, associated to symmetries of action and measure are found. Loop equations aren’t differential equations as they i...