Code Memory Research Articles

A universal hippocampal memory code across animals and environments.

How learning is affected by context is a fundamental question of neuroscience, as the ability to generalize learning to different contexts is necessary for navigating the world. An example of swift contextual generalization is observed in conditioning tasks, where performance is quickly generalized from one context to another. A key question in identifying the neural substrate underlying this ability is how the hippocampus (HPC) represents task-related stimuli across different environments, given that HPC cells exhibit place-specific activity that changes across contexts (remapping). In this study, we used calcium imaging to monitor hippocampal neuron activity as animals performed a conditioning task across multiple spatial contexts. We investigated whether hippocampal cells, which encode both spatial locations (place cells) and task-related information, could maintain their task representation even when their spatial encoding remapped in a new spatial context. To assess the consistency of task representations, we used advanced dimensionality reduction techniques combined with machine learning to develop manifold representations of population level HPC activity. The results showed that task-related neural representations remained stable even as place cell representations of spatial context changed, thus demonstrating similar embedding geometries of neural representations of the task across different spatial contexts. Notably, these patterns were not only consistent within the same animal across different contexts but also significantly similar across different animals, suggesting a standardized neural encoding or 'neural syntax' in the hippocampus. These findings bridge a critical gap between memory and navigation research, revealing how the hippocampus maintains cognitive consistency across different spatial environments. These findings also suggest that hippocampal function is governed by a neural framework shared between animals, an observation that may have broad implications for understanding memory, learning, and related cognitive processes. Looking ahead, this work opens new avenues for exploring the fundamental principles underlying hippocampal encoding strategies.

Optimization of Decoder Priors for Accurate Quantum Error Correction.

Accurate decoding of quantum error-correcting codes is a crucial ingredient in protecting quantum information from decoherence. It requires characterizing the error channels corrupting the logical quantum state and providing this information as a prior to the decoder. We introduce a reinforcement learning inspired method for calibrating these priors that aims to minimize the logical error rate. Our method significantly improves the decoding accuracy in repetition and surface code memory experiments executed on Google's Sycamore processor, outperforming the leading decoder-agnostic method by 16% and 3.3%, respectively. This calibration approach will serve as an important tool for maximizing the performance of both near-term and future error-corrected quantum devices.

Enhancing Linux System Security: A Kernel-Based Approach to Fileless Malware Detection and Mitigation

In the late 20th century, computer viruses emerged as powerful malware that resides permanently in target hosts. For a virus to function, it must load into memory from persistent storage, such as a file on a hard drive. Due to the significant destructive potential of viruses, numerous defense measures have been developed to protect computer systems. Among these, antivirus software is one of the most recognized and widely used. Typically, antivirus solutions rely on static analysis (signature-based) technologies to detect infections in files stored on permanent storage devices, such as hard drives or USB (Universal Serial Bus) flash drives. However, a new breed of malware, fileless malware, has been designed to evade detection and enhance durability. Fileless malware resides solely in the memory of the target hosts, circumventing traditional antivirus software, which cannot access or analyze processes executed directly from memory. This study proposes the Check-on-Execution (CoE) kernel-based approach to detect fileless malware on Linux systems. CoE intervenes by suspending code execution before a program executes code from a process’s writable and executable memory area. To prevent the execution of fileless malware, CoE extracts the code from memory, packages it with an ELF (Executable and Linkable Format) header to create an ELF file, and uses VirusTotal for analysis. Experimental results demonstrate that CoE significantly enhances a Linux system’s ability to defend against fileless malware. Additionally, CoE effectively protects against shell code injection attacks, including buffer and memory overflows, and can handle packed malware. However, it is important to note that this study focuses exclusively on fileless malware, and further research is needed to address other types of malware.

Shared neural codes of recognition memory

