Search arXiv⌕ Search

arXiv subjects

Jie Li

Publications and source records attributed to Jie Li.

At least 433 records · Page 24Linked to original sources

Sequence entropy tuples and mean sensitive tuples

Using the idea of local entropy theory, we characterize the sequence entropy tuple via mean forms of the sensitive tuple in both topological and measure-theoretical senses. For the measure-theoretical sense, we show that for an ergodic measure-preserving system, the $μ$-sequence entropy tuple, the $μ$-mean sensitive tuple and the $μ$-sensitive in the mean tuple coincide, and give an example to show that the ergodicity condition is necessary. For the topological sense, we show that for a certain class of minimal systems, the mean sensitive tuple is the sequence entropy tuple.

math.DS↗

Information-Theoretically Private Matrix Multiplication From MDS-Coded Storage

We study two problems of private matrix multiplication, over a distributed computing system consisting of a master node, and multiple servers that collectively store a family of public matrices using Maximum-Distance-Separable (MDS) codes. In the first problem of Private and Secure Matrix Multiplication (PSMM) from colluding servers, the master intends to compute the product of its confidential matrix $\mathbf{A}$ with a target matrix stored on the servers, without revealing any information about $\mathbf{A}$ and the index of target matrix to some colluding servers. In the second problem of Fully Private Matrix Multiplication (FPMM) from colluding servers, the matrix $\mathbf{A}$ is also selected from another family of public matrices stored at the servers in MDS form. In this case, the indices of the two target matrices should both be kept private from colluding servers. We develop novel strategies for the two PSMM and FPMM problems, which simultaneously guarantee information-theoretic data/index privacy and computation correctness. We compare the proposed PSMM strategy with a previous PSMM strategy with a weaker privacy guarantee (non-colluding servers), and demonstrate substantial improvements over the previous strategy in terms of communication and computation overheads. Moreover, compared with a baseline FPMM strategy that uses the idea of Private Information Retrieval (PIR) to directly retrieve the desired matrix multiplication, the proposed FPMM strategy significantly reduces storage overhead, but slightly incurs large communication and computation overheads.

cs.IT↗

Adaptive incentive for cross-silo federated learning: A multi-agent reinforcement learning approach

Cross-silo federated learning (FL) is a typical FL that enables organizations(e.g., financial or medical entities) to train global models on isolated data. Reasonable incentive is key to encouraging organizations to contribute data. However, existing works on incentivizing cross-silo FL lack consideration of the environmental dynamics (e.g., precision of the trained global model and data owned by uncertain clients during the training processes). Moreover, most of them assume that organizations share private information, which is unrealistic. To overcome these limitations, we propose a novel adaptive mechanism for cross-silo FL, towards incentivizing organizations to contribute data to maximize their long-term payoffs in a real dynamic training environment. The mechanism is based on multi-agent reinforcement learning, which learns near-optimal data contribution strategy from the history of potential games without organizations' private information. Experiments demonstrate that our mechanism achieves adaptive incentive and effectively improves the long-term payoffs for organizations.

cs.LG↗

Integrated Sensing and Communication from Learning Perspective: An SDP3 Approach

Characterizing the sensing and communication performance tradeoff in integrated sensing and communication (ISAC) systems is challenging in the applications of learning-based human motion recognition. This is because of the large experimental datasets and the black-box nature of deep neural networks. This paper presents SDP3, a Simulation-Driven Performance Predictor and oPtimizer, which consists of SDP3 data simulator, SDP3 performance predictor and SDP3 performance optimizer. Specifically, the SDP3 data simulator generates vivid wireless sensing datasets in a virtual environment, the SDP3 performance predictor predicts the sensing performance based on the function regression method, and the SDP3 performance optimizer investigates the sensing and communication performance tradeoff analytically. It is shown that the simulated sensing dataset matches the experimental dataset very well in the motion recognition accuracy. By leveraging SDP3, it is found that the achievable region of recognition accuracy and communication throughput consists of a communication saturation zone, a sensing saturation zone, and a communication-sensing adversarial zone, of which the desired balanced performance for ISAC systems lies in the third one.

