Searcharxiv⌕ Search

arXiv subjects

Yu Yang

Publications and source records attributed to Yu Yang.

At least 289 records · Page 16Linked to original sources

Network Transplanting

This paper focuses on a new task, i.e., transplanting a category-and-task-specific neural network to a generic, modular network without strong supervision. We design an functionally interpretable structure for the generic network. Like building LEGO blocks, we teach the generic network a new category by directly transplanting the module corresponding to the category from a pre-trained network with a few or even without sample annotations. Our method incrementally adds new categories to the generic network but does not affect representations of existing categories. In this way, our method breaks the typical bottleneck of learning a net for massive tasks and categories, i.e. the requirement of collecting samples for all tasks and categories at the same time before the learning begins. Thus, we use a new distillation algorithm, namely back-distillation, to overcome specific challenges of network transplanting. Our method without training samples even outperformed the baseline with 100 training samples.

cs.LG↗

Eddy-current imaging with nitrogen-vacancy centers in diamond

We demonstrate microwave-free eddy-current imaging using nitrogen-vacancy centers in diamond. By detecting the eddy-current induced magnetic field of conductive samples, we can distinguish between different materials and shapes and identify structural defects. Our technique allows for the discrimination of different materials according to their conductivity. The sensitivity of the measurements is calculated as 8$\times 10 ^{5}$\,S/m\,$\sqrt[]{\textrm{Hz}}$ at 3.5\,MHz, for a cylindrical sample with radius $r_0$\,=\,1\,mm and height $h$\,=\,0.1\,mm (volume $\sim$\,0.3\,mm$^3$), at a distance of 0.5\,mm. In comparison with existing technologies, the diamond-based device exhibits a superior bandwidth and spatial resolution. In particular, we demonstrate a flat frequency response from DC to 3.5 MHz and a spatial resolution of 348\,$\pm$\,2\,$μ$m.

quant-ph↗

The positive partial transpose conjecture for n=3

We present the PPT square conjecture introduced by M. Christandl. We prove the conjecture in the case $n=3$ as a consequence of the fact that two-qutrit PPT states have Schmidt at most two. Our result in Lemma 3 is independent from the proof found Müller-Hermes. Müller-Hermes announced that this conjecture is true for the states on $\mathbb{C}_3\otimes\mathbb{C}_3$ \cite{hermes} recently. The PPT square conjecture in the case $n\ge4$ is still open.

quant-ph↗

Slender Origami with Complex 3D Folding Shapes

One-dimensional slender bodies can be deformed or shaped into spatially complex curves relatively easily due to their inherent compliance. However, traditional methods of fabricating complex spatial shapes are cumbersome, prone to error accumulation and not amenable to elegant programmability. In this letter, we introduce a one-dimensional origami based on attaching Miura-ori that can fold into various programmed two or three-dimensional shapes. We study the out-of-plane displacement characteristics of this origami and demonstrate with examples, design of slender bodies that conform to programmed complex spatial curves. Our study provides a new, accurate, and single actuation solution of shape programmability.

physics.app-ph↗

Unsupervised Learning of Neural Networks to Explain Neural Networks

This paper presents an unsupervised method to learn a neural network, namely an explainer, to interpret a pre-trained convolutional neural network (CNN), i.e., explaining knowledge representations hidden in middle conv-layers of the CNN. Given feature maps of a certain conv-layer of the CNN, the explainer performs like an auto-encoder, which first disentangles the feature maps into object-part features and then inverts object-part features back to features of higher conv-layers of the CNN. More specifically, the explainer contains interpretable conv-layers, where each filter disentangles the representation of a specific object part from chaotic input feature maps. As a paraphrase of CNN features, the disentangled representations of object parts help people understand the logic inside the CNN. We also learn the explainer to use object-part features to reconstruct features of higher CNN layers, in order to minimize loss of information during the feature disentanglement. More crucially, we learn the explainer via network distillation without using any annotations of sample labels, object parts, or textures for supervision. We have applied our method to different types of CNNs for evaluation, and explainers have significantly boosted the interpretability of CNN features.

cs.CV↗

Mesoscopic magnetic resonance spectroscopy with a remote spin sensor

Quantum sensing based on nitrogen-vacancy (NV) centers in diamond has been developed as a powerful tool for microscopic magnetic resonance. However, the reported sensor-to-sample distance is limited within tens of nanometers because the signal of spin fluctuation decreases cubically with the increasing distance. Here we extend the sensing distance to tens of micrometers by detecting spin polarization rather than spin fluctuation. We detected the mesoscopic magnetic resonance spectra of polarized electrons of a pentacene-doped crystal, measured its two typical decay times and observed the optically enhanced spin polarization. This work paves the way for the NV-based mesoscopic magnetic resonance spectroscopy and imaging at ambient conditions.

quant-ph↗

Spontaneous Repairing Liquid Metal/Si Nanocomposite as a Smart Conductive-Additive-Free Anode for Lithium-ion Battery