Recognition memory research has identified several electrophysiological indicators of successful memory retrieval, known as old-new effects. These effects have been observed in different sensory domains using various stimulus types, but little attention has been given to their similarity or distinctiveness and the underlying processes they may share. Here, a data-driven approach was taken to investigate the temporal evolution of shared information content between different memory conditions using openly available EEG data from healthy human participants of both sexes, taken from six experiments. A test dataset involving personally highly familiar and unfamiliar faces was used. The results show that neural signals of recognition memory for face stimuli were highly generalized starting from around 200 ms following stimulus onset. When training was performed on non-face datasets, an early (around 200–300 ms) to late (post-400 ms) differentiation was observed over most regions of interest. Successful cross-classification for non-face stimuli (music and object/scene associations) was most pronounced in late period. Additionally, a striking dissociation was observed between familiar and remembered objects, with shared signals present only in the late window for correctly remembered objects, while cross-classification for familiar objects was successful in the early period as well. These findings suggest that late neural signals of memory retrieval generalize across sensory modalities and stimulus types, and the dissociation between familiar and remembered objects may provide insight into the underlying processes.

Clustering-Based Dual-Population Co-Evolutionary Algorithm for 2D Segmentation Coding in NAND Flash Memory

Clustering-Based Dual-Population Co-Evolutionary Algorithm for 2D Segmentation Coding in NAND Flash Memory

Conditional knockout of Shank3 in the ventral CA1 by quantitative in vivo genome-editing impairs social memory in mice

Individuals with autism spectrum disorder (ASD) have a higher prevalence of social memory impairment. A series of our previous studies revealed that hippocampal ventral CA1 (vCA1) neurons possess social memory engram and that the neurophysiological representation of social memory in the vCA1 neurons is disrupted in ASD-associated Shank3 knockout mice. However, whether the dysfunction of Shank3 in vCA1 causes the social memory impairment observed in ASD remains unclear. In this study, we found that vCA1-specific Shank3 conditional knockout (cKO) by the adeno-associated virus (AAV)- or specialized extracellular vesicle (EV)- mediated in vivo gene editing was sufficient to recapitulate the social memory impairment in male mice. Furthermore, the utilization of EV-mediated Shank3-cKO allowed us to quantitatively examine the role of Shank3 in social memory. Our results suggested that there is a certain threshold for the proportion of Shank3-cKO neurons required for social memory disruption. Thus, our study provides insight into the population coding of social memory in vCA1, as well as the pathological mechanisms underlying social memory impairment in ASD.

A combinatorial neural code for long-term motor memory.

Motor skill repertoire can be stably retained over long periods, but the neural mechanism underlying stable memory storage remains poorly understood. Moreover, it is unknown how existing motor memories are maintained as new motor skills are continuously acquired. Here we tracked neural representation of learned actions throughout a significant portion of a mouse's lifespan, and we show that learned actions are stably retained in motor memory in combination with context, which protects existing memories from erasure during new motor learning. We used automated home-cage training to establish a continual learning paradigm in which mice learned to perform directional licking in different task contexts. We combined this paradigm with chronic two-photon imaging of motor cortex activity for up to 6 months. Within the same task context, activity driving directional licking was stable over time with little representational drift. When learning new task contexts, new preparatory activity emerged to drive the same licking actions. Learning created parallel new motor memories while retaining the previous memories. Re-learning to make the same actions in the previous task context re-activated the previous preparatory activity, even months later. At the same time, continual learning of new task contexts kept creating new preparatory activity patterns. Context-specific memories, as we observed in the motor system, may provide a solution for stable memory storage throughout continual learning. Learning in new contexts produces parallel new representations instead of modifying existing representations, thus protecting existing motor repertoire from erasure.

DMMC: A Polar Code Construction Method for Improving Performance in TLC NAND Flash

3D TLC NAND flash memory significantly increases the storage capacity but makes data more prone to errors. To address the reliability problem, Polar Code is one coding method that can reach the channel capacity1. However, the 3D NAND flash memory channel is uncertain due to the variation of retention time and program/erase(P/E) cycle. So it is difficult to construct Polar Code in NAND flash memory. This paper proposes a new Polar Code construction method called Dynamic Merge Monte Carlo(DMMC). DMMC uses the Monte Carlo method to obtain the optimal Polar Code construction and then reduces the space overhead by combining similar construction so that it can be used in flash memory systems. Compared with the conventional method, the uncorrectable bit error rate(UBER) of the proposed method can reduce by up to 90.5%, and the read latency can reduce by more than 50%.

