we analyze some properties of the distribution $q_{g,k}$ of the first component in a $k$-tuple chosen uniformly‎ ‎in the set of all the $k$-tuples generating a finite group $g$ (the limiting distribution of the product replacement algorithm)‎. ‎in particular‎, ‎we concentrate our attention on‎ ‎the study of the variation distance $beta_k(g)$ between $q_{g,k}$ and the uniform distribution‎. ‎we ...

This paper describes a generalisation of the binary N tuple technique originally described by Bledsoe and Browning (1). The binary N tuple technique has commonly been used for the classification (2) and pre-processing (3) of binary images. The extension to the method described here allows grey level images of objects to be classified using the N tuple method without first having to convert the ...

Lattice sieving is asymptotically the fastest approach for solving the shortest vector problem (SVP) on Euclidean lattices. All known sieving algorithms for solving the SVP require space which (heuristically) grows as 2, where n is the lattice dimension. In high dimensions, the memory requirement becomes a limiting factor for running these algorithms, making them uncompetitive with enumeration ...

The development of the Internet Things (IoT) came with manufacturing a huge amount smart things equipped sensors for making them aware their environment, and network connection allowing remote interaction them. However, most still lack enough autonomy context-awareness, hindering from being people-friendly actually useful users' everyday tasks. IoT devices should take advantage smartness to rea...

We present the design of a BPEL orchestration engine based on ReSpecT tuple centres, a coordination model extending Linda with the ability of declaratively programming the reactive behaviour of tuple spaces. Architectural and linguistic aspects of our solution are discussed, focussing on how the syntax and semantics of BPEL have been mapped to tuple centres. This is achieved by a translation of...