Responding to individual key-specific stimuli in entirely unfamiliar keying sequences is said to involve a reaction mode. With practice, short keying sequences can be executed in the chunking mode. This is indicated by the first stimulus sufficing for rapid execution of the entire sequence. The present study explored whether an associative mode develops also in participants who practice short k...

We prove that de Branges spaces of entire functions describe universality limits in the bulk for random matrices, in the unitary case. In particular, under mild conditions on a measure with compact support, we show that each possible universality limit is the reproducing kernel of a de Branges space of entire functions that equals a classical Paley-Wiener space. We also show that any such repro...

Computational genomics is a subfield of computational biology that deals with the analysis of entire genome sequences. Transcending the boundaries of classical sequence analysis, computational genomics exploits the inherent properties of entire genomes by modelling them as systems. We review recent developments in the field, discuss in some detail a number of novel approaches that take into acc...

The compactness theorem is proved for sequences of functions that have estimates the higher derivatives in each subdomain domain definition, divided into parts by a sequence some curves class W_2^1. At same time, entire determining summable derivatives, these do not have. These results allow us to make limit transitions using approximate solutions problems with an unknown boundary describe proc...

We propose a method for searching for symbol sequences in conversations. Symbol sequences can include phone numbers, credit card numbers, and any kind of ticket (identification) numbers and are often communicated in call center conversations. Automatic extraction of these from speech is a key to many automatic speech recognition (ASR) applications such as question answering and summarization. C...