Searcharxiv⌕ Search

arXiv subjects

Ying Zhang

Publications and source records attributed to Ying Zhang.

At least 433 records · Page 24Linked to original sources

Model-based 3D Hand Reconstruction via Self-Supervised Learning

Reconstructing a 3D hand from a single-view RGB image is challenging due to various hand configurations and depth ambiguity. To reliably reconstruct a 3D hand from a monocular image, most state-of-the-art methods heavily rely on 3D annotations at the training stage, but obtaining 3D annotations is expensive. To alleviate reliance on labeled training data, we propose S2HAND, a self-supervised 3D hand reconstruction network that can jointly estimate pose, shape, texture, and the camera viewpoint. Specifically, we obtain geometric cues from the input image through easily accessible 2D detected keypoints. To learn an accurate hand reconstruction model from these noisy geometric cues, we utilize the consistency between 2D and 3D representations and propose a set of novel losses to rationalize outputs of the neural network. For the first time, we demonstrate the feasibility of training an accurate 3D hand reconstruction network without relying on manual annotations. Our experiments show that the proposed method achieves comparable performance with recent fully-supervised methods while using fewer supervision data.

cs.CV↗

Quantifying measurement-induced nonbilocal correlation

In the paper, we devote to defining an available measure to quantify the nonbilocal correlation in the entanglement-swapping experiment. Then we obtain analytical formulas to calculate the quantifier when the inputs are pure states. For the case of mixed inputs, we discuss the computational properties of the quantifier. Finally, we derive a tight upper bound to the nonbilocality quantifier.

quant-ph↗

Adaptive Load Shedding for Grid Emergency Control via Deep Reinforcement Learning

Emergency control, typically such as under-voltage load shedding (UVLS), is broadly used to grapple with low voltage and voltage instability issues in practical power systems under contingencies. However, existing emergency control schemes are rule-based and cannot be adaptively applied to uncertain and floating operating conditions. This paper proposes an adaptive UVLS algorithm for emergency control via deep reinforcement learning (DRL) and expert systems. We first construct dynamic components for picturing the power system operation as the environment. The transient voltage recovery criteria, which poses time-varying requirements to UVLS, is integrated into the states and reward function to advise the learning of deep neural networks. The proposed approach has no tuning issue of coefficients in reward functions, and this issue was regarded as a deficiency in the existing DRL-based algorithms. Extensive case studies illustrate that the proposed method outperforms the traditional UVLS relay in both the timeliness and efficacy for emergency control.

eess.SY↗

Data-Driven Vulnerability Detection and Repair in Java Code

Java platform provides various APIs to facilitate secure coding. However, correctly using security APIs is usually challenging for developers who lack cybersecurity training. Prior work shows that many developers misuse security APIs; such misuses can introduce vulnerabilities into software, void security protections, and present security exploits to hackers. To eliminate such API-related vulnerabilities, this paper presents SEADER -- our new approach that detects and repairs security API misuses. Given an exemplar, insecure code snippet, and its secure counterpart, SEADER compares the snippets and conducts data dependence analysis to infer the security API misuse templates and corresponding fixing operations. Based on the inferred information, given a program, SEADER performs inter-procedural static analysis to search for any security API misuse and to propose customized fixing suggestions for those vulnerabilities. To evaluate SEADER, we applied it to 25 code pairs, and SEADER successfully inferred 18 unique API misuse templates and related fixes. With these vulnerability repair patterns, we further applied SEADER to 10 open-source projects that contain in total 32 known vulnerabilities. Our experiment shows that SEADER detected vulnerabilities with 100% precision, 84% recall, and 91% accuracy. Additionally, we applied SEADER to 100 Apache open-source projects and detected 988 vulnerabilities; SEADER always customized repair suggestions correctly. Based on SEADER's outputs, we filed 60 pull requests. Up till now, developers of 18 projects have offered positive feedbacks on SEADER's suggestions. Our results indicate that SEADER can effectively help developers detect and fix security API misuses. Whereas prior work either detects API misuses or suggests simple fixes, SEADER is the first tool to do both for nontrivial vulnerability repairs.

