Searcharxiv⌕ Search

arXiv subjects

Kun Yang

Publications and source records attributed to Kun Yang.

At least 199 records · Page 11Linked to original sources

Substrate-mediated Borophane Polymorphs through Hydrogenation of Two-dimensional Boron Sheets

Two-dimensional boron monolayer (borophene) stands out from the two-dimensional atomic layered materials due to its structural flexibility, tunable electronic and mechanical properties from a large number of allotropic materials. The stability of pristine borophene polymorphs could possibly be improved via hydrogenation with atomic hydrogen (referred to as borophane). However, the precise adsorption structures and the underlying mechanism are still elusive. Employing first-principles calculations, we demonstrate the optimal configurations of freestanding borophanes and the ones grown on metallic substrates. For freestanding β12 and χ3 borophenes, the energetically favored hydrogen adsorption sites are on the top of the boron atoms with CN=4 (CN: coordination number), while the best absorption sites for α' borophene are on the top of the boron atoms with CN=6. With various metal substrates, the hydrogenation configurations of borophene are modulated significantly, attributed to the chemical hybridization strength between B pz and H s orbitals. These findings provide a deep insight into the hydrogenating borophenes and facilitate the stabilization of two-dimensional boron polymorphs by engineering hydrogen adsorption sites and concentrations.

cond-mat.mtrl-sci↗

Multi-critical point and unified description of broken-symmetry phases in spin-1/2 anti-ferromagnets on a square lattice

We show that several distinct broken-symmetry phases in a spin-1/2 anti-ferromagnet on a square lattice with easy-plane anisotropy, including valence bond solid, chiral spin liquid, and the XY-ordered state, can all be accessed by perturbing a multi-critical point with two massless Dirac fermions coupled to a level-one Chern-Simons gauge field. This allows for a unified description of these phases, as well as the phase transitions between them. In a specific phase transition our analysis provide a lattice realization of one of the recently proposed fermion-boson duality, thus lending support to it. We also briefly discuss the relation between our work and the long-sought de-confined criticality in such systems.

cond-mat.str-el↗

Distribution of dust ejected from the lunar surface into the Earth-Moon system

Aims. An asymmetric dust cloud was detected around the Moon by the Lunar Dust Experiment on board the Lunar Atmosphere and Dust Environment Explorer mission. We investigate the dynamics of the grains that escape the Moon and their configuration in the Earth-Moon system. Methods. We use a plausible initial ejecta distribution and mass production rate for the ejected dust. Various forces, including the solar radiation pressure and the gravity of the Moon, Earth, and Sun, are considered in the dynamical model, and direct numerical integrations of trajectories of dust particles are performed. The final states, the average life spans, and the fraction of retrograde grains as functions of particle size are computed. The number density distribution in the Earth-Moon system is obtained through long-term simulations. Results. The average life spans depend on the size of dust particles and show a rapid increase in the size range between $1\, \mathrm{μm}$ and $10\, \mathrm{μm}$. About ${3.6\times10^{-3}\,\mathrm{kg/s}}$ ($\sim2\%$) particles ejected from the lunar surface escape the gravity of the Moon, and they form an asymmetric torus between the Earth and the Moon in the range $[10\,R_\mathrm{E},50\,R_\mathrm{E}]$, which is offset toward the direction of the Sun. A considerable number of retrograde particles occur in the Earth-Moon system.

astro-ph.EP↗

Joint Program Partitioning and Resource Allocation for Completion Time Minimization in Multi-MEC Systems

This paper considers a practical mobile edge computing (MEC) system, where edge server does not pre-install the program required to perform user offloaded computing tasks. A partial program offloading (PPO) scheme is proposed, which can divide a user program into two parts, where the first part is executed by the user itself and the second part is transferred to an edge server for remote execution. However, the execution of the latter part requires the results of the previous part (called intermediate result) as the input. We aim to minimize the overall time consumption of a multi-server MEC system to complete all user offloaded tasks. It is modeled as a mixed integer nonlinear programming (MINLP) problem which considers user-and-server association, program partitioning, and communication resource allocation in a joint manner. An effective algorithm is developed to solve the problem by exploiting its structural features. First, the task completion time of a single server is minimized given the computing workload and available resource. Then, the working time of the edge servers are balanced by updating user-and-server association and communication resource allocation. Numerical results show that significant performance improvement can be achieved by the proposed scheme.

cs.NI↗

Simple analog of the black-hole information paradox in quantum Hall interfaces

