arXiv subjects

Yu Jin

Publications and source records attributed to Yu Jin.

At least 55 records · Page 3Linked to original sources

arXiv2023

Exploration and Exploitation of Hidden PMU Events

Performance Monitoring Unit (PMU) is a common hardware module in Intel CPUs. It can be used to record various CPU behaviors therefore it is often used for performance analysis and optimization. Of the 65536 event spaces, Intel has officially published only 200 or so. In this paper, we design a hidden PMU event collection method. And we found a large number of undocumented PMU events in CPUs of Skylake, Kabylake, and Alderlake microarchitectures. We further demonstrate the existence of these events by using them for transient execution attack detection and build-side channel attacks. This also implies that these hidden PMU events have huge exploitation potential and security threats.

cs.CR↗

arXiv2023

Timing the Transient Execution: A New Side-Channel Attack on Intel CPUs

The transient execution attack is a type of attack leveraging the vulnerability of modern CPU optimization technologies. New attacks surface rapidly. The side-channel is a key part of transient execution attacks to leak data. In this work, we discover a vulnerability that the change of the EFLAGS register in transient execution may have a side effect on the Jcc (jump on condition code) instruction after it in Intel CPUs. Based on our discovery, we propose a new side-channel attack that leverages the timing of both transient execution and Jcc instructions to deliver data. This attack encodes secret data to the change of register which makes the execution time of context slightly slower, which can be measured by the attacker to decode data. This attack doesn't rely on the cache system and doesn't need to reset the EFLAGS register manually to its initial state before the attack, which may make it more difficult to detect or mitigate. We implemented this side-channel on machines with Intel Core i7-6700, i7-7700, and i9-10980XE CPUs. In the first two processors, we combined it as the side-channel of the Meltdown attack, which could achieve 100\% success leaking rate. We evaluate and discuss potential defenses against the attack. Our contributions include discovering security vulnerabilities in the implementation of Jcc instructions and EFLAGS register and proposing a new side-channel attack that does not rely on the cache system.

cs.CR↗

arXiv2023

Practitioners' Expectations on Code Completion

Code completion has become a common practice for programmers during their daily programming activities. It aims at automatically predicting the next tokens or lines that the programmers tend to use. A good code completion tool can substantially save keystrokes and improve the programming efficiency for programmers. Recently, various techniques for code completion have been proposed for usage in practice. However, it is still unclear what are practitioners' expectations on code completion and whether existing research has met their demands. To fill the gap, we perform an empirical study by first interviewing 15 practitioners and then surveying 599 practitioners from 18 IT companies about their expectations on code completion. We then compare the practitioners' demands with current research via conducting a literature review of papers on code completion published in premier publication venues from 2012 to 2022. Based on the comparison, we highlight the directions desirable for researchers to invest efforts towards developing code completion techniques for meeting practitioners' expectations.

cs.SE↗

arXiv2022

Vibrationally resolved optical excitations of the nitrogen-vacancy center in diamond

A comprehensive description of the optical cycle of spin defects in solids requires the understanding of the electronic and atomistic structure of states with different spin multiplicity, including singlet states which are particularly challenging from a theoretical standpoint. We present a general framework, based on spin-flip time-dependent density function theory, to determine the excited state potential energy surfaces of the many-body singlet states of spin defects; we then predict the vibrationally resolved absorption spectrum between singlet shelving states of a prototypical defect, the nitrogen-vacancy center in diamond. Our results, which are in excellent agreement with experiments, provide an interpretation of the measured spectra and reveal the key role of specific phonons in determining absorption processes, and the notable influence of non-adiabatic interactions. The insights gained from our calculations may be useful in defining strategies to improve infrared-absorption-based magnetometry and optical pumping schemes. The theoretical framework developed here is general and applicable to a variety of other spin defects and materials.

cond-mat.mtrl-sci↗

arXiv2021

Multiple Residual Dense Networks for Reconfigurable Intelligent Surfaces Cascaded Channel Estimation

Reconfigurable intelligent surface (RIS) constitutes an essential and promising paradigm that relies programmable wireless environment and provides capability for space-intensive communications, due to the use of low-cost massive reflecting elements over the entire surfaces of man-made structures. However, accurate channel estimation is a fundamental technical prerequisite to achieve the huge performance gains from RIS. By leveraging the low rank structure of RIS channels, three practical residual neural networks, named convolutional blind denoising network, convolutional denoising generative adversarial networks and multiple residual dense network, are proposed to obtain accurate channel state information, which can reflect the impact of different methods on the estimation performance. Simulation results reveal the evolution direction of these three methods and reveal their superior performance compared with existing benchmark schemes.