cs.CR↗

On stochastic gradient Langevin dynamics with dependent data streams: the fully non-convex case

We consider the problem of sampling from a target distribution, which is \emph {not necessarily logconcave}, in the context of empirical risk minimization and stochastic optimization as presented in Raginsky et al. (2017). Non-asymptotic analysis results are established in the $L^1$-Wasserstein distance for the behaviour of Stochastic Gradient Langevin Dynamics (SGLD) algorithms. We allow the estimation of gradients to be performed even in the presence of \emph{dependent} data streams. Our convergence estimates are sharper and \emph{uniform} in the number of iterations, in contrast to those in previous studies.

math.ST↗

Consensus-Aware Visual-Semantic Embedding for Image-Text Matching

Image-text matching plays a central role in bridging vision and language. Most existing approaches only rely on the image-text instance pair to learn their representations, thereby exploiting their matching relationships and making the corresponding alignments. Such approaches only exploit the superficial associations contained in the instance pairwise data, with no consideration of any external commonsense knowledge, which may hinder their capabilities to reason the higher-level relationships between image and text. In this paper, we propose a Consensus-aware Visual-Semantic Embedding (CVSE) model to incorporate the consensus information, namely the commonsense knowledge shared between both modalities, into image-text matching. Specifically, the consensus information is exploited by computing the statistical co-occurrence correlations between the semantic concepts from the image captioning corpus and deploying the constructed concept correlation graph to yield the consensus-aware concept (CAC) representations. Afterwards, CVSE learns the associations and alignments between image and text based on the exploited consensus as well as the instance-level representations for both modalities. Extensive experiments conducted on two public datasets verify that the exploited consensus makes significant contributions to constructing more meaningful visual-semantic embeddings, with the superior performances over the state-of-the-art approaches on the bidirectional image and text retrieval task. Our code of this paper is available at: https://github.com/BruceW91/CVSE.

cs.CV↗

Similarity Reasoning and Filtration for Image-Text Matching

Image-text matching plays a critical role in bridging the vision and language, and great progress has been made by exploiting the global alignment between image and sentence, or local alignments between regions and words. However, how to make the most of these alignments to infer more accurate matching scores is still underexplored. In this paper, we propose a novel Similarity Graph Reasoning and Attention Filtration (SGRAF) network for image-text matching. Specifically, the vector-based similarity representations are firstly learned to characterize the local and global alignments in a more comprehensive manner, and then the Similarity Graph Reasoning (SGR) module relying on one graph convolutional neural network is introduced to infer relation-aware similarities with both the local and global alignments. The Similarity Attention Filtration (SAF) module is further developed to integrate these alignments effectively by selectively attending on the significant and representative alignments and meanwhile casting aside the interferences of non-meaningful alignments. We demonstrate the superiority of the proposed method with achieving state-of-the-art performances on the Flickr30K and MSCOCO datasets, and the good interpretability of SGR and SAF modules with extensive qualitative experiments and analyses.

cs.CV↗

Existence and uniqueness of local weak solution of d-dimensional tropical climate model without thermal diffusion in inhomogeneous Besov space

This paper studies the existence and uniqueness of local weak solutions to the d-dimensional tropical climate model without thermal diffusion. We establish that, when $α=β\geq1$, $η=0$, any initial data $(u_{0},v_{0})\in B_{2,1}^{1+\frac{d}{2}-2α}(\mathbb{R}^{d})$ and $θ_{0}\in B_{2,1}^{1+\frac{d}{2}-α}(\mathbb{R}^{d})$ yields a unique weak solution.

math.AP↗

The common origin of the family mass hierarchy and CP violation from flavour-dependent vacuum for quarks and leptons