Silicon is a promising candidate for negative electrodes due to its high theoretical specific capacity (~3579 mAh g-1) and low lithiation potential (~0.40 V vs Li). However, its practical applications in battery have been inhibited by the large volume change (~400%) induced by Li+-insertion into Si lattices. Here, we attempt to resolve this issue at a fundamental level, and report for the first time a novel liquid metal (LM)-mediated spontaneous repairing conductive-additive-free Si anode for Li-ion battery. The fluidity of LM ensures the eternal contact between Si and the conducting-network during its repeated electrochemical reactions. The as-prepared nano-composite of LM/Si leads to superior performances as characterized by high capacity utilization (2300 mAh g-1 at 500 mA g-1), long-term stability (968 mAh g-1 after 1500 charge-discharge cycles at 8 A g-1 with 81.3% retention), high rate capability (360 mAh g-1 at 20 A g-1, equivalence of 55 C, or full charge/discharge in 65 seconds), and, in particular, an extra-ordinarily high initial coulombic efficiency (95.92%), which is not only the highest reported for Si to the best of our knowledge, but also higher than the mature graphitic carbon anodes. The unique approach described in this work not only resolves the basic stress challenges faced by the promising but often problematic alloy-type materials; in broader context it also provides a universal inspiration to all electrode materials whose electric properties suffer from extreme mechanic upheavals induced by the electrochemical strains during the cell reactions.

physics.app-ph↗

Tracking Top-K Influential Vertices in Dynamic Networks

Influence propagation in networks has enjoyed fruitful applications and has been extensively studied in literature. However, only very limited preliminary studies tackled the challenges in handling highly dynamic changes in real networks. In this paper, we tackle the problem of tracking top-$k$ influential vertices in dynamic networks, where the dynamic changes are modeled as a stream of edge weight updates. Under the popularly adopted linear threshold (LT) model and the independent cascade (IC) model, we address two essential versions of the problem: tracking the top-$k$ influential individuals and finding the best $k$-seed set to maximize the influence spread (Influence Maximization). We adopt the polling-based method and maintain a sample of random RR sets so that we can approximate the influence of vertices with provable quality guarantees. It is known that updating RR sets over dynamic changes of a network can be easily done by a reservoir sampling method, so the key challenge is to efficiently decide how many RR sets are needed to achieve good quality guarantees. We use two simple signals, which both can be accessed in $O(1)$ time, to decide a proper number of RR sets. We prove the effectiveness of our methods. For both tasks the error incurred in our method is only a multiplicative factor to the ground truth. For influence maximization, we also propose an efficient query algorithm for finding the $k$ seeds, which is one order of magnitude faster than the state-of-the-art query algorithm in practice. In addition to the thorough theoretical results, our experimental results on large real networks clearly demonstrate the effectiveness and efficiency of our algorithms.

cs.SI↗

Mining Density Contrast Subgraphs

Dense subgraph discovery is a key primitive in many graph mining applications, such as detecting communities in social networks and mining gene correlation from biological data. Most studies on dense subgraph mining only deal with one graph. However, in many applications, we have more than one graph describing relations among a same group of entities. In this paper, given two graphs sharing the same set of vertices, we investigate the problem of detecting subgraphs that contrast the most with respect to density. We call such subgraphs Density Contrast Subgraphs, or DCS in short. Two widely used graph density measures, average degree and graph affinity, are considered. For both density measures, mining DCS is equivalent to mining the densest subgraph from a "difference" graph, which may have both positive and negative edge weights. Due to the existence of negative edge weights, existing dense subgraph detection algorithms cannot identify the subgraph we need. We prove the computational hardness of mining DCS under the two graph density measures and develop efficient algorithms to find DCS. We also conduct extensive experiments on several real-world datasets to evaluate our algorithms. The experimental results show that our algorithms are both effective and efficient.

cs.SI↗

Mapping electronic states of dual-parallel and symmetric zigzag grain boundaries of graphene on highly oriented pyrolytic graphite

The grain boundaries (GBs) of a graphene surface were extensively studied because GBs with specific defect configurations result in the formation of new curved structures, which can be treated as new carbon allotropes. We studied the structures and electronic spectra of two periodic GBs in graphene on highly oriented pyrolytic graphite (HOPG) surfaces using scanning tunneling microscopy and spectroscopy (STM/S). Our results demonstrated that a GB consisting of dual parallel periodic dislocation cores of pentagonal-heptagonal (5-7) carbon rings gives rise to an enhanced localized state at 0.45 eV above the Dirac point in graphene surfaces, which is attributed to van Hove singularities (VHSs). Moreover, the energy positions of the localized states are varied between 0.40 and 0.47 eV depending on the site and eventually decayed to 0.36 eV. The variation of the energy positions is induced by two parallel GBs because of the higher electron density at the GB as a defect center and the lower electron away from the GB. Another periodic GB with a symmetric zigzag structural feature induced VHSs at -0.038 and 0.12 eV near the Fermi level. Moreover, intervalley scattering was observed on both these GBs. This means that carrier concentration and thus, the conductance around the periodic GBs can be significantly enhanced by localized density of states. This finding suggests that graphene with a properly embedded ordered GB is promising for improving the performance of graphene-based electronic devices.

cond-mat.mtrl-sci↗

Tracking Influential Nodes in Dynamic Networks