cs.IT↗

arXiv2021

Time-free solution to independent set problem using P systems with active membranes

Membrane computing is a branch of natural computingwhich abstracts fromthe structure and the functioning of living cells. The computation models obtained in the field of membrane computing are usually called P systems. P systems have been used to solve computationally hard problems efficiently on the assumption that the execution of each rule is completed in exactly one time-unit (a global clock is assumed for timing and synchronizing the execution of rules). However, in biological reality, different biological processes take different times to be completed, which can also be influenced by many environmental factors. In this work, with this biological reality, we give a time-free solution to independent set problemusing P systems with active membranes, which solve the problem independent of the execution time of the involved rules.

cs.CC↗

arXiv2021

Deep Learning-Based Power Control for Uplink Cell-Free Massive MIMO Systems

In this paper, a general framework for deep learning-based power control methods for max-min, max-product and max-sum-rate optimization in uplink cell-free massive multiple-input multiple-output (CF mMIMO) systems is proposed. Instead of using supervised learning, the proposed method relies on unsupervised learning, in which optimal power allocations are not required to be known, and thus has low training complexity. More specifically, a deep neural network (DNN) is trained to learn the map between fading coefficients and power coefficients within short time and with low computational complexity. It is interesting to note that the spectral efficiency of CF mMIMO systems with the proposed method outperforms previous optimization methods for max-min optimization and fits well for both max-sum-rate and max-product optimizations.

cs.IT↗

arXiv2021

Five-second coherence of a single spin with single-shot readout in silicon carbide

An outstanding hurdle for defect spin qubits in silicon carbide (SiC) is single-shot readout - a deterministic measurement of the quantum state. Here, we demonstrate single-shot readout of single defects in SiC via spin-to-charge conversion, whereby the defect's spin state is mapped onto a long-lived charge state. With this technique, we achieve over 80% readout fidelity without pre- or post-selection, resulting in a high signal-to-noise ratio (SNR) that enables us to measure long spin coherence times. Combined with pulsed dynamical decoupling sequences in an isotopically purified host material, we report single spin T2 > 5s, over two orders of magnitude greater than previously reported in this system. The mapping of these coherent spin states onto single charges unlocks both single-shot readout for scalable quantum nodes and opportunities for electrical readout via integration with semiconductor devices.

quant-ph↗

arXiv2021

Photoluminescence spectra of point defects in semiconductors: validation of first principles calculations

Optically and magnetically active point defects in semiconductors are interesting platforms for the development of solid-state quantum technologies. Their optical properties are usually probed by measuring photoluminescence spectra, which provide information on excitation energies and on the interaction of electrons with lattice vibrations. We present a combined computational and experimental study of photoluminescence spectra of defects in diamond and SiC, aimed at assessing the validity of theoretical and numerical approximations used in first principles calculations, including the use of the Franck-Condon principle and the displaced harmonic oscillator approximation. We focus on prototypical examples of solid-state qubits, the divacancy centers in SiC and the nitrogen-vacancy in diamond, and we report computed photoluminescence spectra as a function of temperature that are in very good agreement with the measured ones. As expected we find that the use of hybrid functionals leads to more accurate results than semilocal functionals. Interestingly our calculations show that constrained density functional theory (CDFT) and time-dependent hybrid DFT perform equally well in describing the excited state potential energy surface of triplet states; our findings indicate that CDFT, a relatively cheap computational approach, is sufficiently accurate for the calculations of photoluminescence spectra of the defects studied here. Finally, we find that only by correcting for finite-size effects and extrapolating to the dilute limit, one can obtain a good agreement between theory and experiment. Our results provide a detailed validation protocol of first principles calculations of photoluminescence spectra, necessary both for the interpretation of experiments and for robust predictions of the electronic properties of point defects in semiconductors.

cond-mat.mtrl-sci↗

arXiv2021

RIS-Aided Next-Generation High-Speed Train Communications: Challenges, Solutions, and Future Directions

