Searcharxiv⌕ Search

arXiv subjects

Mengying Guo

Publications and source records attributed to Mengying Guo.

14 recordsLinked to original sources
arXiv2026

Integrated magnonic neural circuits based on nonlinear wave neurons

Artificial intelligence is driving intense interest in alternative computing hardware capable of neural information processing beyond conventional charge-based electronics. Among emerging approaches, wave-based computing promises highly parallel and energy-efficient operation, but scalable physical neural hardware has remained elusive because wave systems generally lack cascadable nonlinear neurons with signal regeneration and phase-robust operation. Here we demonstrate integrated magnonic neural circuits based on nonlinear threshold neurons realized in nanoscale yttrium iron garnet waveguides. The neurons perform weighted summation of multiple spin-wave inputs, while a pump-controlled nonlinear activation defines continuously tunable firing thresholds. Owing to deeply nonlinear spin-wave dynamics, the activated neurons emit self-normalized outputs whose intensities are largely independent of the input amplitudes, while nonlinear phase self-adjustment suppresses sensitivity to the relative input phases, enabling deterministic neuron-to-neuron cascading without external signal restoration. We experimentally realize programmable threshold neurons, reconfigurable weighted classification and deterministic cascading between sequential neuronal stages, and further demonstrate reconfigurable physical pattern recognition in a seven-neuron integrated magnonic circuit through experimental classification of the binary letter patterns 'HUST'. These results establish nonlinear magnons as a scalable platform for integrated neural hardware and position nonlinear wave dynamics as a general paradigm for physical neuromorphic computing.

cond-mat.mtrl-sci↗
arXiv2026

True random number generation through stochastic magnonic bistability

True random number generators (TRNGs) underpin modern cryptography, yet existing implementations face fundamental trade-offs between speed, scalability, and entropy quality. Here, we demonstrate that stochastic switching in the bistable regime of spin-wave dynamics provides a physical entropy source for high-quality random number generation. Our magnonic random number generator (mRNG), based on a lithography-patterned microstrip on yttrium iron garnet (YIG), exploits thermal fluctuations near the nonlinear bistable regime to generate random bitstreams that pass all 15 NIST SP 800-22 statistical tests at rates with 20 Mb/s. We implement a random-bit multiplier using synchronized mRNG units and demonstrate scalability to 200-nm-wide nanoscale waveguides, establishing spin-wave bistability as a viable physical entropy source for integrated random number generation.

cond-mat.mtrl-sci↗
arXiv2026

Polarization-resolved measurement of forward volume spin waves by micro-focused Brillouin light scattering

We show how the micro-focused BLS signal of forward volume spin waves is formed and why it remains observable despite symmetry-based "suppression" expectations. A reciprocity-theorem based model with vectorial diffraction-limited focusing identifies the nonnegligible longitudinal focal-field component as the key element responsible for BLS sensitivity in the forward volume geometry. We further demonstrate that full polarization analysis, implemented through polarizer-analyzer maps of coherently excited spin waves, provides information beyond the conventional crossed polarizer-analyzer readout. In a BiYIG thin film, the measured maps exhibit Stokes/anti-Stokes polarization asymmetries and nontrivial patterns that stem from quadratic magneto-optical coupling terms. Fitting the data with a model including Voigt and Cotton-Mouton contributions yields an effective Cotton-Mouton constant and shows that the quadratic response is comparable to the linear Voigt contribution.

cond-mat.mes-hall↗
arXiv2026

Scene-Aware Memory Discrimination: Deciding Which Personal Knowledge Stays

Intelligent devices have become deeply integrated into everyday life, generating vast amounts of user interactions that form valuable personal knowledge. Efficient organization of this knowledge in user memory is essential for enabling personalized applications. However, current research on memory writing, management, and reading using large language models (LLMs) faces challenges in filtering irrelevant information and in dealing with rising computational costs. Inspired by the concept of selective attention in the human brain, we introduce a memory discrimination task. To address large-scale interactions and diverse memory standards in this task, we propose a Scene-Aware Memory Discrimination method (SAMD), which comprises two key components: the Gating Unit Module (GUM) and the Cluster Prompting Module (CPM). GUM enhances processing efficiency by filtering out non-memorable interactions and focusing on the salient content most relevant to application demands. CPM establishes adaptive memory standards, guiding LLMs to discern what information should be remembered or discarded. It also analyzes the relationship between user intents and memory contexts to build effective clustering prompts. Comprehensive direct and indirect evaluations demonstrate the effectiveness and generalization of our approach. We independently assess the performance of memory discrimination, showing that SAMD successfully recalls the majority of memorable data and remains robust in dynamic scenarios. Furthermore, when integrated into personalized applications, SAMD significantly enhances both the efficiency and quality of memory construction, leading to better organization of personal knowledge.