Temporal multiplexing of perception and memory codes in IT cortex

A central assumption of neuroscience is that long-term memories are represented by the same brain areas that encode sensory stimuli1. Neurons in inferotemporal (IT) cortex represent the sensory percept of visual objects using a distributed axis code2–4. Whether and how the same IT neural population represents the long-term memory of visual objects remains unclear. Here we examined how familiar faces are encoded in the IT anterior medial face patch (AM), perirhinal face patch (PR) and temporal pole face patch (TP). In AM and PR we observed that the encoding axis for familiar faces is rotated relative to that for unfamiliar faces at long latency; in TP this memory-related rotation was much weaker. Contrary to previous claims, the relative response magnitude to familiar versus unfamiliar faces was not a stable indicator of familiarity in any patch5–11. The mechanism underlying the memory-related axis change is likely intrinsic to IT cortex, because inactivation of PR did not affect axis change dynamics in AM. Overall, our results suggest that memories of familiar faces are represented in AM and perirhinal cortex by a distinct long-latency code, explaining how the same cell population can encode both the percept and memory of faces.

Design of Universal Code Generator for Multi-Constellation Multi-Frequency GNSS Receiver

A multi-constellation, multi-frequency Global Navigation Satellite System (GNSS) receiver is capable of simultaneously receiving signals from multiple satellite constellations across various frequency bands. This allows for increased observations, thereby enhancing navigation accuracy, continuity, effectiveness, and reliability. The spread spectrum code structures used in satellite navigation signals differ among systems. Compatible code generators are employed in multi-constellation, multi-frequency GNSS receivers to support tasks such as signal acquisition and tracking. There are three main types of spread spectrum code structures: Linear Feedback Shift Register (LFSR), Legendre sequences, and Memory codes. The Indian Regional Navigation Satellite System (IRNSS) released the L1-SPS (Standard Positioning Service) signal format in August 2023, which utilizes the Interleaved Z4-linear ranging code (IZ4 code) as its spread spectrum code. Currently, there is no universal code generator design compatible with the IZ4 code. In this paper, a proposed universal code generator is based on the hardware structure of the IRNSS IZ4 code generator. It achieves compatibility with all LFSR-based spread spectrum codes and enables parallel generation of multiple sets of GNSS signal spread spectrum codes, thereby improving hardware utilization efficiency. The proposed structure is implemented and validated using FPGA design, and resource consumption is provided as part of the validation results.

Secure Multiparty Computation Using Secure Virtual Machines

The development of new processor capabilities which enable hardware-based memory encryption, capable of isolating and encrypting application code and data in memory, have led to the rise of confidential computing techniques that protect data when processed on untrusted computing resources (e.g., cloud). Before confidential computing technologies, applications that needed data-in-use protection, like outsourced or secure multiparty computation, used purely cryptographic techniques, which had a large negative impact on the processing performance. Processing data in trusted enclaves protected by confidential computing technologies promises to protect data-in-use while possessing a negligible performance penalty. In this paper, we have analyzed the state-of-the-art in the field of confidential computing and present a Confidential Computing System for Artificial Intelligence (CoCoS.ai), a system for secure multiparty computation, which uses virtual machine-based trusted execution environments (in this case, AMD Secure Encrypted Virtualization (SEV)). The security of the proposed solution, as well as its performance, have been formally analyzed and measured. The paper reveals many gaps not reported previously that still exist in the current confidential computing solutions for the secure multiparty computation use case, especially in the processes of creating new secure virtual machines and their attestation, which are tailored for single-user use cases.

Working memory signals in early visual cortex are present in weak and strong imagers.

It has been suggested that visual images are memorized across brief periods of time by vividly imagining them as if they were still there. In line with this, the contents of both working memory and visual imagery are known to be encoded already in early visual cortex. If these signals in early visual areas were indeed to reflect a combined imagery and memory code, one would predict them to be weaker for individuals with reduced visual imagery vividness. Here, we systematically investigated this question in two groups of participants. Strong and weak imagers were asked to remember images across brief delay periods. We were able to reliably reconstruct the memorized stimuli from early visual cortex during the delay. Importantly, in contrast to the prediction, the quality of reconstruction was equally accurate for both strong and weak imagers. The decodable information also closely reflected behavioral precision in both groups, suggesting it could contribute to behavioral performance, even in the extreme case of completely aphantasic individuals. Our data thus suggest that working memory signals in early visual cortex can be present even in the (near) absence of phenomenal imagery.