In this paper, we tackle a challenging problem inherent in a series of applications: tracking the influential nodes in dynamic networks. Specifically, we model a dynamic network as a stream of edge weight updates. This general model embraces many practical scenarios as special cases, such as edge and node insertions, deletions as well as evolving weighted graphs. Under the popularly adopted linear threshold model and independent cascade model, we consider two essential versions of the problem: finding the nodes whose influences passing a user specified threshold and finding the top-$k$ most influential nodes. Our key idea is to use the polling-based methods and maintain a sample of random RR sets so that we can approximate the influence of nodes with provable quality guarantees. We develop an efficient algorithm that incrementally updates the sample random RR sets against network changes. We also design methods to determine the proper sample sizes for the two versions of the problem so that we can provide strong quality guarantees and, at the same time, be efficient in both space and time. In addition to the thorough theoretical results, our experimental results on $5$ real network data sets clearly demonstrate the effectiveness and efficiency of our algorithms.

cs.SI↗

Activity Maximization by Effective Information Diffusion in Social Networks

In a social network, even about the same information the excitements between different pairs of users are different. If you want to spread a piece of new information and maximize the expected total amount of excitements, which seed users should you choose? This problem indeed is substantially different from the renowned influence maximization problem and cannot be tackled using the existing approaches. In this paper, motivated by the demand in a few interesting applications, we model the novel problem of activity maximization. We tackle the problem systematically. We first analyze the complexity and the approximability of the problem. We develop an upper bound and a lower bound that are submodular so that the Sandwich framework can be applied. We then devise a polling-based randomized algorithm that guarantees a data dependent approximation factor. Our experiments on three real data sets clearly verify the effectiveness and scalability of our method, as well as the advantage of our method against the other heuristic methods.

cs.SI↗

Schmidt number of bipartite and multipartite states under local projections

The Schmidt number is a fundamental parameter characterizing the properties of quantum states, and the local projections are a fundamental operation in quantum physics. We investigate the relation between the Schmidt numbers of bipartite states and their projected states. We show that there exist bipartite positive-partial-transpose (PPT) entangled states of any given Schmidt number. We further construct the notion of joint Schmidt number for multipartite states, and its relation with the Schmidt number of bipartite reduced density operators.

quant-ph↗

Maximum atom-bond connectivity index with given graph parameters

The atom-bond connectivity (ABC) index is a degree-based topological index. It was introduced due to its applications in modeling the properties of certain molecular structures and has been since extensively studied. In this note, we examine the influence on the extremal values of the ABC index by various graph parameters. More specifically, we consider the maximum ABC index of connected graphs of given order, with fixed independence number, number of pendent vertices, chromatic number and edge-connectivity respectively. We provide characterizations of extremal structures as well as some conjectures. Numerical analysis of the extremal values are also presented.

math.CO↗

All 2-positive linear maps from M3 to M3 are decomposable

Following an idea of Choi, we obtain a decomposition theorem for k-positive linear maps from Mm to Mn, where 2<=k<min{m,n}. As a consequence, we give an affirmative answer to Kye's conjecture (also solved independently by Choi) that every 2-positive linear map from M3 to M3 is decomposable.

math-ph↗

Randomized Algorithms For High Quality Treatment Planning in Volumetric Modulated Arc Therapy

In recent years, volumetric modulated arc therapy (VMAT) has been becoming a more and more important radiation technique widely used in clinical application for cancer treatment. One of the key problems in VMAT is treatment plan optimization, which is complicated due to the constraints imposed by the involved equipments. In this paper, we consider a model with four major constraints: the bound on the beam intensity, an upper bound on the rate of the change of the beam intensity, the moving speed of leaves of the multi-leaf collimator (MLC) and its directional-convexity. We solve the model by a two-stage algorithm: performing minimization with respect to the shapes of the aperture and the beam intensities alternatively. Specifically, the shapes of the aperture are obtained by a greedy algorithm whose performance is enhanced by random sampling in the leaf pairs with a decremental rate. The beam intensity is optimized using a gradient projection method with non-monotonic line search. We further improve the proposed algorithm by an incremental random importance sampling of the voxels to reduce the computational cost of the energy functional. Numerical simulations on two clinical cancer date sets demonstrate that our method is highly competitive to the state-of-the-art algorithms in terms of both computational time and quality of treatment planning.

physics.med-ph↗

In-Network Neighborhood-Based Node Similarity Measure: A Unified Parametric Model

In many applications, we need to measure similarity between nodes in a large network based on features of their neighborhoods. Although in-network node similarity based on proximity has been well investigated, surprisingly, measuring in-network node similarity based on neighborhoods remains a largely untouched problem in literature. One grand challenge is that in different applications we may need different measurements that manifest different meanings of similarity. In this paper, we investigate the problem in a principled and systematic manner. We develop a unified parametric model and a series of four instance measures. Those instance similarity measures not only address a spectrum of various meanings of similarity, but also present a series of tradeoffs between computational cost and strictness of matching between neighborhoods of nodes being compared. By extensive experiments and case studies, we demonstrate the effectiveness of the proposed model and its instances.

cs.SI↗