cs.CL↗
arXiv2026

Stimulated Magnonic Frequency Combs

Magnonic frequency combs, characterized by a series of discrete frequency lines, have emerged as a promising frontier in magnon spintronics, with potential applications in advanced information processing and sensing technologies. Although the three-magnon scattering process is widely recognized as a fundamental mechanism for generating these combs, its experimental realization has remained challenging due to the high threshold power and strict conservation of momentum and energy. In this work, we propose a novel mechanism for the stimulated generation of magnonic frequency combs that overcomes these limitations. Our approach offers precise and efficient control over key comb properties, including spacing between spectral lines and the number of lines, marking a significant advancement in the field. We substantiate this mechanism through a robust combination of theoretical modeling, micromagnetic simulations, and experimental validation. This study not only demonstrates the feasibility of our method but also opens new pathways for integrating magnonic frequency combs into practical spintronic devices.

cond-mat.mes-hall↗
arXiv2026

Integrated magnonic chip using cascaded logic

The transistor transformed not only electronics but everyday life, and the integrated circuit - now simply the "chip" - made computation scalable and ubiquitous. Magnonics has long promised a parallel path to low-energy information processing by using spin waves instead of charge. Progress, however, has been limited by two fundamental obstacles: intrinsic attenuation of spin waves and the requirement for precisely normalised output intensity and input phase to ensure reliable logic operation - conditions that are difficult to maintain in large-scale circuits owing to inevitable imperfections. Here, we report an integrated magnonic circuit that overcomes both limitations through engineered nonlinearity in nanoscale yttrium iron garnet waveguides. Nonlinear self-adjustment of the spin wave phase renders logic operation insensitive to the relative phases of the inputs, while a deeply nonlinear, threshold-activated self-normalised excitation restores and standardises the output intensity. Using space-resolved micro-focused Brillouin light scattering, we demonstrate reconfigurable AND, OR and three-input majority gates and realise deterministic cascading across sequential stages, establishing a scalable on-chip logic primitive. The architecture operates with gigahertz frequencies, supports dynamic threshold control for functional reconfiguration, and is compatible with scalable integration, making it attractive for adaptive and neuromorphic computing. By resolving phase-independent operation and signal restoration at the level of device physics, this work advances magnonics from isolated proof-of-concept devices towards integrated magnonic chips that can complement advanced CMOS in energy-constrained computing tasks.

cond-mat.mtrl-sci↗
arXiv2024

Fast switchable unidirectional magnon emitter

Magnon spintronics is an emerging field that explores the use of magnons, the quanta of spin waves in magnetic materials for information processing and communication. Achieving unidirectional information transport with fast switching capability is critical for the development of fast integrated magnonic circuits, which offer significant advantages in high-speed, low-power information processing. However, previous unidirectional information transport has primarily focused on Damon-Eshbach spin wave modes, which are non-switchable as their propagation direction is defined by the direction of the external field and cannot be changed in a short time. Here, we experimentally demonstrate a fast switchable unidirectional magnon emitter in the forward volume spin wave mode by a current-induced asymmetric Oersted field. Our findings reveal significant nonreciprocity and nanosecond switchability, underscoring the potential of the method to advance high-speed spin-wave processing networks.

cond-mat.mes-hall↗
arXiv2024

All-magnonic repeater based on bistability

Bistability, a universal phenomenon found in diverse fields such as biology, chemistry, and physics, describes a scenario in which a system has two stable equilibrium states and resets to one of the two states. The ability to switch between these two states is the basis for a wide range of applications, particularly in memory and logic operations. Here, we present a universal approach to achieve bistable switching in magnonics, the field processing data using spin waves. As an exemplary application, we use magnonic bistability to experimentally demonstrate the still missing magnonic repeater. A pronounced bistable window is observed in a 1um wide magnonic conduit under an external rf drive characterized by two magnonic stable states defined as low and high spin-wave amplitudes. The switching between these two states is realized by another propagating spin wave sent into the rf driven region. This magnonic bistable switching is used to design the magnonic repeater, which receives the original decayed and distorted spin wave and regenerates a new spin wave with amplified amplitude and normalized phase. Our magnonic repeater is proposed to be installed at the inputs of each magnonic logic gate to overcome the spin-wave amplitude degradation and phase distortion during previous propagation and achieve integrated magnonic circuits or magnonic neuromorphic networks.

physics.app-ph↗
arXiv2021

JITuNE: Just-In-Time Hyperparameter Tuning for Network Embedding Algorithms

