No abstract uploaded!

We give a characterization of the action of the mapping class group on Thurston's space of measured laminations.

We consider a volume maximization program to construct hyperbolic structures on triangulated 3-manifolds, for which previous progress has lead to consider angle assignments which do not correspond to a hyperbolic metric on each simplex. We show that critical points of the generalized volume are associated to geometric structures modeled on the extended hyperbolic space-the natural extension of hyperbolic space by the de Sitter space-except for the degenerate case where all simplices are Euclidean in a generalized sense.

We study sparse blind source separation (BSS) for a class of positive and partially overlapped signals. The signals are only allowed to have nonoverlapping at certain locations, while they could overlap with each other elsewhere. For nonnegative data, a novel approach has been proposed by Naanaa and Nuzillard (NN) assuming that nonoverlapping exists for each source signal at some location of acquisition variable. However, the NN method introduces errors (spurious peaks) in the output when their nonoverlapping condition is not satisfied. To resolve this problem and improve robustness of separation, postprocessing techniques are developed in two aspects. One is to detect coherent and uncertain components from NN outputs by using multiple mixture data, then removing the uncertain portion to enhance signals. The other is to find better estimation of mixing matrix by leveraging reliable source peak

We show that Multivariate Public Key Cryptosystems (MPKCs) over fields of small odd prime characteristic, say 31, can be highly efficient. Indeed, at the same design security of 2^{80} under the best known attacks, odd-char MPKC is generally faster than prior MPKCs over \GF{2^k}, which are in turn faster than "traditional'' alternatives. This seemingly counter-intuitive feat is accomplished by exploiting the comparative over-abundance of small integer arithmetic resources in commodity hardware, here embodied by SSE2 or more advanced special multimedia instructions on modern x86-compatible CPUs. We explain our implementation techniques and design choices in implementing our chosen MPKC instances modulo small a odd prime. The same techniques are also applicable in modern FPGAs which often contains a large number of multipliers.