We study the kinematic geometry of general 3-RPR planar parallel robots with actuated base joints. These robots, while largely overlooked, have simple direct kinematics and large ...
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...
The design and development of complex products invariably involves many actors who have different points of view on the problem they are addressing, the product being developed, a...
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...