High-speed train (HST) communication is a very challenging scenario in wireless communication systems due to its fast time-varying channels and significant penetration loss. Thanks to the low cost and smart channel reconfiguration ability, reconfigurable intelligent surface (RIS) has been proposed as a promising technology to solve the aforementioned challenges cost-effectively and to achieve high spectral and energy-efficiency in the next-generation HST communication systems. In this article, we first provide a novel RIS-aided HST wireless communication paradigm, including its main challenges and application scenarios. Then, we propose practical solutions are provided to realize efficient signal processing and resource management in the considered system. Finally, future directions of RIS-aided HST communication systems are pointed out to inspire further investigation in future work.

cs.IT↗

arXiv2021

Enhancing Population Persistence by a Protection Zone in a Reaction-Diffusion Model with Strong Allee Effect

Protecting endangered species has been an important issue in ecology. We derive a reaction-diffusion model for a population in a one-dimensional bounded habitat, where the population is subjected to a strong Allee effect in its natural domain but obeys a logistic growth in a protection zone. We establish the conditions for population persistence and extinction via the principal eigenvalue of an associated eigenvalue problem and investigate the dependence of this principal eigenvalue on the location (i.e., the starting point and the length) of the protection zone. The results are used to design the optimal protection zone under different boundary conditions, that is, to suggest the starting point and length of the protection zone with respect to different population growth rate in the protection zone, in order for the population to persist in a long term.

math.DS↗

arXiv2019

Graph Coarsening with Preserved Spectral Properties

Large-scale graphs are widely used to represent object relationships in many real world applications. The occurrence of large-scale graphs presents significant computational challenges to process, analyze, and extract information. Graph coarsening techniques are commonly used to reduce the computational load while attempting to maintain the basic structural properties of the original graph. As there is no consensus on the specific graph properties preserved by coarse graphs, how to measure the differences between original and coarse graphs remains a key challenge. In this work, we introduce a new perspective regarding the graph coarsening based on concepts from spectral graph theory. We propose and justify new distance functions that characterize the differences between original and coarse graphs. We show that the proposed spectral distance naturally captures the structural differences in the graph coarsening process. In addition, we provide efficient graph coarsening algorithms to generate graphs which provably preserve the spectral properties from original graphs. Experiments show that our proposed algorithms consistently achieve better results compared to previous graph coarsening methods on graph classification and block recovery tasks.

cs.SI↗

arXiv2019

Population dynamics in river networks

Natural rivers connect to each other to form networks. The geometric structure of a river network can significantly influence spatial dynamics of populations in the system. We consider a process-oriented model to describe population dynamics in river networks of trees, establish the fundamental theories of the corresponding parabolic problems and elliptic problems, derive the persistence threshold by using the principal eigenvalue of the eigenvalue problem, and define the net reproductive rate to describe population persistence or extinction. By virtue of numerical simulations, we investigate the effects of hydrological, physical, and biological factors, especially the structure of the river network, on population persistence.

math.AP↗

arXiv2018

Learning Graph-Level Representations with Recurrent Neural Networks

Recently a variety of methods have been developed to encode graphs into low-dimensional vectors that can be easily exploited by machine learning algorithms. The majority of these methods start by embedding the graph nodes into a low-dimensional vector space, followed by using some scheme to aggregate the node embeddings. In this work, we develop a new approach to learn graph-level representations, which includes a combination of unsupervised and supervised learning components. We start by learning a set of node representations in an unsupervised fashion. Graph nodes are mapped into node sequences sampled from random walk approaches approximated by the Gumbel-Softmax distribution. Recurrent neural network (RNN) units are modified to accommodate both the node representations as well as their neighborhood information. Experiments on standard graph classification benchmarks demonstrate that our proposed approach achieves superior or comparable performance relative to the state-of-the-art algorithms in terms of convergence speed and classification accuracy. We further illustrate the effectiveness of the different components used by our approach.

cs.LG↗

arXiv2018

A High Performance Implementation of Spectral Clustering on CPU-GPU Platforms