Programming with ChatGPT: How far can we go?

Artificial intelligence (AI) has made remarkable strides, giving rise to the development of large language models such as ChatGPT. The chatbot has garnered significant attention from academia, industry, and the general public, marking the beginning of a new era in AI applications. This work explores how well ChatGPT can write source code. To this end, we performed a series of experiments to assess the extent to which ChatGPT is capable of solving general programming problems. Our objective is to assess ChatGPT’s capabilities in two different programming languages, namely C++ and Java, by providing it with a set of programming problem, encompassing various types and difficulty levels. We focus on evaluating ChatGPT’s performance in terms of code correctness, run-time efficiency, and memory usage. The experimental results show that, while ChatGPT is good at solving easy and medium programming problems written in C++ and Java, it encounters some difficulties with more complicated tasks in the two languages. Compared to code written by humans, the one generated by ChatGPT is of lower quality, with respect to runtime and memory usage.

Behavioral fluctuation reflecting theta-rhythmic activation of sequential working memory

Sequential working memory, the ability to actively maintain sequential information, is essential for human cognition. The neural representation of each item in sequential working memory is thought to be activated rhythmically within the theta (3–7 Hz) range of human electrophysiology. In the current study, we predicted that if neural representations of sequential working memory items were truly activated rhythmically, periodic fluctuations in behavior would be evident. That is, the ease and speed of recalling each memory item would oscillate depending on the interval between memory encoding and recall, affected by the rhythmic neural representation. We conducted detailed analyses of reaction times for retrieving sequential and non-sequential information in eight experiments (total n = 125). The results revealed that reaction times for recalling sequential information showed fluctuation in the theta range as a function of the interval between memory encoding and recall, which was significantly stronger than that observed when the task did not require participants to remember the sequential order. Taken together, the current findings revealed that participants’ behavior exhibited theta-rhythmic fluctuation when recalling sequential information in a relatively large sample, supporting theta phase-dependent coding of sequential working memory.

Cell type-specific connectome predicts distributed working memory activity in the mouse brain.

Recent advances in connectomics and neurophysiology make it possible to probe whole-brain mechanisms of cognition and behavior. We developed a large-scale model of the multiregional mouse brain for a cardinal cognitive function called working memory, the brain's ability to internally hold and process information without sensory input. The model is built on mesoscopic connectome data for interareal cortical connections and endowed with a macroscopic gradient of measured parvalbumin-expressing interneuron density. We found that working memory coding is distributed yet exhibits modularity; the spatial pattern of mnemonic representation is determined by long-range cell type-specific targeting and density of cell classes. Cell type-specific graph measures predict the activity patterns and a core subnetwork for memory maintenance. The model shows numerous attractor states, which are self-sustained internal states (each engaging a distinct subset of areas). This work provides a framework to interpret large-scale recordings of brain activity during cognition, while highlighting the need for cell type-specific connectomics.

Altered EEG Theta and Alpha Band Functional Connectivity in Mild Cognitive Impairment During Working Memory Coding.