cs.IT↗

ShaSTA: Modeling Shape and Spatio-Temporal Affinities for 3D Multi-Object Tracking

Multi-object tracking is a cornerstone capability of any robotic system. The quality of tracking is largely dependent on the quality of the detector used. In many applications, such as autonomous vehicles, it is preferable to over-detect objects to avoid catastrophic outcomes due to missed detections. As a result, current state-of-the-art 3D detectors produce high rates of false-positives to ensure a low number of false-negatives. This can negatively affect tracking by making data association and track lifecycle management more challenging. Additionally, occasional false-negative detections due to difficult scenarios like occlusions can harm tracking performance. To address these issues in a unified framework, we propose to learn shape and spatio-temporal affinities between tracks and detections in consecutive frames. Our affinity provides a probabilistic matching that leads to robust data association, track lifecycle management, false-positive elimination, false-negative propagation, and sequential track confidence refinement. Though past 3D MOT approaches address a subset of components in this problem domain, we offer the first self-contained framework that addresses all these aspects of the 3D MOT problem. We quantitatively evaluate our method on the nuScenes tracking benchmark where we achieve 1st place amongst LiDAR-only trackers using CenterPoint detections. Our method estimates accurate and precise tracks, while decreasing the overall number of false-positive and false-negative tracks and increasing the number of true-positive tracks. We analyze our performance with 5 metrics, giving a comprehensive overview of our approach to indicate how our tracking framework may impact the ultimate goal of an autonomous mobile agent. We also present ablative experiments and qualitative results that demonstrate our framework's capabilities in complex scenarios.

cs.CV↗

Predicting Molecule-Target Interaction by Learning Biomedical Network and Molecule Representations

The study of molecule-target interaction is quite important for drug discovery in terms of target identification, hit identification, pathway study, drug-drug interaction, etc. Most existing methodologies utilize either biomedical network information or molecule structural features to predict potential interaction link. However, the biomedical network information based methods usually suffer from cold start problem, while structure based methods often give limited performance due to the structure/interaction assumption and data quality. To address these issues, we propose a pseudo-siamese Graph Neural Network method, namely MTINet+, which learns both biomedical network topological and molecule structural/chemical information as representations to predict potential interaction of given molecule and target pair. In MTINet+, 1-hop subgraphs of given molecule and target pair are extracted from known interaction of biomedical network as topological information, meanwhile the molecule structural and chemical attributes are processed as molecule information. MTINet+ learns these two types of information as embedding features for predicting the pair link. In the experiments of different molecule-target interaction tasks, MTINet+ significantly outperforms over the state-of-the-art baselines. In addition, in our designed network sparsity experiments , MTINet+ shows strong robustness against different sparse biomedical networks.

cs.LG↗

Maximal co-occurrence nonoverlapping sequential rule mining

The aim of sequential pattern mining (SPM) is to discover potentially useful information from a given se-quence. Although various SPM methods have been investigated, most of these focus on mining all of the patterns. However, users sometimes want to mine patterns with the same specific prefix pattern, called co-occurrence pattern. Since sequential rule mining can make better use of the results of SPM, and obtain better recommendation performance, this paper addresses the issue of maximal co-occurrence nonoverlapping sequential rule (MCoR) mining and proposes the MCoR-Miner algo-rithm. To improve the efficiency of support calculation, MCoR-Miner employs depth-first search and backtracking strategies equipped with an indexing mechanism to avoid the use of sequential searching. To obviate useless support calculations for some sequences, MCoR-Miner adopts a filtering strategy to prune the sequences without the prefix pattern. To reduce the number of candidate patterns, MCoR-Miner applies the frequent item and binomial enumeration tree strategies. To avoid searching for the maximal rules through brute force, MCoR-Miner uses a screening strategy. To validate the per-formance of MCoR-Miner, eleven competitive algorithms were conducted on eight sequences. Our experimental results showed that MCoR-Miner outperformed other competitive algorithms, and yielded better recommendation performance than frequent co-occurrence pattern mining. All algorithms and datasets can be downloaded from https://github.com/wuc567/Pattern-Mining/tree/master/MCoR-Miner.

