arXiv subjects

Yang Li

Publications and source records attributed to Yang Li.

At least 937 records · Page 52Linked to original sources

arXiv2023

Thermal Casimir interactions in multi-particle systems: scattering channel approach

Multi-particle thermal Casimir interactions are investigated, mostly in terms of the Casimir entropy, from the point of view based on multiple-scattering processes. The geometry of the scattering path is depicted in detail, and the contributions from different types of channels, namely the transverse, longitudinal and mixing channels, are demonstrated. The geometry of the path can strongly influence the weight of each channel in the path. Negativity and nonmonotonicity are commonly seen in the multi-particle Casimir entropy, the sources of which are diverse, including the geometry of the path, the types of polarization mixing, the polarizability of each particle, etc. Thermal contributions from multi-particle scatterings can be significant in the system, while the zero-temperature multi-particle scattering effects are insignificant. Limiting behaviors from a multi-particle configuration to a continuum are briefly explored.

hep-th↗

arXiv2023

Some New Ramanujan's Modular Equations of Degree 15

Ramanujan in his notebook recorded two modular equations involving multiplier with moduli of degrees (1,7) and (1,23). In this paper, we find some new Ramanujan's modular equations involving multiplier with moduli of degrees (3,5) and (1,15), and give concise proofs by employing Ramanujan's multiplier function equation.

math.NT↗

arXiv2023

BrainCog: A Spiking Neural Network based Brain-inspired Cognitive Intelligence Engine for Brain-inspired AI and Brain Simulation

Spiking neural networks (SNNs) have attracted extensive attentions in Brain-inspired Artificial Intelligence and computational neuroscience. They can be used to simulate biological information processing in the brain at multiple scales. More importantly, SNNs serve as an appropriate level of abstraction to bring inspirations from brain and cognition to Artificial Intelligence. In this paper, we present the Brain-inspired Cognitive Intelligence Engine (BrainCog) for creating brain-inspired AI and brain simulation models. BrainCog incorporates different types of spiking neuron models, learning rules, brain areas, etc., as essential modules provided by the platform. Based on these easy-to-use modules, BrainCog supports various brain-inspired cognitive functions, including Perception and Learning, Decision Making, Knowledge Representation and Reasoning, Motor Control, and Social Cognition. These brain-inspired AI models have been effectively validated on various supervised, unsupervised, and reinforcement learning tasks, and they can be used to enable AI models to be with multiple brain-inspired cognitive functions. For brain simulation, BrainCog realizes the function simulation of decision-making, working memory, the structure simulation of the Neural Circuit, and whole brain structure simulation of Mouse brain, Macaque brain, and Human brain. An AI engine named BORN is developed based on BrainCog, and it demonstrates how the components of BrainCog can be integrated and used to build AI models and applications. To enable the scientific quest to decode the nature of biological intelligence and create AI, BrainCog aims to provide essential and easy-to-use building blocks, and infrastructural support to develop brain-inspired spiking neural network based AI, and to simulate the cognitive brains at multiple scales. The online repository of BrainCog can be found at https://github.com/braincog-x.

cs.NE↗

arXiv2023

InferTurbo: A Scalable System for Boosting Full-graph Inference of Graph Neural Network over Huge Graphs

GNN inference is a non-trivial task, especially in industrial scenarios with giant graphs, given three main challenges, i.e., scalability tailored for full-graph inference on huge graphs, inconsistency caused by stochastic acceleration strategies (e.g., sampling), and the serious redundant computation issue. To address the above challenges, we propose a scalable system named InferTurbo to boost the GNN inference tasks in industrial scenarios. Inspired by the philosophy of ``think-like-a-vertex", a GAS-like (Gather-Apply-Scatter) schema is proposed to describe the computation paradigm and data flow of GNN inference. The computation of GNNs is expressed in an iteration manner, in which a vertex would gather messages via in-edges and update its state information by forwarding an associated layer of GNNs with those messages and then send the updated information to other vertexes via out-edges. Following the schema, the proposed InferTurbo can be built with alternative backends (e.g., batch processing system or graph computing system). Moreover, InferTurbo introduces several strategies like shadow-nodes and partial-gather to handle nodes with large degrees for better load balancing. With InferTurbo, GNN inference can be hierarchically conducted over the full graph without sampling and redundant computation. Experimental results demonstrate that our system is robust and efficient for inference tasks over graphs containing some hub nodes with many adjacent edges. Meanwhile, the system gains a remarkable performance compared with the traditional inference pipeline, and it can finish a GNN inference task over a graph with tens of billions of nodes and hundreds of billions of edges within 2 hours.

cs.LG↗

arXiv2023

Image encryption for Offshore wind power based on 2D-LCLM and Zhou Yi Eight Trigrams