Spectral clustering is one of the most popular graph clustering algorithms, which achieves the best performance for many scientific and engineering applications. However, existing implementations in commonly used software platforms such as Matlab and Python do not scale well for many of the emerging Big Data applications. In this paper, we present a fast implementation of the spectral clustering algorithm on a CPU-GPU heterogeneous platform. Our implementation takes advantage of the computational power of the multi-core CPU and the massive multithreading and SIMD capabilities of GPUs. Given the input as data points in high dimensional space, we propose a parallel scheme to build a sparse similarity graph represented in a standard sparse representation format. Then we compute the smallest $k$ eigenvectors of the Laplacian matrix by utilizing the reverse communication interfaces of ARPACK software and cuSPARSE library, where $k$ is typically very large. Moreover, we implement a very fast parallelized $k$-means algorithm on GPUs. Our implementation is shown to be significantly faster compared to the best known Matlab and Python implementations for each step. In addition, our algorithm scales to problems with a very large number of clusters.

cs.DC↗

arXiv2018

A Data-Driven Approach to Extract Connectivity Structures from Diffusion Tensor Imaging Data

Diffusion Tensor Imaging (DTI) is an effective tool for the analysis of structural brain connectivity in normal development and in a broad range of brain disorders. However efforts to derive inherent characteristics of structural brain networks have been hampered by the very high dimensionality of the data, relatively small sample sizes, and the lack of widely acceptable connectivity-based regions of interests (ROIs). Typical approaches have focused either on regions defined by standard anatomical atlases that do not incorporate anatomical connectivity, or have been based on voxel-wise analysis, which results in loss of statistical power relative to structure-wise connectivity analysis. In this work, we propose a novel, computationally efficient iterative clustering method to generate connectivity-based whole-brain parcellations that converge to a stable parcellation in a few iterations. Our algorithm is based on a sparse representation of the whole brain connectivity matrix, which reduces the number of edges from around a half billion to a few million while incorporating the necessary spatial constraints. We show that the resulting regions in a sense capture the inherent connectivity information present in the data, and are stable with respect to initialization and the randomization scheme within the algorithm. These parcellations provide consistent structural regions across the subjects of population samples that are homogeneous with respect to anatomic connectivity. Our method also derives connectivity structures that can be used to distinguish between population samples with known different structural connectivity. In particular, new results in structural differences for different population samples such as Females vs Males, Normal Controls vs Schizophrenia, and different age groups in Normal Controls are also shown.

cs.CE↗

arXiv2016

Scalable Algorithms for Generating and Analyzing Structural Brain Networks with a Varying Number of Nodes

Diffusion Magnetic Resonance Imaging (MRI) exploits the anisotropic diffusion of water molecules in the brain to enable the estimation of the brain's anatomical fiber tracts at a relatively high resolution. In particular, tractographic methods can be used to generate whole-brain anatomical connectivity matrix where each element provides an estimate of the connectivity strength between the corresponding voxels. Structural brain networks are built using the connectivity information and a predefined brain parcellation, where the nodes of the network represent the brain regions and the edge weights capture the connectivity strengths between the corresponding brain regions. This paper introduces a number of novel scalable methods to generate and analyze structural brain networks with a varying number of nodes. In particular, we introduce a new parallel algorithm to quickly generate large scale connectivity-based parcellations for which voxels in a region possess highly similar connectivity patterns to the rest of the regions. We show that the corresponding regional structural consistency is always superior to randomly generated parcellations over a wide range of parcellation sizes. Corresponding brain networks with a varying number of nodes are analyzed using standard graph-theorectic measures, as well as, new measures derived from spectral graph theory. Our results indicate increasingly more statistical power of brain networks with larger numbers of nodes and the relatively unique shape of the spectral profile of large brain networks relative to other well-known networks.

cs.CE↗

arXiv2016

Influence of intrinsic decoherence on tripartite entanglement and bipartite fidelity of polar molecules in pendular states

An array of ultracold polar molecules trapped in an external electric field is regarded as a promising carrier of quantum information. Under the action of this field, molecules are compelled to undergo pendular oscillations by the Stark effect. Particular attention has been paid to the influence of intrinsic decoherence on the model of linear polar molecular pendular states, thereby we evaluate the tripartite entanglement with negativity, as well as fidelity of bipartite quantum systems for input and output signals using electric dipole moments of polar molecules as qubits. According to this study, we consider three typical initial states for both systems respectively, and investigate the temporal evolution with variable values of the external field intensity, the intrinsic decoherence factor and the dipole-dipole interaction. Thus we demonstrate the sound selection of these three main parameters to obtain the best entanglement degree and fidelity.

quant-ph↗