cs.DB↗

Topological and nodal superconductor kagome magnesium triboride

Recently the kagome compounds have inspired enormous interest and made some great progress such as in the field of superconductivity and topology. Here we predict a different kagome magnesium triboride (MgB3) superconductor with a calculated Tc ~12.2 K and Tc ~15.4 K by external stress, the potentially highest among the reported diverse kagome-type superconductors. We reveal its various exotic physical properties including the van Hove singularity, flat-band, multiple Dirac points, and nontrivial topology. The system can be described by a two-band model with highly anisotropic superconducting gaps on Fermi surfaces. Its topological and nodal superconducting nature is unveiled by a recently developed symmetry indicators method. Our results suggest that MgB3 can be a new platform to study exotic physics in the kagome structure, and pave a way to seek for more superconductors and topological materials with XY3-type kagome lattice.

cond-mat.supr-con↗

ARcode: HPC Application Recognition Through Image-encoded Monitoring Data

Knowing HPC applications of jobs and analyzing their performance behavior play important roles in system management and optimizations. The existing approaches detect and identify HPC applications through machine learning models. However, these approaches rely heavily on the manually extracted features from resource utilization data to achieve high prediction accuracy. In this study, we propose an innovative application recognition method, ARcode, which encodes job monitoring data into images and leverages the automatic feature learning capability of convolutional neural networks to detect and identify applications. Our extensive evaluations based on the dataset collected from a large-scale production HPC system show that ARcode outperforms the state-of-the-art methodology by up to 18.87% in terms of accuracy at high confidence thresholds. For some specific applications (BerkeleyGW and e3sm), ARcode outperforms by over 20% at a confidence threshold of 0.8.

cs.DC↗

Workload Failure Prediction for Data Centers

Failed workloads that consumed significant computational resources in time and space affect the efficiency of data centers significantly and thus limit the amount of scientific work that can be achieved. While the computational power has increased significantly over the years, detection and prediction of workload failures have lagged far behind and will become increasingly critical as the system scale and complexity further increase. In this study, we analyze workload traces collected from a production cluster and train machine learning models on a large amount of data sets to predict workload failures. Our prediction models consist of a queue-time model that estimates the probability of workload failures before execution and a runtime model that predicts failures at runtime. Evaluation results show that the queue-time model and runtime model can predict workload failures with a maximum precision score of 90.61% and 97.75%, respectively. By integrating the runtime model with the job scheduler, it helps reduce CPU time, and memory usage by up to 16.7% and 14.53%, respectively.

cs.DC↗

Multi-scale multi-modal micro-expression recognition algorithm based on transformer

A micro-expression is a spontaneous unconscious facial muscle movement that can reveal the true emotions people attempt to hide. Although manual methods have made good progress and deep learning is gaining prominence. Due to the short duration of micro-expression and different scales of expressed in facial regions, existing algorithms cannot extract multi-modal multi-scale facial region features while taking into account contextual information to learn underlying features. Therefore, in order to solve the above problems, a multi-modal multi-scale algorithm based on transformer network is proposed in this paper, aiming to fully learn local multi-grained features of micro-expressions through two modal features of micro-expressions - motion features and texture features. To obtain local area features of the face at different scales, we learned patch features at different scales for both modalities, and then fused multi-layer multi-headed attention weights to obtain effective features by weighting the patch features, and combined cross-modal contrastive learning for model optimization. We conducted comprehensive experiments on three spontaneous datasets, and the results show the accuracy of the proposed algorithm in single measurement SMIC database is up to 78.73% and the F1 value on CASMEII of the combined database is up to 0.9071, which is at the leading level.