Offshore wind power is an important part of the new power system, due to the complex and changing situation at ocean, its normal operation and maintenance cannot be done without information such as images, therefore, it is especially important to transmit the correct image in the process of information transmission. In this paper, we propose a new encryption algorithm for offshore wind power based on two-dimensional lagged complex logistic mapping (2D-LCLM) and Zhou Yi Eight Trigrams. Firstly, the initial value of the 2D-LCLM is constructed by the Sha-256 to associate the 2D-LCLM with the plaintext. Secondly, a new encryption rule is proposed from the Zhou Yi Eight Trigrams to obfuscate the pixel values and generate the round key. Then, 2D-LCLM is combined with the Zigzag to form an S-box. Finally, the simulation experiment of the algorithm is accomplished. The experimental results demonstrate that the algorithm can resistant common attacks and has prefect encryption performance.

cs.CR↗

arXiv2023

Farthest Streamline Sampling for the Uniform Distribution of Forearm Muscle Fiber Tracts from Diffusion Tensor Imaging

Background: Diffusion tensor imaging (DTI) has been used to characterize forearm muscle architecture. Since only uniform sampling is performed for seed points rather than fiber tracts, the tracts may be unevenly distributed in the muscle volume. Purpose: To reconstruct uniformly distributed fiber tracts in human forearm by filtering the tracts from DTI. Assessment: Farthest streamline sampling (FSS) was proposed for filtering and compared with two conventional methods, i.e., two-dimensional sampling and three-dimensional sampling. The uniform coverage performance of the methods was evaluated by streamline coverage (SC) and the coefficient of variation of streamline density (SDCV). Architectural parameters were calculated for 17 forearm muscles. Anatomical correctness was verified by 1. visually assessing the fiber orientation, 2. checking whether the architectural parameters were within physiological ranges, and 3. classifying the architectural types. Results: FSS had the highest SC (0.93+0.04) and the lowest SDCV (0.34+0.06) among the three methods (P<0.05). FSS reduced the sampling of long tracts (10% reduction in fiber length, P<0.05), and the architectural parameters were within physiological ranges (two parameters with P<0.05). The fiber orientation of the tractography was visually consistent with that of the cadaveric specimen. The architectural types of 16 muscles were correctly classified, except for the palmaris longus, which had a linear arrangement of fiber endpoints (R2=0.95+0.02, P<0.001). Data Conclusion: FSS reconstructed more muscle regions and uniformly distributed fiber tracts. The tracts were anatomically correct, indicating the validity of fiber tracts. Key Words: diffusion tensor imaging; forearm muscles; architectural properties

eess.IV↗

arXiv2023

Experimental observation of non-Hermitian higher-order skin interface states in topological electric circuits

The study of topological states has developed rapidly in electric circuits, which permits flexible fabrications of non-Hermitian systems by introducing non-Hermitian terms. Here, nonreciprocal coupling terms are realized by utilizing a voltage follower module in non-Hermitian topological electric circuits. We report the experimental realization of one- and two- dimensional non-Hermitian skin interface states in electric circuits, where interface states induced by non-Hermitian skin effects are localized at the interface of different domains carrying different winding numbers. Our electric circuit system provides a readily accessible platform to explore non-Hermitian-induced topological phases, and paves a new road for device applications.

cond-mat.mes-hall↗

arXiv2023

Recent Developments in Recommender Systems: A Survey

In this technical survey, we comprehensively summarize the latest advancements in the field of recommender systems. The objective of this study is to provide an overview of the current state-of-the-art in the field and highlight the latest trends in the development of recommender systems. The study starts with a comprehensive summary of the main taxonomy of recommender systems, including personalized and group recommender systems, and then delves into the category of knowledge-based recommender systems. In addition, the survey analyzes the robustness, data bias, and fairness issues in recommender systems, summarizing the evaluation metrics used to assess the performance of these systems. Finally, the study provides insights into the latest trends in the development of recommender systems and highlights the new directions for future research in the field.

cs.IR↗

arXiv2023

PLay: Parametrically Conditioned Layout Generation using Latent Diffusion

Layout design is an important task in various design fields, including user interface, document, and graphic design. As this task requires tedious manual effort by designers, prior works have attempted to automate this process using generative models, but commonly fell short of providing intuitive user controls and achieving design objectives. In this paper, we build a conditional latent diffusion model, PLay, that generates parametrically conditioned layouts in vector graphic space from user-specified guidelines, which are commonly used by designers for representing their design intents in current practices. Our method outperforms prior works across three datasets on metrics including FID and FD-VG, and in user study. Moreover, it brings a novel and interactive experience to professional layout design processes.

cs.LG↗

arXiv2023

