Recurrent neural network closure of parametric POD-Galerkin reduced-order models based on the Mori-Zwanzig formalism
Related publications (62)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Stress can affect the establishment and maintenance of social hierarchies. In the present study, we investigated the role of increasing corticosterone levels before or just after a first social encounter between two rats of a dyad in the establishment and ...
In the current study, we examined whether sensorimotor information stored in short-term memory may influence the temporal features between overt and covert execution of human locomotor movements and, furthermore, to examine to what extent such influence ma ...
We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernel-based Perceptron for storing the online hypothesis is not bounded. Previous work has been ...
Sensory memory is the first step of a complex memorization process. Sensory information is buffered in a "sensory store" for a short period. Then part of it is transferred to working memory, where information can be actively processed and, eventually, thro ...
We investigate how nonlinearity and topological disorder affect the energy relaxation of local kicks in coarse-grained network models of proteins. We find that nonlinearity promotes long-range, coherent transfer of substantial energy to specific functional ...
Associative memory problem: Find the closest stored vector (in Hamming distance) to a given query vector. There are different ways to implement an associative memory, including the neural networks and DNA strands. Using neural networks, connection weights ...
We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernel-based Perceptron for storing the online hypothesis is not bounded. Previous work has been ...
Although the visual system can achieve a coarse classification of its inputs in a relatively short time, the synthesis of qualia-rich and detailed percepts can take substantially more time. If these prolonged computations were to take place in a retinotopi ...
The storage and short-term memory capacities of recurrent neural networks of spiking neurons are investigated. We demonstrate that it is possible to process online many superimposed streams of input. This is despite the fact that the stored information is ...
A nonlinear recurrent neural network is trained to synthesize chaotic signals. The identification process is reduced to a teaching phase and a linear regression. The influence of the shape of the nonlinearity in the neurons and the noise amplitude are stud ...