Software aging and multifractality of memory resources

2004 ◽  
Author(s):  
M. Shereshevsky ◽  
J. Crowell ◽  
B. Cukic ◽  
V. Gandikota ◽  
Yan Liu
Keyword(s):  
Software Aging ◽  
Memory Resources

Visual Search Facilitation in Repeated Displays Depends on Visuospatial Working Memory

2012 ◽  
Vol 59 (1) ◽  
pp. 47-54 ◽  
Author(s):  
Angela A. Manginelli ◽  
Franziska Geringswald ◽  
Stefan Pollmann
Keyword(s):  
Working Memory ◽  
Visual Search ◽  
Control Experiment ◽  
Memory Load ◽  
Contextual Cueing ◽  
Long Term Memory ◽  
Visuospatial Working Memory ◽  
Working Memory Load ◽  
Memory Resources

When distractor configurations are repeated over time, visual search becomes more efficient, even if participants are unaware of the repetition. This contextual cueing is a form of incidental, implicit learning. One might therefore expect that contextual cueing does not (or only minimally) rely on working memory resources. This, however, is debated in the literature. We investigated contextual cueing under either a visuospatial or a nonspatial (color) visual working memory load. We found that contextual cueing was disrupted by the concurrent visuospatial, but not by the color working memory load. A control experiment ruled out that unspecific attentional factors of the dual-task situation disrupted contextual cueing. Visuospatial working memory may be needed to match current display items with long-term memory traces of previously learned displays.

Working Memory Capacity and a Notorious Brain Teaser

2006 ◽  
Vol 53 (2) ◽  
pp. 123-131 ◽  
Author(s):  
Wim De Neys ◽  
Niki Verschueren
Keyword(s):  
Working Memory ◽  
Secondary Task ◽  
Working Memory Capacity ◽  
Memory Capacity ◽  
Task Load ◽  
Normative Reasoning ◽  
Monty Hall Dilemma ◽  
Monty Hall ◽  
Memory Resources

Abstract. The Monty Hall Dilemma (MHD) is an intriguing example of the discrepancy between people’s intuitions and normative reasoning. This study examines whether the notorious difficulty of the MHD is associated with limitations in working memory resources. Experiment 1 and 2 examined the link between MHD reasoning and working memory capacity. Experiment 3 tested the role of working memory experimentally by burdening the executive resources with a secondary task. Results showed that participants who solved the MHD correctly had a significantly higher working memory capacity than erroneous responders. Correct responding also decreased under secondary task load. Findings indicate that working memory capacity plays a key role in overcoming salient intuitions and selecting the correct switching response during MHD reasoning.

scholarly journals Arithmetic Word Problems Revisited: Cognitive Processes and Academic Performance in Secondary School

2021 ◽  
Vol 11 (4) ◽  
pp. 155
Author(s):  
Gonzalo Duque de Blas ◽  
Isabel Gómez-Veiga ◽  
Juan A. García-Madruga
Keyword(s):  
Academic Performance ◽  
Word Problems ◽  
Spatial Reasoning ◽  
Deductive Reasoning ◽  
Executive Processes ◽  
Mathematical Operation ◽  
Visual Spatial ◽  
And Mathematics ◽  
The One ◽  
Memory Resources

Solving arithmetic word problems is a complex task that requires individuals to activate their working memory resources, as well as the correct performance of the underlying executive processes involved in order to inhibit semantic biases or superficial responses caused by the problem’s statement. This paper describes a study carried out with 135 students of Secondary Obligatory Education, each of whom solved 5 verbal arithmetic problems: 2 consistent problems, whose mathematical operation (add/subtract) and the verbal statement of the problem coincide, and 3 inconsistent problems, whose required operation is the inverse of the one suggested by the verbal term(s). Measures of reading comprehension, visual–spatial reasoning and deductive reasoning were also obtained. The results show the relationship between arithmetic problems and cognitive measures, as well as the ability of these problems to predict academic performance. Regression analyses confirmed that arithmetic word problems were the only measure with significant power of association with academic achievement in both History/Geography (β = 0.25) and Mathematics (β = 0.23).

scholarly journals Linear capabilities for fully abstract compilation of separation-logic-verified code

2021 ◽  
Vol 31 ◽  
Author(s):  
THOMAS VAN STRYDONCK ◽  
FRANK PIESSENS ◽  
DOMINIQUE DEVRIESE
Keyword(s):  
Spatial Separation ◽  
Separation Logic ◽  
Target Language ◽  
Fine Grained ◽  
Dynamic Contract ◽  
Modular Verification ◽  
Source Program ◽  
Memory Accesses ◽  
Memory Resources ◽  
Efficient Memory

Abstract Separation logic is a powerful program logic for the static modular verification of imperative programs. However, dynamic checking of separation logic contracts on the boundaries between verified and untrusted modules is hard because it requires one to enforce (among other things) that outcalls from a verified to an untrusted module do not access memory resources currently owned by the verified module. This paper proposes an approach to dynamic contract checking by relying on support for capabilities, a well-studied form of unforgeable memory pointers that enables fine-grained, efficient memory access control. More specifically, we rely on a form of capabilities called linear capabilities for which the hardware enforces that they cannot be copied. We formalize our approach as a fully abstract compiler from a statically verified source language to an unverified target language with support for linear capabilities. The key insight behind our compiler is that memory resources described by spatial separation logic predicates can be represented at run time by linear capabilities. The compiler is separation-logic-proof-directed: it uses the separation logic proof of the source program to determine how memory accesses in the source program should be compiled to linear capability accesses in the target program. The full abstraction property of the compiler essentially guarantees that compiled verified modules can interact with untrusted target language modules as if they were compiled from verified code as well. This article is an extended version of one that was presented at ICFP 2019 (Van Strydonck et al., 2019).

scholarly journals Lightweight Blockchain Processing. Case Study: Scanned Document Tracking on Tezos Blockchain

2021 ◽  
Vol 11 (15) ◽  
pp. 7169
Author(s):  
Mohamed Allouche ◽  
Tarek Frikha ◽  
Mihai Mitrea ◽  
Gérard Memmi ◽  
Faten Chaabane
Keyword(s):  
Load Balancing ◽  
Relative Error ◽  
Execution Time ◽  
General Purpose ◽  
Experimental Results ◽  
Raspberry Pi ◽  
Embedded Platform ◽  
Memory Resources ◽  
Processing Solution

To bridge the current gap between the Blockchain expectancies and their intensive computation constraints, the present paper advances a lightweight processing solution, based on a load-balancing architecture, compatible with the lightweight/embedding processing paradigms. In this way, the execution of complex operations is securely delegated to an off-chain general-purpose computing machine while the intimate Blockchain operations are kept on-chain. The illustrations correspond to an on-chain Tezos configuration and to a multiprocessor ARM embedded platform (integrated into a Raspberry Pi). The performances are assessed in terms of security, execution time, and CPU consumption when achieving a visual document fingerprint task. It is thus demonstrated that the advanced solution makes it possible for a computing intensive application to be deployed under severely constrained computation and memory resources, as set by a Raspberry Pi 3. The experimental results show that up to nine Tezos nodes can be deployed on a single Raspberry Pi 3 and that the limitation is not derived from the memory but from the computation resources. The execution time with a limited number of fingerprints is 40% higher than using a classical PC solution (value computed with 95% relative error lower than 5%).

Sign in / Sign up

Export Citation Format

Share Document