IID-GAN: an IID Sampling Perspective for Regularizing Mode Collapse

Despite its success, generative adversarial networks (GANs) still suffer from mode collapse, i.e., the generator can only map latent variables to a partial set of modes in the target distribution. In this paper, we analyze and seek to regularize this issue with an independent and identically distributed (IID) sampling perspective and emphasize that holding the IID property referring to the target distribution for generation can naturally avoid mode collapse. This is based on the basic IID assumption for real data in machine learning. However, though the source samples {z} obey IID, the generations {G(z)} may not necessarily be IID sampling from the target distribution. Based on this observation, considering a necessary condition of IID generation that the inverse samples from target data should also be IID in the source distribution, we propose a new loss to encourage the closeness between inverse samples of real data and the Gaussian source in latent space to regularize the generation to be IID from the target distribution. Experiments on both synthetic and real-world data show the effectiveness of our model.

cs.LG↗

arXiv2023

Computing large deviation prefactors of stochastic dynamical systems based on machine learning

In this paper, we present large deviation theory that characterizes the exponential estimate for rare events of stochastic dynamical systems in the limit of weak noise. We aim to consider next-to-leading-order approximation for more accurate calculation of mean exit time via computing large deviation prefactors with the research efforts of machine learning. More specifically, we design a neural network framework to compute quasipotential, most probable paths and prefactors based on the orthogonal decomposition of vector field. We corroborate the higher effectiveness and accuracy of our algorithm with a practical example. Numerical experiments demonstrate its powerful function in exploring internal mechanism of rare events triggered by weak random fluctuations.

stat.ML↗

arXiv2023

Collaborative Optimization of Multi-microgrids System with Shared Energy Storage Based on Multi-agent Stochastic Game and Reinforcement Learning

Achieving the economical and stable operation of Multi-microgrids (MMG) systems is vital. However, there are still some challenging problems to be solved. Firstly, from the perspective of stable operation, it is necessary to minimize the energy fluctuation of the main grid. Secondly, the characteristics of energy conversion equipment need to be considered. Finally, privacy protection while reducing the operating cost of an MMG system is crucial. To address these challenges, a Data-driven strategy for MMG systems with Shared Energy Storage (SES) is proposed. The Mixed-Attention is applied to fit the conditions of the equipment, additionally, Multi-Agent Soft Actor-Critic(MA-SAC) and (Multi-Agent Win or Learn Fast Policy Hill-Climbing)MA-WoLF-PHC are proposed to solve the partially observable dynamic stochastic game problem. By testing the operation data of the MMG system in Northwest China, following conclusions are drawn: the R-Square (R2) values of results reach 0.999, indicating the neural network effectively models the nonlinear conditions. The proposed MMG system framework can reduce energy fluctuations in the main grid by 1746.5kW in 24 hours and achieve a cost reduction of 16.21% in the test. Finally, the superiority of the proposed algorithms is verified through their fast convergence speed and excellent optimization performance.

eess.SY↗

arXiv2023

FewSAR: A Few-shot SAR Image Classification Benchmark

Few-shot learning (FSL) is one of the significant and hard problems in the field of image classification. However, in contrast to the rapid development of the visible light dataset, the progress in SAR target image classification is much slower. The lack of unified benchmark is a key reason for this phenomenon, which may be severely overlooked by the current literature. The researchers of SAR target image classification always report their new results on their own datasets and experimental setup. It leads to inefficiency in result comparison and impedes the further progress of this area. Motivated by this observation, we propose a novel few-shot SAR image classification benchmark (FewSAR) to address this issue. FewSAR consists of an open-source Python code library of 15 classic methods in three categories for few-shot SAR image classification. It provides an accessible and customizable testbed for different few-shot SAR image classification task. To further understanding the performance of different few-shot methods, we establish evaluation protocols and conduct extensive experiments within the benchmark. By analyzing the quantitative results and runtime under the same setting, we observe that the accuracy of metric learning methods can achieve the best results. Meta-learning methods and fine-tuning methods perform poorly on few-shot SAR images, which is primarily due to the bias of existing datasets. We believe that FewSAR will open up a new avenue for future research and development, on real-world challenges at the intersection of SAR image classification and few-shot deep learning. We will provide our code for the proposed FewSAR at https://github.com/solarlee/FewSAR.

cs.CV↗

arXiv2023

Output Voltage Response Improvement and Ripple Reduction Control for Input-parallel Output-parallel High-Power DC Supply