We rewrite the Yukawa interactions of the standard model in terms of flavour-dependent vacuum structure to address the family mass hierarchy and CP violation in both the quark sector and lepton sector. It is realized for the first time that the Lagrangian only includes the same number of degrees of freedom as phenomenological observables with no requirement of extra particles or any new symmetry. The quark and lepton mass hierarchy arises as a natural result of the close-to-flat vacuum in flavour space. The CP violation in CKM and PMNS is explained as a general quantum phase between weak gauge eigenstates and Yukawa interaction states. The mechanism is proven by reproduction of all current quark/lepton mass data and the CKM/PMNS flavour mixings.

hep-ph↗

Efficient and Effective Community Search on Large-scale Bipartite Graphs

Bipartite graphs are widely used to model relationships between two types of entities. Community search retrieves densely connected subgraphs containing a query vertex, which has been extensively studied on unipartite graphs. However, community search on bipartite graphs remains largely unexplored. Moreover, all existing cohesive subgraph models on bipartite graphs can only be applied to measure the structure cohesiveness between two sets of vertices while overlooking the edge weight in forming the community. In this paper, we study the significant (alpha, beta)-community search problem on weighted bipartite graphs. Given a query vertex q, we aim to find the significant (alpha, beta)-community R of q which adopts (alpha, beta)-core to characterize the engagement level of vertices, and maximizes the minimum edge weight (significance) within R. To support fast retrieval of R, we first retrieve the maximal connected subgraph of (alpha, beta)-core containing the query vertex (the (alpha, beta)-community), and the search space is limited to this subgraph with a much smaller size than the original graph. A novel index structure is presented which can be built in O(delta * m) time and takes O(delta * m) space where m is the number of edges in G, delta is bounded by the square root of m and is much smaller in practice. Utilizing the index, the (alpha, beta)-community can be retrieved in optimal time. To further obtain R, we develop peeling and expansion algorithms to conduct searches by shrinking from the (alpha, beta)-community and expanding from the query vertex, respectively. The experimental results on real graphs not only demonstrate the effectiveness of the significant (alpha, beta)-community model but also validate the efficiency of our query processing and indexing techniques.

cs.DB↗

Spectrality of generalized Sierpinski-type self-affine measures

For an expanding integer matrix $M\in M_2(\mathbb{Z})$ and an integer digit set $D=\{(0,0)^t,(α_1,α_2)^t,(β_1,β_2)^t\}$ with $α_1β_2-α_2β_1\neq0$, let $μ_{M,D}$ be the Sierpinski-type self-affine measure defined by $μ_{M,D}(\cdot)=\frac{1}{3}\sum_{d\in D}μ_{M,D}(M(\cdot)-d)$. In [5.36], the authors separately investigated the spectral property of the measure $μ_{M,D}$ in the case of $\det(M)\notin 3\mathbb{Z}$ or $α_1β_2-α_2β_1\notin 3\mathbb{Z}$. In this paper, we consider the remaining case where $\det(M)\in 3\mathbb{Z}$ and $α_1β_2-α_2β_1\in 3\mathbb{Z}$, and give the necessary and sufficient conditions for $μ_{M,D}$ to be a spectral measure. This completely settles the spectrality of the Sierpinski-type self-affine measure $μ_{M,D}$.

math.CA↗

The origin of the spin-orbit and pseudospin-orbit splittings' evolution in neutron drop

We found the same staggering pattern in the evolution of the spin-orbit (SO) and pseudospin-orbit (PSO) splittings in neutron drops obtained by the energy-density functional (EDF) theory using SAMi-T and SLy5 parameterizations, with and without the tensor terms respectively. This staggering evolution is similar to the results recently obtained by the relativistic Brueckner-Hartree-Fock (RBHF) theory with Bonn A potential, which was claimed to be a tensor effect. In this work, we present an intuitive but essential explanation on the origin of this staggering evolution in the Skyrme EDF theory. We found that for both the SO and PSO partners, the energy splittings mainly originate from the SO potential. The staggering evolution of both the SO and PSO splittings is mainly due to the drastic change of density while neutrons filling different single-particle orbits. The key to determine the specific staggering pattern is the strength of the neutron density gradient term and the SO density term in the SO potential, not necessarily the tensor force.

nucl-th↗

Ultra-Slow Dynamic Annealing of Neutron-induced Defects in n-type Silicon: Role of Charge Carriers