The black hole information paradox has been hotly debated for the last few decades, without full resolution. This makes it desirable to find analogs of this paradox in simple and experimentally accessible systems, whose resolutions may shed light on this long-standing and fundamental problem. Here we identify and resolve an apparent "information paradox" in a quantum Hall interface between the Halperin-331 and Pfaffian states. Information carried by the pseudospin degree of freedom of the Abelian 331 quasiparticles gets scrambled when they cross the interface to enter non-Abelian Pfaffian state, and becomes inaccessible to local measurements; in this sense the Pfaffian region is an analog of black hole interior while the interface plays a role similar to its horizon. We demonstrate that the "lost" information gets recovered once the "black hole" evaporates and the quasiparticles return to the 331 region, albeit in a highly entangled form. Such recovery is quantified by the Page curve of the entropy carried by these quasiparticles, which are analogs of Hawking radiation.

cond-mat.mes-hall↗

Quantitative theory of composite fermions in Bose-Fermi mixtures at $ν=1$

Composite fermions provide a simple and unified picture to understand a vast amount of phenomenology in the quantum Hall regime. However it has remained challenging to formulate this concept properly within a single Landau level. Recently a low-energy noncommutative field theory for bosons at Landau-level filling factor $ν=1$ has been formulated by Dong and Senthil. In the limit of long-wavelength and small-amplitude gauge fluctuation, they found it reduces to the celebrated Halperin-Lee-Read theory of composite fermion liquid. In this work we consider a Bose-Fermi mixture at total filling factor $ν=1$. Different from previous work, the number density of composite fermions in the mixture and corresponding Fermi momentum can be tuned by changing the filling factor of bosons, $ν_b = 1 -ν_f$. This tunability enables us to study the dilute limit $ν_b\ll 1$, which allows for a controlled and asymptotically exact calculation of the energy dispersion and effective mass of composite fermions. Furthermore, the approximation of the low-energy description by a commutative field theory is manifestly justified. Most importantly, we demonstrate gauge fluctuations acquire a Higgs mass due to the presence of a composite boson condensate, as a result of which the system behaves like a genuine Landau Fermi liquid. Combined with the irrelevance of four-fermion interaction in the dilute limit, we are able to obtain asymptotically exact properties of this composite fermion Fermi liquid. In the opposite limit of $ν_f\ll 1$, the Higgs mass goes to zero and we find crossover between Fermi liquid and non-Fermi liquid as temperature increases. Observing these properties either experimentally or numerically provides unambiguous evidence of not only the composite fermions and the Fermi surface they form, but also the presence of emergent gauge fields and their fluctuations due to strong correlation.

cond-mat.str-el↗

End-to-End Jet Classification of Boosted Top Quarks with the CMS Open Data

We describe a novel application of the end-to-end deep learning technique to the task of discriminating top quark-initiated jets from those originating from the hadronization of a light quark or a gluon. The end-to-end deep learning technique combines deep learning algorithms and low-level detector representation of the high-energy collision event. In this study, we use low-level detector information from the simulated CMS Open Data samples to construct the top jet classifiers. To optimize classifier performance we progressively add low-level information from the CMS tracking detector, including pixel detector reconstructed hits and impact parameters, and demonstrate the value of additional tracking information even when no new spatial structures are added. Relying only on calorimeter energy deposits and reconstructed pixel detector hits, the end-to-end classifier achieves an AUC score of 0.975$\pm$0.002 for the task of classifying boosted top quark jets. After adding derived track quantities, the classifier AUC score increases to 0.9824$\pm$0.0013, serving as the first performance benchmark for these CMS Open Data samples. We additionally provide a timing performance comparison of different processor unit architectures for training the network.

physics.data-an↗

Matching-Theory-Based Multi-User Cooperative Computing Framework

In this paper, we propose a matching theory based multi-user cooperative computing (MUCC) scheme to minimize the overall energy consumption of a group of user equipments (UEs), where the UEs can be classified into the following roles: resource demander (RD), resource provider (RP), and standalone UE (SU). We first determine the role of each UE by leveraging the roommate matching method. Then, we propose the college admission based algorithm to divide the UEs into multiple cooperation groups, each consisting of one RP and multiple RDs. Next, we propose the rotation swap operation to further improve the performance without deteriorating the system stability. Finally, we present an effective task offloading algorithm to minimize the energy consumption of all the cooperation groups. The simulation results verify the effectiveness of the proposed scheme.

cs.GT↗

Multiple Magnetorotons and Spectral Sum Rules in Fractional Quantum Hall Systems

We study numerically the the charge neutral excitations (magnetorotons) in fractional quantum Hall systems, concentrating on the two Jain states near quarter filling, $ν=2/7$ and $ν=2/9$, and the $ν=1/4$ Fermi-liquid state itself. In contrast to the $ν=1/3$ states and the Jain states near half filling, on each of the two Jain states $ν=2/7$ and $ν=2/9$ the graviton spectral densities show two, instead of one, magnetoroton peaks. The magnetorotons have spin 2 and have opposite chiralities in the $ν=2/7$ state and the same chirality in the $ν=2/9$ state. We also provide a numerical verification of a sum rule relating the guiding center spin $\bar s$ with the spectral densities of the stress tensor