cs.CV↗

Reconstruction of compressed spectral imaging based on global structure and spectral correlation

In this paper, a convolutional sparse coding method based on global structure characteristics and spectral correlation is proposed for the reconstruction of compressive spectral images. The spectral data is regarded as the convolution sum of the convolution kernel and the corresponding coefficients, using the convolution kernel operates the global image information, preserving the structure information of the spectral image in the spatial dimension. To take full exploration of the constraints between spectra, the coefficients corresponding to the convolution kernel are constrained by the L_(2,1)norm to improve spectral accuracy. And, to solve the problem that convolutional sparse coding is insensitive to low frequency, the global total-variation (TV) constraint is added to estimate the low-frequency components. It not only ensures the effective estimation of the low-frequency but also transforms the convolutional sparse coding into a de-noising process, which makes the reconstructing process simpler. Simulations show that compared with the current mainstream optimization methods, the proposed method can improve the reconstruction quality by up to 4 dB in PSNR and 10% in SSIM, and has a great improvement in the details of the reconstructed image.

cs.CV↗

An Indoor Environment Sensing and Localization System via mmWave Phased Array

An indoor layout sensing and localization system in 60GHz millimeter wave (mmWave) band, named mmReality, is elaborated in this paper. The mmReality system consists of one transmitter and one mobile receiver, each with a phased array and a single radio frequency (RF) chain. To reconstruct the room layout, the pilot signal is delivered from the transmitter to the receiver via different pairs of transmission and receiving beams, so that the signals at all antenna elements can be resolved. Then, the spatial smoothing and two-dimensional multiple signal classification (MUSIC) algorithm is applied to detect the angle-of-arrival (AoAs) and angle-of-departure (AoDs) of the rays from the transmitter to the receiver. Moreover, the technique of multi-carrier ranging is adopted to measure the distance of each propagation path. Synthesizing the above geometrical parameters, the location of receiver relative to the transmitter can be pinpointed, both line-of-sight (LoS) and non-line-of-sight (NLoS) paths can also be determined. Therefore, the room layout can be reconstructed by moving the receiver and repeating the above measurement in different locations of the room. At the end, we show that the reconstructed room layout can be utilized to locate a mobile device according to its AoA spectrum, even with single access point.

eess.SP↗

A Novel Improved Mask RCNN for Multiple Targets Detection in the Indoor Complex Scenes

With the expansive aging of global population, service robot with living assistance applied in indoor scenes will serve as a crucial role in the field of elderly care and health in the future. Service robots need to detect multiple targets when completing auxiliary tasks. However, indoor scenes are usually complex and there are many types of interference factors, leading to great challenges in the multiple targets detection. To overcome this technical difficulty, a novel improved Mask RCNN method for multiple targets detection in the indoor complex scenes is proposed in this paper. The improved model utilizes Mask RCNN as the network framework. On this basis, Convolutional Block Attention Module (CBAM) with channel mechanism and space mechanism is integrated, and the influence of different background, distance, angle and interference factors are comprehensively considered. Meanwhile, in order to evaluate the detection and identification effects of the established model, a comprehensive evaluation system based on loss function and Mean Average Precision (mAP) is established. For verification, experiments on the detection and identification effects under different distances, backgrounds, angles and interference factors were conducted. The results show that designed model improves the accuracy to a higher level and has a better anti-interference ability than other methods when the detection speed was nearly the same.

cs.CV↗

AT2021acak: a candidate tidal disruption event found in the Zwicky Transient Facility survey