Neutron bombardments with equivalent fluence (1$\times$10$^{10}$ cm$^{-2}$) and different fluxes ($2.5\times$10$^5$ cm$^{-2}$s$^{-1}$ to $1\times$10$^7$ cm$^{-2}$s$^{-1}$) have been performed on three kinds of bipolar devices with n-type silicon as active regions. The measured increase of base currents and input bias currents are found to decrease with increasing neutron flux, implying that the strength of the dynamic annealing of divacancy defects in n-type silicon follows a positive flux dependence. Such a flux dependence is the same as that observed in ions implantation using protons, but the evident flux sensitivity in our experiment is 4 orders of magnitude lower than that of proton bombardment, despite the similarity in the masses and energies of the two particles. The huge discrepancy of flux range is attributed to the presence of vast charge carriers in proton bombardments, which strongly accelerate the dynamic annealing of defects by enhancing the diffusion velocity of Si interstitials and dissociation rate of defect clusters. Our work would contribute to the understanding of the defect annealing processes in silicon.

cond-mat.mtrl-sci↗

What Can We Learn from the Travelers Data in Detecting Disease Outbreaks -- A Case Study of the COVID-19 Epidemic

Background: Travel is a potent force in the emergence of disease. We discussed how the traveler case reports could aid in a timely detection of a disease outbreak. Methods: Using the traveler data, we estimated a few indicators of the epidemic that affected decision making and policy, including the exponential growth rate, the doubling time, and the probability of severe cases exceeding the hospital capacity, in the initial phase of the COVID-19 epidemic in multiple countries. We imputed the arrival dates when they were missing. We compared the estimates from the traveler data to the ones from domestic data. We quantitatively evaluated the influence of each case report and knowing the arrival date on the estimation. Findings: We estimated the travel origin's daily exponential growth rate and examined the date from which the growth rate was consistently above 0.1 (equivalent to doubling time < 7 days). We found those dates were very close to the dates that critical decisions were made such as city lock-downs and national emergency announcement. Using only the traveler data, if the assumed epidemic start date was relatively accurate and the traveler sample was representative of the general population, the growth rate estimated from the traveler data was consistent with the domestic data. We also discussed situations that the traveler data could lead to biased estimates. From the data influence study, we found more recent travel cases had a larger influence on each day's estimate, and the influence of each case report got smaller as more cases became available. We provided the minimum number of exported cases needed to determine whether the local epidemic growth rate was above a certain level, and developed a user-friendly Shiny App to accommodate various scenarios.

stat.AP↗

SF-GRASS: Solver-Free Graph Spectral Sparsification

Recent spectral graph sparsification techniques have shown promising performance in accelerating many numerical and graph algorithms, such as iterative methods for solving large sparse matrices, spectral partitioning of undirected graphs, vectorless verification of power/thermal grids, representation learning of large graphs, etc. However, prior spectral graph sparsification methods rely on fast Laplacian matrix solvers that are usually challenging to implement in practice. This work, for the first time, introduces a solver-free approach (SF-GRASS) for spectral graph sparsification by leveraging emerging spectral graph coarsening and graph signal processing (GSP) techniques. We introduce a local spectral embedding scheme for efficiently identifying spectrally-critical edges that are key to preserving graph spectral properties, such as the first few Laplacian eigenvalues and eigenvectors. Since the key kernel functions in SF-GRASS can be efficiently implemented using sparse-matrix-vector-multiplications (SpMVs), the proposed spectral approach is simple to implement and inherently parallel friendly. Our extensive experimental results show that the proposed method can produce a hierarchy of high-quality spectral sparsifiers in nearly-linear time for a variety of real-world, large-scale graphs and circuit networks when compared with the prior state-of-the-art spectral method.

cs.DS↗

The possibility of the secondary object in GW190814 as a neutron star

