The authors thank Jeni Beecham, Margaret Brandeau, Miranda Mugford, Marie-Louise Newell, Angus Nicoll, Tony Oliver, Doug Owens, and Richard Smith, as well as our referees for their invaluable assistance at various stages of the study. Contributors: MJP and EJB conceived the idea for the project. MJP developed the cost effectiveness model in conjunction with EJB, SM, LS, MDSW, HH, and JCJ. EJB a...

Technology Laboratory, U.S.A N-BEST BASED SUPERVISED AND UNSUPERVISED ADAPTATION FOR NATIVE AND NON-NATIVE SPEAKERS IN CARS P. Nguyen1,2, Ph. Gelin1, J-C. Junqua1 and J-T. Chien3,* 1Panasonic Technologies Inc., Speech Technology Laboratory, Santa Barbara, California 2Institut Eurécom, Sophia-Antipolis, Cedex, France 3Depart. of Computer Science and Information Engineering, National Cheng Kung U...

We present a CGM/BSP algorithm for computing an alignment (or string editing) between two strings A and C, with jAj = m and jCj = n. The algorithm requires O(p) communication rounds and O( p ) local computing time, on a distributed memory parallel computer of p processors each with O(nm=p) memory. We also present implementation results obtained on Beowulf machine with 64 nodes. Topic of interes...

Definitions of election verifiability in the computational model of cryptography are proposed. The definitions formalize notions of voters verifying their own votes, auditors verifying the tally of votes, and auditors verifying that only eligible voters vote. The Helios (Adida et al., 2009) and JCJ (Juels et al., 2010) election schemes are shown to satisfy these definitions. A previous definiti...

Definitions of election verifiability in the computational model of cryptography are proposed. The definitions formalize notions of voters verifying their own votes, auditors verifying the tally of votes, and auditors verifying that only eligible voters vote. The Helios (Adida et al., 2009) and JCJ (Juels et al., 2010) election schemes are shown to satisfy these definitions. Two previous defini...

Individual verifiability is the ability of an electronic voting system to convince a voter that his vote has been correctly counted in the tally. Unfortunately, in most electronic voting systems the proofs for individual verifiability are non-intuitive and, moreover, need trusted devices to be checked. Based on the remote voting system JCJ/Civitas, we propose Trivitas, a protocol that achieves ...

Attribute reduction is one of the key issues in rough set theory. Many heuristic attribute reduction algorithms such as positive-region reduction, information entropy reduction and discernibility matrix reduction have been proposed. However, these methods are usually computationally time-consuming for large data. Moreover, a single attribute significance measure is not good for more attributes ...

Election verifiability is defined in the computational model of cryptography. The definition formalizes notions of voters verifying their own votes, auditors verifying the tally of votes, and auditors verifying that only eligible voters vote. The Helios (Adida et al., 2009), Helios-C (Cortier et al., 2014) and JCJ (Juels et al., 2010) election schemes are analyzed using the definition. Neither ...

Comment on " Heat-Flow Induced Anomalies in Superfluid 4 He near T l " In a recent Letter [1], Haussmann and Dohm (HD) presented a renormalization group treatment of the 4 He lambda transition in a heat current Q. In this Comment, we use simple arguments that yield the same critical point exponent for the depressed T l , and nearly the same critical velocity, but indicate that HD may not have c...

In [1], Libeskind-Hadas recently provided a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithm. Given an interconnection network represented by a digraph G = (N;C), where each vertex in N represents a node and each directed link in C represents a unidirectional channel, Libeskind-Hadas showed that jCj 2jN j 2 is the tight lowered on...