Network embedding (NE) can generate succinct node representations for massive-scale networks and enable direct applications of common machine learning methods to the network structure. Various NE algorithms have been proposed and used in a number of applications, such as node classification and link prediction. NE algorithms typically contain hyperparameters that are key to performance, but the hyperparameter tuning process can be time consuming. It is desirable to have the hyperparameters tuned within a specified length of time. Although AutoML methods have been applied to the hyperparameter tuning of NE algorithms, the problem of how to tune hyperparameters in a given period of time is not studied for NE algorithms before. In this paper, we propose JITuNE, a just-in-time hyperparameter tuning framework for NE algorithms. Our JITuNE framework enables the time-constrained hyperparameter tuning for NE algorithms by employing the tuning over hierarchical network synopses and transferring the knowledge obtained on synopses to the whole network. The hierarchical generation of synopsis and a time-constrained tuning method enable the constraining of overall tuning time. Extensive experiments demonstrate that JITuNE can significantly improve performances of NE algorithms, outperforming state-of-the-art methods within the same number of algorithm runs.

cs.LG↗
arXiv2017

BestConfig: Tapping the Performance Potential of Systems via Automatic Configuration Tuning

An ever increasing number of configuration parameters are provided to system users. But many users have used one configuration setting across different workloads, leaving untapped the performance potential of systems. A good configuration setting can greatly improve the performance of a deployed system under certain workloads. But with tens or hundreds of parameters, it becomes a highly costly task to decide which configuration setting leads to the best performance. While such task requires the strong expertise in both the system and the application, users commonly lack such expertise. To help users tap the performance potential of systems, we present BestConfig, a system for automatically finding a best configuration setting within a resource limit for a deployed system under a given application workload. BestConfig is designed with an extensible architecture to automate the configuration tuning for general systems. To tune system configurations within a resource limit, we propose the divide-and-diverge sampling method and the recursive bound-and-search algorithm. BestConfig can improve the throughput of Tomcat by 75%, that of Cassandra by 63%, that of MySQL by 430%, and reduce the running time of Hive join job by about 50% and that of Spark join job by about 80%, solely by configuration adjustment.

cs.PF↗
arXiv2017

ACTS in Need: Automatic Configuration Tuning with Scalability Guarantees

To support the variety of Big Data use cases, many Big Data related systems expose a large number of user-specifiable configuration parameters. Highlighted in our experiments, a MySQL deployment with well-tuned configuration parameters achieves a peak throughput as 12 times much as one with the default setting. However, finding the best setting for the tens or hundreds of configuration parameters is mission impossible for ordinary users. Worse still, many Big Data applications require the support of multiple systems co-deployed in the same cluster. As these co-deployed systems can interact to affect the overall performance, they must be tuned together. Automatic configuration tuning with scalability guarantees (ACTS) is in need to help system users. Solutions to ACTS must scale to various systems, workloads, deployments, parameters and resource limits. Proposing and implementing an ACTS solution, we demonstrate that ACTS can benefit users not only in improving system performance and resource utilization, but also in saving costs and enabling fairer benchmarking.

cs.DC↗
arXiv2017

ACIA, not ACID: Conditions, Properties and Challenges

Although ACID is the previous golden rule for transaction support, durability is now not a basic requirement for data storage. Rather, high availability is becoming the first-class property required by online applications. We show that high availability of data is almost surely a stronger property than durability. We thus propose ACIA (Atomicity, Consistency, Isolation, Availability) as the new standard for transaction support. Essentially, the shift from ACID to ACIA is due to the change of assumed conditions for data management. Four major condition changes exist. With ACIA transactions, more diverse requirements can be flexibly supported for applications through the specification of consistency levels, isolation levels and fault tolerance levels. Clarifying the ACIA properties enables the exploitation of techniques used for ACID transactions, as well as bringing about new challenges for research.

cs.DC↗
arXiv2017

To Vote Before Decide: A Logless One-Phase Commit Protocol for Highly-Available Datastores

Highly-available datastores are widely deployed for online applications. However, many online applications are not contented with the simple data access interface currently provided by highly-available datastores. Distributed transaction support is demanded by applications such as large-scale online payment used by Alipay or Paypal. Current solutions to distributed transaction can spend more than half of the whole transaction processing time in distributed commit. An efficient atomic commit protocol is highly desirable. This paper presents the HACommit protocol, a logless one-phase commit protocol for highly-available systems. HACommit has transaction participants vote for a commit before the client decides to commit or abort the transaction; in comparison, the state-of-the-art practice for distributed commit is to have the client decide before participants vote. The change enables the removal of both the participant logging and the coordinator logging steps in the distributed commit process; it also makes possible that, after the client initiates the transaction commit, the transaction data is visible to other transactions within one communication roundtrip time (i.e., one phase). In the evaluation with extensive experiments, HACommit outperforms recent atomic commit solutions for highly-available datastores under different workloads. In the best case, HACommit can commit in one fifth of the time 2PC does.

cs.DC↗