We explore supervised learning for a collective motion of lattice based modular robots that can access only local information. In our proposed learning algorithm, stable locomotion gaits of small size configurations are given to modules by human demonstration. Support vector machine and regularized least square are used to train the manually data given, and performances are compared. We show ou...

We analyse the meson spectrum in quenched QCD using lattice gauge theory. By studying hadron propagation with a variety of operators (both smeared and local), we are able to extract the ground state and first excited state masses with confidence. We pay attention to the correlations among the data used in the fits to extract these masses and couplings. We compare the resulting hadron spectrum w...

We present deterministic polynomially space bounded algorithms for the closest vector problem for all lp-norms, 1 < p < ∞, and all polyhedral norms, in particular for the l1norm and the l∞-norm. For all lp-norms with 1 < p < ∞ the running time of the algorithm is p · log2(r)n, where r is an upper bound on the size of the coefficients of the target vector and the lattice basis and n is the dimen...

classical lbp such as complexity and high dimensions of feature vectors that make it necessary to apply dimension reduction processes. in this paper, we introduce an improved lbp algorithm to solve these problems that utilizes fast pca algorithm for reduction of vector dimensions of extracted features. in other words, proffer method (fast pca+lbp) is an improved lbp algorithm that is extracted ...

AND LATTICE VECTOR QUANTIZATION Peter Monta and Shiufun Cheung Advanced Television and Signal Processing Group Research Laboratory of Electronics Massachusetts Institute of Technology Cambridge, MA ABSTRACT We describe a perceptual audio coder that employs nonuniform hierarchical lterbanks and entropy-coded lattice vector quantization. The nonuniform lterbanks present a good match to critical-b...

Lattice-based cryptography is one of the leading proposals for post-quantum cryptography. The Shortest Vector Problem (SVP) arguably most important problem cryptanalysis lattice-based cryptography, and many schemes have security claims based on its hardness. best quantum algorithm SVP due to Laarhoven [] runs in (heuristic) time \(2^{0.2653d + o(d)}\). In this article, we present an improvement...

We address the formation and propagation of vector solitons in optical lattices in the presence of anisotropy-induced walk-off between ordinary and extraordinary polarized field components. Stable vector solitons trapped by the lattice form above a threshold power, while decreasing the lattice depth below a critical value results in the abrupt release of the caged solitons that then move across...

We consider the problem of designing structured multiple description vector quantizers. We present a general procedure for designing such quantizers based on the algebraic structure of the lattices, and we present detailed results for the hexagonal lattice: algorithms, asymptotic performance, and numerical simulations. A salient property of the proposed construction is that the second moment of...

While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when applied to high variance vectors result in very large and unwieldy indices, making it unsuitable for applications requiring successive refinement. The goal of this work is to develop a unified framework for progressive un...