Generic Construction of Scale-Invariantly Coarse Grained Memory

نویسنده

  • Karthik H. Shankar
چکیده

Encoding temporal information from the recent past as spatially distributed activations is essential in order for the entire recent past to be simultaneously accessible. Any biological or synthetic agent that relies on the past to predict/plan the future, would be endowed with such a spatially distributed temporal memory. Simplistically, we would expect that resource limitations would demand the memory system to store only the most useful information for future prediction. For natural signals in real world which show scale free temporal fluctuations, the predictive information encoded in memory is maximal if the past information is scale invariantly coarse grained. Here we examine the general mechanism to construct a scale invariantly coarse grained memory system. Remarkably, the generic construction is equivalent to encoding the linear combinations of Laplace transform of the past information and their approximated inverses. This reveals a fundamental construction constraint on memory networks that attempt to maximize predictive information storage relevant to the natural world.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PACK/UNPACK on Coarse-Grained Distributed Memory Parallel Machines

PACK/UNPACK are Fortran 90/HPF array construction functions which derive new arrays from existing arrays. We present algorithms for performing these operations on coarse-grained parallel machines. Our algorithms are relatively architecture independent and can be applied to arrays of arbitrary dimensions with arbitrary distributionalong every dimension. Experimental results are presented on the

متن کامل

Iterative Reconstruction of Memory Kernels.

In recent years, it has become increasingly popular to construct coarse-grained models with non-Markovian dynamics to account for an incomplete separation of time scales. One challenge of a systematic coarse-graining procedure is the extraction of the dynamical properties, namely, the memory kernel, from equilibrium all-atom simulations. In this article, we propose an iterative method for memor...

متن کامل

1 Models for Parallelalgorithm Design : An

In this chapter, we present three classical models used for the design of parallel algorithms: the PRAM (shared memory) model, the distributed memory model, and the coarse grained multicomputer model. Given a generic algorithm to solve a simple, but important, problem, we show its implementation on the diierent models in order to guide the reader through the very interesting task of parallel al...

متن کامل

Coarse-graining of cellular automata, emergence, and the predictability of complex systems.

We study the predictability of emergent phenomena in complex systems. Using nearest-neighbor, one-dimensional cellular automata (CA) as an example, we show how to construct local coarse-grained descriptions of CA in all classes of Wolfram's classification. The resulting coarse-grained CA that we construct are capable of emulating the large-scale behavior of the original systems without accounti...

متن کامل

Parallelization Strategies and Performance Analysis of Media Mining Applications on Multi-Core Processors

This paper studies how to parallelize the emerging media mining workloads on existing small-scale multi-core processors and future large-scale platforms. Media mining is an emerging technology to extract meaningful knowledge from large amounts of multimedia data, aiming at helping end users search, browse, and manage multimedia data. Many of the media mining applications are very complicated an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015