A compact object was observed with a mass $2.50-2.67~M_\odot$ by LIGO Scientific and Virgo collaborations (LVC) in GW190814, which provides a great challenge to the investigations into the supranuclear matter. To study this object, properties of neutron star are systematically calculated within the latest density-dependent relativistic mean-field (DDRMF) parameterizations, which are determined by the ground state properties of spherical nuclei. The maximum masses of neutron star calculated by DD-MEX and DD-LZ1 sets can be around $2.55~M_\odot$ with quite stiff equations of state generated by their strong repulsive contributions from vector potentials at high densities. Their maximum speeds of sound $c_s/c$ are smaller than $\sqrt{0.8}$ at the center of neutron star and the dimensionless tidal deformabilities at $1.4~M_\odot$ are less than $800$. Furthermore, the radii of $1.4 ~M_\odot$ also satisfy the constraint from the observation of mass-radius simultaneous measurements (NICER). Therefore, we conclude that one cannot exclude the possibility of the secondary object in GW190814 as a neutron star composed of hadron matter from DDRMF models.

nucl-th↗

Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs

We propose a novel cohesive subgraph model called $τ$-strengthened $(α,β)$-core (denoted as $(α,β)_τ$-core), which is the first to consider both tie strength and vertex engagement on bipartite graphs. An edge is a strong tie if contained in at least $τ$ butterflies ($2\times2$-bicliques). $(α,β)_τ$-core requires each vertex on the upper or lower level to have at least $α$ or $β$ strong ties, given strength level $τ$. To retrieve the vertices of $(α,β)_τ$-core optimally, we construct index $I_{α,β,τ}$ to store all $(α,β)_τ$-cores. Effective optimization techniques are proposed to improve index construction. To make our idea practical on large graphs, we propose 2D-indexes $I_{α,β}, I_{β,τ}$, and $I_{α,τ}$ that selectively store the vertices of $(α,β)_τ$-core for some $α,β$, and $τ$. The 2D-indexes are more space-efficient and require less construction time, each of which can support $(α,β)_τ$-core queries. As query efficiency depends on input parameters and the choice of 2D-index, we propose a learning-based hybrid computation paradigm by training a feed-forward neural network to predict the optimal choice of 2D-index that minimizes the query time. Extensive experiments show that ($1$) $(α,β)_τ$-core is an effective model capturing unique and important cohesive subgraphs; ($2$) the proposed techniques significantly improve the efficiency of index construction and query processing.

cs.SI↗

Properties of nuclear matter in relativistic Brueckner-Hartree-Fock model with high-precision charge-dependent potentials

Properties of nuclear matter are investigated in the framework of relativistic Brueckner-Hartree-Fock model with the latest high-precision charge-dependent Bonn (pvCD-Bonn) potentials, where the coupling between pion and nucleon is adopted as pseudovector form. These realistic pvCD-Bonn potentials are renormalized to effective nucleon-nucleon ($NN$) interactions, $G$ matrices. They are obtained by solving the Blankenbecler-Sugar (BbS) equation in nuclear medium. Then, the saturation properties of symmetric nuclear matter are calculated with pvCD-Bonn A, B, C potentials. The energies per nucleon are around $-10.72$ MeV to $-16.83$ MeV at saturation densities, $0.139$ fm$^{-3}$ to $0.192$ fm$^{-3}$ with these three potentials, respectively. It clearly demonstrates that the pseudovector coupling between pion and nucleon can generate reasonable saturation properties comparing with pseudoscalar coupling. Furthermore, these saturation properties have strong correlations with the tensor components of $NN$ potentials, i.e., the $D$-state probabilities of deuteron, $P_D$ to form a relativistic Coester band. In addition, the charge symmetry breaking (CSB) and charge independence breaking (CIB) effects are also discussed in nuclear matter from the partial wave contributions with these high-precision charge-dependent potentials. In general, the magnitudes of CSB from the differences between $nn$ and $pp$ potentials are about $0.05$ MeV, while those of CIB are around $0.35$ MeV from the differences between $np$ and $pp$ potentials. Finally, the equations of state of asymmetric nuclear matter are also calculated with different asymmetry parameters. It is found that the effective neutron mass is larger than the proton one in neutron-rich matter.

nucl-th↗