cond-mat.str-el↗

Dynamics of Quantum Hall Interfaces

A quantum Hall (QH) interface is different from an ordinary QH edge, as the latter has its location determined by the confining potential, while the former can be unpinned and behave like a free string. In this paper, we demonstrate this difference by studying three different interfaces formed by (i) the Laughlin state and the vacuum, (ii) the Pfaffian state and the vacuum, and (iii) the Pfaffian and the anti-Pfaffian states. We find that string-like interfaces propagating freely in the QH system lead to very different dynamical properties from edges. This qualitative difference gives rise to fascinating new physics and suggests a new direction in future research on QH physics. We also discuss briefly possible analogies between QH interfaces and concepts in string theory.

cond-mat.mes-hall↗

Multiple Intelligent Reflecting Surfaces Assisted Cell-Free MIMO Communications

In this paper, we investigate an intelligent reflecting surface (IRS) assisted cell-free multiple input multiple output (MIMO) communication system, where distributed multiple IRSs are dedicated deployed to assist distributed multiple base stations (BSs) for cooperative transmission. Our objective is to maximize the achievable sum-rate of the cell-free system by jointly optimizing the active transmit beamforming matrices at BSs and the passive reflecting beamforming matrices at IRSs, while the constraints on the maximum transmit power of each BS and the phase shift of each IRS element are satisfied. We propose an efficient framework to jointly design the BSs, the IRSs, and the user equipment (UEs). As a compromise approach, we first transform the non-convex problem into an equivalent form based on the fractional programming methods and then decompose the reformulated problem into two subproblems and solve them alternately. Particularly, we propose a Lagrangian dual sub-gradient based algorithm to solve the subproblem of optimizing the active transmit beamforming with nearly closed-form solutions. We reformulate the subproblem of optimizing the passive reflecting beamforming as a constant modulus constrained quadratic programming (CMC-QP) problem. We first provide two feasible solutions by proposing a pair of relaxation-based algorithms. We also develop a low-complexity alternating sequential optimization (ASO) algorithm to obtain closed-form solutions. All three algorithms are guaranteed to converge to locally optimal solutions. Simulation results demonstrate that the proposed algorithms achieve considerable performance improvements compared with the benchmark schemes.

cs.IT↗

Multi-User Cooperative Computation Framework Based on Bertrand Game