Individuals with mild cognitive impairment (MCI), the preclinical stage of Alzheimer disease (AD), suffer decline in their visual working memory (WM) functions. Using large-scale network analysis of electroencephalography (EEG), the current study intended to investigate if there are differences in functional connectivity properties extracted during visual WM coding stages between MCI patients and normal controls (NC). A total of 21 MCI patients and 20 NC performed visual memory tasks of load four, while 32-channel EEG recordings were acquired. The functional connectivity properties were extracted from the acquired EEGs by the directed transform function (DTF) via spectral Granger causal analysis. Brain network analyses revealed distinctive brain network patterns between the two groups during the WM coding stage. Compared with the NC, MCI patients exhibited a reduced visual network connectivity of the frontal-temporal in θ (4-7Hz) band. A likely compensation mechanism was observed in MCI patients, with a strong brain functional connectivity of the frontal-occipital and parietal-occipital in both θ and α (8-13Hz) band. Further analyses of the network core node properties based on the differential brain network showed that, in θ band, there was a significant difference in the out-degree of the frontal lobe and parietal lobe between the two groups, while in α band, such difference was located only in the parietal lobe. The current study found that, in MCI patients, dysconnectivity is found from the prefrontal lobe to bilateral temporal lobes, leading to increased recruitment of functional connectivity in the frontal-occipital and parietal-occipital direction. The dysconnectivity pattern of MCI is more complex and primarily driven by core nodes Pz and Fz. These results significantly expanded previous knowledge of MCI patients' EEG dynamics during WM tasks and provide new insights into the underpinning neural mechanism MCI. It further provided a potential therapeutic target for clinical interventions of the condition.

Convolutional Codes with Optimum Bidirectional Distance Profile

We define the bidirectional distance profile (BDP) of a convolutional code as the minimum of the distance profiles of the code and its corresponding “reverse” code. We present tables of codes with the optimum BDP (OBDP), which minimize the average complexity of bidirectional sequential decoding algorithms. The computer search is accelerated by the facts that optimum distance profile (ODP) codes of larger memory must have ODP codes of smaller memory as their “prefixes”, and that OBDP codes can be obtained by “concatenating” ODP and reverse ODP codes of smaller memory. We compare the performance of OBDP codes and other codes by simulation.

Custom administering attention module for segmentation of magnetic resonance imaging of the brain

<span>Taking into account how brain tumors and gliomas are notorious forms of cancer, the medical field has found several methods to diagnose these diseases, with many algorithms that can segment out the cancer cells in the magnetic resonance imaging (MRI) scans of the brain. This paper has proposed a similar segmenting algorithm called a custom administering attention module. This solution uses a custom U-Net model along with a custom administering attention module that uses an attention mechanism to classify and segment the glioma cells using long-range dependency of the feature maps. The customizations lead to a reduction in code complexity and memory cost. The final model has been tested on the BraTS 2019 dataset and has been compared with other state-of-the-art methods for displaying how much better the proposed model has performed in the category of enhancing, non-enhancing and peritumoral gliomas.</span>

Lateral and medial telencephalic pallium lesions impair spatial memory in goldfish

Fish, like many other animals, navigate to ensure survival. While the telencephalon region of the teleost fish brain is believed to play a critical role in navigation, lesion and electrophysiology studies differ as to whether navigation is situated in the lateral pallium or the medial pallium. To address this inconsistency, we replicated combined behavioral and lesion studies in the goldfish. Goldfish were trained in two navigation tasks testing allocentric navigation on a horizontal plus-maze and a horizontal breadboard to get a reward. The fish were divided randomly into lateral pallium lesion, medial pallium lesion, and sham groups and retested for their success rates. The lateral lesion group had a significant decrease of success on the breadboard task but not on the plus-maze task, whereas the medial lesion affected both tasks significantly. These results suggest that both the medial and lateral pallium are essential for the coding of spatial memory and challenge the assumption that one distinct region of the pallium is involved in spatial memory in teleost.

Securing Name Resolution in the IoT: DNS over CoAP

In this paper, we present the design, implementation, and analysis of DNS over CoAP~(DoC), a new proposal for secure and privacy-friendly name resolution of constrained IoT devices. We implement different design choices of DoC in RIOT, an open-source operating system for the IoT, evaluate performance measures in a testbed, compare with DNS over UDP and DNS over DTLS, and validate our protocol design based on empirical DNS IoT data. Our findings indicate that plain DoC is on par with common DNS solutions for the constrained IoT but significantly outperforms when additional standard features of CoAP are used such as caching. With OSCORE, we can save more than 10 kBytes of code memory compared to DTLS, when a CoAP application is already present, and retain the end-to-end trust chain with intermediate proxies, while leveraging features such as group communication or encrypted en-route caching. We also discuss a compression scheme for very restricted links that reduces data by up to 70%.