A three-phase isolated AC-DC-DC power supply is widely used in the industrial field due to its attractive features such as high-power density, modularity for easy expansion and electrical isolation. In high-power application scenarios, it can be realized by multiple AC-DC-DC modules with Input-Parallel Output-Parallel (IPOP) mode. However, it has the problems of slow output voltage response and large ripple in some special applications, such as electrophoresis and electroplating. This paper investigates an improved Adaptive Linear Active Disturbance Rejection Control (A-LADRC) with flexible adjustment capability of the bandwidth parameter value for the high-power DC supply to improve the output voltage response speed. To reduce the DC supply ripple, a control strategy is designed for a single module to adaptively adjust the duty cycle compensation according to the output feedback value. When multiple modules are connected in parallel, a Hierarchical Delay Current Sharing Control (HDCSC) strategy for centralized controllers is proposed to make the peaks and valleys of different modules offset each other. Finally, the proposed method is verified by designing a 42V/12000A high-power DC supply, and the results demonstrate that the proposed method is effective in improving the system output voltage response speed and reducing the voltage ripple, which has significant practical engineering application value.

eess.SY↗

arXiv2023

History Semantic Graph Enhanced Conversational KBQA with Temporal Information Modeling

Context information modeling is an important task in conversational KBQA. However, existing methods usually assume the independence of utterances and model them in isolation. In this paper, we propose a History Semantic Graph Enhanced KBQA model (HSGE) that is able to effectively model long-range semantic dependencies in conversation history while maintaining low computational cost. The framework incorporates a context-aware encoder, which employs a dynamic memory decay mechanism and models context at different levels of granularity. We evaluate HSGE on a widely used benchmark dataset for complex sequential question answering. Experimental results demonstrate that it outperforms existing baselines averaged on all question types.

cs.CL↗

arXiv2023

Joint Activity Detection and Channel Estimation in Massive Machine-Type Communications with Low-Resolution ADC

In massive machine-type communications, data transmission is usually considered sporadic, and thus inherently has a sparse structure. This paper focuses on the joint activity detection (AD) and channel estimation (CE) problems in massive-connected communication systems with low-resolution analog-to-digital converters. To further exploit the sparse structure in transmission, we propose a maximum posterior probability (MAP) estimation problem based on both sporadic activity and sparse channels for joint AD and CE. Moreover, a majorization-minimization-based method is proposed for solving the MAP problem. Finally, various numerical experiments verify that the proposed scheme outperforms state-of-the-art methods.

cs.IT↗

arXiv2023

GaVe: A Webcam-Based Gaze Vending Interface Using One-Point Calibration

Even before the Covid-19 pandemic, beneficial use cases for hygienic, touchless human-machine interaction have been explored. Gaze input, i.e., information input via eye-movements of users, represents a promising method for contact-free interaction in human-machine systems. In this paper, we present the GazeVending interface (GaVe), which lets users control actions on a display with their eyes. The interface works on a regular webcam, available on most of today's laptops, and only requires a one-point calibration before use. GaVe is designed in a hierarchical structure, presenting broad item cluster to users first and subsequently guiding them through another selection round, which allows the presentation of a large number of items. Cluster/item selection in GaVe is based on the dwell time of fixations, i.e., the time duration that users look at a given Cluster/item. A user study (N=22) was conducted to test optimal dwell time thresholds and comfortable human-to-display distances. Users' perception of the system, as well as error rates and task completion time were registered. We found that all participants were able to use the system with a short time training, and showed good performance during system usage, selecting a target item within a group of 12 items in 6.76 seconds on average. Participants were able to quickly understand and know how to interact with the interface. We provide design guidelines for GaVe and discuss the potentials of the system.

cs.HC↗

arXiv2023

Rover: An online Spark SQL tuning service via generalized transfer learning

Distributed data analytic engines like Spark are common choices to process massive data in industry. However, the performance of Spark SQL highly depends on the choice of configurations, where the optimal ones vary with the executed workloads. Among various alternatives for Spark SQL tuning, Bayesian optimization (BO) is a popular framework that finds near-optimal configurations given sufficient budget, but it suffers from the re-optimization issue and is not practical in real production. When applying transfer learning to accelerate the tuning process, we notice two domain-specific challenges: 1) most previous work focus on transferring tuning history, while expert knowledge from Spark engineers is of great potential to improve the tuning performance but is not well studied so far; 2) history tasks should be carefully utilized, where using dissimilar ones lead to a deteriorated performance in production. In this paper, we present Rover, a deployed online Spark SQL tuning service for efficient and safe search on industrial workloads. To address the challenges, we propose generalized transfer learning to boost the tuning performance based on external knowledge, including expert-assisted Bayesian optimization and controlled history transfer. Experiments on public benchmarks and real-world tasks show the superiority of Rover over competitive baselines. Notably, Rover saves an average of 50.1% of the memory cost on 12k real-world Spark SQL tasks in 20 iterations, among which 76.2% of the tasks achieve a significant memory reduction of over 60%.

cs.LG↗