In this paper, a multi-user cooperative computing framework is applied to enable mobile users to utilize available computing resources from other neighboring users via direct communication links. An incentive scheme based on Bertrand game is proposed for the user to determine \textit{who} and \textit{how} to cooperate. We model the resource demand users as \textit{buyers} who aim to use minimal payments to maximize energy savings, whereas resource supply users as \textit{sellers} who aim to earn payments for their computing resource provision. A Bertrand game against \textit{buyer's market} is formulated. When the users have \textit{complete information} of their opponents, the Nash equilibrium (NE) of the game is obtained in closed form, while in the case of \textit{incomplete information}, a distributed iterative algorithm is proposed to find the NE. The simulation results verify the effectiveness of the proposed scheme.

cs.GT↗

QuatDE: Dynamic Quaternion Embedding for Knowledge Graph Completion

Knowledge graph embedding has been an active research topic for knowledge base completion (KGC), with progressive improvement from the initial TransE, TransH, RotatE et al to the current state-of-the-art QuatE. However, QuatE ignores the multi-faceted nature of the entity and the complexity of the relation, only using rigorous operation on quaternion space to capture the interaction between entitiy pair and relation, leaving opportunities for better knowledge representation which will finally help KGC. In this paper, we propose a novel model, QuatDE, with a dynamic mapping strategy to explicitly capture the variety of relational patterns and separate different semantic information of the entity, using transition vectors to adjust the point position of the entity embedding vectors in the quaternion space via Hamilton product, enhancing the feature interaction capability between elements of the triplet. Experiment results show QuatDE achieves state-of-the-art performance on three well-established knowledge graph completion benchmarks. In particular, the MR evaluation has relatively increased by 26% on WN18 and 15% on WN18RR, which proves the generalization of QuatDE.

cs.CL↗

Feature Extraction for Novelty Detection in Network Traffic

Data representation plays a critical role in the performance of novelty detection (or ``anomaly detection'') methods in machine learning. The data representation of network traffic often determines the effectiveness of these models as much as the model itself. The wide range of novel events that network operators need to detect (e.g., attacks, malware, new applications, changes in traffic demands) introduces the possibility for a broad range of possible models and data representations. In each scenario, practitioners must spend significant effort extracting and engineering features that are most predictive for that situation or application. While anomaly detection is well-studied in computer networking, much existing work develops specific models that presume a particular representation -- often IPFIX/NetFlow. Yet, other representations may result in higher model accuracy, and the rise of programmable networks now makes it more practical to explore a broader range of representations. To facilitate such exploration, we develop a systematic framework, open-source toolkit, and public Python library that makes it both possible and easy to extract and generate features from network traffic and perform and end-to-end evaluation of these representations across most prevalent modern novelty detection models. We first develop and publicly release an open-source tool, an accompanying Python library (NetML), and end-to-end pipeline for novelty detection in network traffic. Second, we apply this tool to five different novelty detection problems in networking, across a range of scenarios from attack detection to novel device detection. Our findings general insights and guidelines concerning which features appear to be more appropriate for particular situations.

cs.NI↗

A Joint Power Splitting, Active and Passive Beamforming Optimization Framework for IRS Assisted MIMO SWIPT System

This paper considers an intelligent reflecting surface (IRS) assisted multi-input multi-output (MIMO) power splitting (PS) based simultaneous wireless information and power transfer (SWIPT) system with multiple PS receivers (PSRs). The objective is to maximize the achievable data rate of the system by jointly optimizing the PS ratios at the PSRs, the active transmit beamforming (ATB) at the access point (AP), and the passive reflective beamforming (PRB) at the IRS, while the constraints on maximum transmission power at the AP, the reflective phase shift of each element at the IRS, the individual minimum harvested energy requirement of each PSR, and the domain of PS ratio of each PSR are all satisfied. For this unsolved problem, however, since the optimization variables are intricately coupled and the constraints are conflicting, the formulated problem is non-convex, and cannot be addressed by employing exist approaches directly. To this end, we propose a joint optimization framework to solve this problem. Particularly, we reformulate it as an equivalent form by employing the Lagrangian dual transform and the fractional programming transform, and decompose the transformed problem into several sub-problems. Then, we propose an alternate optimization algorithm by capitalizing on the dual sub-gradient method, the successive convex approximation method, and the penalty-based majorization-minimization approach, to solve the sub-problems iteratively, and obtain the optimal solutions in nearly closed-forms. Numerical simulation results verify the effectiveness of the IRS in SWIPT system and indicate that the proposed algorithm offers a substantial performance gain.

cs.IT↗

Realization of supersymmetry and its spontaneous breaking in quantum Hall edges

Supersymmetry (SUSY) relating bosons and fermions plays an important role in unifying different fundamental interactions in particle physics. Since no superpartners of elementary particles have been observed, SUSY, if present, must be broken at low-energy. This makes it important to understand how SUSY is realized and broken, and study their consequences. We show that an $\mathcal{N}=(1,0)$ SUSY, arguably the simplest type, can be realized at the edge of the Moore-Read quantum Hall state. Depending on the absence or presence of edge reconstruction, both SUSY-preserving and SUSY broken phases can be realized in the same system, allowing for their unified description. The significance of the gapless fermionic Goldstino mode in the SUSY broken phase is discussed.

cond-mat.mes-hall↗

The diverse nature of small-scale turbulence

The self-similar Richardson cascade admits two logically possible scenarios of small-scale turbulence at high Reynolds numbers. In the first scenario, eddies' population densities vary as a function of eddies' scales. As a result, one or a few eddy types dominate at small scales, and small-scale turbulence lacks diversity. In the second scenario, eddies' population densities are scale-invariant across the inertial range, resulting in small-scale diversity. That is, there are as many types of eddies at the small scales as at the large scales. In this letter, we measure eddies' population densities in three-dimensional isotropic turbulence and determine the nature of small-scale turbulence. The result shows that eddies' population densities are scale-invariant.

physics.flu-dyn↗

Connecting AI Learning and Blockchain Mining in 6G Systems

The sixth generation (6G) systems are generally recognized to be established on ubiquitous Artificial Intelligence (AI) and distributed ledger such as blockchain. However, the AI training demands tremendous computing resource, which is limited in most 6G devices. Meanwhile, miners in Proof-of-Work (PoW) based blockchains devote massive computing power to block mining, and are widely criticized for the waste of computation. To address this dilemma, we propose an Evolved-Proof-of-Work (E-PoW) consensus that can integrate the matrix computations, which are widely existed in AI training, into the process of brute-force searches in the block mining. Consequently, E-PoW can connect AI learning and block mining via the multiply used common computing resource. Experimental results show that E-PoW can salvage by up to 80 percent computing power from pure block mining for parallel AI training in 6G systems.

cs.DC↗