Interference Conditions of the Reconsolidation Process in Humans: The Role of Valence and Different Memory Systems

Following the presentation of a reminder, consolidated memories become reactivated followed by a process of re-stabilization, which is referred to as reconsolidation. The most common behavioral tool used to reveal this process is interference produced by new learning shortly after memory reactivation. Memory interference is defined as a decrease in memory retrieval, the effect is generated when new information impairs an acquired memory. In general, the target memory and the interference task used are the same. Here we investigated how different memory systems and/or their valence could produce memory reconsolidation interference. We showed that a reactivated neutral declarative memory could be interfered by new learning of a different neutral declarative memory. Then, we revealed that an aversive implicit memory could be interfered by the presentation of a reminder followed by a threatening social event. Finally, we showed that the reconsolidation of a neutral declarative memory is unaffected by the acquisition of an aversive implicit memory and conversely, this memory remains intact when the neutral declarative memory is used as interference. These results suggest that the interference of memory reconsolidation is effective when two task rely on the same memory system or both evoke negative valence.Fil: Fernández, Rodrigo Sebastián. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Fisiología, Biología Molecular y Neurociencias. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Fisiología, Biología Molecular y Neurociencias; ArgentinaFil: Bavassi, Mariana Luz. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Fisiología, Biología Molecular y Neurociencias. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Fisiología, Biología Molecular y Neurociencias; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Física; ArgentinaFil: Kaczer, Laura. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Fisiología, Biología Molecular y Neurociencias. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Fisiología, Biología Molecular y Neurociencias; ArgentinaFil: Forcato, Cecilia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Fisiología, Biología Molecular y Neurociencias. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Fisiología, Biología Molecular y Neurociencias; ArgentinaFil: Pedreira, Maria Eugenia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Fisiología, Biología Molecular y Neurociencias. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Fisiología, Biología Molecular y Neurociencias; Argentin

High-level Cryptographic Abstractions

The interfaces exposed by commonly used cryptographic libraries are clumsy, complicated, and assume an understanding of cryptographic algorithms. The challenge is to design high-level abstractions that require minimum knowledge and effort to use while also allowing maximum control when needed. This paper proposes such high-level abstractions consisting of simple cryptographic primitives and full declarative configuration. These abstractions can be implemented on top of any cryptographic library in any language. We have implemented these abstractions in Python, and used them to write a wide variety of well-known security protocols, including Signal, Kerberos, and TLS. We show that programs using our abstractions are much smaller and easier to write than using low-level libraries, where size of security protocols implemented is reduced by about a third on average. We show our implementation incurs a small overhead, less than 5 microseconds for shared key operations and less than 341 microseconds (< 1%) for public key operations. We also show our abstractions are safe against main types of cryptographic misuse reported in the literature

Autonomous power system intelligent diagnosis and control

The Autonomous Power System (APS) project at NASA Lewis Research Center is designed to demonstrate the abilities of integrated intelligent diagnosis, control, and scheduling techniques to space power distribution hardware. Knowledge-based software provides a robust method of control for highly complex space-based power systems that conventional methods do not allow. The project consists of three elements: the Autonomous Power Expert System (APEX) for fault diagnosis and control, the Autonomous Intelligent Power Scheduler (AIPS) to determine system configuration, and power hardware (Brassboard) to simulate a space based power system. The operation of the Autonomous Power System as a whole is described and the responsibilities of the three elements - APEX, AIPS, and Brassboard - are characterized. A discussion of the methodologies used in each element is provided. Future plans are discussed for the growth of the Autonomous Power System

Refinement for Transition Systems with Responses

Motivated by the response pattern for property specifications and applications within flexible workflow management systems, we report upon an initial study of modal and mixed transition systems in which the must transitions are interpreted as must eventually, and in which implementations can contain may behaviors that are resolved at run-time. We propose Transition Systems with Responses (TSRs) as a suitable model for this study. We prove that TSRs correspond to a restricted class of mixed transition systems, which we refer to as the action-deterministic mixed transition systems. We show that TSRs allow for a natural definition of deadlocked and accepting states. We then transfer the standard definition of refinement for mixed transition systems to TSRs and prove that refinement does not preserve deadlock freedom. This leads to the proposal of safe refinements, which are those that preserve deadlock freedom. We exemplify the use of TSRs and (safe) refinements on a small medication workflow.Comment: In Proceedings FIT 2012, arXiv:1207.348

Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis

The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure and hence conclude the decidability of the safety problem. Although backward reachability is property-directed, it can unnecessarily explore (large) portions of the state space of a system which are not required to verify the safety property under consideration. To avoid this, invariants can be used to dramatically prune the search space. Indeed, the problem is to guess such appropriate invariants. In this paper, we present a fully declarative and symbolic approach to the mechanization of backward reachability of infinite state systems manipulating arrays by Satisfiability Modulo Theories solving. Theories are used to specify the topology and the data manipulated by the system. We identify sufficient conditions on the theories to ensure the termination of backward reachability and we show the completeness of a method for invariant synthesis (obtained as the dual of backward reachability), again, under suitable hypotheses on the theories. We also present a pragmatic approach to interleave invariant synthesis and backward reachability so that a fix-point for the set of backward reachable states is more easily obtained. Finally, we discuss heuristics that allow us to derive an implementation of the techniques in the model checker MCMT, showing remarkable speed-ups on a significant set of safety problems extracted from a variety of sources.Comment: Accepted for publication in Logical Methods in Computer Scienc

The Ecce and Logen Partial Evaluators and their Web Interfaces

We present Ecce and Logen, two partial evaluators for Prolog using the online and offline approach respectively. We briefly present the foundations of these tools and discuss various applications. We also present new implementations of these tools, carried out in Ciao Prolog. In addition to a command-line interface new user-friendly web interfaces were developed. These enable non-expert users to specialise logic programs using a web browser, without the need for a local installation

PLACES'10: The 3rd Workshop on Programmng Language Approaches to concurrency and Communication-Centric Software

Paphos, Cyprus. March 201

Towards a Rule Interchange Language for the Web

This articles discusses rule languages that are needed for a a full deployment of the SemanticWeb. First, it motivates the need for such languages. Then, it presents ten theses addressing (1) the rule and/or logic languages needed on the Web, (2) data and data processing, (3) semantics, and (4) engineering and rendering issues. Finally, it discusses two options that might be chosen in designing a Rule Interchange Format for the Web