Search results for "Memory."

Grip Force Adjustments Reflect Prediction of Dynamic Consequences in Varying Gravitoinertial Fields

2018

International audience; Humans have a remarkable ability to adjust the way they manipulate tools through a genuine regulation of grip force according to the task. However, rapid changes in the dynamical context may challenge this skill, as shown in many experimental approaches. Most experiments adopt perturbation paradigms that affect only one sensory modality. We hypothesize that very fast adaptation can occur if coherent information from multiple sensory modalities is provided to the central nervous system. Here, we test whether participants can switch between different and never experienced dynamical environments induced by centrifugation of the body. Seven participants lifted an object …

Parallel Algorithms for Listing Well-Formed Parentheses Strings

1998

We present two cost-optimal parallel algorithms generating the set of all well-formed parentheses strings of length 2n with constant delay for each generated string. In our first algorithm we generate in lexicographic order well-formed parentheses strings represented by bitstrings, and in the second one we use the representation by weight sequences. In both cases the computational model is based on an architecture CREW PRAM, where each processor performs the same algorithm simultaneously on a different set of data. Different processors can access the shared memory at the same time to read different data in the same or different memory locations, but no two processors are allowed to write i…

Il caso Sandarmoch. La Russia e la persecuzione della memoria

2022

Tożsamość śląska. Rzeczywistość czy XX-wieczna kreacja?

2016

Tożsamość śląska jest przedmiotem szeroko zakrojonych badań politologów, socjologów i historyków. W większości skupiają się oni na poszukiwaniu jej genezy. W niniejszym artykule autor zamierza spojrzeć na tożsamość jako na zjawisko podlegające głębokiej ewolucji na przestrzeni lat. Odnosząc się do przytoczonej hipotezy „Śląska wymyślonego” spróbuje dokonać próby klarownego podziału pomiędzy tym co stanowi historyczny trzon tożsamości śląskiej, a tym co w XX wieku zostało wpisane w śląski kod kulturowy.

Recognising a hand by grasp.

2000

The present study aimed to demonstrate that motor representations are used to recognise biological stimuli. In three experiments subjects were required to judge laterality of hands and forearms presented by pictures. The postures of the hands were those assumed when holding a small, medium and large sphere. In experiment 1, the sphere held in hand was presented, whereas in experiment 2 it was absent. In experiment 3, the same images, showing holding-a-sphere hands, as in experiment 1 were presented, but without forearm. In all experiments one finger of each hand could be absent. In experiment 1 recognition time was longer for those hand postures for which the corresponding grasping motor ac…

The time course of processing handwritten words: An ERP investigation

2021

Available online 25 June 2021. Behavioral studies have shown that the legibility of handwritten script hinders visual word recognition. Furthermore, when compared with printed words, lexical effects (e.g., word-frequency effect) are magnified for less intelligible (difficult) handwriting (Barnhart and Goldinger, 2010; Perea et al., 2016). This boost has been interpreted in terms of greater influence of top-down mechanisms during visual word recognition. In the present experiment, we registered the participants’ ERPs to uncover top-down processing effects on early perceptual encoding. Participants’ behavioral and EEG responses were recorded to high- and low-frequency words that varied in scr…

SYSTOLIC GENERATION OF k-ARY TREES

1999

The only parallel generating algorithms for k-ary trees are those of Akl and Stojmenović in 1996 and of Vajnovszki and Phillips in 1997. In the first of them, trees are represented by an inversion table and the processor model is a linear aray multicomputer. In the second, trees are represented by bitstrings and the algorithm executes on a shared memory multiprocessor. In this paper we give a parallel generating algorithm for k-ary trees represented by generalized P–sequences for execution on a linear array multicomputer.

European Banking Union and bank risk disclosure: the effects of the Single Supervisory Mechanism

2022

AbstractThis paper provides evidence on the impact of European Banking Union (BU) and the associated Single Supervisory Mechanism (SSM) on the risk disclosure practices of European banks. The onset of BU and the associated rules are considered as an exogenous shock that provides the setting for a natural experiment to analyze the effects of the new supervisory arrangements on bank risk disclosure practices. A Difference-in-Differences approach is adopted, building evidence from the disclosure practices of systemically important banks supervised by the European Central Bank (ECB) and other banks supervised by national regulators over the period 2012–2017. The main findings are that bank risk…

FADaC

2019

Solid state drives (SSDs) implement a log-structured write pattern, where obsolete data remains stored on flash pages until the flash translation layer (FTL) erases them. erase() operations, however, cannot erase a single page, but target entire flash blocks. Since these victim blocks typically store a mix of valid and obsolete pages, FTLs have to copy the valid data to a new block before issuing an erase() operation. This process therefore increases the latencies of concurrent I/Os and reduces the lifetime of flash memory. Data classification schemes identify data pages with similar update frequencies and group them together. FTLs can use this grouping to design garbage collection strategi…

Optimization of Application-Specific L1 Cache Translation Functions of the LEON3 Processor

2020

Reconfigurable caches offer an intriguing opportunity to tailor cache behavior to applications for better run-times and energy consumptions. While one may adapt structural cache parameters such as cache and block sizes, we adapt the memory-address-to-cache-index mapping function to the needs of an application. Using a LEON3 embedded multi-core processor with reconfigurable cache mappings, a metaheuristic search procedure, and Mibench applications, we show in this work how to accurately compare non-deterministic performances of applications and how to use this information to implement an optimization procedure that evolves application-specific cache mappings.