We report a candidate tidal disruption event (TDE) found in the Zwicky Transient Facility (ZTF) survey data. This candidate, with its transient name AT2021acak, showed brightness increases of $\sim$1\,mag around MJD~59500 and subsequent power-law--like brightness declines. We have conducted multiple optical spectroscopic observations with the 2.4-m Lijiang telescope and one observation at X-ray and ultraviolet (UV) bands with the {\it Neil Gehrels Swift Observatory (Swift)}. The optical spectra of the source show broad H and He emission line and Fe emission features. Possible 0.3--2\,keV X-ray and bright UV emission of the source was detected. We analyze the declines of the optical light curves, the emission features of the optical spectra, and the constructed broad-band UV and optical spectrum. The properties derived from the analyses are consistent with those of reported (candidate) TDEs, and in particular very similar to those of ASASSN-18jd. The identification is complicated by the host being likely an AGN, and thus further observations of the event and quiescent host are required in order to have a clear understanding of the nature of this transient event.

astro-ph.HE↗

Ground-state cooling of a massive mechanical oscillator by feedback in cavity magnomechanics

Cooling the motion of a massive mechanical oscillator into its quantum ground state plays an essential role in observing macroscopic quantum effects in mechanical systems. Here we propose a measurement-based feedback cooling protocol in cavity magnomechanics that is able to cool the mechanical vibration mode of a macroscopic ferromagnet into its ground state. The mechanical mode couples to a magnon mode via a dispersive magnetostrictive interaction, and the latter further couples to a microwave cavity mode via the magnetic-dipole interaction. A feedback loop is introduced by measuring the amplitude of the microwave cavity output field and applying a force onto the mechanical oscillator that is proportional to the amplitude fluctuation of the output field. We show that by properly designing the feedback gain, the mechanical damping rate can be significantly enhanced while the mechanical frequency remains unaffected. Consequently, the vibration mode can be cooled into its quantum ground state in the unresolved-sideband regime at cryogenic temperatures. The protocol is designed for cavity magnomechanical systems using ferromagnetic materials which possess strong magnetostriction along with large magnon dissipation.

quant-ph↗

Giant spin ensembles in waveguide magnonics

The dipole approximation is usually employed to describe light-matter interactions under ordinary conditions. With the development of artificial atomic systems, `giant atom' physics is possible, where the scale of atoms is comparable to or even greater than the wavelength of the light they interact with, and the dipole approximation is no longer valid. It reveals interesting physics impossible in small atoms and may offer useful applications. Here, we experimentally demonstrate the giant spin ensemble (GSE), where a ferromagnetic spin ensemble interacts twice with the meandering waveguide, and the coupling strength between them can be continuously tuned from finite (coupled) to zero (decoupled) by varying the frequency. In the nested configuration, we investigate the collective behavior of two GSEs and find extraordinary phenomena that cannot be observed in conventional systems. Our experiment offers a new platform for `giant atom' physics.

quant-ph↗

Entangling mechanical vibrations of two massive ferrimagnets by fully exploiting the nonlinearity of magnetostriction

Quantum entanglement in the motion of macroscopic objects is of significance to both fundamental studies and quantum technologies. Here we show how to entangle the mechanical vibration modes of two massive ferrimagnets that are placed in the same microwave cavity. Each ferrimagnet supports a magnon mode and a low-frequency vibration mode coupled by the magnetostrictive force. The two magnon modes are, respectively, coupled to the microwave cavity by the magnetic dipole interaction. We first generate a stationary nonlocal entangled state between the vibration mode of the ferrimagnet-1 and the magnon mode of the ferrimagnet-2. This is realized by continuously driving the ferrimagnet-1 with a strong red-detuned microwave field and the entanglement is achieved by exploiting the magnomechanical parametric down-conversion and the cavity-magnon state-swap interaction. We then switch off the pump on the ferrimagnet-1 and, simultaneously, turn on a red-detuned pulsed drive on the ferrimagnet-2. The latter drive is used to activate the magnomechanical beamsplitter interaction, which swaps the magnonic and mechanical states of the ferrimagnet-2. Consequently, the previously generated phonon-magnon entanglement is transferred to the mechanical modes of two ferrimagnets. The work provides a scheme to prepare entangled states of mechanical motion of two massive objects, which may find applications in various studies exploiting macroscopic entangled states.

quant-ph↗