English
Related papers

Related papers: Unlocking Your Bike the Easy Way

200 papers

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

Group Theory · Mathematics 2012-11-14 Volker Diekert , Andrew Duncan , Alexei Myasnikov

The card-cyclic-to-random shuffle is the card shuffle where the $n$ cards are labeled $1,\ldots,n$ according to their starting positions. Then the cards are mixed by first picking card $1$ from the deck and reinserting it at a uniformly…

Probability · Mathematics 2015-09-29 Johan Jonasson

Dynamic unary encoding takes unary encoding to the next level. Every n-bit binary string is an encoding of dynamic unary and every n-bit binary string is encodable by dynamic unary. By utilizing both forms of unary code and a single bit of…

Information Theory · Computer Science 2014-12-19 Ernst D. Berg

An efficient entailment proof system is essential to compositional verification using separation logic. Unfortunately, existing decision procedures are either inexpressive or inefficient. For example, Smallfoot is an efficient procedure but…

Logic in Computer Science · Computer Science 2022-10-04 Quang Loc Le , Xuan-Bach D. Le

Knots are entangled structures that cannot be untangled without a cut. Topological stability of knots is one of the many examples of their important properties that can be used in information storage and transfer. Knot dynamics is important…

Soft Condensed Matter · Physics 2022-11-04 Hyo Jung Park , Anna Lappala

Frequently, randomly organized data is needed to avoid an anomalous operation of other algorithms and computational processes. An analogy is that a deck of cards is ordered within the pack, but before a game of poker or solitaire the deck…

Data Structures and Algorithms · Computer Science 2008-11-24 William F. Gilreath

We propose here a new model of encryption of binary data taking advantage of the complexity associated with delayed dynamics. In this scheme, the encryption process is a coupling dynamics with various time delays between different bits in…

Computational Physics · Physics 2009-10-31 Toru Ohira

We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…

There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access…

Cryptography and Security · Computer Science 2013-09-06 Yun Song , Zhihui Li

Globally, motorcycles attract vast and varied users. However, since the rate of severe injury and fatality in motorcycle accidents far exceeds passenger car accidents, efforts have been directed toward increasing passive safety systems.…

Machine Learning · Computer Science 2024-03-15 Philipp Rodegast , Steffen Maier , Jonas Kneifl , Jörg Fehr

Understanding the criteria that bicyclists apply when they choose their routes is crucial for planning new bicycle paths or recommending routes to bicyclists. This is becoming more and more important as city councils are becoming…

Computer Vision and Pattern Recognition · Computer Science 2018-06-26 J. Oehrlein , A. Förster , D. Schunck , Y. Dehbi , R. Roscher , J. -H. Haunert

Cyclic codes, as linear block error-correcting codes in coding theory, play a vital role and have wide applications. Ding in \cite{D} constructed a number of classes of cyclic codes from almost perfect nonlinear (APN) functions and planar…

Information Theory · Computer Science 2013-06-03 Chunming Tang , Yanfeng Qi , Maozhi Xu

General cryptographic schemes are presented where keys can be one-time or ephemeral. Processes for key exchange are derived. Public key cryptographic schemes based on the new systems are easily established. Authentication and signature…

Cryptography and Security · Computer Science 2020-04-13 Ted Hurley

A problem of reconstructing words from their subwords involves determining the minimum amount of information needed, such as multisets of scattered subwords of a specific length or the frequency of scattered subwords from a given set, in…

Discrete Mathematics · Computer Science 2025-12-04 Sergey Luchinin , Svetlana Puzynina , Michaël Rao

Lock-free data objects offer several advantages over their blocking counterparts, such as being immune to deadlocks and convoying and, more importantly, being highly concurrent. But they share a common disadvantage in that the operations…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-10-05 Daniel Cederman , Philippas Tsigas

This article is meant to provide an additional point of view, applying known knowledge, to supply keys that have a series of non-repeating digits, in a manner that is not usually thought of. Traditionally, prime numbers are used in…

Cryptography and Security · Computer Science 2010-07-02 Givon Zirkind

In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the…

Computational Geometry · Computer Science 2007-05-23 T. Biedl , E. Demaine , M. Demaine , S. Lazard , A. Lubiw , J. O'Rourke , M. Overmars , S. Robbins , I. Streinu , G. Toussaint , S. Whitesides

Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made.…

Information Theory · Computer Science 2011-11-15 Cunsheng Ding

In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the…

Computational Geometry · Computer Science 2007-05-23 T. Biedl , E. Demaine , M. Demaine , S. Lazard , A. Lubiw , J. O'Rourke , M. Overmars , S. Robbins , I. Streinu , G. Toussaint , S. Whitesides

Directional locking occurs when a particle moving over a periodic substrate becomes constrained to travel along certain substrate symmetry directions. Such locking effects arise for colloids and superconducting vortices moving over ordered…

Soft Condensed Matter · Physics 2024-04-23 C. Reichhardt , C. J. O. Reichhardt