Publications related to Algorithmically random sequence

Neural Pre-coding Increases the Pattern Retrieval Capacity of Hopﬁeld and Bidirectional Associative Memories

Wulfram Gerstner, Mohammad Amin Shokrollahi, Krishna Kumar, Amir Hesam Salavati

We consider the problem of neural association, which deals with the retrieval of a previously memorized pattern from its noisy version. The performance of various neural networks developed for this task may be judged in terms of their pattern retrieval cap ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Probing the Dynamics of Spontaneous Quantum Vortices in Polariton Superfluids

Benoît Marie Joseph Deveaud, Vincenzo Savona, Timothy Chi Hin Liew, Konstantinos Lagoudakis, Barbara Pietka, Francesco Manni

The experimental investigation of spontaneously created vortices is of utmost importance for the understanding of quantum phase transitions towards a superfluid phase, especially for two-dimensional systems that are expected to be governed by the Berezinsk ...

American Physical Society2011

Fast Randomized Test-and-Set and Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Hagit Albo Attiya, Andrei Giurgiu

Most people believe that renaming is easy: simply choose a name \emph{at random}; if more than one process selects the same name, then try again. We highlight the issues that occur when trying to implement such a scheme and shed new light on the read-write ...

2010

Rateless Codes for AVC Models

Michael Christoph Gastpar

The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an adversary. Fixed-blocklength coding assumes a worst-case bound on the adversary's capabilities, which leads to pessimistic results. This paper defines a vari ...

2010

Dynamic analysis of anchored concrete linings of plunge pools loaded by high velocity jet impacts issuing from dam spillways

Anton Schleiss

A theoretical stochastic approach is presented for the structural analysis of plunge pool liners dynamically loaded by the impact of free-falling jets. Such an approach was used as the real behaviour of plunge pool liners is complex, and deterministic meth ...

2010

On the benefits of vector network coding

Christina Fragouli, Javad Ebrahimi Boroojeni

In vector network coding, the source multi- casts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L × L coding matrices that play a similar role as coding coeffic ...

2010

Fast Randomized Test-and-Set and Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Hagit Albo Attiya, Andrei Giurgiu

Most people believe that renaming is easy: simply choose a name \emph{at random}; if more than one process selects the same name, then try again. We highlight the issues that occur when trying to implement such a scheme and shed new light on the read-write ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Authentication with built-in encryption by using moire parallax effects between fixed correlated s-random layers

Roger Hersch, Isaac Amidror

This invention discloses new methods and security devices for authenticating documents and valuable products which may be applied to any support, including transparent synthetic materials and traditional opaque materials such as paper. The invention relate ...

2009

Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

Jongho Shin, Byung Jun Joo

This paper focuses on the scheduling problem of minimizing makespan for a given set of jobs in a two-stage hybrid flowshop subject to a product-mix ratio constraint. There are identical parallel machines at the first stage of the hybrid flowshop, while the ...

2009

Algorithmically random sequence

Graph Chatbot

Chat with Graph Search

Neural Pre-coding Increases the Pattern Retrieval Capacity of Hopﬁeld and Bidirectional Associative Memories

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Probing the Dynamics of Spontaneous Quantum Vortices in Polariton Superfluids

Fast Randomized Test-and-Set and Renaming

Rateless Codes for AVC Models

Dynamic analysis of anchored concrete linings of plunge pools loaded by high velocity jet impacts issuing from dam spillways

On the benefits of vector network coding

Fast Randomized Test-and-Set and Renaming

Authentication with built-in encryption by using moire parallax effects between fixed correlated s-random layers

Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

Rateless Codes for AVC Models

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Neural Pre-coding Increases the Pattern Retrieval Capacity of Hopﬁeld and Bidirectional Associative Memories

Probing the Dynamics of Spontaneous Quantum Vortices in Polariton Superfluids

Fast Randomized Test-and-Set and Renaming

Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

Dynamic analysis of anchored concrete linings of plunge pools loaded by high velocity jet impacts issuing from dam spillways

On the benefits of vector network coding

Fast Randomized Test-and-Set and Renaming

Authentication with built-in encryption by using moire parallax effects between fixed correlated s-random layers